RARRAY             39 array.c        #define ARY_HEAP_PTR(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
RARRAY             40 array.c        #define ARY_HEAP_LEN(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
RARRAY             41 array.c        #define ARY_EMBED_PTR(a) (assert(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
RARRAY             46 array.c        #define ARY_HEAP_SIZE(a) (assert(!ARY_EMBED_P(a)), assert(ARY_OWNS_HEAP_P(a)), RARRAY(a)->as.heap.aux.capa * sizeof(VALUE))
RARRAY             63 array.c            RARRAY(ary)->as.heap.ptr = (p); \
RARRAY             74 array.c            RARRAY(ary)->as.heap.len = (n); \
RARRAY             88 array.c            RARRAY(ary)->as.heap.ptr += (n); \
RARRAY             96 array.c                RARRAY(ary)->as.heap.len += (n); \
RARRAY            101 array.c        		       ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : RARRAY(ary)->as.heap.aux.capa)
RARRAY            106 array.c            RARRAY(ary)->as.heap.aux.capa = (n); \
RARRAY            109 array.c        #define ARY_SHARED(ary) (assert(ARY_SHARED_P(ary)), RARRAY(ary)->as.heap.aux.shared)
RARRAY            116 array.c            RB_OBJ_WRITE(_ary_, &RARRAY(_ary_)->as.heap.aux.shared, _value_); \
RARRAY            121 array.c            (assert(ARY_SHARED_ROOT_P(ary)), RARRAY(ary)->as.heap.aux.capa)
RARRAY            125 array.c            RARRAY(ary)->as.heap.aux.capa = (value); \
RARRAY            216 array.c        	    SIZED_REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, capacity, RARRAY(ary)->as.heap.aux.capa);
RARRAY            226 array.c                    MEMCPY((VALUE *)RARRAY(ary)->as.ary, ptr, VALUE, len);
RARRAY            238 array.c            long old_capa = RARRAY(ary)->as.heap.aux.capa;
RARRAY            242 array.c        	REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, capacity);
RARRAY            278 array.c            VALUE shared = RARRAY(ary)->as.heap.aux.shared;
RARRAY            435 array.c        	RARRAY(ary1)->as.heap.aux.shared == RARRAY(ary2)->as.heap.aux.shared &&
RARRAY            436 array.c        	RARRAY(ary1)->as.heap.len == RARRAY(ary2)->as.heap.len) {
RARRAY            558 array.c        	return RARRAY(ary)->as.heap.aux.capa * sizeof(VALUE);
RARRAY           1680 array.c        	    SIZED_REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, len, RARRAY(ary)->as.heap.aux.capa);
RARRAY             42 ext/tk/tcltklib.c #define RARRAY_PTR(s) (RARRAY(s)->ptr)
RARRAY             43 ext/tk/tcltklib.c #define RARRAY_LEN(s) (RARRAY(s)->len)
RARRAY             37 ext/tk/tkutil/tkutil.c #define RARRAY_PTR(s) (RARRAY(s)->ptr)
RARRAY             38 ext/tk/tkutil/tkutil.c #define RARRAY_LEN(s) (RARRAY(s)->len)
RARRAY           2024 include/ruby/ruby.h 	RARRAY_EMBED_LEN(a) : RARRAY(a)->as.heap.len;
RARRAY           2039 include/ruby/ruby.h 	RARRAY(a)->as.ary : RARRAY(a)->as.heap.ptr);