kotovalexarian-likes-github/ruby--ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00
Code Releases Activity

* gc.c (count_objects): ObjectSpace.count_objects implemented.

Browse source 
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@13810 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
akr 2007-11-03 15:09:10 +00:00
parent 6e8eea7abe
commit 16c8ac3921
2 changed files with 95 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
ChangeLog
View file

@ -1,3 +1,7 @@
Sun Nov 4 00:06:40 2007 Tanaka Akira <akr@fsij.org>
* gc.c (count_objects): ObjectSpace.count_objects implemented.
Sat Nov 3 22:49:37 2007 Yukihiro Matsumoto <matz@ruby-lang.org>
* hash.c (rb_hash_each_pair): make Hash#each to be alias to

91
gc.c
View file

@ -2149,6 +2149,95 @@ rb_obj_id(VALUE obj)
return (VALUE)((SIGNED_VALUE)obj|FIXNUM_FLAG);
}
/*
* call-seq:
* ObjectSpace.count_objects([result_hash]) -> hash
*
* Counts objects for each type.
*
* It returns a hash as: {:FREE=>3012, :T_OBJECT=>6, :T_CLASS=>404, ...}
*
* If the optional argument, result_hash, is given,
* it is overwritten and returned.
* This is intended to avoid probe effect.
*
* The contents of the returned hash is implementation defined.
* It may be changed in future.
*
* This method is not expected to work except C Ruby.
*
*/
static VALUE
count_objects(int argc, VALUE *argv, VALUE os)
{
long counts[T_MASK+1];
long freed = 0;
int i;
VALUE hash;
if (rb_scan_args(argc, argv, "01", &hash) == 1) {
if (TYPE(hash) != T_HASH)
rb_raise(rb_eTypeError, "non-hash given");
}
for (i = 0; i <= T_MASK; i++) {
counts[i] = 0;
}
for (i = 0; i < heaps_used; i++) {
RVALUE *p, *pend;
p = heaps[i].slot; pend = p + heaps[i].limit;
for (;p < pend; p++) {
if (p->as.basic.flags) {
counts[BUILTIN_TYPE(p)]++;
}
else {
freed++;
}
}
}
if (hash == Qnil)
hash = rb_hash_new();
rb_hash_aset(hash, ID2SYM(rb_intern("FREE")), LONG2NUM(freed));
for (i = 0; i <= T_MASK; i++) {
VALUE type;
switch (i) {
case T_NONE: type = ID2SYM(rb_intern("T_NONE")); break;
case T_NIL: type = ID2SYM(rb_intern("T_NIL")); break;
case T_OBJECT: type = ID2SYM(rb_intern("T_OBJECT")); break;
case T_CLASS: type = ID2SYM(rb_intern("T_CLASS")); break;
case T_ICLASS: type = ID2SYM(rb_intern("T_ICLASS")); break;
case T_MODULE: type = ID2SYM(rb_intern("T_MODULE")); break;
case T_FLOAT: type = ID2SYM(rb_intern("T_FLOAT")); break;
case T_STRING: type = ID2SYM(rb_intern("T_STRING")); break;
case T_REGEXP: type = ID2SYM(rb_intern("T_REGEXP")); break;
case T_ARRAY: type = ID2SYM(rb_intern("T_ARRAY")); break;
case T_FIXNUM: type = ID2SYM(rb_intern("T_FIXNUM")); break;
case T_HASH: type = ID2SYM(rb_intern("T_HASH")); break;
case T_STRUCT: type = ID2SYM(rb_intern("T_STRUCT")); break;
case T_BIGNUM: type = ID2SYM(rb_intern("T_BIGNUM")); break;
case T_FILE: type = ID2SYM(rb_intern("T_FILE")); break;
case T_TRUE: type = ID2SYM(rb_intern("T_TRUE")); break;
case T_FALSE: type = ID2SYM(rb_intern("T_FALSE")); break;
case T_DATA: type = ID2SYM(rb_intern("T_DATA")); break;
case T_MATCH: type = ID2SYM(rb_intern("T_MATCH")); break;
case T_SYMBOL: type = ID2SYM(rb_intern("T_SYMBOL")); break;
case T_VALUES: type = ID2SYM(rb_intern("T_VALUES")); break;
case T_BLOCK: type = ID2SYM(rb_intern("T_BLOCK")); break;
case T_UNDEF: type = ID2SYM(rb_intern("T_UNDEF")); break;
case T_NODE: type = ID2SYM(rb_intern("T_NODE")); break;
default: type = INT2NUM(i); break;
}
if (counts[i])
rb_hash_aset(hash, type, LONG2NUM(counts[i]));
}
return hash;
}
/*
* The <code>GC</code> module provides an interface to Ruby's mark and
* sweep garbage collection mechanism. Some of the underlying methods
@ -2194,4 +2283,6 @@ Init_GC(void)
rb_define_method(rb_mKernel, "hash", rb_obj_id, 0);
rb_define_method(rb_mKernel, "__id__", rb_obj_id, 0);
rb_define_method(rb_mKernel, "object_id", rb_obj_id, 0);
rb_define_module_function(rb_mObSpace, "count_objects", count_objects, -1);
}