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 (check_new(st, magic_pointer)) {
316 st->total_size += sizeof(MAGIC);
319 /* Have we seen the magic vtable? */
320 if (check_new(st, magic_pointer->mg_virtual)) {
321 st->total_size += sizeof(MGVTBL);
324 /* Get the next in the chain */
325 magic_pointer = magic_pointer->mg_moremagic;
328 if (st->dangle_whine)
329 warn( "Devel::Size: Encountered bad magic at: %p\n", magic_pointer );
335 regex_size(const REGEXP * const baseregex, struct state *st) {
336 if(!check_new(st, baseregex))
338 st->total_size += sizeof(REGEXP);
339 #if (PERL_VERSION < 11)
340 /* Note the size of the paren offset thing */
341 st->total_size += sizeof(I32) * baseregex->nparens * 2;
342 st->total_size += strlen(baseregex->precomp);
344 st->total_size += sizeof(struct regexp);
345 st->total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
346 /*st->total_size += strlen(SvANY(baseregex)->subbeg);*/
348 if (st->go_yell && !st->regex_whine) {
349 carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
355 op_size(pTHX_ const OP * const baseop, struct state *st)
359 if(!check_new(st, baseop))
362 op_size(aTHX_ baseop->op_next, st);
364 switch (cc_opclass(baseop)) {
365 case OPc_BASEOP: TAG;
366 st->total_size += sizeof(struct op);
369 st->total_size += sizeof(struct unop);
370 op_size(aTHX_ cUNOPx(baseop)->op_first, st);
373 st->total_size += sizeof(struct binop);
374 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
375 op_size(aTHX_ cBINOPx(baseop)->op_last, st);
378 st->total_size += sizeof(struct logop);
379 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
380 op_size(aTHX_ cLOGOPx(baseop)->op_other, st);
382 case OPc_LISTOP: TAG;
383 st->total_size += sizeof(struct listop);
384 op_size(aTHX_ cLISTOPx(baseop)->op_first, st);
385 op_size(aTHX_ cLISTOPx(baseop)->op_last, st);
388 st->total_size += sizeof(struct pmop);
389 op_size(aTHX_ cPMOPx(baseop)->op_first, st);
390 op_size(aTHX_ cPMOPx(baseop)->op_last, st);
391 #if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
392 op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, st);
393 op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, st);
394 op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, st);
396 /* This is defined away in perl 5.8.x, but it is in there for
399 regex_size(PM_GETRE(cPMOPx(baseop)), st);
401 regex_size(cPMOPx(baseop)->op_pmregexp, st);
405 st->total_size += sizeof(struct pmop);
406 if (check_new(st, cSVOPx(baseop)->op_sv)) {
407 thing_size(aTHX_ cSVOPx(baseop)->op_sv, st);
411 st->total_size += sizeof(struct padop);
414 if (check_new(st, cPVOPx(baseop)->op_pv)) {
415 st->total_size += strlen(cPVOPx(baseop)->op_pv);
418 st->total_size += sizeof(struct loop);
419 op_size(aTHX_ cLOOPx(baseop)->op_first, st);
420 op_size(aTHX_ cLOOPx(baseop)->op_last, st);
421 op_size(aTHX_ cLOOPx(baseop)->op_redoop, st);
422 op_size(aTHX_ cLOOPx(baseop)->op_nextop, st);
423 op_size(aTHX_ cLOOPx(baseop)->op_lastop, st);
428 basecop = (COP *)baseop;
429 st->total_size += sizeof(struct cop);
431 /* Change 33656 by nicholas@mouse-mill on 2008/04/07 11:29:51
432 Eliminate cop_label from struct cop by storing a label as the first
433 entry in the hints hash. Most statements don't have labels, so this
434 will save memory. Not sure how much.
435 The check below will be incorrect fail on bleadperls
436 before 5.11 @33656, but later than 5.10, producing slightly too
437 small memory sizes on these Perls. */
438 #if (PERL_VERSION < 11)
439 if (check_new(st, basecop->cop_label)) {
440 st->total_size += strlen(basecop->cop_label);
444 if (check_new(st, basecop->cop_file)) {
445 st->total_size += strlen(basecop->cop_file);
447 if (check_new(st, basecop->cop_stashpv)) {
448 st->total_size += strlen(basecop->cop_stashpv);
451 if (check_new(st, basecop->cop_stash)) {
452 thing_size(aTHX_ (SV *)basecop->cop_stash, st);
454 if (check_new(st, basecop->cop_filegv)) {
455 thing_size(aTHX_ (SV *)basecop->cop_filegv, st);
466 if (st->dangle_whine)
467 warn( "Devel::Size: Encountered dangling pointer in opcode at: %p\n", baseop );
471 #if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
472 # define NEW_HEAD_LAYOUT
476 thing_size(pTHX_ const SV * const orig_thing, struct state *st) {
477 const SV *thing = orig_thing;
479 st->total_size += sizeof(SV);
481 switch (SvTYPE(thing)) {
485 /* Just a plain integer. This will be differently sized depending
486 on whether purify's been compiled in */
488 #ifndef NEW_HEAD_LAYOUT
490 st->total_size += sizeof(sizeof(XPVIV));
492 st->total_size += sizeof(IV);
496 /* Is it a float? Like the int, it depends on purify */
499 st->total_size += sizeof(sizeof(XPVNV));
501 st->total_size += sizeof(NV);
504 #if (PERL_VERSION < 11)
505 /* Is it a reference? */
507 #ifndef NEW_HEAD_LAYOUT
508 st->total_size += sizeof(XRV);
512 /* How about a plain string? In which case we need to add in how
513 much has been allocated */
515 st->total_size += sizeof(XPV);
517 thing_size(aTHX_ SvRV_const(thing), st);
519 st->total_size += SvLEN(thing);
521 /* A string with an integer part? */
523 st->total_size += sizeof(XPVIV);
525 thing_size(aTHX_ SvRV_const(thing), st);
527 st->total_size += SvLEN(thing);
529 st->total_size += SvIVX(thing);
532 /* A scalar/string/reference with a float part? */
534 st->total_size += sizeof(XPVNV);
536 thing_size(aTHX_ SvRV_const(thing), st);
538 st->total_size += SvLEN(thing);
541 st->total_size += sizeof(XPVMG);
543 thing_size(aTHX_ SvRV_const(thing), st);
545 st->total_size += SvLEN(thing);
546 magic_size(thing, st);
548 #if PERL_VERSION <= 8
550 st->total_size += sizeof(XPVBM);
552 thing_size(aTHX_ SvRV_const(thing), st);
554 st->total_size += SvLEN(thing);
555 magic_size(thing, st);
559 st->total_size += sizeof(XPVLV);
561 thing_size(aTHX_ SvRV_const(thing), st);
563 st->total_size += SvLEN(thing);
564 magic_size(thing, st);
566 /* How much space is dedicated to the array? Not counting the
567 elements in the array, mind, just the array itself */
569 st->total_size += sizeof(XPVAV);
570 /* Is there anything in the array? */
571 if (AvMAX(thing) != -1) {
572 /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
573 st->total_size += sizeof(SV *) * (AvMAX(thing) + 1);
574 dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", st->total_size, AvMAX(thing), av_len((AV*)thing)));
576 /* Add in the bits on the other side of the beginning */
578 dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n",
579 st->total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));
581 /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
582 resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
583 if (AvALLOC(thing) != 0) {
584 st->total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
586 #if (PERL_VERSION < 9)
587 /* Is there something hanging off the arylen element?
588 Post 5.9.something this is stored in magic, so will be found there,
589 and Perl_av_arylen_p() takes a non-const AV*, hence compilers rightly
590 complain about AvARYLEN() passing thing to it. */
591 if (AvARYLEN(thing)) {
592 if (check_new(st, AvARYLEN(thing))) {
593 thing_size(aTHX_ AvARYLEN(thing), st);
597 magic_size(thing, st);
600 /* First the base struct */
601 st->total_size += sizeof(XPVHV);
602 /* Now the array of buckets */
603 st->total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
604 /* Now walk the bucket chain */
605 if (HvARRAY(thing)) {
608 for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
609 cur_entry = *(HvARRAY(thing) + cur_bucket);
611 st->total_size += sizeof(HE);
612 if (cur_entry->hent_hek) {
613 /* Hash keys can be shared. Have we seen this before? */
614 if (check_new(st, cur_entry->hent_hek)) {
615 st->total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
618 cur_entry = cur_entry->hent_next;
622 magic_size(thing, st);
625 st->total_size += sizeof(XPVCV);
626 magic_size(thing, st);
628 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
629 if (check_new(st, CvSTASH(thing))) {
630 thing_size(aTHX_ (SV *)CvSTASH(thing), st);
632 if (check_new(st, SvSTASH(thing))) {
633 thing_size(aTHX_ (SV *)SvSTASH(thing), st);
635 if (check_new(st, CvGV(thing))) {
636 thing_size(aTHX_ (SV *)CvGV(thing), st);
638 if (check_new(st, CvPADLIST(thing))) {
639 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
641 if (check_new(st, CvOUTSIDE(thing))) {
642 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
644 if (CvISXSUB(thing)) {
645 SV *sv = cv_const_sv((CV *)thing);
647 thing_size(aTHX_ sv, st);
650 op_size(aTHX_ CvSTART(thing), st);
651 op_size(aTHX_ CvROOT(thing), st);
656 magic_size(thing, st);
657 st->total_size += sizeof(XPVGV);
658 st->total_size += GvNAMELEN(thing);
660 /* Is there a file? */
661 if (check_new(st, GvFILE(thing))) {
662 st->total_size += strlen(GvFILE(thing));
665 /* Is there something hanging off the glob? */
667 if (check_new(st, GvGP(thing))) {
668 st->total_size += sizeof(GP);
671 if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
672 thing_size(aTHX_ generic_thing, st);
674 if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
675 thing_size(aTHX_ generic_thing, st);
677 if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
678 thing_size(aTHX_ generic_thing, st);
680 if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
681 thing_size(aTHX_ generic_thing, st);
683 if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
684 thing_size(aTHX_ generic_thing, st);
686 if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
687 thing_size(aTHX_ generic_thing, st);
694 st->total_size += sizeof(XPVFM);
695 magic_size(thing, st);
696 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
697 if (check_new(st, CvPADLIST(thing))) {
698 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
700 if (check_new(st, CvOUTSIDE(thing))) {
701 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
704 if (st->go_yell && !st->fm_whine) {
705 carp("Devel::Size: Calculated sizes for FMs are incomplete");
710 st->total_size += sizeof(XPVIO);
711 magic_size(thing, st);
712 if (check_new(st, (SvPVX_const(thing)))) {
713 st->total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
715 /* Some embedded char pointers */
716 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_top_name)) {
717 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_top_name);
719 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_fmt_name)) {
720 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_fmt_name);
722 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_bottom_name)) {
723 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_bottom_name);
725 /* Throw the GVs on the list to be walked if they're not-null */
726 if (((XPVIO *) SvANY(thing))->xio_top_gv) {
727 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, st);
729 if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
730 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, st);
732 if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
733 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, st);
736 /* Only go trotting through the IO structures if they're really
737 trottable. If USE_PERLIO is defined we can do this. If
738 not... we can't, so we don't even try */
740 /* Dig into xio_ifp and xio_ofp here */
741 warn("Devel::Size: Can't size up perlio layers yet\n");
745 warn("Devel::Size: Unknown variable type: %d encountered\n", SvTYPE(thing) );
749 static struct state *
754 Newxz(st, 1, struct state);
756 if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
757 st->dangle_whine = st->go_yell = SvIV(warn_flag) ? TRUE : FALSE;
759 if (NULL != (warn_flag = perl_get_sv("Devel::Size::dangle", FALSE))) {
760 st->dangle_whine = SvIV(warn_flag) ? TRUE : FALSE;
765 MODULE = Devel::Size PACKAGE = Devel::Size
774 SV *thing = orig_thing;
775 struct state *st = new_state(aTHX);
777 /* If they passed us a reference then dereference it. This is the
778 only way we can check the sizes of arrays and hashes */
779 #if (PERL_VERSION < 11)
780 if (SvOK(thing) && SvROK(thing)) {
789 thing_size(aTHX_ thing, st);
790 RETVAL = st->total_size;
798 total_size(orig_thing)
802 SV *thing = orig_thing;
803 /* Array with things we still need to do */
806 struct state *st = new_state(aTHX);
808 /* Size starts at zero */
811 pending_array = newAV();
813 /* If they passed us a reference then dereference it.
814 This is the only way we can check the sizes of arrays and hashes. */
819 /* Put it on the pending array */
820 av_push(pending_array, thing);
822 /* Now just yank things off the end of the array until it's done */
823 while (av_len(pending_array) >= 0) {
824 thing = av_pop(pending_array);
825 /* Process it if we've not seen it */
826 if (check_new(st, thing)) {
827 dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
830 /* Yes, it is. So let's check the type */
831 switch (SvTYPE(thing)) {
832 /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
836 av_push(pending_array, SvRV(thing));
839 #if (PERL_VERSION < 11)
844 dbg_printf(("# Found RV\n"));
846 dbg_printf(("# Found RV\n"));
847 av_push(pending_array, SvRV(thing));
853 AV *tempAV = (AV *)thing;
856 dbg_printf(("# Found type AV\n"));
857 /* Quick alias to cut down on casting */
860 if (av_len(tempAV) != -1) {
862 /* Run through them all */
863 for (index = 0; index <= av_len(tempAV); index++) {
864 /* Did we get something? */
865 if ((tempSV = av_fetch(tempAV, index, 0))) {
867 if (*tempSV != &PL_sv_undef) {
868 /* Apparently not. Save it for later */
869 av_push(pending_array, *tempSV);
878 dbg_printf(("# Found type HV\n"));
879 /* Is there anything in here? */
880 if (hv_iterinit((HV *)thing)) {
882 while ((temp_he = hv_iternext((HV *)thing))) {
883 av_push(pending_array, hv_iterval((HV *)thing, temp_he));
889 dbg_printf(("# Found type GV\n"));
890 /* Run through all the pieces and push the ones with bits */
892 av_push(pending_array, (SV *)GvSV(thing));
895 av_push(pending_array, (SV *)GvFORM(thing));
898 av_push(pending_array, (SV *)GvAV(thing));
901 av_push(pending_array, (SV *)GvHV(thing));
904 av_push(pending_array, (SV *)GvCV(thing));
912 thing_size(aTHX_ thing, st);
914 /* check_new() returned false: */
915 #ifdef DEVEL_SIZE_DEBUGGING
916 if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
917 else printf("# Ignore non-sv 0x%x\n", sv);
922 RETVAL = st->total_size;
924 SvREFCNT_dec(pending_array);