Ruby 3.5.0dev (2025-10-05 revision 8cc5e5c11d26b2af9acff9898c2b226e2e781e36)
iseq.h (8cc5e5c11d26b2af9acff9898c2b226e2e781e36)
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
50#define ISEQ_FROZEN_STRING_LITERAL_ENABLED 1
51#define ISEQ_FROZEN_STRING_LITERAL_DISABLED 0
52#define ISEQ_FROZEN_STRING_LITERAL_UNSET -1
53
54static inline rb_snum_t
55ISEQ_FLIP_CNT_INCREMENT(const rb_iseq_t *iseq)
56{
57 rb_snum_t cnt = ISEQ_BODY(iseq)->variable.flip_count;
58 ISEQ_BODY(iseq)->variable.flip_count += 1;
59 return cnt;
60}
61
62static inline VALUE *
63ISEQ_ORIGINAL_ISEQ(const rb_iseq_t *iseq)
64{
65 return ISEQ_BODY(iseq)->variable.original_iseq;
66}
67
68static inline void
69ISEQ_ORIGINAL_ISEQ_CLEAR(const rb_iseq_t *iseq)
70{
71 void *ptr = ISEQ_BODY(iseq)->variable.original_iseq;
72 ISEQ_BODY(iseq)->variable.original_iseq = NULL;
73 ruby_xfree(ptr);
74}
75
76static inline VALUE *
77ISEQ_ORIGINAL_ISEQ_ALLOC(const rb_iseq_t *iseq, long size)
78{
79 return ISEQ_BODY(iseq)->variable.original_iseq =
80 ALLOC_N(VALUE, size);
81}
82
83#define ISEQ_TRACE_EVENTS (RUBY_EVENT_LINE | \
84 RUBY_EVENT_CLASS | \
85 RUBY_EVENT_END | \
86 RUBY_EVENT_CALL | \
87 RUBY_EVENT_RETURN| \
88 RUBY_EVENT_C_CALL| \
89 RUBY_EVENT_C_RETURN | \
90 RUBY_EVENT_B_CALL | \
91 RUBY_EVENT_B_RETURN | \
92 RUBY_EVENT_RESCUE | \
93 RUBY_EVENT_COVERAGE_LINE| \
94 RUBY_EVENT_COVERAGE_BRANCH)
95
96#define ISEQ_NOT_LOADED_YET IMEMO_FL_USER1
97#define ISEQ_USE_COMPILE_DATA IMEMO_FL_USER2
98#define ISEQ_TRANSLATED IMEMO_FL_USER3
99
100#define ISEQ_EXECUTABLE_P(iseq) (FL_TEST_RAW(((VALUE)iseq), ISEQ_NOT_LOADED_YET | ISEQ_USE_COMPILE_DATA) == 0)
101
103 /* GC is needed */
104 const VALUE err_info;
105 const VALUE catch_table_ary; /* Array */
106
107 /* Mirror fields from ISEQ_BODY so they are accessible during iseq setup */
108 unsigned int iseq_size;
109 VALUE *iseq_encoded; /* half-encoded iseq (insn addr and operands) */
110 bool is_single_mark_bit; /* identifies whether mark bits are single or a list */
111
112 union {
113 iseq_bits_t * list; /* Find references for GC */
114 iseq_bits_t single;
115 } mark_bits;
116
117 /* GC is not needed */
118 struct iseq_label_data *start_label;
119 struct iseq_label_data *end_label;
120 struct iseq_label_data *redo_label;
121 const rb_iseq_t *current_block;
122 struct iseq_compile_data_ensure_node_stack *ensure_node_stack;
123 struct {
124 struct iseq_compile_data_storage *storage_head;
125 struct iseq_compile_data_storage *storage_current;
126 } node;
127 struct {
128 struct iseq_compile_data_storage *storage_head;
129 struct iseq_compile_data_storage *storage_current;
130 } insn;
131 bool in_rescue;
132 bool in_masgn;
133 int loopval_popped; /* used by NODE_BREAK */
134 int last_line;
135 int label_no;
136 int node_level;
137 int isolated_depth;
138 unsigned int ci_index;
139 unsigned int ic_index;
140 const rb_compile_option_t *option;
141 struct rb_id_table *ivar_cache_table;
142 const struct rb_builtin_function *builtin_function_table;
143 const NODE *root_node;
144 bool catch_except_p; // If a frame of this ISeq may catch exception, set true.
145#if OPT_SUPPORT_JOKE
146 st_table *labels_table;
147#endif
148};
149
150static inline struct iseq_compile_data *
151ISEQ_COMPILE_DATA(const rb_iseq_t *iseq)
152{
153 if (iseq->flags & ISEQ_USE_COMPILE_DATA) {
154 return iseq->aux.compile_data;
155 }
156 else {
157 return NULL;
158 }
159}
160
161static inline void
162ISEQ_COMPILE_DATA_ALLOC(rb_iseq_t *iseq)
163{
164 iseq->aux.compile_data = ZALLOC(struct iseq_compile_data);
165 iseq->flags |= ISEQ_USE_COMPILE_DATA;
166}
167
168static inline void
169ISEQ_COMPILE_DATA_CLEAR(rb_iseq_t *iseq)
170{
171 iseq->flags &= ~ISEQ_USE_COMPILE_DATA;
172 iseq->aux.compile_data = NULL;
173}
174
175static inline rb_iseq_t *
176iseq_imemo_alloc(void)
177{
178 rb_iseq_t *iseq = IMEMO_NEW(rb_iseq_t, imemo_iseq, 0);
179
180 // Clear out the whole iseq except for the flags.
181 memset((char *)iseq + sizeof(VALUE), 0, sizeof(rb_iseq_t) - sizeof(VALUE));
182
183 return iseq;
184}
185
186VALUE rb_iseq_ibf_dump(const rb_iseq_t *iseq, VALUE opt);
187void rb_ibf_load_iseq_complete(rb_iseq_t *iseq);
188const rb_iseq_t *rb_iseq_ibf_load(VALUE str);
189const rb_iseq_t *rb_iseq_ibf_load_bytes(const char *cstr, size_t);
190VALUE rb_iseq_ibf_load_extra_data(VALUE str);
191void rb_iseq_init_trace(rb_iseq_t *iseq);
192int 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);
193int rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval);
194const rb_iseq_t *rb_iseq_load_iseq(VALUE fname);
195const rb_iseq_t *rb_iseq_compile_iseq(VALUE str, VALUE fname);
196int rb_iseq_opt_frozen_string_literal(void);
197
198#if VM_INSN_INFO_TABLE_IMPL == 2
199unsigned int *rb_iseq_insns_info_decode_positions(const struct rb_iseq_constant_body *body);
200#endif
201
202int rb_vm_insn_addr2opcode(const void *addr);
203
204RUBY_SYMBOL_EXPORT_BEGIN
205
206/* compile.c */
207VALUE rb_iseq_compile_node(rb_iseq_t *iseq, const NODE *node);
208VALUE rb_iseq_compile_callback(rb_iseq_t *iseq, const struct rb_iseq_new_with_callback_callback_func * ifunc);
209VALUE *rb_iseq_original_iseq(const rb_iseq_t *iseq);
210void rb_iseq_build_from_ary(rb_iseq_t *iseq, VALUE misc,
211 VALUE locals, VALUE args,
212 VALUE exception, VALUE body);
213void rb_iseq_mark_and_move_insn_storage(struct iseq_compile_data_storage *arena);
214
215VALUE rb_iseq_load(VALUE data, VALUE parent, VALUE opt);
216VALUE rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc);
217unsigned int rb_iseq_line_no(const rb_iseq_t *iseq, size_t pos);
218#ifdef USE_ISEQ_NODE_ID
219int rb_iseq_node_id(const rb_iseq_t *iseq, size_t pos);
220#endif
221void rb_iseq_trace_set(const rb_iseq_t *iseq, rb_event_flag_t turnon_events);
222void rb_iseq_trace_set_all(rb_event_flag_t turnon_events);
223void rb_iseq_insns_info_encode_positions(const rb_iseq_t *iseq);
224
225struct rb_iseq_constant_body *rb_iseq_constant_body_alloc(void);
226VALUE rb_iseqw_new(const rb_iseq_t *iseq);
227const rb_iseq_t *rb_iseqw_to_iseq(VALUE iseqw);
228
229VALUE rb_iseq_absolute_path(const rb_iseq_t *iseq); /* obsolete */
230int rb_iseq_from_eval_p(const rb_iseq_t *iseq);
231VALUE rb_iseq_type(const rb_iseq_t *iseq);
232VALUE rb_iseq_label(const rb_iseq_t *iseq);
233VALUE rb_iseq_base_label(const rb_iseq_t *iseq);
234VALUE rb_iseq_first_lineno(const rb_iseq_t *iseq);
235VALUE rb_iseq_method_name(const rb_iseq_t *iseq);
236void rb_iseq_code_location(const rb_iseq_t *iseq, int *first_lineno, int *first_column, int *last_lineno, int *last_column);
237
238void rb_iseq_remove_coverage_all(void);
239
240/* proc.c */
241const rb_iseq_t *rb_method_iseq(VALUE body);
242const rb_iseq_t *rb_proc_get_iseq(VALUE proc, int *is_proc);
243
245 unsigned int inline_const_cache: 1;
246 unsigned int peephole_optimization: 1;
247 unsigned int tailcall_optimization: 1;
248 unsigned int specialized_instruction: 1;
249 unsigned int operands_unification: 1;
250 unsigned int instructions_unification: 1;
251 signed int frozen_string_literal: 2; /* -1: not specified, 0: false, 1: true */
252 unsigned int debug_frozen_string_literal: 1;
253 unsigned int coverage_enabled: 1;
254 int debug_level;
255};
256
258 int line_no;
259#ifdef USE_ISEQ_NODE_ID
260 int node_id;
261#endif
262 rb_event_flag_t events;
263};
264
265/*
266 * iseq type:
267 * CATCH_TYPE_RESCUE, CATCH_TYPE_ENSURE:
268 * use iseq as continuation.
269 *
270 * CATCH_TYPE_BREAK (iter):
271 * use iseq as key.
272 *
273 * CATCH_TYPE_BREAK (while), CATCH_TYPE_RETRY,
274 * CATCH_TYPE_REDO, CATCH_TYPE_NEXT:
275 * NULL.
276 */
277enum rb_catch_type {
278 CATCH_TYPE_RESCUE = INT2FIX(1),
279 CATCH_TYPE_ENSURE = INT2FIX(2),
280 CATCH_TYPE_RETRY = INT2FIX(3),
281 CATCH_TYPE_BREAK = INT2FIX(4),
282 CATCH_TYPE_REDO = INT2FIX(5),
283 CATCH_TYPE_NEXT = INT2FIX(6)
284};
285
287 enum rb_catch_type type;
288 rb_iseq_t *iseq;
289
290 unsigned int start;
291 unsigned int end;
292 unsigned int cont;
293 unsigned int sp;
294};
295
296RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_BEGIN()
298 unsigned int size;
299 struct iseq_catch_table_entry entries[FLEX_ARY_LEN];
300} RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_END();
301
302static inline int
303iseq_catch_table_bytes(int n)
304{
305 enum {
306 catch_table_entry_size = sizeof(struct iseq_catch_table_entry),
307 catch_table_entries_max = (INT_MAX - offsetof(struct iseq_catch_table, entries)) / catch_table_entry_size
308 };
309 if (n > catch_table_entries_max) rb_fatal("too large iseq_catch_table - %d", n);
310 return (int)(offsetof(struct iseq_catch_table, entries) +
311 n * catch_table_entry_size);
312}
313
314#define INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE (512)
315
317 struct iseq_compile_data_storage *next;
318 unsigned int pos;
319 unsigned int size;
320 char buff[FLEX_ARY_LEN];
321};
322
323/* defined? */
324
325enum defined_type {
326 DEFINED_NOT_DEFINED,
327 DEFINED_NIL = 1,
328 DEFINED_IVAR,
329 DEFINED_LVAR,
330 DEFINED_GVAR,
331 DEFINED_CVAR,
332 DEFINED_CONST,
333 DEFINED_METHOD,
334 DEFINED_YIELD,
335 DEFINED_ZSUPER,
336 DEFINED_SELF,
337 DEFINED_TRUE,
338 DEFINED_FALSE,
339 DEFINED_ASGN,
340 DEFINED_EXPR,
341 DEFINED_REF,
342 DEFINED_FUNC,
343 DEFINED_CONST_FROM
344};
345
346VALUE rb_iseq_defined_string(enum defined_type type);
347
348/* vm.c */
349VALUE rb_iseq_local_variables(const rb_iseq_t *iseq);
350
351attr_index_t rb_estimate_iv_count(VALUE klass, const rb_iseq_t * initialize_iseq);
352
353void rb_free_encoded_insn_data(void);
354
355RUBY_SYMBOL_EXPORT_END
356
357#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:402
#define ALLOC_N
Old name of RB_ALLOC_N.
Definition memory.h:399
const int ruby_api_version[3]
API versions, in { major, minor, teeny } order.
Definition version.c:53
VALUE type(ANYARGS)
ANYARGS-ed function type.
Definition iseq.h:286
Definition iseq.h:257
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