debase-ruby_core_source 0.10.18 → 3.2.0

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/yjit.h

@@ -1,72 +0,0 @@
-#ifndef YJIT_H
-#define YJIT_H 1
-//
-// This file contains definitions YJIT exposes to the CRuby codebase
-//
-
-#include "ruby/internal/config.h"
-#include "ruby_assert.h" // for RUBY_DEBUG
-#include "vm_core.h"
-#include "method.h"
-
-// YJIT_STATS controls whether to support runtime counters in generated code
-// and in the interpreter.
-#ifndef YJIT_STATS
-# define YJIT_STATS RUBY_DEBUG
-#endif
-
-#if USE_YJIT
-
-// We generate x86 or arm64 assembly
-#if defined(_WIN32) ? defined(_M_AMD64) : (defined(__x86_64__) || defined(__aarch64__))
-// x86_64 platforms without mingw/msys or x64-mswin
-#else
-# error YJIT unsupported platform
-#endif
-
-// Expose these as declarations since we are building YJIT.
-bool rb_yjit_enabled_p(void);
-unsigned rb_yjit_call_threshold(void);
-void rb_yjit_invalidate_all_method_lookup_assumptions(void);
-void rb_yjit_method_lookup_change(VALUE klass, ID mid);
-void rb_yjit_cme_invalidate(rb_callable_method_entry_t *cme);
-void rb_yjit_collect_vm_usage_insn(int insn);
-void rb_yjit_collect_binding_alloc(void);
-void rb_yjit_collect_binding_set(void);
-bool rb_yjit_compile_iseq(const rb_iseq_t *iseq, rb_execution_context_t *ec);
-void rb_yjit_init(void);
-void rb_yjit_bop_redefined(int redefined_flag, enum ruby_basic_operators bop);
-void rb_yjit_constant_state_changed(ID id);
-void rb_yjit_iseq_mark(void *payload);
-void rb_yjit_iseq_update_references(void *payload);
-void rb_yjit_iseq_free(void *payload);
-void rb_yjit_before_ractor_spawn(void);
-void rb_yjit_constant_ic_update(const rb_iseq_t *const iseq, IC ic, unsigned insn_idx);
-void rb_yjit_tracing_invalidate_all(void);
-
-#else
-// !USE_YJIT
-// In these builds, YJIT could never be turned on. Provide dummy implementations.
-
-static inline bool rb_yjit_enabled_p(void) { return false; }
-static inline unsigned rb_yjit_call_threshold(void) { return UINT_MAX; }
-static inline void rb_yjit_invalidate_all_method_lookup_assumptions(void) {}
-static inline void rb_yjit_method_lookup_change(VALUE klass, ID mid) {}
-static inline void rb_yjit_cme_invalidate(rb_callable_method_entry_t *cme) {}
-static inline void rb_yjit_collect_vm_usage_insn(int insn) {}
-static inline void rb_yjit_collect_binding_alloc(void) {}
-static inline void rb_yjit_collect_binding_set(void) {}
-static inline bool rb_yjit_compile_iseq(const rb_iseq_t *iseq, rb_execution_context_t *ec) { return false; }
-static inline void rb_yjit_init(void) {}
-static inline void rb_yjit_bop_redefined(int redefined_flag, enum ruby_basic_operators bop) {}
-static inline void rb_yjit_constant_state_changed(ID id) {}
-static inline void rb_yjit_iseq_mark(void *payload) {}
-static inline void rb_yjit_iseq_update_references(void *payload) {}
-static inline void rb_yjit_iseq_free(void *payload) {}
-static inline void rb_yjit_before_ractor_spawn(void) {}
-static inline void rb_yjit_constant_ic_update(const rb_iseq_t *const iseq, IC ic, unsigned insn_idx) {}
-static inline void rb_yjit_tracing_invalidate_all(void) {}
-
-#endif // #if USE_YJIT
-
-#endif // #ifndef YJIT_H

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/addr2line.h

@@ -1,20 +0,0 @@
-#ifndef RUBY_ADDR2LINE_H
-#define RUBY_ADDR2LINE_H
-/**********************************************************************
-
-  addr2line.h -
-
-  $Author$
-
-  Copyright (C) 2010 Shinichiro Hamaji
-
-**********************************************************************/
-
-#if (defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H))
-
-void
-rb_dump_backtrace_with_lines(int num_traces, void **traces);
-
-#endif /* USE_ELF */
-
-#endif /* RUBY_ADDR2LINE_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/ccan/build_assert/build_assert.h

@@ -1,40 +0,0 @@
-/* CC0 (Public domain) - see ccan/licenses/CC0 file for details */
-#ifndef CCAN_BUILD_ASSERT_H
-#define CCAN_BUILD_ASSERT_H
-
-/**
- * CCAN_BUILD_ASSERT - assert a build-time dependency.
- * @cond: the compile-time condition which must be true.
- *
- * Your compile will fail if the condition isn't true, or can't be evaluated
- * by the compiler.  This can only be used within a function.
- *
- * Example:
- *	#include <stddef.h>
- *	...
- *	static char *foo_to_char(struct foo *foo)
- *	{
- *		// This code needs string to be at start of foo.
- *		CCAN_BUILD_ASSERT(offsetof(struct foo, string) == 0);
- *		return (char *)foo;
- *	}
- */
-#define CCAN_BUILD_ASSERT(cond) \
-	do { (void) sizeof(char [1 - 2*!(cond)]); } while(0)
-
-/**
- * CCAN_BUILD_ASSERT_OR_ZERO - assert a build-time dependency, as an expression.
- * @cond: the compile-time condition which must be true.
- *
- * Your compile will fail if the condition isn't true, or can't be evaluated
- * by the compiler.  This can be used in an expression: its value is "0".
- *
- * Example:
- *	#define foo_to_char(foo)					\
- *		 ((char *)(foo)						\
- *		  + CCAN_BUILD_ASSERT_OR_ZERO(offsetof(struct foo, string) == 0))
- */
-#define CCAN_BUILD_ASSERT_OR_ZERO(cond) \
-	(sizeof(char [1 - 2*!(cond)]) - 1)
-
-#endif /* CCAN_BUILD_ASSERT_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/ccan/str/str.h

@@ -1,17 +0,0 @@
-/* CC0 (Public domain) - see ccan/licenses/CC0 file for details */
-#ifndef CCAN_STR_H
-#define CCAN_STR_H
-/**
- * ccan_stringify - Turn expression into a string literal
- * @expr: any C expression
- *
- * Example:
- *	#define PRINT_COND_IF_FALSE(cond) \
- *		((cond) || printf("%s is false!", ccan_stringify(cond)))
- */
-#define stringify(expr)		ccan_stringify_1(expr)
-#define ccan_stringify(expr)	ccan_stringify_1(expr)
-/* Double-indirection required to stringify expansions */
-#define ccan_stringify_1(expr)	#expr
-
-#endif /* CCAN_STR_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/constant.h

@@ -1,55 +0,0 @@
-#ifndef CONSTANT_H
-#define CONSTANT_H
-/**********************************************************************
-
-  constant.h -
-
-  $Author$
-  created at: Sun Nov 15 00:09:33 2009
-
-  Copyright (C) 2009 Yusuke Endoh
-
-**********************************************************************/
-#include "ruby/ruby.h"
-#include "id_table.h"
-
-typedef enum {
-    CONST_DEPRECATED = 0x100,
-
-    CONST_VISIBILITY_MASK = 0xff,
-    CONST_PUBLIC    = 0x00,
-    CONST_PRIVATE,
-    CONST_VISIBILITY_MAX
-} rb_const_flag_t;
-
-#define RB_CONST_PRIVATE_P(ce) \
-    (((ce)->flag & CONST_VISIBILITY_MASK) == CONST_PRIVATE)
-#define RB_CONST_PUBLIC_P(ce) \
-    (((ce)->flag & CONST_VISIBILITY_MASK) == CONST_PUBLIC)
-
-#define RB_CONST_DEPRECATED_P(ce) \
-    ((ce)->flag & CONST_DEPRECATED)
-
-typedef struct rb_const_entry_struct {
-    rb_const_flag_t flag;
-    int line;
-    VALUE value;            /* should be mark */
-    VALUE file;             /* should be mark */
-} rb_const_entry_t;
-
-VALUE rb_mod_private_constant(int argc, const VALUE *argv, VALUE obj);
-VALUE rb_mod_public_constant(int argc, const VALUE *argv, VALUE obj);
-VALUE rb_mod_deprecate_constant(int argc, const VALUE *argv, VALUE obj);
-void rb_free_const_table(struct rb_id_table *tbl);
-VALUE rb_const_source_location(VALUE, ID);
-
-MJIT_SYMBOL_EXPORT_BEGIN
-int rb_autoloading_value(VALUE mod, ID id, VALUE *value, rb_const_flag_t *flag);
-rb_const_entry_t *rb_const_lookup(VALUE klass, ID id);
-VALUE rb_public_const_get_at(VALUE klass, ID id);
-VALUE rb_public_const_get_from(VALUE klass, ID id);
-int rb_public_const_defined_from(VALUE klass, ID id);
-VALUE rb_const_source_location_at(VALUE, ID);
-MJIT_SYMBOL_EXPORT_END
-
-#endif /* CONSTANT_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/darray.h

@@ -1,179 +0,0 @@
-#ifndef RUBY_DARRAY_H
-#define RUBY_DARRAY_H
-
-#include <stdint.h>
-#include <stddef.h>
-#include <stdlib.h>
-
-// Type for a dynamic array. Use to declare a dynamic array.
-// It is a pointer so it fits in st_table nicely. Designed
-// to be fairly type-safe.
-//
-// NULL is a valid empty dynamic array.
-//
-// Example:
-//      rb_darray(char) char_array = NULL;
-//      rb_darray_append(&char_array, 'e');
-//      printf("pushed %c\n", *rb_darray_ref(char_array, 0));
-//      rb_darray_free(char_array);
-//
-#define rb_darray(T) struct { rb_darray_meta_t meta; T data[]; } *
-
-// Copy an element out of the array. Warning: not bounds checked.
-//
-// T rb_darray_get(rb_darray(T) ary, size_t idx);
-//
-#define rb_darray_get(ary, idx) ((ary)->data[(idx)])
-
-// Assign to an element. Warning: not bounds checked.
-//
-// void rb_darray_set(rb_darray(T) ary, size_t idx, T element);
-//
-#define rb_darray_set(ary, idx, element) ((ary)->data[(idx)] = (element))
-
-// Get a pointer to an element. Warning: not bounds checked.
-//
-// T *rb_darray_ref(rb_darray(T) ary, size_t idx);
-//
-#define rb_darray_ref(ary, idx) (&((ary)->data[(idx)]))
-
-// Copy a new element into the array. ptr_to_ary is evaluated multiple times.
-//
-// void rb_darray_append(rb_darray(T) *ptr_to_ary, T element);
-//
-#define rb_darray_append(ptr_to_ary, element) do {  \
-    rb_darray_ensure_space((ptr_to_ary), sizeof(**(ptr_to_ary)), \
-                           sizeof((*(ptr_to_ary))->data[0])); \
-    rb_darray_set(*(ptr_to_ary), \
-                  (*(ptr_to_ary))->meta.size, \
-                  (element)); \
-    (*(ptr_to_ary))->meta.size++; \
-} while (0)
-
-
-// Last element of the array
-//
-#define rb_darray_back(ary) ((ary)->data[(ary)->meta.size - 1])
-
-// Remove the last element of the array.
-//
-#define rb_darray_pop_back(ary) ((ary)->meta.size--)
-
-// Remove element at idx and replace it by the last element
-#define rb_darray_remove_unordered(ary, idx) do {   \
-    rb_darray_set(ary, idx, rb_darray_back(ary));   \
-    rb_darray_pop_back(ary);                        \
-} while (0);
-
-// Iterate over items of the array in a for loop
-//
-#define rb_darray_foreach(ary, idx_name, elem_ptr_var) \
-    for (size_t idx_name = 0; idx_name < rb_darray_size(ary) && ((elem_ptr_var) = rb_darray_ref(ary, idx_name)); ++idx_name)
-
-// Iterate over valid indicies in the array in a for loop
-//
-#define rb_darray_for(ary, idx_name) \
-    for (size_t idx_name = 0; idx_name < rb_darray_size(ary); ++idx_name)
-
-// Make a dynamic array of a certain size. All bytes backing the elements are set to zero.
-//
-// Note that NULL is a valid empty dynamic array.
-//
-// void rb_darray_make(rb_darray(T) *ptr_to_ary, size_t size);
-//
-#define rb_darray_make(ptr_to_ary, size) \
-    rb_darray_make_impl((ptr_to_ary), size, sizeof(**(ptr_to_ary)), \
-                         sizeof((*(ptr_to_ary))->data[0]))
-
-#define rb_darray_data_ptr(ary) ((ary)->data)
-
-// Set the size of the array to zero without freeing the backing memory.
-// Allows reusing the same array.
-//
-#define rb_darray_clear(ary) (ary->meta.size = 0)
-
-typedef struct rb_darray_meta {
-    size_t size;
-    size_t capa;
-} rb_darray_meta_t;
-
-// Get the size of the dynamic array.
-//
-static inline size_t
-rb_darray_size(const void *ary)
-{
-    const rb_darray_meta_t *meta = ary;
-    return meta ? meta->size : 0;
-}
-
-// Get the capacity of the dynamic array.
-//
-static inline size_t
-rb_darray_capa(const void *ary)
-{
-    const rb_darray_meta_t *meta = ary;
-    return meta ? meta->capa : 0;
-}
-
-// Free the dynamic array.
-//
-static inline void
-rb_darray_free(void *ary)
-{
-    rb_darray_meta_t *meta = ary;
-    ruby_sized_xfree(ary, meta->capa);
-}
-
-// Internal function
-// Ensure there is space for one more element.
-// Note: header_size can be bigger than sizeof(rb_darray_meta_t) when T is __int128_t, for example.
-static inline void
-rb_darray_ensure_space(void *ptr_to_ary, size_t header_size, size_t element_size)
-{
-    rb_darray_meta_t **ptr_to_ptr_to_meta = ptr_to_ary;
-    rb_darray_meta_t *meta = *ptr_to_ptr_to_meta;
-    size_t current_capa = rb_darray_capa(meta);
-    if (rb_darray_size(meta) < current_capa) return;
-
-    // Double the capacity
-    size_t new_capa = current_capa == 0 ? 1 : current_capa * 2;
-
-    rb_darray_meta_t *doubled_ary = rb_xrealloc_mul_add(meta, new_capa, element_size, header_size);
-    // rb_xrealloc functions guarantee that NULL is not returned
-    assert(doubled_ary != NULL);
-
-    if (meta == NULL) {
-        // First allocation. Initialize size. On subsequence allocations
-        // realloc takes care of carrying over the size.
-        doubled_ary->size = 0;
-    }
-
-    doubled_ary->capa = new_capa;
-
-    // We don't have access to the type of the dynamic array in function context.
-    // Write out result with memcpy to avoid strict aliasing issue.
-    memcpy(ptr_to_ary, &doubled_ary, sizeof(doubled_ary));
-}
-
-static inline void
-rb_darray_make_impl(void *ptr_to_ary, size_t array_size, size_t header_size, size_t element_size)
-{
-    rb_darray_meta_t **ptr_to_ptr_to_meta = ptr_to_ary;
-    if (array_size == 0) {
-        *ptr_to_ptr_to_meta = NULL;
-        return;
-    }
-
-    rb_darray_meta_t *meta = rb_xcalloc_mul_add(array_size, element_size, header_size);
-    // rb_xcalloc functions guarantee that NULL is not returned
-    assert(meta != NULL);
-
-    meta->size = array_size;
-    meta->capa = array_size;
-
-    // We don't have access to the type of the dynamic array in function context.
-    // Write out result with memcpy to avoid strict aliasing issue.
-    memcpy(ptr_to_ary, &meta, sizeof(meta));
-}
-
-#endif /* RUBY_DARRAY_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/dln.h

@@ -1,31 +0,0 @@
-#ifndef DLN_H
-#define DLN_H
-/**********************************************************************
-
-  dln.h -
-
-  $Author$
-  created at: Wed Jan 19 16:53:09 JST 1994
-
-  Copyright (C) 1993-2007 Yukihiro Matsumoto
-
-**********************************************************************/
-
-#include "ruby/defines.h"       /* for RUBY_SYMBOL_EXPORT_BEGIN */
-
-RUBY_SYMBOL_EXPORT_BEGIN
-
-#ifndef DLN_FIND_EXTRA_ARG
-#define DLN_FIND_EXTRA_ARG
-#endif
-#ifndef DLN_FIND_EXTRA_ARG_DECL
-#define DLN_FIND_EXTRA_ARG_DECL
-#endif
-
-char *dln_find_exe_r(const char*,const char*,char*,size_t DLN_FIND_EXTRA_ARG_DECL);
-char *dln_find_file_r(const char*,const char*,char*,size_t DLN_FIND_EXTRA_ARG_DECL);
-void *dln_load(const char*);
-
-RUBY_SYMBOL_EXPORT_END
-
-#endif

data/lib/debase/ruby_core_source/ruby-3.2.0-preview3/encindex.h

@@ -1,70 +0,0 @@
-#ifndef RUBY_ENCINDEX_H
-#define RUBY_ENCINDEX_H 1
-/**********************************************************************
-
-  encindex.h -
-
-  $Author$
-  created at: Tue Sep 15 13:21:14 JST 2015
-
-  Copyright (C) 2015 Yukihiro Matsumoto
-
-**********************************************************************/
-
-#include "ruby/encoding.h"      /* rb_ascii8bit_encindex etc. */
-#if defined(__cplusplus)
-extern "C" {
-#if 0
-} /* satisfy cc-mode */
-#endif
-#endif
-
-enum ruby_preserved_encindex {
-    RUBY_ENCINDEX_ASCII_8BIT,
-    RUBY_ENCINDEX_UTF_8,
-    RUBY_ENCINDEX_US_ASCII,
-
-    /* preserved indexes */
-    RUBY_ENCINDEX_UTF_16BE,
-    RUBY_ENCINDEX_UTF_16LE,
-    RUBY_ENCINDEX_UTF_32BE,
-    RUBY_ENCINDEX_UTF_32LE,
-    RUBY_ENCINDEX_UTF_16,
-    RUBY_ENCINDEX_UTF_32,
-    RUBY_ENCINDEX_UTF8_MAC,
-
-    /* for old options of regexp */
-    RUBY_ENCINDEX_EUC_JP,
-    RUBY_ENCINDEX_Windows_31J,
-
-    RUBY_ENCINDEX_BUILTIN_MAX
-};
-
-#define ENCINDEX_ASCII_8BIT  RUBY_ENCINDEX_ASCII_8BIT
-#define ENCINDEX_UTF_8       RUBY_ENCINDEX_UTF_8
-#define ENCINDEX_US_ASCII    RUBY_ENCINDEX_US_ASCII
-#define ENCINDEX_UTF_16BE    RUBY_ENCINDEX_UTF_16BE
-#define ENCINDEX_UTF_16LE    RUBY_ENCINDEX_UTF_16LE
-#define ENCINDEX_UTF_32BE    RUBY_ENCINDEX_UTF_32BE
-#define ENCINDEX_UTF_32LE    RUBY_ENCINDEX_UTF_32LE
-#define ENCINDEX_UTF_16      RUBY_ENCINDEX_UTF_16
-#define ENCINDEX_UTF_32      RUBY_ENCINDEX_UTF_32
-#define ENCINDEX_UTF8_MAC    RUBY_ENCINDEX_UTF8_MAC
-#define ENCINDEX_EUC_JP      RUBY_ENCINDEX_EUC_JP
-#define ENCINDEX_Windows_31J RUBY_ENCINDEX_Windows_31J
-#define ENCINDEX_BUILTIN_MAX RUBY_ENCINDEX_BUILTIN_MAX
-
-#define rb_ascii8bit_encindex() RUBY_ENCINDEX_ASCII_8BIT
-#define rb_utf8_encindex()      RUBY_ENCINDEX_UTF_8
-#define rb_usascii_encindex()   RUBY_ENCINDEX_US_ASCII
-
-int rb_enc_find_index2(const char *name, long len);
-
-#if defined(__cplusplus)
-#if 0
-{ /* satisfy cc-mode */
-#endif
-}  /* extern "C" { */
-#endif
-
-#endif /* RUBY_ENCINDEX_H */