debase-ruby_core_source 3.2.0 → 3.2.2

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/regparse.h

@@ -0,0 +1,370 @@
+#ifndef ONIGMO_REGPARSE_H
+#define ONIGMO_REGPARSE_H
+/**********************************************************************
+  regparse.h -  Onigmo (Oniguruma-mod) (regular expression library)
+**********************************************************************/
+/*-
+ * Copyright (c) 2002-2007  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+ * Copyright (c) 2011-2016  K.Takata  <kentkt AT csc DOT jp>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+#include "regint.h"
+
+RUBY_SYMBOL_EXPORT_BEGIN
+
+/* node type */
+#define NT_STR         0
+#define NT_CCLASS      1
+#define NT_CTYPE       2
+#define NT_CANY        3
+#define NT_BREF        4
+#define NT_QTFR        5
+#define NT_ENCLOSE     6
+#define NT_ANCHOR      7
+#define NT_LIST        8
+#define NT_ALT         9
+#define NT_CALL       10
+
+/* node type bit */
+#define NTYPE2BIT(type)      (1<<(type))
+
+#define BIT_NT_STR        NTYPE2BIT(NT_STR)
+#define BIT_NT_CCLASS     NTYPE2BIT(NT_CCLASS)
+#define BIT_NT_CTYPE      NTYPE2BIT(NT_CTYPE)
+#define BIT_NT_CANY       NTYPE2BIT(NT_CANY)
+#define BIT_NT_BREF       NTYPE2BIT(NT_BREF)
+#define BIT_NT_QTFR       NTYPE2BIT(NT_QTFR)
+#define BIT_NT_ENCLOSE    NTYPE2BIT(NT_ENCLOSE)
+#define BIT_NT_ANCHOR     NTYPE2BIT(NT_ANCHOR)
+#define BIT_NT_LIST       NTYPE2BIT(NT_LIST)
+#define BIT_NT_ALT        NTYPE2BIT(NT_ALT)
+#define BIT_NT_CALL       NTYPE2BIT(NT_CALL)
+
+#define IS_NODE_TYPE_SIMPLE(type) \
+  ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\
+                       BIT_NT_CANY | BIT_NT_BREF)) != 0)
+
+#define NTYPE(node)             ((node)->u.base.type)
+#define SET_NTYPE(node, ntype) \
+    do { \
+	int value = ntype; \
+	memcpy(&((node)->u.base.type), &value, sizeof(int)); \
+    } while (0)
+
+#define NSTR(node)         (&((node)->u.str))
+#define NCCLASS(node)      (&((node)->u.cclass))
+#define NCTYPE(node)       (&((node)->u.ctype))
+#define NBREF(node)        (&((node)->u.bref))
+#define NQTFR(node)        (&((node)->u.qtfr))
+#define NENCLOSE(node)     (&((node)->u.enclose))
+#define NANCHOR(node)      (&((node)->u.anchor))
+#define NCONS(node)        (&((node)->u.cons))
+#define NCALL(node)        (&((node)->u.call))
+
+#define NCAR(node)         (NCONS(node)->car)
+#define NCDR(node)         (NCONS(node)->cdr)
+
+
+
+#define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML)
+#define ANCHOR_END_BUF_MASK      (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)
+
+#define ENCLOSE_MEMORY           (1<<0)
+#define ENCLOSE_OPTION           (1<<1)
+#define ENCLOSE_STOP_BACKTRACK   (1<<2)
+#define ENCLOSE_CONDITION        (1<<3)
+#define ENCLOSE_ABSENT           (1<<4)
+
+#define NODE_STR_MARGIN         16
+#define NODE_STR_BUF_SIZE       24  /* sizeof(CClassNode) - sizeof(int)*4 */
+#define NODE_BACKREFS_SIZE       6
+
+#define NSTR_RAW                (1<<0) /* by backslashed number */
+#define NSTR_AMBIG              (1<<1)
+#define NSTR_DONT_GET_OPT_INFO  (1<<2)
+
+#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s)
+#define NSTRING_SET_RAW(node)          (node)->u.str.flag |= NSTR_RAW
+#define NSTRING_CLEAR_RAW(node)        (node)->u.str.flag &= ~NSTR_RAW
+#define NSTRING_SET_AMBIG(node)        (node)->u.str.flag |= NSTR_AMBIG
+#define NSTRING_SET_DONT_GET_OPT_INFO(node) \
+  (node)->u.str.flag |= NSTR_DONT_GET_OPT_INFO
+#define NSTRING_IS_RAW(node)          (((node)->u.str.flag & NSTR_RAW)   != 0)
+#define NSTRING_IS_AMBIG(node)        (((node)->u.str.flag & NSTR_AMBIG) != 0)
+#define NSTRING_IS_DONT_GET_OPT_INFO(node) \
+  (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0)
+
+#define BACKREFS_P(br) \
+  (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
+
+#define NQ_TARGET_ISNOT_EMPTY     0
+#define NQ_TARGET_IS_EMPTY        1
+#define NQ_TARGET_IS_EMPTY_MEM    2
+#define NQ_TARGET_IS_EMPTY_REC    3
+
+/* status bits */
+#define NST_MIN_FIXED             (1<<0)
+#define NST_MAX_FIXED             (1<<1)
+#define NST_CLEN_FIXED            (1<<2)
+#define NST_MARK1                 (1<<3)
+#define NST_MARK2                 (1<<4)
+#define NST_MEM_BACKREFED         (1<<5)
+#define NST_STOP_BT_SIMPLE_REPEAT (1<<6)
+#define NST_RECURSION             (1<<7)
+#define NST_CALLED                (1<<8)
+#define NST_ADDR_FIXED            (1<<9)
+#define NST_NAMED_GROUP           (1<<10)
+#define NST_NAME_REF              (1<<11)
+#define NST_IN_REPEAT             (1<<12) /* STK_REPEAT is nested in stack. */
+#define NST_NEST_LEVEL            (1<<13)
+#define NST_BY_NUMBER             (1<<14) /* {n,m} */
+
+#define SET_ENCLOSE_STATUS(node,f)      (node)->u.enclose.state |=  (f)
+#define CLEAR_ENCLOSE_STATUS(node,f)    (node)->u.enclose.state &= ~(f)
+
+#define IS_ENCLOSE_CALLED(en)          (((en)->state & NST_CALLED)        != 0)
+#define IS_ENCLOSE_ADDR_FIXED(en)      (((en)->state & NST_ADDR_FIXED)    != 0)
+#define IS_ENCLOSE_RECURSION(en)       (((en)->state & NST_RECURSION)     != 0)
+#define IS_ENCLOSE_MARK1(en)           (((en)->state & NST_MARK1)         != 0)
+#define IS_ENCLOSE_MARK2(en)           (((en)->state & NST_MARK2)         != 0)
+#define IS_ENCLOSE_MIN_FIXED(en)       (((en)->state & NST_MIN_FIXED)     != 0)
+#define IS_ENCLOSE_MAX_FIXED(en)       (((en)->state & NST_MAX_FIXED)     != 0)
+#define IS_ENCLOSE_CLEN_FIXED(en)      (((en)->state & NST_CLEN_FIXED)    != 0)
+#define IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(en) \
+    (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0)
+#define IS_ENCLOSE_NAMED_GROUP(en)     (((en)->state & NST_NAMED_GROUP)   != 0)
+#define IS_ENCLOSE_NAME_REF(en)        (((en)->state & NST_NAME_REF)      != 0)
+
+#define SET_CALL_RECURSION(node)       (node)->u.call.state |= NST_RECURSION
+#define IS_CALL_RECURSION(cn)          (((cn)->state & NST_RECURSION)  != 0)
+#define IS_CALL_NAME_REF(cn)           (((cn)->state & NST_NAME_REF)   != 0)
+#define IS_BACKREF_NAME_REF(bn)        (((bn)->state & NST_NAME_REF)   != 0)
+#define IS_BACKREF_NEST_LEVEL(bn)      (((bn)->state & NST_NEST_LEVEL) != 0)
+#define IS_QUANTIFIER_IN_REPEAT(qn)    (((qn)->state & NST_IN_REPEAT)  != 0)
+#define IS_QUANTIFIER_BY_NUMBER(qn)    (((qn)->state & NST_BY_NUMBER)  != 0)
+
+#define CALLNODE_REFNUM_UNDEF  -1
+
+typedef struct {
+  NodeBase base;
+  UChar* s;
+  UChar* end;
+  unsigned int flag;
+  int    capa;    /* (allocated size - 1) or 0: use buf[] */
+  UChar  buf[NODE_STR_BUF_SIZE];
+} StrNode;
+
+typedef struct {
+  NodeBase base;
+  int state;
+  struct _Node* target;
+  int lower;
+  int upper;
+  int greedy;
+  int target_empty_info;
+  struct _Node* head_exact;
+  struct _Node* next_head_exact;
+  int is_referred;     /* include called node. don't eliminate even if {0} */
+#ifdef USE_COMBINATION_EXPLOSION_CHECK
+  int comb_exp_check_num;  /* 1,2,3...: check,  0: no check  */
+#endif
+} QtfrNode;
+
+typedef struct {
+  NodeBase base;
+  int state;
+  int type;
+  int regnum;
+  OnigOptionType option;
+  AbsAddrType    call_addr;
+  struct _Node*  target;
+  /* for multiple call reference */
+  OnigDistance min_len; /* min length (byte) */
+  OnigDistance max_len; /* max length (byte) */
+  int char_len;         /* character length  */
+  int opt_count;        /* referenced count in optimize_node_left() */
+} EncloseNode;
+
+#ifdef USE_SUBEXP_CALL
+
+typedef struct {
+  int           offset;
+  struct _Node* target;
+} UnsetAddr;
+
+typedef struct {
+  int        num;
+  int        alloc;
+  UnsetAddr* us;
+} UnsetAddrList;
+
+typedef struct {
+  NodeBase base;
+  int     state;
+  int     group_num;
+  UChar*  name;
+  UChar*  name_end;
+  struct _Node*  target;  /* EncloseNode : ENCLOSE_MEMORY */
+  UnsetAddrList* unset_addr_list;
+} CallNode;
+
+#endif
+
+typedef struct {
+  NodeBase base;
+  int  state;
+  int  back_num;
+  int  back_static[NODE_BACKREFS_SIZE];
+  int* back_dynamic;
+  int  nest_level;
+} BRefNode;
+
+typedef struct {
+  NodeBase base;
+  int type;
+  struct _Node* target;
+  int char_len;
+  int ascii_range;
+} AnchorNode;
+
+typedef struct {
+  NodeBase base;
+  struct _Node* car;
+  struct _Node* cdr;
+} ConsAltNode;
+
+typedef struct {
+  NodeBase base;
+  int ctype;
+  int not;
+  int ascii_range;
+} CtypeNode;
+
+typedef struct _Node {
+  union {
+    NodeBase     base;
+    StrNode      str;
+    CClassNode   cclass;
+    QtfrNode     qtfr;
+    EncloseNode  enclose;
+    BRefNode     bref;
+    AnchorNode   anchor;
+    ConsAltNode  cons;
+    CtypeNode    ctype;
+#ifdef USE_SUBEXP_CALL
+    CallNode     call;
+#endif
+  } u;
+} Node;
+
+
+#define NULL_NODE  ((Node* )0)
+
+#define SCANENV_MEMNODES_SIZE               8
+#define SCANENV_MEM_NODES(senv)   \
+ (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \
+    (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static)
+
+typedef struct {
+  OnigOptionType   option;
+  OnigCaseFoldType case_fold_flag;
+  OnigEncoding     enc;
+  const OnigSyntaxType* syntax;
+  BitStatusType    capture_history;
+  BitStatusType    bt_mem_start;
+  BitStatusType    bt_mem_end;
+  BitStatusType    backrefed_mem;
+  UChar*           pattern;
+  UChar*           pattern_end;
+  UChar*           error;
+  UChar*           error_end;
+  regex_t*         reg;       /* for reg->names only */
+#ifdef USE_SUBEXP_CALL
+  UnsetAddrList*   unset_addr_list;
+#endif
+  int              num_call;
+  int              num_mem;
+#ifdef USE_NAMED_GROUP
+  int              num_named;
+#endif
+  int              mem_alloc;
+  Node*            mem_nodes_static[SCANENV_MEMNODES_SIZE];
+  Node**           mem_nodes_dynamic;
+#ifdef USE_COMBINATION_EXPLOSION_CHECK
+  int num_comb_exp_check;
+  int comb_exp_max_regnum;
+  int curr_max_regnum;
+  int has_recursion;
+#endif
+  unsigned int parse_depth;
+  int warnings_flag;
+#ifdef RUBY
+  const char* sourcefile;
+  int sourceline;
+#endif
+} ScanEnv;
+
+
+#define IS_SYNTAX_OP(syn, opm)    (((syn)->op  & (opm)) != 0)
+#define IS_SYNTAX_OP2(syn, opm)   (((syn)->op2 & (opm)) != 0)
+#define IS_SYNTAX_BV(syn, bvm)    (((syn)->behavior & (bvm)) != 0)
+
+#ifdef USE_NAMED_GROUP
+typedef struct {
+  int new_val;
+} GroupNumRemap;
+
+extern int    onig_renumber_name_table(regex_t* reg, GroupNumRemap* map);
+#endif
+
+extern int    onig_strncmp(const UChar* s1, const UChar* s2, int n);
+extern void   onig_strcpy(UChar* dest, const UChar* src, const UChar* end);
+extern void   onig_scan_env_set_error_string(ScanEnv* env, int ecode, UChar* arg, UChar* arg_end);
+extern int    onig_scan_unsigned_number(UChar** src, const UChar* end, OnigEncoding enc);
+extern void   onig_reduce_nested_quantifier(Node* pnode, Node* cnode);
+extern void   onig_node_conv_to_str_node(Node* node, int raw);
+extern int    onig_node_str_cat(Node* node, const UChar* s, const UChar* end);
+extern int    onig_node_str_set(Node* node, const UChar* s, const UChar* end);
+extern void   onig_node_free(Node* node);
+extern Node*  onig_node_new_enclose(int type);
+extern Node*  onig_node_new_anchor(int type);
+extern Node*  onig_node_new_str(const UChar* s, const UChar* end);
+extern Node*  onig_node_new_list(Node* left, Node* right);
+extern Node*  onig_node_list_add(Node* list, Node* x);
+extern Node*  onig_node_new_alt(Node* left, Node* right);
+extern void   onig_node_str_clear(Node* node);
+extern int    onig_names_free(regex_t* reg);
+extern int    onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env);
+extern int    onig_free_shared_cclass_table(void);
+
+#ifdef ONIG_DEBUG
+# ifdef USE_NAMED_GROUP
+extern int onig_print_names(FILE*, regex_t*);
+# endif
+#endif
+
+RUBY_SYMBOL_EXPORT_END
+
+#endif /* ONIGMO_REGPARSE_H */

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/revision.h

@@ -0,0 +1,5 @@
+#define RUBY_REVISION "e50fcca9a7"
+#define RUBY_FULL_REVISION "e50fcca9a79d8e25b33ad3611df6bf4627faafbf"
+#define RUBY_RELEASE_YEAR 2023
+#define RUBY_RELEASE_MONTH 9
+#define RUBY_RELEASE_DAY 14

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/rjit.h

@@ -0,0 +1,103 @@
+#ifndef RUBY_RJIT_H
+#define RUBY_RJIT_H 1
+/**********************************************************************
+
+  rjit.h - Interface to RJIT
+
+  Copyright (C) 2023 Takashi Kokubun <k0kubun@ruby-lang.org>.
+
+**********************************************************************/
+
+#include "ruby/internal/config.h" // defines USE_RJIT
+#include "ruby/internal/stdbool.h"
+#include "vm_core.h"
+
+# if USE_RJIT
+
+#ifndef RJIT_STATS
+# define RJIT_STATS RUBY_DEBUG
+#endif
+
+#include "ruby.h"
+#include "vm_core.h"
+
+// RJIT options which can be defined on the MRI command line.
+struct rb_rjit_options {
+    // Converted from "rjit" feature flag to tell the enablement
+    // information to ruby_show_version().
+    bool on;
+    // Number of calls to trigger JIT compilation.
+    unsigned int call_threshold;
+    // Size of executable memory block in MiB
+    unsigned int exec_mem_size;
+    // Collect RJIT statistics
+    bool stats;
+    // Trace side exit locations
+    bool trace_exits;
+    // Enable disasm of all JIT code
+    bool dump_disasm;
+    // Verify context objects
+    bool verify_ctx;
+    // [experimental] Do not start RJIT until RJIT.resume is called.
+    bool pause;
+};
+
+RUBY_SYMBOL_EXPORT_BEGIN
+RUBY_EXTERN struct rb_rjit_options rb_rjit_opts;
+RUBY_EXTERN bool rb_rjit_call_p;
+
+#define rb_rjit_call_threshold() rb_rjit_opts.call_threshold
+
+extern void rb_rjit_compile(const rb_iseq_t *iseq);
+RUBY_SYMBOL_EXPORT_END
+
+extern void rb_rjit_cancel_all(const char *reason);
+extern void rb_rjit_init(const struct rb_rjit_options *opts);
+extern void rb_rjit_free_iseq(const rb_iseq_t *iseq);
+extern void rb_rjit_iseq_update_references(struct rb_iseq_constant_body *const body);
+extern void rb_rjit_mark(void);
+extern void rb_rjit_iseq_mark(VALUE rjit_blocks);
+extern void rjit_notify_waitpid(int exit_code);
+
+extern void rb_rjit_bop_redefined(int redefined_flag, enum ruby_basic_operators bop);
+extern void rb_rjit_cme_invalidate(rb_callable_method_entry_t *cme);
+extern void rb_rjit_before_ractor_spawn(void);
+extern void rb_rjit_constant_state_changed(ID id);
+extern void rb_rjit_constant_ic_update(const rb_iseq_t *const iseq, IC ic, unsigned insn_idx);
+extern void rb_rjit_tracing_invalidate_all(rb_event_flag_t new_iseq_events);
+
+extern void rb_rjit_bop_redefined(int redefined_flag, enum ruby_basic_operators bop);
+extern void rb_rjit_before_ractor_spawn(void);
+extern void rb_rjit_tracing_invalidate_all(rb_event_flag_t new_iseq_events);
+extern void rb_rjit_collect_vm_usage_insn(int insn);
+
+extern bool rb_rjit_enabled;
+extern bool rb_rjit_stats_enabled;
+extern bool rb_rjit_trace_exits_enabled;
+
+# else // USE_RJIT
+
+static inline void rb_rjit_compile(const rb_iseq_t *iseq){}
+
+static inline void rb_rjit_cancel_all(const char *reason){}
+static inline void rb_rjit_free_iseq(const rb_iseq_t *iseq){}
+static inline void rb_rjit_mark(void){}
+
+static inline void rb_rjit_bop_redefined(int redefined_flag, enum ruby_basic_operators bop) {}
+static inline void rb_rjit_cme_invalidate(rb_callable_method_entry_t *cme) {}
+static inline void rb_rjit_before_ractor_spawn(void) {}
+static inline void rb_rjit_constant_state_changed(ID id) {}
+static inline void rb_rjit_constant_ic_update(const rb_iseq_t *const iseq, IC ic, unsigned insn_idx) {}
+static inline void rb_rjit_tracing_invalidate_all(rb_event_flag_t new_iseq_events) {}
+
+#define rb_rjit_enabled false
+#define rb_rjit_call_p false
+#define rb_rjit_stats_enabled false
+#define rb_rjit_trace_exits_enabled false
+
+#define rb_rjit_call_threshold() UINT_MAX
+
+static inline void rb_rjit_collect_vm_usage_insn(int insn) {}
+
+# endif // USE_RJIT
+#endif // RUBY_RJIT_H

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/rjit_c.h

@@ -0,0 +1,165 @@
+// This file is parsed by tool/rjit/generate.rb to generate rjit_c.rb
+#ifndef RJIT_C_H
+#define RJIT_C_H
+
+#include "ruby/internal/config.h"
+#include "internal/string.h"
+#include "internal/struct.h"
+#include "internal/variable.h"
+#include "vm_core.h"
+#include "vm_callinfo.h"
+#include "builtin.h"
+#include "ccan/list/list.h"
+#include "rjit.h"
+#include "shape.h"
+
+extern uint8_t *rb_rjit_mem_block;
+
+#define RJIT_RUNTIME_COUNTERS(...) struct rb_rjit_runtime_counters { size_t __VA_ARGS__; };
+RJIT_RUNTIME_COUNTERS(
+    vm_insns_count,
+    rjit_insns_count,
+
+    send_args_splat_kw_splat,
+    send_args_splat,
+    send_args_splat_not_array,
+    send_args_splat_length_not_equal,
+    send_args_splat_cfunc_var_args,
+    send_args_splat_arity_error,
+    send_args_splat_ruby2_hash,
+    send_args_splat_cfunc_zuper,
+    send_args_splat_cfunc_ruby2_keywords,
+    send_kw_splat,
+    send_kwarg,
+    send_klass_megamorphic,
+    send_missing_cme,
+    send_private,
+    send_protected_check_failed,
+    send_tailcall,
+    send_notimplemented,
+    send_missing,
+    send_bmethod,
+    send_alias,
+    send_undef,
+    send_zsuper,
+    send_refined,
+    send_stackoverflow,
+    send_arity,
+    send_c_tracing,
+    send_is_a_class_mismatch,
+    send_instance_of_class_mismatch,
+    send_keywords,
+
+    send_blockiseq,
+    send_block_handler,
+    send_block_setup,
+    send_block_not_nil,
+    send_block_not_proxy,
+    send_block_arg,
+
+    send_iseq_kwparam,
+    send_iseq_accepts_no_kwarg,
+    send_iseq_has_opt,
+    send_iseq_has_kwrest,
+    send_iseq_ruby2_keywords,
+    send_iseq_has_rest_and_captured,
+    send_iseq_has_rest_and_kw_supplied,
+    send_iseq_has_no_kw,
+    send_iseq_zsuper,
+    send_iseq_materialized_block,
+    send_iseq_has_rest,
+    send_iseq_block_arg0_splat,
+    send_iseq_kw_call,
+    send_iseq_splat,
+    send_iseq_has_rest_and_optional,
+    send_iseq_arity_error,
+    send_iseq_missing_optional_kw,
+    send_iseq_too_many_kwargs,
+    send_iseq_kwargs_mismatch,
+    send_iseq_splat_with_kw,
+    send_iseq_splat_arity_error,
+    send_iseq_has_rest_and_splat_not_equal,
+
+    send_cfunc_variadic,
+    send_cfunc_too_many_args,
+    send_cfunc_ruby_array_varg,
+    send_cfunc_splat_with_kw,
+    send_cfunc_tracing,
+    send_cfunc_argc_mismatch,
+    send_cfunc_toomany_args,
+
+    send_attrset_splat,
+    send_attrset_kwarg,
+    send_attrset_method,
+
+    send_ivar_splat,
+    send_ivar_opt_send,
+
+    send_optimized_send_no_args,
+    send_optimized_send_not_sym_or_str,
+    send_optimized_send_mid_class_changed,
+    send_optimized_send_mid_id_changed,
+    send_optimized_send_null_mid,
+    send_optimized_send_send,
+    send_optimized_call_block,
+    send_optimized_call_kwarg,
+    send_optimized_call_splat,
+    send_optimized_struct_aref_error,
+
+    send_optimized_block_call,
+    send_optimized_struct_aset,
+
+    send_bmethod_not_iseq,
+    send_bmethod_blockarg,
+
+    invokesuper_me_changed,
+    invokesuper_block,
+
+    invokeblock_none,
+    invokeblock_symbol,
+    invokeblock_proc,
+    invokeblock_tag_changed,
+    invokeblock_iseq_block_changed,
+    invokeblock_iseq_arity,
+    invokeblock_iseq_arg0_splat,
+    invokeblock_ifunc_args_splat,
+    invokeblock_ifunc_kw_splat,
+    invokeblock_iseq_arg0_args_splat,
+    invokeblock_iseq_arg0_has_kw,
+
+    getivar_megamorphic,
+    getivar_not_heap,
+    getivar_special_const,
+    getivar_too_complex,
+
+    optaref_arg_not_fixnum,
+    optaref_argc_not_one,
+    optaref_recv_not_array,
+    optaref_recv_not_hash,
+    optaref_send,
+
+    optgetconst_not_cached,
+    optgetconst_cref,
+    optgetconst_cache_miss,
+
+    setivar_frozen,
+    setivar_not_heap,
+    setivar_megamorphic,
+    setivar_too_complex,
+
+    expandarray_splat,
+    expandarray_postarg,
+    expandarray_not_array,
+    expandarray_rhs_too_small,
+
+    getblockpp_block_param_modified,
+    getblockpp_block_handler_none,
+    getblockpp_not_gc_guarded,
+    getblockpp_not_iseq_block,
+
+    compiled_block_count
+)
+#undef RJIT_RUNTIME_COUNTERS
+extern struct rb_rjit_runtime_counters rb_rjit_counters;
+
+#endif /* RJIT_C_H */

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/ruby_assert.h

@@ -0,0 +1,14 @@
+#ifndef RUBY_TOPLEVEL_ASSERT_H                           /*-*-C-*-vi:se ft=c:*/
+#define RUBY_TOPLEVEL_ASSERT_H
+/**
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  This  file  is   a  part  of  the   programming  language  Ruby.
+ *             Permission  is hereby  granted,  to  either redistribute  and/or
+ *             modify this file, provided that  the conditions mentioned in the
+ *             file COPYING are met.  Consult the file for details.
+ */
+#include "ruby/assert.h"
+#undef assert
+#define assert RUBY_ASSERT_NDEBUG
+
+#endif /* RUBY_TOPLEVEL_ASSERT_H */

data/lib/debase/ruby_core_source/ruby-3.3.0-preview2/ruby_atomic.h

@@ -0,0 +1,23 @@
+#include "ruby/atomic.h"
+
+/* shim macros only */
+#define ATOMIC_ADD(var, val) RUBY_ATOMIC_ADD(var, val)
+#define ATOMIC_CAS(var, oldval, newval) RUBY_ATOMIC_CAS(var, oldval, newval)
+#define ATOMIC_DEC(var) RUBY_ATOMIC_DEC(var)
+#define ATOMIC_EXCHANGE(var, val) RUBY_ATOMIC_EXCHANGE(var, val)
+#define ATOMIC_FETCH_ADD(var, val) RUBY_ATOMIC_FETCH_ADD(var, val)
+#define ATOMIC_FETCH_SUB(var, val) RUBY_ATOMIC_FETCH_SUB(var, val)
+#define ATOMIC_INC(var) RUBY_ATOMIC_INC(var)
+#define ATOMIC_OR(var, val) RUBY_ATOMIC_OR(var, val)
+#define ATOMIC_PTR_CAS(var, oldval, newval) RUBY_ATOMIC_PTR_CAS(var, oldval, newval)
+#define ATOMIC_PTR_EXCHANGE(var, val) RUBY_ATOMIC_PTR_EXCHANGE(var, val)
+#define ATOMIC_SET(var, val) RUBY_ATOMIC_SET(var, val)
+#define ATOMIC_SIZE_ADD(var, val) RUBY_ATOMIC_SIZE_ADD(var, val)
+#define ATOMIC_SIZE_CAS(var, oldval, newval) RUBY_ATOMIC_SIZE_CAS(var, oldval, newval)
+#define ATOMIC_SIZE_DEC(var) RUBY_ATOMIC_SIZE_DEC(var)
+#define ATOMIC_SIZE_EXCHANGE(var, val) RUBY_ATOMIC_SIZE_EXCHANGE(var, val)
+#define ATOMIC_SIZE_INC(var) RUBY_ATOMIC_SIZE_INC(var)
+#define ATOMIC_SIZE_SUB(var, val) RUBY_ATOMIC_SIZE_SUB(var, val)
+#define ATOMIC_SUB(var, val) RUBY_ATOMIC_SUB(var, val)
+#define ATOMIC_VALUE_CAS(var, oldval, val) RUBY_ATOMIC_VALUE_CAS(var, oldval, val)
+#define ATOMIC_VALUE_EXCHANGE(var, val) RUBY_ATOMIC_VALUE_EXCHANGE(var, val)