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;
619 VALUE branch = rb_ary_hidden_new(6);
621 rb_hash_aset(structure, key, branch);
623 rb_ary_push(branch,
INT2FIX(first_lineno));
624 rb_ary_push(branch,
INT2FIX(first_column));
625 rb_ary_push(branch,
INT2FIX(last_lineno));
626 rb_ary_push(branch,
INT2FIX(last_column));
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();
651 rb_ary_push(branch_base, branches);
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);
690 rb_ary_push(branch,
LONG2FIX(counter_idx));
691 rb_ary_push(counters,
INT2FIX(0));
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);
1446 VM_ASSERT(argc >= 0);
1449 flag |= VM_CALL_KWARG;
1450 argc += kw_arg->keyword_len;
1453 if (!(flag & (VM_CALL_ARGS_SPLAT | VM_CALL_ARGS_BLOCKARG | VM_CALL_KWARG | VM_CALL_KW_SPLAT | VM_CALL_FORWARDING))
1454 && !has_blockiseq) {
1455 flag |= VM_CALL_ARGS_SIMPLE;
1458 ISEQ_BODY(iseq)->ci_size++;
1459 const struct rb_callinfo *ci = vm_ci_new(mid, flag, argc, kw_arg);
1467 VALUE *operands = compile_data_calloc2(iseq,
sizeof(
VALUE), 2);
1470 operands[1] = (
VALUE)blockiseq;
1477 if (vm_ci_flag((
struct rb_callinfo *)ci) & VM_CALL_FORWARDING) {
1478 insn = new_insn_core(iseq, line_no, node_id, BIN(sendforward), 2, operands);
1481 insn = new_insn_core(iseq, line_no, node_id, BIN(send), 2, operands);
1494 VALUE ast_value = rb_ruby_ast_new(node);
1496 debugs(
"[new_child_iseq]> ---------------------------------------\n");
1497 int isolated_depth = ISEQ_COMPILE_DATA(iseq)->isolated_depth;
1498 ret_iseq = rb_iseq_new_with_opt(ast_value, name,
1499 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
1501 isolated_depth ? isolated_depth + 1 : 0,
1502 type, ISEQ_COMPILE_DATA(iseq)->option,
1503 ISEQ_BODY(iseq)->variable.script_lines);
1504 debugs(
"[new_child_iseq]< ---------------------------------------\n");
1514 debugs(
"[new_child_iseq_with_callback]> ---------------------------------------\n");
1515 ret_iseq = rb_iseq_new_with_callback(ifunc, name,
1516 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
1517 line_no, parent,
type, ISEQ_COMPILE_DATA(iseq)->option);
1518 debugs(
"[new_child_iseq_with_callback]< ---------------------------------------\n");
1526 ISEQ_COMPILE_DATA(iseq)->catch_except_p =
true;
1527 if (ISEQ_BODY(iseq)->parent_iseq != NULL) {
1528 if (ISEQ_COMPILE_DATA(ISEQ_BODY(iseq)->parent_iseq)) {
1529 set_catch_except_p((
rb_iseq_t *) ISEQ_BODY(iseq)->parent_iseq);
1552 while (pos < body->iseq_size) {
1553 insn = rb_vm_insn_decode(body->iseq_encoded[pos]);
1554 if (insn == BIN(
throw)) {
1555 set_catch_except_p(iseq);
1558 pos += insn_len(insn);
1564 for (i = 0; i < ct->size; i++) {
1566 UNALIGNED_MEMBER_PTR(ct, entries[i]);
1567 if (entry->type != CATCH_TYPE_BREAK
1568 && entry->type != CATCH_TYPE_NEXT
1569 && entry->type != CATCH_TYPE_REDO) {
1571 ISEQ_COMPILE_DATA(iseq)->catch_except_p =
true;
1578iseq_insert_nop_between_end_and_cont(
rb_iseq_t *iseq)
1580 VALUE catch_table_ary = ISEQ_COMPILE_DATA(iseq)->catch_table_ary;
1581 if (
NIL_P(catch_table_ary))
return;
1582 unsigned int i, tlen = (
unsigned int)
RARRAY_LEN(catch_table_ary);
1584 for (i = 0; i < tlen; i++) {
1590 enum rb_catch_type ct = (
enum rb_catch_type)(ptr[0] & 0xffff);
1592 if (ct != CATCH_TYPE_BREAK
1593 && ct != CATCH_TYPE_NEXT
1594 && ct != CATCH_TYPE_REDO) {
1596 for (e = end; e && (IS_LABEL(e) || IS_TRACE(e)); e = e->next) {
1598 INSN *nop = new_insn_core(iseq, 0, -1, BIN(nop), 0, 0);
1599 ELEM_INSERT_NEXT(end, &nop->link);
1612 if (
RTEST(ISEQ_COMPILE_DATA(iseq)->err_info))
1617 if (compile_debug > 5)
1618 dump_disasm_list(FIRST_ELEMENT(anchor));
1620 debugs(
"[compile step 3.1 (iseq_optimize)]\n");
1621 iseq_optimize(iseq, anchor);
1623 if (compile_debug > 5)
1624 dump_disasm_list(FIRST_ELEMENT(anchor));
1626 if (ISEQ_COMPILE_DATA(iseq)->option->instructions_unification) {
1627 debugs(
"[compile step 3.2 (iseq_insns_unification)]\n");
1628 iseq_insns_unification(iseq, anchor);
1629 if (compile_debug > 5)
1630 dump_disasm_list(FIRST_ELEMENT(anchor));
1633 debugs(
"[compile step 3.4 (iseq_insert_nop_between_end_and_cont)]\n");
1634 iseq_insert_nop_between_end_and_cont(iseq);
1635 if (compile_debug > 5)
1636 dump_disasm_list(FIRST_ELEMENT(anchor));
1644 if (
RTEST(ISEQ_COMPILE_DATA(iseq)->err_info))
1647 debugs(
"[compile step 4.1 (iseq_set_sequence)]\n");
1648 if (!iseq_set_sequence(iseq, anchor))
return COMPILE_NG;
1649 if (compile_debug > 5)
1650 dump_disasm_list(FIRST_ELEMENT(anchor));
1652 debugs(
"[compile step 4.2 (iseq_set_exception_table)]\n");
1653 if (!iseq_set_exception_table(iseq))
return COMPILE_NG;
1655 debugs(
"[compile step 4.3 (set_optargs_table)] \n");
1656 if (!iseq_set_optargs_table(iseq))
return COMPILE_NG;
1658 debugs(
"[compile step 5 (iseq_translate_threaded_code)] \n");
1659 if (!rb_iseq_translate_threaded_code(iseq))
return COMPILE_NG;
1661 debugs(
"[compile step 6 (update_catch_except_flags)] \n");
1663 update_catch_except_flags(iseq, ISEQ_BODY(iseq));
1665 debugs(
"[compile step 6.1 (remove unused catch tables)] \n");
1667 if (!ISEQ_COMPILE_DATA(iseq)->catch_except_p && ISEQ_BODY(iseq)->catch_table) {
1668 xfree(ISEQ_BODY(iseq)->catch_table);
1669 ISEQ_BODY(iseq)->catch_table = NULL;
1672#if VM_INSN_INFO_TABLE_IMPL == 2
1673 if (ISEQ_BODY(iseq)->insns_info.succ_index_table == NULL) {
1674 debugs(
"[compile step 7 (rb_iseq_insns_info_encode_positions)] \n");
1675 rb_iseq_insns_info_encode_positions(iseq);
1679 if (compile_debug > 1) {
1680 VALUE str = rb_iseq_disasm(iseq);
1683 verify_call_cache(iseq);
1684 debugs(
"[compile step: finish]\n");
1690iseq_set_exception_local_table(
rb_iseq_t *iseq)
1692 ISEQ_BODY(iseq)->local_table_size = numberof(rb_iseq_shared_exc_local_tbl);
1693 ISEQ_BODY(iseq)->local_table = rb_iseq_shared_exc_local_tbl;
1701 while (iseq != ISEQ_BODY(iseq)->local_iseq) {
1703 iseq = ISEQ_BODY(iseq)->parent_iseq;
1709get_dyna_var_idx_at_raw(
const rb_iseq_t *iseq,
ID id)
1713 for (i = 0; i < ISEQ_BODY(iseq)->local_table_size; i++) {
1714 if (ISEQ_BODY(iseq)->local_table[i] == id) {
1724 int idx = get_dyna_var_idx_at_raw(ISEQ_BODY(iseq)->local_iseq,
id);
1727 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
1728 "get_local_var_idx: %d", idx);
1735get_dyna_var_idx(
const rb_iseq_t *iseq,
ID id,
int *level,
int *ls)
1737 int lv = 0, idx = -1;
1738 const rb_iseq_t *
const topmost_iseq = iseq;
1741 idx = get_dyna_var_idx_at_raw(iseq,
id);
1745 iseq = ISEQ_BODY(iseq)->parent_iseq;
1750 COMPILE_ERROR(topmost_iseq, ISEQ_LAST_LINE(topmost_iseq),
1751 "get_dyna_var_idx: -1");
1755 *ls = ISEQ_BODY(iseq)->local_table_size;
1760iseq_local_block_param_p(
const rb_iseq_t *iseq,
unsigned int idx,
unsigned int level)
1764 iseq = ISEQ_BODY(iseq)->parent_iseq;
1767 body = ISEQ_BODY(iseq);
1768 if (body->local_iseq == iseq &&
1769 body->
param.flags.has_block &&
1770 body->local_table_size - body->
param.block_start == idx) {
1779iseq_block_param_id_p(
const rb_iseq_t *iseq,
ID id,
int *pidx,
int *plevel)
1782 int idx = get_dyna_var_idx(iseq,
id, &level, &ls);
1783 if (iseq_local_block_param_p(iseq, ls - idx, level)) {
1794access_outer_variables(
const rb_iseq_t *iseq,
int level,
ID id,
bool write)
1796 int isolated_depth = ISEQ_COMPILE_DATA(iseq)->isolated_depth;
1798 if (isolated_depth && level >= isolated_depth) {
1799 if (
id == rb_intern(
"yield")) {
1800 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
"can not yield from isolated Proc");
1803 COMPILE_ERROR(iseq, ISEQ_LAST_LINE(iseq),
"can not access variable '%s' from isolated Proc", rb_id2name(
id));
1807 for (
int i=0; i<level; i++) {
1809 struct rb_id_table *ovs = ISEQ_BODY(iseq)->outer_variables;
1812 ovs = ISEQ_BODY(iseq)->outer_variables = rb_id_table_create(8);
1815 if (rb_id_table_lookup(ISEQ_BODY(iseq)->outer_variables,
id, &val)) {
1816 if (write && !val) {
1817 rb_id_table_insert(ISEQ_BODY(iseq)->outer_variables,
id,
Qtrue);
1821 rb_id_table_insert(ISEQ_BODY(iseq)->outer_variables,
id, RBOOL(write));
1824 iseq = ISEQ_BODY(iseq)->parent_iseq;
1829iseq_lvar_id(
const rb_iseq_t *iseq,
int idx,
int level)
1831 for (
int i=0; i<level; i++) {
1832 iseq = ISEQ_BODY(iseq)->parent_iseq;
1835 ID id = ISEQ_BODY(iseq)->local_table[ISEQ_BODY(iseq)->local_table_size - idx];
1843 if (iseq_local_block_param_p(iseq, idx, level)) {
1844 ADD_INSN2(seq, line_node, getblockparam,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1847 ADD_INSN2(seq, line_node, getlocal,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1849 if (level > 0) access_outer_variables(iseq, level, iseq_lvar_id(iseq, idx, level),
Qfalse);
1855 if (iseq_local_block_param_p(iseq, idx, level)) {
1856 ADD_INSN2(seq, line_node, setblockparam,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1859 ADD_INSN2(seq, line_node, setlocal,
INT2FIX((idx) + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
1861 if (level > 0) access_outer_variables(iseq, level, iseq_lvar_id(iseq, idx, level),
Qtrue);
1870 if (body->
param.flags.has_opt ||
1871 body->
param.flags.has_post ||
1872 body->
param.flags.has_rest ||
1873 body->
param.flags.has_block ||
1874 body->
param.flags.has_kw ||
1875 body->
param.flags.has_kwrest) {
1877 if (body->
param.flags.has_block) {
1878 body->
param.size = body->
param.block_start + 1;
1880 else if (body->
param.flags.has_kwrest) {
1881 body->
param.size = body->
param.keyword->rest_start + 1;
1883 else if (body->
param.flags.has_kw) {
1884 body->
param.size = body->
param.keyword->bits_start + 1;
1886 else if (body->
param.flags.has_post) {
1889 else if (body->
param.flags.has_rest) {
1890 body->
param.size = body->
param.rest_start + 1;
1892 else if (body->
param.flags.has_opt) {
1910 struct rb_iseq_param_keyword *keyword;
1911 const VALUE default_values = rb_ary_hidden_new(1);
1913 int kw = 0, rkw = 0, di = 0, i;
1915 body->
param.flags.has_kw = TRUE;
1916 body->
param.keyword = keyword =
ZALLOC_N(
struct rb_iseq_param_keyword, 1);
1920 node = node->nd_next;
1923 keyword->bits_start = arg_size++;
1925 node = args->kw_args;
1927 const NODE *val_node = get_nd_value(node->nd_body);
1930 if (val_node == NODE_SPECIAL_REQUIRED_KEYWORD) {
1934 switch (nd_type(val_node)) {
1936 dv = rb_node_sym_string_val(val_node);
1939 dv = rb_node_regx_string_val(val_node);
1942 dv = rb_node_line_lineno_val(val_node);
1945 dv = rb_node_integer_literal_val(val_node);
1948 dv = rb_node_float_literal_val(val_node);
1951 dv = rb_node_rational_literal_val(val_node);
1953 case NODE_IMAGINARY:
1954 dv = rb_node_imaginary_literal_val(val_node);
1957 dv = rb_node_encoding_val(val_node);
1969 NO_CHECK(COMPILE_POPPED(optargs,
"kwarg", RNODE(node)));
1973 keyword->num = ++di;
1974 rb_ary_push(default_values, dv);
1977 node = node->nd_next;
1982 if (RNODE_DVAR(args->kw_rest_arg)->nd_vid != 0) {
1983 ID kw_id = ISEQ_BODY(iseq)->local_table[arg_size];
1984 keyword->rest_start = arg_size++;
1985 body->
param.flags.has_kwrest = TRUE;
1987 if (kw_id == idPow) body->
param.flags.anon_kwrest = TRUE;
1989 keyword->required_num = rkw;
1990 keyword->table = &body->local_table[keyword->bits_start - keyword->num];
1995 for (i = 0; i <
RARRAY_LEN(default_values); i++) {
1997 if (dv == complex_mark) dv =
Qundef;
2001 keyword->default_values = dvs;
2010 if (!body->
param.flags.use_block) {
2011 body->
param.flags.use_block = 1;
2016 st_data_t key = (st_data_t)rb_intern_str(body->location.label);
2017 st_insert(vm->unused_block_warning_table, key, 1);
2025 debugs(
"iseq_set_arguments: %s\n", node_args ?
"" :
"0");
2029 struct rb_args_info *args = &RNODE_ARGS(node_args)->nd_ainfo;
2035 EXPECT_NODE(
"iseq_set_arguments", node_args, NODE_ARGS, COMPILE_NG);
2037 body->
param.flags.ruby2_keywords = args->ruby2_keywords;
2038 body->
param.lead_num = arg_size = (int)args->pre_args_num;
2039 if (body->
param.lead_num > 0) body->
param.flags.has_lead = TRUE;
2040 debugs(
" - argc: %d\n", body->
param.lead_num);
2042 rest_id = args->rest_arg;
2043 if (rest_id == NODE_SPECIAL_EXCESSIVE_COMMA) {
2047 block_id = args->block_arg;
2049 bool optimized_forward = (args->forwarding && args->pre_args_num == 0 && !args->opt_args);
2051 if (optimized_forward) {
2056 if (args->opt_args) {
2059 VALUE labels = rb_ary_hidden_new(1);
2064 label = NEW_LABEL(nd_line(RNODE(node)));
2065 rb_ary_push(labels, (
VALUE)label | 1);
2066 ADD_LABEL(optargs, label);
2067 NO_CHECK(COMPILE_POPPED(optargs,
"optarg", node->nd_body));
2068 node = node->nd_next;
2073 label = NEW_LABEL(nd_line(node_args));
2074 rb_ary_push(labels, (
VALUE)label | 1);
2075 ADD_LABEL(optargs, label);
2080 for (j = 0; j < i+1; j++) {
2083 rb_ary_clear(labels);
2085 body->
param.flags.has_opt = TRUE;
2086 body->
param.opt_num = i;
2087 body->
param.opt_table = opt_table;
2092 body->
param.rest_start = arg_size++;
2093 body->
param.flags.has_rest = TRUE;
2094 if (rest_id ==
'*') body->
param.flags.anon_rest = TRUE;
2098 if (args->first_post_arg) {
2099 body->
param.post_start = arg_size;
2100 body->
param.post_num = args->post_args_num;
2101 body->
param.flags.has_post = TRUE;
2102 arg_size += args->post_args_num;
2104 if (body->
param.flags.has_rest) {
2105 body->
param.post_start = body->
param.rest_start + 1;
2109 if (args->kw_args) {
2110 arg_size = iseq_set_arguments_keywords(iseq, optargs, args, arg_size);
2112 else if (args->kw_rest_arg && !optimized_forward) {
2113 ID kw_id = ISEQ_BODY(iseq)->local_table[arg_size];
2114 struct rb_iseq_param_keyword *keyword =
ZALLOC_N(
struct rb_iseq_param_keyword, 1);
2115 keyword->rest_start = arg_size++;
2116 body->
param.keyword = keyword;
2117 body->
param.flags.has_kwrest = TRUE;
2119 static ID anon_kwrest = 0;
2120 if (!anon_kwrest) anon_kwrest = rb_intern(
"**");
2121 if (kw_id == anon_kwrest) body->
param.flags.anon_kwrest = TRUE;
2123 else if (args->no_kwarg) {
2124 body->
param.flags.accepts_no_kwarg = TRUE;
2128 body->
param.block_start = arg_size++;
2129 body->
param.flags.has_block = TRUE;
2130 iseq_set_use_block(iseq);
2134 if (optimized_forward) {
2135 body->
param.flags.use_block = 1;
2136 body->
param.flags.forwardable = TRUE;
2140 iseq_calc_param_size(iseq);
2141 body->
param.size = arg_size;
2143 if (args->pre_init) {
2144 NO_CHECK(COMPILE_POPPED(optargs,
"init arguments (m)", args->pre_init));
2146 if (args->post_init) {
2147 NO_CHECK(COMPILE_POPPED(optargs,
"init arguments (p)", args->post_init));
2150 if (body->type == ISEQ_TYPE_BLOCK) {
2151 if (body->
param.flags.has_opt == FALSE &&
2152 body->
param.flags.has_post == FALSE &&
2153 body->
param.flags.has_rest == FALSE &&
2154 body->
param.flags.has_kw == FALSE &&
2155 body->
param.flags.has_kwrest == FALSE) {
2157 if (body->
param.lead_num == 1 && last_comma == 0) {
2159 body->
param.flags.ambiguous_param0 = TRUE;
2171 unsigned int size = tbl ? tbl->size : 0;
2172 unsigned int offset = 0;
2175 struct rb_args_info *args = &RNODE_ARGS(node_args)->nd_ainfo;
2180 if (args->forwarding && args->pre_args_num == 0 && !args->opt_args) {
2188 MEMCPY(ids, tbl->ids + offset,
ID, size);
2189 ISEQ_BODY(iseq)->local_table = ids;
2191 ISEQ_BODY(iseq)->local_table_size = size;
2193 debugs(
"iseq_set_local_table: %u\n", ISEQ_BODY(iseq)->local_table_size);
2205 else if ((tlit = OBJ_BUILTIN_TYPE(lit)) == -1) {
2208 else if ((tval = OBJ_BUILTIN_TYPE(val)) == -1) {
2211 else if (tlit != tval) {
2221 long x =
FIX2LONG(rb_big_cmp(lit, val));
2229 return rb_float_cmp(lit, val);
2232 const struct RRational *rat1 = RRATIONAL(val);
2233 const struct RRational *rat2 = RRATIONAL(lit);
2234 return rb_iseq_cdhash_cmp(rat1->num, rat2->num) || rb_iseq_cdhash_cmp(rat1->den, rat2->den);
2237 const struct RComplex *comp1 = RCOMPLEX(val);
2238 const struct RComplex *comp2 = RCOMPLEX(lit);
2239 return rb_iseq_cdhash_cmp(comp1->real, comp2->real) || rb_iseq_cdhash_cmp(comp1->imag, comp2->imag);
2242 return rb_reg_equal(val, lit) ? 0 : -1;
2250rb_iseq_cdhash_hash(
VALUE a)
2252 switch (OBJ_BUILTIN_TYPE(a)) {
2255 return (st_index_t)a;
2263 return rb_rational_hash(a);
2265 return rb_complex_hash(a);
2275 rb_iseq_cdhash_hash,
2289 rb_hash_aset(data->hash, key,
INT2FIX(lobj->position - (data->pos+data->len)));
2297 return INT2FIX(ISEQ_BODY(iseq)->ivc_size++);
2304 struct rb_id_table *tbl = ISEQ_COMPILE_DATA(iseq)->ivar_cache_table;
2306 if (rb_id_table_lookup(tbl,
id,&val)) {
2311 tbl = rb_id_table_create(1);
2312 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = tbl;
2314 val =
INT2FIX(ISEQ_BODY(iseq)->icvarc_size++);
2315 rb_id_table_insert(tbl,
id,val);
2319#define BADINSN_DUMP(anchor, list, dest) \
2320 dump_disasm_list_with_cursor(FIRST_ELEMENT(anchor), list, dest)
2322#define BADINSN_ERROR \
2323 (xfree(generated_iseq), \
2324 xfree(insns_info), \
2325 BADINSN_DUMP(anchor, list, NULL), \
2331 int stack_max = 0, sp = 0, line = 0;
2334 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2335 if (IS_LABEL(list)) {
2341 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2342 switch (list->type) {
2343 case ISEQ_ELEMENT_INSN:
2351 sp = calc_sp_depth(sp, iobj);
2353 BADINSN_DUMP(anchor, list, NULL);
2354 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2355 "argument stack underflow (%d)", sp);
2358 if (sp > stack_max) {
2362 line = iobj->insn_info.line_no;
2364 operands = iobj->operands;
2365 insn = iobj->insn_id;
2366 types = insn_op_types(insn);
2367 len = insn_len(insn);
2370 if (iobj->operand_size !=
len - 1) {
2372 BADINSN_DUMP(anchor, list, NULL);
2373 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2374 "operand size miss! (%d for %d)",
2375 iobj->operand_size,
len - 1);
2379 for (j = 0; types[j]; j++) {
2380 if (types[j] == TS_OFFSET) {
2384 BADINSN_DUMP(anchor, list, NULL);
2385 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2386 "unknown label: "LABEL_FORMAT, lobj->label_no);
2389 if (lobj->sp == -1) {
2392 else if (lobj->sp != sp) {
2393 debugs(
"%s:%d: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2394 RSTRING_PTR(rb_iseq_path(iseq)), line,
2395 lobj->label_no, lobj->sp, sp);
2401 case ISEQ_ELEMENT_LABEL:
2404 if (lobj->sp == -1) {
2408 if (lobj->sp != sp) {
2409 debugs(
"%s:%d: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2410 RSTRING_PTR(rb_iseq_path(iseq)), line,
2411 lobj->label_no, lobj->sp, sp);
2417 case ISEQ_ELEMENT_TRACE:
2422 case ISEQ_ELEMENT_ADJUST:
2427 sp = adjust->label ? adjust->label->sp : 0;
2428 if (adjust->line_no != -1 && orig_sp - sp < 0) {
2429 BADINSN_DUMP(anchor, list, NULL);
2430 COMPILE_ERROR(iseq, adjust->line_no,
2431 "iseq_set_sequence: adjust bug %d < %d",
2438 BADINSN_DUMP(anchor, list, NULL);
2439 COMPILE_ERROR(iseq, line,
"unknown list type: %d", list->type);
2448 int insns_info_index,
int code_index,
const INSN *iobj)
2450 if (insns_info_index == 0 ||
2451 insns_info[insns_info_index-1].line_no != iobj->insn_info.line_no ||
2452#ifdef USE_ISEQ_NODE_ID
2453 insns_info[insns_info_index-1].node_id != iobj->insn_info.node_id ||
2455 insns_info[insns_info_index-1].events != iobj->insn_info.events) {
2456 insns_info[insns_info_index].line_no = iobj->insn_info.line_no;
2457#ifdef USE_ISEQ_NODE_ID
2458 insns_info[insns_info_index].node_id = iobj->insn_info.node_id;
2460 insns_info[insns_info_index].events = iobj->insn_info.events;
2461 positions[insns_info_index] = code_index;
2469 int insns_info_index,
int code_index,
const ADJUST *adjust)
2471 insns_info[insns_info_index].line_no = adjust->line_no;
2472 insns_info[insns_info_index].node_id = -1;
2473 insns_info[insns_info_index].events = 0;
2474 positions[insns_info_index] = code_index;
2479array_to_idlist(
VALUE arr)
2484 for (
int i = 0; i < size; i++) {
2493idlist_to_array(
const ID *ids)
2495 VALUE arr = rb_ary_new();
2497 rb_ary_push(arr,
ID2SYM(*ids++));
2510 unsigned int *positions;
2512 VALUE *generated_iseq;
2516 int insn_num, code_index, insns_info_index, sp = 0;
2517 int stack_max = fix_sp_depth(iseq, anchor);
2519 if (stack_max < 0)
return COMPILE_NG;
2522 insn_num = code_index = 0;
2523 for (list = FIRST_ELEMENT(anchor); list; list = list->next) {
2524 switch (list->type) {
2525 case ISEQ_ELEMENT_INSN:
2529 sp = calc_sp_depth(sp, iobj);
2531 events = iobj->insn_info.events |= events;
2532 if (ISEQ_COVERAGE(iseq)) {
2533 if (ISEQ_LINE_COVERAGE(iseq) && (events & RUBY_EVENT_COVERAGE_LINE) &&
2534 !(rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES)) {
2535 int line = iobj->insn_info.line_no - 1;
2536 if (line >= 0 && line <
RARRAY_LEN(ISEQ_LINE_COVERAGE(iseq))) {
2540 if (ISEQ_BRANCH_COVERAGE(iseq) && (events & RUBY_EVENT_COVERAGE_BRANCH)) {
2541 while (
RARRAY_LEN(ISEQ_PC2BRANCHINDEX(iseq)) <= code_index) {
2542 rb_ary_push(ISEQ_PC2BRANCHINDEX(iseq),
Qnil);
2547 code_index += insn_data_length(iobj);
2552 case ISEQ_ELEMENT_LABEL:
2555 lobj->position = code_index;
2556 if (lobj->sp != sp) {
2557 debugs(
"%s: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2558 RSTRING_PTR(rb_iseq_path(iseq)),
2559 lobj->label_no, lobj->sp, sp);
2564 case ISEQ_ELEMENT_TRACE:
2567 events |= trace->event;
2568 if (trace->event & RUBY_EVENT_COVERAGE_BRANCH) data = trace->data;
2571 case ISEQ_ELEMENT_ADJUST:
2574 if (adjust->line_no != -1) {
2576 sp = adjust->label ? adjust->label->sp : 0;
2577 if (orig_sp - sp > 0) {
2578 if (orig_sp - sp > 1) code_index++;
2592 positions =
ALLOC_N(
unsigned int, insn_num);
2593 if (ISEQ_IS_SIZE(body)) {
2597 body->is_entries = NULL;
2600 if (body->ci_size) {
2604 body->call_data = NULL;
2606 ISEQ_COMPILE_DATA(iseq)->ci_index = 0;
2613 iseq_bits_t * mark_offset_bits;
2614 int code_size = code_index;
2616 bool needs_bitmap =
false;
2618 if (ISEQ_MBITS_BUFLEN(code_index) == 1) {
2619 mark_offset_bits = &ISEQ_COMPILE_DATA(iseq)->mark_bits.single;
2620 ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit =
true;
2623 mark_offset_bits =
ZALLOC_N(iseq_bits_t, ISEQ_MBITS_BUFLEN(code_index));
2624 ISEQ_COMPILE_DATA(iseq)->mark_bits.list = mark_offset_bits;
2625 ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit =
false;
2628 ISEQ_COMPILE_DATA(iseq)->iseq_encoded = (
void *)generated_iseq;
2629 ISEQ_COMPILE_DATA(iseq)->iseq_size = code_index;
2631 list = FIRST_ELEMENT(anchor);
2632 insns_info_index = code_index = sp = 0;
2635 switch (list->type) {
2636 case ISEQ_ELEMENT_INSN:
2644 sp = calc_sp_depth(sp, iobj);
2646 operands = iobj->operands;
2647 insn = iobj->insn_id;
2648 generated_iseq[code_index] = insn;
2649 types = insn_op_types(insn);
2650 len = insn_len(insn);
2652 for (j = 0; types[j]; j++) {
2653 char type = types[j];
2661 generated_iseq[code_index + 1 + j] = lobj->position - (code_index +
len);
2666 VALUE map = operands[j];
2669 data.pos = code_index;
2673 rb_hash_rehash(map);
2674 freeze_hide_obj(map);
2675 generated_iseq[code_index + 1 + j] = map;
2676 ISEQ_MBITS_SET(mark_offset_bits, code_index + 1 + j);
2678 needs_bitmap =
true;
2683 generated_iseq[code_index + 1 + j] =
FIX2INT(operands[j]);
2688 VALUE v = operands[j];
2689 generated_iseq[code_index + 1 + j] = v;
2693 ISEQ_MBITS_SET(mark_offset_bits, code_index + 1 + j);
2694 needs_bitmap =
true;
2701 unsigned int ic_index = ISEQ_COMPILE_DATA(iseq)->ic_index++;
2702 IC ic = &ISEQ_IS_ENTRY_START(body,
type)[ic_index].ic_cache;
2703 if (UNLIKELY(ic_index >= body->ic_size)) {
2704 BADINSN_DUMP(anchor, &iobj->link, 0);
2705 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2706 "iseq_set_sequence: ic_index overflow: index: %d, size: %d",
2707 ic_index, ISEQ_IS_SIZE(body));
2710 ic->
segments = array_to_idlist(operands[j]);
2712 generated_iseq[code_index + 1 + j] = (
VALUE)ic;
2717 unsigned int ic_index =
FIX2UINT(operands[j]);
2719 IVC cache = ((
IVC)&body->is_entries[ic_index]);
2721 if (insn == BIN(setinstancevariable)) {
2722 cache->iv_set_name =
SYM2ID(operands[j - 1]);
2725 cache->iv_set_name = 0;
2728 vm_ic_attr_index_initialize(cache, INVALID_SHAPE_ID);
2733 unsigned int ic_index =
FIX2UINT(operands[j]);
2734 IC ic = &ISEQ_IS_ENTRY_START(body,
type)[ic_index].ic_cache;
2735 if (UNLIKELY(ic_index >= ISEQ_IS_SIZE(body))) {
2736 BADINSN_DUMP(anchor, &iobj->link, 0);
2737 COMPILE_ERROR(iseq, iobj->insn_info.line_no,
2738 "iseq_set_sequence: ic_index overflow: index: %d, size: %d",
2739 ic_index, ISEQ_IS_SIZE(body));
2741 generated_iseq[code_index + 1 + j] = (
VALUE)ic;
2748 RUBY_ASSERT(ISEQ_COMPILE_DATA(iseq)->ci_index <= body->ci_size);
2749 struct rb_call_data *cd = &body->call_data[ISEQ_COMPILE_DATA(iseq)->ci_index++];
2751 cd->cc = vm_cc_empty();
2752 generated_iseq[code_index + 1 + j] = (
VALUE)cd;
2756 generated_iseq[code_index + 1 + j] =
SYM2ID(operands[j]);
2759 generated_iseq[code_index + 1 + j] = operands[j];
2762 generated_iseq[code_index + 1 + j] = operands[j];
2765 BADINSN_ERROR(iseq, iobj->insn_info.line_no,
2766 "unknown operand type: %c",
type);
2770 if (add_insn_info(insns_info, positions, insns_info_index, code_index, iobj)) insns_info_index++;
2774 case ISEQ_ELEMENT_LABEL:
2777 if (lobj->sp != sp) {
2778 debugs(
"%s: sp inconsistency found but ignored (" LABEL_FORMAT
" sp: %d, calculated sp: %d)\n",
2779 RSTRING_PTR(rb_iseq_path(iseq)),
2780 lobj->label_no, lobj->sp, sp);
2785 case ISEQ_ELEMENT_ADJUST:
2790 if (adjust->label) {
2791 sp = adjust->label->sp;
2797 if (adjust->line_no != -1) {
2798 const int diff = orig_sp - sp;
2800 if (insns_info_index == 0) {
2801 COMPILE_ERROR(iseq, adjust->line_no,
2802 "iseq_set_sequence: adjust bug (ISEQ_ELEMENT_ADJUST must not be the first in iseq)");
2804 if (add_adjust_info(insns_info, positions, insns_info_index, code_index, adjust)) insns_info_index++;
2807 generated_iseq[code_index++] = BIN(adjuststack);
2808 generated_iseq[code_index++] = orig_sp - sp;
2810 else if (diff == 1) {
2811 generated_iseq[code_index++] = BIN(pop);
2813 else if (diff < 0) {
2814 int label_no = adjust->label ? adjust->label->label_no : -1;
2815 xfree(generated_iseq);
2818 if (ISEQ_MBITS_BUFLEN(code_size) > 1) {
2819 xfree(mark_offset_bits);
2821 debug_list(anchor, list);
2822 COMPILE_ERROR(iseq, adjust->line_no,
2823 "iseq_set_sequence: adjust bug to %d %d < %d",
2824 label_no, orig_sp, sp);
2837 body->iseq_encoded = (
void *)generated_iseq;
2838 body->iseq_size = code_index;
2839 body->stack_max = stack_max;
2841 if (ISEQ_COMPILE_DATA(iseq)->is_single_mark_bit) {
2842 body->mark_bits.single = ISEQ_COMPILE_DATA(iseq)->mark_bits.single;
2846 body->mark_bits.list = mark_offset_bits;
2849 body->mark_bits.list = NULL;
2850 ISEQ_COMPILE_DATA(iseq)->mark_bits.list = NULL;
2851 ruby_xfree(mark_offset_bits);
2856 body->insns_info.body = insns_info;
2857 body->insns_info.positions = positions;
2860 body->insns_info.body = insns_info;
2861 REALLOC_N(positions,
unsigned int, insns_info_index);
2862 body->insns_info.positions = positions;
2863 body->insns_info.size = insns_info_index;
2869label_get_position(
LABEL *lobj)
2871 return lobj->position;
2875label_get_sp(
LABEL *lobj)
2881iseq_set_exception_table(
rb_iseq_t *iseq)
2883 const VALUE *tptr, *ptr;
2884 unsigned int tlen, i;
2887 ISEQ_BODY(iseq)->catch_table = NULL;
2889 VALUE catch_table_ary = ISEQ_COMPILE_DATA(iseq)->catch_table_ary;
2890 if (
NIL_P(catch_table_ary))
return COMPILE_OK;
2898 for (i = 0; i < table->size; i++) {
2901 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
2902 entry->type = (
enum rb_catch_type)(ptr[0] & 0xffff);
2903 pos = label_get_position((
LABEL *)(ptr[1] & ~1));
2905 entry->start = (
unsigned int)pos;
2906 pos = label_get_position((
LABEL *)(ptr[2] & ~1));
2908 entry->end = (
unsigned int)pos;
2915 entry->cont = label_get_position(lobj);
2916 entry->sp = label_get_sp(lobj);
2919 if (entry->type == CATCH_TYPE_RESCUE ||
2920 entry->type == CATCH_TYPE_BREAK ||
2921 entry->type == CATCH_TYPE_NEXT) {
2930 ISEQ_BODY(iseq)->catch_table = table;
2931 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->catch_table_ary, 0);
2952 VALUE *opt_table = (
VALUE *)ISEQ_BODY(iseq)->param.opt_table;
2954 if (ISEQ_BODY(iseq)->param.flags.has_opt) {
2955 for (i = 0; i < ISEQ_BODY(iseq)->param.opt_num + 1; i++) {
2956 opt_table[i] = label_get_position((
LABEL *)opt_table[i]);
2963get_destination_insn(
INSN *iobj)
2969 list = lobj->link.next;
2971 switch (list->type) {
2972 case ISEQ_ELEMENT_INSN:
2973 case ISEQ_ELEMENT_ADJUST:
2975 case ISEQ_ELEMENT_LABEL:
2978 case ISEQ_ELEMENT_TRACE:
2981 events |= trace->event;
2989 if (list && IS_INSN(list)) {
2991 iobj->insn_info.events |= events;
2997get_next_insn(
INSN *iobj)
3002 if (IS_INSN(list) || IS_ADJUST(list)) {
3011get_prev_insn(
INSN *iobj)
3016 if (IS_INSN(list) || IS_ADJUST(list)) {
3025unref_destination(
INSN *iobj,
int pos)
3027 LABEL *lobj = (
LABEL *)OPERAND_AT(iobj, pos);
3029 if (!lobj->refcnt) ELEM_REMOVE(&lobj->link);
3033replace_destination(
INSN *dobj,
INSN *nobj)
3035 VALUE n = OPERAND_AT(nobj, 0);
3038 if (dl == nl)
return false;
3041 OPERAND_AT(dobj, 0) = n;
3042 if (!dl->refcnt) ELEM_REMOVE(&dl->link);
3047find_destination(
INSN *i)
3049 int pos,
len = insn_len(i->insn_id);
3050 for (pos = 0; pos <
len; ++pos) {
3051 if (insn_op_types(i->insn_id)[pos] == TS_OFFSET) {
3052 return (
LABEL *)OPERAND_AT(i, pos);
3062 int *unref_counts = 0, nlabels = ISEQ_COMPILE_DATA(iseq)->label_no;
3065 unref_counts =
ALLOCA_N(
int, nlabels);
3066 MEMZERO(unref_counts,
int, nlabels);
3071 if (IS_INSN_ID(i, leave)) {
3075 else if ((lab = find_destination((
INSN *)i)) != 0) {
3076 unref_counts[lab->label_no]++;
3079 else if (IS_LABEL(i)) {
3081 if (lab->unremovable)
return 0;
3082 if (lab->refcnt > unref_counts[lab->label_no]) {
3083 if (i == first)
return 0;
3088 else if (IS_TRACE(i)) {
3091 else if (IS_ADJUST(i)) {
3095 }
while ((i = i->next) != 0);
3100 VALUE insn = INSN_OF(i);
3101 int pos,
len = insn_len(insn);
3102 for (pos = 0; pos <
len; ++pos) {
3103 switch (insn_op_types(insn)[pos]) {
3105 unref_destination((
INSN *)i, pos);
3114 }
while ((i != end) && (i = i->next) != 0);
3121 switch (OPERAND_AT(iobj, 0)) {
3123 ELEM_REMOVE(&iobj->link);
3126 ELEM_REMOVE(&iobj->link);
3129 iobj->insn_id = BIN(adjuststack);
3135is_frozen_putstring(
INSN *insn,
VALUE *op)
3137 if (IS_INSN_ID(insn, putstring) || IS_INSN_ID(insn, putchilledstring)) {
3138 *op = OPERAND_AT(insn, 0);
3141 else if (IS_INSN_ID(insn, putobject)) {
3142 *op = OPERAND_AT(insn, 0);
3173 INSN *niobj, *ciobj, *dup = 0;
3177 switch (INSN_OF(iobj)) {
3178 case BIN(putstring):
3179 case BIN(putchilledstring):
3185 case BIN(putobject):
3188 default:
return FALSE;
3191 ciobj = (
INSN *)get_next_insn(iobj);
3192 if (IS_INSN_ID(ciobj, jump)) {
3193 ciobj = (
INSN *)get_next_insn((
INSN*)OPERAND_AT(ciobj, 0));
3195 if (IS_INSN_ID(ciobj, dup)) {
3196 ciobj = (
INSN *)get_next_insn(dup = ciobj);
3198 if (!ciobj || !IS_INSN_ID(ciobj, checktype))
return FALSE;
3199 niobj = (
INSN *)get_next_insn(ciobj);
3204 switch (INSN_OF(niobj)) {
3206 if (OPERAND_AT(ciobj, 0) ==
type) {
3207 dest = (
LABEL *)OPERAND_AT(niobj, 0);
3210 case BIN(branchunless):
3211 if (OPERAND_AT(ciobj, 0) !=
type) {
3212 dest = (
LABEL *)OPERAND_AT(niobj, 0);
3218 line = ciobj->insn_info.line_no;
3219 node_id = ciobj->insn_info.node_id;
3221 if (niobj->link.next && IS_LABEL(niobj->link.next)) {
3222 dest = (
LABEL *)niobj->link.next;
3225 dest = NEW_LABEL(line);
3226 ELEM_INSERT_NEXT(&niobj->link, &dest->link);
3229 INSERT_AFTER_INSN1(iobj, line, node_id, jump, dest);
3231 if (!dup) INSERT_AFTER_INSN(iobj, line, node_id, pop);
3238 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
3239 vm_ci_flag(ci) | add,
3249 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
3257#define vm_ci_simple(ci) (vm_ci_flag(ci) & VM_CALL_ARGS_SIMPLE)
3265 optimize_checktype(iseq, iobj);
3267 if (IS_INSN_ID(iobj, jump)) {
3268 INSN *niobj, *diobj, *piobj;
3269 diobj = (
INSN *)get_destination_insn(iobj);
3270 niobj = (
INSN *)get_next_insn(iobj);
3272 if (diobj == niobj) {
3279 unref_destination(iobj, 0);
3280 ELEM_REMOVE(&iobj->link);
3283 else if (iobj != diobj && IS_INSN(&diobj->link) &&
3284 IS_INSN_ID(diobj, jump) &&
3285 OPERAND_AT(iobj, 0) != OPERAND_AT(diobj, 0) &&
3286 diobj->insn_info.events == 0) {
3297 if (replace_destination(iobj, diobj)) {
3298 remove_unreachable_chunk(iseq, iobj->link.next);
3302 else if (IS_INSN_ID(diobj, leave)) {
3315 unref_destination(iobj, 0);
3316 iobj->insn_id = BIN(leave);
3317 iobj->operand_size = 0;
3318 iobj->insn_info = diobj->insn_info;
3321 else if (IS_INSN(iobj->link.prev) &&
3322 (piobj = (
INSN *)iobj->link.prev) &&
3323 (IS_INSN_ID(piobj, branchif) ||
3324 IS_INSN_ID(piobj, branchunless))) {
3325 INSN *pdiobj = (
INSN *)get_destination_insn(piobj);
3326 if (niobj == pdiobj) {
3327 int refcnt = IS_LABEL(piobj->link.next) ?
3328 ((
LABEL *)piobj->link.next)->refcnt : 0;
3343 piobj->insn_id = (IS_INSN_ID(piobj, branchif))
3344 ? BIN(branchunless) : BIN(branchif);
3345 if (replace_destination(piobj, iobj) && refcnt <= 1) {
3346 ELEM_REMOVE(&iobj->link);
3353 else if (diobj == pdiobj) {
3367 INSN *popiobj = new_insn_core(iseq, iobj->insn_info.line_no, iobj->insn_info.node_id, BIN(pop), 0, 0);
3368 ELEM_REPLACE(&piobj->link, &popiobj->link);
3371 if (remove_unreachable_chunk(iseq, iobj->link.next)) {
3385 if (IS_INSN_ID(iobj, newrange)) {
3386 INSN *
const range = iobj;
3388 VALUE str_beg, str_end;
3390 if ((end = (
INSN *)get_prev_insn(range)) != 0 &&
3391 is_frozen_putstring(end, &str_end) &&
3392 (beg = (
INSN *)get_prev_insn(end)) != 0 &&
3393 is_frozen_putstring(beg, &str_beg)) {
3394 int excl =
FIX2INT(OPERAND_AT(range, 0));
3397 ELEM_REMOVE(&beg->link);
3398 ELEM_REMOVE(&end->link);
3399 range->insn_id = BIN(putobject);
3400 OPERAND_AT(range, 0) = lit_range;
3405 if (IS_INSN_ID(iobj, leave)) {
3406 remove_unreachable_chunk(iseq, iobj->link.next);
3418 if (IS_INSN_ID(iobj, duparray)) {
3420 if (IS_INSN(next) && (IS_INSN_ID(next, concatarray) || IS_INSN_ID(next, concattoarray))) {
3421 iobj->insn_id = BIN(putobject);
3431 if (IS_INSN_ID(iobj, duparray)) {
3433 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3437 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3438 VALUE ary = iobj->operands[0];
3441 iobj->insn_id = BIN(opt_ary_freeze);
3442 iobj->operand_size = 2;
3443 iobj->operands = compile_data_calloc2(iseq, iobj->operand_size,
sizeof(
VALUE));
3444 iobj->operands[0] = ary;
3445 iobj->operands[1] = (
VALUE)ci;
3457 if (IS_INSN_ID(iobj, duphash)) {
3459 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3463 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3464 VALUE hash = iobj->operands[0];
3467 iobj->insn_id = BIN(opt_hash_freeze);
3468 iobj->operand_size = 2;
3469 iobj->operands = compile_data_calloc2(iseq, iobj->operand_size,
sizeof(
VALUE));
3470 iobj->operands[0] = hash;
3471 iobj->operands[1] = (
VALUE)ci;
3483 if (IS_INSN_ID(iobj, newarray) && iobj->operands[0] ==
INT2FIX(0)) {
3485 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3489 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3490 iobj->insn_id = BIN(opt_ary_freeze);
3491 iobj->operand_size = 2;
3492 iobj->operands = compile_data_calloc2(iseq, iobj->operand_size,
sizeof(
VALUE));
3493 iobj->operands[0] = rb_cArray_empty_frozen;
3494 iobj->operands[1] = (
VALUE)ci;
3506 if (IS_INSN_ID(iobj, newhash) && iobj->operands[0] ==
INT2FIX(0)) {
3508 if (IS_INSN(next) && (IS_INSN_ID(next, send))) {
3512 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && blockiseq == NULL && vm_ci_mid(ci) == idFreeze) {
3513 iobj->insn_id = BIN(opt_hash_freeze);
3514 iobj->operand_size = 2;
3515 iobj->operands = compile_data_calloc2(iseq, iobj->operand_size,
sizeof(
VALUE));
3516 iobj->operands[0] = rb_cHash_empty_frozen;
3517 iobj->operands[1] = (
VALUE)ci;
3523 if (IS_INSN_ID(iobj, branchif) ||
3524 IS_INSN_ID(iobj, branchnil) ||
3525 IS_INSN_ID(iobj, branchunless)) {
3534 INSN *nobj = (
INSN *)get_destination_insn(iobj);
3556 int stop_optimization =
3557 ISEQ_COVERAGE(iseq) && ISEQ_LINE_COVERAGE(iseq) &&
3558 nobj->link.type == ISEQ_ELEMENT_INSN &&
3559 nobj->insn_info.events;
3560 if (!stop_optimization) {
3561 INSN *pobj = (
INSN *)iobj->link.prev;
3564 if (!IS_INSN(&pobj->link))
3566 else if (IS_INSN_ID(pobj, dup))
3571 if (IS_INSN(&nobj->link) && IS_INSN_ID(nobj, jump)) {
3572 if (!replace_destination(iobj, nobj))
break;
3574 else if (prev_dup && IS_INSN_ID(nobj, dup) &&
3575 !!(nobj = (
INSN *)nobj->link.next) &&
3577 nobj->insn_id == iobj->insn_id) {
3593 if (!replace_destination(iobj, nobj))
break;
3621 if (prev_dup && IS_INSN(pobj->link.prev)) {
3622 pobj = (
INSN *)pobj->link.prev;
3624 if (IS_INSN_ID(pobj, putobject)) {
3625 cond = (IS_INSN_ID(iobj, branchif) ?
3626 OPERAND_AT(pobj, 0) !=
Qfalse :
3627 IS_INSN_ID(iobj, branchunless) ?
3628 OPERAND_AT(pobj, 0) ==
Qfalse :
3631 else if (IS_INSN_ID(pobj, putstring) ||
3632 IS_INSN_ID(pobj, duparray) ||
3633 IS_INSN_ID(pobj, newarray)) {
3634 cond = IS_INSN_ID(iobj, branchif);
3636 else if (IS_INSN_ID(pobj, putnil)) {
3637 cond = !IS_INSN_ID(iobj, branchif);
3640 if (prev_dup || !IS_INSN_ID(pobj, newarray)) {
3641 ELEM_REMOVE(iobj->link.prev);
3643 else if (!iseq_pop_newarray(iseq, pobj)) {
3644 pobj = new_insn_core(iseq, pobj->insn_info.line_no, pobj->insn_info.node_id, BIN(pop), 0, NULL);
3645 ELEM_INSERT_PREV(&iobj->link, &pobj->link);
3649 pobj = new_insn_core(iseq, pobj->insn_info.line_no, pobj->insn_info.node_id, BIN(putnil), 0, NULL);
3650 ELEM_INSERT_NEXT(&iobj->link, &pobj->link);
3652 iobj->insn_id = BIN(jump);
3656 unref_destination(iobj, 0);
3657 ELEM_REMOVE(&iobj->link);
3662 nobj = (
INSN *)get_destination_insn(nobj);
3667 if (IS_INSN_ID(iobj, pop)) {
3675 if (IS_INSN(prev)) {
3676 enum ruby_vminsn_type previ = ((
INSN *)prev)->insn_id;
3677 if (previ == BIN(putobject) || previ == BIN(putnil) ||
3678 previ == BIN(putself) || previ == BIN(putstring) ||
3679 previ == BIN(putchilledstring) ||
3680 previ == BIN(dup) ||
3681 previ == BIN(getlocal) ||
3682 previ == BIN(getblockparam) ||
3683 previ == BIN(getblockparamproxy) ||
3684 previ == BIN(getinstancevariable) ||
3685 previ == BIN(duparray)) {
3689 ELEM_REMOVE(&iobj->link);
3691 else if (previ == BIN(newarray) && iseq_pop_newarray(iseq, (
INSN*)prev)) {
3692 ELEM_REMOVE(&iobj->link);
3694 else if (previ == BIN(concatarray)) {
3696 INSERT_BEFORE_INSN1(piobj, piobj->insn_info.line_no, piobj->insn_info.node_id, splatarray,
Qfalse);
3697 INSN_OF(piobj) = BIN(pop);
3699 else if (previ == BIN(concatstrings)) {
3700 if (OPERAND_AT(prev, 0) ==
INT2FIX(1)) {
3704 ELEM_REMOVE(&iobj->link);
3705 INSN_OF(prev) = BIN(adjuststack);
3711 if (IS_INSN_ID(iobj, newarray) ||
3712 IS_INSN_ID(iobj, duparray) ||
3713 IS_INSN_ID(iobj, concatarray) ||
3714 IS_INSN_ID(iobj, splatarray) ||
3724 if (IS_INSN(next) && IS_INSN_ID(next, splatarray)) {
3730 if (IS_INSN_ID(iobj, newarray)) {
3732 if (IS_INSN(next) && IS_INSN_ID(next, expandarray) &&
3733 OPERAND_AT(next, 1) ==
INT2FIX(0)) {
3735 op1 = OPERAND_AT(iobj, 0);
3736 op2 = OPERAND_AT(next, 0);
3747 INSN_OF(iobj) = BIN(swap);
3748 iobj->operand_size = 0;
3757 INSN_OF(iobj) = BIN(opt_reverse);
3762 INSN_OF(iobj) = BIN(opt_reverse);
3763 OPERAND_AT(iobj, 0) = OPERAND_AT(next, 0);
3773 for (; diff > 0; diff--) {
3774 INSERT_BEFORE_INSN(iobj, iobj->insn_info.line_no, iobj->insn_info.node_id, pop);
3785 for (; diff < 0; diff++) {
3786 INSERT_BEFORE_INSN(iobj, iobj->insn_info.line_no, iobj->insn_info.node_id, putnil);
3793 if (IS_INSN_ID(iobj, duparray)) {
3802 if (IS_INSN(next) && IS_INSN_ID(next, expandarray)) {
3803 INSN_OF(iobj) = BIN(putobject);
3807 if (IS_INSN_ID(iobj, anytostring)) {
3815 if (IS_INSN(next) && IS_INSN_ID(next, concatstrings) &&
3816 OPERAND_AT(next, 0) ==
INT2FIX(1)) {
3821 if (IS_INSN_ID(iobj, putstring) || IS_INSN_ID(iobj, putchilledstring) ||
3829 if (IS_NEXT_INSN_ID(&iobj->link, concatstrings) &&
3830 RSTRING_LEN(OPERAND_AT(iobj, 0)) == 0) {
3831 INSN *next = (
INSN *)iobj->link.next;
3832 if ((OPERAND_AT(next, 0) = FIXNUM_INC(OPERAND_AT(next, 0), -1)) ==
INT2FIX(1)) {
3833 ELEM_REMOVE(&next->link);
3835 ELEM_REMOVE(&iobj->link);
3837 if (IS_NEXT_INSN_ID(&iobj->link, toregexp)) {
3838 INSN *next = (
INSN *)iobj->link.next;
3839 if (OPERAND_AT(next, 1) ==
INT2FIX(1)) {
3840 VALUE src = OPERAND_AT(iobj, 0);
3841 int opt = (int)
FIX2LONG(OPERAND_AT(next, 0));
3842 VALUE path = rb_iseq_path(iseq);
3843 int line = iobj->insn_info.line_no;
3844 VALUE errinfo = rb_errinfo();
3845 VALUE re = rb_reg_compile(src, opt, RSTRING_PTR(path), line);
3847 VALUE message = rb_attr_get(rb_errinfo(), idMesg);
3848 rb_set_errinfo(errinfo);
3849 COMPILE_ERROR(iseq, line,
"%" PRIsVALUE, message);
3852 ELEM_REMOVE(iobj->link.next);
3857 if (IS_INSN_ID(iobj, concatstrings)) {
3866 if (IS_INSN(next) && IS_INSN_ID(next, jump))
3867 next = get_destination_insn(jump = (
INSN *)next);
3868 if (IS_INSN(next) && IS_INSN_ID(next, concatstrings)) {
3869 int n =
FIX2INT(OPERAND_AT(iobj, 0)) +
FIX2INT(OPERAND_AT(next, 0)) - 1;
3870 OPERAND_AT(iobj, 0) =
INT2FIX(n);
3872 LABEL *label = ((
LABEL *)OPERAND_AT(jump, 0));
3873 if (!--label->refcnt) {
3874 ELEM_REMOVE(&label->link);
3877 label = NEW_LABEL(0);
3878 OPERAND_AT(jump, 0) = (
VALUE)label;
3881 ELEM_INSERT_NEXT(next, &label->link);
3882 CHECK(iseq_peephole_optimize(iseq, get_next_insn(jump), do_tailcallopt));
3890 if (do_tailcallopt &&
3891 (IS_INSN_ID(iobj, send) ||
3892 IS_INSN_ID(iobj, opt_aref_with) ||
3893 IS_INSN_ID(iobj, opt_aset_with) ||
3894 IS_INSN_ID(iobj, invokesuper))) {
3903 if (iobj->link.next) {
3906 if (!IS_INSN(next)) {
3910 switch (INSN_OF(next)) {
3919 next = get_destination_insn((
INSN *)next);
3933 if (IS_INSN_ID(piobj, send) ||
3934 IS_INSN_ID(piobj, invokesuper)) {
3935 if (OPERAND_AT(piobj, 1) == 0) {
3936 ci = ci_flag_set(iseq, ci, VM_CALL_TAILCALL);
3937 OPERAND_AT(piobj, 0) = (
VALUE)ci;
3942 ci = ci_flag_set(iseq, ci, VM_CALL_TAILCALL);
3943 OPERAND_AT(piobj, 0) = (
VALUE)ci;
3949 if (IS_INSN_ID(iobj, dup)) {
3950 if (IS_NEXT_INSN_ID(&iobj->link, setlocal)) {
3961 if (IS_NEXT_INSN_ID(set1, setlocal)) {
3963 if (OPERAND_AT(set1, 0) == OPERAND_AT(set2, 0) &&
3964 OPERAND_AT(set1, 1) == OPERAND_AT(set2, 1)) {
3966 ELEM_REMOVE(&iobj->link);
3979 else if (IS_NEXT_INSN_ID(set1, dup) &&
3980 IS_NEXT_INSN_ID(set1->next, setlocal)) {
3981 set2 = set1->next->next;
3982 if (OPERAND_AT(set1, 0) == OPERAND_AT(set2, 0) &&
3983 OPERAND_AT(set1, 1) == OPERAND_AT(set2, 1)) {
3984 ELEM_REMOVE(set1->next);
3998 if (IS_INSN_ID(iobj, getlocal)) {
4000 if (IS_NEXT_INSN_ID(niobj, dup)) {
4001 niobj = niobj->next;
4003 if (IS_NEXT_INSN_ID(niobj, setlocal)) {
4005 if (OPERAND_AT(iobj, 0) == OPERAND_AT(set1, 0) &&
4006 OPERAND_AT(iobj, 1) == OPERAND_AT(set1, 1)) {
4022 if (IS_INSN_ID(iobj, opt_invokebuiltin_delegate)) {
4023 if (IS_TRACE(iobj->link.next)) {
4024 if (IS_NEXT_INSN_ID(iobj->link.next, leave)) {
4025 iobj->insn_id = BIN(opt_invokebuiltin_delegate_leave);
4027 if (iobj == (
INSN *)list && bf->argc == 0 && (ISEQ_BODY(iseq)->builtin_attrs & BUILTIN_ATTR_LEAF)) {
4028 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_SINGLE_NOARG_LEAF;
4041 if (IS_INSN_ID(iobj, getblockparam)) {
4042 if (IS_NEXT_INSN_ID(&iobj->link, branchif) || IS_NEXT_INSN_ID(&iobj->link, branchunless)) {
4043 iobj->insn_id = BIN(getblockparamproxy);
4047 if (IS_INSN_ID(iobj, splatarray) && OPERAND_AT(iobj, 0) ==
false) {
4049 if (IS_NEXT_INSN_ID(niobj, duphash)) {
4050 niobj = niobj->next;
4052 unsigned int set_flags = 0, unset_flags = 0;
4065 if (IS_NEXT_INSN_ID(niobj, send)) {
4066 siobj = niobj->next;
4067 set_flags = VM_CALL_ARGS_SPLAT|VM_CALL_KW_SPLAT|VM_CALL_KW_SPLAT_MUT;
4068 unset_flags = VM_CALL_ARGS_BLOCKARG;
4083 else if ((IS_NEXT_INSN_ID(niobj, getlocal) || IS_NEXT_INSN_ID(niobj, getinstancevariable) ||
4084 IS_NEXT_INSN_ID(niobj, getblockparamproxy)) && (IS_NEXT_INSN_ID(niobj->next, send))) {
4085 siobj = niobj->next->next;
4086 set_flags = VM_CALL_ARGS_SPLAT|VM_CALL_KW_SPLAT|VM_CALL_KW_SPLAT_MUT|VM_CALL_ARGS_BLOCKARG;
4091 unsigned int flags = vm_ci_flag(ci);
4092 if ((flags & set_flags) == set_flags && !(flags & unset_flags)) {
4093 ((
INSN*)niobj)->insn_id = BIN(putobject);
4094 OPERAND_AT(niobj, 0) = rb_hash_freeze(rb_hash_resurrect(OPERAND_AT(niobj, 0)));
4096 const struct rb_callinfo *nci = vm_ci_new(vm_ci_mid(ci),
4097 flags & ~VM_CALL_KW_SPLAT_MUT, vm_ci_argc(ci), vm_ci_kwarg(ci));
4099 OPERAND_AT(siobj, 0) = (
VALUE)nci;
4109insn_set_specialized_instruction(
rb_iseq_t *iseq,
INSN *iobj,
int insn_id)
4111 iobj->insn_id = insn_id;
4112 iobj->operand_size = insn_len(insn_id) - 1;
4115 if (insn_id == BIN(opt_neq)) {
4116 VALUE original_ci = iobj->operands[0];
4117 iobj->operand_size = 2;
4118 iobj->operands = compile_data_calloc2(iseq, iobj->operand_size,
sizeof(
VALUE));
4119 iobj->operands[0] = (
VALUE)new_callinfo(iseq, idEq, 1, 0, NULL, FALSE);
4120 iobj->operands[1] = original_ci;
4129 if (IS_INSN_ID(iobj, newarray) && iobj->link.next &&
4130 IS_INSN(iobj->link.next)) {
4134 INSN *niobj = (
INSN *)iobj->link.next;
4135 if (IS_INSN_ID(niobj, send)) {
4137 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 0) {
4139 switch (vm_ci_mid(ci)) {
4141 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_MAX);
4144 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_MIN);
4147 method =
INT2FIX(VM_OPT_NEWARRAY_SEND_HASH);
4152 VALUE num = iobj->operands[0];
4153 int operand_len = insn_len(BIN(opt_newarray_send)) - 1;
4154 iobj->insn_id = BIN(opt_newarray_send);
4155 iobj->operands = compile_data_calloc2(iseq, operand_len,
sizeof(
VALUE));
4156 iobj->operands[0] = num;
4157 iobj->operands[1] = method;
4158 iobj->operand_size = operand_len;
4159 ELEM_REMOVE(&niobj->link);
4164 else if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4166 IS_NEXT_INSN_ID(&niobj->link, send)) {
4168 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idPack) {
4169 VALUE num = iobj->operands[0];
4170 int operand_len = insn_len(BIN(opt_newarray_send)) - 1;
4171 iobj->insn_id = BIN(opt_newarray_send);
4172 iobj->operands = compile_data_calloc2(iseq, operand_len,
sizeof(
VALUE));
4173 iobj->operands[0] = FIXNUM_INC(num, 1);
4174 iobj->operands[1] =
INT2FIX(VM_OPT_NEWARRAY_SEND_PACK);
4175 iobj->operand_size = operand_len;
4176 ELEM_REMOVE(&iobj->link);
4177 ELEM_REMOVE(niobj->link.next);
4178 ELEM_INSERT_NEXT(&niobj->link, &iobj->link);
4184 else if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4186 IS_NEXT_INSN_ID(&niobj->link, getlocal) &&
4187 (niobj->link.next && IS_NEXT_INSN_ID(niobj->link.next, send))) {
4190 if (vm_ci_mid(ci) == idPack && vm_ci_argc(ci) == 2 &&
4191 (kwarg && kwarg->keyword_len == 1 && kwarg->keywords[0] ==
rb_id2sym(idBuffer))) {
4192 VALUE num = iobj->operands[0];
4193 int operand_len = insn_len(BIN(opt_newarray_send)) - 1;
4194 iobj->insn_id = BIN(opt_newarray_send);
4195 iobj->operands = compile_data_calloc2(iseq, operand_len,
sizeof(
VALUE));
4196 iobj->operands[0] = FIXNUM_INC(num, 2);
4197 iobj->operands[1] =
INT2FIX(VM_OPT_NEWARRAY_SEND_PACK_BUFFER);
4198 iobj->operand_size = operand_len;
4200 ELEM_REMOVE((niobj->link.next)->next);
4202 ELEM_REMOVE(&iobj->link);
4204 ELEM_INSERT_NEXT(niobj->link.next, &iobj->link);
4212 if ((IS_INSN_ID(niobj, putstring) || IS_INSN_ID(niobj, putchilledstring) ||
4213 IS_INSN_ID(niobj, putobject) ||
4214 IS_INSN_ID(niobj, putself) ||
4215 IS_INSN_ID(niobj, getlocal) ||
4216 IS_INSN_ID(niobj, getinstancevariable)) &&
4217 IS_NEXT_INSN_ID(&niobj->link, send)) {
4224 sendobj = sendobj->next;
4225 ci = (
struct rb_callinfo *)OPERAND_AT(sendobj, 0);
4226 }
while (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && IS_NEXT_INSN_ID(sendobj, send));
4229 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idIncludeP) {
4230 VALUE num = iobj->operands[0];
4232 sendins->insn_id = BIN(opt_newarray_send);
4233 sendins->operand_size = insn_len(sendins->insn_id) - 1;
4234 sendins->operands = compile_data_calloc2(iseq, sendins->operand_size,
sizeof(
VALUE));
4235 sendins->operands[0] = FIXNUM_INC(num, 1);
4236 sendins->operands[1] =
INT2FIX(VM_OPT_NEWARRAY_SEND_INCLUDE_P);
4238 ELEM_REMOVE(&iobj->link);
4252 if (IS_INSN_ID(iobj, duparray) && iobj->link.next && IS_INSN(iobj->link.next)) {
4253 INSN *niobj = (
INSN *)iobj->link.next;
4254 if ((IS_INSN_ID(niobj, getlocal) ||
4255 IS_INSN_ID(niobj, getinstancevariable) ||
4256 IS_INSN_ID(niobj, putself)) &&
4257 IS_NEXT_INSN_ID(&niobj->link, send)) {
4264 sendobj = sendobj->next;
4265 ci = (
struct rb_callinfo *)OPERAND_AT(sendobj, 0);
4266 }
while (vm_ci_simple(ci) && vm_ci_argc(ci) == 0 && IS_NEXT_INSN_ID(sendobj, send));
4268 if (vm_ci_simple(ci) && vm_ci_argc(ci) == 1 && vm_ci_mid(ci) == idIncludeP) {
4270 VALUE ary = iobj->operands[0];
4274 sendins->insn_id = BIN(opt_duparray_send);
4275 sendins->operand_size = insn_len(sendins->insn_id) - 1;;
4276 sendins->operands = compile_data_calloc2(iseq, sendins->operand_size,
sizeof(
VALUE));
4277 sendins->operands[0] = ary;
4278 sendins->operands[1] =
rb_id2sym(idIncludeP);
4279 sendins->operands[2] =
INT2FIX(1);
4282 ELEM_REMOVE(&iobj->link);
4289 if (IS_INSN_ID(iobj, send)) {
4293#define SP_INSN(opt) insn_set_specialized_instruction(iseq, iobj, BIN(opt_##opt))
4294 if (vm_ci_simple(ci)) {
4295 switch (vm_ci_argc(ci)) {
4297 switch (vm_ci_mid(ci)) {
4298 case idLength: SP_INSN(length);
return COMPILE_OK;
4299 case idSize: SP_INSN(size);
return COMPILE_OK;
4300 case idEmptyP: SP_INSN(empty_p);
return COMPILE_OK;
4301 case idNilP: SP_INSN(nil_p);
return COMPILE_OK;
4302 case idSucc: SP_INSN(succ);
return COMPILE_OK;
4303 case idNot: SP_INSN(not);
return COMPILE_OK;
4307 switch (vm_ci_mid(ci)) {
4308 case idPLUS: SP_INSN(plus);
return COMPILE_OK;
4309 case idMINUS: SP_INSN(minus);
return COMPILE_OK;
4310 case idMULT: SP_INSN(mult);
return COMPILE_OK;
4311 case idDIV: SP_INSN(div);
return COMPILE_OK;
4312 case idMOD: SP_INSN(mod);
return COMPILE_OK;
4313 case idEq: SP_INSN(eq);
return COMPILE_OK;
4314 case idNeq: SP_INSN(neq);
return COMPILE_OK;
4315 case idEqTilde:SP_INSN(regexpmatch2);
return COMPILE_OK;
4316 case idLT: SP_INSN(lt);
return COMPILE_OK;
4317 case idLE: SP_INSN(le);
return COMPILE_OK;
4318 case idGT: SP_INSN(gt);
return COMPILE_OK;
4319 case idGE: SP_INSN(ge);
return COMPILE_OK;
4320 case idLTLT: SP_INSN(ltlt);
return COMPILE_OK;
4321 case idAREF: SP_INSN(aref);
return COMPILE_OK;
4322 case idAnd: SP_INSN(and);
return COMPILE_OK;
4323 case idOr: SP_INSN(or);
return COMPILE_OK;
4327 switch (vm_ci_mid(ci)) {
4328 case idASET: SP_INSN(aset);
return COMPILE_OK;
4334 if ((vm_ci_flag(ci) & (VM_CALL_ARGS_BLOCKARG | VM_CALL_FORWARDING)) == 0 && blockiseq == NULL) {
4335 iobj->insn_id = BIN(opt_send_without_block);
4336 iobj->operand_size = insn_len(iobj->insn_id) - 1;
4347 switch (ISEQ_BODY(iseq)->
type) {
4349 case ISEQ_TYPE_EVAL:
4350 case ISEQ_TYPE_MAIN:
4352 case ISEQ_TYPE_RESCUE:
4353 case ISEQ_TYPE_ENSURE:
4365 const int do_peepholeopt = ISEQ_COMPILE_DATA(iseq)->option->peephole_optimization;
4366 const int do_tailcallopt = tailcallable_p(iseq) &&
4367 ISEQ_COMPILE_DATA(iseq)->option->tailcall_optimization;
4368 const int do_si = ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction;
4369 const int do_ou = ISEQ_COMPILE_DATA(iseq)->option->operands_unification;
4370 int rescue_level = 0;
4371 int tailcallopt = do_tailcallopt;
4373 list = FIRST_ELEMENT(anchor);
4375 int do_block_optimization = 0;
4376 LABEL * block_loop_label = NULL;
4379 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_BLOCK) {
4380 do_block_optimization = 1;
4385 if (IS_INSN(le) && IS_INSN_ID((
INSN *)le, nop) && IS_LABEL(le->next)) {
4386 block_loop_label = (
LABEL *)le->next;
4391 if (IS_INSN(list)) {
4392 if (do_peepholeopt) {
4393 iseq_peephole_optimize(iseq, list, tailcallopt);
4396 iseq_specialized_instruction(iseq, (
INSN *)list);
4399 insn_operands_unification((
INSN *)list);
4402 if (do_block_optimization) {
4405 if (IS_INSN_ID(item,
throw)) {
4406 do_block_optimization = 0;
4411 const char *types = insn_op_types(item->insn_id);
4412 for (
int j = 0; types[j]; j++) {
4413 if (types[j] == TS_OFFSET) {
4418 LABEL * target = (
LABEL *)OPERAND_AT(item, j);
4419 if (target == block_loop_label) {
4420 do_block_optimization = 0;
4427 if (IS_LABEL(list)) {
4428 switch (((
LABEL *)list)->rescued) {
4429 case LABEL_RESCUE_BEG:
4431 tailcallopt = FALSE;
4433 case LABEL_RESCUE_END:
4434 if (!--rescue_level) tailcallopt = do_tailcallopt;
4441 if (do_block_optimization) {
4443 if (IS_INSN(le) && IS_INSN_ID((
INSN *)le, nop)) {
4450#if OPT_INSTRUCTIONS_UNIFICATION
4458 VALUE *operands = 0, *ptr = 0;
4462 for (i = 0; i < size; i++) {
4463 iobj = (
INSN *)list;
4464 argc += iobj->operand_size;
4469 ptr = operands = compile_data_alloc2(iseq,
sizeof(
VALUE), argc);
4474 for (i = 0; i < size; i++) {
4475 iobj = (
INSN *)list;
4476 MEMCPY(ptr, iobj->operands,
VALUE, iobj->operand_size);
4477 ptr += iobj->operand_size;
4481 return new_insn_core(iseq, iobj->insn_info.line_no, iobj->insn_info.node_id, insn_id, argc, operands);
4493#if OPT_INSTRUCTIONS_UNIFICATION
4499 list = FIRST_ELEMENT(anchor);
4501 if (IS_INSN(list)) {
4502 iobj = (
INSN *)list;
4504 if (unified_insns_data[
id] != 0) {
4505 const int *
const *entry = unified_insns_data[id];
4506 for (j = 1; j < (intptr_t)entry[0]; j++) {
4507 const int *unified = entry[j];
4509 for (k = 2; k < unified[1]; k++) {
4511 ((
INSN *)li)->insn_id != unified[k]) {
4518 new_unified_insn(iseq, unified[0], unified[1] - 1,
4523 niobj->link.next = li;
4542all_string_result_p(
const NODE *node)
4544 if (!node)
return FALSE;
4545 switch (nd_type(node)) {
4546 case NODE_STR:
case NODE_DSTR:
case NODE_FILE:
4548 case NODE_IF:
case NODE_UNLESS:
4549 if (!RNODE_IF(node)->nd_body || !RNODE_IF(node)->nd_else)
return FALSE;
4550 if (all_string_result_p(RNODE_IF(node)->nd_body))
4551 return all_string_result_p(RNODE_IF(node)->nd_else);
4553 case NODE_AND:
case NODE_OR:
4554 if (!RNODE_AND(node)->nd_2nd)
4555 return all_string_result_p(RNODE_AND(node)->nd_1st);
4556 if (!all_string_result_p(RNODE_AND(node)->nd_1st))
4558 return all_string_result_p(RNODE_AND(node)->nd_2nd);
4568 const NODE *lit_node;
4576 VALUE s = rb_str_new_mutable_parser_string(str);
4578 VALUE error = rb_reg_check_preprocess(s);
4579 if (!
NIL_P(error)) {
4580 COMPILE_ERROR(args->iseq, nd_line(node),
"%" PRIsVALUE, error);
4584 if (
NIL_P(args->lit)) {
4586 args->lit_node = node;
4595flush_dstr_fragment(
struct dstr_ctxt *args)
4597 if (!
NIL_P(args->lit)) {
4599 VALUE lit = args->lit;
4601 lit = rb_fstring(lit);
4602 ADD_INSN1(args->ret, args->lit_node, putobject, lit);
4609compile_dstr_fragments_0(
struct dstr_ctxt *args,
const NODE *
const node)
4611 const struct RNode_LIST *list = RNODE_DSTR(node)->nd_next;
4615 CHECK(append_dstr_fragment(args, node, str));
4619 const NODE *
const head = list->nd_head;
4620 if (nd_type_p(head, NODE_STR)) {
4621 CHECK(append_dstr_fragment(args, node, RNODE_STR(head)->
string));
4623 else if (nd_type_p(head, NODE_DSTR)) {
4624 CHECK(compile_dstr_fragments_0(args, head));
4627 flush_dstr_fragment(args);
4629 CHECK(COMPILE(args->ret,
"each string", head));
4641 .iseq = iseq, .ret = ret,
4642 .lit =
Qnil, .lit_node = NULL,
4643 .cnt = 0, .dregx = dregx,
4645 CHECK(compile_dstr_fragments_0(&args, node));
4646 flush_dstr_fragment(&args);
4656 while (node && nd_type_p(node, NODE_BLOCK)) {
4657 CHECK(COMPILE_(ret,
"BLOCK body", RNODE_BLOCK(node)->nd_head,
4658 (RNODE_BLOCK(node)->nd_next ? 1 : popped)));
4659 node = RNODE_BLOCK(node)->nd_next;
4662 CHECK(COMPILE_(ret,
"BLOCK next", RNODE_BLOCK(node)->nd_next, popped));
4671 if (!RNODE_DSTR(node)->nd_next) {
4672 VALUE lit = rb_node_dstr_string_val(node);
4673 ADD_INSN1(ret, node, putstring, lit);
4677 CHECK(compile_dstr_fragments(iseq, ret, node, &cnt, FALSE));
4678 ADD_INSN1(ret, node, concatstrings,
INT2FIX(cnt));
4687 int cflag = (int)RNODE_DREGX(node)->as.nd_cflag;
4689 if (!RNODE_DREGX(node)->nd_next) {
4691 VALUE src = rb_node_dregx_string_val(node);
4692 VALUE match = rb_reg_compile(src, cflag, NULL, 0);
4693 ADD_INSN1(ret, node, putobject, match);
4699 CHECK(compile_dstr_fragments(iseq, ret, node, &cnt, TRUE));
4703 ADD_INSN(ret, node, pop);
4713 const int line = nd_line(node);
4714 LABEL *lend = NEW_LABEL(line);
4715 rb_num_t cnt = ISEQ_FLIP_CNT_INCREMENT(ISEQ_BODY(iseq)->local_iseq)
4716 + VM_SVAR_FLIPFLOP_START;
4719 ADD_INSN2(ret, node, getspecial, key,
INT2FIX(0));
4720 ADD_INSNL(ret, node, branchif, lend);
4723 CHECK(COMPILE(ret,
"flip2 beg", RNODE_FLIP2(node)->nd_beg));
4724 ADD_INSNL(ret, node, branchunless, else_label);
4725 ADD_INSN1(ret, node, putobject,
Qtrue);
4726 ADD_INSN1(ret, node, setspecial, key);
4728 ADD_INSNL(ret, node, jump, then_label);
4732 ADD_LABEL(ret, lend);
4733 CHECK(COMPILE(ret,
"flip2 end", RNODE_FLIP2(node)->nd_end));
4734 ADD_INSNL(ret, node, branchunless, then_label);
4735 ADD_INSN1(ret, node, putobject,
Qfalse);
4736 ADD_INSN1(ret, node, setspecial, key);
4737 ADD_INSNL(ret, node, jump, then_label);
4746#define COMPILE_SINGLE 2
4753 LABEL *label = NEW_LABEL(nd_line(cond));
4754 if (!then_label) then_label = label;
4755 else if (!else_label) else_label = label;
4757 CHECK(compile_branch_condition(iseq, seq, cond, then_label, else_label));
4759 if (LIST_INSN_SIZE_ONE(seq)) {
4760 INSN *insn = (
INSN *)ELEM_FIRST_INSN(FIRST_ELEMENT(seq));
4761 if (insn->insn_id == BIN(jump) && (
LABEL *)(insn->operands[0]) == label)
4764 if (!label->refcnt) {
4765 return COMPILE_SINGLE;
4767 ADD_LABEL(seq, label);
4777 DECL_ANCHOR(ignore);
4780 switch (nd_type(cond)) {
4782 CHECK(ok = compile_logical(iseq, ret, RNODE_AND(cond)->nd_1st, NULL, else_label));
4783 cond = RNODE_AND(cond)->nd_2nd;
4784 if (ok == COMPILE_SINGLE) {
4785 INIT_ANCHOR(ignore);
4787 then_label = NEW_LABEL(nd_line(cond));
4791 CHECK(ok = compile_logical(iseq, ret, RNODE_OR(cond)->nd_1st, then_label, NULL));
4792 cond = RNODE_OR(cond)->nd_2nd;
4793 if (ok == COMPILE_SINGLE) {
4794 INIT_ANCHOR(ignore);
4796 else_label = NEW_LABEL(nd_line(cond));
4806 case NODE_IMAGINARY:
4813 ADD_INSNL(ret, cond, jump, then_label);
4818 ADD_INSNL(ret, cond, jump, else_label);
4824 CHECK(COMPILE_POPPED(ret,
"branch condition", cond));
4825 ADD_INSNL(ret, cond, jump, then_label);
4828 CHECK(compile_flip_flop(iseq, ret, cond, TRUE, then_label, else_label));
4831 CHECK(compile_flip_flop(iseq, ret, cond, FALSE, then_label, else_label));
4834 CHECK(compile_defined_expr(iseq, ret, cond,
Qfalse, ret == ignore));
4838 DECL_ANCHOR(cond_seq);
4839 INIT_ANCHOR(cond_seq);
4841 CHECK(COMPILE(cond_seq,
"branch condition", cond));
4843 if (LIST_INSN_SIZE_ONE(cond_seq)) {
4844 INSN *insn = (
INSN *)ELEM_FIRST_INSN(FIRST_ELEMENT(cond_seq));
4845 if (insn->insn_id == BIN(putobject)) {
4846 if (
RTEST(insn->operands[0])) {
4847 ADD_INSNL(ret, cond, jump, then_label);
4852 ADD_INSNL(ret, cond, jump, else_label);
4857 ADD_SEQ(ret, cond_seq);
4862 ADD_INSNL(ret, cond, branchunless, else_label);
4863 ADD_INSNL(ret, cond, jump, then_label);
4870keyword_node_p(
const NODE *
const node)
4872 return nd_type_p(node, NODE_HASH) && (RNODE_HASH(node)->nd_brace & HASH_BRACE) != HASH_BRACE;
4878 switch (nd_type(node)) {
4880 return rb_node_sym_string_val(node);
4882 UNKNOWN_NODE(
"get_symbol_value", node,
Qnil);
4889 NODE *node = node_hash->nd_head;
4890 VALUE hash = rb_hash_new();
4891 VALUE ary = rb_ary_new();
4893 for (
int i = 0; node != NULL; i++, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4894 VALUE key = get_symbol_value(iseq, RNODE_LIST(node)->nd_head);
4895 VALUE idx = rb_hash_aref(hash, key);
4900 rb_hash_aset(hash, key,
INT2FIX(i));
4901 rb_ary_store(ary, i,
Qtrue);
4910 const NODE *
const root_node,
4918 if (RNODE_HASH(root_node)->nd_head && nd_type_p(RNODE_HASH(root_node)->nd_head, NODE_LIST)) {
4919 const NODE *node = RNODE_HASH(root_node)->nd_head;
4923 const NODE *key_node = RNODE_LIST(node)->nd_head;
4927 if (key_node && nd_type_p(key_node, NODE_SYM)) {
4932 *flag |= VM_CALL_KW_SPLAT;
4933 if (seen_nodes > 1 || RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4938 *flag |= VM_CALL_KW_SPLAT_MUT;
4943 node = RNODE_LIST(node)->nd_next;
4944 node = RNODE_LIST(node)->nd_next;
4948 node = RNODE_HASH(root_node)->nd_head;
4951 VALUE key_index = node_hash_unique_key_index(iseq, RNODE_HASH(root_node), &
len);
4954 VALUE *keywords = kw_arg->keywords;
4957 kw_arg->references = 0;
4958 kw_arg->keyword_len =
len;
4960 *kw_arg_ptr = kw_arg;
4962 for (i=0; node != NULL; i++, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
4963 const NODE *key_node = RNODE_LIST(node)->nd_head;
4964 const NODE *val_node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head;
4966 if (rb_ary_entry(key_index, i)) {
4967 keywords[j] = get_symbol_value(iseq, key_node);
4971 NO_CHECK(COMPILE_(ret,
"keyword values", val_node, popped));
4985 for (; node;
len++, node = RNODE_LIST(node)->nd_next) {
4987 EXPECT_NODE(
"compile_args", node, NODE_LIST, -1);
4990 if (RNODE_LIST(node)->nd_next == NULL && keyword_node_p(RNODE_LIST(node)->nd_head)) {
4991 *kwnode_ptr = RNODE_LIST(node)->nd_head;
4994 RUBY_ASSERT(!keyword_node_p(RNODE_LIST(node)->nd_head));
4995 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, FALSE));
5003frozen_string_literal_p(
const rb_iseq_t *iseq)
5005 return ISEQ_COMPILE_DATA(iseq)->option->frozen_string_literal > 0;
5009static_literal_node_p(
const NODE *node,
const rb_iseq_t *iseq,
bool hash_key)
5011 switch (nd_type(node)) {
5019 case NODE_IMAGINARY:
5026 return hash_key || frozen_string_literal_p(iseq);
5035 switch (nd_type(node)) {
5037 return rb_node_integer_literal_val(node);
5039 return rb_node_float_literal_val(node);
5041 return rb_node_rational_literal_val(node);
5042 case NODE_IMAGINARY:
5043 return rb_node_imaginary_literal_val(node);
5051 return rb_node_sym_string_val(node);
5053 return rb_node_regx_string_val(node);
5055 return rb_node_line_lineno_val(node);
5057 return rb_node_encoding_val(node);
5060 if (ISEQ_COMPILE_DATA(iseq)->option->debug_frozen_string_literal ||
RTEST(
ruby_debug)) {
5061 VALUE lit = get_string_value(node);
5062 return rb_str_with_debug_created_info(lit, rb_iseq_path(iseq), (
int)nd_line(node));
5065 return get_string_value(node);
5068 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
5075 const NODE *line_node = node;
5077 if (nd_type_p(node, NODE_ZLIST)) {
5079 ADD_INSN1(ret, line_node, newarray,
INT2FIX(0));
5084 EXPECT_NODE(
"compile_array", node, NODE_LIST, -1);
5087 for (; node; node = RNODE_LIST(node)->nd_next) {
5088 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, popped));
5130 const int max_stack_len = 0x100;
5131 const int min_tmp_ary_len = 0x40;
5135#define FLUSH_CHUNK \
5137 if (first_chunk) ADD_INSN1(ret, line_node, newarray, INT2FIX(stack_len)); \
5138 else ADD_INSN1(ret, line_node, pushtoarray, INT2FIX(stack_len)); \
5139 first_chunk = FALSE; \
5147 if (static_literal_node_p(RNODE_LIST(node)->nd_head, iseq,
false)) {
5149 const NODE *node_tmp = RNODE_LIST(node)->nd_next;
5150 for (; node_tmp && static_literal_node_p(RNODE_LIST(node_tmp)->nd_head, iseq,
false); node_tmp = RNODE_LIST(node_tmp)->nd_next)
5153 if ((first_chunk && stack_len == 0 && !node_tmp) || count >= min_tmp_ary_len) {
5155 VALUE ary = rb_ary_hidden_new(count);
5158 for (; count; count--, node = RNODE_LIST(node)->nd_next)
5159 rb_ary_push(ary, static_literal_value(RNODE_LIST(node)->nd_head, iseq));
5165 ADD_INSN1(ret, line_node, duparray, ary);
5166 first_chunk = FALSE;
5169 ADD_INSN1(ret, line_node, putobject, ary);
5170 ADD_INSN(ret, line_node, concattoarray);
5177 for (; count; count--, node = RNODE_LIST(node)->nd_next) {
5179 EXPECT_NODE(
"compile_array", node, NODE_LIST, -1);
5182 if (!RNODE_LIST(node)->nd_next && keyword_node_p(RNODE_LIST(node)->nd_head)) {
5184 if (stack_len == 0 && first_chunk) {
5185 ADD_INSN1(ret, line_node, newarray,
INT2FIX(0));
5190 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, 0));
5191 ADD_INSN(ret, line_node, pushtoarraykwsplat);
5195 NO_CHECK(COMPILE_(ret,
"array element", RNODE_LIST(node)->nd_head, 0));
5200 if (stack_len >= max_stack_len) FLUSH_CHUNK;
5210static_literal_node_pair_p(
const NODE *node,
const rb_iseq_t *iseq)
5212 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);
5218 const NODE *line_node = node;
5220 node = RNODE_HASH(node)->nd_head;
5222 if (!node || nd_type_p(node, NODE_ZLIST)) {
5224 ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5229 EXPECT_NODE(
"compile_hash", node, NODE_LIST, -1);
5232 for (; node; node = RNODE_LIST(node)->nd_next) {
5233 NO_CHECK(COMPILE_(ret,
"hash element", RNODE_LIST(node)->nd_head, popped));
5256 const int max_stack_len = 0x100;
5257 const int min_tmp_hash_len = 0x800;
5259 int first_chunk = 1;
5260 DECL_ANCHOR(anchor);
5261 INIT_ANCHOR(anchor);
5264#define FLUSH_CHUNK() \
5266 if (first_chunk) { \
5267 APPEND_LIST(ret, anchor); \
5268 ADD_INSN1(ret, line_node, newhash, INT2FIX(stack_len)); \
5271 ADD_INSN1(ret, line_node, putspecialobject, INT2FIX(VM_SPECIAL_OBJECT_VMCORE)); \
5272 ADD_INSN(ret, line_node, swap); \
5273 APPEND_LIST(ret, anchor); \
5274 ADD_SEND(ret, line_node, id_core_hash_merge_ptr, INT2FIX(stack_len + 1)); \
5276 INIT_ANCHOR(anchor); \
5277 first_chunk = stack_len = 0; \
5284 if (static_literal_node_pair_p(node, iseq)) {
5286 const NODE *node_tmp = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next;
5287 for (; node_tmp && static_literal_node_pair_p(node_tmp, iseq); node_tmp = RNODE_LIST(RNODE_LIST(node_tmp)->nd_next)->nd_next)
5290 if ((first_chunk && stack_len == 0 && !node_tmp) || count >= min_tmp_hash_len) {
5292 VALUE ary = rb_ary_hidden_new(count);
5295 for (; count; count--, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
5297 elem[0] = static_literal_value(RNODE_LIST(node)->nd_head, iseq);
5298 elem[1] = static_literal_value(RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head, iseq);
5299 rb_ary_cat(ary, elem, 2);
5309 ADD_INSN1(ret, line_node, duphash, hash);
5313 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
5314 ADD_INSN(ret, line_node, swap);
5316 ADD_INSN1(ret, line_node, putobject, hash);
5318 ADD_SEND(ret, line_node, id_core_hash_merge_kwd,
INT2FIX(2));
5325 for (; count; count--, node = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next) {
5328 EXPECT_NODE(
"compile_hash", node, NODE_LIST, -1);
5331 if (RNODE_LIST(node)->nd_head) {
5333 NO_CHECK(COMPILE_(anchor,
"hash key element", RNODE_LIST(node)->nd_head, 0));
5334 NO_CHECK(COMPILE_(anchor,
"hash value element", RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head, 0));
5338 if (stack_len >= max_stack_len) FLUSH_CHUNK();
5344 const NODE *kw = RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_head;
5345 int empty_kw = nd_type_p(kw, NODE_HASH) && (!RNODE_HASH(kw)->nd_head);
5346 int first_kw = first_chunk && stack_len == 0;
5347 int last_kw = !RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next;
5348 int only_kw = last_kw && first_kw;
5350 empty_kw = empty_kw || nd_type_p(kw, NODE_NIL);
5352 if (only_kw && method_call_keywords) {
5360 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5362 else if (first_kw) {
5366 ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5373 if (only_kw && method_call_keywords) {
5379 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5386 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
5387 if (first_kw) ADD_INSN1(ret, line_node, newhash,
INT2FIX(0));
5388 else ADD_INSN(ret, line_node, swap);
5390 NO_CHECK(COMPILE(ret,
"keyword splat", kw));
5392 ADD_SEND(ret, line_node, id_core_hash_merge_kwd,
INT2FIX(2));
5407rb_node_case_when_optimizable_literal(
const NODE *
const node)
5409 switch (nd_type(node)) {
5411 return rb_node_integer_literal_val(node);
5413 VALUE v = rb_node_float_literal_val(node);
5422 case NODE_IMAGINARY:
5431 return rb_node_sym_string_val(node);
5433 return rb_node_line_lineno_val(node);
5435 return rb_node_str_string_val(node);
5437 return rb_node_file_path_val(node);
5444 LABEL *l1,
int only_special_literals,
VALUE literals)
5447 const NODE *val = RNODE_LIST(vals)->nd_head;
5448 VALUE lit = rb_node_case_when_optimizable_literal(val);
5451 only_special_literals = 0;
5453 else if (
NIL_P(rb_hash_lookup(literals, lit))) {
5454 rb_hash_aset(literals, lit, (
VALUE)(l1) | 1);
5457 if (nd_type_p(val, NODE_STR) || nd_type_p(val, NODE_FILE)) {
5458 debugp_param(
"nd_lit", get_string_value(val));
5459 lit = get_string_value(val);
5460 ADD_INSN1(cond_seq, val, putobject, lit);
5464 if (!COMPILE(cond_seq,
"when cond", val))
return -1;
5468 ADD_INSN1(cond_seq, vals, topn,
INT2FIX(1));
5469 ADD_CALL(cond_seq, vals, idEqq,
INT2FIX(1));
5470 ADD_INSNL(cond_seq, val, branchif, l1);
5471 vals = RNODE_LIST(vals)->nd_next;
5473 return only_special_literals;
5478 LABEL *l1,
int only_special_literals,
VALUE literals)
5480 const NODE *line_node = vals;
5482 switch (nd_type(vals)) {
5484 if (when_vals(iseq, cond_seq, vals, l1, only_special_literals, literals) < 0)
5488 ADD_INSN (cond_seq, line_node, dup);
5489 CHECK(COMPILE(cond_seq,
"when splat", RNODE_SPLAT(vals)->nd_head));
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);
5495 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSCAT(vals)->nd_head, l1, only_special_literals, literals));
5496 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSCAT(vals)->nd_body, l1, only_special_literals, literals));
5499 CHECK(when_splat_vals(iseq, cond_seq, RNODE_ARGSPUSH(vals)->nd_head, l1, only_special_literals, literals));
5500 ADD_INSN (cond_seq, line_node, dup);
5501 CHECK(COMPILE(cond_seq,
"when argspush body", RNODE_ARGSPUSH(vals)->nd_body));
5502 ADD_INSN1(cond_seq, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
5503 ADD_INSNL(cond_seq, line_node, branchif, l1);
5506 ADD_INSN (cond_seq, line_node, dup);
5507 CHECK(COMPILE(cond_seq,
"when val", vals));
5508 ADD_INSN1(cond_seq, line_node, splatarray,
Qfalse);
5509 ADD_INSN1(cond_seq, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE | VM_CHECKMATCH_ARRAY));
5510 ADD_INSNL(cond_seq, line_node, branchif, l1);
5603 const NODE *line_node;
5618add_masgn_lhs_node(
struct masgn_state *state,
int lhs_pos,
const NODE *line_node,
int argc,
INSN *before_insn)
5621 rb_bug(
"no masgn_state");
5630 memo->before_insn = before_insn;
5631 memo->line_node = line_node;
5632 memo->argn = state->num_args + 1;
5633 memo->num_args = argc;
5634 state->num_args += argc;
5635 memo->lhs_pos = lhs_pos;
5637 if (!state->first_memo) {
5638 state->first_memo = memo;
5641 state->last_memo->next = memo;
5643 state->last_memo = memo;
5653 switch (nd_type(node)) {
5654 case NODE_ATTRASGN: {
5656 const NODE *line_node = node;
5658 CHECK(COMPILE_POPPED(pre,
"masgn lhs (NODE_ATTRASGN)", node));
5660 bool safenav_call =
false;
5662 iobj = (
INSN *)get_prev_insn((
INSN *)insn_element);
5664 ELEM_REMOVE(insn_element);
5665 if (!IS_INSN_ID(iobj, send)) {
5666 safenav_call =
true;
5667 iobj = (
INSN *)get_prev_insn(iobj);
5668 ELEM_INSERT_NEXT(&iobj->link, insn_element);
5670 (pre->last = iobj->link.prev)->next = 0;
5673 int argc = vm_ci_argc(ci) + 1;
5674 ci = ci_argc_set(iseq, ci, argc);
5675 OPERAND_AT(iobj, 0) = (
VALUE)ci;
5679 ADD_INSN(lhs, line_node, swap);
5682 ADD_INSN1(lhs, line_node, topn,
INT2FIX(argc));
5685 if (!add_masgn_lhs_node(state, lhs_pos, line_node, argc, (
INSN *)LAST_ELEMENT(lhs))) {
5689 iobj->link.prev = lhs->last;
5690 lhs->last->next = &iobj->link;
5691 for (lhs->last = &iobj->link; lhs->last->next; lhs->last = lhs->last->next);
5692 if (vm_ci_flag(ci) & VM_CALL_ARGS_SPLAT) {
5693 int argc = vm_ci_argc(ci);
5694 bool dupsplat =
false;
5695 ci = ci_argc_set(iseq, ci, argc - 1);
5696 if (!(vm_ci_flag(ci) & VM_CALL_ARGS_SPLAT_MUT)) {
5703 ci = ci_flag_set(iseq, ci, VM_CALL_ARGS_SPLAT_MUT);
5705 OPERAND_AT(iobj, 0) = (
VALUE)ci;
5714 int line_no = nd_line(line_node);
5715 int node_id = nd_node_id(line_node);
5718 INSERT_BEFORE_INSN(iobj, line_no, node_id, swap);
5719 INSERT_BEFORE_INSN1(iobj, line_no, node_id, splatarray,
Qtrue);
5720 INSERT_BEFORE_INSN(iobj, line_no, node_id, swap);
5722 INSERT_BEFORE_INSN1(iobj, line_no, node_id, pushtoarray,
INT2FIX(1));
5724 if (!safenav_call) {
5725 ADD_INSN(lhs, line_node, pop);
5727 ADD_INSN(lhs, line_node, pop);
5730 for (
int i=0; i < argc; i++) {
5731 ADD_INSN(post, line_node, pop);
5736 DECL_ANCHOR(nest_rhs);
5737 INIT_ANCHOR(nest_rhs);
5738 DECL_ANCHOR(nest_lhs);
5739 INIT_ANCHOR(nest_lhs);
5741 int prev_level = state->lhs_level;
5742 bool prev_nested = state->nested;
5744 state->lhs_level = lhs_pos - 1;
5745 CHECK(compile_massign0(iseq, pre, nest_rhs, nest_lhs, post, node, state, 1));
5746 state->lhs_level = prev_level;
5747 state->nested = prev_nested;
5749 ADD_SEQ(lhs, nest_rhs);
5750 ADD_SEQ(lhs, nest_lhs);
5754 if (!RNODE_CDECL(node)->nd_vid) {
5758 CHECK(COMPILE_POPPED(pre,
"masgn lhs (NODE_CDECL)", node));
5761 iobj = (
INSN *)insn_element;
5764 ELEM_REMOVE(insn_element);
5765 pre->last = iobj->link.prev;
5768 if (!add_masgn_lhs_node(state, lhs_pos, node, 1, (
INSN *)LAST_ELEMENT(lhs))) {
5772 ADD_INSN(post, node, pop);
5777 DECL_ANCHOR(anchor);
5778 INIT_ANCHOR(anchor);
5779 CHECK(COMPILE_POPPED(anchor,
"masgn lhs", node));
5780 ELEM_REMOVE(FIRST_ELEMENT(anchor));
5781 ADD_SEQ(lhs, anchor);
5792 CHECK(compile_massign_opt_lhs(iseq, ret, RNODE_LIST(lhsn)->nd_next));
5793 CHECK(compile_massign_lhs(iseq, ret, ret, ret, ret, RNODE_LIST(lhsn)->nd_head, NULL, 0));
5800 const NODE *rhsn,
const NODE *orig_lhsn)
5803 const int memsize = numberof(mem);
5805 int llen = 0, rlen = 0;
5807 const NODE *lhsn = orig_lhsn;
5809#define MEMORY(v) { \
5811 if (memindex == memsize) return 0; \
5812 for (i=0; i<memindex; i++) { \
5813 if (mem[i] == (v)) return 0; \
5815 mem[memindex++] = (v); \
5818 if (rhsn == 0 || !nd_type_p(rhsn, NODE_LIST)) {
5823 const NODE *ln = RNODE_LIST(lhsn)->nd_head;
5824 switch (nd_type(ln)) {
5829 MEMORY(get_nd_vid(ln));
5834 lhsn = RNODE_LIST(lhsn)->nd_next;
5840 NO_CHECK(COMPILE_POPPED(ret,
"masgn val (popped)", RNODE_LIST(rhsn)->nd_head));
5843 NO_CHECK(COMPILE(ret,
"masgn val", RNODE_LIST(rhsn)->nd_head));
5845 rhsn = RNODE_LIST(rhsn)->nd_next;
5850 for (i=0; i<llen-rlen; i++) {
5851 ADD_INSN(ret, orig_lhsn, putnil);
5855 compile_massign_opt_lhs(iseq, ret, orig_lhsn);
5862 const NODE *rhsn = RNODE_MASGN(node)->nd_value;
5863 const NODE *splatn = RNODE_MASGN(node)->nd_args;
5864 const NODE *lhsn = RNODE_MASGN(node)->nd_head;
5865 const NODE *lhsn_count = lhsn;
5866 int lhs_splat = (splatn && NODE_NAMED_REST_P(splatn)) ? 1 : 0;
5871 while (lhsn_count) {
5873 lhsn_count = RNODE_LIST(lhsn_count)->nd_next;
5876 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, RNODE_LIST(lhsn)->nd_head, state, (llen - lpos) + lhs_splat + state->lhs_level));
5878 lhsn = RNODE_LIST(lhsn)->nd_next;
5882 if (nd_type_p(splatn, NODE_POSTARG)) {
5884 const NODE *postn = RNODE_POSTARG(splatn)->nd_2nd;
5885 const NODE *restn = RNODE_POSTARG(splatn)->nd_1st;
5886 int plen = (int)RNODE_LIST(postn)->as.nd_alen;
5888 int flag = 0x02 | (NODE_NAMED_REST_P(restn) ? 0x01 : 0x00);
5890 ADD_INSN2(lhs, splatn, expandarray,
INT2FIX(plen),
INT2FIX(flag));
5892 if (NODE_NAMED_REST_P(restn)) {
5893 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, restn, state, 1 + plen + state->lhs_level));
5896 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, RNODE_LIST(postn)->nd_head, state, (plen - ppos) + state->lhs_level));
5898 postn = RNODE_LIST(postn)->nd_next;
5903 CHECK(compile_massign_lhs(iseq, pre, rhs, lhs, post, splatn, state, 1 + state->lhs_level));
5907 if (!state->nested) {
5908 NO_CHECK(COMPILE(rhs,
"normal masgn rhs", rhsn));
5912 ADD_INSN(rhs, node, dup);
5914 ADD_INSN2(rhs, node, expandarray,
INT2FIX(llen),
INT2FIX(lhs_splat));
5921 if (!popped || RNODE_MASGN(node)->nd_args || !compile_massign_opt(iseq, ret, RNODE_MASGN(node)->nd_value, RNODE_MASGN(node)->nd_head)) {
5923 state.lhs_level = popped ? 0 : 1;
5926 state.first_memo = NULL;
5927 state.last_memo = NULL;
5937 int ok = compile_massign0(iseq, pre, rhs, lhs, post, node, &state, popped);
5941 VALUE topn_arg =
INT2FIX((state.num_args - memo->argn) + memo->lhs_pos);
5942 for (
int i = 0; i < memo->num_args; i++) {
5943 INSERT_BEFORE_INSN1(memo->before_insn, nd_line(memo->line_node), nd_node_id(memo->line_node), topn, topn_arg);
5945 tmp_memo = memo->next;
5954 if (!popped && state.num_args >= 1) {
5956 ADD_INSN1(ret, node, setn,
INT2FIX(state.num_args));
5966 VALUE arr = rb_ary_new();
5968 switch (nd_type(node)) {
5970 rb_ary_unshift(arr,
ID2SYM(RNODE_CONST(node)->nd_vid));
5973 rb_ary_unshift(arr,
ID2SYM(RNODE_COLON3(node)->nd_mid));
5974 rb_ary_unshift(arr,
ID2SYM(idNULL));
5977 rb_ary_unshift(arr,
ID2SYM(RNODE_COLON2(node)->nd_mid));
5978 node = RNODE_COLON2(node)->nd_head;
5987compile_const_prefix(
rb_iseq_t *iseq,
const NODE *
const node,
5990 switch (nd_type(node)) {
5992 debugi(
"compile_const_prefix - colon", RNODE_CONST(node)->nd_vid);
5993 ADD_INSN1(body, node, putobject,
Qtrue);
5994 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_CONST(node)->nd_vid));
5997 debugi(
"compile_const_prefix - colon3", RNODE_COLON3(node)->nd_mid);
5998 ADD_INSN(body, node, pop);
5999 ADD_INSN1(body, node, putobject, rb_cObject);
6000 ADD_INSN1(body, node, putobject,
Qtrue);
6001 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_COLON3(node)->nd_mid));
6004 CHECK(compile_const_prefix(iseq, RNODE_COLON2(node)->nd_head, pref, body));
6005 debugi(
"compile_const_prefix - colon2", RNODE_COLON2(node)->nd_mid);
6006 ADD_INSN1(body, node, putobject,
Qfalse);
6007 ADD_INSN1(body, node, getconstant,
ID2SYM(RNODE_COLON2(node)->nd_mid));
6010 CHECK(COMPILE(pref,
"const colon2 prefix", node));
6019 if (nd_type_p(cpath, NODE_COLON3)) {
6021 ADD_INSN1(ret, cpath, putobject, rb_cObject);
6022 return VM_DEFINECLASS_FLAG_SCOPED;
6024 else if (nd_type_p(cpath, NODE_COLON2) && RNODE_COLON2(cpath)->nd_head) {
6026 NO_CHECK(COMPILE(ret,
"nd_else->nd_head", RNODE_COLON2(cpath)->nd_head));
6027 return VM_DEFINECLASS_FLAG_SCOPED;
6031 ADD_INSN1(ret, cpath, putspecialobject,
6032 INT2FIX(VM_SPECIAL_OBJECT_CONST_BASE));
6038private_recv_p(
const NODE *node)
6040 NODE *recv = get_nd_recv(node);
6041 if (recv && nd_type_p(recv, NODE_SELF)) {
6042 return RNODE_SELF(recv)->nd_state != 0;
6049 const NODE *
const node,
LABEL **lfinish,
VALUE needstr,
bool ignore);
6052compile_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);
6059 enum defined_type expr_type = DEFINED_NOT_DEFINED;
6060 enum node_type
type;
6061 const int line = nd_line(node);
6062 const NODE *line_node = node;
6064 switch (
type = nd_type(node)) {
6068 expr_type = DEFINED_NIL;
6071 expr_type = DEFINED_SELF;
6074 expr_type = DEFINED_TRUE;
6077 expr_type = DEFINED_FALSE;
6082 const NODE *vals = (nd_type(node) == NODE_HASH) ? RNODE_HASH(node)->nd_head : node;
6086 if (RNODE_LIST(vals)->nd_head) {
6087 defined_expr0(iseq, ret, RNODE_LIST(vals)->nd_head, lfinish,
Qfalse,
false);
6090 lfinish[1] = NEW_LABEL(line);
6092 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6094 }
while ((vals = RNODE_LIST(vals)->nd_next) != NULL);
6107 case NODE_IMAGINARY:
6112 expr_type = DEFINED_EXPR;
6116 defined_expr0(iseq, ret, RNODE_LIST(node)->nd_head, lfinish,
Qfalse,
false);
6118 lfinish[1] = NEW_LABEL(line);
6120 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6121 expr_type = DEFINED_EXPR;
6127 expr_type = DEFINED_LVAR;
6130#define PUSH_VAL(type) (needstr == Qfalse ? Qtrue : rb_iseq_defined_string(type))
6132 ADD_INSN3(ret, line_node, definedivar,
6133 ID2SYM(RNODE_IVAR(node)->nd_vid), get_ivar_ic_value(iseq,RNODE_IVAR(node)->nd_vid), PUSH_VAL(DEFINED_IVAR));
6137 ADD_INSN(ret, line_node, putnil);
6138 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_GVAR),
6139 ID2SYM(RNODE_GVAR(node)->nd_vid), PUSH_VAL(DEFINED_GVAR));
6143 ADD_INSN(ret, line_node, putnil);
6144 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CVAR),
6145 ID2SYM(RNODE_CVAR(node)->nd_vid), PUSH_VAL(DEFINED_CVAR));
6149 ADD_INSN(ret, line_node, putnil);
6150 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CONST),
6151 ID2SYM(RNODE_CONST(node)->nd_vid), PUSH_VAL(DEFINED_CONST));
6155 lfinish[1] = NEW_LABEL(line);
6157 defined_expr0(iseq, ret, RNODE_COLON2(node)->nd_head, lfinish,
Qfalse,
false);
6158 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6159 NO_CHECK(COMPILE(ret,
"defined/colon2#nd_head", RNODE_COLON2(node)->nd_head));
6162 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_CONST_FROM),
6163 ID2SYM(RNODE_COLON2(node)->nd_mid), PUSH_VAL(DEFINED_CONST));
6166 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_METHOD),
6167 ID2SYM(RNODE_COLON2(node)->nd_mid), PUSH_VAL(DEFINED_METHOD));
6171 ADD_INSN1(ret, line_node, putobject, rb_cObject);
6172 ADD_INSN3(ret, line_node, defined,
6173 INT2FIX(DEFINED_CONST_FROM),
ID2SYM(RNODE_COLON3(node)->nd_mid), PUSH_VAL(DEFINED_CONST));
6181 case NODE_ATTRASGN:{
6182 const int explicit_receiver =
6183 (
type == NODE_CALL ||
type == NODE_OPCALL ||
6184 (
type == NODE_ATTRASGN && !private_recv_p(node)));
6186 if (get_nd_args(node) || explicit_receiver) {
6188 lfinish[1] = NEW_LABEL(line);
6191 lfinish[2] = NEW_LABEL(line);
6194 if (get_nd_args(node)) {
6195 defined_expr0(iseq, ret, get_nd_args(node), lfinish,
Qfalse,
false);
6196 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6198 if (explicit_receiver) {
6199 defined_expr0(iseq, ret, get_nd_recv(node), lfinish,
Qfalse,
true);
6200 switch (nd_type(get_nd_recv(node))) {
6206 ADD_INSNL(ret, line_node, branchunless, lfinish[2]);
6207 compile_call(iseq, ret, get_nd_recv(node), nd_type(get_nd_recv(node)), line_node, 0,
true);
6210 ADD_INSNL(ret, line_node, branchunless, lfinish[1]);
6211 NO_CHECK(COMPILE(ret,
"defined/recv", get_nd_recv(node)));
6215 ADD_INSN(ret, line_node, dup);
6217 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_METHOD),
6218 ID2SYM(get_node_call_nd_mid(node)), PUSH_VAL(DEFINED_METHOD));
6221 ADD_INSN(ret, line_node, putself);
6223 ADD_INSN(ret, line_node, dup);
6225 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_FUNC),
6226 ID2SYM(get_node_call_nd_mid(node)), PUSH_VAL(DEFINED_METHOD));
6232 ADD_INSN(ret, line_node, putnil);
6233 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_YIELD), 0,
6234 PUSH_VAL(DEFINED_YIELD));
6235 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
6240 ADD_INSN(ret, line_node, putnil);
6241 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_REF),
6242 INT2FIX((RNODE_BACK_REF(node)->nd_nth << 1) | (
type == NODE_BACK_REF)),
6243 PUSH_VAL(DEFINED_GVAR));
6248 ADD_INSN(ret, line_node, putnil);
6249 ADD_INSN3(ret, line_node, defined,
INT2FIX(DEFINED_ZSUPER), 0,
6250 PUSH_VAL(DEFINED_ZSUPER));
6256 case NODE_OP_ASGN_OR:
6257 case NODE_OP_ASGN_AND:
6266 expr_type = DEFINED_ASGN;
6273 VALUE str = rb_iseq_defined_string(expr_type);
6274 ADD_INSN1(ret, line_node, putobject, str);
6277 ADD_INSN1(ret, line_node, putobject,
Qtrue);
6284 ADD_SYNTHETIC_INSN(ret, 0, -1, putnil);
6285 iseq_set_exception_local_table(iseq);
6290 const NODE *
const node,
LABEL **lfinish,
VALUE needstr,
bool ignore)
6293 defined_expr0(iseq, ret, node, lfinish, needstr,
false);
6295 int line = nd_line(node);
6296 LABEL *lstart = NEW_LABEL(line);
6297 LABEL *lend = NEW_LABEL(line);
6300 rb_iseq_new_with_callback_new_callback(build_defined_rescue_iseq, NULL);
6301 rescue = NEW_CHILD_ISEQ_WITH_CALLBACK(ifunc,
6303 ISEQ_BODY(iseq)->location.label),
6304 ISEQ_TYPE_RESCUE, 0);
6305 lstart->rescued = LABEL_RESCUE_BEG;
6306 lend->rescued = LABEL_RESCUE_END;
6307 APPEND_LABEL(ret, lcur, lstart);
6308 ADD_LABEL(ret, lend);
6310 ADD_CATCH_ENTRY(CATCH_TYPE_RESCUE, lstart, lend, rescue, lfinish[1]);
6318 const int line = nd_line(node);
6319 const NODE *line_node = node;
6320 if (!RNODE_DEFINED(node)->nd_head) {
6321 VALUE str = rb_iseq_defined_string(DEFINED_NIL);
6322 ADD_INSN1(ret, line_node, putobject, str);
6327 lfinish[0] = NEW_LABEL(line);
6330 defined_expr(iseq, ret, RNODE_DEFINED(node)->nd_head, lfinish, needstr, ignore);
6332 ELEM_INSERT_NEXT(last, &new_insn_body(iseq, nd_line(line_node), nd_node_id(line_node), BIN(putnil), 0)->link);
6333 ADD_INSN(ret, line_node, swap);
6335 ADD_LABEL(ret, lfinish[2]);
6337 ADD_INSN(ret, line_node, pop);
6338 ADD_LABEL(ret, lfinish[1]);
6340 ADD_LABEL(ret, lfinish[0]);
6346make_name_for_block(
const rb_iseq_t *orig_iseq)
6351 if (ISEQ_BODY(orig_iseq)->parent_iseq != 0) {
6352 while (ISEQ_BODY(orig_iseq)->local_iseq != iseq) {
6353 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_BLOCK) {
6356 iseq = ISEQ_BODY(iseq)->parent_iseq;
6361 return rb_sprintf(
"block in %"PRIsVALUE, ISEQ_BODY(iseq)->location.label);
6364 return rb_sprintf(
"block (%d levels) in %"PRIsVALUE, level, ISEQ_BODY(iseq)->location.label);
6373 enl->ensure_node = node;
6374 enl->prev = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack;
6376 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enl;
6386 while (erange->next != 0) {
6387 erange = erange->next;
6391 ne->end = erange->end;
6392 erange->end = lstart;
6398can_add_ensure_iseq(
const rb_iseq_t *iseq)
6401 if (ISEQ_COMPILE_DATA(iseq)->in_rescue && (e = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack) != NULL) {
6403 if (e->ensure_node)
return false;
6416 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack;
6418 DECL_ANCHOR(ensure);
6420 INIT_ANCHOR(ensure);
6422 if (enlp->erange != NULL) {
6423 DECL_ANCHOR(ensure_part);
6424 LABEL *lstart = NEW_LABEL(0);
6425 LABEL *lend = NEW_LABEL(0);
6426 INIT_ANCHOR(ensure_part);
6428 add_ensure_range(iseq, enlp->erange, lstart, lend);
6430 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enlp->prev;
6431 ADD_LABEL(ensure_part, lstart);
6432 NO_CHECK(COMPILE_POPPED(ensure_part,
"ensure part", enlp->ensure_node));
6433 ADD_LABEL(ensure_part, lend);
6434 ADD_SEQ(ensure, ensure_part);
6443 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = prev_enlp;
6444 ADD_SEQ(ret, ensure);
6449check_keyword(
const NODE *node)
6453 if (nd_type_p(node, NODE_LIST)) {
6454 while (RNODE_LIST(node)->nd_next) {
6455 node = RNODE_LIST(node)->nd_next;
6457 node = RNODE_LIST(node)->nd_head;
6460 return keyword_node_p(node);
6465keyword_node_single_splat_p(
NODE *kwnode)
6469 NODE *node = RNODE_HASH(kwnode)->nd_head;
6470 return RNODE_LIST(node)->nd_head == NULL &&
6471 RNODE_LIST(RNODE_LIST(node)->nd_next)->nd_next == NULL;
6476 NODE *kwnode,
unsigned int *flag_ptr)
6478 *flag_ptr |= VM_CALL_KW_SPLAT_MUT;
6479 ADD_INSN1(args, argn, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
6480 ADD_INSN1(args, argn, newhash,
INT2FIX(0));
6481 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6482 ADD_SEND(args, argn, id_core_hash_merge_kwd,
INT2FIX(2));
6485#define SPLATARRAY_FALSE 0
6486#define SPLATARRAY_TRUE 1
6487#define DUP_SINGLE_KW_SPLAT 2
6491 unsigned int *dup_rest,
unsigned int *flag_ptr,
struct rb_callinfo_kwarg **kwarg_ptr)
6493 if (!argn)
return 0;
6495 NODE *kwnode = NULL;
6497 switch (nd_type(argn)) {
6500 int len = compile_args(iseq, args, argn, &kwnode);
6501 RUBY_ASSERT(flag_ptr == NULL || (*flag_ptr & VM_CALL_ARGS_SPLAT) == 0);
6504 if (compile_keyword_arg(iseq, args, kwnode, kwarg_ptr, flag_ptr)) {
6508 if (keyword_node_single_splat_p(kwnode) && (*dup_rest & DUP_SINGLE_KW_SPLAT)) {
6509 compile_single_keyword_splat_mutable(iseq, args, argn, kwnode, flag_ptr);
6512 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6521 NO_CHECK(COMPILE(args,
"args (splat)", RNODE_SPLAT(argn)->nd_head));
6522 ADD_INSN1(args, argn, splatarray, RBOOL(*dup_rest & SPLATARRAY_TRUE));
6523 if (*dup_rest & SPLATARRAY_TRUE) *dup_rest &= ~SPLATARRAY_TRUE;
6524 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6525 RUBY_ASSERT(flag_ptr == NULL || (*flag_ptr & VM_CALL_KW_SPLAT) == 0);
6528 case NODE_ARGSCAT: {
6529 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6530 int argc = setup_args_core(iseq, args, RNODE_ARGSCAT(argn)->nd_head, dup_rest, NULL, NULL);
6531 bool args_pushed =
false;
6533 if (nd_type_p(RNODE_ARGSCAT(argn)->nd_body, NODE_LIST)) {
6534 int rest_len = compile_args(iseq, args, RNODE_ARGSCAT(argn)->nd_body, &kwnode);
6535 if (kwnode) rest_len--;
6536 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(rest_len));
6540 RUBY_ASSERT(!check_keyword(RNODE_ARGSCAT(argn)->nd_body));
6541 NO_CHECK(COMPILE(args,
"args (cat: splat)", RNODE_ARGSCAT(argn)->nd_body));
6544 if (nd_type_p(RNODE_ARGSCAT(argn)->nd_head, NODE_LIST)) {
6545 ADD_INSN1(args, argn, splatarray, RBOOL(*dup_rest & SPLATARRAY_TRUE));
6546 if (*dup_rest & SPLATARRAY_TRUE) *dup_rest &= ~SPLATARRAY_TRUE;
6549 else if (!args_pushed) {
6550 ADD_INSN(args, argn, concattoarray);
6556 *flag_ptr |= VM_CALL_KW_SPLAT;
6557 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6563 case NODE_ARGSPUSH: {
6564 if (flag_ptr) *flag_ptr |= VM_CALL_ARGS_SPLAT;
6565 int argc = setup_args_core(iseq, args, RNODE_ARGSPUSH(argn)->nd_head, dup_rest, NULL, NULL);
6567 if (nd_type_p(RNODE_ARGSPUSH(argn)->nd_body, NODE_LIST)) {
6568 int rest_len = compile_args(iseq, args, RNODE_ARGSPUSH(argn)->nd_body, &kwnode);
6569 if (kwnode) rest_len--;
6570 ADD_INSN1(args, argn, newarray,
INT2FIX(rest_len));
6571 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(1));
6574 if (keyword_node_p(RNODE_ARGSPUSH(argn)->nd_body)) {
6575 kwnode = RNODE_ARGSPUSH(argn)->nd_body;
6578 NO_CHECK(COMPILE(args,
"args (cat: splat)", RNODE_ARGSPUSH(argn)->nd_body));
6579 ADD_INSN1(args, argn, pushtoarray,
INT2FIX(1));
6585 *flag_ptr |= VM_CALL_KW_SPLAT;
6586 if (!keyword_node_single_splat_p(kwnode)) {
6587 *flag_ptr |= VM_CALL_KW_SPLAT_MUT;
6588 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6590 else if (*dup_rest & DUP_SINGLE_KW_SPLAT) {
6591 compile_single_keyword_splat_mutable(iseq, args, argn, kwnode, flag_ptr);
6594 compile_hash(iseq, args, kwnode, TRUE, FALSE);
6602 UNKNOWN_NODE(
"setup_arg", argn,
Qnil);
6608setup_args_splat_mut(
unsigned int *flag,
int dup_rest,
int initial_dup_rest)
6610 if ((*flag & VM_CALL_ARGS_SPLAT) && dup_rest != initial_dup_rest) {
6611 *flag |= VM_CALL_ARGS_SPLAT_MUT;
6616setup_args_dup_rest_p(
const NODE *argn)
6618 switch(nd_type(argn)) {
6629 case NODE_IMAGINARY:
6642 return setup_args_dup_rest_p(RNODE_COLON2(argn)->nd_head);
6653 unsigned int dup_rest = SPLATARRAY_TRUE, initial_dup_rest;
6656 const NODE *check_arg = nd_type_p(argn, NODE_BLOCK_PASS) ?
6657 RNODE_BLOCK_PASS(argn)->nd_head : argn;
6660 switch(nd_type(check_arg)) {
6663 dup_rest = SPLATARRAY_FALSE;
6667 dup_rest = !nd_type_p(RNODE_ARGSCAT(check_arg)->nd_head, NODE_LIST);
6669 case(NODE_ARGSPUSH):
6671 dup_rest = !((nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_head, NODE_SPLAT) ||
6672 (nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_head, NODE_ARGSCAT) &&
6673 nd_type_p(RNODE_ARGSCAT(RNODE_ARGSPUSH(check_arg)->nd_head)->nd_head, NODE_LIST))) &&
6674 nd_type_p(RNODE_ARGSPUSH(check_arg)->nd_body, NODE_HASH) &&
6675 !RNODE_HASH(RNODE_ARGSPUSH(check_arg)->nd_body)->nd_brace);
6677 if (dup_rest == SPLATARRAY_FALSE) {
6679 NODE *node = RNODE_HASH(RNODE_ARGSPUSH(check_arg)->nd_body)->nd_head;
6681 NODE *key_node = RNODE_LIST(node)->nd_head;
6682 if (key_node && setup_args_dup_rest_p(key_node)) {
6683 dup_rest = SPLATARRAY_TRUE;
6687 node = RNODE_LIST(node)->nd_next;
6688 NODE *value_node = RNODE_LIST(node)->nd_head;
6689 if (setup_args_dup_rest_p(value_node)) {
6690 dup_rest = SPLATARRAY_TRUE;
6694 node = RNODE_LIST(node)->nd_next;
6703 if (check_arg != argn && setup_args_dup_rest_p(RNODE_BLOCK_PASS(argn)->nd_body)) {
6705 dup_rest = SPLATARRAY_TRUE | DUP_SINGLE_KW_SPLAT;
6708 initial_dup_rest = dup_rest;
6710 if (argn && nd_type_p(argn, NODE_BLOCK_PASS)) {
6711 DECL_ANCHOR(arg_block);
6712 INIT_ANCHOR(arg_block);
6714 if (RNODE_BLOCK_PASS(argn)->forwarding && ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->param.flags.forwardable) {
6715 int idx = ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->local_table_size;
6717 RUBY_ASSERT(nd_type_p(RNODE_BLOCK_PASS(argn)->nd_head, NODE_ARGSPUSH));
6718 const NODE * arg_node =
6719 RNODE_ARGSPUSH(RNODE_BLOCK_PASS(argn)->nd_head)->nd_head;
6726 if (nd_type_p(arg_node, NODE_ARGSCAT)) {
6727 argc += setup_args_core(iseq, args, RNODE_ARGSCAT(arg_node)->nd_head, &dup_rest, flag, keywords);
6730 *flag |= VM_CALL_FORWARDING;
6732 ADD_GETLOCAL(args, argn, idx, get_lvar_level(iseq));
6733 setup_args_splat_mut(flag, dup_rest, initial_dup_rest);
6737 *flag |= VM_CALL_ARGS_BLOCKARG;
6739 NO_CHECK(COMPILE(arg_block,
"block", RNODE_BLOCK_PASS(argn)->nd_body));
6742 if (LIST_INSN_SIZE_ONE(arg_block)) {
6744 if (IS_INSN(elem)) {
6746 if (iobj->insn_id == BIN(getblockparam)) {
6747 iobj->insn_id = BIN(getblockparamproxy);
6751 ret =
INT2FIX(setup_args_core(iseq, args, RNODE_BLOCK_PASS(argn)->nd_head, &dup_rest, flag, keywords));
6752 ADD_SEQ(args, arg_block);
6755 ret =
INT2FIX(setup_args_core(iseq, args, argn, &dup_rest, flag, keywords));
6757 setup_args_splat_mut(flag, dup_rest, initial_dup_rest);
6764 const NODE *body = ptr;
6765 int line = nd_line(body);
6767 const rb_iseq_t *block = NEW_CHILD_ISEQ(body, make_name_for_block(ISEQ_BODY(iseq)->parent_iseq), ISEQ_TYPE_BLOCK, line);
6769 ADD_INSN1(ret, body, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
6770 ADD_CALL_WITH_BLOCK(ret, body, id_core_set_postexe, argc, block);
6772 iseq_set_local_table(iseq, 0, 0);
6780 int line = nd_line(node);
6781 const NODE *line_node = node;
6782 LABEL *fail_label = NEW_LABEL(line), *end_label = NEW_LABEL(line);
6784#if !(defined(NAMED_CAPTURE_BY_SVAR) && NAMED_CAPTURE_BY_SVAR-0)
6785 ADD_INSN1(ret, line_node, getglobal,
ID2SYM(idBACKREF));
6789 ADD_INSN(ret, line_node, dup);
6790 ADD_INSNL(ret, line_node, branchunless, fail_label);
6792 for (vars = node; vars; vars = RNODE_BLOCK(vars)->nd_next) {
6794 if (RNODE_BLOCK(vars)->nd_next) {
6795 ADD_INSN(ret, line_node, dup);
6798 NO_CHECK(COMPILE_POPPED(ret,
"capture", RNODE_BLOCK(vars)->nd_head));
6800 cap = new_insn_send(iseq, nd_line(line_node), nd_node_id(line_node), idAREF,
INT2FIX(1),
6803#if !defined(NAMED_CAPTURE_SINGLE_OPT) || NAMED_CAPTURE_SINGLE_OPT-0
6804 if (!RNODE_BLOCK(vars)->nd_next && vars == node) {
6809 ADD_INSNL(nom, line_node, jump, end_label);
6810 ADD_LABEL(nom, fail_label);
6812 ADD_INSN(nom, line_node, pop);
6813 ADD_INSN(nom, line_node, putnil);
6815 ADD_LABEL(nom, end_label);
6816 (nom->last->next = cap->link.next)->prev = nom->last;
6817 (cap->link.next = nom->anchor.next)->prev = &cap->link;
6822 ADD_INSNL(ret, line_node, jump, end_label);
6823 ADD_LABEL(ret, fail_label);
6824 ADD_INSN(ret, line_node, pop);
6825 for (vars = node; vars; vars = RNODE_BLOCK(vars)->nd_next) {
6827 NO_CHECK(COMPILE_POPPED(ret,
"capture", RNODE_BLOCK(vars)->nd_head));
6829 ((
INSN*)last)->insn_id = BIN(putnil);
6830 ((
INSN*)last)->operand_size = 0;
6832 ADD_LABEL(ret, end_label);
6836optimizable_range_item_p(
const NODE *n)
6838 if (!n)
return FALSE;
6839 switch (nd_type(n)) {
6852optimized_range_item(
const NODE *n)
6854 switch (nd_type(n)) {
6856 return rb_node_line_lineno_val(n);
6858 return rb_node_integer_literal_val(n);
6860 return rb_node_float_literal_val(n);
6862 return rb_node_rational_literal_val(n);
6863 case NODE_IMAGINARY:
6864 return rb_node_imaginary_literal_val(n);
6868 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(n)));
6875 const NODE *
const node_body =
type == NODE_IF ? RNODE_IF(node)->nd_body : RNODE_UNLESS(node)->nd_else;
6876 const NODE *
const node_else =
type == NODE_IF ? RNODE_IF(node)->nd_else : RNODE_UNLESS(node)->nd_body;
6878 const int line = nd_line(node);
6879 const NODE *line_node = node;
6880 DECL_ANCHOR(cond_seq);
6881 LABEL *then_label, *else_label, *end_label;
6884 INIT_ANCHOR(cond_seq);
6885 then_label = NEW_LABEL(line);
6886 else_label = NEW_LABEL(line);
6889 NODE *cond = RNODE_IF(node)->nd_cond;
6890 if (nd_type(cond) == NODE_BLOCK) {
6891 cond = RNODE_BLOCK(cond)->nd_head;
6894 CHECK(compile_branch_condition(iseq, cond_seq, cond, then_label, else_label));
6895 ADD_SEQ(ret, cond_seq);
6897 if (then_label->refcnt && else_label->refcnt) {
6898 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
type == NODE_IF ?
"if" :
"unless");
6901 if (then_label->refcnt) {
6902 ADD_LABEL(ret, then_label);
6904 DECL_ANCHOR(then_seq);
6905 INIT_ANCHOR(then_seq);
6906 CHECK(COMPILE_(then_seq,
"then", node_body, popped));
6908 if (else_label->refcnt) {
6909 const NODE *
const coverage_node = node_body ? node_body : node;
6910 add_trace_branch_coverage(
6913 nd_code_loc(coverage_node),
6914 nd_node_id(coverage_node),
6916 type == NODE_IF ?
"then" :
"else",
6918 end_label = NEW_LABEL(line);
6919 ADD_INSNL(then_seq, line_node, jump, end_label);
6921 ADD_INSN(then_seq, line_node, pop);
6924 ADD_SEQ(ret, then_seq);
6927 if (else_label->refcnt) {
6928 ADD_LABEL(ret, else_label);
6930 DECL_ANCHOR(else_seq);
6931 INIT_ANCHOR(else_seq);
6932 CHECK(COMPILE_(else_seq,
"else", node_else, popped));
6934 if (then_label->refcnt) {
6935 const NODE *
const coverage_node = node_else ? node_else : node;
6936 add_trace_branch_coverage(
6939 nd_code_loc(coverage_node),
6940 nd_node_id(coverage_node),
6942 type == NODE_IF ?
"else" :
"then",
6945 ADD_SEQ(ret, else_seq);
6949 ADD_LABEL(ret, end_label);
6959 const NODE *node = orig_node;
6960 LABEL *endlabel, *elselabel;
6962 DECL_ANCHOR(body_seq);
6963 DECL_ANCHOR(cond_seq);
6964 int only_special_literals = 1;
6965 VALUE literals = rb_hash_new();
6967 enum node_type
type;
6968 const NODE *line_node;
6973 INIT_ANCHOR(body_seq);
6974 INIT_ANCHOR(cond_seq);
6976 RHASH_TBL_RAW(literals)->type = &cdhash_type;
6978 CHECK(COMPILE(head,
"case base", RNODE_CASE(node)->nd_head));
6980 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"case");
6982 node = RNODE_CASE(node)->nd_body;
6983 EXPECT_NODE(
"NODE_CASE", node, NODE_WHEN, COMPILE_NG);
6984 type = nd_type(node);
6985 line = nd_line(node);
6988 endlabel = NEW_LABEL(line);
6989 elselabel = NEW_LABEL(line);
6993 while (
type == NODE_WHEN) {
6996 l1 = NEW_LABEL(line);
6997 ADD_LABEL(body_seq, l1);
6998 ADD_INSN(body_seq, line_node, pop);
7000 const NODE *
const coverage_node = RNODE_WHEN(node)->nd_body ? RNODE_WHEN(node)->nd_body : node;
7001 add_trace_branch_coverage(
7004 nd_code_loc(coverage_node),
7005 nd_node_id(coverage_node),
7010 CHECK(COMPILE_(body_seq,
"when body", RNODE_WHEN(node)->nd_body, popped));
7011 ADD_INSNL(body_seq, line_node, jump, endlabel);
7013 vals = RNODE_WHEN(node)->nd_head;
7015 switch (nd_type(vals)) {
7017 only_special_literals = when_vals(iseq, cond_seq, vals, l1, only_special_literals, literals);
7018 if (only_special_literals < 0)
return COMPILE_NG;
7023 only_special_literals = 0;
7024 CHECK(when_splat_vals(iseq, cond_seq, vals, l1, only_special_literals, literals));
7027 UNKNOWN_NODE(
"NODE_CASE", vals, COMPILE_NG);
7031 EXPECT_NODE_NONULL(
"NODE_CASE", node, NODE_LIST, COMPILE_NG);
7034 node = RNODE_WHEN(node)->nd_next;
7038 type = nd_type(node);
7039 line = nd_line(node);
7044 ADD_LABEL(cond_seq, elselabel);
7045 ADD_INSN(cond_seq, line_node, pop);
7046 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(node), nd_node_id(node), branch_id,
"else", branches);
7047 CHECK(COMPILE_(cond_seq,
"else", node, popped));
7048 ADD_INSNL(cond_seq, line_node, jump, endlabel);
7051 debugs(
"== else (implicit)\n");
7052 ADD_LABEL(cond_seq, elselabel);
7053 ADD_INSN(cond_seq, orig_node, pop);
7054 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(orig_node), nd_node_id(orig_node), branch_id,
"else", branches);
7056 ADD_INSN(cond_seq, orig_node, putnil);
7058 ADD_INSNL(cond_seq, orig_node, jump, endlabel);
7061 if (only_special_literals && ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction) {
7062 ADD_INSN(ret, orig_node, dup);
7063 ADD_INSN2(ret, orig_node, opt_case_dispatch, literals, elselabel);
7065 LABEL_REF(elselabel);
7068 ADD_SEQ(ret, cond_seq);
7069 ADD_SEQ(ret, body_seq);
7070 ADD_LABEL(ret, endlabel);
7079 const NODE *node = RNODE_CASE2(orig_node)->nd_body;
7081 DECL_ANCHOR(body_seq);
7085 branches = decl_branch_base(iseq, PTR2NUM(orig_node), nd_code_loc(orig_node),
"case");
7087 INIT_ANCHOR(body_seq);
7088 endlabel = NEW_LABEL(nd_line(node));
7090 while (node && nd_type_p(node, NODE_WHEN)) {
7091 const int line = nd_line(node);
7092 LABEL *l1 = NEW_LABEL(line);
7093 ADD_LABEL(body_seq, l1);
7095 const NODE *
const coverage_node = RNODE_WHEN(node)->nd_body ? RNODE_WHEN(node)->nd_body : node;
7096 add_trace_branch_coverage(
7099 nd_code_loc(coverage_node),
7100 nd_node_id(coverage_node),
7105 CHECK(COMPILE_(body_seq,
"when", RNODE_WHEN(node)->nd_body, popped));
7106 ADD_INSNL(body_seq, node, jump, endlabel);
7108 vals = RNODE_WHEN(node)->nd_head;
7110 EXPECT_NODE_NONULL(
"NODE_WHEN", node, NODE_LIST, COMPILE_NG);
7112 switch (nd_type(vals)) {
7116 val = RNODE_LIST(vals)->nd_head;
7117 lnext = NEW_LABEL(nd_line(val));
7118 debug_compile(
"== when2\n", (
void)0);
7119 CHECK(compile_branch_condition(iseq, ret, val, l1, lnext));
7120 ADD_LABEL(ret, lnext);
7121 vals = RNODE_LIST(vals)->nd_next;
7127 ADD_INSN(ret, vals, putnil);
7128 CHECK(COMPILE(ret,
"when2/cond splat", vals));
7129 ADD_INSN1(ret, vals, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_WHEN | VM_CHECKMATCH_ARRAY));
7130 ADD_INSNL(ret, vals, branchif, l1);
7133 UNKNOWN_NODE(
"NODE_WHEN", vals, COMPILE_NG);
7135 node = RNODE_WHEN(node)->nd_next;
7138 const NODE *
const coverage_node = node ? node : orig_node;
7139 add_trace_branch_coverage(
7142 nd_code_loc(coverage_node),
7143 nd_node_id(coverage_node),
7147 CHECK(COMPILE_(ret,
"else", node, popped));
7148 ADD_INSNL(ret, orig_node, jump, endlabel);
7150 ADD_SEQ(ret, body_seq);
7151 ADD_LABEL(ret, endlabel);
7155static 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);
7157static 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);
7158static 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);
7159static int iseq_compile_pattern_set_general_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
VALUE errmsg,
int base_index);
7160static 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);
7161static int iseq_compile_pattern_set_eqq_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
int base_index);
7163#define CASE3_BI_OFFSET_DECONSTRUCTED_CACHE 0
7164#define CASE3_BI_OFFSET_ERROR_STRING 1
7165#define CASE3_BI_OFFSET_KEY_ERROR_P 2
7166#define CASE3_BI_OFFSET_KEY_ERROR_MATCHEE 3
7167#define CASE3_BI_OFFSET_KEY_ERROR_KEY 4
7170iseq_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)
7172 const int line = nd_line(node);
7173 const NODE *line_node = node;
7175 switch (nd_type(node)) {
7229 const NODE *args = RNODE_ARYPTN(node)->pre_args;
7230 const int pre_args_num = RNODE_ARYPTN(node)->pre_args ?
rb_long2int(RNODE_LIST(RNODE_ARYPTN(node)->pre_args)->as.nd_alen) : 0;
7231 const int post_args_num = RNODE_ARYPTN(node)->post_args ?
rb_long2int(RNODE_LIST(RNODE_ARYPTN(node)->post_args)->as.nd_alen) : 0;
7233 const int min_argc = pre_args_num + post_args_num;
7234 const int use_rest_num = RNODE_ARYPTN(node)->rest_arg && (NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg) ||
7235 (!NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg) && post_args_num > 0));
7237 LABEL *match_failed, *type_error, *deconstruct, *deconstructed;
7239 match_failed = NEW_LABEL(line);
7240 type_error = NEW_LABEL(line);
7241 deconstruct = NEW_LABEL(line);
7242 deconstructed = NEW_LABEL(line);
7245 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7246 ADD_INSN(ret, line_node, swap);
7252 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7254 CHECK(iseq_compile_array_deconstruct(iseq, ret, node, deconstruct, deconstructed, match_failed, type_error, in_single_pattern, base_index, use_deconstructed_cache));
7256 ADD_INSN(ret, line_node, dup);
7257 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7258 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7259 ADD_SEND(ret, line_node, RNODE_ARYPTN(node)->rest_arg ? idGE : idEq,
INT2FIX(1));
7260 if (in_single_pattern) {
7261 CHECK(iseq_compile_pattern_set_length_errmsg(iseq, ret, node,
7262 RNODE_ARYPTN(node)->rest_arg ? rb_fstring_lit(
"%p length mismatch (given %p, expected %p+)") :
7263 rb_fstring_lit(
"%p length mismatch (given %p, expected %p)"),
7264 INT2FIX(min_argc), base_index + 1 ));
7266 ADD_INSNL(ret, line_node, branchunless, match_failed);
7268 for (i = 0; i < pre_args_num; i++) {
7269 ADD_INSN(ret, line_node, dup);
7270 ADD_INSN1(ret, line_node, putobject,
INT2FIX(i));
7271 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7272 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7273 args = RNODE_LIST(args)->nd_next;
7276 if (RNODE_ARYPTN(node)->rest_arg) {
7277 if (NODE_NAMED_REST_P(RNODE_ARYPTN(node)->rest_arg)) {
7278 ADD_INSN(ret, line_node, dup);
7279 ADD_INSN1(ret, line_node, putobject,
INT2FIX(pre_args_num));
7280 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7281 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7282 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7283 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7284 ADD_INSN1(ret, line_node, setn,
INT2FIX(4));
7285 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7287 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_ARYPTN(node)->rest_arg, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7290 if (post_args_num > 0) {
7291 ADD_INSN(ret, line_node, dup);
7292 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7293 ADD_INSN1(ret, line_node, putobject,
INT2FIX(min_argc));
7294 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7295 ADD_INSN1(ret, line_node, setn,
INT2FIX(2));
7296 ADD_INSN(ret, line_node, pop);
7301 args = RNODE_ARYPTN(node)->post_args;
7302 for (i = 0; i < post_args_num; i++) {
7303 ADD_INSN(ret, line_node, dup);
7305 ADD_INSN1(ret, line_node, putobject,
INT2FIX(pre_args_num + i));
7306 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7307 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7309 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7310 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7311 args = RNODE_LIST(args)->nd_next;
7314 ADD_INSN(ret, line_node, pop);
7316 ADD_INSN(ret, line_node, pop);
7318 ADD_INSNL(ret, line_node, jump, matched);
7319 ADD_INSN(ret, line_node, putnil);
7321 ADD_INSN(ret, line_node, putnil);
7324 ADD_LABEL(ret, type_error);
7325 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7327 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct must return Array"));
7328 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7329 ADD_INSN(ret, line_node, pop);
7331 ADD_LABEL(ret, match_failed);
7332 ADD_INSN(ret, line_node, pop);
7334 ADD_INSN(ret, line_node, pop);
7336 ADD_INSNL(ret, line_node, jump, unmatched);
7389 const NODE *args = RNODE_FNDPTN(node)->args;
7390 const int args_num = RNODE_FNDPTN(node)->args ?
rb_long2int(RNODE_LIST(RNODE_FNDPTN(node)->args)->as.nd_alen) : 0;
7392 LABEL *match_failed, *type_error, *deconstruct, *deconstructed;
7393 match_failed = NEW_LABEL(line);
7394 type_error = NEW_LABEL(line);
7395 deconstruct = NEW_LABEL(line);
7396 deconstructed = NEW_LABEL(line);
7398 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7400 CHECK(iseq_compile_array_deconstruct(iseq, ret, node, deconstruct, deconstructed, match_failed, type_error, in_single_pattern, base_index, use_deconstructed_cache));
7402 ADD_INSN(ret, line_node, dup);
7403 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7404 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7405 ADD_SEND(ret, line_node, idGE,
INT2FIX(1));
7406 if (in_single_pattern) {
7407 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 ));
7409 ADD_INSNL(ret, line_node, branchunless, match_failed);
7412 LABEL *while_begin = NEW_LABEL(nd_line(node));
7413 LABEL *next_loop = NEW_LABEL(nd_line(node));
7414 LABEL *find_succeeded = NEW_LABEL(line);
7415 LABEL *find_failed = NEW_LABEL(nd_line(node));
7418 ADD_INSN(ret, line_node, dup);
7419 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
7421 ADD_INSN(ret, line_node, dup);
7422 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7423 ADD_SEND(ret, line_node, idMINUS,
INT2FIX(1));
7425 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7427 ADD_LABEL(ret, while_begin);
7429 ADD_INSN(ret, line_node, dup);
7430 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7431 ADD_SEND(ret, line_node, idLE,
INT2FIX(1));
7432 ADD_INSNL(ret, line_node, branchunless, find_failed);
7434 for (j = 0; j < args_num; j++) {
7435 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7436 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7438 ADD_INSN1(ret, line_node, putobject,
INT2FIX(j));
7439 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7441 ADD_SEND(ret, line_node, idAREF,
INT2FIX(1));
7443 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_LIST(args)->nd_head, next_loop, in_single_pattern, in_alt_pattern, base_index + 4 ,
false));
7444 args = RNODE_LIST(args)->nd_next;
7447 if (NODE_NAMED_REST_P(RNODE_FNDPTN(node)->pre_rest_arg)) {
7448 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7449 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
7450 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7451 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7452 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));
7454 if (NODE_NAMED_REST_P(RNODE_FNDPTN(node)->post_rest_arg)) {
7455 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7456 ADD_INSN1(ret, line_node, topn,
INT2FIX(1));
7457 ADD_INSN1(ret, line_node, putobject,
INT2FIX(args_num));
7458 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7459 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7460 ADD_SEND(ret, line_node, idAREF,
INT2FIX(2));
7461 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));
7463 ADD_INSNL(ret, line_node, jump, find_succeeded);
7465 ADD_LABEL(ret, next_loop);
7466 ADD_INSN1(ret, line_node, putobject,
INT2FIX(1));
7467 ADD_SEND(ret, line_node, idPLUS,
INT2FIX(1));
7468 ADD_INSNL(ret, line_node, jump, while_begin);
7470 ADD_LABEL(ret, find_failed);
7471 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(3));
7472 if (in_single_pattern) {
7473 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7474 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"%p does not match to find pattern"));
7475 ADD_INSN1(ret, line_node, topn,
INT2FIX(2));
7476 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(2));
7477 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7479 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7480 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7482 ADD_INSN(ret, line_node, pop);
7483 ADD_INSN(ret, line_node, pop);
7485 ADD_INSNL(ret, line_node, jump, match_failed);
7486 ADD_INSN1(ret, line_node, dupn,
INT2FIX(3));
7488 ADD_LABEL(ret, find_succeeded);
7489 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(3));
7492 ADD_INSN(ret, line_node, pop);
7493 ADD_INSNL(ret, line_node, jump, matched);
7494 ADD_INSN(ret, line_node, putnil);
7496 ADD_LABEL(ret, type_error);
7497 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7499 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct must return Array"));
7500 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7501 ADD_INSN(ret, line_node, pop);
7503 ADD_LABEL(ret, match_failed);
7504 ADD_INSN(ret, line_node, pop);
7505 ADD_INSNL(ret, line_node, jump, unmatched);
7569 LABEL *match_failed, *type_error;
7572 match_failed = NEW_LABEL(line);
7573 type_error = NEW_LABEL(line);
7575 if (RNODE_HSHPTN(node)->nd_pkwargs && !RNODE_HSHPTN(node)->nd_pkwrestarg) {
7576 const NODE *kw_args = RNODE_HASH(RNODE_HSHPTN(node)->nd_pkwargs)->nd_head;
7577 keys = rb_ary_new_capa(kw_args ? RNODE_LIST(kw_args)->as.nd_alen/2 : 0);
7579 rb_ary_push(keys, get_symbol_value(iseq, RNODE_LIST(kw_args)->nd_head));
7580 kw_args = RNODE_LIST(RNODE_LIST(kw_args)->nd_next)->nd_next;
7584 CHECK(iseq_compile_pattern_constant(iseq, ret, node, match_failed, in_single_pattern, base_index));
7586 ADD_INSN(ret, line_node, dup);
7587 ADD_INSN1(ret, line_node, putobject,
ID2SYM(rb_intern(
"deconstruct_keys")));
7588 ADD_SEND(ret, line_node, idRespond_to,
INT2FIX(1));
7589 if (in_single_pattern) {
7590 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"%p does not respond to #deconstruct_keys"), base_index + 1 ));
7592 ADD_INSNL(ret, line_node, branchunless, match_failed);
7595 ADD_INSN(ret, line_node, putnil);
7598 ADD_INSN1(ret, line_node, duparray, keys);
7601 ADD_SEND(ret, line_node, rb_intern(
"deconstruct_keys"),
INT2FIX(1));
7603 ADD_INSN(ret, line_node, dup);
7605 ADD_INSNL(ret, line_node, branchunless, type_error);
7607 if (RNODE_HSHPTN(node)->nd_pkwrestarg) {
7608 ADD_SEND(ret, line_node, rb_intern(
"dup"),
INT2FIX(0));
7611 if (RNODE_HSHPTN(node)->nd_pkwargs) {
7615 args = RNODE_HASH(RNODE_HSHPTN(node)->nd_pkwargs)->nd_head;
7617 DECL_ANCHOR(match_values);
7618 INIT_ANCHOR(match_values);
7619 keys_num =
rb_long2int(RNODE_LIST(args)->as.nd_alen) / 2;
7620 for (i = 0; i < keys_num; i++) {
7621 NODE *key_node = RNODE_LIST(args)->nd_head;
7622 NODE *value_node = RNODE_LIST(RNODE_LIST(args)->nd_next)->nd_head;
7623 VALUE key = get_symbol_value(iseq, key_node);
7625 ADD_INSN(ret, line_node, dup);
7626 ADD_INSN1(ret, line_node, putobject, key);
7627 ADD_SEND(ret, line_node, rb_intern(
"key?"),
INT2FIX(1));
7628 if (in_single_pattern) {
7629 LABEL *match_succeeded;
7630 match_succeeded = NEW_LABEL(line);
7632 ADD_INSN(ret, line_node, dup);
7633 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7635 ADD_INSN1(ret, line_node, putobject,
rb_str_freeze(rb_sprintf(
"key not found: %+"PRIsVALUE, key)));
7636 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 2 ));
7637 ADD_INSN1(ret, line_node, putobject,
Qtrue);
7638 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 3 ));
7639 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7640 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_MATCHEE + 4 ));
7641 ADD_INSN1(ret, line_node, putobject, key);
7642 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_KEY + 5 ));
7644 ADD_INSN1(ret, line_node, adjuststack,
INT2FIX(4));
7646 ADD_LABEL(ret, match_succeeded);
7648 ADD_INSNL(ret, line_node, branchunless, match_failed);
7650 ADD_INSN(match_values, line_node, dup);
7651 ADD_INSN1(match_values, line_node, putobject, key);
7652 ADD_SEND(match_values, line_node, RNODE_HSHPTN(node)->nd_pkwrestarg ? rb_intern(
"delete") : idAREF,
INT2FIX(1));
7653 CHECK(iseq_compile_pattern_match(iseq, match_values, value_node, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7654 args = RNODE_LIST(RNODE_LIST(args)->nd_next)->nd_next;
7656 ADD_SEQ(ret, match_values);
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(
"%p is not empty"), base_index + 1 ));
7665 ADD_INSNL(ret, line_node, branchunless, match_failed);
7668 if (RNODE_HSHPTN(node)->nd_pkwrestarg) {
7669 if (RNODE_HSHPTN(node)->nd_pkwrestarg == NODE_SPECIAL_NO_REST_KEYWORD) {
7670 ADD_INSN(ret, line_node, dup);
7671 ADD_SEND(ret, line_node, idEmptyP,
INT2FIX(0));
7672 if (in_single_pattern) {
7673 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"rest of %p is not empty"), base_index + 1 ));
7675 ADD_INSNL(ret, line_node, branchunless, match_failed);
7678 ADD_INSN(ret, line_node, dup);
7679 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_HSHPTN(node)->nd_pkwrestarg, match_failed, in_single_pattern, in_alt_pattern, base_index + 1 ,
false));
7683 ADD_INSN(ret, line_node, pop);
7684 ADD_INSNL(ret, line_node, jump, matched);
7685 ADD_INSN(ret, line_node, putnil);
7687 ADD_LABEL(ret, type_error);
7688 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7690 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"deconstruct_keys must return Hash"));
7691 ADD_SEND(ret, line_node, id_core_raise,
INT2FIX(2));
7692 ADD_INSN(ret, line_node, pop);
7694 ADD_LABEL(ret, match_failed);
7695 ADD_INSN(ret, line_node, pop);
7696 ADD_INSNL(ret, line_node, jump, unmatched);
7705 case NODE_IMAGINARY:
7733 CHECK(COMPILE(ret,
"case in literal", node));
7734 if (in_single_pattern) {
7735 ADD_INSN1(ret, line_node, dupn,
INT2FIX(2));
7737 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
7738 if (in_single_pattern) {
7739 CHECK(iseq_compile_pattern_set_eqq_errmsg(iseq, ret, node, base_index + 2 ));
7741 ADD_INSNL(ret, line_node, branchif, matched);
7742 ADD_INSNL(ret, line_node, jump, unmatched);
7746 ID id = RNODE_LASGN(node)->nd_vid;
7747 int idx = ISEQ_BODY(body->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
7749 if (in_alt_pattern) {
7750 const char *name = rb_id2name(
id);
7751 if (name && strlen(name) > 0 && name[0] !=
'_') {
7752 COMPILE_ERROR(ERROR_ARGS
"illegal variable in alternative pattern (%"PRIsVALUE
")",
7758 ADD_SETLOCAL(ret, line_node, idx, get_lvar_level(iseq));
7759 ADD_INSNL(ret, line_node, jump, matched);
7764 ID id = RNODE_DASGN(node)->nd_vid;
7766 idx = get_dyna_var_idx(iseq,
id, &lv, &ls);
7768 if (in_alt_pattern) {
7769 const char *name = rb_id2name(
id);
7770 if (name && strlen(name) > 0 && name[0] !=
'_') {
7771 COMPILE_ERROR(ERROR_ARGS
"illegal variable in alternative pattern (%"PRIsVALUE
")",
7778 COMPILE_ERROR(ERROR_ARGS
"NODE_DASGN: unknown id (%"PRIsVALUE
")",
7782 ADD_SETLOCAL(ret, line_node, ls - idx, lv);
7783 ADD_INSNL(ret, line_node, jump, matched);
7788 LABEL *match_failed;
7789 match_failed = unmatched;
7790 CHECK(iseq_compile_pattern_match(iseq, ret, RNODE_IF(node)->nd_body, unmatched, in_single_pattern, in_alt_pattern, base_index, use_deconstructed_cache));
7791 CHECK(COMPILE(ret,
"case in if", RNODE_IF(node)->nd_cond));
7792 if (in_single_pattern) {
7793 LABEL *match_succeeded;
7794 match_succeeded = NEW_LABEL(line);
7796 ADD_INSN(ret, line_node, dup);
7797 if (nd_type_p(node, NODE_IF)) {
7798 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7801 ADD_INSNL(ret, line_node, branchunless, match_succeeded);
7804 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"guard clause does not return true"));
7805 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7806 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7807 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7809 ADD_INSN(ret, line_node, pop);
7810 ADD_INSN(ret, line_node, pop);
7812 ADD_LABEL(ret, match_succeeded);
7814 if (nd_type_p(node, NODE_IF)) {
7815 ADD_INSNL(ret, line_node, branchunless, match_failed);
7818 ADD_INSNL(ret, line_node, branchif, match_failed);
7820 ADD_INSNL(ret, line_node, jump, matched);
7825 LABEL *match_failed;
7826 match_failed = NEW_LABEL(line);
7828 n = RNODE_HASH(node)->nd_head;
7829 if (! (nd_type_p(n, NODE_LIST) && RNODE_LIST(n)->as.nd_alen == 2)) {
7830 COMPILE_ERROR(ERROR_ARGS
"unexpected node");
7834 ADD_INSN(ret, line_node, dup);
7835 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));
7836 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));
7837 ADD_INSN(ret, line_node, putnil);
7839 ADD_LABEL(ret, match_failed);
7840 ADD_INSN(ret, line_node, pop);
7841 ADD_INSNL(ret, line_node, jump, unmatched);
7845 LABEL *match_succeeded, *fin;
7846 match_succeeded = NEW_LABEL(line);
7847 fin = NEW_LABEL(line);
7849 ADD_INSN(ret, line_node, dup);
7850 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));
7851 ADD_LABEL(ret, match_succeeded);
7852 ADD_INSN(ret, line_node, pop);
7853 ADD_INSNL(ret, line_node, jump, matched);
7854 ADD_INSN(ret, line_node, putnil);
7855 ADD_LABEL(ret, fin);
7856 CHECK(iseq_compile_pattern_each(iseq, ret, RNODE_OR(node)->nd_2nd, matched, unmatched, in_single_pattern,
true, base_index, use_deconstructed_cache));
7860 UNKNOWN_NODE(
"NODE_IN", node, COMPILE_NG);
7866iseq_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)
7868 LABEL *fin = NEW_LABEL(nd_line(node));
7869 CHECK(iseq_compile_pattern_each(iseq, ret, node, fin, unmatched, in_single_pattern, in_alt_pattern, base_index, use_deconstructed_cache));
7870 ADD_LABEL(ret, fin);
7875iseq_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)
7877 const NODE *line_node = node;
7879 if (RNODE_ARYPTN(node)->nd_pconst) {
7880 ADD_INSN(ret, line_node, dup);
7881 CHECK(COMPILE(ret,
"constant", RNODE_ARYPTN(node)->nd_pconst));
7882 if (in_single_pattern) {
7883 ADD_INSN1(ret, line_node, dupn,
INT2FIX(2));
7885 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_CASE));
7886 if (in_single_pattern) {
7887 CHECK(iseq_compile_pattern_set_eqq_errmsg(iseq, ret, node, base_index + 3 ));
7889 ADD_INSNL(ret, line_node, branchunless, match_failed);
7896iseq_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)
7898 const NODE *line_node = node;
7902 if (use_deconstructed_cache) {
7904 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7905 ADD_INSNL(ret, line_node, branchnil, deconstruct);
7908 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7909 ADD_INSNL(ret, line_node, branchunless, match_failed);
7912 ADD_INSN(ret, line_node, pop);
7913 ADD_INSN1(ret, line_node, topn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE - 1 ));
7914 ADD_INSNL(ret, line_node, jump, deconstructed);
7917 ADD_INSNL(ret, line_node, jump, deconstruct);
7920 ADD_LABEL(ret, deconstruct);
7921 ADD_INSN(ret, line_node, dup);
7922 ADD_INSN1(ret, line_node, putobject,
ID2SYM(rb_intern(
"deconstruct")));
7923 ADD_SEND(ret, line_node, idRespond_to,
INT2FIX(1));
7926 if (use_deconstructed_cache) {
7927 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE + 1 ));
7930 if (in_single_pattern) {
7931 CHECK(iseq_compile_pattern_set_general_errmsg(iseq, ret, node, rb_fstring_lit(
"%p does not respond to #deconstruct"), base_index + 1 ));
7934 ADD_INSNL(ret, line_node, branchunless, match_failed);
7936 ADD_SEND(ret, line_node, rb_intern(
"deconstruct"),
INT2FIX(0));
7939 if (use_deconstructed_cache) {
7940 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_DECONSTRUCTED_CACHE));
7943 ADD_INSN(ret, line_node, dup);
7945 ADD_INSNL(ret, line_node, branchunless, type_error);
7947 ADD_LABEL(ret, deconstructed);
7963 const int line = nd_line(node);
7964 const NODE *line_node = node;
7965 LABEL *match_succeeded = NEW_LABEL(line);
7967 ADD_INSN(ret, line_node, dup);
7968 ADD_INSNL(ret, line_node, branchif, match_succeeded);
7970 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
7971 ADD_INSN1(ret, line_node, putobject, errmsg);
7972 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
7973 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(2));
7974 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
7976 ADD_INSN1(ret, line_node, putobject,
Qfalse);
7977 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
7979 ADD_INSN(ret, line_node, pop);
7980 ADD_INSN(ret, line_node, pop);
7981 ADD_LABEL(ret, match_succeeded);
7997 const int line = nd_line(node);
7998 const NODE *line_node = node;
7999 LABEL *match_succeeded = NEW_LABEL(line);
8001 ADD_INSN(ret, line_node, dup);
8002 ADD_INSNL(ret, line_node, branchif, match_succeeded);
8004 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8005 ADD_INSN1(ret, line_node, putobject, errmsg);
8006 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
8007 ADD_INSN(ret, line_node, dup);
8008 ADD_SEND(ret, line_node, idLength,
INT2FIX(0));
8009 ADD_INSN1(ret, line_node, putobject, pattern_length);
8010 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(4));
8011 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
8013 ADD_INSN1(ret, line_node, putobject,
Qfalse);
8014 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2));
8016 ADD_INSN(ret, line_node, pop);
8017 ADD_INSN(ret, line_node, pop);
8018 ADD_LABEL(ret, match_succeeded);
8024iseq_compile_pattern_set_eqq_errmsg(
rb_iseq_t *iseq,
LINK_ANCHOR *
const ret,
const NODE *
const node,
int base_index)
8034 const int line = nd_line(node);
8035 const NODE *line_node = node;
8036 LABEL *match_succeeded = NEW_LABEL(line);
8038 ADD_INSN(ret, line_node, dup);
8039 ADD_INSNL(ret, line_node, branchif, match_succeeded);
8041 ADD_INSN1(ret, line_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8042 ADD_INSN1(ret, line_node, putobject, rb_fstring_lit(
"%p === %p does not return true"));
8043 ADD_INSN1(ret, line_node, topn,
INT2FIX(3));
8044 ADD_INSN1(ret, line_node, topn,
INT2FIX(5));
8045 ADD_SEND(ret, line_node, id_core_sprintf,
INT2FIX(3));
8046 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_ERROR_STRING + 1 ));
8048 ADD_INSN1(ret, line_node, putobject,
Qfalse);
8049 ADD_INSN1(ret, line_node, setn,
INT2FIX(base_index + CASE3_BI_OFFSET_KEY_ERROR_P + 2 ));
8051 ADD_INSN(ret, line_node, pop);
8052 ADD_INSN(ret, line_node, pop);
8054 ADD_LABEL(ret, match_succeeded);
8055 ADD_INSN1(ret, line_node, setn,
INT2FIX(2));
8056 ADD_INSN(ret, line_node, pop);
8057 ADD_INSN(ret, line_node, pop);
8065 const NODE *pattern;
8066 const NODE *node = orig_node;
8067 LABEL *endlabel, *elselabel;
8069 DECL_ANCHOR(body_seq);
8070 DECL_ANCHOR(cond_seq);
8072 enum node_type
type;
8073 const NODE *line_node;
8076 bool single_pattern;
8079 INIT_ANCHOR(body_seq);
8080 INIT_ANCHOR(cond_seq);
8082 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"case");
8084 node = RNODE_CASE3(node)->nd_body;
8085 EXPECT_NODE(
"NODE_CASE3", node, NODE_IN, COMPILE_NG);
8086 type = nd_type(node);
8087 line = nd_line(node);
8089 single_pattern = !RNODE_IN(node)->nd_next;
8091 endlabel = NEW_LABEL(line);
8092 elselabel = NEW_LABEL(line);
8094 if (single_pattern) {
8096 ADD_INSN(head, line_node, putnil);
8097 ADD_INSN(head, line_node, putnil);
8098 ADD_INSN1(head, line_node, putobject,
Qfalse);
8099 ADD_INSN(head, line_node, putnil);
8101 ADD_INSN(head, line_node, putnil);
8103 CHECK(COMPILE(head,
"case base", RNODE_CASE3(orig_node)->nd_head));
8107 while (
type == NODE_IN) {
8111 ADD_INSN(body_seq, line_node, putnil);
8113 l1 = NEW_LABEL(line);
8114 ADD_LABEL(body_seq, l1);
8115 ADD_INSN1(body_seq, line_node, adjuststack,
INT2FIX(single_pattern ? 6 : 2));
8117 const NODE *
const coverage_node = RNODE_IN(node)->nd_body ? RNODE_IN(node)->nd_body : node;
8118 add_trace_branch_coverage(
8121 nd_code_loc(coverage_node),
8122 nd_node_id(coverage_node),
8127 CHECK(COMPILE_(body_seq,
"in body", RNODE_IN(node)->nd_body, popped));
8128 ADD_INSNL(body_seq, line_node, jump, endlabel);
8130 pattern = RNODE_IN(node)->nd_head;
8132 int pat_line = nd_line(pattern);
8133 LABEL *next_pat = NEW_LABEL(pat_line);
8134 ADD_INSN (cond_seq, pattern, dup);
8136 CHECK(iseq_compile_pattern_each(iseq, cond_seq, pattern, l1, next_pat, single_pattern,
false, 2,
true));
8137 ADD_LABEL(cond_seq, next_pat);
8138 LABEL_UNREMOVABLE(next_pat);
8141 COMPILE_ERROR(ERROR_ARGS
"unexpected node");
8145 node = RNODE_IN(node)->nd_next;
8149 type = nd_type(node);
8150 line = nd_line(node);
8155 ADD_LABEL(cond_seq, elselabel);
8156 ADD_INSN(cond_seq, line_node, pop);
8157 ADD_INSN(cond_seq, line_node, pop);
8158 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(node), nd_node_id(node), branch_id,
"else", branches);
8159 CHECK(COMPILE_(cond_seq,
"else", node, popped));
8160 ADD_INSNL(cond_seq, line_node, jump, endlabel);
8161 ADD_INSN(cond_seq, line_node, putnil);
8163 ADD_INSN(cond_seq, line_node, putnil);
8167 debugs(
"== else (implicit)\n");
8168 ADD_LABEL(cond_seq, elselabel);
8169 add_trace_branch_coverage(iseq, cond_seq, nd_code_loc(orig_node), nd_node_id(orig_node), branch_id,
"else", branches);
8170 ADD_INSN1(cond_seq, orig_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8172 if (single_pattern) {
8180 LABEL *key_error, *fin;
8183 key_error = NEW_LABEL(line);
8184 fin = NEW_LABEL(line);
8187 kw_arg->references = 0;
8188 kw_arg->keyword_len = 2;
8189 kw_arg->keywords[0] =
ID2SYM(rb_intern(
"matchee"));
8190 kw_arg->keywords[1] =
ID2SYM(rb_intern(
"key"));
8192 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_P + 2));
8193 ADD_INSNL(cond_seq, orig_node, branchif, 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_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(2));
8201 ADD_INSNL(cond_seq, orig_node, jump, fin);
8203 ADD_LABEL(cond_seq, key_error);
8205 ADD_INSN1(cond_seq, orig_node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
8206 ADD_INSN1(cond_seq, orig_node, putobject, rb_fstring_lit(
"%p: %s"));
8207 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(4));
8208 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_ERROR_STRING + 6));
8209 ADD_SEND(cond_seq, orig_node, id_core_sprintf,
INT2FIX(3));
8210 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_MATCHEE + 4));
8211 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(CASE3_BI_OFFSET_KEY_ERROR_KEY + 5));
8212 ADD_SEND_R(cond_seq, orig_node, rb_intern(
"new"),
INT2FIX(1), NULL,
INT2FIX(VM_CALL_KWARG), kw_arg);
8213 ADD_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(1));
8215 ADD_LABEL(cond_seq, fin);
8219 ADD_INSN1(cond_seq, orig_node, topn,
INT2FIX(2));
8220 ADD_SEND(cond_seq, orig_node, id_core_raise,
INT2FIX(2));
8222 ADD_INSN1(cond_seq, orig_node, adjuststack,
INT2FIX(single_pattern ? 7 : 3));
8224 ADD_INSN(cond_seq, orig_node, putnil);
8226 ADD_INSNL(cond_seq, orig_node, jump, endlabel);
8227 ADD_INSN1(cond_seq, orig_node, dupn,
INT2FIX(single_pattern ? 5 : 1));
8229 ADD_INSN(cond_seq, line_node, putnil);
8233 ADD_SEQ(ret, cond_seq);
8234 ADD_SEQ(ret, body_seq);
8235 ADD_LABEL(ret, endlabel);
8239#undef CASE3_BI_OFFSET_DECONSTRUCTED_CACHE
8240#undef CASE3_BI_OFFSET_ERROR_STRING
8241#undef CASE3_BI_OFFSET_KEY_ERROR_P
8242#undef CASE3_BI_OFFSET_KEY_ERROR_MATCHEE
8243#undef CASE3_BI_OFFSET_KEY_ERROR_KEY
8248 const int line = (int)nd_line(node);
8249 const NODE *line_node = node;
8251 LABEL *prev_start_label = ISEQ_COMPILE_DATA(iseq)->start_label;
8252 LABEL *prev_end_label = ISEQ_COMPILE_DATA(iseq)->end_label;
8253 LABEL *prev_redo_label = ISEQ_COMPILE_DATA(iseq)->redo_label;
8254 int prev_loopval_popped = ISEQ_COMPILE_DATA(iseq)->loopval_popped;
8259 LABEL *next_label = ISEQ_COMPILE_DATA(iseq)->start_label = NEW_LABEL(line);
8260 LABEL *redo_label = ISEQ_COMPILE_DATA(iseq)->redo_label = NEW_LABEL(line);
8261 LABEL *break_label = ISEQ_COMPILE_DATA(iseq)->end_label = NEW_LABEL(line);
8262 LABEL *end_label = NEW_LABEL(line);
8263 LABEL *adjust_label = NEW_LABEL(line);
8265 LABEL *next_catch_label = NEW_LABEL(line);
8266 LABEL *tmp_label = NULL;
8268 ISEQ_COMPILE_DATA(iseq)->loopval_popped = 0;
8269 push_ensure_entry(iseq, &enl, NULL, NULL);
8271 if (RNODE_WHILE(node)->nd_state == 1) {
8272 ADD_INSNL(ret, line_node, jump, next_label);
8275 tmp_label = NEW_LABEL(line);
8276 ADD_INSNL(ret, line_node, jump, tmp_label);
8278 ADD_LABEL(ret, adjust_label);
8279 ADD_INSN(ret, line_node, putnil);
8280 ADD_LABEL(ret, next_catch_label);
8281 ADD_INSN(ret, line_node, pop);
8282 ADD_INSNL(ret, line_node, jump, next_label);
8283 if (tmp_label) ADD_LABEL(ret, tmp_label);
8285 ADD_LABEL(ret, redo_label);
8286 branches = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
type == NODE_WHILE ?
"while" :
"until");
8288 const NODE *
const coverage_node = RNODE_WHILE(node)->nd_body ? RNODE_WHILE(node)->nd_body : node;
8289 add_trace_branch_coverage(
8292 nd_code_loc(coverage_node),
8293 nd_node_id(coverage_node),
8298 CHECK(COMPILE_POPPED(ret,
"while body", RNODE_WHILE(node)->nd_body));
8299 ADD_LABEL(ret, next_label);
8301 if (
type == NODE_WHILE) {
8302 CHECK(compile_branch_condition(iseq, ret, RNODE_WHILE(node)->nd_cond,
8303 redo_label, end_label));
8307 CHECK(compile_branch_condition(iseq, ret, RNODE_WHILE(node)->nd_cond,
8308 end_label, redo_label));
8311 ADD_LABEL(ret, end_label);
8312 ADD_ADJUST_RESTORE(ret, adjust_label);
8314 if (UNDEF_P(RNODE_WHILE(node)->nd_state)) {
8316 COMPILE_ERROR(ERROR_ARGS
"unsupported: putundef");
8320 ADD_INSN(ret, line_node, putnil);
8323 ADD_LABEL(ret, break_label);
8326 ADD_INSN(ret, line_node, pop);
8329 ADD_CATCH_ENTRY(CATCH_TYPE_BREAK, redo_label, break_label, NULL,
8331 ADD_CATCH_ENTRY(CATCH_TYPE_NEXT, redo_label, break_label, NULL,
8333 ADD_CATCH_ENTRY(CATCH_TYPE_REDO, redo_label, break_label, NULL,
8334 ISEQ_COMPILE_DATA(iseq)->redo_label);
8336 ISEQ_COMPILE_DATA(iseq)->start_label = prev_start_label;
8337 ISEQ_COMPILE_DATA(iseq)->end_label = prev_end_label;
8338 ISEQ_COMPILE_DATA(iseq)->redo_label = prev_redo_label;
8339 ISEQ_COMPILE_DATA(iseq)->loopval_popped = prev_loopval_popped;
8340 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack->prev;
8347 const int line = nd_line(node);
8348 const NODE *line_node = node;
8349 const rb_iseq_t *prevblock = ISEQ_COMPILE_DATA(iseq)->current_block;
8350 LABEL *retry_label = NEW_LABEL(line);
8351 LABEL *retry_end_l = NEW_LABEL(line);
8354 ADD_LABEL(ret, retry_label);
8355 if (nd_type_p(node, NODE_FOR)) {
8356 CHECK(COMPILE(ret,
"iter caller (for)", RNODE_FOR(node)->nd_iter));
8358 ISEQ_COMPILE_DATA(iseq)->current_block = child_iseq =
8359 NEW_CHILD_ISEQ(RNODE_FOR(node)->nd_body, make_name_for_block(iseq),
8360 ISEQ_TYPE_BLOCK, line);
8361 ADD_SEND_WITH_BLOCK(ret, line_node, idEach,
INT2FIX(0), child_iseq);
8364 ISEQ_COMPILE_DATA(iseq)->current_block = child_iseq =
8365 NEW_CHILD_ISEQ(RNODE_ITER(node)->nd_body, make_name_for_block(iseq),
8366 ISEQ_TYPE_BLOCK, line);
8367 CHECK(COMPILE(ret,
"iter caller", RNODE_ITER(node)->nd_iter));
8381 iobj = IS_INSN(last_elem) ? (
INSN*) last_elem : (
INSN*) get_prev_insn((
INSN*) last_elem);
8382 while (!IS_INSN_ID(iobj, send) && !IS_INSN_ID(iobj, invokesuper) && !IS_INSN_ID(iobj, sendforward) && !IS_INSN_ID(iobj, invokesuperforward)) {
8383 iobj = (
INSN*) get_prev_insn(iobj);
8385 ELEM_INSERT_NEXT(&iobj->link, (
LINK_ELEMENT*) retry_end_l);
8389 if (&iobj->link == LAST_ELEMENT(ret)) {
8395 ADD_INSN(ret, line_node, pop);
8398 ISEQ_COMPILE_DATA(iseq)->current_block = prevblock;
8400 ADD_CATCH_ENTRY(CATCH_TYPE_BREAK, retry_label, retry_end_l, child_iseq, retry_end_l);
8410 const NODE *line_node = node;
8411 const NODE *var = RNODE_FOR_MASGN(node)->nd_var;
8412 LABEL *not_single = NEW_LABEL(nd_line(var));
8413 LABEL *not_ary = NEW_LABEL(nd_line(var));
8414 CHECK(COMPILE(ret,
"for var", var));
8415 ADD_INSN(ret, line_node, dup);
8416 ADD_CALL(ret, line_node, idLength,
INT2FIX(0));
8417 ADD_INSN1(ret, line_node, putobject,
INT2FIX(1));
8418 ADD_CALL(ret, line_node, idEq,
INT2FIX(1));
8419 ADD_INSNL(ret, line_node, branchunless, not_single);
8420 ADD_INSN(ret, line_node, dup);
8421 ADD_INSN1(ret, line_node, putobject,
INT2FIX(0));
8422 ADD_CALL(ret, line_node, idAREF,
INT2FIX(1));
8423 ADD_INSN1(ret, line_node, putobject,
rb_cArray);
8424 ADD_INSN(ret, line_node, swap);
8425 ADD_CALL(ret, line_node, rb_intern(
"try_convert"),
INT2FIX(1));
8426 ADD_INSN(ret, line_node, dup);
8427 ADD_INSNL(ret, line_node, branchunless, not_ary);
8428 ADD_INSN(ret, line_node, swap);
8429 ADD_LABEL(ret, not_ary);
8430 ADD_INSN(ret, line_node, pop);
8431 ADD_LABEL(ret, not_single);
8438 const NODE *line_node = node;
8439 unsigned long throw_flag = 0;
8441 if (ISEQ_COMPILE_DATA(iseq)->redo_label != 0 && can_add_ensure_iseq(iseq)) {
8443 LABEL *splabel = NEW_LABEL(0);
8444 ADD_LABEL(ret, splabel);
8445 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8446 CHECK(COMPILE_(ret,
"break val (while/until)", RNODE_BREAK(node)->nd_stts,
8447 ISEQ_COMPILE_DATA(iseq)->loopval_popped));
8448 add_ensure_iseq(ret, iseq, 0);
8449 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->end_label);
8450 ADD_ADJUST_RESTORE(ret, splabel);
8453 ADD_INSN(ret, line_node, putnil);
8460 if (!ISEQ_COMPILE_DATA(ip)) {
8465 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8466 throw_flag = VM_THROW_NO_ESCAPE_FLAG;
8468 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8471 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8472 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with break");
8476 ip = ISEQ_BODY(ip)->parent_iseq;
8481 CHECK(COMPILE(ret,
"break val (block)", RNODE_BREAK(node)->nd_stts));
8482 ADD_INSN1(ret, line_node,
throw,
INT2FIX(throw_flag | TAG_BREAK));
8484 ADD_INSN(ret, line_node, pop);
8488 COMPILE_ERROR(ERROR_ARGS
"Invalid break");
8497 const NODE *line_node = node;
8498 unsigned long throw_flag = 0;
8500 if (ISEQ_COMPILE_DATA(iseq)->redo_label != 0 && can_add_ensure_iseq(iseq)) {
8501 LABEL *splabel = NEW_LABEL(0);
8502 debugs(
"next in while loop\n");
8503 ADD_LABEL(ret, splabel);
8504 CHECK(COMPILE(ret,
"next val/valid syntax?", RNODE_NEXT(node)->nd_stts));
8505 add_ensure_iseq(ret, iseq, 0);
8506 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8507 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->start_label);
8508 ADD_ADJUST_RESTORE(ret, splabel);
8510 ADD_INSN(ret, line_node, putnil);
8513 else if (ISEQ_COMPILE_DATA(iseq)->end_label && can_add_ensure_iseq(iseq)) {
8514 LABEL *splabel = NEW_LABEL(0);
8515 debugs(
"next in block\n");
8516 ADD_LABEL(ret, splabel);
8517 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->start_label);
8518 CHECK(COMPILE(ret,
"next val", RNODE_NEXT(node)->nd_stts));
8519 add_ensure_iseq(ret, iseq, 0);
8520 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->end_label);
8521 ADD_ADJUST_RESTORE(ret, splabel);
8524 ADD_INSN(ret, line_node, putnil);
8531 if (!ISEQ_COMPILE_DATA(ip)) {
8536 throw_flag = VM_THROW_NO_ESCAPE_FLAG;
8537 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8541 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8544 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8545 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with next");
8549 ip = ISEQ_BODY(ip)->parent_iseq;
8552 CHECK(COMPILE(ret,
"next val", RNODE_NEXT(node)->nd_stts));
8553 ADD_INSN1(ret, line_node,
throw,
INT2FIX(throw_flag | TAG_NEXT));
8556 ADD_INSN(ret, line_node, pop);
8560 COMPILE_ERROR(ERROR_ARGS
"Invalid next");
8570 const NODE *line_node = node;
8572 if (ISEQ_COMPILE_DATA(iseq)->redo_label && can_add_ensure_iseq(iseq)) {
8573 LABEL *splabel = NEW_LABEL(0);
8574 debugs(
"redo in while");
8575 ADD_LABEL(ret, splabel);
8576 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->redo_label);
8577 add_ensure_iseq(ret, iseq, 0);
8578 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->redo_label);
8579 ADD_ADJUST_RESTORE(ret, splabel);
8581 ADD_INSN(ret, line_node, putnil);
8584 else if (ISEQ_BODY(iseq)->
type != ISEQ_TYPE_EVAL && ISEQ_COMPILE_DATA(iseq)->start_label && can_add_ensure_iseq(iseq)) {
8585 LABEL *splabel = NEW_LABEL(0);
8587 debugs(
"redo in block");
8588 ADD_LABEL(ret, splabel);
8589 add_ensure_iseq(ret, iseq, 0);
8590 ADD_ADJUST(ret, line_node, ISEQ_COMPILE_DATA(iseq)->start_label);
8591 ADD_INSNL(ret, line_node, jump, ISEQ_COMPILE_DATA(iseq)->start_label);
8592 ADD_ADJUST_RESTORE(ret, splabel);
8595 ADD_INSN(ret, line_node, putnil);
8602 if (!ISEQ_COMPILE_DATA(ip)) {
8607 if (ISEQ_COMPILE_DATA(ip)->redo_label != 0) {
8610 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_BLOCK) {
8613 else if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_EVAL) {
8614 COMPILE_ERROR(ERROR_ARGS
"Can't escape from eval with redo");
8618 ip = ISEQ_BODY(ip)->parent_iseq;
8621 ADD_INSN(ret, line_node, putnil);
8622 ADD_INSN1(ret, line_node,
throw,
INT2FIX(VM_THROW_NO_ESCAPE_FLAG | TAG_REDO));
8625 ADD_INSN(ret, line_node, pop);
8629 COMPILE_ERROR(ERROR_ARGS
"Invalid redo");
8639 const NODE *line_node = node;
8641 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_RESCUE) {
8642 ADD_INSN(ret, line_node, putnil);
8643 ADD_INSN1(ret, line_node,
throw,
INT2FIX(TAG_RETRY));
8646 ADD_INSN(ret, line_node, pop);
8650 COMPILE_ERROR(ERROR_ARGS
"Invalid retry");
8659 const int line = nd_line(node);
8660 const NODE *line_node = node;
8661 LABEL *lstart = NEW_LABEL(line);
8662 LABEL *lend = NEW_LABEL(line);
8663 LABEL *lcont = NEW_LABEL(line);
8664 const rb_iseq_t *rescue = NEW_CHILD_ISEQ(RNODE_RESCUE(node)->nd_resq,
8666 ISEQ_BODY(iseq)->location.label),
8667 ISEQ_TYPE_RESCUE, line);
8669 lstart->rescued = LABEL_RESCUE_BEG;
8670 lend->rescued = LABEL_RESCUE_END;
8671 ADD_LABEL(ret, lstart);
8673 bool prev_in_rescue = ISEQ_COMPILE_DATA(iseq)->in_rescue;
8674 ISEQ_COMPILE_DATA(iseq)->in_rescue =
true;
8676 CHECK(COMPILE(ret,
"rescue head", RNODE_RESCUE(node)->nd_head));
8678 ISEQ_COMPILE_DATA(iseq)->in_rescue = prev_in_rescue;
8680 ADD_LABEL(ret, lend);
8681 if (RNODE_RESCUE(node)->nd_else) {
8682 ADD_INSN(ret, line_node, pop);
8683 CHECK(COMPILE(ret,
"rescue else", RNODE_RESCUE(node)->nd_else));
8685 ADD_INSN(ret, line_node, nop);
8686 ADD_LABEL(ret, lcont);
8689 ADD_INSN(ret, line_node, pop);
8693 ADD_CATCH_ENTRY(CATCH_TYPE_RESCUE, lstart, lend, rescue, lcont);
8694 ADD_CATCH_ENTRY(CATCH_TYPE_RETRY, lend, lcont, NULL, lstart);
8701 const int line = nd_line(node);
8702 const NODE *line_node = node;
8703 const NODE *resq = node;
8705 LABEL *label_miss, *label_hit;
8708 label_miss = NEW_LABEL(line);
8709 label_hit = NEW_LABEL(line);
8711 narg = RNODE_RESBODY(resq)->nd_args;
8713 switch (nd_type(narg)) {
8716 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8717 CHECK(COMPILE(ret,
"rescue arg", RNODE_LIST(narg)->nd_head));
8718 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE));
8719 ADD_INSNL(ret, line_node, branchif, label_hit);
8720 narg = RNODE_LIST(narg)->nd_next;
8726 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8727 CHECK(COMPILE(ret,
"rescue/cond splat", narg));
8728 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE | VM_CHECKMATCH_ARRAY));
8729 ADD_INSNL(ret, line_node, branchif, label_hit);
8732 UNKNOWN_NODE(
"NODE_RESBODY", narg, COMPILE_NG);
8736 ADD_GETLOCAL(ret, line_node, LVAR_ERRINFO, 0);
8738 ADD_INSN1(ret, line_node, checkmatch,
INT2FIX(VM_CHECKMATCH_TYPE_RESCUE));
8739 ADD_INSNL(ret, line_node, branchif, label_hit);
8741 ADD_INSNL(ret, line_node, jump, label_miss);
8742 ADD_LABEL(ret, label_hit);
8745 if (RNODE_RESBODY(resq)->nd_exc_var) {
8746 CHECK(COMPILE_POPPED(ret,
"resbody exc_var", RNODE_RESBODY(resq)->nd_exc_var));
8749 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) {
8751 ADD_SYNTHETIC_INSN(ret, nd_line(RNODE_RESBODY(resq)->nd_body), -1, putnil);
8754 CHECK(COMPILE(ret,
"resbody body", RNODE_RESBODY(resq)->nd_body));
8757 if (ISEQ_COMPILE_DATA(iseq)->option->tailcall_optimization) {
8758 ADD_INSN(ret, line_node, nop);
8760 ADD_INSN(ret, line_node, leave);
8761 ADD_LABEL(ret, label_miss);
8762 resq = RNODE_RESBODY(resq)->nd_next;
8770 const int line = nd_line(RNODE_ENSURE(node)->nd_ensr);
8771 const NODE *line_node = node;
8773 const rb_iseq_t *ensure = NEW_CHILD_ISEQ(RNODE_ENSURE(node)->nd_ensr,
8775 ISEQ_TYPE_ENSURE, line);
8776 LABEL *lstart = NEW_LABEL(line);
8777 LABEL *lend = NEW_LABEL(line);
8778 LABEL *lcont = NEW_LABEL(line);
8786 CHECK(COMPILE_POPPED(ensr,
"ensure ensr", RNODE_ENSURE(node)->nd_ensr));
8788 last_leave = last && IS_INSN(last) && IS_INSN_ID(last, leave);
8793 push_ensure_entry(iseq, &enl, &er, RNODE_ENSURE(node)->nd_ensr);
8795 ADD_LABEL(ret, lstart);
8796 CHECK(COMPILE_(ret,
"ensure head", RNODE_ENSURE(node)->nd_head, (popped | last_leave)));
8797 ADD_LABEL(ret, lend);
8799 if (!popped && last_leave) ADD_INSN(ret, line_node, putnil);
8800 ADD_LABEL(ret, lcont);
8801 if (last_leave) ADD_INSN(ret, line_node, pop);
8803 erange = ISEQ_COMPILE_DATA(iseq)->ensure_node_stack->erange;
8804 if (lstart->link.next != &lend->link) {
8806 ADD_CATCH_ENTRY(CATCH_TYPE_ENSURE, erange->begin, erange->end,
8808 erange = erange->next;
8812 ISEQ_COMPILE_DATA(iseq)->ensure_node_stack = enl.prev;
8819 const NODE *line_node = node;
8822 enum rb_iseq_type
type = ISEQ_BODY(iseq)->type;
8824 enum rb_iseq_type t =
type;
8825 const NODE *retval = RNODE_RETURN(node)->nd_stts;
8828 while (t == ISEQ_TYPE_RESCUE || t == ISEQ_TYPE_ENSURE) {
8829 if (!(is = ISEQ_BODY(is)->parent_iseq))
break;
8830 t = ISEQ_BODY(is)->type;
8834 case ISEQ_TYPE_MAIN:
8836 rb_warn(
"argument of top-level return is ignored");
8840 type = ISEQ_TYPE_METHOD;
8847 if (
type == ISEQ_TYPE_METHOD) {
8848 splabel = NEW_LABEL(0);
8849 ADD_LABEL(ret, splabel);
8850 ADD_ADJUST(ret, line_node, 0);
8853 CHECK(COMPILE(ret,
"return nd_stts (return val)", retval));
8855 if (
type == ISEQ_TYPE_METHOD && can_add_ensure_iseq(iseq)) {
8856 add_ensure_iseq(ret, iseq, 1);
8858 ADD_INSN(ret, line_node, leave);
8859 ADD_ADJUST_RESTORE(ret, splabel);
8862 ADD_INSN(ret, line_node, putnil);
8866 ADD_INSN1(ret, line_node,
throw,
INT2FIX(TAG_RETURN));
8868 ADD_INSN(ret, line_node, pop);
8879 if (!i)
return false;
8880 if (IS_TRACE(i)) i = i->prev;
8881 if (!IS_INSN(i) || !IS_INSN_ID(i, putnil))
return false;
8883 if (IS_ADJUST(i)) i = i->prev;
8884 if (!IS_INSN(i))
return false;
8885 switch (INSN_OF(i)) {
8892 (ret->last = last->prev)->next = NULL;
8899 CHECK(COMPILE_(ret,
"nd_body", node, popped));
8901 if (!popped && !all_string_result_p(node)) {
8902 const NODE *line_node = node;
8903 const unsigned int flag = VM_CALL_FCALL;
8907 ADD_INSN(ret, line_node, dup);
8908 ADD_INSN1(ret, line_node, objtostring, new_callinfo(iseq, idTo_s, 0, flag, NULL, FALSE));
8909 ADD_INSN(ret, line_node, anytostring);
8917 int idx = ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
8919 debugs(
"id: %s idx: %d\n", rb_id2name(
id), idx);
8920 ADD_GETLOCAL(ret, line_node, idx, get_lvar_level(iseq));
8926 LABEL *else_label = NEW_LABEL(nd_line(line_node));
8929 br = decl_branch_base(iseq, PTR2NUM(node), nd_code_loc(node),
"&.");
8931 ADD_INSN(recv, line_node, dup);
8932 ADD_INSNL(recv, line_node, branchnil, else_label);
8933 add_trace_branch_coverage(iseq, recv, nd_code_loc(node), nd_node_id(node), 0,
"then", br);
8941 if (!else_label)
return;
8942 end_label = NEW_LABEL(nd_line(line_node));
8943 ADD_INSNL(ret, line_node, jump, end_label);
8944 ADD_LABEL(ret, else_label);
8945 add_trace_branch_coverage(iseq, ret, nd_code_loc(node), nd_node_id(node), 1,
"else", branches);
8946 ADD_LABEL(ret, end_label);
8955 if (get_nd_recv(node) &&
8956 (nd_type_p(get_nd_recv(node), NODE_STR) || nd_type_p(get_nd_recv(node), NODE_FILE)) &&
8957 (get_node_call_nd_mid(node) == idFreeze || get_node_call_nd_mid(node) == idUMinus) &&
8958 get_nd_args(node) == NULL &&
8959 ISEQ_COMPILE_DATA(iseq)->current_block == NULL &&
8960 ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction) {
8961 VALUE str = get_string_value(get_nd_recv(node));
8962 if (get_node_call_nd_mid(node) == idUMinus) {
8963 ADD_INSN2(ret, line_node, opt_str_uminus, str,
8964 new_callinfo(iseq, idUMinus, 0, 0, NULL, FALSE));
8967 ADD_INSN2(ret, line_node, opt_str_freeze, str,
8968 new_callinfo(iseq, idFreeze, 0, 0, NULL, FALSE));
8972 ADD_INSN(ret, line_node, pop);
8979 if (get_node_call_nd_mid(node) == idAREF && !private_recv_p(node) && get_nd_args(node) &&
8980 nd_type_p(get_nd_args(node), NODE_LIST) && RNODE_LIST(get_nd_args(node))->as.nd_alen == 1 &&
8981 (nd_type_p(RNODE_LIST(get_nd_args(node))->nd_head, NODE_STR) || nd_type_p(RNODE_LIST(get_nd_args(node))->nd_head, NODE_FILE)) &&
8982 ISEQ_COMPILE_DATA(iseq)->current_block == NULL &&
8983 !frozen_string_literal_p(iseq) &&
8984 ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction) {
8985 VALUE str = get_string_value(RNODE_LIST(get_nd_args(node))->nd_head);
8986 CHECK(COMPILE(ret,
"recv", get_nd_recv(node)));
8987 ADD_INSN2(ret, line_node, opt_aref_with, str,
8988 new_callinfo(iseq, idAREF, 1, 0, NULL, FALSE));
8991 ADD_INSN(ret, line_node, pop);
8999iseq_has_builtin_function_table(
const rb_iseq_t *iseq)
9001 return ISEQ_COMPILE_DATA(iseq)->builtin_function_table != NULL;
9005iseq_builtin_function_lookup(
const rb_iseq_t *iseq,
const char *name)
9008 const struct rb_builtin_function *table = ISEQ_COMPILE_DATA(iseq)->builtin_function_table;
9009 for (i=0; table[i].index != -1; i++) {
9010 if (strcmp(table[i].name, name) == 0) {
9018iseq_builtin_function_name(
const enum node_type
type,
const NODE *recv,
ID mid)
9020 const char *name = rb_id2name(mid);
9021 static const char prefix[] =
"__builtin_";
9022 const size_t prefix_len =
sizeof(prefix) - 1;
9027 switch (nd_type(recv)) {
9029 if (RNODE_VCALL(recv)->nd_mid == rb_intern(
"__builtin")) {
9034 if (RNODE_CONST(recv)->nd_vid == rb_intern(
"Primitive")) {
9044 if (UNLIKELY(strncmp(prefix, name, prefix_len) == 0)) {
9045 return &name[prefix_len];
9054delegate_call_p(
const rb_iseq_t *iseq,
unsigned int argc,
const LINK_ANCHOR *args,
unsigned int *pstart_index)
9061 else if (argc <= ISEQ_BODY(iseq)->local_table_size) {
9062 unsigned int start=0;
9067 argc + start <= ISEQ_BODY(iseq)->local_table_size;
9071 for (
unsigned int i=start; i-start<argc; i++) {
9072 if (IS_INSN(elem) &&
9073 INSN_OF(elem) == BIN(getlocal)) {
9074 int local_index =
FIX2INT(OPERAND_AT(elem, 0));
9075 int local_level =
FIX2INT(OPERAND_AT(elem, 1));
9077 if (local_level == 0) {
9078 unsigned int index = ISEQ_BODY(iseq)->local_table_size - (local_index - VM_ENV_DATA_SIZE + 1);
9080 fprintf(stderr,
"lvar:%s (%d), id:%s (%d) local_index:%d, local_size:%d\n",
9081 rb_id2name(ISEQ_BODY(iseq)->local_table[i]), i,
9082 rb_id2name(ISEQ_BODY(iseq)->local_table[index]), index,
9083 local_index, (
int)ISEQ_BODY(iseq)->local_table_size);
9107 *pstart_index = start;
9121 if (!node)
goto no_arg;
9123 if (!nd_type_p(node, NODE_LIST))
goto bad_arg;
9124 const NODE *next = RNODE_LIST(node)->nd_next;
9126 node = RNODE_LIST(node)->nd_head;
9127 if (!node)
goto no_arg;
9128 switch (nd_type(node)) {
9130 symbol = rb_node_sym_string_val(node);
9136 if (!
SYMBOL_P(symbol))
goto non_symbol_arg;
9139 if (strcmp(RSTRING_PTR(
string),
"leaf") == 0) {
9140 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_LEAF;
9142 else if (strcmp(RSTRING_PTR(
string),
"inline_block") == 0) {
9143 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_INLINE_BLOCK;
9145 else if (strcmp(RSTRING_PTR(
string),
"use_block") == 0) {
9146 iseq_set_use_block(iseq);
9148 else if (strcmp(RSTRING_PTR(
string),
"c_trace") == 0) {
9150 ISEQ_BODY(iseq)->builtin_attrs |= BUILTIN_ATTR_C_TRACE;
9159 COMPILE_ERROR(ERROR_ARGS
"attr!: no argument");
9162 COMPILE_ERROR(ERROR_ARGS
"non symbol argument to attr!: %s", rb_builtin_class_name(symbol));
9165 COMPILE_ERROR(ERROR_ARGS
"unknown argument to attr!: %s", RSTRING_PTR(
string));
9168 UNKNOWN_NODE(
"attr!", node, COMPILE_NG);
9176 if (!node)
goto no_arg;
9177 if (!nd_type_p(node, NODE_LIST))
goto bad_arg;
9178 if (RNODE_LIST(node)->nd_next)
goto too_many_arg;
9179 node = RNODE_LIST(node)->nd_head;
9180 if (!node)
goto no_arg;
9181 switch (nd_type(node)) {
9183 name = rb_node_sym_string_val(node);
9188 if (!
SYMBOL_P(name))
goto non_symbol_arg;
9190 compile_lvar(iseq, ret, line_node,
SYM2ID(name));
9194 COMPILE_ERROR(ERROR_ARGS
"arg!: no argument");
9197 COMPILE_ERROR(ERROR_ARGS
"arg!: too many argument");
9200 COMPILE_ERROR(ERROR_ARGS
"non symbol argument to arg!: %s",
9201 rb_builtin_class_name(name));
9204 UNKNOWN_NODE(
"arg!", node, COMPILE_NG);
9210 const NODE *node = ISEQ_COMPILE_DATA(iseq)->root_node;
9211 if (nd_type(node) == NODE_IF && RNODE_IF(node)->nd_cond == cond_node) {
9212 return RNODE_IF(node)->nd_body;
9215 rb_bug(
"mandatory_node: can't find mandatory node");
9220compile_builtin_mandatory_only_method(
rb_iseq_t *iseq,
const NODE *node,
const NODE *line_node)
9224 .pre_args_num = ISEQ_BODY(iseq)->param.lead_num,
9227 rb_node_init(RNODE(&args_node), NODE_ARGS);
9228 args_node.nd_ainfo = args;
9231 const int skip_local_size = ISEQ_BODY(iseq)->param.size - ISEQ_BODY(iseq)->param.lead_num;
9232 const int table_size = ISEQ_BODY(iseq)->local_table_size - skip_local_size;
9236 tbl->size = table_size;
9241 for (i=0; i<ISEQ_BODY(iseq)->param.lead_num; i++) {
9242 tbl->ids[i] = ISEQ_BODY(iseq)->local_table[i];
9245 for (; i<table_size; i++) {
9246 tbl->ids[i] = ISEQ_BODY(iseq)->local_table[i + skip_local_size];
9250 rb_node_init(RNODE(&scope_node), NODE_SCOPE);
9251 scope_node.nd_tbl = tbl;
9252 scope_node.nd_body = mandatory_node(iseq, node);
9253 scope_node.nd_args = &args_node;
9255 VALUE ast_value = rb_ruby_ast_new(RNODE(&scope_node));
9257 ISEQ_BODY(iseq)->mandatory_only_iseq =
9258 rb_iseq_new_with_opt(ast_value, rb_iseq_base_label(iseq),
9259 rb_iseq_path(iseq), rb_iseq_realpath(iseq),
9260 nd_line(line_node), NULL, 0,
9261 ISEQ_TYPE_METHOD, ISEQ_COMPILE_DATA(iseq)->option,
9262 ISEQ_BODY(iseq)->variable.script_lines);
9272 NODE *args_node = get_nd_args(node);
9274 if (parent_block != NULL) {
9275 COMPILE_ERROR(ERROR_ARGS_AT(line_node)
"should not call builtins here.");
9279# define BUILTIN_INLINE_PREFIX "_bi"
9280 char inline_func[
sizeof(BUILTIN_INLINE_PREFIX) +
DECIMAL_SIZE_OF(
int)];
9281 bool cconst =
false;
9286 if (strcmp(
"cstmt!", builtin_func) == 0 ||
9287 strcmp(
"cexpr!", builtin_func) == 0) {
9290 else if (strcmp(
"cconst!", builtin_func) == 0) {
9293 else if (strcmp(
"cinit!", builtin_func) == 0) {
9297 else if (strcmp(
"attr!", builtin_func) == 0) {
9298 return compile_builtin_attr(iseq, args_node);
9300 else if (strcmp(
"arg!", builtin_func) == 0) {
9301 return compile_builtin_arg(iseq, ret, args_node, line_node, popped);
9303 else if (strcmp(
"mandatory_only?", builtin_func) == 0) {
9305 rb_bug(
"mandatory_only? should be in if condition");
9307 else if (!LIST_INSN_SIZE_ZERO(ret)) {
9308 rb_bug(
"mandatory_only? should be put on top");
9311 ADD_INSN1(ret, line_node, putobject,
Qfalse);
9312 return compile_builtin_mandatory_only_method(iseq, node, line_node);
9315 rb_bug(
"can't find builtin function:%s", builtin_func);
9318 COMPILE_ERROR(ERROR_ARGS
"can't find builtin function:%s", builtin_func);
9322 int inline_index = nd_line(node);
9323 snprintf(inline_func,
sizeof(inline_func), BUILTIN_INLINE_PREFIX
"%d", inline_index);
9324 builtin_func = inline_func;
9330 typedef VALUE(*builtin_func0)(
void *,
VALUE);
9331 VALUE const_val = (*(builtin_func0)(uintptr_t)bf->func_ptr)(NULL,
Qnil);
9332 ADD_INSN1(ret, line_node, putobject, const_val);
9338 unsigned int flag = 0;
9340 VALUE argc = setup_args(iseq, args, args_node, &flag, &keywords);
9342 if (
FIX2INT(argc) != bf->argc) {
9343 COMPILE_ERROR(ERROR_ARGS
"argc is not match for builtin function:%s (expect %d but %d)",
9344 builtin_func, bf->argc,
FIX2INT(argc));
9348 unsigned int start_index;
9349 if (delegate_call_p(iseq,
FIX2INT(argc), args, &start_index)) {
9350 ADD_INSN2(ret, line_node, opt_invokebuiltin_delegate, bf,
INT2FIX(start_index));
9354 ADD_INSN1(ret, line_node, invokebuiltin, bf);
9357 if (popped) ADD_INSN(ret, line_node, pop);
9363compile_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)
9371 ID mid = get_node_call_nd_mid(node);
9373 unsigned int flag = 0;
9375 const rb_iseq_t *parent_block = ISEQ_COMPILE_DATA(iseq)->current_block;
9376 LABEL *else_label = NULL;
9379 ISEQ_COMPILE_DATA(iseq)->current_block = NULL;
9385 if (nd_type_p(node, NODE_VCALL)) {
9390 CONST_ID(id_answer,
"the_answer_to_life_the_universe_and_everything");
9392 if (mid == id_bitblt) {
9393 ADD_INSN(ret, line_node, bitblt);
9396 else if (mid == id_answer) {
9397 ADD_INSN(ret, line_node, answer);
9409 if (nd_type_p(node, NODE_FCALL) &&
9410 (mid == goto_id || mid == label_id)) {
9413 st_table *labels_table = ISEQ_COMPILE_DATA(iseq)->labels_table;
9416 if (!labels_table) {
9417 labels_table = st_init_numtable();
9418 ISEQ_COMPILE_DATA(iseq)->labels_table = labels_table;
9421 COMPILE_ERROR(ERROR_ARGS
"invalid goto/label format");
9425 if (mid == goto_id) {
9426 ADD_INSNL(ret, line_node, jump, label);
9429 ADD_LABEL(ret, label);
9436 const char *builtin_func;
9437 if (UNLIKELY(iseq_has_builtin_function_table(iseq)) &&
9438 (builtin_func = iseq_builtin_function_name(
type, get_nd_recv(node), mid)) != NULL) {
9439 return compile_builtin_function_call(iseq, ret, node, line_node, popped, parent_block, args, builtin_func);
9443 if (!assume_receiver) {
9444 if (
type == NODE_CALL ||
type == NODE_OPCALL ||
type == NODE_QCALL) {
9447 if (mid == idCall &&
9448 nd_type_p(get_nd_recv(node), NODE_LVAR) &&
9449 iseq_block_param_id_p(iseq, RNODE_LVAR(get_nd_recv(node))->nd_vid, &idx, &level)) {
9450 ADD_INSN2(recv, get_nd_recv(node), getblockparamproxy,
INT2FIX(idx + VM_ENV_DATA_SIZE - 1),
INT2FIX(level));
9452 else if (private_recv_p(node)) {
9453 ADD_INSN(recv, node, putself);
9454 flag |= VM_CALL_FCALL;
9457 CHECK(COMPILE(recv,
"recv", get_nd_recv(node)));
9460 if (
type == NODE_QCALL) {
9461 else_label = qcall_branch_start(iseq, recv, &branches, node, line_node);
9464 else if (
type == NODE_FCALL ||
type == NODE_VCALL) {
9465 ADD_CALL_RECEIVER(recv, line_node);
9470 if (
type != NODE_VCALL) {
9471 argc = setup_args(iseq, args, get_nd_args(node), &flag, &keywords);
9472 CHECK(!
NIL_P(argc));
9480 bool inline_new = ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction &&
9481 mid == rb_intern(
"new") &&
9482 parent_block == NULL &&
9483 !(flag & VM_CALL_ARGS_BLOCKARG);
9486 ADD_INSN(ret, node, putnil);
9487 ADD_INSN(ret, node, swap);
9492 debugp_param(
"call args argc", argc);
9493 debugp_param(
"call method",
ID2SYM(mid));
9495 switch ((
int)
type) {
9497 flag |= VM_CALL_VCALL;
9500 flag |= VM_CALL_FCALL;
9503 if ((flag & VM_CALL_ARGS_BLOCKARG) && (flag & VM_CALL_KW_SPLAT) && !(flag & VM_CALL_KW_SPLAT_MUT)) {
9504 ADD_INSN(ret, line_node, splatkw);
9507 LABEL *not_basic_new = NEW_LABEL(nd_line(node));
9508 LABEL *not_basic_new_finish = NEW_LABEL(nd_line(node));
9513 if (flag & VM_CALL_FORWARDING) {
9514 ci = (
VALUE)new_callinfo(iseq, mid,
NUM2INT(argc) + 1, flag, keywords, 0);
9517 ci = (
VALUE)new_callinfo(iseq, mid,
NUM2INT(argc), flag, keywords, 0);
9519 ADD_INSN2(ret, node, opt_new, ci, not_basic_new);
9520 LABEL_REF(not_basic_new);
9523 ADD_SEND_R(ret, line_node, rb_intern(
"initialize"), argc, parent_block,
INT2FIX(flag | VM_CALL_FCALL), keywords);
9524 ADD_INSNL(ret, line_node, jump, not_basic_new_finish);
9526 ADD_LABEL(ret, not_basic_new);
9528 ADD_SEND_R(ret, line_node, mid, argc, parent_block,
INT2FIX(flag), keywords);
9529 ADD_INSN(ret, line_node, swap);
9531 ADD_LABEL(ret, not_basic_new_finish);
9532 ADD_INSN(ret, line_node, pop);
9534 ADD_SEND_R(ret, line_node, mid, argc, parent_block,
INT2FIX(flag), keywords);
9537 qcall_branch_end(iseq, ret, else_label, branches, node, line_node);
9539 ADD_INSN(ret, line_node, pop);
9547 const int line = nd_line(node);
9549 unsigned int flag = 0;
9551 ID id = RNODE_OP_ASGN1(node)->nd_mid;
9577 ADD_INSN(ret, node, putnil);
9579 asgnflag = COMPILE_RECV(ret,
"NODE_OP_ASGN1 recv", node, RNODE_OP_ASGN1(node)->nd_recv);
9580 CHECK(asgnflag != -1);
9581 switch (nd_type(RNODE_OP_ASGN1(node)->nd_index)) {
9586 argc = setup_args(iseq, ret, RNODE_OP_ASGN1(node)->nd_index, &flag, NULL);
9587 CHECK(!
NIL_P(argc));
9589 int dup_argn =
FIX2INT(argc) + 1;
9590 ADD_INSN1(ret, node, dupn,
INT2FIX(dup_argn));
9592 ADD_SEND_R(ret, node, idAREF, argc, NULL,
INT2FIX(flag & ~VM_CALL_ARGS_SPLAT_MUT), NULL);
9594 if (
id == idOROP ||
id == idANDOP) {
9603 LABEL *label = NEW_LABEL(line);
9604 LABEL *lfin = NEW_LABEL(line);
9606 ADD_INSN(ret, node, dup);
9608 ADD_INSNL(ret, node, branchif, label);
9611 ADD_INSNL(ret, node, branchunless, label);
9613 ADD_INSN(ret, node, pop);
9615 CHECK(COMPILE(ret,
"NODE_OP_ASGN1 nd_rvalue: ", RNODE_OP_ASGN1(node)->nd_rvalue));
9617 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9619 if (flag & VM_CALL_ARGS_SPLAT) {
9620 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9621 ADD_INSN(ret, node, swap);
9622 ADD_INSN1(ret, node, splatarray,
Qtrue);
9623 ADD_INSN(ret, node, swap);
9624 flag |= VM_CALL_ARGS_SPLAT_MUT;
9626 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9627 ADD_SEND_R(ret, node, idASET, argc, NULL,
INT2FIX(flag), NULL);
9630 ADD_SEND_R(ret, node, idASET, FIXNUM_INC(argc, 1), NULL,
INT2FIX(flag), NULL);
9632 ADD_INSN(ret, node, pop);
9633 ADD_INSNL(ret, node, jump, lfin);
9634 ADD_LABEL(ret, label);
9636 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9638 ADD_INSN1(ret, node, adjuststack,
INT2FIX(dup_argn+1));
9639 ADD_LABEL(ret, lfin);
9642 CHECK(COMPILE(ret,
"NODE_OP_ASGN1 nd_rvalue: ", RNODE_OP_ASGN1(node)->nd_rvalue));
9643 ADD_SEND(ret, node,
id,
INT2FIX(1));
9645 ADD_INSN1(ret, node, setn,
INT2FIX(dup_argn+1));
9647 if (flag & VM_CALL_ARGS_SPLAT) {
9648 if (flag & VM_CALL_KW_SPLAT) {
9649 ADD_INSN1(ret, node, topn,
INT2FIX(2));
9650 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9651 ADD_INSN1(ret, node, splatarray,
Qtrue);
9652 flag |= VM_CALL_ARGS_SPLAT_MUT;
9654 ADD_INSN(ret, node, swap);
9655 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9656 ADD_INSN1(ret, node, setn,
INT2FIX(2));
9657 ADD_INSN(ret, node, pop);
9660 if (!(flag & VM_CALL_ARGS_SPLAT_MUT)) {
9661 ADD_INSN(ret, node, swap);
9662 ADD_INSN1(ret, node, splatarray,
Qtrue);
9663 ADD_INSN(ret, node, swap);
9664 flag |= VM_CALL_ARGS_SPLAT_MUT;
9666 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
9668 ADD_SEND_R(ret, node, idASET, argc, NULL,
INT2FIX(flag), NULL);
9671 ADD_SEND_R(ret, node, idASET, FIXNUM_INC(argc, 1), NULL,
INT2FIX(flag), NULL);
9673 ADD_INSN(ret, node, pop);
9681 const int line = nd_line(node);
9682 ID atype = RNODE_OP_ASGN2(node)->nd_mid;
9683 ID vid = RNODE_OP_ASGN2(node)->nd_vid, aid = rb_id_attrset(vid);
9685 LABEL *lfin = NEW_LABEL(line);
9686 LABEL *lcfin = NEW_LABEL(line);
9741 asgnflag = COMPILE_RECV(ret,
"NODE_OP_ASGN2#recv", node, RNODE_OP_ASGN2(node)->nd_recv);
9742 CHECK(asgnflag != -1);
9743 if (RNODE_OP_ASGN2(node)->nd_aid) {
9744 lskip = NEW_LABEL(line);
9745 ADD_INSN(ret, node, dup);
9746 ADD_INSNL(ret, node, branchnil, lskip);
9748 ADD_INSN(ret, node, dup);
9749 ADD_SEND_WITH_FLAG(ret, node, vid,
INT2FIX(0),
INT2FIX(asgnflag));
9751 if (atype == idOROP || atype == idANDOP) {
9753 ADD_INSN(ret, node, dup);
9755 if (atype == idOROP) {
9756 ADD_INSNL(ret, node, branchif, lcfin);
9759 ADD_INSNL(ret, node, branchunless, lcfin);
9762 ADD_INSN(ret, node, pop);
9764 CHECK(COMPILE(ret,
"NODE_OP_ASGN2 val", RNODE_OP_ASGN2(node)->nd_value));
9766 ADD_INSN(ret, node, swap);
9767 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9769 ADD_SEND_WITH_FLAG(ret, node, aid,
INT2FIX(1),
INT2FIX(asgnflag));
9770 ADD_INSNL(ret, node, jump, lfin);
9772 ADD_LABEL(ret, lcfin);
9774 ADD_INSN(ret, node, swap);
9777 ADD_LABEL(ret, lfin);
9780 CHECK(COMPILE(ret,
"NODE_OP_ASGN2 val", RNODE_OP_ASGN2(node)->nd_value));
9781 ADD_SEND(ret, node, atype,
INT2FIX(1));
9783 ADD_INSN(ret, node, swap);
9784 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9786 ADD_SEND_WITH_FLAG(ret, node, aid,
INT2FIX(1),
INT2FIX(asgnflag));
9788 if (lskip && popped) {
9789 ADD_LABEL(ret, lskip);
9791 ADD_INSN(ret, node, pop);
9792 if (lskip && !popped) {
9793 ADD_LABEL(ret, lskip);
9798static int compile_shareable_constant_value(
rb_iseq_t *iseq,
LINK_ANCHOR *ret,
enum rb_parser_shareability shareable,
const NODE *lhs,
const NODE *value);
9803 const int line = nd_line(node);
9808 switch (nd_type(RNODE_OP_CDECL(node)->nd_head)) {
9810 ADD_INSN1(ret, node, putobject, rb_cObject);
9813 CHECK(COMPILE(ret,
"NODE_OP_CDECL/colon2#nd_head", RNODE_COLON2(RNODE_OP_CDECL(node)->nd_head)->nd_head));
9816 COMPILE_ERROR(ERROR_ARGS
"%s: invalid node in NODE_OP_CDECL",
9817 ruby_node_name(nd_type(RNODE_OP_CDECL(node)->nd_head)));
9820 mid = get_node_colon_nd_mid(RNODE_OP_CDECL(node)->nd_head);
9822 if (RNODE_OP_CDECL(node)->nd_aid == idOROP) {
9823 lassign = NEW_LABEL(line);
9824 ADD_INSN(ret, node, dup);
9825 ADD_INSN3(ret, node, defined,
INT2FIX(DEFINED_CONST_FROM),
9827 ADD_INSNL(ret, node, branchunless, lassign);
9829 ADD_INSN(ret, node, dup);
9830 ADD_INSN1(ret, node, putobject,
Qtrue);
9831 ADD_INSN1(ret, node, getconstant,
ID2SYM(mid));
9833 if (RNODE_OP_CDECL(node)->nd_aid == idOROP || RNODE_OP_CDECL(node)->nd_aid == idANDOP) {
9834 lfin = NEW_LABEL(line);
9835 if (!popped) ADD_INSN(ret, node, dup);
9836 if (RNODE_OP_CDECL(node)->nd_aid == idOROP)
9837 ADD_INSNL(ret, node, branchif, lfin);
9839 ADD_INSNL(ret, node, branchunless, lfin);
9841 if (!popped) ADD_INSN(ret, node, pop);
9842 if (lassign) ADD_LABEL(ret, lassign);
9843 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_OP_CDECL(node)->shareability, RNODE_OP_CDECL(node)->nd_head, RNODE_OP_CDECL(node)->nd_value));
9846 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9848 ADD_INSN1(ret, node, dupn,
INT2FIX(2));
9849 ADD_INSN(ret, node, swap);
9851 ADD_INSN1(ret, node, setconstant,
ID2SYM(mid));
9852 ADD_LABEL(ret, lfin);
9853 if (!popped) ADD_INSN(ret, node, swap);
9854 ADD_INSN(ret, node, pop);
9857 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_OP_CDECL(node)->shareability, RNODE_OP_CDECL(node)->nd_head, RNODE_OP_CDECL(node)->nd_value));
9859 ADD_CALL(ret, node, RNODE_OP_CDECL(node)->nd_aid,
INT2FIX(1));
9861 ADD_INSN(ret, node, swap);
9863 ADD_INSN1(ret, node, topn,
INT2FIX(1));
9864 ADD_INSN(ret, node, swap);
9866 ADD_INSN1(ret, node, setconstant,
ID2SYM(mid));
9874 const int line = nd_line(node);
9875 LABEL *lfin = NEW_LABEL(line);
9878 if (
type == NODE_OP_ASGN_OR && !nd_type_p(RNODE_OP_ASGN_OR(node)->nd_head, NODE_IVAR)) {
9882 defined_expr(iseq, ret, RNODE_OP_ASGN_OR(node)->nd_head, lfinish,
Qfalse,
false);
9883 lassign = lfinish[1];
9885 lassign = NEW_LABEL(line);
9887 ADD_INSNL(ret, node, branchunless, lassign);
9890 lassign = NEW_LABEL(line);
9893 CHECK(COMPILE(ret,
"NODE_OP_ASGN_AND/OR#nd_head", RNODE_OP_ASGN_OR(node)->nd_head));
9896 ADD_INSN(ret, node, dup);
9899 if (
type == NODE_OP_ASGN_AND) {
9900 ADD_INSNL(ret, node, branchunless, lfin);
9903 ADD_INSNL(ret, node, branchif, lfin);
9907 ADD_INSN(ret, node, pop);
9910 ADD_LABEL(ret, lassign);
9911 CHECK(COMPILE_(ret,
"NODE_OP_ASGN_AND/OR#nd_value", RNODE_OP_ASGN_OR(node)->nd_value, popped));
9912 ADD_LABEL(ret, lfin);
9922 unsigned int flag = 0;
9924 const rb_iseq_t *parent_block = ISEQ_COMPILE_DATA(iseq)->current_block;
9928 ISEQ_COMPILE_DATA(iseq)->current_block = NULL;
9930 if (
type == NODE_SUPER) {
9931 VALUE vargc = setup_args(iseq, args, RNODE_SUPER(node)->nd_args, &flag, &keywords);
9932 CHECK(!
NIL_P(vargc));
9934 if ((flag & VM_CALL_ARGS_BLOCKARG) && (flag & VM_CALL_KW_SPLAT) && !(flag & VM_CALL_KW_SPLAT_MUT)) {
9935 ADD_INSN(args, node, splatkw);
9938 if (flag & VM_CALL_ARGS_BLOCKARG) {
9945 const rb_iseq_t *liseq = body->local_iseq;
9947 const struct rb_iseq_param_keyword *
const local_kwd = local_body->
param.keyword;
9948 int lvar_level = get_lvar_level(iseq);
9950 argc = local_body->
param.lead_num;
9953 for (i = 0; i < local_body->
param.lead_num; i++) {
9954 int idx = local_body->local_table_size - i;
9955 ADD_GETLOCAL(args, node, idx, lvar_level);
9959 if (local_body->
param.flags.forwardable) {
9960 flag |= VM_CALL_FORWARDING;
9961 int idx = local_body->local_table_size - get_local_var_idx(liseq, idDot3);
9962 ADD_GETLOCAL(args, node, idx, lvar_level);
9965 if (local_body->
param.flags.has_opt) {
9968 for (j = 0; j < local_body->
param.opt_num; j++) {
9969 int idx = local_body->local_table_size - (i + j);
9970 ADD_GETLOCAL(args, node, idx, lvar_level);
9975 if (local_body->
param.flags.has_rest) {
9977 int idx = local_body->local_table_size - local_body->
param.rest_start;
9978 ADD_GETLOCAL(args, node, idx, lvar_level);
9979 ADD_INSN1(args, node, splatarray, RBOOL(local_body->
param.flags.has_post));
9981 argc = local_body->
param.rest_start + 1;
9982 flag |= VM_CALL_ARGS_SPLAT;
9984 if (local_body->
param.flags.has_post) {
9986 int post_len = local_body->
param.post_num;
9987 int post_start = local_body->
param.post_start;
9989 if (local_body->
param.flags.has_rest) {
9991 for (j=0; j<post_len; j++) {
9992 int idx = local_body->local_table_size - (post_start + j);
9993 ADD_GETLOCAL(args, node, idx, lvar_level);
9995 ADD_INSN1(args, node, pushtoarray,
INT2FIX(j));
9996 flag |= VM_CALL_ARGS_SPLAT_MUT;
10001 for (j=0; j<post_len; j++) {
10002 int idx = local_body->local_table_size - (post_start + j);
10003 ADD_GETLOCAL(args, node, idx, lvar_level);
10005 argc = post_len + post_start;
10009 if (local_body->
param.flags.has_kw) {
10010 int local_size = local_body->local_table_size;
10013 ADD_INSN1(args, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
10015 if (local_body->
param.flags.has_kwrest) {
10016 int idx = local_body->local_table_size - local_kwd->rest_start;
10017 ADD_GETLOCAL(args, node, idx, lvar_level);
10019 ADD_SEND (args, node, rb_intern(
"dup"),
INT2FIX(0));
10022 ADD_INSN1(args, node, newhash,
INT2FIX(0));
10024 for (i = 0; i < local_kwd->num; ++i) {
10025 ID id = local_kwd->table[i];
10026 int idx = local_size - get_local_var_idx(liseq,
id);
10027 ADD_INSN1(args, node, putobject,
ID2SYM(
id));
10028 ADD_GETLOCAL(args, node, idx, lvar_level);
10030 ADD_SEND(args, node, id_core_hash_merge_ptr,
INT2FIX(i * 2 + 1));
10031 flag |= VM_CALL_KW_SPLAT| VM_CALL_KW_SPLAT_MUT;
10033 else if (local_body->
param.flags.has_kwrest) {
10034 int idx = local_body->local_table_size - local_kwd->rest_start;
10035 ADD_GETLOCAL(args, node, idx, lvar_level);
10037 flag |= VM_CALL_KW_SPLAT;
10041 if (use_block && parent_block == NULL) {
10042 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
10045 flag |= VM_CALL_SUPER | VM_CALL_FCALL;
10046 if (
type == NODE_ZSUPER) flag |= VM_CALL_ZSUPER;
10047 ADD_INSN(ret, node, putself);
10048 ADD_SEQ(ret, args);
10050 const struct rb_callinfo * ci = new_callinfo(iseq, 0, argc, flag, keywords, parent_block != NULL);
10052 if (vm_ci_flag(ci) & VM_CALL_FORWARDING) {
10053 ADD_INSN2(ret, node, invokesuperforward, ci, parent_block);
10056 ADD_INSN2(ret, node, invokesuper, ci, parent_block);
10060 ADD_INSN(ret, node, pop);
10070 unsigned int flag = 0;
10075 switch (ISEQ_BODY(ISEQ_BODY(iseq)->local_iseq)->
type) {
10076 case ISEQ_TYPE_TOP:
10077 case ISEQ_TYPE_MAIN:
10078 case ISEQ_TYPE_CLASS:
10079 COMPILE_ERROR(ERROR_ARGS
"Invalid yield");
10084 if (RNODE_YIELD(node)->nd_head) {
10085 argc = setup_args(iseq, args, RNODE_YIELD(node)->nd_head, &flag, &keywords);
10086 CHECK(!
NIL_P(argc));
10092 ADD_SEQ(ret, args);
10093 ADD_INSN1(ret, node, invokeblock, new_callinfo(iseq, 0,
FIX2INT(argc), flag, keywords, FALSE));
10094 iseq_set_use_block(ISEQ_BODY(iseq)->local_iseq);
10097 ADD_INSN(ret, node, pop);
10102 for (; tmp_iseq != ISEQ_BODY(iseq)->local_iseq; level++ ) {
10103 tmp_iseq = ISEQ_BODY(tmp_iseq)->parent_iseq;
10105 if (level > 0) access_outer_variables(iseq, level, rb_intern(
"yield"),
true);
10118 switch ((
int)
type) {
10120 ADD_INSN1(recv, node, putobject, rb_node_regx_string_val(node));
10121 ADD_INSN2(val, node, getspecial,
INT2FIX(0),
10125 CHECK(COMPILE(recv,
"receiver", RNODE_MATCH2(node)->nd_recv));
10126 CHECK(COMPILE(val,
"value", RNODE_MATCH2(node)->nd_value));
10129 CHECK(COMPILE(recv,
"receiver", RNODE_MATCH3(node)->nd_value));
10130 CHECK(COMPILE(val,
"value", RNODE_MATCH3(node)->nd_recv));
10134 ADD_SEQ(ret, recv);
10136 ADD_SEND(ret, node, idEqTilde,
INT2FIX(1));
10138 if (nd_type_p(node, NODE_MATCH2) && RNODE_MATCH2(node)->nd_args) {
10139 compile_named_capture_assign(iseq, ret, RNODE_MATCH2(node)->nd_args);
10143 ADD_INSN(ret, node, pop);
10154 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache &&
10155 (segments = collect_const_segments(iseq, node))) {
10156 ISEQ_BODY(iseq)->ic_size++;
10157 ADD_INSN1(ret, node, opt_getconstant_path, segments);
10167 CHECK(compile_const_prefix(iseq, node, pref, body));
10168 if (LIST_INSN_SIZE_ZERO(pref)) {
10169 ADD_INSN(ret, node, putnil);
10170 ADD_SEQ(ret, body);
10173 ADD_SEQ(ret, pref);
10174 ADD_SEQ(ret, body);
10180 ADD_CALL_RECEIVER(ret, node);
10181 CHECK(COMPILE(ret,
"colon2#nd_head", RNODE_COLON2(node)->nd_head));
10182 ADD_CALL(ret, node, RNODE_COLON2(node)->nd_mid,
INT2FIX(1));
10185 ADD_INSN(ret, node, pop);
10193 debugi(
"colon3#nd_mid", RNODE_COLON3(node)->nd_mid);
10196 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache) {
10197 ISEQ_BODY(iseq)->ic_size++;
10198 VALUE segments = rb_ary_new_from_args(2,
ID2SYM(idNULL),
ID2SYM(RNODE_COLON3(node)->nd_mid));
10199 ADD_INSN1(ret, node, opt_getconstant_path, segments);
10203 ADD_INSN1(ret, node, putobject, rb_cObject);
10204 ADD_INSN1(ret, node, putobject,
Qtrue);
10205 ADD_INSN1(ret, node, getconstant,
ID2SYM(RNODE_COLON3(node)->nd_mid));
10209 ADD_INSN(ret, node, pop);
10218 const NODE *b = RNODE_DOT2(node)->nd_beg;
10219 const NODE *e = RNODE_DOT2(node)->nd_end;
10221 if (optimizable_range_item_p(b) && optimizable_range_item_p(e)) {
10223 VALUE bv = optimized_range_item(b);
10224 VALUE ev = optimized_range_item(e);
10226 ADD_INSN1(ret, node, putobject, val);
10231 CHECK(COMPILE_(ret,
"min", b, popped));
10232 CHECK(COMPILE_(ret,
"max", e, popped));
10234 ADD_INSN1(ret, node, newrange, flag);
10244 if (ISEQ_BODY(iseq)->
type == ISEQ_TYPE_RESCUE) {
10245 ADD_GETLOCAL(ret, node, LVAR_ERRINFO, 0);
10251 if (ISEQ_BODY(ip)->
type == ISEQ_TYPE_RESCUE) {
10254 ip = ISEQ_BODY(ip)->parent_iseq;
10258 ADD_GETLOCAL(ret, node, LVAR_ERRINFO, level);
10261 ADD_INSN(ret, node, putnil);
10272 LABEL *end_label = NEW_LABEL(nd_line(node));
10273 const NODE *default_value = get_nd_value(RNODE_KW_ARG(node)->nd_body);
10275 if (default_value == NODE_SPECIAL_REQUIRED_KEYWORD) {
10277 COMPILE_ERROR(ERROR_ARGS
"unreachable");
10280 else if (nd_type_p(default_value, NODE_SYM) ||
10281 nd_type_p(default_value, NODE_REGX) ||
10282 nd_type_p(default_value, NODE_LINE) ||
10283 nd_type_p(default_value, NODE_INTEGER) ||
10284 nd_type_p(default_value, NODE_FLOAT) ||
10285 nd_type_p(default_value, NODE_RATIONAL) ||
10286 nd_type_p(default_value, NODE_IMAGINARY) ||
10287 nd_type_p(default_value, NODE_NIL) ||
10288 nd_type_p(default_value, NODE_TRUE) ||
10289 nd_type_p(default_value, NODE_FALSE)) {
10290 COMPILE_ERROR(ERROR_ARGS
"unreachable");
10298 int kw_bits_idx = body->local_table_size - body->
param.keyword->bits_start;
10299 int keyword_idx = body->
param.keyword->num;
10301 ADD_INSN2(ret, node, checkkeyword,
INT2FIX(kw_bits_idx + VM_ENV_DATA_SIZE - 1),
INT2FIX(keyword_idx));
10302 ADD_INSNL(ret, node, branchif, end_label);
10303 CHECK(COMPILE_POPPED(ret,
"keyword default argument", RNODE_KW_ARG(node)->nd_body));
10304 ADD_LABEL(ret, end_label);
10314 unsigned int flag = 0;
10315 ID mid = RNODE_ATTRASGN(node)->nd_mid;
10317 LABEL *else_label = NULL;
10323 if (!ISEQ_COMPILE_DATA(iseq)->in_masgn &&
10324 mid == idASET && !private_recv_p(node) && RNODE_ATTRASGN(node)->nd_args &&
10325 nd_type_p(RNODE_ATTRASGN(node)->nd_args, NODE_LIST) && RNODE_LIST(RNODE_ATTRASGN(node)->nd_args)->as.nd_alen == 2 &&
10326 (nd_type_p(RNODE_LIST(RNODE_ATTRASGN(node)->nd_args)->nd_head, NODE_STR) || nd_type_p(RNODE_LIST(RNODE_ATTRASGN(node)->nd_args)->nd_head, NODE_FILE)) &&
10327 ISEQ_COMPILE_DATA(iseq)->current_block == NULL &&
10328 !frozen_string_literal_p(iseq) &&
10329 ISEQ_COMPILE_DATA(iseq)->option->specialized_instruction)
10331 VALUE str = get_string_value(RNODE_LIST(RNODE_ATTRASGN(node)->nd_args)->nd_head);
10332 CHECK(COMPILE(ret,
"recv", RNODE_ATTRASGN(node)->nd_recv));
10333 CHECK(COMPILE(ret,
"value", RNODE_LIST(RNODE_LIST(RNODE_ATTRASGN(node)->nd_args)->nd_next)->nd_head));
10335 ADD_INSN(ret, node, swap);
10336 ADD_INSN1(ret, node, topn,
INT2FIX(1));
10338 ADD_INSN2(ret, node, opt_aset_with, str,
10339 new_callinfo(iseq, idASET, 2, 0, NULL, FALSE));
10341 ADD_INSN(ret, node, pop);
10347 argc = setup_args(iseq, args, RNODE_ATTRASGN(node)->nd_args, &flag, NULL);
10348 CHECK(!
NIL_P(argc));
10350 int asgnflag = COMPILE_RECV(recv,
"recv", node, RNODE_ATTRASGN(node)->nd_recv);
10351 CHECK(asgnflag != -1);
10352 flag |= (
unsigned int)asgnflag;
10354 debugp_param(
"argc", argc);
10355 debugp_param(
"nd_mid",
ID2SYM(mid));
10359 mid = rb_id_attrset(mid);
10360 else_label = qcall_branch_start(iseq, recv, &branches, node, node);
10363 ADD_INSN(ret, node, putnil);
10364 ADD_SEQ(ret, recv);
10365 ADD_SEQ(ret, args);
10367 if (flag & VM_CALL_ARGS_SPLAT) {
10368 ADD_INSN(ret, node, dup);
10369 ADD_INSN1(ret, node, putobject,
INT2FIX(-1));
10370 ADD_SEND_WITH_FLAG(ret, node, idAREF,
INT2FIX(1),
INT2FIX(asgnflag));
10371 ADD_INSN1(ret, node, setn, FIXNUM_INC(argc, 2));
10372 ADD_INSN (ret, node, pop);
10375 ADD_INSN1(ret, node, setn, FIXNUM_INC(argc, 1));
10379 ADD_SEQ(ret, recv);
10380 ADD_SEQ(ret, args);
10382 ADD_SEND_WITH_FLAG(ret, node, mid, argc,
INT2FIX(flag));
10383 qcall_branch_end(iseq, ret, else_label, branches, node, node);
10384 ADD_INSN(ret, node, pop);
10391 ADD_INSN1(ret, value, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
10399 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"make_shareable_copy"),
INT2FIX(1),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10406 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"make_shareable"),
INT2FIX(1),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10413node_const_decl_val(
const NODE *node)
10416 switch (nd_type(node)) {
10418 if (RNODE_CDECL(node)->nd_vid) {
10419 path = rb_id2str(RNODE_CDECL(node)->nd_vid);
10423 node = RNODE_CDECL(node)->nd_else;
10431 rb_str_append(path, rb_id2str(RNODE_COLON3(node)->nd_mid));
10434 rb_bug(
"unexpected node: %s", ruby_node_name(nd_type(node)));
10438 path = rb_ary_new();
10440 for (; node && nd_type_p(node, NODE_COLON2); node = RNODE_COLON2(node)->nd_head) {
10441 rb_ary_push(path, rb_id2str(RNODE_COLON2(node)->nd_mid));
10443 if (node && nd_type_p(node, NODE_CONST)) {
10445 rb_ary_push(path, rb_id2str(RNODE_CONST(node)->nd_vid));
10447 else if (node && nd_type_p(node, NODE_COLON3)) {
10449 rb_ary_push(path, rb_id2str(RNODE_COLON3(node)->nd_mid));
10459 path = rb_fstring(path);
10464const_decl_path(
NODE *dest)
10467 if (!nd_type_p(dest, NODE_CALL)) {
10468 path = node_const_decl_val(dest);
10479 VALUE path = const_decl_path(dest);
10480 ADD_INSN1(ret, value, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
10481 CHECK(COMPILE(ret,
"compile_ensure_shareable_node", value));
10482 ADD_INSN1(ret, value, putobject, path);
10484 ADD_SEND_WITH_FLAG(ret, value, rb_intern(
"ensure_shareable"),
INT2FIX(2),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10489#ifndef SHAREABLE_BARE_EXPRESSION
10490#define SHAREABLE_BARE_EXPRESSION 1
10494compile_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)
10496# define compile_shareable_literal_constant_next(node, anchor, value_p, shareable_literal_p) \
10497 compile_shareable_literal_constant(iseq, anchor, shareable, dest, node, level+1, value_p, shareable_literal_p)
10499 DECL_ANCHOR(anchor);
10501 enum node_type
type = node ? nd_type(node) : NODE_NIL;
10513 *value_p = rb_node_sym_string_val(node);
10516 *value_p = rb_node_regx_string_val(node);
10519 *value_p = rb_node_line_lineno_val(node);
10522 *value_p = rb_node_integer_literal_val(node);
10525 *value_p = rb_node_float_literal_val(node);
10527 case NODE_RATIONAL:
10528 *value_p = rb_node_rational_literal_val(node);
10530 case NODE_IMAGINARY:
10531 *value_p = rb_node_imaginary_literal_val(node);
10533 case NODE_ENCODING:
10534 *value_p = rb_node_encoding_val(node);
10537 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10538 *shareable_literal_p = 1;
10542 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10543 if (shareable == rb_parser_shareable_literal) {
10549 ADD_SEND_WITH_FLAG(ret, node, idUMinus,
INT2FIX(0),
INT2FIX(VM_CALL_ARGS_SIMPLE));
10552 *shareable_literal_p = 1;
10556 VALUE lit = rb_node_str_string_val(node);
10557 ADD_INSN1(ret, node, putobject, lit);
10560 *shareable_literal_p = 1;
10566 VALUE lit = rb_node_file_path_val(node);
10567 ADD_INSN1(ret, node, putobject, lit);
10570 *shareable_literal_p = 1;
10576 VALUE lit = rb_ary_new();
10578 ADD_INSN1(ret, node, putobject, lit);
10581 *shareable_literal_p = 1;
10587 INIT_ANCHOR(anchor);
10588 lit = rb_ary_new();
10589 for (
NODE *n = (
NODE *)node; n; n = RNODE_LIST(n)->nd_next) {
10591 int shareable_literal_p2;
10592 NODE *elt = RNODE_LIST(n)->nd_head;
10594 CHECK(compile_shareable_literal_constant_next(elt, anchor, &val, &shareable_literal_p2));
10595 if (shareable_literal_p2) {
10598 else if (
RTEST(lit)) {
10604 if (!UNDEF_P(val)) {
10605 rb_ary_push(lit, val);
10616 if (!RNODE_HASH(node)->nd_brace) {
10618 *shareable_literal_p = 0;
10621 for (
NODE *n = RNODE_HASH(node)->nd_head; n; n = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_next) {
10622 if (!RNODE_LIST(n)->nd_head) {
10624 goto compile_shareable;
10628 INIT_ANCHOR(anchor);
10629 lit = rb_hash_new();
10630 for (
NODE *n = RNODE_HASH(node)->nd_head; n; n = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_next) {
10632 VALUE value_val = 0;
10633 int shareable_literal_p2;
10634 NODE *key = RNODE_LIST(n)->nd_head;
10635 NODE *val = RNODE_LIST(RNODE_LIST(n)->nd_next)->nd_head;
10636 CHECK(compile_shareable_literal_constant_next(key, anchor, &key_val, &shareable_literal_p2));
10637 if (shareable_literal_p2) {
10640 else if (
RTEST(lit)) {
10641 rb_hash_clear(lit);
10644 CHECK(compile_shareable_literal_constant_next(val, anchor, &value_val, &shareable_literal_p2));
10645 if (shareable_literal_p2) {
10648 else if (
RTEST(lit)) {
10649 rb_hash_clear(lit);
10653 if (!UNDEF_P(key_val) && !UNDEF_P(value_val)) {
10654 rb_hash_aset(lit, key_val, value_val);
10657 rb_hash_clear(lit);
10668 if (shareable == rb_parser_shareable_literal &&
10669 (SHAREABLE_BARE_EXPRESSION || level > 0)) {
10670 CHECK(compile_ensure_shareable_node(iseq, ret, dest, node));
10672 *shareable_literal_p = 1;
10675 CHECK(COMPILE(ret,
"shareable_literal_constant", node));
10677 *shareable_literal_p = 0;
10683 if (nd_type(node) == NODE_LIST) {
10684 ADD_INSN1(anchor, node, newarray,
INT2FIX(RNODE_LIST(node)->as.nd_alen));
10686 else if (nd_type(node) == NODE_HASH) {
10687 int len = (int)RNODE_LIST(RNODE_HASH(node)->nd_head)->as.nd_alen;
10688 ADD_INSN1(anchor, node, newhash,
INT2FIX(
len));
10691 *shareable_literal_p = 0;
10692 ADD_SEQ(ret, anchor);
10698 if (nd_type(node) == NODE_LIST) {
10699 ADD_INSN1(anchor, node, newarray,
INT2FIX(RNODE_LIST(node)->as.nd_alen));
10701 else if (nd_type(node) == NODE_HASH) {
10702 int len = (int)RNODE_LIST(RNODE_HASH(node)->nd_head)->as.nd_alen;
10703 ADD_INSN1(anchor, node, newhash,
INT2FIX(
len));
10705 CHECK(compile_make_shareable_node(iseq, ret, anchor, node,
false));
10707 *shareable_literal_p = 1;
10711 ADD_INSN1(ret, node, putobject, val);
10714 *shareable_literal_p = 1;
10721compile_shareable_constant_value(
rb_iseq_t *iseq,
LINK_ANCHOR *ret,
enum rb_parser_shareability shareable,
const NODE *lhs,
const NODE *value)
10725 DECL_ANCHOR(anchor);
10726 INIT_ANCHOR(anchor);
10728 switch (shareable) {
10729 case rb_parser_shareable_none:
10730 CHECK(COMPILE(ret,
"compile_shareable_constant_value", value));
10733 case rb_parser_shareable_literal:
10734 CHECK(compile_shareable_literal_constant(iseq, anchor, shareable, (
NODE *)lhs, value, 0, &val, &literal_p));
10735 ADD_SEQ(ret, anchor);
10738 case rb_parser_shareable_copy:
10739 case rb_parser_shareable_everything:
10740 CHECK(compile_shareable_literal_constant(iseq, anchor, shareable, (
NODE *)lhs, value, 0, &val, &literal_p));
10742 CHECK(compile_make_shareable_node(iseq, ret, anchor, value, shareable == rb_parser_shareable_copy));
10745 ADD_SEQ(ret, anchor);
10749 rb_bug(
"unexpected rb_parser_shareability: %d", shareable);
10766 int lineno = ISEQ_COMPILE_DATA(iseq)->last_line;
10767 if (lineno == 0) lineno =
FIX2INT(rb_iseq_first_lineno(iseq));
10768 debugs(
"node: NODE_NIL(implicit)\n");
10769 ADD_SYNTHETIC_INSN(ret, lineno, -1, putnil);
10773 return iseq_compile_each0(iseq, ret, node, popped);
10779 const int line = (int)nd_line(node);
10780 const enum node_type
type = nd_type(node);
10783 if (ISEQ_COMPILE_DATA(iseq)->last_line == line) {
10787 if (nd_fl_newline(node)) {
10789 ISEQ_COMPILE_DATA(iseq)->last_line = line;
10790 if (line > 0 && ISEQ_COVERAGE(iseq) && ISEQ_LINE_COVERAGE(iseq)) {
10791 event |= RUBY_EVENT_COVERAGE_LINE;
10793 ADD_TRACE(ret, event);
10797 debug_node_start(node);
10798#undef BEFORE_RETURN
10799#define BEFORE_RETURN debug_node_end()
10803 CHECK(compile_block(iseq, ret, node, popped));
10807 CHECK(compile_if(iseq, ret, node, popped,
type));
10810 CHECK(compile_case(iseq, ret, node, popped));
10813 CHECK(compile_case2(iseq, ret, node, popped));
10816 CHECK(compile_case3(iseq, ret, node, popped));
10820 CHECK(compile_loop(iseq, ret, node, popped,
type));
10824 CHECK(compile_iter(iseq, ret, node, popped));
10826 case NODE_FOR_MASGN:
10827 CHECK(compile_for_masgn(iseq, ret, node, popped));
10830 CHECK(compile_break(iseq, ret, node, popped));
10833 CHECK(compile_next(iseq, ret, node, popped));
10836 CHECK(compile_redo(iseq, ret, node, popped));
10839 CHECK(compile_retry(iseq, ret, node, popped));
10842 CHECK(COMPILE_(ret,
"NODE_BEGIN", RNODE_BEGIN(node)->nd_body, popped));
10846 CHECK(compile_rescue(iseq, ret, node, popped));
10849 CHECK(compile_resbody(iseq, ret, node, popped));
10852 CHECK(compile_ensure(iseq, ret, node, popped));
10857 LABEL *end_label = NEW_LABEL(line);
10858 CHECK(COMPILE(ret,
"nd_1st", RNODE_OR(node)->nd_1st));
10860 ADD_INSN(ret, node, dup);
10862 if (
type == NODE_AND) {
10863 ADD_INSNL(ret, node, branchunless, end_label);
10866 ADD_INSNL(ret, node, branchif, end_label);
10869 ADD_INSN(ret, node, pop);
10871 CHECK(COMPILE_(ret,
"nd_2nd", RNODE_OR(node)->nd_2nd, popped));
10872 ADD_LABEL(ret, end_label);
10877 bool prev_in_masgn = ISEQ_COMPILE_DATA(iseq)->in_masgn;
10878 ISEQ_COMPILE_DATA(iseq)->in_masgn =
true;
10879 compile_massign(iseq, ret, node, popped);
10880 ISEQ_COMPILE_DATA(iseq)->in_masgn = prev_in_masgn;
10885 ID id = RNODE_LASGN(node)->nd_vid;
10886 int idx = ISEQ_BODY(body->local_iseq)->local_table_size - get_local_var_idx(iseq,
id);
10888 debugs(
"lvar: %s idx: %d\n", rb_id2name(
id), idx);
10889 CHECK(COMPILE(ret,
"rvalue", RNODE_LASGN(node)->nd_value));
10892 ADD_INSN(ret, node, dup);
10894 ADD_SETLOCAL(ret, node, idx, get_lvar_level(iseq));
10899 ID id = RNODE_DASGN(node)->nd_vid;
10900 CHECK(COMPILE(ret,
"dvalue", RNODE_DASGN(node)->nd_value));
10901 debugi(
"dassn id", rb_id2str(
id) ?
id :
'*');
10904 ADD_INSN(ret, node, dup);
10907 idx = get_dyna_var_idx(iseq,
id, &lv, &ls);
10910 COMPILE_ERROR(ERROR_ARGS
"NODE_DASGN: unknown id (%"PRIsVALUE
")",
10914 ADD_SETLOCAL(ret, node, ls - idx, lv);
10918 CHECK(COMPILE(ret,
"lvalue", RNODE_GASGN(node)->nd_value));
10921 ADD_INSN(ret, node, dup);
10923 ADD_INSN1(ret, node, setglobal,
ID2SYM(RNODE_GASGN(node)->nd_vid));
10927 CHECK(COMPILE(ret,
"lvalue", RNODE_IASGN(node)->nd_value));
10929 ADD_INSN(ret, node, dup);
10931 ADD_INSN2(ret, node, setinstancevariable,
10932 ID2SYM(RNODE_IASGN(node)->nd_vid),
10933 get_ivar_ic_value(iseq,RNODE_IASGN(node)->nd_vid));
10937 if (RNODE_CDECL(node)->nd_vid) {
10938 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_CDECL(node)->shareability, node, RNODE_CDECL(node)->nd_value));
10941 ADD_INSN(ret, node, dup);
10944 ADD_INSN1(ret, node, putspecialobject,
10945 INT2FIX(VM_SPECIAL_OBJECT_CONST_BASE));
10946 ADD_INSN1(ret, node, setconstant,
ID2SYM(RNODE_CDECL(node)->nd_vid));
10949 compile_cpath(ret, iseq, RNODE_CDECL(node)->nd_else);
10950 CHECK(compile_shareable_constant_value(iseq, ret, RNODE_CDECL(node)->shareability, node, RNODE_CDECL(node)->nd_value));
10951 ADD_INSN(ret, node, swap);
10954 ADD_INSN1(ret, node, topn,
INT2FIX(1));
10955 ADD_INSN(ret, node, swap);
10958 ADD_INSN1(ret, node, setconstant,
ID2SYM(get_node_colon_nd_mid(RNODE_CDECL(node)->nd_else)));
10963 CHECK(COMPILE(ret,
"cvasgn val", RNODE_CVASGN(node)->nd_value));
10965 ADD_INSN(ret, node, dup);
10967 ADD_INSN2(ret, node, setclassvariable,
10968 ID2SYM(RNODE_CVASGN(node)->nd_vid),
10969 get_cvar_ic_value(iseq, RNODE_CVASGN(node)->nd_vid));
10972 case NODE_OP_ASGN1:
10973 CHECK(compile_op_asgn1(iseq, ret, node, popped));
10975 case NODE_OP_ASGN2:
10976 CHECK(compile_op_asgn2(iseq, ret, node, popped));
10978 case NODE_OP_CDECL:
10979 CHECK(compile_op_cdecl(iseq, ret, node, popped));
10981 case NODE_OP_ASGN_AND:
10982 case NODE_OP_ASGN_OR:
10983 CHECK(compile_op_log(iseq, ret, node, popped,
type));
10987 if (compile_call_precheck_freeze(iseq, ret, node, node, popped) == TRUE) {
10993 if (compile_call(iseq, ret, node,
type, node, popped,
false) == COMPILE_NG) {
10999 CHECK(compile_super(iseq, ret, node, popped,
type));
11002 CHECK(compile_array(iseq, ret, node, popped, TRUE) >= 0);
11007 ADD_INSN1(ret, node, newarray,
INT2FIX(0));
11012 CHECK(compile_hash(iseq, ret, node, FALSE, popped) >= 0);
11015 CHECK(compile_return(iseq, ret, node, popped));
11018 CHECK(compile_yield(iseq, ret, node, popped));
11022 compile_lvar(iseq, ret, node, RNODE_LVAR(node)->nd_vid);
11028 debugi(
"nd_vid", RNODE_DVAR(node)->nd_vid);
11030 idx = get_dyna_var_idx(iseq, RNODE_DVAR(node)->nd_vid, &lv, &ls);
11032 COMPILE_ERROR(ERROR_ARGS
"unknown dvar (%"PRIsVALUE
")",
11033 rb_id2str(RNODE_DVAR(node)->nd_vid));
11036 ADD_GETLOCAL(ret, node, ls - idx, lv);
11041 ADD_INSN1(ret, node, getglobal,
ID2SYM(RNODE_GVAR(node)->nd_vid));
11043 ADD_INSN(ret, node, pop);
11048 debugi(
"nd_vid", RNODE_IVAR(node)->nd_vid);
11050 ADD_INSN2(ret, node, getinstancevariable,
11051 ID2SYM(RNODE_IVAR(node)->nd_vid),
11052 get_ivar_ic_value(iseq, RNODE_IVAR(node)->nd_vid));
11057 debugi(
"nd_vid", RNODE_CONST(node)->nd_vid);
11059 if (ISEQ_COMPILE_DATA(iseq)->option->inline_const_cache) {
11061 VALUE segments = rb_ary_new_from_args(1,
ID2SYM(RNODE_CONST(node)->nd_vid));
11062 ADD_INSN1(ret, node, opt_getconstant_path, segments);
11066 ADD_INSN(ret, node, putnil);
11067 ADD_INSN1(ret, node, putobject,
Qtrue);
11068 ADD_INSN1(ret, node, getconstant,
ID2SYM(RNODE_CONST(node)->nd_vid));
11072 ADD_INSN(ret, node, pop);
11078 ADD_INSN2(ret, node, getclassvariable,
11079 ID2SYM(RNODE_CVAR(node)->nd_vid),
11080 get_cvar_ic_value(iseq, RNODE_CVAR(node)->nd_vid));
11084 case NODE_NTH_REF:{
11086 if (!RNODE_NTH_REF(node)->nd_nth) {
11087 ADD_INSN(ret, node, putnil);
11090 ADD_INSN2(ret, node, getspecial,
INT2FIX(1) ,
11091 INT2FIX(RNODE_NTH_REF(node)->nd_nth << 1));
11095 case NODE_BACK_REF:{
11097 ADD_INSN2(ret, node, getspecial,
INT2FIX(1) ,
11098 INT2FIX(0x01 | (RNODE_BACK_REF(node)->nd_nth << 1)));
11105 CHECK(compile_match(iseq, ret, node, popped,
type));
11109 ADD_INSN1(ret, node, putobject, rb_node_sym_string_val(node));
11115 ADD_INSN1(ret, node, putobject, rb_node_line_lineno_val(node));
11119 case NODE_ENCODING:{
11121 ADD_INSN1(ret, node, putobject, rb_node_encoding_val(node));
11125 case NODE_INTEGER:{
11126 VALUE lit = rb_node_integer_literal_val(node);
11127 debugp_param(
"integer", lit);
11129 ADD_INSN1(ret, node, putobject, lit);
11135 VALUE lit = rb_node_float_literal_val(node);
11136 debugp_param(
"float", lit);
11138 ADD_INSN1(ret, node, putobject, lit);
11143 case NODE_RATIONAL:{
11144 VALUE lit = rb_node_rational_literal_val(node);
11145 debugp_param(
"rational", lit);
11147 ADD_INSN1(ret, node, putobject, lit);
11152 case NODE_IMAGINARY:{
11153 VALUE lit = rb_node_imaginary_literal_val(node);
11154 debugp_param(
"imaginary", lit);
11156 ADD_INSN1(ret, node, putobject, lit);
11163 debugp_param(
"nd_lit", get_string_value(node));
11165 VALUE lit = get_string_value(node);
11168 option->frozen_string_literal != ISEQ_FROZEN_STRING_LITERAL_DISABLED) {
11169 lit = rb_str_with_debug_created_info(lit, rb_iseq_path(iseq), line);
11171 switch (option->frozen_string_literal) {
11172 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
11173 ADD_INSN1(ret, node, putchilledstring, lit);
11175 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
11176 ADD_INSN1(ret, node, putstring, lit);
11178 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
11179 ADD_INSN1(ret, node, putobject, lit);
11182 rb_bug(
"invalid frozen_string_literal");
11189 compile_dstr(iseq, ret, node);
11192 ADD_INSN(ret, node, pop);
11197 ADD_CALL_RECEIVER(ret, node);
11198 VALUE str = rb_node_str_string_val(node);
11199 ADD_INSN1(ret, node, putobject, str);
11201 ADD_CALL(ret, node, idBackquote,
INT2FIX(1));
11204 ADD_INSN(ret, node, pop);
11209 ADD_CALL_RECEIVER(ret, node);
11210 compile_dstr(iseq, ret, node);
11211 ADD_CALL(ret, node, idBackquote,
INT2FIX(1));
11214 ADD_INSN(ret, node, pop);
11219 CHECK(compile_evstr(iseq, ret, RNODE_EVSTR(node)->nd_body, popped));
11223 VALUE lit = rb_node_regx_string_val(node);
11224 ADD_INSN1(ret, node, putobject, lit);
11230 compile_dregx(iseq, ret, node, popped);
11233 int ic_index = body->ise_size++;
11235 block_iseq = NEW_CHILD_ISEQ(RNODE_ONCE(node)->nd_body, make_name_for_block(iseq), ISEQ_TYPE_PLAIN, line);
11237 ADD_INSN2(ret, node, once, block_iseq,
INT2FIX(ic_index));
11241 ADD_INSN(ret, node, pop);
11245 case NODE_ARGSCAT:{
11247 CHECK(COMPILE(ret,
"argscat head", RNODE_ARGSCAT(node)->nd_head));
11248 ADD_INSN1(ret, node, splatarray,
Qfalse);
11249 ADD_INSN(ret, node, pop);
11250 CHECK(COMPILE(ret,
"argscat body", RNODE_ARGSCAT(node)->nd_body));
11251 ADD_INSN1(ret, node, splatarray,
Qfalse);
11252 ADD_INSN(ret, node, pop);
11255 CHECK(COMPILE(ret,
"argscat head", RNODE_ARGSCAT(node)->nd_head));
11256 const NODE *body_node = RNODE_ARGSCAT(node)->nd_body;
11257 if (nd_type_p(body_node, NODE_LIST)) {
11258 CHECK(compile_array(iseq, ret, body_node, popped, FALSE) >= 0);
11261 CHECK(COMPILE(ret,
"argscat body", body_node));
11262 ADD_INSN(ret, node, concattoarray);
11267 case NODE_ARGSPUSH:{
11269 CHECK(COMPILE(ret,
"argspush head", RNODE_ARGSPUSH(node)->nd_head));
11270 ADD_INSN1(ret, node, splatarray,
Qfalse);
11271 ADD_INSN(ret, node, pop);
11272 CHECK(COMPILE_(ret,
"argspush body", RNODE_ARGSPUSH(node)->nd_body, popped));
11275 CHECK(COMPILE(ret,
"argspush head", RNODE_ARGSPUSH(node)->nd_head));
11276 const NODE *body_node = RNODE_ARGSPUSH(node)->nd_body;
11277 if (keyword_node_p(body_node)) {
11278 CHECK(COMPILE_(ret,
"array element", body_node, FALSE));
11279 ADD_INSN(ret, node, pushtoarraykwsplat);
11281 else if (static_literal_node_p(body_node, iseq,
false)) {
11282 ADD_INSN1(ret, body_node, putobject, static_literal_value(body_node, iseq));
11283 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
11286 CHECK(COMPILE_(ret,
"array element", body_node, FALSE));
11287 ADD_INSN1(ret, node, pushtoarray,
INT2FIX(1));
11293 CHECK(COMPILE(ret,
"splat", RNODE_SPLAT(node)->nd_head));
11294 ADD_INSN1(ret, node, splatarray,
Qtrue);
11297 ADD_INSN(ret, node, pop);
11302 ID mid = RNODE_DEFN(node)->nd_mid;
11303 const rb_iseq_t *method_iseq = NEW_ISEQ(RNODE_DEFN(node)->nd_defn,
11305 ISEQ_TYPE_METHOD, line);
11307 debugp_param(
"defn/iseq", rb_iseqw_new(method_iseq));
11308 ADD_INSN2(ret, node, definemethod,
ID2SYM(mid), method_iseq);
11312 ADD_INSN1(ret, node, putobject,
ID2SYM(mid));
11318 ID mid = RNODE_DEFS(node)->nd_mid;
11319 const rb_iseq_t * singleton_method_iseq = NEW_ISEQ(RNODE_DEFS(node)->nd_defn,
11321 ISEQ_TYPE_METHOD, line);
11323 debugp_param(
"defs/iseq", rb_iseqw_new(singleton_method_iseq));
11324 CHECK(COMPILE(ret,
"defs: recv", RNODE_DEFS(node)->nd_recv));
11325 ADD_INSN2(ret, node, definesmethod,
ID2SYM(mid), singleton_method_iseq);
11329 ADD_INSN1(ret, node, putobject,
ID2SYM(mid));
11334 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11335 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_CBASE));
11336 CHECK(COMPILE(ret,
"alias arg1", RNODE_ALIAS(node)->nd_1st));
11337 CHECK(COMPILE(ret,
"alias arg2", RNODE_ALIAS(node)->nd_2nd));
11338 ADD_SEND(ret, node, id_core_set_method_alias,
INT2FIX(3));
11341 ADD_INSN(ret, node, pop);
11346 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11347 ADD_INSN1(ret, node, putobject,
ID2SYM(RNODE_VALIAS(node)->nd_alias));
11348 ADD_INSN1(ret, node, putobject,
ID2SYM(RNODE_VALIAS(node)->nd_orig));
11349 ADD_SEND(ret, node, id_core_set_variable_alias,
INT2FIX(2));
11352 ADD_INSN(ret, node, pop);
11359 for (
long i = 0; i < ary->len; i++) {
11360 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11361 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_CBASE));
11362 CHECK(COMPILE(ret,
"undef arg", ary->data[i]));
11363 ADD_SEND(ret, node, id_core_undef_method,
INT2FIX(2));
11365 if (i < ary->
len - 1) {
11366 ADD_INSN(ret, node, pop);
11371 ADD_INSN(ret, node, pop);
11376 const rb_iseq_t *class_iseq = NEW_CHILD_ISEQ(RNODE_CLASS(node)->nd_body,
11377 rb_str_freeze(rb_sprintf(
"<class:%"PRIsVALUE
">", rb_id2str(get_node_colon_nd_mid(RNODE_CLASS(node)->nd_cpath)))),
11378 ISEQ_TYPE_CLASS, line);
11379 const int flags = VM_DEFINECLASS_TYPE_CLASS |
11380 (RNODE_CLASS(node)->nd_super ? VM_DEFINECLASS_FLAG_HAS_SUPERCLASS : 0) |
11381 compile_cpath(ret, iseq, RNODE_CLASS(node)->nd_cpath);
11383 CHECK(COMPILE(ret,
"super", RNODE_CLASS(node)->nd_super));
11384 ADD_INSN3(ret, node, defineclass,
ID2SYM(get_node_colon_nd_mid(RNODE_CLASS(node)->nd_cpath)), class_iseq,
INT2FIX(flags));
11388 ADD_INSN(ret, node, pop);
11393 const rb_iseq_t *module_iseq = NEW_CHILD_ISEQ(RNODE_MODULE(node)->nd_body,
11394 rb_str_freeze(rb_sprintf(
"<module:%"PRIsVALUE
">", rb_id2str(get_node_colon_nd_mid(RNODE_MODULE(node)->nd_cpath)))),
11395 ISEQ_TYPE_CLASS, line);
11396 const int flags = VM_DEFINECLASS_TYPE_MODULE |
11397 compile_cpath(ret, iseq, RNODE_MODULE(node)->nd_cpath);
11399 ADD_INSN (ret, node, putnil);
11400 ADD_INSN3(ret, node, defineclass,
ID2SYM(get_node_colon_nd_mid(RNODE_MODULE(node)->nd_cpath)), module_iseq,
INT2FIX(flags));
11404 ADD_INSN(ret, node, pop);
11410 const rb_iseq_t *singleton_class = NEW_ISEQ(RNODE_SCLASS(node)->nd_body, rb_fstring_lit(
"singleton class"),
11411 ISEQ_TYPE_CLASS, line);
11413 CHECK(COMPILE(ret,
"sclass#recv", RNODE_SCLASS(node)->nd_recv));
11414 ADD_INSN (ret, node, putnil);
11415 CONST_ID(singletonclass,
"singletonclass");
11416 ADD_INSN3(ret, node, defineclass,
11417 ID2SYM(singletonclass), singleton_class,
11418 INT2FIX(VM_DEFINECLASS_TYPE_SINGLETON_CLASS));
11422 ADD_INSN(ret, node, pop);
11427 CHECK(compile_colon2(iseq, ret, node, popped));
11430 CHECK(compile_colon3(iseq, ret, node, popped));
11433 CHECK(compile_dots(iseq, ret, node, popped, FALSE));
11436 CHECK(compile_dots(iseq, ret, node, popped, TRUE));
11440 LABEL *lend = NEW_LABEL(line);
11441 LABEL *ltrue = NEW_LABEL(line);
11442 LABEL *lfalse = NEW_LABEL(line);
11443 CHECK(compile_flip_flop(iseq, ret, node,
type == NODE_FLIP2,
11445 ADD_LABEL(ret, ltrue);
11446 ADD_INSN1(ret, node, putobject,
Qtrue);
11447 ADD_INSNL(ret, node, jump, lend);
11448 ADD_LABEL(ret, lfalse);
11449 ADD_INSN1(ret, node, putobject,
Qfalse);
11450 ADD_LABEL(ret, lend);
11455 ADD_INSN(ret, node, putself);
11461 ADD_INSN(ret, node, putnil);
11467 ADD_INSN1(ret, node, putobject,
Qtrue);
11473 ADD_INSN1(ret, node, putobject,
Qfalse);
11478 CHECK(compile_errinfo(iseq, ret, node, popped));
11482 CHECK(compile_defined_expr(iseq, ret, node,
Qtrue,
false));
11485 case NODE_POSTEXE:{
11489 int is_index = body->ise_size++;
11491 rb_iseq_new_with_callback_new_callback(build_postexe_iseq, RNODE_POSTEXE(node)->nd_body);
11493 NEW_CHILD_ISEQ_WITH_CALLBACK(ifunc, rb_fstring(make_name_for_block(iseq)), ISEQ_TYPE_BLOCK, line);
11495 ADD_INSN2(ret, node, once, once_iseq,
INT2FIX(is_index));
11499 ADD_INSN(ret, node, pop);
11504 CHECK(compile_kw_arg(iseq, ret, node, popped));
11507 compile_dstr(iseq, ret, node);
11509 ADD_INSN(ret, node, intern);
11512 ADD_INSN(ret, node, pop);
11516 case NODE_ATTRASGN:
11517 CHECK(compile_attrasgn(iseq, ret, node, popped));
11521 const rb_iseq_t *block = NEW_CHILD_ISEQ(RNODE_LAMBDA(node)->nd_body, make_name_for_block(iseq), ISEQ_TYPE_BLOCK, line);
11524 ADD_INSN1(ret, node, putspecialobject,
INT2FIX(VM_SPECIAL_OBJECT_VMCORE));
11525 ADD_CALL_WITH_BLOCK(ret, node, idLambda, argc, block);
11529 ADD_INSN(ret, node, pop);
11534 UNKNOWN_NODE(
"iseq_compile_each", node, COMPILE_NG);
11549insn_data_length(
INSN *iobj)
11551 return insn_len(iobj->insn_id);
11555calc_sp_depth(
int depth,
INSN *insn)
11557 return comptime_insn_stack_increase(depth, insn->insn_id, insn->operands);
11561opobj_inspect(
VALUE obj)
11569 obj = rb_ary_dup(obj);
11581insn_data_to_s_detail(
INSN *iobj)
11583 VALUE str = rb_sprintf(
"%-20s ", insn_name(iobj->insn_id));
11585 if (iobj->operands) {
11586 const char *types = insn_op_types(iobj->insn_id);
11589 for (j = 0; types[j]; j++) {
11590 char type = types[j];
11596 rb_str_catf(str, LABEL_FORMAT, lobj->label_no);
11614 VALUE v = OPERAND_AT(iobj, j);
11629 rb_str_catf(str,
"<ivc:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11632 rb_str_catf(str,
"<icvarc:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11635 rb_str_catf(str,
"<ise:%d>",
FIX2INT(OPERAND_AT(iobj, j)));
11641 if (vm_ci_mid(ci)) rb_str_catf(str,
"%"PRIsVALUE, rb_id2str(vm_ci_mid(ci)));
11642 rb_str_catf(str,
", %d>", vm_ci_argc(ci));
11650 void *func = (
void *)OPERAND_AT(iobj, j);
11653 if (dladdr(func, &info) && info.dli_sname) {
11658 rb_str_catf(str,
"<%p>", func);
11668 if (types[j + 1]) {
11679 dump_disasm_list_with_cursor(link, NULL, NULL);
11690 printf(
"-- raw disasm--------\n");
11693 if (curr) printf(curr == link ?
"*" :
" ");
11694 switch (link->type) {
11695 case ISEQ_ELEMENT_INSN:
11697 iobj = (
INSN *)link;
11698 str = insn_data_to_s_detail(iobj);
11699 printf(
" %04d %-65s(%4u)\n", pos,
StringValueCStr(str), iobj->insn_info.line_no);
11700 pos += insn_data_length(iobj);
11703 case ISEQ_ELEMENT_LABEL:
11705 lobj = (
LABEL *)link;
11706 printf(LABEL_FORMAT
" [sp: %d, unremovable: %d, refcnt: %d]%s\n", lobj->label_no, lobj->sp, lobj->unremovable, lobj->refcnt,
11707 dest == lobj ?
" <---" :
"");
11710 case ISEQ_ELEMENT_TRACE:
11713 printf(
" trace: %0x\n", trace->event);
11716 case ISEQ_ELEMENT_ADJUST:
11719 printf(
" adjust: [label: %d]\n", adjust->label ? adjust->label->label_no : -1);
11724 rb_raise(
rb_eSyntaxError,
"dump_disasm_list error: %d\n", (
int)link->type);
11728 printf(
"---------------------\n");
11733rb_insn_len(
VALUE insn)
11735 return insn_len(insn);
11739rb_insns_name(
int i)
11741 return insn_name(i);
11745rb_insns_name_array(
void)
11747 VALUE ary = rb_ary_new_capa(VM_INSTRUCTION_SIZE);
11749 for (i = 0; i < VM_INSTRUCTION_SIZE; i++) {
11750 rb_ary_push(ary, rb_fstring_cstr(insn_name(i)));
11752 return rb_ary_freeze(ary);
11760 obj = rb_to_symbol_type(obj);
11762 if (st_lookup(labels_table, obj, &tmp) == 0) {
11763 label = NEW_LABEL(0);
11764 st_insert(labels_table, obj, (st_data_t)label);
11767 label = (
LABEL *)tmp;
11774get_exception_sym2type(
VALUE sym)
11776 static VALUE symRescue, symEnsure, symRetry;
11777 static VALUE symBreak, symRedo, symNext;
11779 if (symRescue == 0) {
11788 if (sym == symRescue)
return CATCH_TYPE_RESCUE;
11789 if (sym == symEnsure)
return CATCH_TYPE_ENSURE;
11790 if (sym == symRetry)
return CATCH_TYPE_RETRY;
11791 if (sym == symBreak)
return CATCH_TYPE_BREAK;
11792 if (sym == symRedo)
return CATCH_TYPE_REDO;
11793 if (sym == symNext)
return CATCH_TYPE_NEXT;
11794 rb_raise(
rb_eSyntaxError,
"invalid exception symbol: %+"PRIsVALUE, sym);
11807 LABEL *lstart, *lend, *lcont;
11822 lstart = register_label(iseq, labels_table,
RARRAY_AREF(v, 2));
11823 lend = register_label(iseq, labels_table,
RARRAY_AREF(v, 3));
11824 lcont = register_label(iseq, labels_table,
RARRAY_AREF(v, 4));
11828 if (
type == CATCH_TYPE_RESCUE ||
11829 type == CATCH_TYPE_BREAK ||
11830 type == CATCH_TYPE_NEXT) {
11836 ADD_CATCH_ENTRY(
type, lstart, lend, eiseq, lcont);
11844insn_make_insn_table(
void)
11848 table = st_init_numtable_with_size(VM_INSTRUCTION_SIZE);
11850 for (i=0; i<VM_INSTRUCTION_SIZE; i++) {
11864 iseqw = rb_iseq_load(op, (
VALUE)iseq,
Qnil);
11866 else if (
CLASS_OF(op) == rb_cISeq) {
11873 loaded_iseq = rb_iseqw_to_iseq(iseqw);
11874 return loaded_iseq;
11882 unsigned int flag = 0;
11893 if (!
NIL_P(vorig_argc)) orig_argc =
FIX2INT(vorig_argc);
11895 if (!
NIL_P(vkw_arg)) {
11898 size_t n = rb_callinfo_kwarg_bytes(
len);
11901 kw_arg->references = 0;
11902 kw_arg->keyword_len =
len;
11903 for (i = 0; i <
len; i++) {
11906 kw_arg->keywords[i] = kw;
11911 const struct rb_callinfo *ci = new_callinfo(iseq, mid, orig_argc, flag, kw_arg, (flag & VM_CALL_ARGS_SIMPLE) == 0);
11917event_name_to_flag(
VALUE sym)
11919#define CHECK_EVENT(ev) if (sym == ID2SYM(rb_intern_const(#ev))) return ev;
11940 int line_no = 0, node_id = -1, insn_idx = 0;
11941 int ret = COMPILE_OK;
11946 static struct st_table *insn_table;
11948 if (insn_table == 0) {
11949 insn_table = insn_make_insn_table();
11952 for (i=0; i<
len; i++) {
11958 ADD_TRACE(anchor, event);
11961 LABEL *label = register_label(iseq, labels_table, obj);
11962 ADD_LABEL(anchor, label);
11975 node_id =
NUM2INT(rb_ary_entry(node_ids, insn_idx++));
11979 if (st_lookup(insn_table, (st_data_t)insn, &insn_id) == 0) {
11981 COMPILE_ERROR(iseq, line_no,
11982 "unknown instruction: %+"PRIsVALUE, insn);
11987 if (argc != insn_len((
VALUE)insn_id)-1) {
11988 COMPILE_ERROR(iseq, line_no,
11989 "operand size mismatch");
11995 argv = compile_data_calloc2(iseq,
sizeof(
VALUE), argc);
12000 (
enum ruby_vminsn_type)insn_id, argc, argv));
12002 for (j=0; j<argc; j++) {
12003 VALUE op = rb_ary_entry(obj, j+1);
12004 switch (insn_op_type((
VALUE)insn_id, j)) {
12006 LABEL *label = register_label(iseq, labels_table, op);
12007 argv[j] = (
VALUE)label;
12022 VALUE v = (
VALUE)iseq_build_load_iseq(iseq, op);
12033 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->ise_size) {
12034 ISEQ_BODY(iseq)->ise_size =
NUM2INT(op) + 1;
12039 VALUE segments = rb_ary_new();
12040 op = rb_to_array_type(op);
12044 sym = rb_to_symbol_type(sym);
12045 rb_ary_push(segments, sym);
12049 argv[j] = segments;
12051 ISEQ_BODY(iseq)->ic_size++;
12056 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->ivc_size) {
12057 ISEQ_BODY(iseq)->ivc_size =
NUM2INT(op) + 1;
12062 if (
NUM2UINT(op) >= ISEQ_BODY(iseq)->icvarc_size) {
12063 ISEQ_BODY(iseq)->icvarc_size =
NUM2INT(op) + 1;
12067 argv[j] = iseq_build_callinfo_from_hash(iseq, op);
12070 argv[j] = rb_to_symbol_type(op);
12077 RHASH_TBL_RAW(map)->type = &cdhash_type;
12078 op = rb_to_array_type(op);
12083 register_label(iseq, labels_table, sym);
12084 rb_hash_aset(map, key, (
VALUE)label | 1);
12093#if SIZEOF_VALUE <= SIZEOF_LONG
12098 argv[j] = (
VALUE)funcptr;
12109 (
enum ruby_vminsn_type)insn_id, argc, NULL));
12113 rb_raise(
rb_eTypeError,
"unexpected object for instruction");
12118 validate_labels(iseq, labels_table);
12119 if (!ret)
return ret;
12120 return iseq_setup(iseq, anchor);
12123#define CHECK_ARRAY(v) rb_to_array_type(v)
12124#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
12129 VALUE val = rb_hash_aref(param, sym);
12134 else if (!
NIL_P(val)) {
12135 rb_raise(
rb_eTypeError,
"invalid %+"PRIsVALUE
" Fixnum: %+"PRIsVALUE,
12141static const struct rb_iseq_param_keyword *
12147 VALUE key, sym, default_val;
12150 struct rb_iseq_param_keyword *keyword =
ZALLOC(
struct rb_iseq_param_keyword);
12152 ISEQ_BODY(iseq)->param.flags.has_kw = TRUE;
12154 keyword->num =
len;
12155#define SYM(s) ID2SYM(rb_intern_const(#s))
12156 (void)int_param(&keyword->bits_start, params, SYM(kwbits));
12157 i = keyword->bits_start - keyword->num;
12158 ids = (
ID *)&ISEQ_BODY(iseq)->local_table[i];
12162 for (i = 0; i <
len; i++) {
12166 goto default_values;
12169 keyword->required_num++;
12173 default_len =
len - i;
12174 if (default_len == 0) {
12175 keyword->table = ids;
12178 else if (default_len < 0) {
12184 for (j = 0; i <
len; i++, j++) {
12198 rb_raise(
rb_eTypeError,
"keyword default has unsupported len %+"PRIsVALUE, key);
12204 keyword->table = ids;
12205 keyword->default_values = dvs;
12211iseq_insn_each_object_mark_and_move(
VALUE * obj,
VALUE _)
12213 rb_gc_mark_and_move(obj);
12220 size_t size =
sizeof(
INSN);
12221 unsigned int pos = 0;
12224#ifdef STRICT_ALIGNMENT
12225 size_t padding = calc_padding((
void *)&storage->buff[pos], size);
12227 const size_t padding = 0;
12229 size_t offset = pos + size + padding;
12230 if (offset > storage->size || offset > storage->pos) {
12232 storage = storage->next;
12235#ifdef STRICT_ALIGNMENT
12236 pos += (int)padding;
12239 iobj = (
INSN *)&storage->buff[pos];
12241 if (iobj->operands) {
12242 iseq_insn_each_markable_object(iobj, iseq_insn_each_object_mark_and_move, (
VALUE)0);
12255 .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
12262#define SYM(s) ID2SYM(rb_intern_const(#s))
12264 unsigned int arg_size, local_size, stack_max;
12266 struct st_table *labels_table = st_init_numtable();
12268 VALUE arg_opt_labels = rb_hash_aref(params, SYM(opt));
12269 VALUE keywords = rb_hash_aref(params, SYM(keyword));
12271 DECL_ANCHOR(anchor);
12272 INIT_ANCHOR(anchor);
12275 ISEQ_BODY(iseq)->local_table_size =
len;
12276 ISEQ_BODY(iseq)->local_table = tbl =
len > 0 ? (
ID *)
ALLOC_N(
ID, ISEQ_BODY(iseq)->local_table_size) : NULL;
12278 for (i = 0; i <
len; i++) {
12281 if (sym_arg_rest == lv) {
12289#define INT_PARAM(F) int_param(&ISEQ_BODY(iseq)->param.F, params, SYM(F))
12290 if (INT_PARAM(lead_num)) {
12291 ISEQ_BODY(iseq)->param.flags.has_lead = TRUE;
12293 if (INT_PARAM(post_num)) ISEQ_BODY(iseq)->param.flags.has_post = TRUE;
12294 if (INT_PARAM(post_start)) ISEQ_BODY(iseq)->param.flags.has_post = TRUE;
12295 if (INT_PARAM(rest_start)) ISEQ_BODY(iseq)->param.flags.has_rest = TRUE;
12296 if (INT_PARAM(block_start)) ISEQ_BODY(iseq)->param.flags.has_block = TRUE;
12299#define INT_PARAM(F) F = (int_param(&x, misc, SYM(F)) ? (unsigned int)x : 0)
12301 INT_PARAM(arg_size);
12302 INT_PARAM(local_size);
12303 INT_PARAM(stack_max);
12308#ifdef USE_ISEQ_NODE_ID
12309 node_ids = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_ids")));
12317 ISEQ_BODY(iseq)->param.flags.has_opt = !!(
len - 1 >= 0);
12319 if (ISEQ_BODY(iseq)->param.flags.has_opt) {
12322 for (i = 0; i <
len; i++) {
12324 LABEL *label = register_label(iseq, labels_table, ent);
12325 opt_table[i] = (
VALUE)label;
12328 ISEQ_BODY(iseq)->param.opt_num =
len - 1;
12329 ISEQ_BODY(iseq)->param.opt_table = opt_table;
12332 else if (!
NIL_P(arg_opt_labels)) {
12333 rb_raise(
rb_eTypeError,
":opt param is not an array: %+"PRIsVALUE,
12338 ISEQ_BODY(iseq)->param.keyword = iseq_build_kw(iseq, params, keywords);
12340 else if (!
NIL_P(keywords)) {
12341 rb_raise(
rb_eTypeError,
":keywords param is not an array: %+"PRIsVALUE,
12345 if (
Qtrue == rb_hash_aref(params, SYM(ambiguous_param0))) {
12346 ISEQ_BODY(iseq)->param.flags.ambiguous_param0 = TRUE;
12349 if (
Qtrue == rb_hash_aref(params, SYM(use_block))) {
12350 ISEQ_BODY(iseq)->param.flags.use_block = TRUE;
12353 if (int_param(&i, params, SYM(kwrest))) {
12354 struct rb_iseq_param_keyword *keyword = (
struct rb_iseq_param_keyword *)ISEQ_BODY(iseq)->param.keyword;
12355 if (keyword == NULL) {
12356 ISEQ_BODY(iseq)->param.keyword = keyword =
ZALLOC(
struct rb_iseq_param_keyword);
12358 keyword->rest_start = i;
12359 ISEQ_BODY(iseq)->param.flags.has_kwrest = TRUE;
12362 iseq_calc_param_size(iseq);
12365 iseq_build_from_ary_exception(iseq, labels_table, exception);
12368 iseq_build_from_ary_body(iseq, anchor, body, node_ids, labels_wrapper);
12370 ISEQ_BODY(iseq)->param.size = arg_size;
12371 ISEQ_BODY(iseq)->local_table_size = local_size;
12372 ISEQ_BODY(iseq)->stack_max = stack_max;
12382 while (body->type == ISEQ_TYPE_BLOCK ||
12383 body->type == ISEQ_TYPE_RESCUE ||
12384 body->type == ISEQ_TYPE_ENSURE ||
12385 body->type == ISEQ_TYPE_EVAL ||
12386 body->type == ISEQ_TYPE_MAIN
12390 for (i = 0; i < body->local_table_size; i++) {
12391 if (body->local_table[i] ==
id) {
12395 iseq = body->parent_iseq;
12396 body = ISEQ_BODY(iseq);
12409 for (i=0; i<body->local_table_size; i++) {
12410 if (body->local_table[i] ==
id) {
12420#ifndef IBF_ISEQ_DEBUG
12421#define IBF_ISEQ_DEBUG 0
12424#ifndef IBF_ISEQ_ENABLE_LOCAL_BUFFER
12425#define IBF_ISEQ_ENABLE_LOCAL_BUFFER 0
12428typedef uint32_t ibf_offset_t;
12429#define IBF_OFFSET(ptr) ((ibf_offset_t)(VALUE)(ptr))
12431#define IBF_MAJOR_VERSION ISEQ_MAJOR_VERSION
12433#define IBF_DEVEL_VERSION 4
12434#define IBF_MINOR_VERSION (ISEQ_MINOR_VERSION * 10000 + IBF_DEVEL_VERSION)
12436#define IBF_MINOR_VERSION ISEQ_MINOR_VERSION
12439static const char IBF_ENDIAN_MARK =
12440#ifdef WORDS_BIGENDIAN
12449 uint32_t major_version;
12450 uint32_t minor_version;
12452 uint32_t extra_size;
12454 uint32_t iseq_list_size;
12455 uint32_t global_object_list_size;
12456 ibf_offset_t iseq_list_offset;
12457 ibf_offset_t global_object_list_offset;
12478 unsigned int obj_list_size;
12479 ibf_offset_t obj_list_offset;
12498pinned_list_mark(
void *ptr)
12502 for (i = 0; i < list->size; i++) {
12503 if (list->buffer[i]) {
12504 rb_gc_mark(list->buffer[i]);
12516 0, 0, RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_EMBEDDABLE
12520pinned_list_fetch(
VALUE list,
long offset)
12526 if (offset >= ptr->size) {
12527 rb_raise(
rb_eIndexError,
"object index out of range: %ld", offset);
12530 return ptr->buffer[offset];
12534pinned_list_store(
VALUE list,
long offset,
VALUE object)
12540 if (offset >= ptr->size) {
12541 rb_raise(
rb_eIndexError,
"object index out of range: %ld", offset);
12548pinned_list_new(
long size)
12550 size_t memsize = offsetof(
struct pinned_list, buffer) + size *
sizeof(
VALUE);
12551 VALUE obj_list = rb_data_typed_object_zalloc(0, memsize, &pinned_list_type);
12552 struct pinned_list * ptr = RTYPEDDATA_GET_DATA(obj_list);
12558ibf_dump_pos(
struct ibf_dump *dump)
12560 long pos = RSTRING_LEN(dump->current_buffer->str);
12561#if SIZEOF_LONG > SIZEOF_INT
12562 if (pos >= UINT_MAX) {
12566 return (
unsigned int)pos;
12570ibf_dump_align(
struct ibf_dump *dump,
size_t align)
12572 ibf_offset_t pos = ibf_dump_pos(dump);
12574 static const char padding[
sizeof(
VALUE)];
12575 size_t size = align - ((size_t)pos % align);
12576#if SIZEOF_LONG > SIZEOF_INT
12577 if (pos + size >= UINT_MAX) {
12581 for (; size >
sizeof(padding); size -=
sizeof(padding)) {
12582 rb_str_cat(dump->current_buffer->str, padding,
sizeof(padding));
12584 rb_str_cat(dump->current_buffer->str, padding, size);
12589ibf_dump_write(
struct ibf_dump *dump,
const void *buff,
unsigned long size)
12591 ibf_offset_t pos = ibf_dump_pos(dump);
12592 rb_str_cat(dump->current_buffer->str, (
const char *)buff, size);
12598ibf_dump_write_byte(
struct ibf_dump *dump,
unsigned char byte)
12600 return ibf_dump_write(dump, &
byte,
sizeof(
unsigned char));
12604ibf_dump_overwrite(
struct ibf_dump *dump,
void *buff,
unsigned int size,
long offset)
12606 VALUE str = dump->current_buffer->str;
12607 char *ptr = RSTRING_PTR(str);
12608 if ((
unsigned long)(size + offset) > (
unsigned long)RSTRING_LEN(str))
12609 rb_bug(
"ibf_dump_overwrite: overflow");
12610 memcpy(ptr + offset, buff, size);
12614ibf_load_ptr(
const struct ibf_load *load, ibf_offset_t *offset,
int size)
12616 ibf_offset_t beg = *offset;
12618 return load->current_buffer->buff + beg;
12622ibf_load_alloc(
const struct ibf_load *load, ibf_offset_t offset,
size_t x,
size_t y)
12624 void *buff = ruby_xmalloc2(x, y);
12625 size_t size = x * y;
12626 memcpy(buff, load->current_buffer->buff + offset, size);
12630#define IBF_W_ALIGN(type) (RUBY_ALIGNOF(type) > 1 ? ibf_dump_align(dump, RUBY_ALIGNOF(type)) : (void)0)
12632#define IBF_W(b, type, n) (IBF_W_ALIGN(type), (type *)(VALUE)IBF_WP(b, type, n))
12633#define IBF_WV(variable) ibf_dump_write(dump, &(variable), sizeof(variable))
12634#define IBF_WP(b, type, n) ibf_dump_write(dump, (b), sizeof(type) * (n))
12635#define IBF_R(val, type, n) (type *)ibf_load_alloc(load, IBF_OFFSET(val), sizeof(type), (n))
12636#define IBF_ZERO(variable) memset(&(variable), 0, sizeof(variable))
12639ibf_table_lookup(
struct st_table *table, st_data_t key)
12643 if (st_lookup(table, key, &val)) {
12652ibf_table_find_or_insert(
struct st_table *table, st_data_t key)
12654 int index = ibf_table_lookup(table, key);
12657 index = (int)table->num_entries;
12658 st_insert(table, key, (st_data_t)index);
12666static void ibf_dump_object_list(
struct ibf_dump *dump, ibf_offset_t *obj_list_offset,
unsigned int *obj_list_size);
12672ibf_dump_object_table_new(
void)
12674 st_table *obj_table = st_init_numtable();
12675 st_insert(obj_table, (st_data_t)
Qnil, (st_data_t)0);
12683 return ibf_table_find_or_insert(dump->current_buffer->obj_table, (st_data_t)obj);
12689 if (
id == 0 || rb_id2name(
id) == NULL) {
12692 return ibf_dump_object(dump,
rb_id2sym(
id));
12696ibf_load_id(
const struct ibf_load *load,
const ID id_index)
12698 if (id_index == 0) {
12701 VALUE sym = ibf_load_object(load, id_index);
12711static ibf_offset_t ibf_dump_iseq_each(
struct ibf_dump *dump,
const rb_iseq_t *iseq);
12716 if (iseq == NULL) {
12720 return ibf_table_find_or_insert(dump->iseq_table, (st_data_t)iseq);
12724static unsigned char
12725ibf_load_byte(
const struct ibf_load *load, ibf_offset_t *offset)
12727 if (*offset >= load->current_buffer->size) { rb_raise(
rb_eRuntimeError,
"invalid bytecode"); }
12728 return (
unsigned char)load->current_buffer->buff[(*offset)++];
12744 if (
sizeof(
VALUE) > 8 || CHAR_BIT != 8) {
12745 ibf_dump_write(dump, &x,
sizeof(
VALUE));
12749 enum { max_byte_length =
sizeof(
VALUE) + 1 };
12751 unsigned char bytes[max_byte_length];
12754 for (n = 0; n <
sizeof(
VALUE) && (x >> (7 - n)); n++, x >>= 8) {
12755 bytes[max_byte_length - 1 - n] = (
unsigned char)x;
12761 bytes[max_byte_length - 1 - n] = (
unsigned char)x;
12764 ibf_dump_write(dump, bytes + max_byte_length - n, n);
12768ibf_load_small_value(
const struct ibf_load *load, ibf_offset_t *offset)
12770 if (
sizeof(
VALUE) > 8 || CHAR_BIT != 8) {
12771 union {
char s[
sizeof(
VALUE)];
VALUE v; } x;
12773 memcpy(x.s, load->current_buffer->buff + *offset,
sizeof(
VALUE));
12774 *offset +=
sizeof(
VALUE);
12779 enum { max_byte_length =
sizeof(
VALUE) + 1 };
12781 const unsigned char *buffer = (
const unsigned char *)load->current_buffer->buff;
12782 const unsigned char c = buffer[*offset];
12786 c == 0 ? 9 : ntz_int32(c) + 1;
12789 if (*offset + n > load->current_buffer->size) {
12794 for (i = 1; i < n; i++) {
12796 x |= (
VALUE)buffer[*offset + i];
12810 ibf_dump_write_small_value(dump, (
VALUE)bf->index);
12812 size_t len = strlen(bf->name);
12813 ibf_dump_write_small_value(dump, (
VALUE)
len);
12814 ibf_dump_write(dump, bf->name,
len);
12818ibf_load_builtin(
const struct ibf_load *load, ibf_offset_t *offset)
12820 int i = (int)ibf_load_small_value(load, offset);
12821 int len = (int)ibf_load_small_value(load, offset);
12822 const char *name = (
char *)ibf_load_ptr(load, offset,
len);
12825 fprintf(stderr,
"%.*s!!\n",
len, name);
12829 if (table == NULL) rb_raise(rb_eArgError,
"builtin function table is not provided");
12830 if (strncmp(table[i].name, name,
len) != 0) {
12831 rb_raise(rb_eArgError,
"builtin function index (%d) mismatch (expect %s but %s)", i, name, table[i].name);
12842 const int iseq_size = body->iseq_size;
12844 const VALUE *orig_code = rb_iseq_original_iseq(iseq);
12846 ibf_offset_t offset = ibf_dump_pos(dump);
12848 for (code_index=0; code_index<iseq_size;) {
12849 const VALUE insn = orig_code[code_index++];
12850 const char *types = insn_op_types(insn);
12855 ibf_dump_write_small_value(dump, insn);
12858 for (op_index=0; types[op_index]; op_index++, code_index++) {
12859 VALUE op = orig_code[code_index];
12862 switch (types[op_index]) {
12865 wv = ibf_dump_object(dump, op);
12874 wv = ibf_dump_object(dump, arr);
12882 wv = is - ISEQ_IS_ENTRY_START(body, types[op_index]);
12890 wv = ibf_dump_id(dump, (
ID)op);
12902 ibf_dump_write_small_value(dump, wv);
12912ibf_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)
12915 unsigned int code_index;
12916 ibf_offset_t reading_pos = bytecode_offset;
12920 struct rb_call_data *cd_entries = load_body->call_data;
12923 iseq_bits_t * mark_offset_bits;
12925 iseq_bits_t tmp[1] = {0};
12927 if (ISEQ_MBITS_BUFLEN(iseq_size) == 1) {
12928 mark_offset_bits = tmp;
12931 mark_offset_bits =
ZALLOC_N(iseq_bits_t, ISEQ_MBITS_BUFLEN(iseq_size));
12933 bool needs_bitmap =
false;
12935 for (code_index=0; code_index<iseq_size;) {
12937 const VALUE insn = code[code_index] = ibf_load_small_value(load, &reading_pos);
12938 const char *types = insn_op_types(insn);
12944 for (op_index=0; types[op_index]; op_index++, code_index++) {
12945 const char operand_type = types[op_index];
12946 switch (operand_type) {
12949 VALUE op = ibf_load_small_value(load, &reading_pos);
12950 VALUE v = ibf_load_object(load, op);
12951 code[code_index] = v;
12954 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12955 needs_bitmap =
true;
12961 VALUE op = ibf_load_small_value(load, &reading_pos);
12962 VALUE v = ibf_load_object(load, op);
12963 v = rb_hash_dup(v);
12964 RHASH_TBL_RAW(v)->type = &cdhash_type;
12966 freeze_hide_obj(v);
12971 pinned_list_store(load->current_buffer->obj_list, (
long)op, v);
12973 code[code_index] = v;
12974 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12976 needs_bitmap =
true;
12981 VALUE op = (
VALUE)ibf_load_small_value(load, &reading_pos);
12983 code[code_index] = v;
12986 ISEQ_MBITS_SET(mark_offset_bits, code_index);
12987 needs_bitmap =
true;
12993 VALUE op = ibf_load_small_value(load, &reading_pos);
12994 VALUE arr = ibf_load_object(load, op);
12996 IC ic = &ISEQ_IS_IC_ENTRY(load_body, ic_index++);
12997 ic->
segments = array_to_idlist(arr);
12999 code[code_index] = (
VALUE)ic;
13006 unsigned int op = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13008 ISE ic = ISEQ_IS_ENTRY_START(load_body, operand_type) + op;
13009 code[code_index] = (
VALUE)ic;
13011 if (operand_type == TS_IVC) {
13014 if (insn == BIN(setinstancevariable)) {
13015 ID iv_name = (
ID)code[code_index - 1];
13016 cache->iv_set_name = iv_name;
13019 cache->iv_set_name = 0;
13022 vm_ic_attr_index_initialize(cache, INVALID_SHAPE_ID);
13029 code[code_index] = (
VALUE)cd_entries++;
13034 VALUE op = ibf_load_small_value(load, &reading_pos);
13035 code[code_index] = ibf_load_id(load, (
ID)(
VALUE)op);
13042 code[code_index] = (
VALUE)ibf_load_builtin(load, &reading_pos);
13045 code[code_index] = ibf_load_small_value(load, &reading_pos);
13049 if (insn_len(insn) != op_index+1) {
13054 load_body->iseq_encoded = code;
13055 load_body->iseq_size = code_index;
13057 if (ISEQ_MBITS_BUFLEN(load_body->iseq_size) == 1) {
13058 load_body->mark_bits.single = mark_offset_bits[0];
13061 if (needs_bitmap) {
13062 load_body->mark_bits.list = mark_offset_bits;
13065 load_body->mark_bits.list = 0;
13066 ruby_xfree(mark_offset_bits);
13071 RUBY_ASSERT(reading_pos == bytecode_offset + bytecode_size);
13078 int opt_num = ISEQ_BODY(iseq)->param.opt_num;
13081 IBF_W_ALIGN(
VALUE);
13082 return ibf_dump_write(dump, ISEQ_BODY(iseq)->param.opt_table,
sizeof(
VALUE) * (opt_num + 1));
13085 return ibf_dump_pos(dump);
13090ibf_load_param_opt_table(
const struct ibf_load *load, ibf_offset_t opt_table_offset,
int opt_num)
13094 MEMCPY(table, load->current_buffer->buff + opt_table_offset,
VALUE, opt_num+1);
13105 const struct rb_iseq_param_keyword *kw = ISEQ_BODY(iseq)->param.keyword;
13108 struct rb_iseq_param_keyword dump_kw = *kw;
13109 int dv_num = kw->num - kw->required_num;
13114 for (i=0; i<kw->num; i++) ids[i] = (
ID)ibf_dump_id(dump, kw->table[i]);
13115 for (i=0; i<dv_num; i++) dvs[i] = (
VALUE)ibf_dump_object(dump, kw->default_values[i]);
13117 dump_kw.table = IBF_W(ids,
ID, kw->num);
13118 dump_kw.default_values = IBF_W(dvs,
VALUE, dv_num);
13119 IBF_W_ALIGN(
struct rb_iseq_param_keyword);
13120 return ibf_dump_write(dump, &dump_kw,
sizeof(
struct rb_iseq_param_keyword) * 1);
13127static const struct rb_iseq_param_keyword *
13128ibf_load_param_keyword(
const struct ibf_load *load, ibf_offset_t param_keyword_offset)
13130 if (param_keyword_offset) {
13131 struct rb_iseq_param_keyword *kw = IBF_R(param_keyword_offset,
struct rb_iseq_param_keyword, 1);
13132 int dv_num = kw->num - kw->required_num;
13133 VALUE *dvs = dv_num ? IBF_R(kw->default_values,
VALUE, dv_num) : NULL;
13136 for (i=0; i<dv_num; i++) {
13137 dvs[i] = ibf_load_object(load, dvs[i]);
13143 kw->default_values = dvs;
13154 ibf_offset_t offset = ibf_dump_pos(dump);
13158 for (i = 0; i < ISEQ_BODY(iseq)->insns_info.size; i++) {
13159 ibf_dump_write_small_value(dump, entries[i].line_no);
13160#ifdef USE_ISEQ_NODE_ID
13161 ibf_dump_write_small_value(dump, entries[i].node_id);
13163 ibf_dump_write_small_value(dump, entries[i].events);
13170ibf_load_insns_info_body(
const struct ibf_load *load, ibf_offset_t body_offset,
unsigned int size)
13172 ibf_offset_t reading_pos = body_offset;
13176 for (i = 0; i < size; i++) {
13177 entries[i].line_no = (int)ibf_load_small_value(load, &reading_pos);
13178#ifdef USE_ISEQ_NODE_ID
13179 entries[i].node_id = (int)ibf_load_small_value(load, &reading_pos);
13181 entries[i].events = (
rb_event_flag_t)ibf_load_small_value(load, &reading_pos);
13188ibf_dump_insns_info_positions(
struct ibf_dump *dump,
const unsigned int *positions,
unsigned int size)
13190 ibf_offset_t offset = ibf_dump_pos(dump);
13192 unsigned int last = 0;
13194 for (i = 0; i < size; i++) {
13195 ibf_dump_write_small_value(dump, positions[i] - last);
13196 last = positions[i];
13202static unsigned int *
13203ibf_load_insns_info_positions(
const struct ibf_load *load, ibf_offset_t positions_offset,
unsigned int size)
13205 ibf_offset_t reading_pos = positions_offset;
13206 unsigned int *positions =
ALLOC_N(
unsigned int, size);
13208 unsigned int last = 0;
13210 for (i = 0; i < size; i++) {
13211 positions[i] = last + (
unsigned int)ibf_load_small_value(load, &reading_pos);
13212 last = positions[i];
13222 const int size = body->local_table_size;
13226 for (i=0; i<size; i++) {
13227 VALUE v = ibf_dump_id(dump, body->local_table[i]);
13230 v = ibf_dump_object(dump,
ULONG2NUM(body->local_table[i]));
13236 return ibf_dump_write(dump, table,
sizeof(
ID) * size);
13240ibf_load_local_table(
const struct ibf_load *load, ibf_offset_t local_table_offset,
int size)
13243 ID *table = IBF_R(local_table_offset,
ID, size);
13246 for (i=0; i<size; i++) {
13247 table[i] = ibf_load_id(load, table[i]);
13262 int *iseq_indices =
ALLOCA_N(
int, table->size);
13265 for (i=0; i<table->size; i++) {
13266 iseq_indices[i] = ibf_dump_iseq(dump, table->entries[i].iseq);
13269 const ibf_offset_t offset = ibf_dump_pos(dump);
13271 for (i=0; i<table->size; i++) {
13272 ibf_dump_write_small_value(dump, iseq_indices[i]);
13273 ibf_dump_write_small_value(dump, table->entries[i].type);
13274 ibf_dump_write_small_value(dump, table->entries[i].start);
13275 ibf_dump_write_small_value(dump, table->entries[i].end);
13276 ibf_dump_write_small_value(dump, table->entries[i].cont);
13277 ibf_dump_write_small_value(dump, table->entries[i].sp);
13282 return ibf_dump_pos(dump);
13287ibf_load_catch_table(
const struct ibf_load *load, ibf_offset_t catch_table_offset,
unsigned int size)
13290 struct iseq_catch_table *table = ruby_xmalloc(iseq_catch_table_bytes(size));
13291 table->size = size;
13293 ibf_offset_t reading_pos = catch_table_offset;
13296 for (i=0; i<table->size; i++) {
13297 int iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13298 table->entries[i].type = (
enum rb_catch_type)ibf_load_small_value(load, &reading_pos);
13299 table->entries[i].start = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13300 table->entries[i].end = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13301 table->entries[i].cont = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13302 table->entries[i].sp = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13304 table->entries[i].iseq = ibf_load_iseq(load, (
const rb_iseq_t *)(
VALUE)iseq_index);
13317 const unsigned int ci_size = body->ci_size;
13320 ibf_offset_t offset = ibf_dump_pos(dump);
13324 for (i = 0; i < ci_size; i++) {
13327 ibf_dump_write_small_value(dump, ibf_dump_id(dump, vm_ci_mid(ci)));
13328 ibf_dump_write_small_value(dump, vm_ci_flag(ci));
13329 ibf_dump_write_small_value(dump, vm_ci_argc(ci));
13333 int len = kwarg->keyword_len;
13334 ibf_dump_write_small_value(dump,
len);
13335 for (
int j=0; j<
len; j++) {
13336 VALUE keyword = ibf_dump_object(dump, kwarg->keywords[j]);
13337 ibf_dump_write_small_value(dump, keyword);
13341 ibf_dump_write_small_value(dump, 0);
13346 ibf_dump_write_small_value(dump, (
VALUE)-1);
13364static enum rb_id_table_iterator_result
13365store_outer_variable(
ID id,
VALUE val,
void *dump)
13370 pair->name = rb_id2str(
id);
13372 return ID_TABLE_CONTINUE;
13376outer_variable_cmp(
const void *a,
const void *b,
void *arg)
13386 struct rb_id_table * ovs = ISEQ_BODY(iseq)->outer_variables;
13388 ibf_offset_t offset = ibf_dump_pos(dump);
13390 size_t size = ovs ? rb_id_table_size(ovs) : 0;
13391 ibf_dump_write_small_value(dump, (
VALUE)size);
13400 rb_id_table_foreach(ovs, store_outer_variable, ovlist);
13402 for (
size_t i = 0; i < size; ++i) {
13403 ID id = ovlist->pairs[i].id;
13404 ID val = ovlist->pairs[i].val;
13405 ibf_dump_write_small_value(dump, ibf_dump_id(dump,
id));
13406 ibf_dump_write_small_value(dump, val);
13415ibf_load_ci_entries(
const struct ibf_load *load,
13416 ibf_offset_t ci_entries_offset,
13417 unsigned int ci_size,
13425 ibf_offset_t reading_pos = ci_entries_offset;
13432 for (i = 0; i < ci_size; i++) {
13433 VALUE mid_index = ibf_load_small_value(load, &reading_pos);
13434 if (mid_index != (
VALUE)-1) {
13435 ID mid = ibf_load_id(load, mid_index);
13436 unsigned int flag = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13437 unsigned int argc = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13440 int kwlen = (int)ibf_load_small_value(load, &reading_pos);
13443 kwarg->references = 0;
13444 kwarg->keyword_len = kwlen;
13445 for (
int j=0; j<kwlen; j++) {
13446 VALUE keyword = ibf_load_small_value(load, &reading_pos);
13447 kwarg->keywords[j] = ibf_load_object(load, keyword);
13451 cds[i].ci = vm_ci_new(mid, flag, argc, kwarg);
13453 cds[i].cc = vm_cc_empty();
13464ibf_load_outer_variables(
const struct ibf_load * load, ibf_offset_t outer_variables_offset)
13466 ibf_offset_t reading_pos = outer_variables_offset;
13470 size_t table_size = (size_t)ibf_load_small_value(load, &reading_pos);
13472 if (table_size > 0) {
13473 tbl = rb_id_table_create(table_size);
13476 for (
size_t i = 0; i < table_size; i++) {
13477 ID key = ibf_load_id(load, (
ID)ibf_load_small_value(load, &reading_pos));
13478 VALUE value = ibf_load_small_value(load, &reading_pos);
13479 if (!key) key = rb_make_temporary_id(i);
13480 rb_id_table_insert(tbl, key, value);
13489 RUBY_ASSERT(dump->current_buffer == &dump->global_buffer);
13491 unsigned int *positions;
13495 const VALUE location_pathobj_index = ibf_dump_object(dump, body->location.pathobj);
13496 const VALUE location_base_label_index = ibf_dump_object(dump, body->location.base_label);
13497 const VALUE location_label_index = ibf_dump_object(dump, body->location.label);
13499#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13500 ibf_offset_t iseq_start = ibf_dump_pos(dump);
13505 buffer.obj_table = ibf_dump_object_table_new();
13506 dump->current_buffer = &buffer;
13509 const ibf_offset_t bytecode_offset = ibf_dump_code(dump, iseq);
13510 const ibf_offset_t bytecode_size = ibf_dump_pos(dump) - bytecode_offset;
13511 const ibf_offset_t param_opt_table_offset = ibf_dump_param_opt_table(dump, iseq);
13512 const ibf_offset_t param_keyword_offset = ibf_dump_param_keyword(dump, iseq);
13513 const ibf_offset_t insns_info_body_offset = ibf_dump_insns_info_body(dump, iseq);
13515 positions = rb_iseq_insns_info_decode_positions(ISEQ_BODY(iseq));
13516 const ibf_offset_t insns_info_positions_offset = ibf_dump_insns_info_positions(dump, positions, body->insns_info.size);
13517 ruby_xfree(positions);
13519 const ibf_offset_t local_table_offset = ibf_dump_local_table(dump, iseq);
13520 const unsigned int catch_table_size = body->catch_table ? body->catch_table->size : 0;
13521 const ibf_offset_t catch_table_offset = ibf_dump_catch_table(dump, iseq);
13522 const int parent_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->parent_iseq);
13523 const int local_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->local_iseq);
13524 const int mandatory_only_iseq_index = ibf_dump_iseq(dump, ISEQ_BODY(iseq)->mandatory_only_iseq);
13525 const ibf_offset_t ci_entries_offset = ibf_dump_ci_entries(dump, iseq);
13526 const ibf_offset_t outer_variables_offset = ibf_dump_outer_variables(dump, iseq);
13528#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13529 ibf_offset_t local_obj_list_offset;
13530 unsigned int local_obj_list_size;
13532 ibf_dump_object_list(dump, &local_obj_list_offset, &local_obj_list_size);
13535 ibf_offset_t body_offset = ibf_dump_pos(dump);
13538 unsigned int param_flags =
13539 (body->
param.flags.has_lead << 0) |
13540 (body->
param.flags.has_opt << 1) |
13541 (body->
param.flags.has_rest << 2) |
13542 (body->
param.flags.has_post << 3) |
13543 (body->
param.flags.has_kw << 4) |
13544 (body->
param.flags.has_kwrest << 5) |
13545 (body->
param.flags.has_block << 6) |
13546 (body->
param.flags.ambiguous_param0 << 7) |
13547 (body->
param.flags.accepts_no_kwarg << 8) |
13548 (body->
param.flags.ruby2_keywords << 9) |
13549 (body->
param.flags.anon_rest << 10) |
13550 (body->
param.flags.anon_kwrest << 11) |
13551 (body->
param.flags.use_block << 12) |
13552 (body->
param.flags.forwardable << 13) ;
13554#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13555# define IBF_BODY_OFFSET(x) (x)
13557# define IBF_BODY_OFFSET(x) (body_offset - (x))
13560 ibf_dump_write_small_value(dump, body->type);
13561 ibf_dump_write_small_value(dump, body->iseq_size);
13562 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(bytecode_offset));
13563 ibf_dump_write_small_value(dump, bytecode_size);
13564 ibf_dump_write_small_value(dump, param_flags);
13565 ibf_dump_write_small_value(dump, body->
param.size);
13566 ibf_dump_write_small_value(dump, body->
param.lead_num);
13567 ibf_dump_write_small_value(dump, body->
param.opt_num);
13568 ibf_dump_write_small_value(dump, body->
param.rest_start);
13569 ibf_dump_write_small_value(dump, body->
param.post_start);
13570 ibf_dump_write_small_value(dump, body->
param.post_num);
13571 ibf_dump_write_small_value(dump, body->
param.block_start);
13572 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(param_opt_table_offset));
13573 ibf_dump_write_small_value(dump, param_keyword_offset);
13574 ibf_dump_write_small_value(dump, location_pathobj_index);
13575 ibf_dump_write_small_value(dump, location_base_label_index);
13576 ibf_dump_write_small_value(dump, location_label_index);
13577 ibf_dump_write_small_value(dump, body->location.first_lineno);
13578 ibf_dump_write_small_value(dump, body->location.node_id);
13579 ibf_dump_write_small_value(dump, body->location.code_location.beg_pos.lineno);
13580 ibf_dump_write_small_value(dump, body->location.code_location.beg_pos.column);
13581 ibf_dump_write_small_value(dump, body->location.code_location.end_pos.lineno);
13582 ibf_dump_write_small_value(dump, body->location.code_location.end_pos.column);
13583 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(insns_info_body_offset));
13584 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(insns_info_positions_offset));
13585 ibf_dump_write_small_value(dump, body->insns_info.size);
13586 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(local_table_offset));
13587 ibf_dump_write_small_value(dump, catch_table_size);
13588 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(catch_table_offset));
13589 ibf_dump_write_small_value(dump, parent_iseq_index);
13590 ibf_dump_write_small_value(dump, local_iseq_index);
13591 ibf_dump_write_small_value(dump, mandatory_only_iseq_index);
13592 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(ci_entries_offset));
13593 ibf_dump_write_small_value(dump, IBF_BODY_OFFSET(outer_variables_offset));
13594 ibf_dump_write_small_value(dump, body->variable.flip_count);
13595 ibf_dump_write_small_value(dump, body->local_table_size);
13596 ibf_dump_write_small_value(dump, body->ivc_size);
13597 ibf_dump_write_small_value(dump, body->icvarc_size);
13598 ibf_dump_write_small_value(dump, body->ise_size);
13599 ibf_dump_write_small_value(dump, body->ic_size);
13600 ibf_dump_write_small_value(dump, body->ci_size);
13601 ibf_dump_write_small_value(dump, body->stack_max);
13602 ibf_dump_write_small_value(dump, body->builtin_attrs);
13603 ibf_dump_write_small_value(dump, body->prism ? 1 : 0);
13605#undef IBF_BODY_OFFSET
13607#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13608 ibf_offset_t iseq_length_bytes = ibf_dump_pos(dump);
13610 dump->current_buffer = saved_buffer;
13611 ibf_dump_write(dump, RSTRING_PTR(buffer.str), iseq_length_bytes);
13613 ibf_offset_t offset = ibf_dump_pos(dump);
13614 ibf_dump_write_small_value(dump, iseq_start);
13615 ibf_dump_write_small_value(dump, iseq_length_bytes);
13616 ibf_dump_write_small_value(dump, body_offset);
13618 ibf_dump_write_small_value(dump, local_obj_list_offset);
13619 ibf_dump_write_small_value(dump, local_obj_list_size);
13621 st_free_table(buffer.obj_table);
13625 return body_offset;
13630ibf_load_location_str(
const struct ibf_load *load,
VALUE str_index)
13632 VALUE str = ibf_load_object(load, str_index);
13634 str = rb_fstring(str);
13644 ibf_offset_t reading_pos = offset;
13646#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13648 load->current_buffer = &load->global_buffer;
13650 const ibf_offset_t iseq_start = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13651 const ibf_offset_t iseq_length_bytes = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13652 const ibf_offset_t body_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13655 buffer.buff = load->global_buffer.buff + iseq_start;
13656 buffer.size = iseq_length_bytes;
13657 buffer.obj_list_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13658 buffer.obj_list_size = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13659 buffer.obj_list = pinned_list_new(buffer.obj_list_size);
13661 load->current_buffer = &buffer;
13662 reading_pos = body_offset;
13665#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13666# define IBF_BODY_OFFSET(x) (x)
13668# define IBF_BODY_OFFSET(x) (offset - (x))
13671 const unsigned int type = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13672 const unsigned int iseq_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13673 const ibf_offset_t bytecode_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13674 const ibf_offset_t bytecode_size = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13675 const unsigned int param_flags = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13676 const unsigned int param_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13677 const int param_lead_num = (int)ibf_load_small_value(load, &reading_pos);
13678 const int param_opt_num = (int)ibf_load_small_value(load, &reading_pos);
13679 const int param_rest_start = (int)ibf_load_small_value(load, &reading_pos);
13680 const int param_post_start = (int)ibf_load_small_value(load, &reading_pos);
13681 const int param_post_num = (int)ibf_load_small_value(load, &reading_pos);
13682 const int param_block_start = (int)ibf_load_small_value(load, &reading_pos);
13683 const ibf_offset_t param_opt_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13684 const ibf_offset_t param_keyword_offset = (ibf_offset_t)ibf_load_small_value(load, &reading_pos);
13685 const VALUE location_pathobj_index = ibf_load_small_value(load, &reading_pos);
13686 const VALUE location_base_label_index = ibf_load_small_value(load, &reading_pos);
13687 const VALUE location_label_index = ibf_load_small_value(load, &reading_pos);
13688 const int location_first_lineno = (int)ibf_load_small_value(load, &reading_pos);
13689 const int location_node_id = (int)ibf_load_small_value(load, &reading_pos);
13690 const int location_code_location_beg_pos_lineno = (int)ibf_load_small_value(load, &reading_pos);
13691 const int location_code_location_beg_pos_column = (int)ibf_load_small_value(load, &reading_pos);
13692 const int location_code_location_end_pos_lineno = (int)ibf_load_small_value(load, &reading_pos);
13693 const int location_code_location_end_pos_column = (int)ibf_load_small_value(load, &reading_pos);
13694 const ibf_offset_t insns_info_body_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13695 const ibf_offset_t insns_info_positions_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13696 const unsigned int insns_info_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13697 const ibf_offset_t local_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13698 const unsigned int catch_table_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13699 const ibf_offset_t catch_table_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13700 const int parent_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13701 const int local_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13702 const int mandatory_only_iseq_index = (int)ibf_load_small_value(load, &reading_pos);
13703 const ibf_offset_t ci_entries_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13704 const ibf_offset_t outer_variables_offset = (ibf_offset_t)IBF_BODY_OFFSET(ibf_load_small_value(load, &reading_pos));
13705 const rb_snum_t variable_flip_count = (rb_snum_t)ibf_load_small_value(load, &reading_pos);
13706 const unsigned int local_table_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13708 const unsigned int ivc_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13709 const unsigned int icvarc_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13710 const unsigned int ise_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13711 const unsigned int ic_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13713 const unsigned int ci_size = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13714 const unsigned int stack_max = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13715 const unsigned int builtin_attrs = (
unsigned int)ibf_load_small_value(load, &reading_pos);
13716 const bool prism = (bool)ibf_load_small_value(load, &reading_pos);
13719 VALUE path = ibf_load_object(load, location_pathobj_index);
13724 realpath = path = rb_fstring(path);
13727 VALUE pathobj = path;
13733 if (!
NIL_P(realpath)) {
13735 rb_raise(rb_eArgError,
"unexpected realpath %"PRIxVALUE
13736 "(%x), path=%+"PRIsVALUE,
13737 realpath,
TYPE(realpath), path);
13739 realpath = rb_fstring(realpath);
13745 rb_iseq_pathobj_set(iseq, path, realpath);
13750 VALUE dummy_frame = rb_vm_push_frame_fname(ec, path);
13752#undef IBF_BODY_OFFSET
13754 load_body->type =
type;
13755 load_body->stack_max = stack_max;
13756 load_body->
param.flags.has_lead = (param_flags >> 0) & 1;
13757 load_body->
param.flags.has_opt = (param_flags >> 1) & 1;
13758 load_body->
param.flags.has_rest = (param_flags >> 2) & 1;
13759 load_body->
param.flags.has_post = (param_flags >> 3) & 1;
13760 load_body->
param.flags.has_kw = FALSE;
13761 load_body->
param.flags.has_kwrest = (param_flags >> 5) & 1;
13762 load_body->
param.flags.has_block = (param_flags >> 6) & 1;
13763 load_body->
param.flags.ambiguous_param0 = (param_flags >> 7) & 1;
13764 load_body->
param.flags.accepts_no_kwarg = (param_flags >> 8) & 1;
13765 load_body->
param.flags.ruby2_keywords = (param_flags >> 9) & 1;
13766 load_body->
param.flags.anon_rest = (param_flags >> 10) & 1;
13767 load_body->
param.flags.anon_kwrest = (param_flags >> 11) & 1;
13768 load_body->
param.flags.use_block = (param_flags >> 12) & 1;
13769 load_body->
param.flags.forwardable = (param_flags >> 13) & 1;
13770 load_body->
param.size = param_size;
13771 load_body->
param.lead_num = param_lead_num;
13772 load_body->
param.opt_num = param_opt_num;
13773 load_body->
param.rest_start = param_rest_start;
13774 load_body->
param.post_start = param_post_start;
13775 load_body->
param.post_num = param_post_num;
13776 load_body->
param.block_start = param_block_start;
13777 load_body->local_table_size = local_table_size;
13778 load_body->ci_size = ci_size;
13779 load_body->insns_info.size = insns_info_size;
13781 ISEQ_COVERAGE_SET(iseq,
Qnil);
13782 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
13783 load_body->variable.flip_count = variable_flip_count;
13784 load_body->variable.script_lines =
Qnil;
13786 load_body->location.first_lineno = location_first_lineno;
13787 load_body->location.node_id = location_node_id;
13788 load_body->location.code_location.beg_pos.lineno = location_code_location_beg_pos_lineno;
13789 load_body->location.code_location.beg_pos.column = location_code_location_beg_pos_column;
13790 load_body->location.code_location.end_pos.lineno = location_code_location_end_pos_lineno;
13791 load_body->location.code_location.end_pos.column = location_code_location_end_pos_column;
13792 load_body->builtin_attrs = builtin_attrs;
13793 load_body->prism = prism;
13795 load_body->ivc_size = ivc_size;
13796 load_body->icvarc_size = icvarc_size;
13797 load_body->ise_size = ise_size;
13798 load_body->ic_size = ic_size;
13800 if (ISEQ_IS_SIZE(load_body)) {
13804 load_body->is_entries = NULL;
13806 ibf_load_ci_entries(load, ci_entries_offset, ci_size, &load_body->call_data);
13807 load_body->outer_variables = ibf_load_outer_variables(load, outer_variables_offset);
13808 load_body->
param.opt_table = ibf_load_param_opt_table(load, param_opt_table_offset, param_opt_num);
13809 load_body->
param.keyword = ibf_load_param_keyword(load, param_keyword_offset);
13810 load_body->
param.flags.has_kw = (param_flags >> 4) & 1;
13811 load_body->insns_info.body = ibf_load_insns_info_body(load, insns_info_body_offset, insns_info_size);
13812 load_body->insns_info.positions = ibf_load_insns_info_positions(load, insns_info_positions_offset, insns_info_size);
13813 load_body->local_table = ibf_load_local_table(load, local_table_offset, local_table_size);
13814 load_body->catch_table = ibf_load_catch_table(load, catch_table_offset, catch_table_size);
13815 load_body->parent_iseq = ibf_load_iseq(load, (
const rb_iseq_t *)(
VALUE)parent_iseq_index);
13816 load_body->local_iseq = ibf_load_iseq(load, (
const rb_iseq_t *)(
VALUE)local_iseq_index);
13817 load_body->mandatory_only_iseq = ibf_load_iseq(load, (
const rb_iseq_t *)(
VALUE)mandatory_only_iseq_index);
13820 if (load_body->
param.keyword != NULL) {
13822 struct rb_iseq_param_keyword *keyword = (
struct rb_iseq_param_keyword *) load_body->
param.keyword;
13823 keyword->table = &load_body->local_table[keyword->bits_start - keyword->num];
13826 ibf_load_code(load, iseq, bytecode_offset, bytecode_size, iseq_size);
13827#if VM_INSN_INFO_TABLE_IMPL == 2
13828 rb_iseq_insns_info_encode_positions(iseq);
13831 rb_iseq_translate_threaded_code(iseq);
13833#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13834 load->current_buffer = &load->global_buffer;
13837 RB_OBJ_WRITE(iseq, &load_body->location.base_label, ibf_load_location_str(load, location_base_label_index));
13838 RB_OBJ_WRITE(iseq, &load_body->location.label, ibf_load_location_str(load, location_label_index));
13840#if IBF_ISEQ_ENABLE_LOCAL_BUFFER
13841 load->current_buffer = saved_buffer;
13843 verify_call_cache(iseq);
13846 rb_vm_pop_frame_no_int(ec);
13856ibf_dump_iseq_list_i(st_data_t key, st_data_t val, st_data_t ptr)
13861 ibf_offset_t offset = ibf_dump_iseq_each(args->dump, iseq);
13862 rb_ary_push(args->offset_list,
UINT2NUM(offset));
13864 return ST_CONTINUE;
13870 VALUE offset_list = rb_ary_hidden_new(dump->iseq_table->num_entries);
13874 args.offset_list = offset_list;
13876 st_foreach(dump->iseq_table, ibf_dump_iseq_list_i, (st_data_t)&args);
13879 st_index_t size = dump->iseq_table->num_entries;
13880 ibf_offset_t *offsets =
ALLOCA_N(ibf_offset_t, size);
13882 for (i = 0; i < size; i++) {
13886 ibf_dump_align(dump,
sizeof(ibf_offset_t));
13887 header->iseq_list_offset = ibf_dump_write(dump, offsets,
sizeof(ibf_offset_t) * size);
13888 header->iseq_list_size = (
unsigned int)size;
13891#define IBF_OBJECT_INTERNAL FL_PROMOTED0
13900 unsigned int type: 5;
13901 unsigned int special_const: 1;
13902 unsigned int frozen: 1;
13903 unsigned int internal: 1;
13906enum ibf_object_class_index {
13907 IBF_OBJECT_CLASS_OBJECT,
13908 IBF_OBJECT_CLASS_ARRAY,
13909 IBF_OBJECT_CLASS_STANDARD_ERROR,
13910 IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR,
13911 IBF_OBJECT_CLASS_TYPE_ERROR,
13912 IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR,
13922 long keyval[FLEX_ARY_LEN];
13935 BDIGIT digits[FLEX_ARY_LEN];
13938enum ibf_object_data_type {
13939 IBF_OBJECT_DATA_ENCODING,
13950#define IBF_ALIGNED_OFFSET(align, offset) \
13951 ((((offset) - 1) / (align) + 1) * (align))
13952#define IBF_OBJBODY(type, offset) (const type *)\
13953 ibf_load_check_offset(load, IBF_ALIGNED_OFFSET(RUBY_ALIGNOF(type), offset))
13956ibf_load_check_offset(
const struct ibf_load *load,
size_t offset)
13958 if (offset >= load->current_buffer->size) {
13959 rb_raise(
rb_eIndexError,
"object offset out of range: %"PRIdSIZE, offset);
13961 return load->current_buffer->buff + offset;
13964NORETURN(
static void ibf_dump_object_unsupported(
struct ibf_dump *dump,
VALUE obj));
13967ibf_dump_object_unsupported(
struct ibf_dump *dump,
VALUE obj)
13970 rb_raw_obj_info(buff,
sizeof(buff), obj);
13979 rb_raise(rb_eArgError,
"unsupported");
13986 enum ibf_object_class_index cindex;
13987 if (obj == rb_cObject) {
13988 cindex = IBF_OBJECT_CLASS_OBJECT;
13991 cindex = IBF_OBJECT_CLASS_ARRAY;
13994 cindex = IBF_OBJECT_CLASS_STANDARD_ERROR;
13997 cindex = IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR;
14000 cindex = IBF_OBJECT_CLASS_TYPE_ERROR;
14003 cindex = IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR;
14006 rb_obj_info_dump(obj);
14008 rb_bug(
"unsupported class");
14010 ibf_dump_write_small_value(dump, (
VALUE)cindex);
14016 enum ibf_object_class_index cindex = (
enum ibf_object_class_index)ibf_load_small_value(load, &offset);
14019 case IBF_OBJECT_CLASS_OBJECT:
14021 case IBF_OBJECT_CLASS_ARRAY:
14023 case IBF_OBJECT_CLASS_STANDARD_ERROR:
14025 case IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_ERROR:
14027 case IBF_OBJECT_CLASS_TYPE_ERROR:
14029 case IBF_OBJECT_CLASS_NO_MATCHING_PATTERN_KEY_ERROR:
14033 rb_raise(rb_eArgError,
"ibf_load_object_class: unknown class (%d)", (
int)cindex);
14041 (void)IBF_W(&dbl,
double, 1);
14047 const double *dblp = IBF_OBJBODY(
double, offset);
14054 long encindex = (long)rb_enc_get_index(obj);
14055 long len = RSTRING_LEN(obj);
14056 const char *ptr = RSTRING_PTR(obj);
14058 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14059 rb_encoding *enc = rb_enc_from_index((
int)encindex);
14060 const char *enc_name = rb_enc_name(enc);
14061 encindex = RUBY_ENCINDEX_BUILTIN_MAX + ibf_dump_object(dump,
rb_str_new2(enc_name));
14064 ibf_dump_write_small_value(dump, encindex);
14065 ibf_dump_write_small_value(dump,
len);
14066 IBF_WP(ptr,
char,
len);
14072 ibf_offset_t reading_pos = offset;
14074 int encindex = (int)ibf_load_small_value(load, &reading_pos);
14075 const long len = (long)ibf_load_small_value(load, &reading_pos);
14076 const char *ptr = load->current_buffer->buff + reading_pos;
14078 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14079 VALUE enc_name_str = ibf_load_object(load, encindex - RUBY_ENCINDEX_BUILTIN_MAX);
14080 encindex = rb_enc_find_index(RSTRING_PTR(enc_name_str));
14084 if (header->frozen && !header->internal) {
14085 str = rb_enc_literal_str(ptr,
len, rb_enc_from_index(encindex));
14088 str = rb_enc_str_new(ptr,
len, rb_enc_from_index(encindex));
14091 if (header->frozen) str = rb_fstring(str);
14102 regexp.srcstr = (long)ibf_dump_object(dump, srcstr);
14104 ibf_dump_write_byte(dump, (
unsigned char)regexp.option);
14105 ibf_dump_write_small_value(dump, regexp.srcstr);
14112 regexp.option = ibf_load_byte(load, &offset);
14113 regexp.srcstr = ibf_load_small_value(load, &offset);
14115 VALUE srcstr = ibf_load_object(load, regexp.srcstr);
14116 VALUE reg = rb_reg_compile(srcstr, (
int)regexp.option, NULL, 0);
14128 ibf_dump_write_small_value(dump,
len);
14129 for (i=0; i<
len; i++) {
14130 long index = (long)ibf_dump_object(dump,
RARRAY_AREF(obj, i));
14131 ibf_dump_write_small_value(dump, index);
14138 ibf_offset_t reading_pos = offset;
14140 const long len = (long)ibf_load_small_value(load, &reading_pos);
14142 VALUE ary = header->internal ? rb_ary_hidden_new(
len) : rb_ary_new_capa(
len);
14145 for (i=0; i<
len; i++) {
14146 const VALUE index = ibf_load_small_value(load, &reading_pos);
14147 rb_ary_push(ary, ibf_load_object(load, index));
14150 if (header->frozen) rb_ary_freeze(ary);
14156ibf_dump_object_hash_i(st_data_t key, st_data_t val, st_data_t ptr)
14160 VALUE key_index = ibf_dump_object(dump, (
VALUE)key);
14161 VALUE val_index = ibf_dump_object(dump, (
VALUE)val);
14163 ibf_dump_write_small_value(dump, key_index);
14164 ibf_dump_write_small_value(dump, val_index);
14165 return ST_CONTINUE;
14172 ibf_dump_write_small_value(dump, (
VALUE)
len);
14180 long len = (long)ibf_load_small_value(load, &offset);
14181 VALUE obj = rb_hash_new_with_size(
len);
14184 for (i = 0; i <
len; i++) {
14185 VALUE key_index = ibf_load_small_value(load, &offset);
14186 VALUE val_index = ibf_load_small_value(load, &offset);
14188 VALUE key = ibf_load_object(load, key_index);
14189 VALUE val = ibf_load_object(load, val_index);
14190 rb_hash_aset(obj, key, val);
14192 rb_hash_rehash(obj);
14208 range.class_index = 0;
14211 range.beg = (long)ibf_dump_object(dump, beg);
14212 range.end = (long)ibf_dump_object(dump, end);
14218 rb_raise(
rb_eNotImpError,
"ibf_dump_object_struct: unsupported class %"PRIsVALUE,
14227 VALUE beg = ibf_load_object(load, range->beg);
14228 VALUE end = ibf_load_object(load, range->end);
14238 ssize_t
len = BIGNUM_LEN(obj);
14239 ssize_t slen = BIGNUM_SIGN(obj) > 0 ?
len :
len * -1;
14240 BDIGIT *d = BIGNUM_DIGITS(obj);
14242 (void)IBF_W(&slen, ssize_t, 1);
14243 IBF_WP(d, BDIGIT,
len);
14250 int sign = bignum->slen > 0;
14251 ssize_t
len = sign > 0 ? bignum->slen : -1 * bignum->slen;
14252 const int big_unpack_flags =
14255 VALUE obj = rb_integer_unpack(bignum->digits,
len,
sizeof(BDIGIT), 0,
14266 if (rb_data_is_encoding(obj)) {
14268 const char *name = rb_enc_name(enc);
14269 long len = strlen(name) + 1;
14271 data[0] = IBF_OBJECT_DATA_ENCODING;
14273 (void)IBF_W(data,
long, 2);
14274 IBF_WP(name,
char,
len);
14277 ibf_dump_object_unsupported(dump, obj);
14284 const long *body = IBF_OBJBODY(
long, offset);
14285 const enum ibf_object_data_type
type = (
enum ibf_object_data_type)body[0];
14287 const char *data = (
const char *)&body[2];
14290 case IBF_OBJECT_DATA_ENCODING:
14292 VALUE encobj = rb_enc_from_encoding(rb_enc_find(data));
14297 return ibf_load_object_unsupported(load, header, offset);
14301ibf_dump_object_complex_rational(
struct ibf_dump *dump,
VALUE obj)
14304 data[0] = (long)ibf_dump_object(dump, RCOMPLEX(obj)->real);
14305 data[1] = (long)ibf_dump_object(dump, RCOMPLEX(obj)->imag);
14307 (void)IBF_W(data,
long, 2);
14311ibf_load_object_complex_rational(
const struct ibf_load *load,
const struct ibf_object_header *header, ibf_offset_t offset)
14314 VALUE a = ibf_load_object(load, nums->a);
14315 VALUE b = ibf_load_object(load, nums->b);
14327 ibf_dump_object_string(dump,
rb_sym2str(obj));
14333 ibf_offset_t reading_pos = offset;
14335 int encindex = (int)ibf_load_small_value(load, &reading_pos);
14336 const long len = (long)ibf_load_small_value(load, &reading_pos);
14337 const char *ptr = load->current_buffer->buff + reading_pos;
14339 if (encindex > RUBY_ENCINDEX_BUILTIN_MAX) {
14340 VALUE enc_name_str = ibf_load_object(load, encindex - RUBY_ENCINDEX_BUILTIN_MAX);
14341 encindex = rb_enc_find_index(RSTRING_PTR(enc_name_str));
14344 ID id = rb_intern3(ptr,
len, rb_enc_from_index(encindex));
14348typedef void (*ibf_dump_object_function)(
struct ibf_dump *dump,
VALUE obj);
14349static const ibf_dump_object_function dump_object_functions[
RUBY_T_MASK+1] = {
14350 ibf_dump_object_unsupported,
14351 ibf_dump_object_unsupported,
14352 ibf_dump_object_class,
14353 ibf_dump_object_unsupported,
14354 ibf_dump_object_float,
14355 ibf_dump_object_string,
14356 ibf_dump_object_regexp,
14357 ibf_dump_object_array,
14358 ibf_dump_object_hash,
14359 ibf_dump_object_struct,
14360 ibf_dump_object_bignum,
14361 ibf_dump_object_unsupported,
14362 ibf_dump_object_data,
14363 ibf_dump_object_unsupported,
14364 ibf_dump_object_complex_rational,
14365 ibf_dump_object_complex_rational,
14366 ibf_dump_object_unsupported,
14367 ibf_dump_object_unsupported,
14368 ibf_dump_object_unsupported,
14369 ibf_dump_object_unsupported,
14370 ibf_dump_object_symbol,
14371 ibf_dump_object_unsupported,
14372 ibf_dump_object_unsupported,
14373 ibf_dump_object_unsupported,
14374 ibf_dump_object_unsupported,
14375 ibf_dump_object_unsupported,
14376 ibf_dump_object_unsupported,
14377 ibf_dump_object_unsupported,
14378 ibf_dump_object_unsupported,
14379 ibf_dump_object_unsupported,
14380 ibf_dump_object_unsupported,
14381 ibf_dump_object_unsupported,
14387 unsigned char byte =
14388 (header.type << 0) |
14389 (header.special_const << 5) |
14390 (header.frozen << 6) |
14391 (header.internal << 7);
14397ibf_load_object_object_header(const struct
ibf_load *load, ibf_offset_t *offset)
14399 unsigned char byte = ibf_load_byte(load, offset);
14402 header.type = (
byte >> 0) & 0x1f;
14403 header.special_const = (
byte >> 5) & 0x01;
14404 header.frozen = (
byte >> 6) & 0x01;
14405 header.internal = (
byte >> 7) & 0x01;
14414 ibf_offset_t current_offset;
14415 IBF_ZERO(obj_header);
14416 obj_header.type =
TYPE(obj);
14418 IBF_W_ALIGN(ibf_offset_t);
14419 current_offset = ibf_dump_pos(dump);
14424 obj_header.special_const = TRUE;
14425 obj_header.frozen = TRUE;
14426 obj_header.internal = TRUE;
14427 ibf_dump_object_object_header(dump, obj_header);
14428 ibf_dump_write_small_value(dump, obj);
14432 obj_header.special_const = FALSE;
14434 ibf_dump_object_object_header(dump, obj_header);
14435 (*dump_object_functions[obj_header.type])(dump, obj);
14438 return current_offset;
14442static const ibf_load_object_function load_object_functions[
RUBY_T_MASK+1] = {
14443 ibf_load_object_unsupported,
14444 ibf_load_object_unsupported,
14445 ibf_load_object_class,
14446 ibf_load_object_unsupported,
14447 ibf_load_object_float,
14448 ibf_load_object_string,
14449 ibf_load_object_regexp,
14450 ibf_load_object_array,
14451 ibf_load_object_hash,
14452 ibf_load_object_struct,
14453 ibf_load_object_bignum,
14454 ibf_load_object_unsupported,
14455 ibf_load_object_data,
14456 ibf_load_object_unsupported,
14457 ibf_load_object_complex_rational,
14458 ibf_load_object_complex_rational,
14459 ibf_load_object_unsupported,
14460 ibf_load_object_unsupported,
14461 ibf_load_object_unsupported,
14462 ibf_load_object_unsupported,
14463 ibf_load_object_symbol,
14464 ibf_load_object_unsupported,
14465 ibf_load_object_unsupported,
14466 ibf_load_object_unsupported,
14467 ibf_load_object_unsupported,
14468 ibf_load_object_unsupported,
14469 ibf_load_object_unsupported,
14470 ibf_load_object_unsupported,
14471 ibf_load_object_unsupported,
14472 ibf_load_object_unsupported,
14473 ibf_load_object_unsupported,
14474 ibf_load_object_unsupported,
14478ibf_load_object(
const struct ibf_load *load,
VALUE object_index)
14480 if (object_index == 0) {
14484 VALUE obj = pinned_list_fetch(load->current_buffer->obj_list, (
long)object_index);
14486 ibf_offset_t *offsets = (ibf_offset_t *)(load->current_buffer->obj_list_offset + load->current_buffer->buff);
14487 ibf_offset_t offset = offsets[object_index];
14488 const struct ibf_object_header header = ibf_load_object_object_header(load, &offset);
14491 fprintf(stderr,
"ibf_load_object: list=%#x offsets=%p offset=%#x\n",
14492 load->current_buffer->obj_list_offset, (
void *)offsets, offset);
14493 fprintf(stderr,
"ibf_load_object: type=%#x special=%d frozen=%d internal=%d\n",
14494 header.type, header.special_const, header.frozen, header.internal);
14496 if (offset >= load->current_buffer->size) {
14497 rb_raise(
rb_eIndexError,
"object offset out of range: %u", offset);
14500 if (header.special_const) {
14501 ibf_offset_t reading_pos = offset;
14503 obj = ibf_load_small_value(load, &reading_pos);
14506 obj = (*load_object_functions[header.type])(load, &header, offset);
14509 pinned_list_store(load->current_buffer->obj_list, (
long)object_index, obj);
14512 fprintf(stderr,
"ibf_load_object: index=%#"PRIxVALUE
" obj=%#"PRIxVALUE
"\n",
14513 object_index, obj);
14526ibf_dump_object_list_i(st_data_t key, st_data_t val, st_data_t ptr)
14531 ibf_offset_t offset = ibf_dump_object_object(args->dump, obj);
14532 rb_ary_push(args->offset_list,
UINT2NUM(offset));
14534 return ST_CONTINUE;
14538ibf_dump_object_list(
struct ibf_dump *dump, ibf_offset_t *obj_list_offset,
unsigned int *obj_list_size)
14540 st_table *obj_table = dump->current_buffer->obj_table;
14541 VALUE offset_list = rb_ary_hidden_new(obj_table->num_entries);
14545 args.offset_list = offset_list;
14547 st_foreach(obj_table, ibf_dump_object_list_i, (st_data_t)&args);
14549 IBF_W_ALIGN(ibf_offset_t);
14550 *obj_list_offset = ibf_dump_pos(dump);
14552 st_index_t size = obj_table->num_entries;
14555 for (i=0; i<size; i++) {
14560 *obj_list_size = (
unsigned int)size;
14564ibf_dump_mark(
void *ptr)
14567 rb_gc_mark(dump->global_buffer.str);
14569 rb_mark_set(dump->global_buffer.obj_table);
14570 rb_mark_set(dump->iseq_table);
14574ibf_dump_free(
void *ptr)
14577 if (dump->global_buffer.obj_table) {
14578 st_free_table(dump->global_buffer.obj_table);
14579 dump->global_buffer.obj_table = 0;
14581 if (dump->iseq_table) {
14582 st_free_table(dump->iseq_table);
14583 dump->iseq_table = 0;
14588ibf_dump_memsize(
const void *ptr)
14592 if (dump->iseq_table) size += st_memsize(dump->iseq_table);
14593 if (dump->global_buffer.obj_table) size += st_memsize(dump->global_buffer.obj_table);
14599 {ibf_dump_mark, ibf_dump_free, ibf_dump_memsize,},
14600 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_EMBEDDABLE
14606 dump->global_buffer.obj_table = NULL;
14607 dump->iseq_table = NULL;
14610 dump->global_buffer.obj_table = ibf_dump_object_table_new();
14611 dump->iseq_table = st_init_numtable();
14613 dump->current_buffer = &dump->global_buffer;
14624 if (ISEQ_BODY(iseq)->parent_iseq != NULL ||
14625 ISEQ_BODY(iseq)->local_iseq != iseq) {
14628 if (
RTEST(ISEQ_COVERAGE(iseq))) {
14633 ibf_dump_setup(dump, dump_obj);
14635 ibf_dump_write(dump, &header,
sizeof(header));
14636 ibf_dump_iseq(dump, iseq);
14638 header.magic[0] =
'Y';
14639 header.magic[1] =
'A';
14640 header.magic[2] =
'R';
14641 header.magic[3] =
'B';
14642 header.major_version = IBF_MAJOR_VERSION;
14643 header.minor_version = IBF_MINOR_VERSION;
14644 header.endian = IBF_ENDIAN_MARK;
14646 ibf_dump_iseq_list(dump, &header);
14647 ibf_dump_object_list(dump, &header.global_object_list_offset, &header.global_object_list_size);
14648 header.size = ibf_dump_pos(dump);
14651 VALUE opt_str = opt;
14654 ibf_dump_write(dump, ptr, header.extra_size);
14657 header.extra_size = 0;
14660 ibf_dump_overwrite(dump, &header,
sizeof(header), 0);
14662 str = dump->global_buffer.str;
14667static const ibf_offset_t *
14668ibf_iseq_list(
const struct ibf_load *load)
14670 return (
const ibf_offset_t *)(load->global_buffer.buff + load->header->iseq_list_offset);
14674rb_ibf_load_iseq_complete(
rb_iseq_t *iseq)
14678 ibf_offset_t offset = ibf_iseq_list(load)[iseq->aux.loader.index];
14681 fprintf(stderr,
"rb_ibf_load_iseq_complete: index=%#x offset=%#x size=%#x\n",
14682 iseq->aux.loader.index, offset,
14683 load->header->size);
14685 ibf_load_iseq_each(load, iseq, offset);
14686 ISEQ_COMPILE_DATA_CLEAR(iseq);
14688 rb_iseq_init_trace(iseq);
14689 load->iseq = prev_src_iseq;
14696 rb_ibf_load_iseq_complete((
rb_iseq_t *)iseq);
14704 int iseq_index = (int)(
VALUE)index_iseq;
14707 fprintf(stderr,
"ibf_load_iseq: index_iseq=%p iseq_list=%p\n",
14708 (
void *)index_iseq, (
void *)load->iseq_list);
14710 if (iseq_index == -1) {
14714 VALUE iseqv = pinned_list_fetch(load->iseq_list, iseq_index);
14717 fprintf(stderr,
"ibf_load_iseq: iseqv=%p\n", (
void *)iseqv);
14725 fprintf(stderr,
"ibf_load_iseq: new iseq=%p\n", (
void *)iseq);
14728 iseq->aux.loader.obj = load->loader_obj;
14729 iseq->aux.loader.index = iseq_index;
14731 fprintf(stderr,
"ibf_load_iseq: iseq=%p loader_obj=%p index=%d\n",
14732 (
void *)iseq, (
void *)load->loader_obj, iseq_index);
14734 pinned_list_store(load->iseq_list, iseq_index, (
VALUE)iseq);
14736 if (!USE_LAZY_LOAD || GET_VM()->builtin_function_table) {
14738 fprintf(stderr,
"ibf_load_iseq: loading iseq=%p\n", (
void *)iseq);
14740 rb_ibf_load_iseq_complete(iseq);
14744 fprintf(stderr,
"ibf_load_iseq: iseq=%p loaded %p\n",
14745 (
void *)iseq, (
void *)load->iseq);
14753ibf_load_setup_bytes(
struct ibf_load *load,
VALUE loader_obj,
const char *bytes,
size_t size)
14756 load->loader_obj = loader_obj;
14757 load->global_buffer.buff = bytes;
14758 load->header = header;
14759 load->global_buffer.size = header->size;
14760 load->global_buffer.obj_list_offset = header->global_object_list_offset;
14761 load->global_buffer.obj_list_size = header->global_object_list_size;
14762 RB_OBJ_WRITE(loader_obj, &load->iseq_list, pinned_list_new(header->iseq_list_size));
14763 RB_OBJ_WRITE(loader_obj, &load->global_buffer.obj_list, pinned_list_new(load->global_buffer.obj_list_size));
14766 load->current_buffer = &load->global_buffer;
14768 if (size < header->size) {
14771 if (strncmp(header->magic,
"YARB", 4) != 0) {
14774 if (header->major_version != IBF_MAJOR_VERSION ||
14775 header->minor_version != IBF_MINOR_VERSION) {
14777 header->major_version, header->minor_version, IBF_MAJOR_VERSION, IBF_MINOR_VERSION);
14779 if (header->endian != IBF_ENDIAN_MARK) {
14785 if (header->iseq_list_offset %
RUBY_ALIGNOF(ibf_offset_t)) {
14786 rb_raise(rb_eArgError,
"unaligned iseq list offset: %u",
14787 header->iseq_list_offset);
14789 if (load->global_buffer.obj_list_offset %
RUBY_ALIGNOF(ibf_offset_t)) {
14790 rb_raise(rb_eArgError,
"unaligned object list offset: %u",
14791 load->global_buffer.obj_list_offset);
14804 if (USE_LAZY_LOAD) {
14805 str =
rb_str_new(RSTRING_PTR(str), RSTRING_LEN(str));
14808 ibf_load_setup_bytes(load, loader_obj, RSTRING_PTR(str), RSTRING_LEN(str));
14813ibf_loader_mark(
void *ptr)
14816 rb_gc_mark(load->str);
14817 rb_gc_mark(load->iseq_list);
14818 rb_gc_mark(load->global_buffer.obj_list);
14822ibf_loader_free(
void *ptr)
14829ibf_loader_memsize(
const void *ptr)
14836 {ibf_loader_mark, ibf_loader_free, ibf_loader_memsize,},
14837 0, 0, RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
14841rb_iseq_ibf_load(
VALUE str)
14847 ibf_load_setup(load, loader_obj, str);
14848 iseq = ibf_load_iseq(load, 0);
14855rb_iseq_ibf_load_bytes(
const char *bytes,
size_t size)
14861 ibf_load_setup_bytes(load, loader_obj, bytes, size);
14862 iseq = ibf_load_iseq(load, 0);
14869rb_iseq_ibf_load_extra_data(
VALUE str)
14875 ibf_load_setup(load, loader_obj, str);
14876 extra_str =
rb_str_new(load->global_buffer.buff + load->header->size, load->header->extra_size);
14881#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 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 FL_TEST
Old name of RB_FL_TEST.
#define FL_FREEZE
Old name of RUBY_FL_FREEZE.
#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.
#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::@155 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.