Safefree(st);
}
-static void thing_size(pTHX_ const SV *const, struct state *);
+static void sv_size(pTHX_ struct state *, const SV *const, bool recurse);
+
typedef enum {
OPc_NULL, /* 0 */
OPc_BASEOP, /* 1 */
case OPc_SVOP: TAG;
st->total_size += sizeof(struct pmop);
if (check_new(st, cSVOPx(baseop)->op_sv)) {
- thing_size(aTHX_ cSVOPx(baseop)->op_sv, st);
+ sv_size(aTHX_ st, cSVOPx(baseop)->op_sv, TRUE);
}
TAG;break;
case OPc_PADOP: TAG;
check_new_and_strlen(st, basecop->cop_stashpv);
#else
if (check_new(st, basecop->cop_stash)) {
- thing_size(aTHX_ (SV *)basecop->cop_stash, st);
+ sv_size(aTHX_ st, (SV *)basecop->cop_stash, TRUE);
}
if (check_new(st, basecop->cop_filegv)) {
- thing_size(aTHX_ (SV *)basecop->cop_filegv, st);
+ sv_size(aTHX_ st, (SV *)basecop->cop_filegv, TRUE);
}
#endif
#endif
static void
-thing_size(pTHX_ const SV * const orig_thing, struct state *st) {
+sv_size(pTHX_ struct state *const st, const SV * const orig_thing,
+ const bool recurse) {
const SV *thing = orig_thing;
st->total_size += sizeof(SV);
much has been allocated */
case SVt_PV: TAG;
st->total_size += sizeof(XPV);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
TAG;break;
/* A string with an integer part? */
case SVt_PVIV: TAG;
st->total_size += sizeof(XPVIV);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
if(SvOOK(thing)) {
/* A scalar/string/reference with a float part? */
case SVt_PVNV: TAG;
st->total_size += sizeof(XPVNV);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
TAG;break;
case SVt_PVMG: TAG;
st->total_size += sizeof(XPVMG);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
magic_size(thing, st);
#if PERL_VERSION <= 8
case SVt_PVBM: TAG;
st->total_size += sizeof(XPVBM);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
magic_size(thing, st);
#endif
case SVt_PVLV: TAG;
st->total_size += sizeof(XPVLV);
- if(SvROK(thing))
- thing_size(aTHX_ SvRV_const(thing), st);
+ if(recurse && SvROK(thing))
+ sv_size(aTHX_ st, SvRV_const(thing), TRUE);
else
st->total_size += SvLEN(thing);
magic_size(thing, st);
complain about AvARYLEN() passing thing to it. */
if (AvARYLEN(thing)) {
if (check_new(st, AvARYLEN(thing))) {
- thing_size(aTHX_ AvARYLEN(thing), st);
+ sv_size(aTHX_ st, AvARYLEN(thing), TRUE);
}
}
#endif
st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
if (check_new(st, CvSTASH(thing))) {
- thing_size(aTHX_ (SV *)CvSTASH(thing), st);
+ sv_size(aTHX_ st, (SV *)CvSTASH(thing), TRUE);
}
if (check_new(st, SvSTASH(thing))) {
- thing_size(aTHX_ (SV *)SvSTASH(thing), st);
+ sv_size(aTHX_ st, (SV *)SvSTASH(thing), TRUE);
}
if (check_new(st, CvGV(thing))) {
- thing_size(aTHX_ (SV *)CvGV(thing), st);
+ sv_size(aTHX_ st, (SV *)CvGV(thing), TRUE);
}
if (check_new(st, CvPADLIST(thing))) {
- thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
+ sv_size(aTHX_ st, (SV *)CvPADLIST(thing), TRUE);
}
if (check_new(st, CvOUTSIDE(thing))) {
- thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
+ sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), TRUE);
}
if (CvISXSUB(thing)) {
SV *sv = cv_const_sv((CV *)thing);
if (sv) {
- thing_size(aTHX_ sv, st);
+ sv_size(aTHX_ st, sv, TRUE);
}
} else {
op_size(aTHX_ CvSTART(thing), st);
{
SV *generic_thing;
if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
- thing_size(aTHX_ generic_thing, st);
+ sv_size(aTHX_ st, generic_thing, TRUE);
}
}
}
magic_size(thing, st);
st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
if (check_new(st, CvPADLIST(thing))) {
- thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
+ sv_size(aTHX_ st, (SV *)CvPADLIST(thing), TRUE);
}
if (check_new(st, CvOUTSIDE(thing))) {
- thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
+ sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), TRUE);
}
if (st->go_yell && !st->fm_whine) {
check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_bottom_name);
/* Throw the GVs on the list to be walked if they're not-null */
if (((XPVIO *) SvANY(thing))->xio_top_gv) {
- thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, st);
+ sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, TRUE);
}
if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
- thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, st);
+ sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, TRUE);
}
if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
- thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, st);
+ sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, TRUE);
}
/* Only go trotting through the IO structures if they're really
}
#endif
- thing_size(aTHX_ thing, st);
+ sv_size(aTHX_ st, thing, FALSE);
RETVAL = st->total_size;
free_state(st);
}
}
}
- thing_size(aTHX_ thing, st);
+ sv_size(aTHX_ st, thing, TRUE);
} else {
/* check_new() returned false: */
#ifdef DEVEL_SIZE_DEBUGGING
# total_size([]) will NOT return the size of the ref + the array, it will only
# return the size of the array alone!
-use Test::More tests => 16 + 4 *12;
+use Test::More;
use strict;
use Devel::Size ':all';
+my %types = (
+ NULL => undef,
+ IV => 42,
+ RV => \1,
+ NV => 3.14,
+ PV => "Perl rocks",
+ PVIV => do { my $a = 1; $a = "One"; $a },
+ PVNV => do { my $a = 3.14; $a = "Mmm, pi"; $a },
+ PVMG => do { my $a = $!; $a = "Bang!"; $a },
+);
+
+plan(tests => 16 + 4 *12 + 2 * scalar keys %types);
+
#############################################################################
# verify that pointer sizes in array slots are sensible:
# create an array with 4 slots, 2 of them used
cmp_array_ro(\@array, \@copy, 'two arrays compare the same');
}
+
+{
+ my %sizes;
+ # reverse sort ensures that PVIV, PVNV and RV are processed before
+ # IV, NULL, or NV :-)
+ foreach my $type (reverse sort keys %types) {
+ # Need to make sure this goes in a new scalar every time. Putting it
+ # directly in a lexical means that it's in the pad, and the pad recycles
+ # scalars, a side effect of which is that they get upgraded in ways we
+ # don't really want
+ my $a;
+ $a->[0] = $types{$type};
+ undef $a->[0];
+
+ my $expect = $sizes{$type} = size(\$a->[0]);
+
+ $a->[0] = \('x' x 1024);
+
+ $expect = $sizes{RV} if $type eq 'NULL';
+ $expect = $sizes{PVNV} if $type eq 'NV';
+ $expect = $sizes{PVIV} if $type eq 'IV' && $] < 5.012;
+
+ # Remember, size() removes a level of referencing if present. So add
+ # one, so that we get the size of our reference:
+ is(size(\$a->[0]), $expect,
+ "Type $type containing a reference, size() does not recurse to the referent");
+ cmp_ok(total_size(\$a->[0]), '>', 1024,
+ "Type $type, total_size() recurses to the referent");
+ }
+}