* ruby.h (struct RArray): embed small arrays.

  (RARRAY_LEN): defined for accessing array members.
  (RARRAY_PTR): ditto.

* array.c: use RARRAY_LEN and RARRAY_PTR.


git-svn-id: http://svn.ruby-lang.org/repos/ruby/trunk@10833 b2dd03c8-39d4-4d8f-98ff-823fe69b080e

1 files changed, 6 insertions, 6 deletions

diff --git a/process.c b/process.c
index 4797f5d1f..843320193 100644
--- a/process.c
+++ b/process.c
@@ -1167,11 +1167,11 @@ rb_check_argv(int argc, VALUE *argv)
     prog = 0;
     tmp = rb_check_array_type(argv[0]);
     if (!NIL_P(tmp)) {
-	if (RARRAY(tmp)->len != 2) {
+	if (RARRAY_LEN(tmp) != 2) {
 	    rb_raise(rb_eArgError, "wrong first argument");
 	}
-	prog = RARRAY(tmp)->ptr[0];
-	argv[0] = RARRAY(tmp)->ptr[1];
+	prog = RARRAY_PTR(tmp)[0];
+	argv[0] = RARRAY_PTR(tmp)[1];
 	SafeStringValue(prog);
     }
     for (i = 0; i < argc; i++) {
@@ -2647,14 +2647,14 @@ proc_setgroups(VALUE obj, VALUE ary)
 
     Check_Type(ary, T_ARRAY);
 
-    ngroups = RARRAY(ary)->len;
+    ngroups = RARRAY_LEN(ary);
     if (ngroups > maxgroups)
 	rb_raise(rb_eArgError, "too many groups, %lu max", (unsigned long)maxgroups);
 
     groups = ALLOCA_N(rb_gid_t, ngroups);
 
-    for (i = 0; i < ngroups && i < RARRAY(ary)->len; i++) {
-	VALUE g = RARRAY(ary)->ptr[i];
+    for (i = 0; i < ngroups && i < RARRAY_LEN(ary); i++) {
+	VALUE g = RARRAY_PTR(ary)[i];
 
 	if (FIXNUM_P(g)) {
 	    groups[i] = FIX2INT(g);