2009-06-16 19:56:48 -04:00
|
|
|
/**********************************************************************
|
|
|
|
|
|
|
|
objspace.c - ObjectSpace extender for MRI.
|
|
|
|
|
|
|
|
$Author$
|
|
|
|
created at: Wed Jun 17 07:39:17 2009
|
|
|
|
|
|
|
|
NOTE: This extension library is not expected to exist except C Ruby.
|
|
|
|
|
|
|
|
All the files in this distribution are covered under the Ruby's
|
|
|
|
license (see the file COPYING).
|
|
|
|
|
|
|
|
**********************************************************************/
|
|
|
|
|
|
|
|
#include <ruby/ruby.h>
|
|
|
|
#include <ruby/st.h>
|
|
|
|
#include <ruby/io.h>
|
|
|
|
#include <ruby/re.h>
|
2010-08-14 06:12:13 -04:00
|
|
|
#include "node.h"
|
|
|
|
#include "gc.h"
|
|
|
|
#include "regint.h"
|
2011-05-18 09:41:54 -04:00
|
|
|
#include "internal.h"
|
2009-06-16 19:56:48 -04:00
|
|
|
|
|
|
|
size_t rb_str_memsize(VALUE);
|
|
|
|
size_t rb_ary_memsize(VALUE);
|
2010-08-14 02:19:57 -04:00
|
|
|
size_t rb_io_memsize(const rb_io_t *);
|
2009-06-22 10:25:04 -04:00
|
|
|
size_t rb_generic_ivar_memsize(VALUE);
|
2009-06-16 19:56:48 -04:00
|
|
|
size_t rb_objspace_data_type_memsize(VALUE obj);
|
|
|
|
|
|
|
|
static size_t
|
|
|
|
memsize_of(VALUE obj)
|
|
|
|
{
|
|
|
|
size_t size = 0;
|
|
|
|
|
|
|
|
if (SPECIAL_CONST_P(obj)) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (FL_TEST(obj, FL_EXIVAR)) {
|
2009-06-22 10:25:04 -04:00
|
|
|
size += rb_generic_ivar_memsize(obj);
|
2009-06-16 19:56:48 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
switch (BUILTIN_TYPE(obj)) {
|
|
|
|
case T_OBJECT:
|
|
|
|
if (!(RBASIC(obj)->flags & ROBJECT_EMBED) &&
|
|
|
|
ROBJECT(obj)->as.heap.ivptr) {
|
|
|
|
size += ROBJECT(obj)->as.heap.numiv * sizeof(VALUE);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_MODULE:
|
|
|
|
case T_CLASS:
|
2012-06-27 07:36:15 -04:00
|
|
|
if (RCLASS_M_TBL(obj)) {
|
|
|
|
size += st_memsize(RCLASS_M_TBL(obj));
|
|
|
|
}
|
2009-06-16 19:56:48 -04:00
|
|
|
if (RCLASS_IV_TBL(obj)) {
|
|
|
|
size += st_memsize(RCLASS_IV_TBL(obj));
|
|
|
|
}
|
|
|
|
if (RCLASS_IV_INDEX_TBL(obj)) {
|
|
|
|
size += st_memsize(RCLASS_IV_INDEX_TBL(obj));
|
|
|
|
}
|
|
|
|
if (RCLASS(obj)->ptr->iv_tbl) {
|
|
|
|
size += st_memsize(RCLASS(obj)->ptr->iv_tbl);
|
|
|
|
}
|
2010-10-29 11:29:16 -04:00
|
|
|
if (RCLASS(obj)->ptr->const_tbl) {
|
|
|
|
size += st_memsize(RCLASS(obj)->ptr->const_tbl);
|
|
|
|
}
|
2009-06-16 19:56:48 -04:00
|
|
|
size += sizeof(rb_classext_t);
|
|
|
|
break;
|
|
|
|
case T_STRING:
|
|
|
|
size += rb_str_memsize(obj);
|
|
|
|
break;
|
|
|
|
case T_ARRAY:
|
|
|
|
size += rb_ary_memsize(obj);
|
|
|
|
break;
|
|
|
|
case T_HASH:
|
|
|
|
if (RHASH(obj)->ntbl) {
|
|
|
|
size += st_memsize(RHASH(obj)->ntbl);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_REGEXP:
|
|
|
|
if (RREGEXP(obj)->ptr) {
|
|
|
|
size += onig_memsize(RREGEXP(obj)->ptr);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_DATA:
|
|
|
|
size += rb_objspace_data_type_memsize(obj);
|
|
|
|
break;
|
|
|
|
case T_MATCH:
|
|
|
|
if (RMATCH(obj)->rmatch) {
|
|
|
|
struct rmatch *rm = RMATCH(obj)->rmatch;
|
2011-12-14 23:15:54 -05:00
|
|
|
size += onig_region_memsize(&rm->regs);
|
2009-06-16 19:56:48 -04:00
|
|
|
size += sizeof(struct rmatch_offset) * rm->char_offset_num_allocated;
|
|
|
|
size += sizeof(struct rmatch);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_FILE:
|
|
|
|
if (RFILE(obj)->fptr) {
|
|
|
|
size += rb_io_memsize(RFILE(obj)->fptr);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_RATIONAL:
|
|
|
|
case T_COMPLEX:
|
|
|
|
break;
|
|
|
|
case T_ICLASS:
|
|
|
|
/* iClass shares table with the module */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case T_FLOAT:
|
|
|
|
break;
|
|
|
|
|
|
|
|
case T_BIGNUM:
|
|
|
|
if (!(RBASIC(obj)->flags & RBIGNUM_EMBED_FLAG) && RBIGNUM_DIGITS(obj)) {
|
|
|
|
size += RBIGNUM_LEN(obj) * sizeof(BDIGIT);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case T_NODE:
|
|
|
|
switch (nd_type(obj)) {
|
|
|
|
case NODE_SCOPE:
|
|
|
|
if (RNODE(obj)->u1.tbl) {
|
|
|
|
/* TODO: xfree(RANY(obj)->as.node.u1.tbl); */
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case NODE_ALLOCA:
|
|
|
|
/* TODO: xfree(RANY(obj)->as.node.u1.node); */
|
|
|
|
;
|
|
|
|
}
|
|
|
|
break; /* no need to free iv_tbl */
|
|
|
|
|
|
|
|
case T_STRUCT:
|
|
|
|
if ((RBASIC(obj)->flags & RSTRUCT_EMBED_LEN_MASK) == 0 &&
|
|
|
|
RSTRUCT(obj)->as.heap.ptr) {
|
|
|
|
size += sizeof(VALUE) * RSTRUCT_LEN(obj);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2010-08-14 05:01:12 -04:00
|
|
|
case T_ZOMBIE:
|
|
|
|
break;
|
|
|
|
|
2009-06-16 19:56:48 -04:00
|
|
|
default:
|
|
|
|
rb_bug("objspace/memsize_of(): unknown data type 0x%x(%p)",
|
|
|
|
BUILTIN_TYPE(obj), (void*)obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* ObjectSpace.memsize_of(obj) -> Integer
|
|
|
|
*
|
|
|
|
* Return consuming memory size of obj.
|
|
|
|
*
|
2010-10-27 14:16:39 -04:00
|
|
|
* Note that the return size is incomplete. You need to deal with
|
2011-08-07 01:13:02 -04:00
|
|
|
* this information as only a *HINT*. Especially, the size of
|
2010-10-27 14:16:39 -04:00
|
|
|
* T_DATA may not be correct.
|
2009-06-16 19:56:48 -04:00
|
|
|
*
|
|
|
|
* This method is not expected to work except C Ruby.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
memsize_of_m(VALUE self, VALUE obj)
|
|
|
|
{
|
|
|
|
return SIZET2NUM(memsize_of(obj));
|
|
|
|
}
|
|
|
|
|
2010-10-28 16:23:21 -04:00
|
|
|
struct total_data {
|
|
|
|
size_t total;
|
|
|
|
VALUE klass;
|
|
|
|
};
|
|
|
|
|
2010-10-27 14:16:39 -04:00
|
|
|
static int
|
2010-10-28 16:23:21 -04:00
|
|
|
total_i(void *vstart, void *vend, size_t stride, void *ptr)
|
2010-10-27 14:16:39 -04:00
|
|
|
{
|
|
|
|
VALUE v;
|
2010-10-28 16:23:21 -04:00
|
|
|
struct total_data *data = (struct total_data *)ptr;
|
2010-10-27 14:16:39 -04:00
|
|
|
|
|
|
|
for (v = (VALUE)vstart; v != (VALUE)vend; v += stride) {
|
|
|
|
if (RBASIC(v)->flags) {
|
2011-06-12 15:44:48 -04:00
|
|
|
switch (BUILTIN_TYPE(v)) {
|
|
|
|
case T_NONE:
|
|
|
|
case T_ICLASS:
|
|
|
|
case T_NODE:
|
|
|
|
case T_ZOMBIE:
|
|
|
|
continue;
|
|
|
|
case T_CLASS:
|
|
|
|
if (FL_TEST(v, FL_SINGLETON))
|
|
|
|
continue;
|
|
|
|
default:
|
|
|
|
if (data->klass == 0 || rb_obj_is_kind_of(v, data->klass)) {
|
|
|
|
data->total += memsize_of(v);
|
|
|
|
}
|
2010-10-28 16:23:21 -04:00
|
|
|
}
|
2010-10-27 14:16:39 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
2010-10-28 16:23:21 -04:00
|
|
|
* ObjectSpace.memsize_of_all([klass]) -> Integer
|
2010-10-27 14:16:39 -04:00
|
|
|
*
|
|
|
|
* Return consuming memory size of all living objects.
|
2010-10-28 16:23:21 -04:00
|
|
|
* If klass (should be Class object) is given, return the total
|
|
|
|
* memory size of instances of the given class.
|
2010-10-27 14:16:39 -04:00
|
|
|
*
|
|
|
|
* Note that the returned size is incomplete. You need to deal with
|
2011-08-07 01:13:02 -04:00
|
|
|
* this information as only a *HINT*. Especially, the size of
|
2010-10-27 14:16:39 -04:00
|
|
|
* T_DATA may not be correct.
|
|
|
|
*
|
|
|
|
* Note that this method does *NOT* return total malloc'ed memory size.
|
|
|
|
*
|
|
|
|
* This method can be defined by the following Ruby code:
|
|
|
|
*
|
2010-10-28 16:23:21 -04:00
|
|
|
* def memsize_of_all klass = false
|
2010-10-27 14:16:39 -04:00
|
|
|
* total = 0
|
2013-03-18 21:09:46 -04:00
|
|
|
* ObjectSpace.each_object{|e|
|
2010-10-28 16:23:21 -04:00
|
|
|
* total += ObjectSpace.memsize_of(e) if klass == false || e.kind_of?(klass)
|
|
|
|
* }
|
2010-10-27 14:16:39 -04:00
|
|
|
* total
|
|
|
|
* end
|
|
|
|
*
|
|
|
|
* This method is not expected to work except C Ruby.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static VALUE
|
2010-10-28 16:23:21 -04:00
|
|
|
memsize_of_all_m(int argc, VALUE *argv, VALUE self)
|
2010-10-27 14:16:39 -04:00
|
|
|
{
|
2010-10-28 16:23:21 -04:00
|
|
|
struct total_data data = {0, 0};
|
|
|
|
|
|
|
|
if (argc > 0) {
|
|
|
|
rb_scan_args(argc, argv, "01", &data.klass);
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_objspace_each_objects(total_i, &data);
|
|
|
|
return SIZET2NUM(data.total);
|
2010-10-27 14:16:39 -04:00
|
|
|
}
|
|
|
|
|
2009-06-16 19:56:48 -04:00
|
|
|
static int
|
|
|
|
set_zero_i(st_data_t key, st_data_t val, st_data_t arg)
|
|
|
|
{
|
|
|
|
VALUE k = (VALUE)key;
|
|
|
|
VALUE hash = (VALUE)arg;
|
|
|
|
rb_hash_aset(hash, k, INT2FIX(0));
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cos_i(void *vstart, void *vend, size_t stride, void *data)
|
|
|
|
{
|
|
|
|
size_t *counts = (size_t *)data;
|
|
|
|
VALUE v = (VALUE)vstart;
|
|
|
|
|
|
|
|
for (;v != (VALUE)vend; v += stride) {
|
|
|
|
if (RBASIC(v)->flags) {
|
|
|
|
counts[BUILTIN_TYPE(v)] += memsize_of(v);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-10-23 20:04:56 -04:00
|
|
|
static VALUE
|
2012-10-24 05:49:18 -04:00
|
|
|
type2sym(enum ruby_value_type i)
|
2012-10-23 20:04:56 -04:00
|
|
|
{
|
|
|
|
VALUE type;
|
|
|
|
switch (i) {
|
|
|
|
#define CASE_TYPE(t) case t: type = ID2SYM(rb_intern(#t)); break;
|
|
|
|
CASE_TYPE(T_NONE);
|
|
|
|
CASE_TYPE(T_OBJECT);
|
|
|
|
CASE_TYPE(T_CLASS);
|
|
|
|
CASE_TYPE(T_MODULE);
|
|
|
|
CASE_TYPE(T_FLOAT);
|
|
|
|
CASE_TYPE(T_STRING);
|
|
|
|
CASE_TYPE(T_REGEXP);
|
|
|
|
CASE_TYPE(T_ARRAY);
|
|
|
|
CASE_TYPE(T_HASH);
|
|
|
|
CASE_TYPE(T_STRUCT);
|
|
|
|
CASE_TYPE(T_BIGNUM);
|
|
|
|
CASE_TYPE(T_FILE);
|
|
|
|
CASE_TYPE(T_DATA);
|
|
|
|
CASE_TYPE(T_MATCH);
|
|
|
|
CASE_TYPE(T_COMPLEX);
|
|
|
|
CASE_TYPE(T_RATIONAL);
|
|
|
|
CASE_TYPE(T_NIL);
|
|
|
|
CASE_TYPE(T_TRUE);
|
|
|
|
CASE_TYPE(T_FALSE);
|
|
|
|
CASE_TYPE(T_SYMBOL);
|
|
|
|
CASE_TYPE(T_FIXNUM);
|
|
|
|
CASE_TYPE(T_UNDEF);
|
|
|
|
CASE_TYPE(T_NODE);
|
|
|
|
CASE_TYPE(T_ICLASS);
|
|
|
|
CASE_TYPE(T_ZOMBIE);
|
|
|
|
#undef CASE_TYPE
|
2012-10-23 23:00:39 -04:00
|
|
|
default: rb_bug("type2sym: unknown type (%d)", i);
|
2012-10-23 20:04:56 -04:00
|
|
|
}
|
|
|
|
return type;
|
|
|
|
}
|
|
|
|
|
2009-06-16 19:56:48 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* ObjectSpace.count_objects_size([result_hash]) -> hash
|
|
|
|
*
|
|
|
|
* Counts objects size (in bytes) for each type.
|
|
|
|
*
|
|
|
|
* Note that this information is incomplete. You need to deal with
|
2011-08-07 01:13:02 -04:00
|
|
|
* this information as only a *HINT*. Especially, total size of
|
2009-06-16 19:56:48 -04:00
|
|
|
* T_DATA may not right size.
|
|
|
|
*
|
|
|
|
* It returns a hash as:
|
|
|
|
* {:TOTAL=>1461154, :T_CLASS=>158280, :T_MODULE=>20672, :T_STRING=>527249, ...}
|
2010-04-22 04:04:13 -04:00
|
|
|
*
|
2009-06-16 19:56:48 -04:00
|
|
|
* 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_size(int argc, VALUE *argv, VALUE os)
|
|
|
|
{
|
|
|
|
size_t counts[T_MASK+1];
|
|
|
|
size_t total = 0;
|
2012-10-24 05:49:18 -04:00
|
|
|
enum ruby_value_type i;
|
2009-06-16 19:56:48 -04:00
|
|
|
VALUE hash;
|
|
|
|
|
|
|
|
if (rb_scan_args(argc, argv, "01", &hash) == 1) {
|
2012-05-23 03:13:21 -04:00
|
|
|
if (!RB_TYPE_P(hash, T_HASH))
|
2009-06-16 19:56:48 -04:00
|
|
|
rb_raise(rb_eTypeError, "non-hash given");
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i <= T_MASK; i++) {
|
|
|
|
counts[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_objspace_each_objects(cos_i, &counts[0]);
|
|
|
|
|
|
|
|
if (hash == Qnil) {
|
|
|
|
hash = rb_hash_new();
|
|
|
|
}
|
|
|
|
else if (!RHASH_EMPTY_P(hash)) {
|
|
|
|
st_foreach(RHASH_TBL(hash), set_zero_i, hash);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i <= T_MASK; i++) {
|
|
|
|
if (counts[i]) {
|
2012-10-23 20:04:56 -04:00
|
|
|
VALUE type = type2sym(i);
|
2009-06-16 19:56:48 -04:00
|
|
|
total += counts[i];
|
|
|
|
rb_hash_aset(hash, type, SIZET2NUM(counts[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
rb_hash_aset(hash, ID2SYM(rb_intern("TOTAL")), SIZET2NUM(total));
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cn_i(void *vstart, void *vend, size_t stride, void *n)
|
|
|
|
{
|
|
|
|
size_t *nodes = (size_t *)n;
|
|
|
|
VALUE v = (VALUE)vstart;
|
|
|
|
|
|
|
|
for (; v != (VALUE)vend; v += stride) {
|
|
|
|
if (RBASIC(v)->flags && BUILTIN_TYPE(v) == T_NODE) {
|
|
|
|
size_t s = nd_type((NODE *)v);
|
|
|
|
nodes[s]++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* ObjectSpace.count_nodes([result_hash]) -> hash
|
|
|
|
*
|
|
|
|
* Counts nodes for each node type.
|
|
|
|
*
|
|
|
|
* This method is not for ordinary Ruby programmers, but for MRI developers
|
|
|
|
* who have interest in MRI performance and memory usage.
|
|
|
|
*
|
|
|
|
* It returns a hash as:
|
|
|
|
* {:NODE_METHOD=>2027, :NODE_FBODY=>1927, :NODE_CFUNC=>1798, ...}
|
|
|
|
*
|
|
|
|
* 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_nodes(int argc, VALUE *argv, VALUE os)
|
|
|
|
{
|
|
|
|
size_t nodes[NODE_LAST+1];
|
|
|
|
size_t i;
|
|
|
|
VALUE hash;
|
|
|
|
|
|
|
|
if (rb_scan_args(argc, argv, "01", &hash) == 1) {
|
2012-05-23 03:13:21 -04:00
|
|
|
if (!RB_TYPE_P(hash, T_HASH))
|
2009-06-16 19:56:48 -04:00
|
|
|
rb_raise(rb_eTypeError, "non-hash given");
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i <= NODE_LAST; i++) {
|
|
|
|
nodes[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_objspace_each_objects(cn_i, &nodes[0]);
|
|
|
|
|
|
|
|
if (hash == Qnil) {
|
|
|
|
hash = rb_hash_new();
|
|
|
|
}
|
|
|
|
else if (!RHASH_EMPTY_P(hash)) {
|
|
|
|
st_foreach(RHASH_TBL(hash), set_zero_i, hash);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i=0; i<NODE_LAST; i++) {
|
|
|
|
if (nodes[i] != 0) {
|
|
|
|
VALUE node;
|
|
|
|
switch (i) {
|
|
|
|
#define COUNT_NODE(n) case n: node = ID2SYM(rb_intern(#n)); break;
|
|
|
|
COUNT_NODE(NODE_SCOPE);
|
|
|
|
COUNT_NODE(NODE_BLOCK);
|
|
|
|
COUNT_NODE(NODE_IF);
|
|
|
|
COUNT_NODE(NODE_CASE);
|
|
|
|
COUNT_NODE(NODE_WHEN);
|
|
|
|
COUNT_NODE(NODE_OPT_N);
|
|
|
|
COUNT_NODE(NODE_WHILE);
|
|
|
|
COUNT_NODE(NODE_UNTIL);
|
|
|
|
COUNT_NODE(NODE_ITER);
|
|
|
|
COUNT_NODE(NODE_FOR);
|
|
|
|
COUNT_NODE(NODE_BREAK);
|
|
|
|
COUNT_NODE(NODE_NEXT);
|
|
|
|
COUNT_NODE(NODE_REDO);
|
|
|
|
COUNT_NODE(NODE_RETRY);
|
|
|
|
COUNT_NODE(NODE_BEGIN);
|
|
|
|
COUNT_NODE(NODE_RESCUE);
|
|
|
|
COUNT_NODE(NODE_RESBODY);
|
|
|
|
COUNT_NODE(NODE_ENSURE);
|
|
|
|
COUNT_NODE(NODE_AND);
|
|
|
|
COUNT_NODE(NODE_OR);
|
|
|
|
COUNT_NODE(NODE_MASGN);
|
|
|
|
COUNT_NODE(NODE_LASGN);
|
|
|
|
COUNT_NODE(NODE_DASGN);
|
|
|
|
COUNT_NODE(NODE_DASGN_CURR);
|
|
|
|
COUNT_NODE(NODE_GASGN);
|
|
|
|
COUNT_NODE(NODE_IASGN);
|
|
|
|
COUNT_NODE(NODE_IASGN2);
|
|
|
|
COUNT_NODE(NODE_CDECL);
|
|
|
|
COUNT_NODE(NODE_CVASGN);
|
|
|
|
COUNT_NODE(NODE_CVDECL);
|
|
|
|
COUNT_NODE(NODE_OP_ASGN1);
|
|
|
|
COUNT_NODE(NODE_OP_ASGN2);
|
|
|
|
COUNT_NODE(NODE_OP_ASGN_AND);
|
|
|
|
COUNT_NODE(NODE_OP_ASGN_OR);
|
2013-03-04 20:40:52 -05:00
|
|
|
COUNT_NODE(NODE_OP_CDECL);
|
2009-06-16 19:56:48 -04:00
|
|
|
COUNT_NODE(NODE_CALL);
|
|
|
|
COUNT_NODE(NODE_FCALL);
|
|
|
|
COUNT_NODE(NODE_VCALL);
|
|
|
|
COUNT_NODE(NODE_SUPER);
|
|
|
|
COUNT_NODE(NODE_ZSUPER);
|
|
|
|
COUNT_NODE(NODE_ARRAY);
|
|
|
|
COUNT_NODE(NODE_ZARRAY);
|
|
|
|
COUNT_NODE(NODE_VALUES);
|
|
|
|
COUNT_NODE(NODE_HASH);
|
|
|
|
COUNT_NODE(NODE_RETURN);
|
|
|
|
COUNT_NODE(NODE_YIELD);
|
|
|
|
COUNT_NODE(NODE_LVAR);
|
|
|
|
COUNT_NODE(NODE_DVAR);
|
|
|
|
COUNT_NODE(NODE_GVAR);
|
|
|
|
COUNT_NODE(NODE_IVAR);
|
|
|
|
COUNT_NODE(NODE_CONST);
|
|
|
|
COUNT_NODE(NODE_CVAR);
|
|
|
|
COUNT_NODE(NODE_NTH_REF);
|
|
|
|
COUNT_NODE(NODE_BACK_REF);
|
|
|
|
COUNT_NODE(NODE_MATCH);
|
|
|
|
COUNT_NODE(NODE_MATCH2);
|
|
|
|
COUNT_NODE(NODE_MATCH3);
|
|
|
|
COUNT_NODE(NODE_LIT);
|
|
|
|
COUNT_NODE(NODE_STR);
|
|
|
|
COUNT_NODE(NODE_DSTR);
|
|
|
|
COUNT_NODE(NODE_XSTR);
|
|
|
|
COUNT_NODE(NODE_DXSTR);
|
|
|
|
COUNT_NODE(NODE_EVSTR);
|
|
|
|
COUNT_NODE(NODE_DREGX);
|
|
|
|
COUNT_NODE(NODE_DREGX_ONCE);
|
|
|
|
COUNT_NODE(NODE_ARGS);
|
|
|
|
COUNT_NODE(NODE_ARGS_AUX);
|
|
|
|
COUNT_NODE(NODE_OPT_ARG);
|
2013-03-04 20:40:52 -05:00
|
|
|
COUNT_NODE(NODE_KW_ARG);
|
2009-06-16 19:56:48 -04:00
|
|
|
COUNT_NODE(NODE_POSTARG);
|
|
|
|
COUNT_NODE(NODE_ARGSCAT);
|
|
|
|
COUNT_NODE(NODE_ARGSPUSH);
|
|
|
|
COUNT_NODE(NODE_SPLAT);
|
|
|
|
COUNT_NODE(NODE_TO_ARY);
|
|
|
|
COUNT_NODE(NODE_BLOCK_ARG);
|
|
|
|
COUNT_NODE(NODE_BLOCK_PASS);
|
|
|
|
COUNT_NODE(NODE_DEFN);
|
|
|
|
COUNT_NODE(NODE_DEFS);
|
|
|
|
COUNT_NODE(NODE_ALIAS);
|
|
|
|
COUNT_NODE(NODE_VALIAS);
|
|
|
|
COUNT_NODE(NODE_UNDEF);
|
|
|
|
COUNT_NODE(NODE_CLASS);
|
|
|
|
COUNT_NODE(NODE_MODULE);
|
|
|
|
COUNT_NODE(NODE_SCLASS);
|
|
|
|
COUNT_NODE(NODE_COLON2);
|
|
|
|
COUNT_NODE(NODE_COLON3);
|
2013-03-04 20:40:52 -05:00
|
|
|
COUNT_NODE(NODE_CREF);
|
2009-06-16 19:56:48 -04:00
|
|
|
COUNT_NODE(NODE_DOT2);
|
|
|
|
COUNT_NODE(NODE_DOT3);
|
|
|
|
COUNT_NODE(NODE_FLIP2);
|
|
|
|
COUNT_NODE(NODE_FLIP3);
|
|
|
|
COUNT_NODE(NODE_SELF);
|
|
|
|
COUNT_NODE(NODE_NIL);
|
|
|
|
COUNT_NODE(NODE_TRUE);
|
|
|
|
COUNT_NODE(NODE_FALSE);
|
|
|
|
COUNT_NODE(NODE_ERRINFO);
|
|
|
|
COUNT_NODE(NODE_DEFINED);
|
|
|
|
COUNT_NODE(NODE_POSTEXE);
|
|
|
|
COUNT_NODE(NODE_ALLOCA);
|
|
|
|
COUNT_NODE(NODE_BMETHOD);
|
|
|
|
COUNT_NODE(NODE_MEMO);
|
|
|
|
COUNT_NODE(NODE_IFUNC);
|
|
|
|
COUNT_NODE(NODE_DSYM);
|
|
|
|
COUNT_NODE(NODE_ATTRASGN);
|
|
|
|
COUNT_NODE(NODE_PRELUDE);
|
|
|
|
COUNT_NODE(NODE_LAMBDA);
|
|
|
|
#undef COUNT_NODE
|
2013-03-04 20:40:52 -05:00
|
|
|
default: node = INT2FIX(i);
|
2009-06-16 19:56:48 -04:00
|
|
|
}
|
|
|
|
rb_hash_aset(hash, node, SIZET2NUM(nodes[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cto_i(void *vstart, void *vend, size_t stride, void *data)
|
|
|
|
{
|
|
|
|
VALUE hash = (VALUE)data;
|
|
|
|
VALUE v = (VALUE)vstart;
|
|
|
|
|
|
|
|
for (; v != (VALUE)vend; v += stride) {
|
|
|
|
if (RBASIC(v)->flags && BUILTIN_TYPE(v) == T_DATA) {
|
2011-06-30 04:37:06 -04:00
|
|
|
VALUE counter;
|
|
|
|
VALUE key = RBASIC(v)->klass;
|
|
|
|
|
|
|
|
if (key == 0) {
|
|
|
|
const char *name = rb_objspace_data_type_name(v);
|
|
|
|
if (name == 0) name = "unknown";
|
|
|
|
key = ID2SYM(rb_intern(name));
|
|
|
|
}
|
|
|
|
|
|
|
|
counter = rb_hash_aref(hash, key);
|
2009-06-16 19:56:48 -04:00
|
|
|
if (NIL_P(counter)) {
|
|
|
|
counter = INT2FIX(1);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
counter = INT2FIX(FIX2INT(counter) + 1);
|
|
|
|
}
|
2011-06-30 04:37:06 -04:00
|
|
|
|
|
|
|
rb_hash_aset(hash, key, counter);
|
2009-06-16 19:56:48 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* ObjectSpace.count_tdata_objects([result_hash]) -> hash
|
|
|
|
*
|
2011-06-30 04:37:06 -04:00
|
|
|
* Counts objects for each T_DATA type.
|
2009-06-16 19:56:48 -04:00
|
|
|
*
|
|
|
|
* This method is not for ordinary Ruby programmers, but for MRI developers
|
|
|
|
* who interest on MRI performance.
|
|
|
|
*
|
|
|
|
* It returns a hash as:
|
2011-06-30 04:37:06 -04:00
|
|
|
* {RubyVM::InstructionSequence=>504, :parser=>5, :barrier=>6,
|
|
|
|
* :mutex=>6, Proc=>60, RubyVM::Env=>57, Mutex=>1, Encoding=>99,
|
|
|
|
* ThreadGroup=>1, Binding=>1, Thread=>1, RubyVM=>1, :iseq=>1,
|
|
|
|
* Random=>1, ARGF.class=>1, Data=>1, :autoload=>3, Time=>2}
|
|
|
|
* # T_DATA objects existing at startup on r32276.
|
2009-06-16 19:56:48 -04:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
2011-06-30 04:37:06 -04:00
|
|
|
* In this version, keys are Class object or Symbol object.
|
|
|
|
* If object is kind of normal (accessible) object, the key is Class object.
|
|
|
|
* If object is not a kind of normal (internal) object, the key is symbol
|
|
|
|
* name, registered by rb_data_type_struct.
|
|
|
|
*
|
2009-06-16 19:56:48 -04:00
|
|
|
* This method is not expected to work except C Ruby.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
count_tdata_objects(int argc, VALUE *argv, VALUE self)
|
|
|
|
{
|
|
|
|
VALUE hash;
|
|
|
|
|
|
|
|
if (rb_scan_args(argc, argv, "01", &hash) == 1) {
|
2012-05-23 03:13:21 -04:00
|
|
|
if (!RB_TYPE_P(hash, T_HASH))
|
2009-06-16 19:56:48 -04:00
|
|
|
rb_raise(rb_eTypeError, "non-hash given");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (hash == Qnil) {
|
|
|
|
hash = rb_hash_new();
|
|
|
|
}
|
|
|
|
else if (!RHASH_EMPTY_P(hash)) {
|
|
|
|
st_foreach(RHASH_TBL(hash), set_zero_i, hash);
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_objspace_each_objects(cto_i, (void *)hash);
|
|
|
|
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
2012-10-23 20:04:56 -04:00
|
|
|
static void
|
|
|
|
iow_mark(void *ptr)
|
|
|
|
{
|
|
|
|
rb_gc_mark((VALUE)ptr);
|
|
|
|
}
|
|
|
|
|
2012-12-07 19:18:42 -05:00
|
|
|
static size_t
|
|
|
|
iow_size(const void *ptr)
|
|
|
|
{
|
|
|
|
VALUE obj = (VALUE)ptr;
|
|
|
|
return memsize_of(obj);
|
|
|
|
}
|
|
|
|
|
2012-10-23 20:04:56 -04:00
|
|
|
static const rb_data_type_t iow_data_type = {
|
|
|
|
"ObjectSpace::InternalObjectWrapper",
|
2012-12-07 19:18:42 -05:00
|
|
|
{iow_mark, 0, iow_size,},
|
2012-10-23 20:04:56 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
static VALUE rb_mInternalObjectWrapper;
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
iow_newobj(VALUE obj)
|
|
|
|
{
|
|
|
|
return rb_data_typed_object_alloc(rb_mInternalObjectWrapper, (void *)obj, &iow_data_type);
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
iow_type(VALUE self)
|
|
|
|
{
|
|
|
|
VALUE obj = (VALUE)DATA_PTR(self);
|
|
|
|
return type2sym(BUILTIN_TYPE(obj));
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
iow_inspect(VALUE self)
|
|
|
|
{
|
|
|
|
VALUE obj = (VALUE)DATA_PTR(self);
|
|
|
|
VALUE type = type2sym(BUILTIN_TYPE(obj));
|
|
|
|
|
|
|
|
return rb_sprintf("#<InternalObject:%p %s>", (void *)obj, rb_id2name(SYM2ID(type)));
|
|
|
|
}
|
|
|
|
|
2012-10-23 21:21:13 -04:00
|
|
|
static VALUE
|
|
|
|
iow_internal_object_id(VALUE self)
|
|
|
|
{
|
|
|
|
VALUE obj = (VALUE)DATA_PTR(self);
|
|
|
|
return rb_obj_id(obj);
|
|
|
|
}
|
|
|
|
|
2012-10-23 20:04:56 -04:00
|
|
|
struct rof_data {
|
|
|
|
st_table *refs;
|
|
|
|
VALUE internals;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
|
|
|
reachable_object_from_i(VALUE obj, void *data_ptr)
|
|
|
|
{
|
|
|
|
struct rof_data *data = (struct rof_data *)data_ptr;
|
2012-10-23 23:00:39 -04:00
|
|
|
VALUE key = obj;
|
|
|
|
VALUE val = obj;
|
2012-10-23 20:04:56 -04:00
|
|
|
|
|
|
|
if (rb_objspace_markable_object_p(obj)) {
|
|
|
|
if (rb_objspace_internal_object_p(obj)) {
|
2012-10-23 23:00:39 -04:00
|
|
|
val = iow_newobj(obj);
|
|
|
|
rb_ary_push(data->internals, val);
|
2012-10-23 20:04:56 -04:00
|
|
|
}
|
2012-10-23 23:00:39 -04:00
|
|
|
st_insert(data->refs, key, val);
|
2012-10-23 20:04:56 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2012-10-23 23:00:39 -04:00
|
|
|
collect_values(st_data_t key, st_data_t value, st_data_t data)
|
2012-10-23 20:04:56 -04:00
|
|
|
{
|
|
|
|
VALUE ary = (VALUE)data;
|
2012-10-23 23:00:39 -04:00
|
|
|
rb_ary_push(ary, (VALUE)value);
|
2012-10-23 20:04:56 -04:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
2012-10-05 04:14:09 -04:00
|
|
|
/*
|
|
|
|
* call-seq:
|
|
|
|
* ObjectSpace.reachable_objects_from(obj) -> array or nil
|
|
|
|
*
|
|
|
|
* [MRI specific feature] Return all reachable objects from `obj'.
|
|
|
|
*
|
|
|
|
* This method returns all reachable objects from `obj'.
|
2013-06-04 10:09:25 -04:00
|
|
|
* If `obj' has two or more references to the same object `x',
|
|
|
|
* then returned array only includes one `x' object.
|
|
|
|
* If `obj' is a non-markable (non-heap management) object such as
|
|
|
|
* true, false, nil, symbols and Fixnums (and Flonum) then it simply
|
2012-10-05 04:14:09 -04:00
|
|
|
* returns nil.
|
|
|
|
*
|
2013-06-04 10:09:25 -04:00
|
|
|
* If `obj' has references to an internal object, then it returns
|
2012-10-23 20:04:56 -04:00
|
|
|
* instances of `ObjectSpace::InternalObjectWrapper' class.
|
|
|
|
* This object contains a reference to an internal object and
|
|
|
|
* you can check the type of internal object with `type' method.
|
|
|
|
*
|
|
|
|
* If `obj' is instance of `ObjectSpace::InternalObjectWrapper'
|
2013-01-26 04:51:34 -05:00
|
|
|
* class, then this method returns all reachable object from
|
|
|
|
* an internal object, which is pointed by `obj'.
|
2012-10-23 20:04:56 -04:00
|
|
|
*
|
2012-10-05 04:14:09 -04:00
|
|
|
* With this method, you can find memory leaks.
|
|
|
|
*
|
2013-06-04 10:09:25 -04:00
|
|
|
* This method is not expected to work except in C Ruby.
|
2012-10-05 04:14:09 -04:00
|
|
|
*
|
|
|
|
* Example:
|
|
|
|
* ObjectSpace.reachable_objects_from(['a', 'b', 'c'])
|
|
|
|
* #=> [Array, 'a', 'b', 'c']
|
|
|
|
*
|
|
|
|
* ObjectSpace.reachable_objects_from(['a', 'a', 'a'])
|
|
|
|
* #=> [Array, 'a', 'a', 'a'] # all 'a' strings have different object id
|
|
|
|
*
|
|
|
|
* ObjectSpace.reachable_objects_from([v = 'a', v, v])
|
|
|
|
* #=> [Array, 'a']
|
|
|
|
*
|
|
|
|
* ObjectSpace.reachable_objects_from(1)
|
|
|
|
* #=> nil # 1 is not markable (heap managed) object
|
|
|
|
*
|
|
|
|
*/
|
2012-10-23 20:04:56 -04:00
|
|
|
|
2012-10-05 04:14:09 -04:00
|
|
|
static VALUE
|
|
|
|
reachable_objects_from(VALUE self, VALUE obj)
|
|
|
|
{
|
2012-10-23 20:04:56 -04:00
|
|
|
if (rb_objspace_markable_object_p(obj)) {
|
|
|
|
VALUE ret = rb_ary_new();
|
|
|
|
struct rof_data data;
|
|
|
|
|
|
|
|
if (rb_typeddata_is_kind_of(obj, &iow_data_type)) {
|
|
|
|
obj = (VALUE)DATA_PTR(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
data.refs = st_init_numtable();
|
|
|
|
data.internals = rb_ary_new();
|
|
|
|
|
|
|
|
rb_objspace_reachable_objects_from(obj, reachable_object_from_i, &data);
|
|
|
|
|
2012-10-23 23:00:39 -04:00
|
|
|
st_foreach(data.refs, collect_values, (st_data_t)ret);
|
2012-10-23 20:04:56 -04:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return Qnil;
|
|
|
|
}
|
2012-10-05 04:14:09 -04:00
|
|
|
}
|
|
|
|
|
2013-05-27 06:01:45 -04:00
|
|
|
void Init_object_tracing(VALUE rb_mObjSpace);
|
2013-05-27 14:14:28 -04:00
|
|
|
void Init_gc_hook(VALUE rb_mObjSpace);
|
2013-05-27 06:01:45 -04:00
|
|
|
|
2013-06-04 10:09:25 -04:00
|
|
|
/* The objspace library extends the ObjectSpace module and adds several
|
2009-06-16 19:56:48 -04:00
|
|
|
* methods to get internal statistic information about
|
|
|
|
* object/memory management.
|
2010-04-22 04:04:13 -04:00
|
|
|
*
|
2013-06-04 10:09:25 -04:00
|
|
|
* Generally, you *SHOULD NOT* use this library if you do not know
|
2009-06-16 19:56:48 -04:00
|
|
|
* about the MRI implementation. Mainly, this library is for (memory)
|
2013-06-04 10:09:25 -04:00
|
|
|
* profiler developers and MRI developers who need to know about MRI
|
2009-06-16 19:56:48 -04:00
|
|
|
* memory usage.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
|
|
|
Init_objspace(void)
|
|
|
|
{
|
|
|
|
VALUE rb_mObjSpace = rb_const_get(rb_cObject, rb_intern("ObjectSpace"));
|
|
|
|
|
|
|
|
rb_define_module_function(rb_mObjSpace, "memsize_of", memsize_of_m, 1);
|
2012-10-05 04:14:09 -04:00
|
|
|
rb_define_module_function(rb_mObjSpace, "memsize_of_all", memsize_of_all_m, -1);
|
2010-10-27 14:16:39 -04:00
|
|
|
|
|
|
|
rb_define_module_function(rb_mObjSpace, "count_objects_size", count_objects_size, -1);
|
2009-06-16 19:56:48 -04:00
|
|
|
rb_define_module_function(rb_mObjSpace, "count_nodes", count_nodes, -1);
|
|
|
|
rb_define_module_function(rb_mObjSpace, "count_tdata_objects", count_tdata_objects, -1);
|
2012-10-05 04:14:09 -04:00
|
|
|
|
|
|
|
rb_define_module_function(rb_mObjSpace, "reachable_objects_from", reachable_objects_from, 1);
|
2012-10-23 20:04:56 -04:00
|
|
|
|
|
|
|
rb_mInternalObjectWrapper = rb_define_class_under(rb_mObjSpace, "InternalObjectWrapper", rb_cObject);
|
|
|
|
rb_define_method(rb_mInternalObjectWrapper, "type", iow_type, 0);
|
|
|
|
rb_define_method(rb_mInternalObjectWrapper, "inspect", iow_inspect, 0);
|
2012-10-23 21:21:13 -04:00
|
|
|
rb_define_method(rb_mInternalObjectWrapper, "internal_object_id", iow_internal_object_id, 0);
|
2013-05-27 06:01:45 -04:00
|
|
|
|
|
|
|
Init_object_tracing(rb_mObjSpace);
|
2013-05-27 14:14:28 -04:00
|
|
|
Init_gc_hook(rb_mObjSpace);
|
2009-06-16 19:56:48 -04:00
|
|
|
}
|