* array.c (tmpbuf): use rb_str_tmp_new().

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@14714 b2dd03c8-39d4-4d8f-98ff-823fe69b080e

1 files changed, 2 insertions, 8 deletions

diff --git a/array.c b/array.c
index 0a3fb64b24..a2cf86a24c 100644
--- a/array.c
+++ b/array.c
@@ -2969,14 +2969,8 @@ rb_ary_cycle(VALUE ary)
     return Qnil;
 }
 
-static VALUE
-tmpbuf(int n, int size)
-{
-    VALUE buf = rb_str_new(0, n*size);
-
-    RBASIC(buf)->klass = 0;
-    return buf;
-}
+VALUE rb_str_tmp_new(long);
+#define tmpbuf(n, size) rb_str_tmp_new((n)*(size))
 
 /*
  * Recursively compute permutations of r elements of the set [0..n-1].