1 #define PERL_NO_GET_CONTEXT
8 /* Not yet in ppport.h */
10 # define CvISXSUB(cv) (CvXSUB(cv) ? TRUE : FALSE)
13 # define SvRV_const(rv) SvRV(rv)
17 /* "structured exception" handling is a Microsoft extension to C and C++.
18 It's *not* C++ exception handling - C++ exception handling can't capture
19 SEGVs and suchlike, whereas this can. There's no known analagous
20 functionality on other platforms. */
22 # define TRY_TO_CATCH_SEGV __try
23 # define CAUGHT_EXCEPTION __except(EXCEPTION EXCEPTION_EXECUTE_HANDLER)
25 # define TRY_TO_CATCH_SEGV if(1)
26 # define CAUGHT_EXCEPTION else
30 # define __attribute__(x)
33 #if 0 && defined(DEBUGGING)
34 #define dbg_printf(x) printf x
39 #define TAG /* printf( "# %s(%d)\n", __FILE__, __LINE__ ) */
42 /* The idea is to have a tree structure to store 1 bit per possible pointer
43 address. The lowest 16 bits are stored in a block of 8092 bytes.
44 The blocks are in a 256-way tree, indexed by the reset of the pointer.
45 This can cope with 32 and 64 bit pointers, and any address space layout,
46 without excessive memory needs. The assumption is that your CPU cache
47 works :-) (And that we're not going to bust it) */
49 #define ALIGN_BITS ( sizeof(void*) >> 1 )
51 #define LEAF_BITS (16 - BYTE_BITS)
52 #define LEAF_MASK 0x1FFF
60 /* My hunch (not measured) is that for most architectures pointers will
61 start with 0 bits, hence the start of this array will be hot, and the
62 end unused. So put the flags next to the hot end. */
67 Checks to see if thing is in the bitstring.
68 Returns true or false, and
69 notes thing in the segmented bitstring.
72 check_new(struct state *st, const void *const p) {
73 unsigned int bits = 8 * sizeof(void*);
74 const size_t raw_p = PTR2nat(p);
75 /* This effectively rotates the value right by the number of low always-0
76 bits in an aligned pointer. The assmption is that most (if not all)
77 pointers are aligned, and these will be in the same chain of nodes
78 (and hence hot in the cache) but we can still deal with any unaligned
81 = (raw_p >> ALIGN_BITS) | (raw_p << (bits - BYTE_BITS));
82 const U8 this_bit = 1 << (cooked_p & 0x7);
89 if (NULL == p || NULL == st) return FALSE;
90 tv_p = (void **) (st->tracking);
92 const char c = *(const char *)p;
96 warn( "Devel::Size: Encountered invalid pointer: %p\n", p );
102 /* bits now 24 (32 bit pointers) or 56 (64 bit pointers) */
104 /* First level is always present. */
106 i = (unsigned int)((cooked_p >> bits) & 0xFF);
108 Newxz(tv_p[i], 256, void *);
109 tv_p = (void **)(tv_p[i]);
111 } while (bits > LEAF_BITS + BYTE_BITS);
112 /* bits now 16 always */
113 #if !defined(MULTIPLICITY) || PERL_VERSION > 8 || (PERL_VERSION == 8 && PERL_SUBVERSION > 8)
114 /* 5.8.8 and early have an assert() macro that uses Perl_croak, hence needs
115 a my_perl under multiplicity */
118 leaf_p = (U8 **)tv_p;
119 i = (unsigned int)((cooked_p >> bits) & 0xFF);
121 Newxz(leaf_p[i], 1 << LEAF_BITS, U8);
126 i = (unsigned int)((cooked_p >> BYTE_BITS) & LEAF_MASK);
128 if(leaf[i] & this_bit)
136 free_tracking_at(void **tv, int level)
144 free_tracking_at(tv[i], level);
158 free_state(struct state *st)
160 const int top_level = (sizeof(void *) * 8 - LEAF_BITS - BYTE_BITS) / 8;
161 free_tracking_at((void **)st->tracking, top_level);
165 static void thing_size(pTHX_ const SV *const, struct state *);
182 cc_opclass(const OP * const o)
188 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
190 if (o->op_type == OP_SASSIGN)
191 return ((o->op_private & OPpASSIGN_BACKWARDS) ? OPc_UNOP : OPc_BINOP);
194 if (o->op_type == OP_GV || o->op_type == OP_GVSV || o->op_type == OP_AELEMFAST)
198 if ((o->op_type == OP_TRANS)) {
202 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
227 case OA_PVOP_OR_SVOP: TAG;
229 * Character translations (tr///) are usually a PVOP, keeping a
230 * pointer to a table of shorts used to look up translations.
231 * Under utf8, however, a simple table isn't practical; instead,
232 * the OP is an SVOP, and the SV is a reference to a swash
233 * (i.e., an RV pointing to an HV).
235 return (o->op_private & (OPpTRANS_TO_UTF|OPpTRANS_FROM_UTF))
236 ? OPc_SVOP : OPc_PVOP;
244 case OA_BASEOP_OR_UNOP: TAG;
246 * UNI(OP_foo) in toke.c returns token UNI or FUNC1 depending on
247 * whether parens were seen. perly.y uses OPf_SPECIAL to
248 * signal whether a BASEOP had empty parens or none.
249 * Some other UNOPs are created later, though, so the best
250 * test is OPf_KIDS, which is set in newUNOP.
252 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
254 case OA_FILESTATOP: TAG;
256 * The file stat OPs are created via UNI(OP_foo) in toke.c but use
257 * the OPf_REF flag to distinguish between OP types instead of the
258 * usual OPf_SPECIAL flag. As usual, if OPf_KIDS is set, then we
259 * return OPc_UNOP so that walkoptree can find our children. If
260 * OPf_KIDS is not set then we check OPf_REF. Without OPf_REF set
261 * (no argument to the operator) it's an OP; with OPf_REF set it's
262 * an SVOP (and op_sv is the GV for the filehandle argument).
264 return ((o->op_flags & OPf_KIDS) ? OPc_UNOP :
266 (o->op_flags & OPf_REF) ? OPc_PADOP : OPc_BASEOP);
268 (o->op_flags & OPf_REF) ? OPc_SVOP : OPc_BASEOP);
270 case OA_LOOPEXOP: TAG;
272 * next, last, redo, dump and goto use OPf_SPECIAL to indicate that a
273 * label was omitted (in which case it's a BASEOP) or else a term was
274 * seen. In this last case, all except goto are definitely PVOP but
275 * goto is either a PVOP (with an ordinary constant label), an UNOP
276 * with OPf_STACKED (with a non-constant non-sub) or an UNOP for
277 * OP_REFGEN (with goto &sub) in which case OPf_STACKED also seems to
280 if (o->op_flags & OPf_STACKED)
282 else if (o->op_flags & OPf_SPECIAL)
287 warn("Devel::Size: Can't determine class of operator %s, assuming BASEOP\n",
288 PL_op_name[o->op_type]);
299 /* Figure out how much magic is attached to the SV and return the
302 magic_size(const SV * const thing, struct state *st) {
303 MAGIC *magic_pointer;
306 if (!SvMAGIC(thing)) {
311 /* Get the base magic pointer */
312 magic_pointer = SvMAGIC(thing);
314 /* Have we seen the magic pointer? */
315 while (magic_pointer && check_new(st, magic_pointer)) {
316 st->total_size += sizeof(MAGIC);
319 /* Have we seen the magic vtable? */
320 if (magic_pointer->mg_virtual &&
321 check_new(st, magic_pointer->mg_virtual)) {
322 st->total_size += sizeof(MGVTBL);
325 /* Get the next in the chain */
326 magic_pointer = magic_pointer->mg_moremagic;
329 if (st->dangle_whine)
330 warn( "Devel::Size: Encountered bad magic at: %p\n", magic_pointer );
336 regex_size(const REGEXP * const baseregex, struct state *st) {
337 if(!check_new(st, baseregex))
339 st->total_size += sizeof(REGEXP);
340 #if (PERL_VERSION < 11)
341 /* Note the size of the paren offset thing */
342 st->total_size += sizeof(I32) * baseregex->nparens * 2;
343 st->total_size += strlen(baseregex->precomp);
345 st->total_size += sizeof(struct regexp);
346 st->total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
347 /*st->total_size += strlen(SvANY(baseregex)->subbeg);*/
349 if (st->go_yell && !st->regex_whine) {
350 carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
356 op_size(pTHX_ const OP * const baseop, struct state *st)
360 if(!check_new(st, baseop))
363 op_size(aTHX_ baseop->op_next, st);
365 switch (cc_opclass(baseop)) {
366 case OPc_BASEOP: TAG;
367 st->total_size += sizeof(struct op);
370 st->total_size += sizeof(struct unop);
371 op_size(aTHX_ cUNOPx(baseop)->op_first, st);
374 st->total_size += sizeof(struct binop);
375 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
376 op_size(aTHX_ cBINOPx(baseop)->op_last, st);
379 st->total_size += sizeof(struct logop);
380 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
381 op_size(aTHX_ cLOGOPx(baseop)->op_other, st);
383 case OPc_LISTOP: TAG;
384 st->total_size += sizeof(struct listop);
385 op_size(aTHX_ cLISTOPx(baseop)->op_first, st);
386 op_size(aTHX_ cLISTOPx(baseop)->op_last, st);
389 st->total_size += sizeof(struct pmop);
390 op_size(aTHX_ cPMOPx(baseop)->op_first, st);
391 op_size(aTHX_ cPMOPx(baseop)->op_last, st);
392 #if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
393 op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, st);
394 op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, st);
395 op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, st);
397 /* This is defined away in perl 5.8.x, but it is in there for
400 regex_size(PM_GETRE(cPMOPx(baseop)), st);
402 regex_size(cPMOPx(baseop)->op_pmregexp, st);
406 st->total_size += sizeof(struct pmop);
407 if (check_new(st, cSVOPx(baseop)->op_sv)) {
408 thing_size(aTHX_ cSVOPx(baseop)->op_sv, st);
412 st->total_size += sizeof(struct padop);
415 if (check_new(st, cPVOPx(baseop)->op_pv)) {
416 st->total_size += strlen(cPVOPx(baseop)->op_pv);
419 st->total_size += sizeof(struct loop);
420 op_size(aTHX_ cLOOPx(baseop)->op_first, st);
421 op_size(aTHX_ cLOOPx(baseop)->op_last, st);
422 op_size(aTHX_ cLOOPx(baseop)->op_redoop, st);
423 op_size(aTHX_ cLOOPx(baseop)->op_nextop, st);
424 op_size(aTHX_ cLOOPx(baseop)->op_lastop, st);
429 basecop = (COP *)baseop;
430 st->total_size += sizeof(struct cop);
432 /* Change 33656 by nicholas@mouse-mill on 2008/04/07 11:29:51
433 Eliminate cop_label from struct cop by storing a label as the first
434 entry in the hints hash. Most statements don't have labels, so this
435 will save memory. Not sure how much.
436 The check below will be incorrect fail on bleadperls
437 before 5.11 @33656, but later than 5.10, producing slightly too
438 small memory sizes on these Perls. */
439 #if (PERL_VERSION < 11)
440 if (check_new(st, basecop->cop_label)) {
441 st->total_size += strlen(basecop->cop_label);
445 if (check_new(st, basecop->cop_file)) {
446 st->total_size += strlen(basecop->cop_file);
448 if (check_new(st, basecop->cop_stashpv)) {
449 st->total_size += strlen(basecop->cop_stashpv);
452 if (check_new(st, basecop->cop_stash)) {
453 thing_size(aTHX_ (SV *)basecop->cop_stash, st);
455 if (check_new(st, basecop->cop_filegv)) {
456 thing_size(aTHX_ (SV *)basecop->cop_filegv, st);
467 if (st->dangle_whine)
468 warn( "Devel::Size: Encountered dangling pointer in opcode at: %p\n", baseop );
472 #if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
473 # define NEW_HEAD_LAYOUT
477 thing_size(pTHX_ const SV * const orig_thing, struct state *st) {
478 const SV *thing = orig_thing;
480 st->total_size += sizeof(SV);
482 switch (SvTYPE(thing)) {
486 /* Just a plain integer. This will be differently sized depending
487 on whether purify's been compiled in */
489 #ifndef NEW_HEAD_LAYOUT
491 st->total_size += sizeof(sizeof(XPVIV));
493 st->total_size += sizeof(IV);
497 /* Is it a float? Like the int, it depends on purify */
500 st->total_size += sizeof(sizeof(XPVNV));
502 st->total_size += sizeof(NV);
505 #if (PERL_VERSION < 11)
506 /* Is it a reference? */
508 #ifndef NEW_HEAD_LAYOUT
509 st->total_size += sizeof(XRV);
513 /* How about a plain string? In which case we need to add in how
514 much has been allocated */
516 st->total_size += sizeof(XPV);
518 thing_size(aTHX_ SvRV_const(thing), st);
520 st->total_size += SvLEN(thing);
522 /* A string with an integer part? */
524 st->total_size += sizeof(XPVIV);
526 thing_size(aTHX_ SvRV_const(thing), st);
528 st->total_size += SvLEN(thing);
530 st->total_size += SvIVX(thing);
533 /* A scalar/string/reference with a float part? */
535 st->total_size += sizeof(XPVNV);
537 thing_size(aTHX_ SvRV_const(thing), st);
539 st->total_size += SvLEN(thing);
542 st->total_size += sizeof(XPVMG);
544 thing_size(aTHX_ SvRV_const(thing), st);
546 st->total_size += SvLEN(thing);
547 magic_size(thing, st);
549 #if PERL_VERSION <= 8
551 st->total_size += sizeof(XPVBM);
553 thing_size(aTHX_ SvRV_const(thing), st);
555 st->total_size += SvLEN(thing);
556 magic_size(thing, st);
560 st->total_size += sizeof(XPVLV);
562 thing_size(aTHX_ SvRV_const(thing), st);
564 st->total_size += SvLEN(thing);
565 magic_size(thing, st);
567 /* How much space is dedicated to the array? Not counting the
568 elements in the array, mind, just the array itself */
570 st->total_size += sizeof(XPVAV);
571 /* Is there anything in the array? */
572 if (AvMAX(thing) != -1) {
573 /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
574 st->total_size += sizeof(SV *) * (AvMAX(thing) + 1);
575 dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", st->total_size, AvMAX(thing), av_len((AV*)thing)));
577 /* Add in the bits on the other side of the beginning */
579 dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n",
580 st->total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));
582 /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
583 resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
584 if (AvALLOC(thing) != 0) {
585 st->total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
587 #if (PERL_VERSION < 9)
588 /* Is there something hanging off the arylen element?
589 Post 5.9.something this is stored in magic, so will be found there,
590 and Perl_av_arylen_p() takes a non-const AV*, hence compilers rightly
591 complain about AvARYLEN() passing thing to it. */
592 if (AvARYLEN(thing)) {
593 if (check_new(st, AvARYLEN(thing))) {
594 thing_size(aTHX_ AvARYLEN(thing), st);
598 magic_size(thing, st);
601 /* First the base struct */
602 st->total_size += sizeof(XPVHV);
603 /* Now the array of buckets */
604 st->total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
605 /* Now walk the bucket chain */
606 if (HvARRAY(thing)) {
609 for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
610 cur_entry = *(HvARRAY(thing) + cur_bucket);
612 st->total_size += sizeof(HE);
613 if (cur_entry->hent_hek) {
614 /* Hash keys can be shared. Have we seen this before? */
615 if (check_new(st, cur_entry->hent_hek)) {
616 st->total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
619 cur_entry = cur_entry->hent_next;
623 magic_size(thing, st);
626 st->total_size += sizeof(XPVCV);
627 magic_size(thing, st);
629 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
630 if (check_new(st, CvSTASH(thing))) {
631 thing_size(aTHX_ (SV *)CvSTASH(thing), st);
633 if (check_new(st, SvSTASH(thing))) {
634 thing_size(aTHX_ (SV *)SvSTASH(thing), st);
636 if (check_new(st, CvGV(thing))) {
637 thing_size(aTHX_ (SV *)CvGV(thing), st);
639 if (check_new(st, CvPADLIST(thing))) {
640 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
642 if (check_new(st, CvOUTSIDE(thing))) {
643 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
645 if (CvISXSUB(thing)) {
646 SV *sv = cv_const_sv((CV *)thing);
648 thing_size(aTHX_ sv, st);
651 op_size(aTHX_ CvSTART(thing), st);
652 op_size(aTHX_ CvROOT(thing), st);
657 magic_size(thing, st);
658 st->total_size += sizeof(XPVGV);
659 st->total_size += GvNAMELEN(thing);
661 /* Is there a file? */
663 if (check_new(st, GvFILE(thing))) {
664 st->total_size += strlen(GvFILE(thing));
668 /* Is there something hanging off the glob? */
670 if (check_new(st, GvGP(thing))) {
671 st->total_size += sizeof(GP);
674 if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
675 thing_size(aTHX_ generic_thing, st);
677 if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
678 thing_size(aTHX_ generic_thing, st);
680 if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
681 thing_size(aTHX_ generic_thing, st);
683 if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
684 thing_size(aTHX_ generic_thing, st);
686 if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
687 thing_size(aTHX_ generic_thing, st);
689 if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
690 thing_size(aTHX_ generic_thing, st);
697 st->total_size += sizeof(XPVFM);
698 magic_size(thing, st);
699 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
700 if (check_new(st, CvPADLIST(thing))) {
701 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
703 if (check_new(st, CvOUTSIDE(thing))) {
704 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
707 if (st->go_yell && !st->fm_whine) {
708 carp("Devel::Size: Calculated sizes for FMs are incomplete");
713 st->total_size += sizeof(XPVIO);
714 magic_size(thing, st);
715 if (check_new(st, (SvPVX_const(thing)))) {
716 st->total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
718 /* Some embedded char pointers */
719 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_top_name)) {
720 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_top_name);
722 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_fmt_name)) {
723 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_fmt_name);
725 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_bottom_name)) {
726 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_bottom_name);
728 /* Throw the GVs on the list to be walked if they're not-null */
729 if (((XPVIO *) SvANY(thing))->xio_top_gv) {
730 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, st);
732 if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
733 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, st);
735 if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
736 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, st);
739 /* Only go trotting through the IO structures if they're really
740 trottable. If USE_PERLIO is defined we can do this. If
741 not... we can't, so we don't even try */
743 /* Dig into xio_ifp and xio_ofp here */
744 warn("Devel::Size: Can't size up perlio layers yet\n");
748 warn("Devel::Size: Unknown variable type: %d encountered\n", SvTYPE(thing) );
752 static struct state *
757 Newxz(st, 1, struct state);
759 if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
760 st->dangle_whine = st->go_yell = SvIV(warn_flag) ? TRUE : FALSE;
762 if (NULL != (warn_flag = perl_get_sv("Devel::Size::dangle", FALSE))) {
763 st->dangle_whine = SvIV(warn_flag) ? TRUE : FALSE;
768 MODULE = Devel::Size PACKAGE = Devel::Size
777 SV *thing = orig_thing;
778 struct state *st = new_state(aTHX);
780 /* If they passed us a reference then dereference it. This is the
781 only way we can check the sizes of arrays and hashes */
782 #if (PERL_VERSION < 11)
783 if (SvOK(thing) && SvROK(thing)) {
792 thing_size(aTHX_ thing, st);
793 RETVAL = st->total_size;
801 total_size(orig_thing)
805 SV *thing = orig_thing;
806 /* Array with things we still need to do */
809 struct state *st = new_state(aTHX);
811 /* Size starts at zero */
814 pending_array = newAV();
816 /* If they passed us a reference then dereference it.
817 This is the only way we can check the sizes of arrays and hashes. */
822 /* Put it on the pending array */
823 av_push(pending_array, thing);
825 /* Now just yank things off the end of the array until it's done */
826 while (av_len(pending_array) >= 0) {
827 thing = av_pop(pending_array);
828 /* Process it if we've not seen it */
829 if (check_new(st, thing)) {
830 dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
833 /* Yes, it is. So let's check the type */
834 switch (SvTYPE(thing)) {
835 /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
839 av_push(pending_array, SvRV(thing));
842 #if (PERL_VERSION < 11)
847 dbg_printf(("# Found RV\n"));
849 dbg_printf(("# Found RV\n"));
850 av_push(pending_array, SvRV(thing));
856 AV *tempAV = (AV *)thing;
859 dbg_printf(("# Found type AV\n"));
860 /* Quick alias to cut down on casting */
863 if (av_len(tempAV) != -1) {
865 /* Run through them all */
866 for (index = 0; index <= av_len(tempAV); index++) {
867 /* Did we get something? */
868 if ((tempSV = av_fetch(tempAV, index, 0))) {
870 if (*tempSV != &PL_sv_undef) {
871 /* Apparently not. Save it for later */
872 av_push(pending_array, *tempSV);
881 dbg_printf(("# Found type HV\n"));
882 /* Is there anything in here? */
883 if (hv_iterinit((HV *)thing)) {
885 while ((temp_he = hv_iternext((HV *)thing))) {
886 av_push(pending_array, hv_iterval((HV *)thing, temp_he));
892 dbg_printf(("# Found type GV\n"));
893 /* Run through all the pieces and push the ones with bits */
895 av_push(pending_array, (SV *)GvSV(thing));
898 av_push(pending_array, (SV *)GvFORM(thing));
901 av_push(pending_array, (SV *)GvAV(thing));
904 av_push(pending_array, (SV *)GvHV(thing));
907 av_push(pending_array, (SV *)GvCV(thing));
915 thing_size(aTHX_ thing, st);
917 /* check_new() returned false: */
918 #ifdef DEVEL_SIZE_DEBUGGING
919 if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
920 else printf("# Ignore non-sv 0x%x\n", sv);
925 RETVAL = st->total_size;
927 SvREFCNT_dec(pending_array);