datadog-ruby_core_source 3.5.4 → 3.5.5

data/lib/datadog/ruby_core_source/ruby-3.1.0-p0/ccan/str/str.h

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

data/lib/datadog/ruby_core_source/ruby-3.1.0-p0/darray.h

@@ -0,0 +1,198 @@
+#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;
+//      if (!rb_darray_append(&char_array, 'e')) abort();
+//      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, int32_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, int32_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, int32_t idx);
+//
+#define rb_darray_ref(ary, idx) (&((ary)->data[(idx)]))
+
+// Copy a new element into the array. Return 1 on success and 0 on failure.
+// ptr_to_ary is evaluated multiple times.
+//
+// bool rb_darray_append(rb_darray(T) *ptr_to_ary, T element);
+//
+#define rb_darray_append(ptr_to_ary, element) (   \
+    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),           \
+        1                                         \
+    ) : 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 (int 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 (int 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.
+// Return 1 on success and 0 on failure.
+//
+// Note that NULL is a valid empty dynamic array.
+//
+// bool rb_darray_make(rb_darray(T) *ptr_to_ary, int32_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]))
+
+// 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 {
+    int32_t size;
+    int32_t capa;
+} rb_darray_meta_t;
+
+// Get the size of the dynamic array.
+//
+static inline int32_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 int32_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)
+{
+    free(ary);
+}
+
+// Internal function. Calculate buffer size on malloc heap.
+static inline size_t
+rb_darray_buffer_size(int32_t capacity, size_t header_size, size_t element_size)
+{
+    if (capacity == 0) return 0;
+    return header_size + (size_t)capacity * element_size;
+}
+
+// Internal function
+// Ensure there is space for one more element. Return 1 on success and 0 on failure.
+// Note: header_size can be bigger than sizeof(rb_darray_meta_t) when T is __int128_t, for example.
+static inline int
+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;
+    int32_t current_capa = rb_darray_capa(meta);
+    if (rb_darray_size(meta) < current_capa) return 1;
+
+    int32_t new_capa;
+    // Calculate new capacity
+    if (current_capa == 0) {
+        new_capa = 1;
+    }
+    else {
+        int64_t doubled = 2 * (int64_t)current_capa;
+        new_capa = (int32_t)doubled;
+        if (new_capa != doubled) return 0;
+    }
+
+    // Calculate new buffer size
+    size_t current_buffer_size = rb_darray_buffer_size(current_capa, header_size, element_size);
+    size_t new_buffer_size = rb_darray_buffer_size(new_capa, header_size, element_size);
+    if (new_buffer_size <= current_buffer_size) return 0;
+
+    rb_darray_meta_t *doubled_ary = realloc(meta, new_buffer_size);
+    if (!doubled_ary) return 0;
+
+    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));
+    return 1;
+}
+
+static inline int
+rb_darray_make_impl(void *ptr_to_ary, int32_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) return 0;
+    if (array_size == 0) {
+        *ptr_to_ptr_to_meta = NULL;
+        return 1;
+    }
+
+    size_t buffer_size = rb_darray_buffer_size(array_size, header_size, element_size);
+    rb_darray_meta_t *meta = calloc(buffer_size, 1);
+    if (!meta) return 0;
+
+    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));
+    return 1;
+}
+
+#endif /* RUBY_DARRAY_H */

data/lib/datadog/ruby_core_source/ruby-3.1.0-p0/id.h

@@ -0,0 +1,293 @@
+/* DO NOT EDIT THIS FILE DIRECTLY */
+/**********************************************************************
+
+  id.h -
+
+  $Author$
+  created at: Sun Oct 19 21:12:51 2008
+
+  Copyright (C) 2007 Koichi Sasada
+
+**********************************************************************/
+
+#ifndef RUBY_ID_H
+#define RUBY_ID_H
+
+enum ruby_id_types {
+    RUBY_ID_STATIC_SYM  = 0x01,
+    RUBY_ID_LOCAL       = 0x00,
+    RUBY_ID_INSTANCE    = (0x01<<1),
+    RUBY_ID_GLOBAL      = (0x03<<1),
+    RUBY_ID_ATTRSET     = (0x04<<1),
+    RUBY_ID_CONST       = (0x05<<1),
+    RUBY_ID_CLASS       = (0x06<<1),
+    RUBY_ID_JUNK        = (0x07<<1),
+    RUBY_ID_INTERNAL    = RUBY_ID_JUNK,
+    RUBY_ID_SCOPE_SHIFT = 4,
+    RUBY_ID_SCOPE_MASK  = (~(~0U<<(RUBY_ID_SCOPE_SHIFT-1))<<1)
+};
+
+#define ID_STATIC_SYM  RUBY_ID_STATIC_SYM
+#define ID_SCOPE_SHIFT RUBY_ID_SCOPE_SHIFT
+#define ID_SCOPE_MASK  RUBY_ID_SCOPE_MASK
+#define ID_LOCAL       RUBY_ID_LOCAL
+#define ID_INSTANCE    RUBY_ID_INSTANCE
+#define ID_GLOBAL      RUBY_ID_GLOBAL
+#define ID_ATTRSET     RUBY_ID_ATTRSET
+#define ID_CONST       RUBY_ID_CONST
+#define ID_CLASS       RUBY_ID_CLASS
+#define ID_JUNK        RUBY_ID_JUNK
+#define ID_INTERNAL    RUBY_ID_INTERNAL
+
+#define symIFUNC ID2SYM(idIFUNC)
+#define symCFUNC ID2SYM(idCFUNC)
+
+#define RUBY_TOKEN_DOT2 128
+#define RUBY_TOKEN_DOT3 129
+#define RUBY_TOKEN_BDOT2 130
+#define RUBY_TOKEN_BDOT3 131
+#define RUBY_TOKEN_UPLUS 132
+#define RUBY_TOKEN_UMINUS 133
+#define RUBY_TOKEN_POW 134
+#define RUBY_TOKEN_CMP 135
+#define RUBY_TOKEN_LSHFT 136
+#define RUBY_TOKEN_RSHFT 137
+#define RUBY_TOKEN_LEQ 138
+#define RUBY_TOKEN_GEQ 139
+#define RUBY_TOKEN_EQ 140
+#define RUBY_TOKEN_EQQ 141
+#define RUBY_TOKEN_NEQ 142
+#define RUBY_TOKEN_MATCH 143
+#define RUBY_TOKEN_NMATCH 144
+#define RUBY_TOKEN_AREF 145
+#define RUBY_TOKEN_ASET 146
+#define RUBY_TOKEN_COLON2 147
+#define RUBY_TOKEN_ANDOP 148
+#define RUBY_TOKEN_OROP 149
+#define RUBY_TOKEN_ANDDOT 150
+#define RUBY_TOKEN(t) RUBY_TOKEN_##t
+
+#define RUBY_TOKEN2ID_TYPE(tok, type) ((tok<<RUBY_ID_SCOPE_SHIFT)|type|RUBY_ID_STATIC_SYM)
+#define TOKEN2LOCALID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_LOCAL)
+#define TOKEN2INSTANCEID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_INSTANCE)
+#define TOKEN2GLOBALID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_GLOBAL)
+#define TOKEN2CONSTID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_CONST)
+#define TOKEN2CLASSID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_CLASS)
+#define TOKEN2ATTRSETID(tok) RUBY_TOKEN2ID_TYPE(tok, RUBY_ID_ATTRSET)
+
+enum ruby_method_ids {
+    idDot2 = RUBY_TOKEN(DOT2),
+    idDot3 = RUBY_TOKEN(DOT3),
+    idUPlus = RUBY_TOKEN(UPLUS),
+    idUMinus = RUBY_TOKEN(UMINUS),
+    idPow = RUBY_TOKEN(POW),
+    idCmp = RUBY_TOKEN(CMP),
+    idPLUS = '+',
+    idMINUS = '-',
+    idMULT = '*',
+    idDIV = '/',
+    idMOD = '%',
+    idLTLT = RUBY_TOKEN(LSHFT),
+    idGTGT = RUBY_TOKEN(RSHFT),
+    idLT = '<',
+    idLE = RUBY_TOKEN(LEQ),
+    idGT = '>',
+    idGE = RUBY_TOKEN(GEQ),
+    idEq = RUBY_TOKEN(EQ),
+    idEqq = RUBY_TOKEN(EQQ),
+    idNeq = RUBY_TOKEN(NEQ),
+    idNot = '!',
+    idAnd = '&',
+    idOr = '|',
+    idBackquote = '`',
+    idEqTilde = RUBY_TOKEN(MATCH),
+    idNeqTilde = RUBY_TOKEN(NMATCH),
+    idAREF = RUBY_TOKEN(AREF),
+    idASET = RUBY_TOKEN(ASET),
+    idCOLON2 = RUBY_TOKEN(COLON2),
+    idANDOP = RUBY_TOKEN(ANDOP),
+    idOROP = RUBY_TOKEN(OROP),
+    idANDDOT = RUBY_TOKEN(ANDDOT),
+    tPRESERVED_ID_BEGIN = 150,
+    idNilP,
+    idNULL,
+    idEmptyP,
+    idEqlP,
+    idRespond_to,
+    idRespond_to_missing,
+    idIFUNC,
+    idCFUNC,
+    id_core_set_method_alias,
+    id_core_set_variable_alias,
+    id_core_undef_method,
+    id_core_define_method,
+    id_core_define_singleton_method,
+    id_core_set_postexe,
+    id_core_hash_merge_ptr,
+    id_core_hash_merge_kwd,
+    id_core_raise,
+    id_core_sprintf,
+    id_debug_created_info,
+    tPRESERVED_ID_END,
+    tTOKEN_LOCAL_BEGIN = tPRESERVED_ID_END-1,
+    tMax,
+    tMin,
+    tFreeze,
+    tInspect,
+    tIntern,
+    tObject_id,
+    tConst_missing,
+    tMethodMissing,
+    tMethod_added,
+    tSingleton_method_added,
+    tMethod_removed,
+    tSingleton_method_removed,
+    tMethod_undefined,
+    tSingleton_method_undefined,
+    tLength,
+    tSize,
+    tGets,
+    tSucc,
+    tEach,
+    tProc,
+    tLambda,
+    tSend,
+    t__send__,
+    t__attached__,
+    t__recursive_key__,
+    tInitialize,
+    tInitialize_copy,
+    tInitialize_clone,
+    tInitialize_dup,
+    tTo_int,
+    tTo_ary,
+    tTo_str,
+    tTo_sym,
+    tTo_hash,
+    tTo_proc,
+    tTo_io,
+    tTo_a,
+    tTo_s,
+    tTo_i,
+    tTo_f,
+    tTo_r,
+    tBt,
+    tBt_locations,
+    tCall,
+    tMesg,
+    tException,
+    tLocals,
+    tNOT,
+    tAND,
+    tOR,
+    tDiv,
+    tDivmod,
+    tFdiv,
+    tQuo,
+    tName,
+    tNil,
+    tUScore,
+    tNUMPARAM_1,
+    tNUMPARAM_2,
+    tNUMPARAM_3,
+    tNUMPARAM_4,
+    tNUMPARAM_5,
+    tNUMPARAM_6,
+    tNUMPARAM_7,
+    tNUMPARAM_8,
+    tNUMPARAM_9,
+    tTOKEN_LOCAL_END,
+    tTOKEN_INSTANCE_BEGIN = tTOKEN_LOCAL_END-1,
+    tTOKEN_INSTANCE_END,
+    tTOKEN_GLOBAL_BEGIN = tTOKEN_INSTANCE_END-1,
+    tLASTLINE,
+    tBACKREF,
+    tERROR_INFO,
+    tTOKEN_GLOBAL_END,
+    tTOKEN_CONST_BEGIN = tTOKEN_GLOBAL_END-1,
+    tTOKEN_CONST_END,
+    tTOKEN_CLASS_BEGIN = tTOKEN_CONST_END-1,
+    tTOKEN_CLASS_END,
+    tTOKEN_ATTRSET_BEGIN = tTOKEN_CLASS_END-1,
+    tTOKEN_ATTRSET_END,
+    tNEXT_ID = tTOKEN_ATTRSET_END,
+#define DEFINE_LOCALID_FROM_TOKEN(n) id##n = TOKEN2LOCALID(t##n)
+    DEFINE_LOCALID_FROM_TOKEN(Max),
+    DEFINE_LOCALID_FROM_TOKEN(Min),
+    DEFINE_LOCALID_FROM_TOKEN(Freeze),
+    DEFINE_LOCALID_FROM_TOKEN(Inspect),
+    DEFINE_LOCALID_FROM_TOKEN(Intern),
+    DEFINE_LOCALID_FROM_TOKEN(Object_id),
+    DEFINE_LOCALID_FROM_TOKEN(Const_missing),
+    DEFINE_LOCALID_FROM_TOKEN(MethodMissing),
+    DEFINE_LOCALID_FROM_TOKEN(Method_added),
+    DEFINE_LOCALID_FROM_TOKEN(Singleton_method_added),
+    DEFINE_LOCALID_FROM_TOKEN(Method_removed),
+    DEFINE_LOCALID_FROM_TOKEN(Singleton_method_removed),
+    DEFINE_LOCALID_FROM_TOKEN(Method_undefined),
+    DEFINE_LOCALID_FROM_TOKEN(Singleton_method_undefined),
+    DEFINE_LOCALID_FROM_TOKEN(Length),
+    DEFINE_LOCALID_FROM_TOKEN(Size),
+    DEFINE_LOCALID_FROM_TOKEN(Gets),
+    DEFINE_LOCALID_FROM_TOKEN(Succ),
+    DEFINE_LOCALID_FROM_TOKEN(Each),
+    DEFINE_LOCALID_FROM_TOKEN(Proc),
+    DEFINE_LOCALID_FROM_TOKEN(Lambda),
+    DEFINE_LOCALID_FROM_TOKEN(Send),
+    DEFINE_LOCALID_FROM_TOKEN(__send__),
+    DEFINE_LOCALID_FROM_TOKEN(__attached__),
+    DEFINE_LOCALID_FROM_TOKEN(__recursive_key__),
+    DEFINE_LOCALID_FROM_TOKEN(Initialize),
+    DEFINE_LOCALID_FROM_TOKEN(Initialize_copy),
+    DEFINE_LOCALID_FROM_TOKEN(Initialize_clone),
+    DEFINE_LOCALID_FROM_TOKEN(Initialize_dup),
+    DEFINE_LOCALID_FROM_TOKEN(To_int),
+    DEFINE_LOCALID_FROM_TOKEN(To_ary),
+    DEFINE_LOCALID_FROM_TOKEN(To_str),
+    DEFINE_LOCALID_FROM_TOKEN(To_sym),
+    DEFINE_LOCALID_FROM_TOKEN(To_hash),
+    DEFINE_LOCALID_FROM_TOKEN(To_proc),
+    DEFINE_LOCALID_FROM_TOKEN(To_io),
+    DEFINE_LOCALID_FROM_TOKEN(To_a),
+    DEFINE_LOCALID_FROM_TOKEN(To_s),
+    DEFINE_LOCALID_FROM_TOKEN(To_i),
+    DEFINE_LOCALID_FROM_TOKEN(To_f),
+    DEFINE_LOCALID_FROM_TOKEN(To_r),
+    DEFINE_LOCALID_FROM_TOKEN(Bt),
+    DEFINE_LOCALID_FROM_TOKEN(Bt_locations),
+    DEFINE_LOCALID_FROM_TOKEN(Call),
+    DEFINE_LOCALID_FROM_TOKEN(Mesg),
+    DEFINE_LOCALID_FROM_TOKEN(Exception),
+    DEFINE_LOCALID_FROM_TOKEN(Locals),
+    DEFINE_LOCALID_FROM_TOKEN(NOT),
+    DEFINE_LOCALID_FROM_TOKEN(AND),
+    DEFINE_LOCALID_FROM_TOKEN(OR),
+    DEFINE_LOCALID_FROM_TOKEN(Div),
+    DEFINE_LOCALID_FROM_TOKEN(Divmod),
+    DEFINE_LOCALID_FROM_TOKEN(Fdiv),
+    DEFINE_LOCALID_FROM_TOKEN(Quo),
+    DEFINE_LOCALID_FROM_TOKEN(Name),
+    DEFINE_LOCALID_FROM_TOKEN(Nil),
+    DEFINE_LOCALID_FROM_TOKEN(UScore),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_1),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_2),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_3),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_4),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_5),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_6),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_7),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_8),
+    DEFINE_LOCALID_FROM_TOKEN(NUMPARAM_9),
+#define DEFINE_INSTANCEID_FROM_TOKEN(n) id##n = TOKEN2INSTANCEID(t##n)
+#define DEFINE_GLOBALID_FROM_TOKEN(n) id##n = TOKEN2GLOBALID(t##n)
+    DEFINE_GLOBALID_FROM_TOKEN(LASTLINE),
+    DEFINE_GLOBALID_FROM_TOKEN(BACKREF),
+    DEFINE_GLOBALID_FROM_TOKEN(ERROR_INFO),
+#define DEFINE_CONSTID_FROM_TOKEN(n) id##n = TOKEN2CONSTID(t##n)
+#define DEFINE_CLASSID_FROM_TOKEN(n) id##n = TOKEN2CLASSID(t##n)
+#define DEFINE_ATTRSETID_FROM_TOKEN(n) id##n = TOKEN2ATTRSETID(t##n)
+    tLAST_OP_ID = tPRESERVED_ID_END-1,
+    idLAST_OP_ID = tLAST_OP_ID >> ID_SCOPE_SHIFT
+};
+
+#endif /* RUBY_ID_H */

data/lib/datadog/ruby_core_source/ruby-3.1.0-p0/id_table.h

@@ -0,0 +1,36 @@
+#ifndef RUBY_ID_TABLE_H
+#define RUBY_ID_TABLE_H 1
+#include "ruby/internal/config.h"
+#include <stddef.h>
+#include "ruby/ruby.h"
+
+struct rb_id_table;
+
+/* compatible with ST_* */
+enum rb_id_table_iterator_result {
+    ID_TABLE_CONTINUE = ST_CONTINUE,
+    ID_TABLE_STOP     = ST_STOP,
+    ID_TABLE_DELETE   = ST_DELETE,
+    ID_TABLE_REPLACE  = ST_REPLACE,
+    ID_TABLE_ITERATOR_RESULT_END
+};
+
+struct rb_id_table *rb_id_table_create(size_t size);
+void rb_id_table_free(struct rb_id_table *tbl);
+void rb_id_table_clear(struct rb_id_table *tbl);
+
+size_t rb_id_table_size(const struct rb_id_table *tbl);
+size_t rb_id_table_memsize(const struct rb_id_table *tbl);
+
+int rb_id_table_insert(struct rb_id_table *tbl, ID id, VALUE val);
+int rb_id_table_lookup(struct rb_id_table *tbl, ID id, VALUE *valp);
+int rb_id_table_delete(struct rb_id_table *tbl, ID id);
+
+typedef enum rb_id_table_iterator_result rb_id_table_update_callback_func_t(ID *id, VALUE *val, void *data, int existing);
+typedef enum rb_id_table_iterator_result rb_id_table_foreach_func_t(ID id, VALUE val, void *data);
+typedef enum rb_id_table_iterator_result rb_id_table_foreach_values_func_t(VALUE val, void *data);
+void rb_id_table_foreach(struct rb_id_table *tbl, rb_id_table_foreach_func_t *func, void *data);
+void rb_id_table_foreach_with_replace(struct rb_id_table *tbl, rb_id_table_foreach_func_t *func, rb_id_table_update_callback_func_t *replace, void *data);
+void rb_id_table_foreach_values(struct rb_id_table *tbl, rb_id_table_foreach_values_func_t *func, void *data);
+
+#endif	/* RUBY_ID_TABLE_H */

data/lib/datadog/ruby_core_source/ruby-3.1.0-p0/internal/array.h

@@ -0,0 +1,113 @@
+#ifndef INTERNAL_ARRAY_H                                 /*-*-C-*-vi:se ft=c:*/
+#define INTERNAL_ARRAY_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.
+ * @brief      Internal header for Array.
+ */
+#include "ruby/internal/config.h"
+#include <stddef.h>                 /* for size_t */
+#include "internal/static_assert.h" /* for STATIC_ASSERT */
+#include "ruby/internal/stdbool.h"         /* for bool */
+#include "ruby/ruby.h"              /* for RARRAY_LEN */
+
+#ifndef ARRAY_DEBUG
+# define ARRAY_DEBUG (0+RUBY_DEBUG)
+#endif
+
+#define RARRAY_PTR_IN_USE_FLAG FL_USER14
+
+/* array.c */
+VALUE rb_ary_last(int, const VALUE *, VALUE);
+void rb_ary_set_len(VALUE, long);
+void rb_ary_delete_same(VALUE, VALUE);
+VALUE rb_ary_tmp_new_fill(long capa);
+VALUE rb_ary_at(VALUE, VALUE);
+size_t rb_ary_memsize(VALUE);
+VALUE rb_to_array_type(VALUE obj);
+VALUE rb_to_array(VALUE obj);
+void rb_ary_cancel_sharing(VALUE ary);
+
+static inline VALUE rb_ary_entry_internal(VALUE ary, long offset);
+static inline bool ARY_PTR_USING_P(VALUE ary);
+static inline void RARY_TRANSIENT_SET(VALUE ary);
+static inline void RARY_TRANSIENT_UNSET(VALUE ary);
+
+MJIT_SYMBOL_EXPORT_BEGIN
+VALUE rb_ary_tmp_new_from_values(VALUE, long, const VALUE *);
+VALUE rb_check_to_array(VALUE ary);
+VALUE rb_ary_behead(VALUE, long);
+VALUE rb_ary_aref1(VALUE ary, VALUE i);
+
+struct rb_execution_context_struct;
+VALUE rb_ec_ary_new_from_values(struct rb_execution_context_struct *ec, long n, const VALUE *elts);
+MJIT_SYMBOL_EXPORT_END
+
+// YJIT needs this function to never allocate and never raise
+static inline VALUE
+rb_ary_entry_internal(VALUE ary, long offset)
+{
+    long len = RARRAY_LEN(ary);
+    const VALUE *ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
+    if (len == 0) return Qnil;
+    if (offset < 0) {
+        offset += len;
+        if (offset < 0) return Qnil;
+    }
+    else if (len <= offset) {
+        return Qnil;
+    }
+    return ptr[offset];
+}
+
+static inline bool
+ARY_PTR_USING_P(VALUE ary)
+{
+    return FL_TEST_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
+}
+
+static inline void
+RARY_TRANSIENT_SET(VALUE ary)
+{
+#if USE_TRANSIENT_HEAP
+    FL_SET_RAW(ary, RARRAY_TRANSIENT_FLAG);
+#endif
+}
+
+static inline void
+RARY_TRANSIENT_UNSET(VALUE ary)
+{
+#if USE_TRANSIENT_HEAP
+    FL_UNSET_RAW(ary, RARRAY_TRANSIENT_FLAG);
+#endif
+}
+
+#undef rb_ary_new_from_args
+#if RBIMPL_HAS_WARNING("-Wgnu-zero-variadic-macro-arguments")
+# /* Skip it; clang -pedantic doesn't like the following */
+#elif defined(__GNUC__) && defined(HAVE_VA_ARGS_MACRO)
+#define rb_ary_new_from_args(n, ...) \
+    __extension__ ({ \
+        const VALUE args_to_new_ary[] = {__VA_ARGS__}; \
+        if (__builtin_constant_p(n)) { \
+            STATIC_ASSERT(rb_ary_new_from_args, numberof(args_to_new_ary) == (n)); \
+        } \
+        rb_ary_new_from_values(numberof(args_to_new_ary), args_to_new_ary); \
+    })
+#endif
+
+#undef RARRAY_AREF
+RBIMPL_ATTR_PURE_UNLESS_DEBUG()
+RBIMPL_ATTR_ARTIFICIAL()
+static inline VALUE
+RARRAY_AREF(VALUE ary, long i)
+{
+    RBIMPL_ASSERT_TYPE(ary, RUBY_T_ARRAY);
+
+    return RARRAY_CONST_PTR_TRANSIENT(ary)[i];
+}
+
+#endif /* INTERNAL_ARRAY_H */