12 #ifndef RUBY_INSNHELPER_H
13 #define RUBY_INSNHELPER_H
69 #define PUSH(x) (SET_SV(x), INC_SP(1))
70 #define TOPN(n) (*(GET_SP()-(n)-1))
71 #define POPN(n) (DEC_SP(n))
72 #define POP() (DEC_SP(1))
73 #define STACK_ADDR_FROM_TOP(n) (GET_SP()-(n))
75 #define GET_TOS() (tos)
81 #define REG_CFP (reg_cfp)
82 #define REG_PC (REG_CFP->pc)
83 #define REG_SP (REG_CFP->sp)
84 #define REG_LFP (REG_CFP->lfp)
85 #define REG_DFP (REG_CFP->dfp)
87 #define RESTORE_REGS() do { \
94 #ifdef COLLECT_USAGE_ANALYSIS
95 #define USAGE_ANALYSIS_REGISTER_HELPER(a, b, v) \
96 (USAGE_ANALYSIS_REGISTER((a), (b)), (v))
98 #define USAGE_ANALYSIS_REGISTER_HELPER(a, b, v) (v)
102 #define GET_PC() (USAGE_ANALYSIS_REGISTER_HELPER(0, 0, REG_PC))
103 #define SET_PC(x) (REG_PC = (USAGE_ANALYSIS_REGISTER_HELPER(0, 1, (x))))
104 #define GET_CURRENT_INSN() (*GET_PC())
105 #define GET_OPERAND(n) (GET_PC()[(n)])
106 #define ADD_PC(n) (SET_PC(REG_PC + (n)))
108 #define GET_PC_COUNT() (REG_PC - GET_ISEQ()->iseq_encoded)
109 #define JUMP(dst) (REG_PC += (dst))
112 #define GET_CFP() (USAGE_ANALYSIS_REGISTER_HELPER(2, 0, REG_CFP))
113 #define GET_LFP() (USAGE_ANALYSIS_REGISTER_HELPER(3, 0, REG_LFP))
114 #define SET_LFP(x) (REG_LFP = (USAGE_ANALYSIS_REGISTER_HELPER(3, 1, (x))))
115 #define GET_DFP() (USAGE_ANALYSIS_REGISTER_HELPER(4, 0, REG_DFP))
116 #define SET_DFP(x) (REG_DFP = (USAGE_ANALYSIS_REGISTER_HELPER(4, 1, (x))))
119 #define GET_SP() (USAGE_ANALYSIS_REGISTER_HELPER(1, 0, REG_SP))
120 #define SET_SP(x) (REG_SP = (USAGE_ANALYSIS_REGISTER_HELPER(1, 1, (x))))
121 #define INC_SP(x) (REG_SP += (USAGE_ANALYSIS_REGISTER_HELPER(1, 1, (x))))
122 #define DEC_SP(x) (REG_SP -= (USAGE_ANALYSIS_REGISTER_HELPER(1, 1, (x))))
123 #define SET_SV(x) (*GET_SP() = (x))
126 #define GET_SP_COUNT() (REG_SP - th->stack)
129 #define GET_ISEQ() (GET_CFP()->iseq)
135 #define GET_PREV_DFP(dfp) ((VALUE *)((dfp)[0] & ~0x03))
137 #define GET_GLOBAL(entry) rb_gvar_get((struct rb_global_entry*)(entry))
138 #define SET_GLOBAL(entry, val) rb_gvar_set((struct rb_global_entry*)(entry), (val))
140 #define GET_CONST_INLINE_CACHE(dst) ((IC) * (GET_PC() + (dst) + 2))
146 #define GET_SELF() (USAGE_ANALYSIS_REGISTER_HELPER(5, 0, GET_CFP()->self))
152 #define COPY_CREF(c1, c2) do { \
153 NODE *__tmp_c2 = (c2); \
154 (c1)->nd_clss = __tmp_c2->nd_clss; \
155 (c1)->nd_visi = __tmp_c2->nd_visi;\
156 (c1)->nd_next = __tmp_c2->nd_next; \
157 if (__tmp_c2->flags & NODE_FL_CREF_PUSHED_BY_EVAL) { \
158 (c1)->flags |= NODE_FL_CREF_PUSHED_BY_EVAL; \
162 #define CALL_METHOD(num, blockptr, flag, id, me, recv) do { \
163 VALUE v = vm_call_method(th, GET_CFP(), (num), (blockptr), (flag), (id), (me), (recv)); \
173 #define GET_BLOCK_PTR() \
174 ((rb_block_t *)(GC_GUARDED_PTR_REF(GET_LFP()[0] & \
175 ((GET_LFP()[0] & 0x02) - 0x02))))
187 #define FIXNUM_2_P(a, b) ((a) & (b) & 1)
188 #define BASIC_OP_UNREDEFINED_P(op) (LIKELY(ruby_vm_redefined_flag[(op)] == 0))
189 #define HEAP_CLASS_OF(obj) RBASIC(obj)->klass
191 #ifndef USE_IC_FOR_SPECIALIZED_METHOD
192 #define USE_IC_FOR_SPECIALIZED_METHOD 1
195 #if USE_IC_FOR_SPECIALIZED_METHOD
197 #define CALL_SIMPLE_METHOD(num, id, recv) do { \
198 VALUE klass = CLASS_OF(recv); \
199 CALL_METHOD((num), 0, 0, (id), vm_method_search((id), klass, ic), (recv)); \
204 #define CALL_SIMPLE_METHOD(num, id, recv) do { \
205 VALUE klass = CLASS_OF(recv); \
206 CALL_METHOD((num), 0, 0, (id), rb_method_entry(klass, (id)), (recv)); \
213 #define GET_VM_STATE_VERSION() (ruby_vm_global_state_version)
214 #define INC_VM_STATE_VERSION() do { \
215 ruby_vm_global_state_version = (ruby_vm_global_state_version + 1); \
216 if (ruby_vm_global_state_version == 0) vm_clear_all_cache(); \
VALUE ruby_vm_const_missing_count
char ruby_vm_redefined_flag[BOP_LAST_]
static VALUE ruby_vm_global_state_version
static void vm_clear_all_cache(void)