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 st->total_size += sizeof(REGEXP);
338 #if (PERL_VERSION < 11)
339 /* Note the size of the paren offset thing */
340 st->total_size += sizeof(I32) * baseregex->nparens * 2;
341 st->total_size += strlen(baseregex->precomp);
343 st->total_size += sizeof(struct regexp);
344 st->total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
345 /*st->total_size += strlen(SvANY(baseregex)->subbeg);*/
347 if (st->go_yell && !st->regex_whine) {
348 carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
354 op_size(pTHX_ const OP * const baseop, struct state *st)
358 if(!check_new(st, baseop))
361 op_size(aTHX_ baseop->op_next, st);
363 switch (cc_opclass(baseop)) {
364 case OPc_BASEOP: TAG;
365 st->total_size += sizeof(struct op);
368 st->total_size += sizeof(struct unop);
369 op_size(aTHX_ cUNOPx(baseop)->op_first, st);
372 st->total_size += sizeof(struct binop);
373 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
374 op_size(aTHX_ cBINOPx(baseop)->op_last, st);
377 st->total_size += sizeof(struct logop);
378 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
379 op_size(aTHX_ cLOGOPx(baseop)->op_other, st);
381 case OPc_LISTOP: TAG;
382 st->total_size += sizeof(struct listop);
383 op_size(aTHX_ cLISTOPx(baseop)->op_first, st);
384 op_size(aTHX_ cLISTOPx(baseop)->op_last, st);
387 st->total_size += sizeof(struct pmop);
388 op_size(aTHX_ cPMOPx(baseop)->op_first, st);
389 op_size(aTHX_ cPMOPx(baseop)->op_last, st);
390 #if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
391 op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, st);
392 op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, st);
393 op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, st);
395 /* This is defined away in perl 5.8.x, but it is in there for
398 if (check_new(st, PM_GETRE((cPMOPx(baseop))))) {
399 regex_size(PM_GETRE(cPMOPx(baseop)), st);
402 if (check_new(st, cPMOPx(baseop)->op_pmregexp)) {
403 regex_size(cPMOPx(baseop)->op_pmregexp, st);
408 st->total_size += sizeof(struct pmop);
409 if (check_new(st, cSVOPx(baseop)->op_sv)) {
410 thing_size(aTHX_ cSVOPx(baseop)->op_sv, st);
414 st->total_size += sizeof(struct padop);
417 if (check_new(st, cPVOPx(baseop)->op_pv)) {
418 st->total_size += strlen(cPVOPx(baseop)->op_pv);
421 st->total_size += sizeof(struct loop);
422 op_size(aTHX_ cLOOPx(baseop)->op_first, st);
423 op_size(aTHX_ cLOOPx(baseop)->op_last, st);
424 op_size(aTHX_ cLOOPx(baseop)->op_redoop, st);
425 op_size(aTHX_ cLOOPx(baseop)->op_nextop, st);
426 op_size(aTHX_ cLOOPx(baseop)->op_lastop, st);
431 basecop = (COP *)baseop;
432 st->total_size += sizeof(struct cop);
434 /* Change 33656 by nicholas@mouse-mill on 2008/04/07 11:29:51
435 Eliminate cop_label from struct cop by storing a label as the first
436 entry in the hints hash. Most statements don't have labels, so this
437 will save memory. Not sure how much.
438 The check below will be incorrect fail on bleadperls
439 before 5.11 @33656, but later than 5.10, producing slightly too
440 small memory sizes on these Perls. */
441 #if (PERL_VERSION < 11)
442 if (check_new(st, basecop->cop_label)) {
443 st->total_size += strlen(basecop->cop_label);
447 if (check_new(st, basecop->cop_file)) {
448 st->total_size += strlen(basecop->cop_file);
450 if (check_new(st, basecop->cop_stashpv)) {
451 st->total_size += strlen(basecop->cop_stashpv);
454 if (check_new(st, basecop->cop_stash)) {
455 thing_size(aTHX_ (SV *)basecop->cop_stash, st);
457 if (check_new(st, basecop->cop_filegv)) {
458 thing_size(aTHX_ (SV *)basecop->cop_filegv, st);
469 if (st->dangle_whine)
470 warn( "Devel::Size: Encountered dangling pointer in opcode at: %p\n", baseop );
474 #if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
475 # define NEW_HEAD_LAYOUT
479 thing_size(pTHX_ const SV * const orig_thing, struct state *st) {
480 const SV *thing = orig_thing;
482 st->total_size += sizeof(SV);
484 switch (SvTYPE(thing)) {
488 /* Just a plain integer. This will be differently sized depending
489 on whether purify's been compiled in */
491 #ifndef NEW_HEAD_LAYOUT
493 st->total_size += sizeof(sizeof(XPVIV));
495 st->total_size += sizeof(IV);
499 /* Is it a float? Like the int, it depends on purify */
502 st->total_size += sizeof(sizeof(XPVNV));
504 st->total_size += sizeof(NV);
507 #if (PERL_VERSION < 11)
508 /* Is it a reference? */
510 #ifndef NEW_HEAD_LAYOUT
511 st->total_size += sizeof(XRV);
515 /* How about a plain string? In which case we need to add in how
516 much has been allocated */
518 st->total_size += sizeof(XPV);
520 thing_size(aTHX_ SvRV_const(thing), st);
522 st->total_size += SvLEN(thing);
524 /* A string with an integer part? */
526 st->total_size += sizeof(XPVIV);
528 thing_size(aTHX_ SvRV_const(thing), st);
530 st->total_size += SvLEN(thing);
532 st->total_size += SvIVX(thing);
535 /* A scalar/string/reference with a float part? */
537 st->total_size += sizeof(XPVNV);
539 thing_size(aTHX_ SvRV_const(thing), st);
541 st->total_size += SvLEN(thing);
544 st->total_size += sizeof(XPVMG);
546 thing_size(aTHX_ SvRV_const(thing), st);
548 st->total_size += SvLEN(thing);
549 magic_size(thing, st);
551 #if PERL_VERSION <= 8
553 st->total_size += sizeof(XPVBM);
555 thing_size(aTHX_ SvRV_const(thing), st);
557 st->total_size += SvLEN(thing);
558 magic_size(thing, st);
562 st->total_size += sizeof(XPVLV);
564 thing_size(aTHX_ SvRV_const(thing), st);
566 st->total_size += SvLEN(thing);
567 magic_size(thing, st);
569 /* How much space is dedicated to the array? Not counting the
570 elements in the array, mind, just the array itself */
572 st->total_size += sizeof(XPVAV);
573 /* Is there anything in the array? */
574 if (AvMAX(thing) != -1) {
575 /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
576 st->total_size += sizeof(SV *) * (AvMAX(thing) + 1);
577 dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", st->total_size, AvMAX(thing), av_len((AV*)thing)));
579 /* Add in the bits on the other side of the beginning */
581 dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n",
582 st->total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));
584 /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
585 resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
586 if (AvALLOC(thing) != 0) {
587 st->total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
589 #if (PERL_VERSION < 9)
590 /* Is there something hanging off the arylen element?
591 Post 5.9.something this is stored in magic, so will be found there,
592 and Perl_av_arylen_p() takes a non-const AV*, hence compilers rightly
593 complain about AvARYLEN() passing thing to it. */
594 if (AvARYLEN(thing)) {
595 if (check_new(st, AvARYLEN(thing))) {
596 thing_size(aTHX_ AvARYLEN(thing), st);
600 magic_size(thing, st);
603 /* First the base struct */
604 st->total_size += sizeof(XPVHV);
605 /* Now the array of buckets */
606 st->total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
607 /* Now walk the bucket chain */
608 if (HvARRAY(thing)) {
611 for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
612 cur_entry = *(HvARRAY(thing) + cur_bucket);
614 st->total_size += sizeof(HE);
615 if (cur_entry->hent_hek) {
616 /* Hash keys can be shared. Have we seen this before? */
617 if (check_new(st, cur_entry->hent_hek)) {
618 st->total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
621 cur_entry = cur_entry->hent_next;
625 magic_size(thing, st);
628 st->total_size += sizeof(XPVCV);
629 magic_size(thing, st);
631 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
632 if (check_new(st, CvSTASH(thing))) {
633 thing_size(aTHX_ (SV *)CvSTASH(thing), st);
635 if (check_new(st, SvSTASH(thing))) {
636 thing_size(aTHX_ (SV *)SvSTASH(thing), st);
638 if (check_new(st, CvGV(thing))) {
639 thing_size(aTHX_ (SV *)CvGV(thing), st);
641 if (check_new(st, CvPADLIST(thing))) {
642 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
644 if (check_new(st, CvOUTSIDE(thing))) {
645 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
647 if (CvISXSUB(thing)) {
648 SV *sv = cv_const_sv((CV *)thing);
650 thing_size(aTHX_ sv, st);
653 op_size(aTHX_ CvSTART(thing), st);
654 op_size(aTHX_ CvROOT(thing), st);
659 magic_size(thing, st);
660 st->total_size += sizeof(XPVGV);
661 st->total_size += GvNAMELEN(thing);
663 /* Is there a file? */
665 if (check_new(st, GvFILE(thing))) {
666 st->total_size += strlen(GvFILE(thing));
670 /* Is there something hanging off the glob? */
672 if (check_new(st, GvGP(thing))) {
673 st->total_size += sizeof(GP);
676 if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
677 thing_size(aTHX_ generic_thing, st);
679 if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
680 thing_size(aTHX_ generic_thing, st);
682 if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
683 thing_size(aTHX_ generic_thing, st);
685 if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
686 thing_size(aTHX_ generic_thing, st);
688 if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
689 thing_size(aTHX_ generic_thing, st);
691 if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
692 thing_size(aTHX_ generic_thing, st);
699 st->total_size += sizeof(XPVFM);
700 magic_size(thing, st);
701 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
702 if (check_new(st, CvPADLIST(thing))) {
703 thing_size(aTHX_ (SV *)CvPADLIST(thing), st);
705 if (check_new(st, CvOUTSIDE(thing))) {
706 thing_size(aTHX_ (SV *)CvOUTSIDE(thing), st);
709 if (st->go_yell && !st->fm_whine) {
710 carp("Devel::Size: Calculated sizes for FMs are incomplete");
715 st->total_size += sizeof(XPVIO);
716 magic_size(thing, st);
717 if (check_new(st, (SvPVX_const(thing)))) {
718 st->total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
720 /* Some embedded char pointers */
721 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_top_name)) {
722 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_top_name);
724 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_fmt_name)) {
725 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_fmt_name);
727 if (check_new(st, ((XPVIO *) SvANY(thing))->xio_bottom_name)) {
728 st->total_size += strlen(((XPVIO *) SvANY(thing))->xio_bottom_name);
730 /* Throw the GVs on the list to be walked if they're not-null */
731 if (((XPVIO *) SvANY(thing))->xio_top_gv) {
732 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, st);
734 if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
735 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, st);
737 if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
738 thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, st);
741 /* Only go trotting through the IO structures if they're really
742 trottable. If USE_PERLIO is defined we can do this. If
743 not... we can't, so we don't even try */
745 /* Dig into xio_ifp and xio_ofp here */
746 warn("Devel::Size: Can't size up perlio layers yet\n");
750 warn("Devel::Size: Unknown variable type: %d encountered\n", SvTYPE(thing) );
754 static struct state *
759 Newxz(st, 1, struct state);
761 if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
762 st->dangle_whine = st->go_yell = SvIV(warn_flag) ? TRUE : FALSE;
764 if (NULL != (warn_flag = perl_get_sv("Devel::Size::dangle", FALSE))) {
765 st->dangle_whine = SvIV(warn_flag) ? TRUE : FALSE;
770 MODULE = Devel::Size PACKAGE = Devel::Size
779 SV *thing = orig_thing;
780 struct state *st = new_state(aTHX);
782 /* If they passed us a reference then dereference it. This is the
783 only way we can check the sizes of arrays and hashes */
784 #if (PERL_VERSION < 11)
785 if (SvOK(thing) && SvROK(thing)) {
794 thing_size(aTHX_ thing, st);
795 RETVAL = st->total_size;
803 total_size(orig_thing)
807 SV *thing = orig_thing;
808 /* Array with things we still need to do */
811 struct state *st = new_state(aTHX);
813 /* Size starts at zero */
816 pending_array = newAV();
818 /* If they passed us a reference then dereference it.
819 This is the only way we can check the sizes of arrays and hashes. */
824 /* Put it on the pending array */
825 av_push(pending_array, thing);
827 /* Now just yank things off the end of the array until it's done */
828 while (av_len(pending_array) >= 0) {
829 thing = av_pop(pending_array);
830 /* Process it if we've not seen it */
831 if (check_new(st, thing)) {
832 dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
835 /* Yes, it is. So let's check the type */
836 switch (SvTYPE(thing)) {
837 /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
841 av_push(pending_array, SvRV(thing));
844 #if (PERL_VERSION < 11)
849 dbg_printf(("# Found RV\n"));
851 dbg_printf(("# Found RV\n"));
852 av_push(pending_array, SvRV(thing));
858 AV *tempAV = (AV *)thing;
861 dbg_printf(("# Found type AV\n"));
862 /* Quick alias to cut down on casting */
865 if (av_len(tempAV) != -1) {
867 /* Run through them all */
868 for (index = 0; index <= av_len(tempAV); index++) {
869 /* Did we get something? */
870 if ((tempSV = av_fetch(tempAV, index, 0))) {
872 if (*tempSV != &PL_sv_undef) {
873 /* Apparently not. Save it for later */
874 av_push(pending_array, *tempSV);
883 dbg_printf(("# Found type HV\n"));
884 /* Is there anything in here? */
885 if (hv_iterinit((HV *)thing)) {
887 while ((temp_he = hv_iternext((HV *)thing))) {
888 av_push(pending_array, hv_iterval((HV *)thing, temp_he));
894 dbg_printf(("# Found type GV\n"));
895 /* Run through all the pieces and push the ones with bits */
897 av_push(pending_array, (SV *)GvSV(thing));
900 av_push(pending_array, (SV *)GvFORM(thing));
903 av_push(pending_array, (SV *)GvAV(thing));
906 av_push(pending_array, (SV *)GvHV(thing));
909 av_push(pending_array, (SV *)GvCV(thing));
917 thing_size(aTHX_ thing, st);
919 /* check_new() returned false: */
920 #ifdef DEVEL_SIZE_DEBUGGING
921 if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
922 else printf("# Ignore non-sv 0x%x\n", sv);
927 RETVAL = st->total_size;
929 SvREFCNT_dec(pending_array);