Ruby 3.3.7p123 (2025-01-15 revision be31f993d7fa0219d85f7b3c694d454da4ecc10b)
iseq.h
1#ifndef RUBY_ISEQ_H
2#define RUBY_ISEQ_H 1
3/**********************************************************************
4
5 iseq.h -
6
7 $Author$
8 created at: 04/01/01 23:36:57 JST
9
10 Copyright (C) 2004-2008 Koichi Sasada
11
12**********************************************************************/
13#include "internal/gc.h"
14#include "shape.h"
15#include "vm_core.h"
16#include "prism_compile.h"
17
19#define ISEQ_MAJOR_VERSION ((unsigned int)ruby_api_version[0])
20#define ISEQ_MINOR_VERSION ((unsigned int)ruby_api_version[1])
21
22#define ISEQ_MBITS_SIZE sizeof(iseq_bits_t)
23#define ISEQ_MBITS_BITLENGTH (ISEQ_MBITS_SIZE * CHAR_BIT)
24#define ISEQ_MBITS_SET(buf, i) (buf[(i) / ISEQ_MBITS_BITLENGTH] |= ((iseq_bits_t)1 << ((i) % ISEQ_MBITS_BITLENGTH)))
25#define ISEQ_MBITS_SET_P(buf, i) ((buf[(i) / ISEQ_MBITS_BITLENGTH] >> ((i) % ISEQ_MBITS_BITLENGTH)) & 0x1)
26#define ISEQ_MBITS_BUFLEN(size) roomof(size, ISEQ_MBITS_BITLENGTH)
27
28#ifndef USE_ISEQ_NODE_ID
29#define USE_ISEQ_NODE_ID 1
30#endif
31
32#ifndef rb_iseq_t
33typedef struct rb_iseq_struct rb_iseq_t;
34#define rb_iseq_t rb_iseq_t
35#endif
36typedef void (*rb_iseq_callback)(const rb_iseq_t *, void *);
37
38extern const ID rb_iseq_shared_exc_local_tbl[];
39
40#define ISEQ_COVERAGE(iseq) ISEQ_BODY(iseq)->variable.coverage
41#define ISEQ_COVERAGE_SET(iseq, cov) RB_OBJ_WRITE(iseq, &ISEQ_BODY(iseq)->variable.coverage, cov)
42#define ISEQ_LINE_COVERAGE(iseq) RARRAY_AREF(ISEQ_COVERAGE(iseq), COVERAGE_INDEX_LINES)
43#define ISEQ_BRANCH_COVERAGE(iseq) RARRAY_AREF(ISEQ_COVERAGE(iseq), COVERAGE_INDEX_BRANCHES)
44
45#define ISEQ_PC2BRANCHINDEX(iseq) ISEQ_BODY(iseq)->variable.pc2branchindex
46#define ISEQ_PC2BRANCHINDEX_SET(iseq, h) RB_OBJ_WRITE(iseq, &ISEQ_BODY(iseq)->variable.pc2branchindex, h)
47
48#define ISEQ_FLIP_CNT(iseq) ISEQ_BODY(iseq)->variable.flip_count
49
50static inline rb_snum_t
51ISEQ_FLIP_CNT_INCREMENT(const rb_iseq_t *iseq)
52{
53 rb_snum_t cnt = ISEQ_BODY(iseq)->variable.flip_count;
54 ISEQ_BODY(iseq)->variable.flip_count += 1;
55 return cnt;
56}
57
58static inline VALUE *
59ISEQ_ORIGINAL_ISEQ(const rb_iseq_t *iseq)
60{
61 return ISEQ_BODY(iseq)->variable.original_iseq;
62}
63
64static inline void
65ISEQ_ORIGINAL_ISEQ_CLEAR(const rb_iseq_t *iseq)
66{
67 void *ptr = ISEQ_BODY(iseq)->variable.original_iseq;
68 ISEQ_BODY(iseq)->variable.original_iseq = NULL;
69 if (ptr) {
70 ruby_xfree(ptr);
71 }
72}
73
74static inline VALUE *
75ISEQ_ORIGINAL_ISEQ_ALLOC(const rb_iseq_t *iseq, long size)
76{
77 return ISEQ_BODY(iseq)->variable.original_iseq =
78 ALLOC_N(VALUE, size);
79}
80
81#define ISEQ_TRACE_EVENTS (RUBY_EVENT_LINE | \
82 RUBY_EVENT_CLASS | \
83 RUBY_EVENT_END | \
84 RUBY_EVENT_CALL | \
85 RUBY_EVENT_RETURN| \
86 RUBY_EVENT_C_CALL| \
87 RUBY_EVENT_C_RETURN | \
88 RUBY_EVENT_B_CALL | \
89 RUBY_EVENT_B_RETURN | \
90 RUBY_EVENT_RESCUE | \
91 RUBY_EVENT_COVERAGE_LINE| \
92 RUBY_EVENT_COVERAGE_BRANCH)
93
94#define ISEQ_NOT_LOADED_YET IMEMO_FL_USER1
95#define ISEQ_USE_COMPILE_DATA IMEMO_FL_USER2
96#define ISEQ_TRANSLATED IMEMO_FL_USER3
97
98#define ISEQ_EXECUTABLE_P(iseq) (FL_TEST_RAW(((VALUE)iseq), ISEQ_NOT_LOADED_YET | ISEQ_USE_COMPILE_DATA) == 0)
99
101 /* GC is needed */
102 const VALUE err_info;
103 const VALUE catch_table_ary; /* Array */
104
105 /* GC is not needed */
106 struct iseq_label_data *start_label;
107 struct iseq_label_data *end_label;
108 struct iseq_label_data *redo_label;
109 const rb_iseq_t *current_block;
110 struct iseq_compile_data_ensure_node_stack *ensure_node_stack;
111 struct {
112 struct iseq_compile_data_storage *storage_head;
113 struct iseq_compile_data_storage *storage_current;
114 } node;
115 struct {
116 struct iseq_compile_data_storage *storage_head;
117 struct iseq_compile_data_storage *storage_current;
118 } insn;
119 bool in_rescue;
120 bool in_masgn;
121 int loopval_popped; /* used by NODE_BREAK */
122 int last_line;
123 int label_no;
124 int node_level;
125 int isolated_depth;
126 unsigned int ci_index;
127 unsigned int ic_index;
128 const rb_compile_option_t *option;
129 struct rb_id_table *ivar_cache_table;
130 const struct rb_builtin_function *builtin_function_table;
131 const NODE *root_node;
132 bool catch_except_p; // If a frame of this ISeq may catch exception, set true.
133#if OPT_SUPPORT_JOKE
134 st_table *labels_table;
135#endif
136};
137
138static inline struct iseq_compile_data *
139ISEQ_COMPILE_DATA(const rb_iseq_t *iseq)
140{
141 if (iseq->flags & ISEQ_USE_COMPILE_DATA) {
142 return iseq->aux.compile_data;
143 }
144 else {
145 return NULL;
146 }
147}
148
149static inline void
150ISEQ_COMPILE_DATA_ALLOC(rb_iseq_t *iseq)
151{
152 iseq->aux.compile_data = ZALLOC(struct iseq_compile_data);
153 iseq->flags |= ISEQ_USE_COMPILE_DATA;
154}
155
156static inline void
157ISEQ_COMPILE_DATA_CLEAR(rb_iseq_t *iseq)
158{
159 iseq->flags &= ~ISEQ_USE_COMPILE_DATA;
160 iseq->aux.compile_data = NULL;
161}
162
163static inline rb_iseq_t *
164iseq_imemo_alloc(void)
165{
166 return (rb_iseq_t *)rb_imemo_new(imemo_iseq, 0, 0, 0, 0);
167}
168
169VALUE rb_iseq_ibf_dump(const rb_iseq_t *iseq, VALUE opt);
170void rb_ibf_load_iseq_complete(rb_iseq_t *iseq);
171const rb_iseq_t *rb_iseq_ibf_load(VALUE str);
172const rb_iseq_t *rb_iseq_ibf_load_bytes(const char *cstr, size_t);
173VALUE rb_iseq_ibf_load_extra_data(VALUE str);
174void rb_iseq_init_trace(rb_iseq_t *iseq);
175int rb_iseq_add_local_tracepoint_recursively(const rb_iseq_t *iseq, rb_event_flag_t turnon_events, VALUE tpval, unsigned int target_line, bool target_bmethod);
176int rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval);
177const rb_iseq_t *rb_iseq_load_iseq(VALUE fname);
178rb_iseq_t * rb_iseq_new_main_prism(pm_string_t *input, pm_options_t *options, VALUE path);
179
180#if VM_INSN_INFO_TABLE_IMPL == 2
181unsigned int *rb_iseq_insns_info_decode_positions(const struct rb_iseq_constant_body *body);
182#endif
183
184int rb_vm_insn_addr2opcode(const void *addr);
185
186RUBY_SYMBOL_EXPORT_BEGIN
187
188/* compile.c */
189VALUE rb_iseq_compile_node(rb_iseq_t *iseq, const NODE *node);
190VALUE rb_iseq_compile_callback(rb_iseq_t *iseq, const struct rb_iseq_new_with_callback_callback_func * ifunc);
191VALUE *rb_iseq_original_iseq(const rb_iseq_t *iseq);
192void rb_iseq_build_from_ary(rb_iseq_t *iseq, VALUE misc,
193 VALUE locals, VALUE args,
194 VALUE exception, VALUE body);
195void rb_iseq_mark_and_pin_insn_storage(struct iseq_compile_data_storage *arena);
196
197VALUE rb_iseq_load(VALUE data, VALUE parent, VALUE opt);
198VALUE rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc);
199unsigned int rb_iseq_line_no(const rb_iseq_t *iseq, size_t pos);
200#ifdef USE_ISEQ_NODE_ID
201int rb_iseq_node_id(const rb_iseq_t *iseq, size_t pos);
202#endif
203void rb_iseq_trace_set(const rb_iseq_t *iseq, rb_event_flag_t turnon_events);
204void rb_iseq_trace_set_all(rb_event_flag_t turnon_events);
205void rb_iseq_insns_info_encode_positions(const rb_iseq_t *iseq);
206
207struct rb_iseq_constant_body *rb_iseq_constant_body_alloc(void);
208VALUE rb_iseqw_new(const rb_iseq_t *iseq);
209const rb_iseq_t *rb_iseqw_to_iseq(VALUE iseqw);
210
211VALUE rb_iseq_absolute_path(const rb_iseq_t *iseq); /* obsolete */
212int rb_iseq_from_eval_p(const rb_iseq_t *iseq);
213VALUE rb_iseq_type(const rb_iseq_t *iseq);
214VALUE rb_iseq_label(const rb_iseq_t *iseq);
215VALUE rb_iseq_base_label(const rb_iseq_t *iseq);
216VALUE rb_iseq_first_lineno(const rb_iseq_t *iseq);
217VALUE rb_iseq_method_name(const rb_iseq_t *iseq);
218void rb_iseq_code_location(const rb_iseq_t *iseq, int *first_lineno, int *first_column, int *last_lineno, int *last_column);
219
220void rb_iseq_remove_coverage_all(void);
221
222/* proc.c */
223const rb_iseq_t *rb_method_iseq(VALUE body);
224const rb_iseq_t *rb_proc_get_iseq(VALUE proc, int *is_proc);
225
227 unsigned int inline_const_cache: 1;
228 unsigned int peephole_optimization: 1;
229 unsigned int tailcall_optimization: 1;
230 unsigned int specialized_instruction: 1;
231 unsigned int operands_unification: 1;
232 unsigned int instructions_unification: 1;
233 unsigned int frozen_string_literal: 1;
234 unsigned int debug_frozen_string_literal: 1;
235 unsigned int coverage_enabled: 1;
236 int debug_level;
237};
238
240 int line_no;
241#ifdef USE_ISEQ_NODE_ID
242 int node_id;
243#endif
244 rb_event_flag_t events;
245};
246
247/*
248 * iseq type:
249 * CATCH_TYPE_RESCUE, CATCH_TYPE_ENSURE:
250 * use iseq as continuation.
251 *
252 * CATCH_TYPE_BREAK (iter):
253 * use iseq as key.
254 *
255 * CATCH_TYPE_BREAK (while), CATCH_TYPE_RETRY,
256 * CATCH_TYPE_REDO, CATCH_TYPE_NEXT:
257 * NULL.
258 */
259enum rb_catch_type {
260 CATCH_TYPE_RESCUE = INT2FIX(1),
261 CATCH_TYPE_ENSURE = INT2FIX(2),
262 CATCH_TYPE_RETRY = INT2FIX(3),
263 CATCH_TYPE_BREAK = INT2FIX(4),
264 CATCH_TYPE_REDO = INT2FIX(5),
265 CATCH_TYPE_NEXT = INT2FIX(6)
266};
267
269 enum rb_catch_type type;
270 rb_iseq_t *iseq;
271
272 unsigned int start;
273 unsigned int end;
274 unsigned int cont;
275 unsigned int sp;
276};
277
278RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_BEGIN()
280 unsigned int size;
281 struct iseq_catch_table_entry entries[FLEX_ARY_LEN];
282} RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_END();
283
284static inline int
285iseq_catch_table_bytes(int n)
286{
287 enum {
288 catch_table_entry_size = sizeof(struct iseq_catch_table_entry),
289 catch_table_entries_max = (INT_MAX - offsetof(struct iseq_catch_table, entries)) / catch_table_entry_size
290 };
291 if (n > catch_table_entries_max) rb_fatal("too large iseq_catch_table - %d", n);
292 return (int)(offsetof(struct iseq_catch_table, entries) +
293 n * catch_table_entry_size);
294}
295
296#define INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE (512)
297
299 struct iseq_compile_data_storage *next;
300 unsigned int pos;
301 unsigned int size;
302 char buff[FLEX_ARY_LEN];
303};
304
305/* defined? */
306
307enum defined_type {
308 DEFINED_NOT_DEFINED,
309 DEFINED_NIL = 1,
310 DEFINED_IVAR,
311 DEFINED_LVAR,
312 DEFINED_GVAR,
313 DEFINED_CVAR,
314 DEFINED_CONST,
315 DEFINED_METHOD,
316 DEFINED_YIELD,
317 DEFINED_ZSUPER,
318 DEFINED_SELF,
319 DEFINED_TRUE,
320 DEFINED_FALSE,
321 DEFINED_ASGN,
322 DEFINED_EXPR,
323 DEFINED_REF,
324 DEFINED_FUNC,
325 DEFINED_CONST_FROM
326};
327
328VALUE rb_iseq_defined_string(enum defined_type type);
329
330/* vm.c */
331VALUE rb_iseq_local_variables(const rb_iseq_t *iseq);
332
333attr_index_t rb_estimate_iv_count(VALUE klass, const rb_iseq_t * initialize_iseq);
334
335void rb_free_encoded_insn_data(void);
336
337RUBY_SYMBOL_EXPORT_END
338
339#endif /* RUBY_ISEQ_H */
#define RUBY_EXTERN
Declaration of externally visible global variables.
Definition dllexport.h:45
uint32_t rb_event_flag_t
Represents event(s).
Definition event.h:108
#define INT2FIX
Old name of RB_INT2FIX.
Definition long.h:48
#define ZALLOC
Old name of RB_ZALLOC.
Definition memory.h:396
#define ALLOC_N
Old name of RB_ALLOC_N.
Definition memory.h:393
const int ruby_api_version[3]
API versions, in { major, minor, teeny } order.
Definition version.c:46
VALUE type(ANYARGS)
ANYARGS-ed function type.
Definition iseq.h:268
Definition iseq.h:239
The options that can be passed to the parser.
Definition options.h:30
A generic string type that can have various ownership semantics.
Definition pm_string.h:30
Definition st.h:79
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
Definition value.h:52
uintptr_t VALUE
Type that represents a Ruby object.
Definition value.h:40