mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
483ef372b1
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@27780 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
1708 lines
38 KiB
C
1708 lines
38 KiB
C
/**********************************************************************
|
|
|
|
vm_insnhelper.c - instruction helper functions.
|
|
|
|
$Author$
|
|
|
|
Copyright (C) 2007 Koichi Sasada
|
|
|
|
**********************************************************************/
|
|
|
|
/* finish iseq array */
|
|
#include "insns.inc"
|
|
#include <math.h>
|
|
|
|
/* control stack frame */
|
|
|
|
#ifndef INLINE
|
|
#define INLINE inline
|
|
#endif
|
|
|
|
static rb_control_frame_t *vm_get_ruby_level_caller_cfp(rb_thread_t *th, rb_control_frame_t *cfp);
|
|
|
|
static inline rb_control_frame_t *
|
|
vm_push_frame(rb_thread_t * th, const rb_iseq_t * iseq,
|
|
VALUE type, VALUE self, VALUE specval,
|
|
const VALUE *pc, VALUE *sp, VALUE *lfp,
|
|
int local_size)
|
|
{
|
|
rb_control_frame_t * const cfp = th->cfp - 1;
|
|
int i;
|
|
|
|
if ((void *)(sp + local_size) >= (void *)cfp) {
|
|
rb_exc_raise(sysstack_error);
|
|
}
|
|
th->cfp = cfp;
|
|
/* setup vm value stack */
|
|
|
|
/* nil initialize */
|
|
for (i=0; i < local_size; i++) {
|
|
*sp = Qnil;
|
|
sp++;
|
|
}
|
|
|
|
/* set special val */
|
|
*sp = GC_GUARDED_PTR(specval);
|
|
|
|
if (lfp == 0) {
|
|
lfp = sp;
|
|
}
|
|
|
|
/* setup vm control frame stack */
|
|
|
|
cfp->pc = (VALUE *)pc;
|
|
cfp->sp = sp + 1;
|
|
cfp->bp = sp + 1;
|
|
cfp->iseq = (rb_iseq_t *) iseq;
|
|
cfp->flag = type;
|
|
cfp->self = self;
|
|
cfp->lfp = lfp;
|
|
cfp->dfp = sp;
|
|
cfp->proc = 0;
|
|
cfp->me = 0;
|
|
|
|
#define COLLECT_PROFILE 0
|
|
#if COLLECT_PROFILE
|
|
cfp->prof_time_self = clock();
|
|
cfp->prof_time_chld = 0;
|
|
#endif
|
|
|
|
if (VMDEBUG == 2) {
|
|
SDR();
|
|
}
|
|
|
|
return cfp;
|
|
}
|
|
|
|
static inline void
|
|
vm_pop_frame(rb_thread_t *th)
|
|
{
|
|
#if COLLECT_PROFILE
|
|
rb_control_frame_t *cfp = th->cfp;
|
|
|
|
if (RUBY_VM_NORMAL_ISEQ_P(cfp->iseq)) {
|
|
VALUE current_time = clock();
|
|
rb_control_frame_t *cfp = th->cfp;
|
|
cfp->prof_time_self = current_time - cfp->prof_time_self;
|
|
(cfp+1)->prof_time_chld += cfp->prof_time_self;
|
|
|
|
cfp->iseq->profile.count++;
|
|
cfp->iseq->profile.time_cumu = cfp->prof_time_self;
|
|
cfp->iseq->profile.time_self = cfp->prof_time_self - cfp->prof_time_chld;
|
|
}
|
|
else if (0 /* c method? */) {
|
|
|
|
}
|
|
#endif
|
|
th->cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(th->cfp);
|
|
|
|
if (VMDEBUG == 2) {
|
|
SDR();
|
|
}
|
|
}
|
|
|
|
/* method dispatch */
|
|
|
|
NORETURN(static void argument_error(const rb_iseq_t *iseq, int miss_argc, int correct_argc));
|
|
static void
|
|
argument_error(const rb_iseq_t *iseq, int miss_argc, int correct_argc)
|
|
{
|
|
VALUE mesg = rb_sprintf("wrong number of arguments (%d for %d)", miss_argc, correct_argc);
|
|
VALUE exc = rb_exc_new3(rb_eArgError, mesg);
|
|
VALUE bt = rb_make_backtrace();
|
|
VALUE err_line = 0;
|
|
|
|
if (iseq) {
|
|
int line_no = 1;
|
|
|
|
if (iseq->insn_info_size) {
|
|
line_no = iseq->insn_info_table[0].line_no;
|
|
}
|
|
|
|
err_line = rb_sprintf("%s:%d:in `%s'",
|
|
RSTRING_PTR(iseq->filename),
|
|
line_no, RSTRING_PTR(iseq->name));
|
|
rb_funcall(bt, rb_intern("unshift"), 1, err_line);
|
|
}
|
|
|
|
rb_funcall(exc, rb_intern("set_backtrace"), 1, bt);
|
|
rb_exc_raise(exc);
|
|
}
|
|
|
|
#define VM_CALLEE_SETUP_ARG(ret, th, iseq, orig_argc, orig_argv, block) \
|
|
if (LIKELY(iseq->arg_simple & 0x01)) { \
|
|
/* simple check */ \
|
|
if (orig_argc != iseq->argc) { \
|
|
argument_error(iseq, orig_argc, iseq->argc); \
|
|
} \
|
|
ret = 0; \
|
|
} \
|
|
else { \
|
|
ret = vm_callee_setup_arg_complex(th, iseq, orig_argc, orig_argv, block); \
|
|
}
|
|
|
|
static inline int
|
|
vm_callee_setup_arg_complex(rb_thread_t *th, const rb_iseq_t * iseq,
|
|
int orig_argc, VALUE * orig_argv,
|
|
const rb_block_t **block)
|
|
{
|
|
const int m = iseq->argc;
|
|
int argc = orig_argc;
|
|
VALUE *argv = orig_argv;
|
|
rb_num_t opt_pc = 0;
|
|
|
|
th->mark_stack_len = argc + iseq->arg_size;
|
|
|
|
/* mandatory */
|
|
if (argc < (m + iseq->arg_post_len)) { /* check with post arg */
|
|
argument_error(iseq, argc, m + iseq->arg_post_len);
|
|
}
|
|
|
|
argv += m;
|
|
argc -= m;
|
|
|
|
/* post arguments */
|
|
if (iseq->arg_post_len) {
|
|
if (!(orig_argc < iseq->arg_post_start)) {
|
|
VALUE *new_argv = ALLOCA_N(VALUE, argc);
|
|
MEMCPY(new_argv, argv, VALUE, argc);
|
|
argv = new_argv;
|
|
}
|
|
|
|
MEMCPY(&orig_argv[iseq->arg_post_start], &argv[argc -= iseq->arg_post_len],
|
|
VALUE, iseq->arg_post_len);
|
|
}
|
|
|
|
/* opt arguments */
|
|
if (iseq->arg_opts) {
|
|
const int opts = iseq->arg_opts - 1 /* no opt */;
|
|
|
|
if (iseq->arg_rest == -1 && argc > opts) {
|
|
argument_error(iseq, orig_argc, m + opts + iseq->arg_post_len);
|
|
}
|
|
|
|
if (argc > opts) {
|
|
argc -= opts;
|
|
argv += opts;
|
|
opt_pc = iseq->arg_opt_table[opts]; /* no opt */
|
|
}
|
|
else {
|
|
int i;
|
|
for (i = argc; i<opts; i++) {
|
|
orig_argv[i + m] = Qnil;
|
|
}
|
|
opt_pc = iseq->arg_opt_table[argc];
|
|
argc = 0;
|
|
}
|
|
}
|
|
|
|
/* rest arguments */
|
|
if (iseq->arg_rest != -1) {
|
|
orig_argv[iseq->arg_rest] = rb_ary_new4(argc, argv);
|
|
argc = 0;
|
|
}
|
|
|
|
/* block arguments */
|
|
if (block && iseq->arg_block != -1) {
|
|
VALUE blockval = Qnil;
|
|
const rb_block_t *blockptr = *block;
|
|
|
|
if (argc != 0) {
|
|
argument_error(iseq, orig_argc, m + iseq->arg_post_len);
|
|
}
|
|
|
|
if (blockptr) {
|
|
/* make Proc object */
|
|
if (blockptr->proc == 0) {
|
|
rb_proc_t *proc;
|
|
blockval = rb_vm_make_proc(th, blockptr, rb_cProc);
|
|
GetProcPtr(blockval, proc);
|
|
*block = &proc->block;
|
|
}
|
|
else {
|
|
blockval = blockptr->proc;
|
|
}
|
|
}
|
|
|
|
orig_argv[iseq->arg_block] = blockval; /* Proc or nil */
|
|
}
|
|
|
|
th->mark_stack_len = 0;
|
|
return (int)opt_pc;
|
|
}
|
|
|
|
static inline int
|
|
caller_setup_args(const rb_thread_t *th, rb_control_frame_t *cfp, VALUE flag,
|
|
int argc, rb_iseq_t *blockiseq, rb_block_t **block)
|
|
{
|
|
rb_block_t *blockptr = 0;
|
|
|
|
if (block) {
|
|
if (flag & VM_CALL_ARGS_BLOCKARG_BIT) {
|
|
rb_proc_t *po;
|
|
VALUE proc;
|
|
|
|
proc = *(--cfp->sp);
|
|
|
|
if (proc != Qnil) {
|
|
if (!rb_obj_is_proc(proc)) {
|
|
VALUE b = rb_check_convert_type(proc, T_DATA, "Proc", "to_proc");
|
|
if (NIL_P(b) || !rb_obj_is_proc(b)) {
|
|
rb_raise(rb_eTypeError,
|
|
"wrong argument type %s (expected Proc)",
|
|
rb_obj_classname(proc));
|
|
}
|
|
proc = b;
|
|
}
|
|
GetProcPtr(proc, po);
|
|
blockptr = &po->block;
|
|
RUBY_VM_GET_BLOCK_PTR_IN_CFP(cfp)->proc = proc;
|
|
*block = blockptr;
|
|
}
|
|
}
|
|
else if (blockiseq) {
|
|
blockptr = RUBY_VM_GET_BLOCK_PTR_IN_CFP(cfp);
|
|
blockptr->iseq = blockiseq;
|
|
blockptr->proc = 0;
|
|
*block = blockptr;
|
|
}
|
|
}
|
|
|
|
/* expand top of stack? */
|
|
if (flag & VM_CALL_ARGS_SPLAT_BIT) {
|
|
VALUE ary = *(cfp->sp - 1);
|
|
VALUE *ptr;
|
|
int i;
|
|
VALUE tmp = rb_check_convert_type(ary, T_ARRAY, "Array", "to_a");
|
|
|
|
if (NIL_P(tmp)) {
|
|
/* do nothing */
|
|
}
|
|
else {
|
|
long len = RARRAY_LEN(tmp);
|
|
ptr = RARRAY_PTR(tmp);
|
|
cfp->sp -= 1;
|
|
|
|
CHECK_STACK_OVERFLOW(cfp, len);
|
|
|
|
for (i = 0; i < len; i++) {
|
|
*cfp->sp++ = ptr[i];
|
|
}
|
|
argc += i-1;
|
|
}
|
|
}
|
|
|
|
return argc;
|
|
}
|
|
|
|
static inline VALUE
|
|
call_cfunc(VALUE (*func)(), VALUE recv,
|
|
int len, int argc, const VALUE *argv)
|
|
{
|
|
/* printf("len: %d, argc: %d\n", len, argc); */
|
|
|
|
if (len >= 0 && argc != len) {
|
|
rb_raise(rb_eArgError, "wrong number of arguments(%d for %d)",
|
|
argc, len);
|
|
}
|
|
|
|
switch (len) {
|
|
case -2:
|
|
return (*func) (recv, rb_ary_new4(argc, argv));
|
|
break;
|
|
case -1:
|
|
return (*func) (argc, argv, recv);
|
|
break;
|
|
case 0:
|
|
return (*func) (recv);
|
|
break;
|
|
case 1:
|
|
return (*func) (recv, argv[0]);
|
|
break;
|
|
case 2:
|
|
return (*func) (recv, argv[0], argv[1]);
|
|
break;
|
|
case 3:
|
|
return (*func) (recv, argv[0], argv[1], argv[2]);
|
|
break;
|
|
case 4:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3]);
|
|
break;
|
|
case 5:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4]);
|
|
break;
|
|
case 6:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5]);
|
|
break;
|
|
case 7:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6]);
|
|
break;
|
|
case 8:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7]);
|
|
break;
|
|
case 9:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8]);
|
|
break;
|
|
case 10:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9]);
|
|
break;
|
|
case 11:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9],
|
|
argv[10]);
|
|
break;
|
|
case 12:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9],
|
|
argv[10], argv[11]);
|
|
break;
|
|
case 13:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9], argv[10],
|
|
argv[11], argv[12]);
|
|
break;
|
|
case 14:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9], argv[10],
|
|
argv[11], argv[12], argv[13]);
|
|
break;
|
|
case 15:
|
|
return (*func) (recv, argv[0], argv[1], argv[2], argv[3], argv[4],
|
|
argv[5], argv[6], argv[7], argv[8], argv[9], argv[10],
|
|
argv[11], argv[12], argv[13], argv[14]);
|
|
break;
|
|
default:
|
|
rb_raise(rb_eArgError, "too many arguments(%d)", len);
|
|
return Qundef; /* not reached */
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_call_cfunc(rb_thread_t *th, rb_control_frame_t *reg_cfp,
|
|
int num, VALUE recv, const rb_block_t *blockptr,
|
|
const rb_method_entry_t *me)
|
|
{
|
|
VALUE val = 0;
|
|
const rb_method_definition_t *def = me->def;
|
|
rb_control_frame_t *cfp;
|
|
|
|
EXEC_EVENT_HOOK(th, RUBY_EVENT_C_CALL, recv, me->called_id, me->klass);
|
|
|
|
cfp = vm_push_frame(th, 0, VM_FRAME_MAGIC_CFUNC,
|
|
recv, (VALUE) blockptr, 0, reg_cfp->sp, 0, 1);
|
|
cfp->me = me;
|
|
reg_cfp->sp -= num + 1;
|
|
|
|
val = call_cfunc(def->body.cfunc.func, recv, (int)def->body.cfunc.argc, num, reg_cfp->sp + 1);
|
|
|
|
if (reg_cfp != th->cfp + 1) {
|
|
rb_bug("cfp consistency error - send");
|
|
}
|
|
|
|
vm_pop_frame(th);
|
|
|
|
EXEC_EVENT_HOOK(th, RUBY_EVENT_C_RETURN, recv, me->called_id, me->klass);
|
|
|
|
return val;
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_call_bmethod(rb_thread_t *th, VALUE recv, int argc, const VALUE *argv,
|
|
const rb_block_t *blockptr, const rb_method_entry_t *me)
|
|
{
|
|
rb_proc_t *proc;
|
|
VALUE val;
|
|
|
|
/* control block frame */
|
|
th->passed_me = me;
|
|
|
|
GetProcPtr(me->def->body.proc, proc);
|
|
val = rb_vm_invoke_proc(th, proc, recv, argc, argv, blockptr);
|
|
return val;
|
|
}
|
|
|
|
static inline void
|
|
vm_method_missing_args(rb_thread_t *th, VALUE *argv,
|
|
int num, const rb_block_t *blockptr, int opt)
|
|
{
|
|
rb_control_frame_t * const reg_cfp = th->cfp;
|
|
MEMCPY(argv, STACK_ADDR_FROM_TOP(num + 1), VALUE, num + 1);
|
|
th->method_missing_reason = opt;
|
|
th->passed_block = blockptr;
|
|
POPN(num + 1);
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_method_missing(rb_thread_t *th, ID id, VALUE recv,
|
|
int num, const rb_block_t *blockptr, int opt)
|
|
{
|
|
VALUE *argv = ALLOCA_N(VALUE, num + 1);
|
|
vm_method_missing_args(th, argv, num, blockptr, opt);
|
|
argv[0] = ID2SYM(id);
|
|
return rb_funcall2(recv, idMethodMissing, num + 1, argv);
|
|
}
|
|
|
|
static inline void
|
|
vm_setup_method(rb_thread_t *th, rb_control_frame_t *cfp,
|
|
VALUE recv, int argc, const rb_block_t *blockptr, VALUE flag,
|
|
const rb_method_entry_t *me)
|
|
{
|
|
int opt_pc, i;
|
|
VALUE *sp, *rsp = cfp->sp - argc;
|
|
rb_iseq_t *iseq = me->def->body.iseq;
|
|
|
|
VM_CALLEE_SETUP_ARG(opt_pc, th, iseq, argc, rsp, &blockptr);
|
|
|
|
/* stack overflow check */
|
|
CHECK_STACK_OVERFLOW(cfp, iseq->stack_max);
|
|
|
|
sp = rsp + iseq->arg_size;
|
|
|
|
if (LIKELY(!(flag & VM_CALL_TAILCALL_BIT))) {
|
|
if (0) printf("local_size: %d, arg_size: %d\n",
|
|
iseq->local_size, iseq->arg_size);
|
|
|
|
/* clear local variables */
|
|
for (i = 0; i < iseq->local_size - iseq->arg_size; i++) {
|
|
*sp++ = Qnil;
|
|
}
|
|
|
|
vm_push_frame(th, iseq,
|
|
VM_FRAME_MAGIC_METHOD, recv, (VALUE) blockptr,
|
|
iseq->iseq_encoded + opt_pc, sp, 0, 0);
|
|
|
|
cfp->sp = rsp - 1 /* recv */;
|
|
}
|
|
else {
|
|
VALUE *p_rsp;
|
|
th->cfp++; /* pop cf */
|
|
p_rsp = th->cfp->sp;
|
|
|
|
/* copy arguments */
|
|
for (i=0; i < (sp - rsp); i++) {
|
|
p_rsp[i] = rsp[i];
|
|
}
|
|
|
|
sp -= rsp - p_rsp;
|
|
|
|
/* clear local variables */
|
|
for (i = 0; i < iseq->local_size - iseq->arg_size; i++) {
|
|
*sp++ = Qnil;
|
|
}
|
|
|
|
vm_push_frame(th, iseq,
|
|
VM_FRAME_MAGIC_METHOD, recv, (VALUE) blockptr,
|
|
iseq->iseq_encoded + opt_pc, sp, 0, 0);
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_call_method(rb_thread_t *th, rb_control_frame_t *cfp,
|
|
int num, const rb_block_t *blockptr, VALUE flag,
|
|
ID id, const rb_method_entry_t *me, VALUE recv)
|
|
{
|
|
VALUE val;
|
|
|
|
start_method_dispatch:
|
|
|
|
if (me != 0) {
|
|
if ((me->flag == 0)) {
|
|
normal_method_dispatch:
|
|
switch (me->def->type) {
|
|
case VM_METHOD_TYPE_ISEQ:{
|
|
vm_setup_method(th, cfp, recv, num, blockptr, flag, me);
|
|
return Qundef;
|
|
}
|
|
case VM_METHOD_TYPE_NOTIMPLEMENTED:
|
|
case VM_METHOD_TYPE_CFUNC:{
|
|
val = vm_call_cfunc(th, cfp, num, recv, blockptr, me);
|
|
break;
|
|
}
|
|
case VM_METHOD_TYPE_ATTRSET:{
|
|
if (num != 1) {
|
|
rb_raise(rb_eArgError, "wrong number of arguments (%d for 1)", num);
|
|
}
|
|
val = rb_ivar_set(recv, me->def->body.attr.id, *(cfp->sp - 1));
|
|
cfp->sp -= 2;
|
|
break;
|
|
}
|
|
case VM_METHOD_TYPE_IVAR:{
|
|
if (num != 0) {
|
|
rb_raise(rb_eArgError, "wrong number of arguments (%d for 0)", num);
|
|
}
|
|
val = rb_attr_get(recv, me->def->body.attr.id);
|
|
cfp->sp -= 1;
|
|
break;
|
|
}
|
|
case VM_METHOD_TYPE_MISSING:{
|
|
VALUE *argv = ALLOCA_N(VALUE, num+1);
|
|
argv[0] = ID2SYM(me->def->original_id);
|
|
MEMCPY(argv+1, cfp->sp - num, VALUE, num);
|
|
cfp->sp += - num - 1;
|
|
val = rb_funcall2(recv, rb_intern("method_missing"), num+1, argv);
|
|
break;
|
|
}
|
|
case VM_METHOD_TYPE_BMETHOD:{
|
|
VALUE *argv = ALLOCA_N(VALUE, num);
|
|
MEMCPY(argv, cfp->sp - num, VALUE, num);
|
|
cfp->sp += - num - 1;
|
|
val = vm_call_bmethod(th, recv, num, argv, blockptr, me);
|
|
break;
|
|
}
|
|
case VM_METHOD_TYPE_ZSUPER:{
|
|
VALUE klass = RCLASS_SUPER(me->klass);
|
|
me = rb_method_entry(klass, id);
|
|
|
|
if (me != 0) {
|
|
goto normal_method_dispatch;
|
|
}
|
|
else {
|
|
goto start_method_dispatch;
|
|
}
|
|
}
|
|
case VM_METHOD_TYPE_OPTIMIZED:{
|
|
switch (me->def->body.optimize_type) {
|
|
case OPTIMIZED_METHOD_TYPE_SEND: {
|
|
rb_control_frame_t *reg_cfp = cfp;
|
|
rb_num_t i = num - 1;
|
|
VALUE sym;
|
|
|
|
if (num == 0) {
|
|
rb_raise(rb_eArgError, "no method name given");
|
|
}
|
|
|
|
sym = TOPN(i);
|
|
id = SYMBOL_P(sym) ? SYM2ID(sym) : rb_to_id(sym);
|
|
/* shift arguments */
|
|
if (i > 0) {
|
|
MEMMOVE(&TOPN(i), &TOPN(i-1), VALUE, i);
|
|
}
|
|
me = rb_method_entry(CLASS_OF(recv), id);
|
|
num -= 1;
|
|
DEC_SP(1);
|
|
flag |= VM_CALL_FCALL_BIT | VM_CALL_OPT_SEND_BIT;
|
|
|
|
goto start_method_dispatch;
|
|
}
|
|
case OPTIMIZED_METHOD_TYPE_CALL: {
|
|
rb_proc_t *proc;
|
|
int argc = num;
|
|
VALUE *argv = ALLOCA_N(VALUE, num);
|
|
GetProcPtr(recv, proc);
|
|
MEMCPY(argv, cfp->sp - num, VALUE, num);
|
|
cfp->sp -= num + 1;
|
|
|
|
val = rb_vm_invoke_proc(th, proc, proc->block.self, argc, argv, blockptr);
|
|
break;
|
|
}
|
|
default:
|
|
rb_bug("eval_invoke_method: unsupported optimized method type (%d)",
|
|
me->def->body.optimize_type);
|
|
}
|
|
break;
|
|
}
|
|
default:{
|
|
rb_bug("eval_invoke_method: unsupported method type (%d)", me->def->type);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
int noex_safe;
|
|
|
|
if (!(flag & VM_CALL_FCALL_BIT) &&
|
|
(me->flag & NOEX_MASK) & NOEX_PRIVATE) {
|
|
int stat = NOEX_PRIVATE;
|
|
|
|
if (flag & VM_CALL_VCALL_BIT) {
|
|
stat |= NOEX_VCALL;
|
|
}
|
|
val = vm_method_missing(th, id, recv, num, blockptr, stat);
|
|
}
|
|
else if (!(flag & VM_CALL_OPT_SEND_BIT) && (me->flag & NOEX_MASK) & NOEX_PROTECTED) {
|
|
VALUE defined_class = me->klass;
|
|
|
|
if (TYPE(defined_class) == T_ICLASS) {
|
|
defined_class = RBASIC(defined_class)->klass;
|
|
}
|
|
|
|
if (!rb_obj_is_kind_of(cfp->self, defined_class)) {
|
|
val = vm_method_missing(th, id, recv, num, blockptr, NOEX_PROTECTED);
|
|
}
|
|
else {
|
|
goto normal_method_dispatch;
|
|
}
|
|
}
|
|
else if ((noex_safe = NOEX_SAFE(me->flag)) > th->safe_level &&
|
|
(noex_safe > 2)) {
|
|
rb_raise(rb_eSecurityError, "calling insecure method: %s", rb_id2name(id));
|
|
}
|
|
else {
|
|
goto normal_method_dispatch;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
/* method missing */
|
|
int stat = 0;
|
|
if (flag & VM_CALL_VCALL_BIT) {
|
|
stat |= NOEX_VCALL;
|
|
}
|
|
if (flag & VM_CALL_SUPER_BIT) {
|
|
stat |= NOEX_SUPER;
|
|
}
|
|
if (id == idMethodMissing) {
|
|
VALUE *argv = ALLOCA_N(VALUE, num);
|
|
vm_method_missing_args(th, argv, num - 1, 0, stat);
|
|
rb_raise_method_missing(th, num, argv, recv, stat);
|
|
}
|
|
else {
|
|
val = vm_method_missing(th, id, recv, num, blockptr, stat);
|
|
}
|
|
}
|
|
|
|
RUBY_VM_CHECK_INTS();
|
|
return val;
|
|
}
|
|
|
|
/* yield */
|
|
|
|
static inline int
|
|
block_proc_is_lambda(const VALUE procval)
|
|
{
|
|
rb_proc_t *proc;
|
|
|
|
if (procval) {
|
|
GetProcPtr(procval, proc);
|
|
return proc->is_lambda;
|
|
}
|
|
else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_yield_with_cfunc(rb_thread_t *th, const rb_block_t *block,
|
|
VALUE self, int argc, const VALUE *argv,
|
|
const rb_block_t *blockargptr)
|
|
{
|
|
NODE *ifunc = (NODE *) block->iseq;
|
|
VALUE val, arg, blockarg;
|
|
int lambda = block_proc_is_lambda(block->proc);
|
|
|
|
if (lambda) {
|
|
arg = rb_ary_new4(argc, argv);
|
|
}
|
|
else if (argc == 0) {
|
|
arg = Qnil;
|
|
}
|
|
else {
|
|
arg = argv[0];
|
|
}
|
|
|
|
if (blockargptr) {
|
|
if (blockargptr->proc) {
|
|
blockarg = blockargptr->proc;
|
|
}
|
|
else {
|
|
blockarg = rb_vm_make_proc(th, blockargptr, rb_cProc);
|
|
}
|
|
}
|
|
else {
|
|
blockarg = Qnil;
|
|
}
|
|
|
|
vm_push_frame(th, 0, VM_FRAME_MAGIC_IFUNC,
|
|
self, (VALUE)block->dfp,
|
|
0, th->cfp->sp, block->lfp, 1);
|
|
|
|
val = (*ifunc->nd_cfnc) (arg, ifunc->nd_tval, argc, argv, blockarg);
|
|
|
|
th->cfp++;
|
|
return val;
|
|
}
|
|
|
|
|
|
/*--
|
|
* @brief on supplied all of optional, rest and post parameters.
|
|
* @pre iseq is block style (not lambda style)
|
|
*/
|
|
static inline int
|
|
vm_yield_setup_block_args_complex(rb_thread_t *th, const rb_iseq_t *iseq,
|
|
int argc, VALUE *argv)
|
|
{
|
|
rb_num_t opt_pc = 0;
|
|
int i;
|
|
const int m = iseq->argc;
|
|
const int r = iseq->arg_rest;
|
|
int len = iseq->arg_post_len;
|
|
int start = iseq->arg_post_start;
|
|
int rsize = argc > m ? argc - m : 0; /* # of arguments which did not consumed yet */
|
|
int psize = rsize > len ? len : rsize; /* # of post arguments */
|
|
int osize = 0; /* # of opt arguments */
|
|
VALUE ary;
|
|
|
|
/* reserves arguments for post parameters */
|
|
rsize -= psize;
|
|
|
|
if (iseq->arg_opts) {
|
|
const int opts = iseq->arg_opts - 1;
|
|
if (rsize > opts) {
|
|
osize = opts;
|
|
opt_pc = iseq->arg_opt_table[opts];
|
|
}
|
|
else {
|
|
osize = rsize;
|
|
opt_pc = iseq->arg_opt_table[rsize];
|
|
}
|
|
}
|
|
rsize -= osize;
|
|
|
|
if (0) {
|
|
printf(" argc: %d\n", argc);
|
|
printf(" len: %d\n", len);
|
|
printf("start: %d\n", start);
|
|
printf("rsize: %d\n", rsize);
|
|
}
|
|
|
|
if (r == -1) {
|
|
/* copy post argument */
|
|
MEMMOVE(&argv[start], &argv[m+osize], VALUE, psize);
|
|
}
|
|
else {
|
|
ary = rb_ary_new4(rsize, &argv[r]);
|
|
|
|
/* copy post argument */
|
|
MEMMOVE(&argv[start], &argv[m+rsize+osize], VALUE, psize);
|
|
argv[r] = ary;
|
|
}
|
|
|
|
for (i=psize; i<len; i++) {
|
|
argv[start + i] = Qnil;
|
|
}
|
|
|
|
return (int)opt_pc;
|
|
}
|
|
|
|
static inline int
|
|
vm_yield_setup_block_args(rb_thread_t *th, const rb_iseq_t * iseq,
|
|
int orig_argc, VALUE *argv,
|
|
const rb_block_t *blockptr)
|
|
{
|
|
int i;
|
|
int argc = orig_argc;
|
|
const int m = iseq->argc;
|
|
VALUE ary, arg0;
|
|
int opt_pc = 0;
|
|
|
|
th->mark_stack_len = argc;
|
|
|
|
/*
|
|
* yield [1, 2]
|
|
* => {|a|} => a = [1, 2]
|
|
* => {|a, b|} => a, b = [1, 2]
|
|
*/
|
|
arg0 = argv[0];
|
|
if (!(iseq->arg_simple & 0x02) && /* exclude {|a|} */
|
|
(m + iseq->arg_post_len) > 0 && /* this process is meaningful */
|
|
argc == 1 && !NIL_P(ary = rb_check_array_type(arg0))) { /* rhs is only an array */
|
|
th->mark_stack_len = argc = RARRAY_LENINT(ary);
|
|
|
|
CHECK_STACK_OVERFLOW(th->cfp, argc);
|
|
|
|
MEMCPY(argv, RARRAY_PTR(ary), VALUE, argc);
|
|
}
|
|
else {
|
|
argv[0] = arg0;
|
|
}
|
|
|
|
for (i=argc; i<m; i++) {
|
|
argv[i] = Qnil;
|
|
}
|
|
|
|
if (iseq->arg_rest == -1 && iseq->arg_opts == 0) {
|
|
const int arg_size = iseq->arg_size;
|
|
if (arg_size < argc) {
|
|
/*
|
|
* yield 1, 2
|
|
* => {|a|} # truncate
|
|
*/
|
|
th->mark_stack_len = argc = arg_size;
|
|
}
|
|
}
|
|
else {
|
|
int r = iseq->arg_rest;
|
|
|
|
if (iseq->arg_post_len ||
|
|
iseq->arg_opts) { /* TODO: implement simple version for (iseq->arg_post_len==0 && iseq->arg_opts > 0) */
|
|
opt_pc = vm_yield_setup_block_args_complex(th, iseq, argc, argv);
|
|
}
|
|
else {
|
|
if (argc < r) {
|
|
/* yield 1
|
|
* => {|a, b, *r|}
|
|
*/
|
|
for (i=argc; i<r; i++) {
|
|
argv[i] = Qnil;
|
|
}
|
|
argv[r] = rb_ary_new();
|
|
}
|
|
else {
|
|
argv[r] = rb_ary_new4(argc-r, &argv[r]);
|
|
}
|
|
}
|
|
|
|
th->mark_stack_len = iseq->arg_size;
|
|
}
|
|
|
|
/* {|&b|} */
|
|
if (iseq->arg_block != -1) {
|
|
VALUE procval = Qnil;
|
|
|
|
if (blockptr) {
|
|
if (blockptr->proc == 0) {
|
|
procval = rb_vm_make_proc(th, blockptr, rb_cProc);
|
|
}
|
|
else {
|
|
procval = blockptr->proc;
|
|
}
|
|
}
|
|
|
|
argv[iseq->arg_block] = procval;
|
|
}
|
|
|
|
th->mark_stack_len = 0;
|
|
return opt_pc;
|
|
}
|
|
|
|
static inline int
|
|
vm_yield_setup_args(rb_thread_t * const th, const rb_iseq_t *iseq,
|
|
int argc, VALUE *argv,
|
|
const rb_block_t *blockptr, int lambda)
|
|
{
|
|
if (0) { /* for debug */
|
|
printf(" argc: %d\n", argc);
|
|
printf("iseq argc: %d\n", iseq->argc);
|
|
printf("iseq opts: %d\n", iseq->arg_opts);
|
|
printf("iseq rest: %d\n", iseq->arg_rest);
|
|
printf("iseq post: %d\n", iseq->arg_post_len);
|
|
printf("iseq blck: %d\n", iseq->arg_block);
|
|
printf("iseq smpl: %d\n", iseq->arg_simple);
|
|
printf(" lambda: %s\n", lambda ? "true" : "false");
|
|
}
|
|
|
|
if (lambda) {
|
|
/* call as method */
|
|
int opt_pc;
|
|
VM_CALLEE_SETUP_ARG(opt_pc, th, iseq, argc, argv, &blockptr);
|
|
return opt_pc;
|
|
}
|
|
else {
|
|
return vm_yield_setup_block_args(th, iseq, argc, argv, blockptr);
|
|
}
|
|
}
|
|
|
|
static VALUE
|
|
vm_invoke_block(rb_thread_t *th, rb_control_frame_t *reg_cfp, rb_num_t num, rb_num_t flag)
|
|
{
|
|
const rb_block_t *block = GET_BLOCK_PTR();
|
|
rb_iseq_t *iseq;
|
|
int argc = (int)num;
|
|
VALUE type = GET_ISEQ()->local_iseq->type;
|
|
|
|
if ((type != ISEQ_TYPE_METHOD && type != ISEQ_TYPE_CLASS) || block == 0) {
|
|
rb_vm_localjump_error("no block given (yield)", Qnil, 0);
|
|
}
|
|
iseq = block->iseq;
|
|
|
|
argc = caller_setup_args(th, GET_CFP(), flag, argc, 0, 0);
|
|
|
|
if (BUILTIN_TYPE(iseq) != T_NODE) {
|
|
int opt_pc;
|
|
const int arg_size = iseq->arg_size;
|
|
VALUE * const rsp = GET_SP() - argc;
|
|
SET_SP(rsp);
|
|
|
|
CHECK_STACK_OVERFLOW(GET_CFP(), iseq->stack_max);
|
|
opt_pc = vm_yield_setup_args(th, iseq, argc, rsp, 0,
|
|
block_proc_is_lambda(block->proc));
|
|
|
|
vm_push_frame(th, iseq,
|
|
VM_FRAME_MAGIC_BLOCK, block->self, (VALUE) block->dfp,
|
|
iseq->iseq_encoded + opt_pc, rsp + arg_size, block->lfp,
|
|
iseq->local_size - arg_size);
|
|
|
|
return Qundef;
|
|
}
|
|
else {
|
|
VALUE val = vm_yield_with_cfunc(th, block, block->self, argc, STACK_ADDR_FROM_TOP(argc), 0);
|
|
POPN(argc); /* TODO: should put before C/yield? */
|
|
return val;
|
|
}
|
|
}
|
|
|
|
/* svar */
|
|
|
|
static inline NODE *
|
|
lfp_svar_place(rb_thread_t *th, VALUE *lfp)
|
|
{
|
|
VALUE *svar;
|
|
|
|
if (lfp && th->local_lfp != lfp) {
|
|
svar = &lfp[-1];
|
|
}
|
|
else {
|
|
svar = &th->local_svar;
|
|
}
|
|
if (NIL_P(*svar)) {
|
|
*svar = (VALUE)NEW_IF(Qnil, Qnil, Qnil);
|
|
}
|
|
return (NODE *)*svar;
|
|
}
|
|
|
|
static VALUE
|
|
lfp_svar_get(rb_thread_t *th, VALUE *lfp, VALUE key)
|
|
{
|
|
NODE *svar = lfp_svar_place(th, lfp);
|
|
|
|
switch (key) {
|
|
case 0:
|
|
return svar->u1.value;
|
|
case 1:
|
|
return svar->u2.value;
|
|
default: {
|
|
const VALUE hash = svar->u3.value;
|
|
|
|
if (hash == Qnil) {
|
|
return Qnil;
|
|
}
|
|
else {
|
|
return rb_hash_lookup(hash, key);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static void
|
|
lfp_svar_set(rb_thread_t *th, VALUE *lfp, VALUE key, VALUE val)
|
|
{
|
|
NODE *svar = lfp_svar_place(th, lfp);
|
|
|
|
switch (key) {
|
|
case 0:
|
|
svar->u1.value = val;
|
|
return;
|
|
case 1:
|
|
svar->u2.value = val;
|
|
return;
|
|
default: {
|
|
VALUE hash = svar->u3.value;
|
|
|
|
if (hash == Qnil) {
|
|
svar->u3.value = hash = rb_hash_new();
|
|
}
|
|
rb_hash_aset(hash, key, val);
|
|
}
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_getspecial(rb_thread_t *th, VALUE *lfp, VALUE key, rb_num_t type)
|
|
{
|
|
VALUE val;
|
|
|
|
if (type == 0) {
|
|
VALUE k = key;
|
|
if (FIXNUM_P(key)) {
|
|
k = FIX2INT(key);
|
|
}
|
|
val = lfp_svar_get(th, lfp, k);
|
|
}
|
|
else {
|
|
VALUE backref = lfp_svar_get(th, lfp, 1);
|
|
|
|
if (type & 0x01) {
|
|
switch (type >> 1) {
|
|
case '&':
|
|
val = rb_reg_last_match(backref);
|
|
break;
|
|
case '`':
|
|
val = rb_reg_match_pre(backref);
|
|
break;
|
|
case '\'':
|
|
val = rb_reg_match_post(backref);
|
|
break;
|
|
case '+':
|
|
val = rb_reg_match_last(backref);
|
|
break;
|
|
default:
|
|
rb_bug("unexpected back-ref");
|
|
}
|
|
}
|
|
else {
|
|
val = rb_reg_nth_match((int)(type >> 1), backref);
|
|
}
|
|
}
|
|
return val;
|
|
}
|
|
|
|
static NODE *
|
|
vm_get_cref(const rb_iseq_t *iseq, const VALUE *lfp, const VALUE *dfp)
|
|
{
|
|
NODE *cref = 0;
|
|
|
|
while (1) {
|
|
if (lfp == dfp) {
|
|
cref = iseq->cref_stack;
|
|
break;
|
|
}
|
|
else if (dfp[-1] != Qnil) {
|
|
cref = (NODE *)dfp[-1];
|
|
break;
|
|
}
|
|
dfp = GET_PREV_DFP(dfp);
|
|
}
|
|
|
|
if (cref == 0) {
|
|
rb_bug("vm_get_cref: unreachable");
|
|
}
|
|
return cref;
|
|
}
|
|
|
|
static NODE *
|
|
vm_cref_push(rb_thread_t *th, VALUE klass, int noex, rb_block_t *blockptr)
|
|
{
|
|
rb_control_frame_t *cfp = vm_get_ruby_level_caller_cfp(th, th->cfp);
|
|
NODE *cref = NEW_BLOCK(klass);
|
|
cref->nd_file = 0;
|
|
cref->nd_visi = noex;
|
|
|
|
if (blockptr) {
|
|
cref->nd_next = vm_get_cref(blockptr->iseq, blockptr->lfp, blockptr->dfp);
|
|
}
|
|
else if (cfp) {
|
|
cref->nd_next = vm_get_cref(cfp->iseq, cfp->lfp, cfp->dfp);
|
|
}
|
|
|
|
return cref;
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_get_cbase(const rb_iseq_t *iseq, const VALUE *lfp, const VALUE *dfp)
|
|
{
|
|
NODE *cref = vm_get_cref(iseq, lfp, dfp);
|
|
VALUE klass = Qundef;
|
|
|
|
while (cref) {
|
|
if ((klass = cref->nd_clss) != 0) {
|
|
break;
|
|
}
|
|
cref = cref->nd_next;
|
|
}
|
|
|
|
return klass;
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_get_const_base(const rb_iseq_t *iseq, const VALUE *lfp, const VALUE *dfp)
|
|
{
|
|
NODE *cref = vm_get_cref(iseq, lfp, dfp);
|
|
VALUE klass = Qundef;
|
|
|
|
while (cref) {
|
|
if (!(cref->flags & NODE_FL_CREF_PUSHED_BY_EVAL) &&
|
|
(klass = cref->nd_clss) != 0) {
|
|
break;
|
|
}
|
|
cref = cref->nd_next;
|
|
}
|
|
|
|
return klass;
|
|
}
|
|
|
|
static inline void
|
|
vm_check_if_namespace(VALUE klass)
|
|
{
|
|
switch (TYPE(klass)) {
|
|
case T_CLASS:
|
|
case T_MODULE:
|
|
break;
|
|
default:
|
|
rb_raise(rb_eTypeError, "%s is not a class/module",
|
|
RSTRING_PTR(rb_inspect(klass)));
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_get_ev_const(rb_thread_t *th, const rb_iseq_t *iseq,
|
|
VALUE orig_klass, ID id, int is_defined)
|
|
{
|
|
VALUE val;
|
|
|
|
if (orig_klass == Qnil) {
|
|
/* in current lexical scope */
|
|
const NODE *cref = vm_get_cref(iseq, th->cfp->lfp, th->cfp->dfp);
|
|
const NODE *root_cref = NULL;
|
|
VALUE klass = orig_klass;
|
|
|
|
while (cref && cref->nd_next) {
|
|
if (!(cref->flags & NODE_FL_CREF_PUSHED_BY_EVAL)) {
|
|
klass = cref->nd_clss;
|
|
if (root_cref == NULL)
|
|
root_cref = cref;
|
|
}
|
|
cref = cref->nd_next;
|
|
|
|
if (!NIL_P(klass)) {
|
|
VALUE am = 0;
|
|
search_continue:
|
|
if (RCLASS_IV_TBL(klass) &&
|
|
st_lookup(RCLASS_IV_TBL(klass), id, &val)) {
|
|
if (val == Qundef) {
|
|
if (am == klass) break;
|
|
am = klass;
|
|
rb_autoload_load(klass, id);
|
|
goto search_continue;
|
|
}
|
|
else {
|
|
if (is_defined) {
|
|
return 1;
|
|
}
|
|
else {
|
|
return val;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* search self */
|
|
if (root_cref && !NIL_P(root_cref->nd_clss)) {
|
|
klass = root_cref->nd_clss;
|
|
}
|
|
else {
|
|
klass = CLASS_OF(th->cfp->self);
|
|
}
|
|
|
|
if (is_defined) {
|
|
return rb_const_defined(klass, id);
|
|
}
|
|
else {
|
|
return rb_const_get(klass, id);
|
|
}
|
|
}
|
|
else {
|
|
vm_check_if_namespace(orig_klass);
|
|
if (is_defined) {
|
|
return rb_const_defined_from(orig_klass, id);
|
|
}
|
|
else {
|
|
return rb_const_get_from(orig_klass, id);
|
|
}
|
|
}
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_get_cvar_base(NODE *cref)
|
|
{
|
|
VALUE klass;
|
|
|
|
while (cref && cref->nd_next &&
|
|
(NIL_P(cref->nd_clss) || FL_TEST(cref->nd_clss, FL_SINGLETON) ||
|
|
(cref->flags & NODE_FL_CREF_PUSHED_BY_EVAL))) {
|
|
cref = cref->nd_next;
|
|
|
|
if (!cref->nd_next) {
|
|
rb_warn("class variable access from toplevel");
|
|
}
|
|
}
|
|
|
|
klass = cref->nd_clss;
|
|
|
|
if (NIL_P(klass)) {
|
|
rb_raise(rb_eTypeError, "no class variables available");
|
|
}
|
|
return klass;
|
|
}
|
|
|
|
|
|
#ifndef USE_IC_FOR_IVAR
|
|
#define USE_IC_FOR_IVAR 1
|
|
#endif
|
|
|
|
static VALUE
|
|
vm_getivar(VALUE obj, ID id, IC ic)
|
|
{
|
|
#if USE_IC_FOR_IVAR
|
|
if (TYPE(obj) == T_OBJECT) {
|
|
VALUE val = Qundef;
|
|
VALUE klass = RBASIC(obj)->klass;
|
|
|
|
if (ic->ic_class == klass) {
|
|
long index = ic->ic_value.index;
|
|
long len = ROBJECT_NUMIV(obj);
|
|
VALUE *ptr = ROBJECT_IVPTR(obj);
|
|
|
|
if (index < len) {
|
|
val = ptr[index];
|
|
}
|
|
}
|
|
else {
|
|
st_data_t index;
|
|
long len = ROBJECT_NUMIV(obj);
|
|
VALUE *ptr = ROBJECT_IVPTR(obj);
|
|
struct st_table *iv_index_tbl = ROBJECT_IV_INDEX_TBL(obj);
|
|
|
|
if (iv_index_tbl) {
|
|
if (st_lookup(iv_index_tbl, id, &index)) {
|
|
if ((long)index < len) {
|
|
val = ptr[index];
|
|
}
|
|
ic->ic_class = klass;
|
|
ic->ic_value.index = index;
|
|
}
|
|
}
|
|
}
|
|
if (UNLIKELY(val == Qundef)) {
|
|
rb_warning("instance variable %s not initialized", rb_id2name(id));
|
|
val = Qnil;
|
|
}
|
|
return val;
|
|
}
|
|
else {
|
|
return rb_ivar_get(obj, id);
|
|
}
|
|
#else
|
|
return rb_ivar_get(obj, id);
|
|
#endif
|
|
}
|
|
|
|
static void
|
|
vm_setivar(VALUE obj, ID id, VALUE val, IC ic)
|
|
{
|
|
#if USE_IC_FOR_IVAR
|
|
if (!OBJ_UNTRUSTED(obj) && rb_safe_level() >= 4) {
|
|
rb_raise(rb_eSecurityError, "Insecure: can't modify instance variable");
|
|
}
|
|
if (OBJ_FROZEN(obj)) {
|
|
rb_error_frozen("object");
|
|
}
|
|
|
|
if (TYPE(obj) == T_OBJECT) {
|
|
VALUE klass = RBASIC(obj)->klass;
|
|
st_data_t index;
|
|
|
|
if (ic->ic_class == klass) {
|
|
long index = ic->ic_value.index;
|
|
long len = ROBJECT_NUMIV(obj);
|
|
VALUE *ptr = ROBJECT_IVPTR(obj);
|
|
|
|
if (index < len) {
|
|
ptr[index] = val;
|
|
return; /* inline cache hit */
|
|
}
|
|
}
|
|
else {
|
|
struct st_table *iv_index_tbl = ROBJECT_IV_INDEX_TBL(obj);
|
|
|
|
if (iv_index_tbl && st_lookup(iv_index_tbl, (st_data_t)id, &index)) {
|
|
ic->ic_class = klass;
|
|
ic->ic_value.index = index;
|
|
}
|
|
/* fall through */
|
|
}
|
|
}
|
|
rb_ivar_set(obj, id, val);
|
|
#else
|
|
rb_ivar_set(obj, id, val);
|
|
#endif
|
|
}
|
|
|
|
static inline const rb_method_entry_t *
|
|
vm_method_search(VALUE id, VALUE klass, IC ic)
|
|
{
|
|
rb_method_entry_t *me;
|
|
#if OPT_INLINE_METHOD_CACHE
|
|
if (LIKELY(klass == ic->ic_class) &&
|
|
LIKELY(GET_VM_STATE_VERSION() == ic->ic_vmstat)) {
|
|
me = ic->ic_value.method;
|
|
}
|
|
else {
|
|
me = rb_method_entry(klass, id);
|
|
ic->ic_class = klass;
|
|
ic->ic_value.method = me;
|
|
ic->ic_vmstat = GET_VM_STATE_VERSION();
|
|
}
|
|
#else
|
|
me = rb_method_entry(klass, id);
|
|
#endif
|
|
return me;
|
|
}
|
|
|
|
static inline VALUE
|
|
vm_search_normal_superclass(VALUE klass, VALUE recv)
|
|
{
|
|
if (BUILTIN_TYPE(klass) == T_CLASS) {
|
|
return RCLASS_SUPER(klass);
|
|
}
|
|
else if (BUILTIN_TYPE(klass) == T_MODULE) {
|
|
VALUE k = CLASS_OF(recv);
|
|
while (k) {
|
|
if (BUILTIN_TYPE(k) == T_ICLASS && RBASIC(k)->klass == klass) {
|
|
return RCLASS_SUPER(k);
|
|
}
|
|
k = RCLASS_SUPER(k);
|
|
}
|
|
return rb_cObject;
|
|
}
|
|
else {
|
|
rb_bug("vm_search_normal_superclass: should not be reach here");
|
|
}
|
|
}
|
|
|
|
static void
|
|
vm_search_superclass(rb_control_frame_t *reg_cfp, rb_iseq_t *ip,
|
|
VALUE recv, VALUE sigval,
|
|
ID *idp, VALUE *klassp)
|
|
{
|
|
ID id;
|
|
VALUE klass;
|
|
|
|
while (ip && !ip->klass) {
|
|
ip = ip->parent_iseq;
|
|
}
|
|
|
|
if (ip == 0) {
|
|
rb_raise(rb_eNoMethodError, "super called outside of method");
|
|
}
|
|
|
|
id = ip->defined_method_id;
|
|
|
|
if (ip != ip->local_iseq) {
|
|
/* defined by Module#define_method() */
|
|
rb_control_frame_t *lcfp = GET_CFP();
|
|
|
|
if (!sigval) {
|
|
/* zsuper */
|
|
rb_raise(rb_eRuntimeError, "implicit argument passing of super from method defined by define_method() is not supported. Specify all arguments explicitly.");
|
|
}
|
|
|
|
while (lcfp->iseq != ip) {
|
|
VALUE *tdfp = GET_PREV_DFP(lcfp->dfp);
|
|
while (1) {
|
|
lcfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(lcfp);
|
|
if (lcfp->dfp == tdfp) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
id = lcfp->me->def->original_id;
|
|
klass = vm_search_normal_superclass(lcfp->me->klass, recv);
|
|
}
|
|
else {
|
|
klass = vm_search_normal_superclass(ip->klass, recv);
|
|
}
|
|
|
|
*idp = id;
|
|
*klassp = klass;
|
|
}
|
|
|
|
static VALUE
|
|
vm_throw(rb_thread_t *th, rb_control_frame_t *reg_cfp,
|
|
rb_num_t throw_state, VALUE throwobj)
|
|
{
|
|
int state = (int)(throw_state & 0xff);
|
|
int flag = (int)(throw_state & 0x8000);
|
|
rb_num_t level = throw_state >> 16;
|
|
|
|
if (state != 0) {
|
|
VALUE *pt = 0;
|
|
if (flag != 0) {
|
|
pt = (void *) 1;
|
|
}
|
|
else {
|
|
if (state == TAG_BREAK) {
|
|
rb_control_frame_t *cfp = GET_CFP();
|
|
VALUE *dfp = GET_DFP();
|
|
int is_orphan = 1;
|
|
rb_iseq_t *base_iseq = GET_ISEQ();
|
|
|
|
search_parent:
|
|
if (cfp->iseq->type != ISEQ_TYPE_BLOCK) {
|
|
if (cfp->iseq->type == ISEQ_TYPE_CLASS) {
|
|
cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
|
|
dfp = cfp->dfp;
|
|
goto search_parent;
|
|
}
|
|
dfp = GC_GUARDED_PTR_REF((VALUE *) *dfp);
|
|
base_iseq = base_iseq->parent_iseq;
|
|
|
|
while ((VALUE *) cfp < th->stack + th->stack_size) {
|
|
if (cfp->dfp == dfp) {
|
|
goto search_parent;
|
|
}
|
|
cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
|
|
}
|
|
rb_bug("VM (throw): can't find break base.");
|
|
}
|
|
|
|
if (VM_FRAME_TYPE(cfp) == VM_FRAME_MAGIC_LAMBDA) {
|
|
/* lambda{... break ...} */
|
|
is_orphan = 0;
|
|
pt = cfp->dfp;
|
|
state = TAG_RETURN;
|
|
}
|
|
else {
|
|
dfp = GC_GUARDED_PTR_REF((VALUE *) *dfp);
|
|
|
|
while ((VALUE *)cfp < th->stack + th->stack_size) {
|
|
if (cfp->dfp == dfp) {
|
|
VALUE epc = epc = cfp->pc - cfp->iseq->iseq_encoded;
|
|
rb_iseq_t *iseq = cfp->iseq;
|
|
int i;
|
|
|
|
for (i=0; i<iseq->catch_table_size; i++) {
|
|
struct iseq_catch_table_entry *entry = &iseq->catch_table[i];
|
|
|
|
if (entry->type == CATCH_TYPE_BREAK &&
|
|
entry->start < epc && entry->end >= epc) {
|
|
if (entry->cont == epc) {
|
|
goto found;
|
|
}
|
|
else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
|
|
found:
|
|
pt = dfp;
|
|
is_orphan = 0;
|
|
break;
|
|
}
|
|
cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
|
|
}
|
|
}
|
|
|
|
if (is_orphan) {
|
|
rb_vm_localjump_error("break from proc-closure", throwobj, TAG_BREAK);
|
|
}
|
|
}
|
|
else if (state == TAG_RETRY) {
|
|
rb_num_t i;
|
|
pt = GC_GUARDED_PTR_REF((VALUE *) * GET_DFP());
|
|
for (i = 0; i < level; i++) {
|
|
pt = GC_GUARDED_PTR_REF((VALUE *) * pt);
|
|
}
|
|
}
|
|
else if (state == TAG_RETURN) {
|
|
rb_control_frame_t *cfp = GET_CFP();
|
|
VALUE *dfp = GET_DFP();
|
|
VALUE *lfp = GET_LFP();
|
|
|
|
/* check orphan and get dfp */
|
|
while ((VALUE *) cfp < th->stack + th->stack_size) {
|
|
if (!lfp) {
|
|
lfp = cfp->lfp;
|
|
}
|
|
if (cfp->dfp == lfp && cfp->iseq->type == ISEQ_TYPE_CLASS) {
|
|
lfp = 0;
|
|
}
|
|
|
|
if (cfp->lfp == lfp) {
|
|
if (VM_FRAME_TYPE(cfp) == VM_FRAME_MAGIC_LAMBDA) {
|
|
VALUE *tdfp = dfp;
|
|
|
|
while (lfp != tdfp) {
|
|
if (cfp->dfp == tdfp) {
|
|
/* in lambda */
|
|
dfp = cfp->dfp;
|
|
goto valid_return;
|
|
}
|
|
tdfp = GC_GUARDED_PTR_REF((VALUE *)*tdfp);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (cfp->dfp == lfp && cfp->iseq->type == ISEQ_TYPE_METHOD) {
|
|
dfp = lfp;
|
|
goto valid_return;
|
|
}
|
|
|
|
cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
|
|
}
|
|
|
|
rb_vm_localjump_error("unexpected return", throwobj, TAG_RETURN);
|
|
|
|
valid_return:
|
|
pt = dfp;
|
|
}
|
|
else {
|
|
rb_bug("isns(throw): unsupport throw type");
|
|
}
|
|
}
|
|
th->state = state;
|
|
return (VALUE)NEW_THROW_OBJECT(throwobj, (VALUE) pt, state);
|
|
}
|
|
else {
|
|
/* continue throw */
|
|
VALUE err = throwobj;
|
|
|
|
if (FIXNUM_P(err)) {
|
|
th->state = FIX2INT(err);
|
|
}
|
|
else if (SYMBOL_P(err)) {
|
|
th->state = TAG_THROW;
|
|
}
|
|
else if (BUILTIN_TYPE(err) == T_NODE) {
|
|
th->state = GET_THROWOBJ_STATE(err);
|
|
}
|
|
else {
|
|
th->state = TAG_RAISE;
|
|
/*th->state = FIX2INT(rb_ivar_get(err, idThrowState));*/
|
|
}
|
|
return err;
|
|
}
|
|
}
|
|
|
|
static inline void
|
|
vm_expandarray(rb_control_frame_t *cfp, VALUE ary, rb_num_t num, int flag)
|
|
{
|
|
int is_splat = flag & 0x01;
|
|
rb_num_t space_size = num + is_splat;
|
|
VALUE *base = cfp->sp, *ptr;
|
|
volatile VALUE tmp_ary;
|
|
rb_num_t len;
|
|
|
|
if (TYPE(ary) != T_ARRAY) {
|
|
ary = rb_ary_to_ary(ary);
|
|
}
|
|
|
|
cfp->sp += space_size;
|
|
|
|
tmp_ary = ary;
|
|
ptr = RARRAY_PTR(ary);
|
|
len = (rb_num_t)RARRAY_LEN(ary);
|
|
|
|
if (flag & 0x02) {
|
|
/* post: ..., nil ,ary[-1], ..., ary[0..-num] # top */
|
|
rb_num_t i = 0, j;
|
|
|
|
if (len < num) {
|
|
for (i=0; i<num-len; i++) {
|
|
*base++ = Qnil;
|
|
}
|
|
}
|
|
for (j=0; i<num; i++, j++) {
|
|
VALUE v = ptr[len - j - 1];
|
|
*base++ = v;
|
|
}
|
|
if (is_splat) {
|
|
*base = rb_ary_new4(len - j, ptr);
|
|
}
|
|
}
|
|
else {
|
|
/* normal: ary[num..-1], ary[num-2], ary[num-3], ..., ary[0] # top */
|
|
rb_num_t i;
|
|
VALUE *bptr = &base[space_size - 1];
|
|
|
|
for (i=0; i<num; i++) {
|
|
if (len <= i) {
|
|
for (; i<num; i++) {
|
|
*bptr-- = Qnil;
|
|
}
|
|
break;
|
|
}
|
|
*bptr-- = ptr[i];
|
|
}
|
|
if (is_splat) {
|
|
if (num > len) {
|
|
*bptr = rb_ary_new();
|
|
}
|
|
else {
|
|
*bptr = rb_ary_new4(len - num, ptr + num);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static inline int
|
|
check_cfunc(const rb_method_entry_t *me, VALUE (*func)())
|
|
{
|
|
if (me && me->def->type == VM_METHOD_TYPE_CFUNC &&
|
|
me->def->body.cfunc.func == func) {
|
|
return 1;
|
|
}
|
|
else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
static
|
|
#ifndef NO_BIG_INLINE
|
|
inline
|
|
#endif
|
|
VALUE
|
|
opt_eq_func(VALUE recv, VALUE obj, IC ic)
|
|
{
|
|
if (FIXNUM_2_P(recv, obj) &&
|
|
BASIC_OP_UNREDEFINED_P(BOP_EQ)) {
|
|
return (recv == obj) ? Qtrue : Qfalse;
|
|
}
|
|
else if (!SPECIAL_CONST_P(recv) && !SPECIAL_CONST_P(obj)) {
|
|
if (HEAP_CLASS_OF(recv) == rb_cFloat &&
|
|
HEAP_CLASS_OF(obj) == rb_cFloat &&
|
|
BASIC_OP_UNREDEFINED_P(BOP_EQ)) {
|
|
double a = RFLOAT_VALUE(recv);
|
|
double b = RFLOAT_VALUE(obj);
|
|
|
|
if (isnan(a) || isnan(b)) {
|
|
return Qfalse;
|
|
}
|
|
return (a == b) ? Qtrue : Qfalse;
|
|
}
|
|
else if (HEAP_CLASS_OF(recv) == rb_cString &&
|
|
HEAP_CLASS_OF(obj) == rb_cString &&
|
|
BASIC_OP_UNREDEFINED_P(BOP_EQ)) {
|
|
return rb_str_equal(recv, obj);
|
|
}
|
|
}
|
|
|
|
{
|
|
const rb_method_entry_t *me = vm_method_search(idEq, CLASS_OF(recv), ic);
|
|
extern VALUE rb_obj_equal(VALUE obj1, VALUE obj2);
|
|
|
|
if (check_cfunc(me, rb_obj_equal)) {
|
|
return recv == obj ? Qtrue : Qfalse;
|
|
}
|
|
}
|
|
|
|
return Qundef;
|
|
}
|
|
|
|
struct opt_case_dispatch_i_arg {
|
|
VALUE obj;
|
|
int label;
|
|
};
|
|
|
|
static int
|
|
opt_case_dispatch_i(st_data_t key, st_data_t data, st_data_t p)
|
|
{
|
|
struct opt_case_dispatch_i_arg *arg = (void *)p;
|
|
|
|
if (RTEST(rb_funcall((VALUE)key, idEqq, 1, arg->obj))) {
|
|
arg->label = FIX2INT((VALUE)data);
|
|
return ST_STOP;
|
|
}
|
|
else {
|
|
return ST_CONTINUE;
|
|
}
|
|
}
|
|
|