Sha256: 90493f54d597705840699ce9c10c30b7a82b5270a90243c6188c06920992c7e2
Contents?: true
Size: 1.67 KB
Versions: 17
Compression:
Stored size: 1.67 KB
Contents
/* Copyright (C) 2005-2019 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com>
Please see the LICENSE file for copyright and distribution information */
#include "rp_aggregate_call_tree.h"
VALUE cRpAggregateCallTree;
void prof_aggregate_call_tree_mark(void* data)
{
prof_call_tree_t* call_tree = (prof_call_tree_t*)data;
if (call_tree->object != Qnil)
rb_gc_mark(call_tree->object);
if (call_tree->source_file != Qnil)
rb_gc_mark(call_tree->source_file);
prof_measurement_mark(call_tree->measurement);
}
static void prof_aggregate_call_tree_ruby_gc_free(void* data)
{
prof_call_tree_t* call_tree = (prof_call_tree_t*)data;
prof_call_tree_free(call_tree);
}
size_t prof_aggregate_call_tree_size(const void* data)
{
return sizeof(prof_call_tree_t);
}
static const rb_data_type_t aggregate_call_tree_type =
{
.wrap_struct_name = "Aggregate_CallTree",
.function =
{
.dmark = prof_aggregate_call_tree_mark,
.dfree = prof_aggregate_call_tree_ruby_gc_free,
.dsize = prof_aggregate_call_tree_size,
},
.data = NULL,
.flags = RUBY_TYPED_FREE_IMMEDIATELY
};
VALUE prof_aggregate_call_tree_wrap(prof_call_tree_t* call_tree)
{
if (call_tree->object == Qnil)
{
call_tree->object = TypedData_Wrap_Struct(cRpAggregateCallTree, &aggregate_call_tree_type, call_tree);
}
return call_tree->object;
}
void rp_init_aggregate_call_tree()
{
// AggregateCallTree
cRpAggregateCallTree = rb_define_class_under(mProf, "AggregateCallTree", cRpCallTree);
rb_undef_method(CLASS_OF(cRpAggregateCallTree), "new");
}
Version data entries
17 entries across 17 versions & 1 rubygems