1 files changed, 18 insertions, 49 deletions

diff --git a/internal/array.h b/internal/array.h
index 66017129c8..60f66f31bf 100644
--- a/internal/array.h
+++ b/internal/array.h
@@ -18,29 +18,25 @@
 # define ARRAY_DEBUG (0+RUBY_DEBUG)
 #endif
 
-#define RARRAY_SHARED_FLAG      ELTS_SHARED
-#define RARRAY_SHARED_ROOT_FLAG FL_USER12
-#define RARRAY_PTR_IN_USE_FLAG  FL_USER14
+#define RARRAY_PTR_IN_USE_FLAG FL_USER14
 
 /* array.c */
-VALUE rb_ary_hash_values(long len, const VALUE *elements);
 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_hidden_new_fill(long capa);
+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);
-size_t rb_ary_size_as_embedded(VALUE ary);
-void rb_ary_make_embedded(VALUE ary);
-bool rb_ary_embeddable_p(VALUE ary);
-VALUE rb_ary_diff(VALUE ary1, VALUE ary2);
 
 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);
@@ -48,13 +44,14 @@ 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(ary);
+    const VALUE *ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
     if (len == 0) return Qnil;
     if (offset < 0) {
         offset += len;
@@ -72,48 +69,20 @@ ARY_PTR_USING_P(VALUE ary)
     return FL_TEST_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
 }
 
-RBIMPL_ATTR_MAYBE_UNUSED()
-static inline int
-ary_should_not_be_shared_and_embedded(VALUE ary)
+static inline void
+RARY_TRANSIENT_SET(VALUE ary)
 {
-    return !FL_ALL_RAW(ary, RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG);
-}
-
-static inline bool
-ARY_SHARED_P(VALUE ary)
-{
-    assert(RB_TYPE_P(ary, T_ARRAY));
-    assert(ary_should_not_be_shared_and_embedded(ary));
-    return FL_TEST_RAW(ary, RARRAY_SHARED_FLAG);
-}
-
-static inline bool
-ARY_EMBED_P(VALUE ary)
-{
-    assert(RB_TYPE_P(ary, T_ARRAY));
-    assert(ary_should_not_be_shared_and_embedded(ary));
-    return FL_TEST_RAW(ary, RARRAY_EMBED_FLAG);
-}
-
-static inline VALUE
-ARY_SHARED_ROOT(VALUE ary)
-{
-    assert(ARY_SHARED_P(ary));
-    return RARRAY(ary)->as.heap.aux.shared_root;
-}
-
-static inline bool
-ARY_SHARED_ROOT_P(VALUE ary)
-{
-    assert(RB_TYPE_P(ary, T_ARRAY));
-    return FL_TEST_RAW(ary, RARRAY_SHARED_ROOT_FLAG);
+#if USE_TRANSIENT_HEAP
+    FL_SET_RAW(ary, RARRAY_TRANSIENT_FLAG);
+#endif
 }
 
-static inline long
-ARY_SHARED_ROOT_REFCNT(VALUE ary)
+static inline void
+RARY_TRANSIENT_UNSET(VALUE ary)
 {
-    assert(ARY_SHARED_ROOT_P(ary));
-    return RARRAY(ary)->as.heap.aux.capa;
+#if USE_TRANSIENT_HEAP
+    FL_UNSET_RAW(ary, RARRAY_TRANSIENT_FLAG);
+#endif
 }
 
 #undef rb_ary_new_from_args
@@ -138,7 +107,7 @@ RARRAY_AREF(VALUE ary, long i)
 {
     RBIMPL_ASSERT_TYPE(ary, RUBY_T_ARRAY);
 
-    return RARRAY_CONST_PTR(ary)[i];
+    return RARRAY_CONST_PTR_TRANSIENT(ary)[i];
 }
 
 #endif /* INTERNAL_ARRAY_H */