Ruby 4.1.0dev (2026-09-16 revision 1e16b651ca2df7eb850f57b65bb87184f9376d73)
iseq.h (1e16b651ca2df7eb850f57b65bb87184f9376d73)
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/coverage.h"
14#include "internal/gc.h"
15#include "shape.h"
16#include "vm_core.h"
17#include "prism_compile.h"
18
20#define ISEQ_MAJOR_VERSION ((unsigned int)ruby_api_version[0])
21#define ISEQ_MINOR_VERSION ((unsigned int)ruby_api_version[1])
22
23#define ISEQ_MBITS_SIZE sizeof(iseq_bits_t)
24#define ISEQ_MBITS_BITLENGTH (ISEQ_MBITS_SIZE * CHAR_BIT)
25#define ISEQ_MBITS_SET(buf, i) (buf[(i) / ISEQ_MBITS_BITLENGTH] |= ((iseq_bits_t)1 << ((i) % ISEQ_MBITS_BITLENGTH)))
26#define ISEQ_MBITS_SET_P(buf, i) ((buf[(i) / ISEQ_MBITS_BITLENGTH] >> ((i) % ISEQ_MBITS_BITLENGTH)) & 0x1)
27#define ISEQ_MBITS_BUFLEN(size) roomof(size, ISEQ_MBITS_BITLENGTH)
28
29#define ISEQ_LVAR_STATE_BITS 2
30#define ISEQ_LVAR_STATES_PER_BYTE (CHAR_BIT / ISEQ_LVAR_STATE_BITS)
31#define ISEQ_LVAR_STATES_BUFLEN(size) roomof(size, ISEQ_LVAR_STATES_PER_BYTE)
32#define ISEQ_LVAR_STATES_EMBED_P(size) (ISEQ_LVAR_STATES_BUFLEN(size) <= sizeof(uint8_t *))
33STATIC_ASSERT(lvar_state_fits_in_iseq_lvar_state_bits, lvar_reassigned < (1 << ISEQ_LVAR_STATE_BITS));
34
35static inline enum lvar_state
36iseq_lvar_state_get(const uint8_t *buf, unsigned int i)
37{
38 const unsigned int shift = (i % ISEQ_LVAR_STATES_PER_BYTE) * ISEQ_LVAR_STATE_BITS;
39 return (enum lvar_state)((buf[i / ISEQ_LVAR_STATES_PER_BYTE] >> shift) & ((1 << ISEQ_LVAR_STATE_BITS) - 1));
40}
41
42static inline void
43iseq_lvar_state_set(uint8_t *buf, unsigned int i, enum lvar_state state)
44{
45 uint8_t *const byte = &buf[i / ISEQ_LVAR_STATES_PER_BYTE];
46 const unsigned int shift = (i % ISEQ_LVAR_STATES_PER_BYTE) * ISEQ_LVAR_STATE_BITS;
47 *byte = (*byte & ~(((1 << ISEQ_LVAR_STATE_BITS) - 1) << shift)) | ((uint8_t)state << shift);
48}
49
50#ifndef USE_ISEQ_NODE_ID
51#define USE_ISEQ_NODE_ID 1
52#endif
53
54#ifndef rb_iseq_t
55typedef struct rb_iseq_struct rb_iseq_t;
56#define rb_iseq_t rb_iseq_t
57#endif
58
59extern const ID rb_iseq_shared_exc_local_tbl[];
60
61static inline bool
62iseq_has_lvar_states_p(const struct rb_iseq_constant_body *body)
63{
64 return body->local_table_size > 0 && body->local_table != rb_iseq_shared_exc_local_tbl;
65}
66
67static inline uint8_t *
68iseq_lvar_states(const struct rb_iseq_constant_body *body)
69{
70 if (ISEQ_LVAR_STATES_EMBED_P(body->local_table_size)) {
71 return (uint8_t *)body->lvar_states.single;
72 }
73 else {
74 return body->lvar_states.list;
75 }
76}
77
78/* Ensure body->variable is allocated, returning the struct. */
79struct rb_iseq_variable *rb_iseq_variable_ensure(rb_iseq_t *iseq);
80
81static inline struct rb_iseq_variable *
82ISEQ_BODY_VARIABLE(const rb_iseq_t *iseq)
83{
84 return ISEQ_BODY(iseq)->variable;
85}
86
87/* NULL-safe read accessors for body->variable fields. */
88static inline VALUE
89ISEQ_BODY_VARIABLE_SCRIPT_LINES(const rb_iseq_t *iseq)
90{
91 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
92 return v ? v->script_lines : Qnil;
93}
94
95static inline VALUE
96ISEQ_BODY_VARIABLE_COVERAGE(const rb_iseq_t *iseq)
97{
98 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
99 return v ? v->coverage : Qfalse;
100}
101
102static inline VALUE
103ISEQ_BODY_VARIABLE_PC2BRANCHINDEX(const rb_iseq_t *iseq)
104{
105 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
106 return v ? v->pc2branchindex : Qfalse;
107}
108
109static inline rb_snum_t
110ISEQ_BODY_VARIABLE_FLIP_CNT(const rb_iseq_t *iseq)
111{
112 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
113 return v ? v->flip_count : 0;
114}
115
116static inline VALUE *
117ISEQ_BODY_VARIABLE_ORIGINAL_ISEQ(const rb_iseq_t *iseq)
118{
119 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
120 return v ? v->original_iseq : NULL;
121}
122
123/* Write accessors (lazily allocate variable as needed). */
124void rb_iseq_coverage_set(rb_iseq_t *iseq, VALUE cov);
125void rb_iseq_pc2branchindex_set(rb_iseq_t *iseq, VALUE h);
126rb_snum_t rb_iseq_flip_cnt_increment(const rb_iseq_t *iseq);
127
128/* Short macros for reading variable fields. */
129#define ISEQ_VARIABLE(iseq) ISEQ_BODY_VARIABLE(iseq)
130#define ISEQ_SCRIPT_LINES(iseq) ISEQ_BODY_VARIABLE_SCRIPT_LINES(iseq)
131#define ISEQ_COVERAGE(iseq) ISEQ_BODY_VARIABLE_COVERAGE(iseq)
132#define ISEQ_COVERAGE_SET(iseq, cov) rb_iseq_coverage_set(iseq, cov)
133#define ISEQ_LINE_COVERAGE(iseq) RARRAY_AREF(ISEQ_COVERAGE(iseq), COVERAGE_INDEX_LINES)
134#define ISEQ_BRANCH_COVERAGE(iseq) RARRAY_AREF(ISEQ_COVERAGE(iseq), COVERAGE_INDEX_BRANCHES)
135
136#define ISEQ_PC2BRANCHINDEX(iseq) ISEQ_BODY_VARIABLE_PC2BRANCHINDEX(iseq)
137#define ISEQ_PC2BRANCHINDEX_SET(iseq,h) rb_iseq_pc2branchindex_set(iseq, h)
138
139#define ISEQ_FLIP_CNT(iseq) ISEQ_BODY_VARIABLE_FLIP_CNT(iseq)
140#define ISEQ_FLIP_CNT_INCREMENT(iseq) rb_iseq_flip_cnt_increment(iseq)
141#define ISEQ_ORIGINAL_ISEQ(iseq) ISEQ_BODY_VARIABLE_ORIGINAL_ISEQ(iseq)
142
143#define ISEQ_FROZEN_STRING_LITERAL_ENABLED 1
144#define ISEQ_FROZEN_STRING_LITERAL_DISABLED 0
145#define ISEQ_FROZEN_STRING_LITERAL_UNSET -1
146
147static inline void
148ISEQ_ORIGINAL_ISEQ_CLEAR(const rb_iseq_t *iseq)
149{
150 struct rb_iseq_variable *v = ISEQ_BODY_VARIABLE(iseq);
151 if (v) {
152 VALUE *ptr = v->original_iseq;
153 if (ptr) {
154 v->original_iseq = NULL;
155 SIZED_FREE_N(ptr, ISEQ_BODY(iseq)->iseq_size);
156 }
157 }
158}
159
160#define ISEQ_TRACE_EVENTS (RUBY_EVENT_LINE | \
161 RUBY_EVENT_CLASS | \
162 RUBY_EVENT_END | \
163 RUBY_EVENT_CALL | \
164 RUBY_EVENT_RETURN| \
165 RUBY_EVENT_C_CALL| \
166 RUBY_EVENT_C_RETURN | \
167 RUBY_EVENT_B_CALL | \
168 RUBY_EVENT_B_RETURN | \
169 RUBY_EVENT_RESCUE | \
170 RUBY_EVENT_COVERAGE_LINE| \
171 RUBY_EVENT_COVERAGE_BRANCH)
172
173#define ISEQ_NOT_LOADED_YET IMEMO_FL_USER1
174#define ISEQ_USE_COMPILE_DATA IMEMO_FL_USER2
175#define ISEQ_TRANSLATED IMEMO_FL_USER3
176/* set on every iseq of a subtree copied for Proc#refined */
177#define ISEQ_REFINED_COPY IMEMO_FL_USER4
178
179#define ISEQ_EXECUTABLE_P(iseq) (FL_TEST_RAW(((VALUE)iseq), ISEQ_NOT_LOADED_YET | ISEQ_USE_COMPILE_DATA) == 0)
180
182 /* GC is needed */
183 const VALUE err_info;
184 const VALUE catch_table_ary; /* Array */
185
186 /* Mirror fields from ISEQ_BODY so they are accessible during iseq setup */
187 unsigned int iseq_size;
188 VALUE *iseq_encoded; /* half-encoded iseq (insn addr and operands) */
189 bool is_single_mark_bit; /* identifies whether mark bits are single or a list */
190
191 union {
192 iseq_bits_t * list; /* Find references for GC */
193 iseq_bits_t single;
194 } mark_bits;
195
196 /* GC is not needed */
197 struct iseq_label_data *start_label;
198 struct iseq_label_data *end_label;
199 struct iseq_label_data *redo_label;
200 const rb_iseq_t *current_block;
201 struct iseq_compile_data_ensure_node_stack *ensure_node_stack;
202 struct {
203 struct iseq_compile_data_storage *storage_head;
204 struct iseq_compile_data_storage *storage_current;
205 } node;
206 struct {
207 struct iseq_compile_data_storage *storage_head;
208 struct iseq_compile_data_storage *storage_current;
209 } insn;
210 bool in_rescue;
211 int loopval_popped; /* used by NODE_BREAK */
212 int last_line;
213 int label_no;
214 int node_level;
215 int isolated_depth;
216 unsigned int ci_index;
217 unsigned int ic_index;
218 const rb_compile_option_t *option;
219 struct rb_id_table *ivar_cache_table;
220 const struct rb_builtin_function *builtin_function_table;
221 const NODE *root_node;
222 bool catch_except_p; // If a frame of this ISeq may catch exception, set true.
223#if OPT_SUPPORT_JOKE
224 st_table *labels_table;
225#endif
226};
227
228static inline struct iseq_compile_data *
229ISEQ_COMPILE_DATA(const rb_iseq_t *iseq)
230{
231 if (iseq->flags & ISEQ_USE_COMPILE_DATA) {
232 return iseq->aux.compile_data;
233 }
234 else {
235 return NULL;
236 }
237}
238
239static inline void
240ISEQ_COMPILE_DATA_ALLOC(rb_iseq_t *iseq)
241{
242 iseq->aux.compile_data = ZALLOC(struct iseq_compile_data);
243 iseq->flags |= ISEQ_USE_COMPILE_DATA;
244}
245
246static inline void
247ISEQ_COMPILE_DATA_CLEAR(rb_iseq_t *iseq)
248{
249 iseq->flags &= ~ISEQ_USE_COMPILE_DATA;
250 iseq->aux.compile_data = NULL;
251}
252
253static inline rb_iseq_t *
254iseq_imemo_alloc(void)
255{
256 rb_iseq_t *iseq = SHAREABLE_IMEMO_NEW(rb_iseq_t, imemo_iseq, 0);
257
258 // Clear out the whole iseq except for the flags.
259 memset((char *)iseq + sizeof(VALUE), 0, sizeof(rb_iseq_t) - sizeof(VALUE));
260
261 return iseq;
262}
263
264VALUE rb_iseq_ibf_dump(const rb_iseq_t *iseq, VALUE opt);
265void rb_ibf_load_iseq_complete(rb_iseq_t *iseq);
266const rb_iseq_t *rb_iseq_ibf_load(VALUE str);
267const rb_iseq_t *rb_iseq_ibf_load_bytes(const char *cstr, size_t);
268VALUE rb_iseq_ibf_load_extra_data(VALUE str);
269const rb_iseq_t *rb_iseq_dup_with_independent_caches(const rb_iseq_t *iseq);
270void rb_iseq_init_trace(rb_iseq_t *iseq);
271int 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);
272int rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval, rb_ractor_t *r);
273const rb_iseq_t *rb_iseq_load_iseq(VALUE fname);
274const rb_iseq_t *rb_iseq_compile_iseq(VALUE str, VALUE fname);
275int rb_iseq_opt_frozen_string_literal(void);
276rb_hook_list_t *rb_iseq_local_hooks(const rb_iseq_t *iseq, rb_ractor_t *r, bool create);
277
278
279#if VM_INSN_INFO_TABLE_IMPL == 2
280unsigned int *rb_iseq_insns_info_decode_positions(const struct rb_iseq_constant_body *body);
281#endif
282
283int rb_vm_insn_addr2opcode(const void *addr);
284
285RUBY_SYMBOL_EXPORT_BEGIN
286
287/* compile.c */
288VALUE rb_iseq_compile_node(rb_iseq_t *iseq, const NODE *node);
289VALUE rb_iseq_compile_callback(rb_iseq_t *iseq, const struct rb_iseq_new_with_callback_callback_func * ifunc);
290VALUE *rb_iseq_original_iseq(const rb_iseq_t *iseq);
291void rb_iseq_build_from_ary(rb_iseq_t *iseq, VALUE misc,
292 VALUE locals, VALUE args,
293 VALUE exception, VALUE body);
294void rb_iseq_mark_and_move_insn_storage(struct iseq_compile_data_storage *arena);
295
296VALUE rb_iseq_load(VALUE data, VALUE parent, VALUE opt);
297VALUE rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc);
298unsigned int rb_iseq_line_no(const rb_iseq_t *iseq, size_t pos);
299#ifdef USE_ISEQ_NODE_ID
300int rb_iseq_node_id(const rb_iseq_t *iseq, size_t pos);
301#endif
302void rb_iseq_trace_set(const rb_iseq_t *iseq, rb_event_flag_t turnon_events);
303void rb_iseq_trace_set_all(rb_event_flag_t turnon_events);
304void rb_iseq_insns_info_encode_positions(const rb_iseq_t *iseq);
305
306struct rb_iseq_constant_body *rb_iseq_constant_body_alloc(void);
307VALUE rb_iseqw_new(const rb_iseq_t *iseq);
308const rb_iseq_t *rb_iseqw_to_iseq(VALUE iseqw);
309
310VALUE rb_iseq_absolute_path(const rb_iseq_t *iseq); /* obsolete */
311int rb_iseq_from_eval_p(const rb_iseq_t *iseq);
312VALUE rb_iseq_type(const rb_iseq_t *iseq);
313VALUE rb_iseq_label(const rb_iseq_t *iseq);
314VALUE rb_iseq_base_label(const rb_iseq_t *iseq);
315VALUE rb_iseq_first_lineno(const rb_iseq_t *iseq);
316VALUE rb_iseq_method_name(const rb_iseq_t *iseq);
317void rb_iseq_code_location(const rb_iseq_t *iseq, int *first_lineno, int *first_column, int *last_lineno, int *last_column);
318
319void rb_iseq_remove_coverage_all(void);
320
321/* proc.c */
322const rb_iseq_t *rb_method_iseq(VALUE body);
323const rb_iseq_t *rb_proc_get_iseq(VALUE proc, int *is_proc);
324
326 unsigned int inline_const_cache: 1;
327 unsigned int peephole_optimization: 1;
328 unsigned int tailcall_optimization: 1;
329 unsigned int specialized_instruction: 1;
330 unsigned int operands_unification: 1;
331 unsigned int instructions_unification: 1;
332 signed int frozen_string_literal: 2; /* -1: not specified, 0: false, 1: true */
333 unsigned int debug_frozen_string_literal: 1;
334 unsigned int coverage_enabled: 1;
335 int debug_level;
336};
337
339 int line_no;
340#ifdef USE_ISEQ_NODE_ID
341 int node_id;
342#endif
343 rb_event_flag_t events;
344};
345
346/*
347 * iseq type:
348 * CATCH_TYPE_RESCUE, CATCH_TYPE_ENSURE:
349 * use iseq as continuation.
350 *
351 * CATCH_TYPE_BREAK (iter):
352 * use iseq as key.
353 *
354 * CATCH_TYPE_BREAK (while), CATCH_TYPE_RETRY,
355 * CATCH_TYPE_REDO, CATCH_TYPE_NEXT:
356 * NULL.
357 */
358enum rb_catch_type {
359 CATCH_TYPE_RESCUE = INT2FIX(1),
360 CATCH_TYPE_ENSURE = INT2FIX(2),
361 CATCH_TYPE_RETRY = INT2FIX(3),
362 CATCH_TYPE_BREAK = INT2FIX(4),
363 CATCH_TYPE_REDO = INT2FIX(5),
364 CATCH_TYPE_NEXT = INT2FIX(6)
365};
366
368 enum rb_catch_type type;
369 rb_iseq_t *iseq;
370
371 unsigned int start;
372 unsigned int end;
373 unsigned int cont;
374 unsigned int sp;
375};
376
377RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_BEGIN()
379 unsigned int size;
380 struct iseq_catch_table_entry entries[FLEX_ARY_LEN];
381} RBIMPL_ATTR_PACKED_STRUCT_UNALIGNED_END();
382
383static inline int
384iseq_catch_table_bytes(int n)
385{
386 enum {
387 catch_table_entry_size = sizeof(struct iseq_catch_table_entry),
388 catch_table_entries_max = (INT_MAX - offsetof(struct iseq_catch_table, entries)) / catch_table_entry_size
389 };
390 if (n > catch_table_entries_max) rb_fatal("too large iseq_catch_table - %d", n);
391 return (int)(offsetof(struct iseq_catch_table, entries) +
392 n * catch_table_entry_size);
393}
394
395#define INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE (512)
396
398 struct iseq_compile_data_storage *next;
399 unsigned int pos;
400 unsigned int size;
401 char buff[FLEX_ARY_LEN];
402};
403
404/* defined? */
405
406enum defined_type {
407 DEFINED_NOT_DEFINED,
408 DEFINED_NIL = 1,
409 DEFINED_IVAR,
410 DEFINED_LVAR,
411 DEFINED_GVAR,
412 DEFINED_CVAR,
413 DEFINED_CONST,
414 DEFINED_METHOD,
415 DEFINED_YIELD,
416 DEFINED_ZSUPER,
417 DEFINED_SELF,
418 DEFINED_TRUE,
419 DEFINED_FALSE,
420 DEFINED_ASGN,
421 DEFINED_EXPR,
422 DEFINED_REF,
423 DEFINED_FUNC,
424 DEFINED_CONST_FROM
425};
426
427VALUE rb_iseq_defined_string(enum defined_type type);
428
429/* vm.c */
430VALUE rb_iseq_local_variables(const rb_iseq_t *iseq);
431
432attr_index_t rb_estimate_iv_count(VALUE klass, const rb_iseq_t * initialize_iseq);
433
434void rb_free_encoded_insn_data(void);
435
436RUBY_SYMBOL_EXPORT_END
437
438#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 Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
const int ruby_api_version[3]
API versions, in { major, minor, teeny } order.
Definition version.c:55
VALUE type(ANYARGS)
ANYARGS-ed function type.
Definition iseq.h:367
Definition iseq.h:338
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