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);
86 void **tv_p = (void **) (st->tracking);
88 if (NULL == p) return FALSE;
90 const char c = *(const char *)p;
94 warn( "Devel::Size: Encountered invalid pointer: %p\n", p );
100 /* bits now 24 (32 bit pointers) or 56 (64 bit pointers) */
102 /* First level is always present. */
104 i = (unsigned int)((cooked_p >> bits) & 0xFF);
106 Newxz(tv_p[i], 256, void *);
107 tv_p = (void **)(tv_p[i]);
109 } while (bits > LEAF_BITS + BYTE_BITS);
110 /* bits now 16 always */
111 #if !defined(MULTIPLICITY) || PERL_VERSION > 8 || (PERL_VERSION == 8 && PERL_SUBVERSION > 8)
112 /* 5.8.8 and early have an assert() macro that uses Perl_croak, hence needs
113 a my_perl under multiplicity */
116 leaf_p = (U8 **)tv_p;
117 i = (unsigned int)((cooked_p >> bits) & 0xFF);
119 Newxz(leaf_p[i], 1 << LEAF_BITS, U8);
124 i = (unsigned int)((cooked_p >> BYTE_BITS) & LEAF_MASK);
126 if(leaf[i] & this_bit)
134 free_tracking_at(void **tv, int level)
142 free_tracking_at(tv[i], level);
156 free_state(struct state *st)
158 const int top_level = (sizeof(void *) * 8 - LEAF_BITS - BYTE_BITS) / 8;
159 free_tracking_at((void **)st->tracking, top_level);
163 /* For now, this is somewhat a compatibility bodge until the plan comes
164 together for fine grained recursion control. total_size() would recurse into
165 hash and array members, whereas sv_size() would not. However, sv_size() is
166 called with CvSTASH() of a CV, which means that if it (also) starts to
167 recurse fully, then the size of any CV now becomes the size of the entire
168 symbol table reachable from it, and potentially the entire symbol table, if
169 any subroutine makes a reference to a global (such as %SIG). The historical
170 implementation of total_size() didn't report "everything", and changing the
171 only available size to "everything" doesn't feel at all useful. */
173 #define NO_RECURSION 0
174 #define SOME_RECURSION 1
175 #define TOTAL_SIZE_RECURSION 2
177 static bool sv_size(pTHX_ struct state *, const SV *const, const int recurse);
195 cc_opclass(const OP * const o)
201 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
203 if (o->op_type == OP_SASSIGN)
204 return ((o->op_private & OPpASSIGN_BACKWARDS) ? OPc_UNOP : OPc_BINOP);
207 if (o->op_type == OP_GV || o->op_type == OP_GVSV || o->op_type == OP_AELEMFAST)
211 if ((o->op_type == OP_TRANS)) {
215 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
240 case OA_PVOP_OR_SVOP: TAG;
242 * Character translations (tr///) are usually a PVOP, keeping a
243 * pointer to a table of shorts used to look up translations.
244 * Under utf8, however, a simple table isn't practical; instead,
245 * the OP is an SVOP, and the SV is a reference to a swash
246 * (i.e., an RV pointing to an HV).
248 return (o->op_private & (OPpTRANS_TO_UTF|OPpTRANS_FROM_UTF))
249 ? OPc_SVOP : OPc_PVOP;
257 case OA_BASEOP_OR_UNOP: TAG;
259 * UNI(OP_foo) in toke.c returns token UNI or FUNC1 depending on
260 * whether parens were seen. perly.y uses OPf_SPECIAL to
261 * signal whether a BASEOP had empty parens or none.
262 * Some other UNOPs are created later, though, so the best
263 * test is OPf_KIDS, which is set in newUNOP.
265 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
267 case OA_FILESTATOP: TAG;
269 * The file stat OPs are created via UNI(OP_foo) in toke.c but use
270 * the OPf_REF flag to distinguish between OP types instead of the
271 * usual OPf_SPECIAL flag. As usual, if OPf_KIDS is set, then we
272 * return OPc_UNOP so that walkoptree can find our children. If
273 * OPf_KIDS is not set then we check OPf_REF. Without OPf_REF set
274 * (no argument to the operator) it's an OP; with OPf_REF set it's
275 * an SVOP (and op_sv is the GV for the filehandle argument).
277 return ((o->op_flags & OPf_KIDS) ? OPc_UNOP :
279 (o->op_flags & OPf_REF) ? OPc_PADOP : OPc_BASEOP);
281 (o->op_flags & OPf_REF) ? OPc_SVOP : OPc_BASEOP);
283 case OA_LOOPEXOP: TAG;
285 * next, last, redo, dump and goto use OPf_SPECIAL to indicate that a
286 * label was omitted (in which case it's a BASEOP) or else a term was
287 * seen. In this last case, all except goto are definitely PVOP but
288 * goto is either a PVOP (with an ordinary constant label), an UNOP
289 * with OPf_STACKED (with a non-constant non-sub) or an UNOP for
290 * OP_REFGEN (with goto &sub) in which case OPf_STACKED also seems to
293 if (o->op_flags & OPf_STACKED)
295 else if (o->op_flags & OPf_SPECIAL)
300 warn("Devel::Size: Can't determine class of operator %s, assuming BASEOP\n",
301 PL_op_name[o->op_type]);
312 /* Figure out how much magic is attached to the SV and return the
315 magic_size(const SV * const thing, struct state *st) {
316 MAGIC *magic_pointer;
319 if (!SvMAGIC(thing)) {
324 /* Get the base magic pointer */
325 magic_pointer = SvMAGIC(thing);
327 /* Have we seen the magic pointer? */
328 while (check_new(st, magic_pointer)) {
329 st->total_size += sizeof(MAGIC);
332 /* Have we seen the magic vtable? */
333 if (check_new(st, magic_pointer->mg_virtual)) {
334 st->total_size += sizeof(MGVTBL);
337 /* Get the next in the chain */
338 magic_pointer = magic_pointer->mg_moremagic;
341 if (st->dangle_whine)
342 warn( "Devel::Size: Encountered bad magic at: %p\n", magic_pointer );
348 check_new_and_strlen(struct state *st, const char *const p) {
350 st->total_size += 1 + strlen(p);
354 regex_size(const REGEXP * const baseregex, struct state *st) {
355 if(!check_new(st, baseregex))
357 st->total_size += sizeof(REGEXP);
358 #if (PERL_VERSION < 11)
359 /* Note the size of the paren offset thing */
360 st->total_size += sizeof(I32) * baseregex->nparens * 2;
361 st->total_size += strlen(baseregex->precomp);
363 st->total_size += sizeof(struct regexp);
364 st->total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
365 /*st->total_size += strlen(SvANY(baseregex)->subbeg);*/
367 if (st->go_yell && !st->regex_whine) {
368 carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
374 op_size(pTHX_ const OP * const baseop, struct state *st)
378 if(!check_new(st, baseop))
381 op_size(aTHX_ baseop->op_next, st);
383 switch (cc_opclass(baseop)) {
384 case OPc_BASEOP: TAG;
385 st->total_size += sizeof(struct op);
388 st->total_size += sizeof(struct unop);
389 op_size(aTHX_ cUNOPx(baseop)->op_first, st);
392 st->total_size += sizeof(struct binop);
393 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
394 op_size(aTHX_ cBINOPx(baseop)->op_last, st);
397 st->total_size += sizeof(struct logop);
398 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
399 op_size(aTHX_ cLOGOPx(baseop)->op_other, st);
401 case OPc_LISTOP: TAG;
402 st->total_size += sizeof(struct listop);
403 op_size(aTHX_ cLISTOPx(baseop)->op_first, st);
404 op_size(aTHX_ cLISTOPx(baseop)->op_last, st);
407 st->total_size += sizeof(struct pmop);
408 op_size(aTHX_ cPMOPx(baseop)->op_first, st);
409 op_size(aTHX_ cPMOPx(baseop)->op_last, st);
410 #if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
411 op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, st);
412 op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, st);
413 op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, st);
415 /* This is defined away in perl 5.8.x, but it is in there for
418 regex_size(PM_GETRE(cPMOPx(baseop)), st);
420 regex_size(cPMOPx(baseop)->op_pmregexp, st);
424 st->total_size += sizeof(struct pmop);
425 if (!(baseop->op_type == OP_AELEMFAST
426 && baseop->op_flags & OPf_SPECIAL)) {
427 /* not an OP_PADAV replacement */
428 sv_size(aTHX_ st, cSVOPx(baseop)->op_sv, SOME_RECURSION);
432 st->total_size += sizeof(struct padop);
435 check_new_and_strlen(st, cPVOPx(baseop)->op_pv);
438 st->total_size += sizeof(struct loop);
439 op_size(aTHX_ cLOOPx(baseop)->op_first, st);
440 op_size(aTHX_ cLOOPx(baseop)->op_last, st);
441 op_size(aTHX_ cLOOPx(baseop)->op_redoop, st);
442 op_size(aTHX_ cLOOPx(baseop)->op_nextop, st);
443 op_size(aTHX_ cLOOPx(baseop)->op_lastop, st);
448 basecop = (COP *)baseop;
449 st->total_size += sizeof(struct cop);
451 /* Change 33656 by nicholas@mouse-mill on 2008/04/07 11:29:51
452 Eliminate cop_label from struct cop by storing a label as the first
453 entry in the hints hash. Most statements don't have labels, so this
454 will save memory. Not sure how much.
455 The check below will be incorrect fail on bleadperls
456 before 5.11 @33656, but later than 5.10, producing slightly too
457 small memory sizes on these Perls. */
458 #if (PERL_VERSION < 11)
459 check_new_and_strlen(st, basecop->cop_label);
462 check_new_and_strlen(st, basecop->cop_file);
463 check_new_and_strlen(st, basecop->cop_stashpv);
465 sv_size(aTHX_ st, (SV *)basecop->cop_stash, SOME_RECURSION);
466 sv_size(aTHX_ st, (SV *)basecop->cop_filegv, SOME_RECURSION);
476 if (st->dangle_whine)
477 warn( "Devel::Size: Encountered dangling pointer in opcode at: %p\n", baseop );
481 #if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
482 # define NEW_HEAD_LAYOUT
486 sv_size(pTHX_ struct state *const st, const SV * const orig_thing,
488 const SV *thing = orig_thing;
490 if(!check_new(st, thing))
493 st->total_size += sizeof(SV);
495 switch (SvTYPE(thing)) {
499 /* Just a plain integer. This will be differently sized depending
500 on whether purify's been compiled in */
502 #ifndef NEW_HEAD_LAYOUT
504 st->total_size += sizeof(sizeof(XPVIV));
506 st->total_size += sizeof(IV);
509 if(recurse && SvROK(thing))
510 sv_size(aTHX_ st, SvRV_const(thing), recurse);
512 /* Is it a float? Like the int, it depends on purify */
515 st->total_size += sizeof(sizeof(XPVNV));
517 st->total_size += sizeof(NV);
520 #if (PERL_VERSION < 11)
521 /* Is it a reference? */
523 #ifndef NEW_HEAD_LAYOUT
524 st->total_size += sizeof(XRV);
526 if(recurse && SvROK(thing))
527 sv_size(aTHX_ st, SvRV_const(thing), recurse);
530 /* How about a plain string? In which case we need to add in how
531 much has been allocated */
533 st->total_size += sizeof(XPV);
534 if(recurse && SvROK(thing))
535 sv_size(aTHX_ st, SvRV_const(thing), recurse);
537 st->total_size += SvLEN(thing);
539 /* A string with an integer part? */
541 st->total_size += sizeof(XPVIV);
542 if(recurse && SvROK(thing))
543 sv_size(aTHX_ st, SvRV_const(thing), recurse);
545 st->total_size += SvLEN(thing);
547 st->total_size += SvIVX(thing);
550 /* A scalar/string/reference with a float part? */
552 st->total_size += sizeof(XPVNV);
553 if(recurse && SvROK(thing))
554 sv_size(aTHX_ st, SvRV_const(thing), recurse);
556 st->total_size += SvLEN(thing);
559 st->total_size += sizeof(XPVMG);
560 if(recurse && SvROK(thing))
561 sv_size(aTHX_ st, SvRV_const(thing), recurse);
563 st->total_size += SvLEN(thing);
564 magic_size(thing, st);
566 #if PERL_VERSION <= 8
568 st->total_size += sizeof(XPVBM);
569 if(recurse && SvROK(thing))
570 sv_size(aTHX_ st, SvRV_const(thing), recurse);
572 st->total_size += SvLEN(thing);
573 magic_size(thing, st);
577 st->total_size += sizeof(XPVLV);
578 if(recurse && SvROK(thing))
579 sv_size(aTHX_ st, SvRV_const(thing), recurse);
581 st->total_size += SvLEN(thing);
582 magic_size(thing, st);
584 /* How much space is dedicated to the array? Not counting the
585 elements in the array, mind, just the array itself */
587 st->total_size += sizeof(XPVAV);
588 /* Is there anything in the array? */
589 if (AvMAX(thing) != -1) {
590 /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
591 st->total_size += sizeof(SV *) * (AvMAX(thing) + 1);
592 dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", st->total_size, AvMAX(thing), av_len((AV*)thing)));
594 if (recurse >= TOTAL_SIZE_RECURSION) {
595 SSize_t i = AvFILLp(thing) + 1;
598 sv_size(aTHX_ st, AvARRAY(thing)[i], recurse);
601 /* Add in the bits on the other side of the beginning */
603 dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n",
604 st->total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));
606 /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
607 resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
608 if (AvALLOC(thing) != 0) {
609 st->total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
611 #if (PERL_VERSION < 9)
612 /* Is there something hanging off the arylen element?
613 Post 5.9.something this is stored in magic, so will be found there,
614 and Perl_av_arylen_p() takes a non-const AV*, hence compilers rightly
615 complain about AvARYLEN() passing thing to it. */
616 sv_size(aTHX_ st, AvARYLEN(thing), recurse);
618 magic_size(thing, st);
621 /* First the base struct */
622 st->total_size += sizeof(XPVHV);
623 /* Now the array of buckets */
624 st->total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
625 /* Now walk the bucket chain */
626 if (HvARRAY(thing)) {
629 for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
630 cur_entry = *(HvARRAY(thing) + cur_bucket);
632 st->total_size += sizeof(HE);
633 if (cur_entry->hent_hek) {
634 /* Hash keys can be shared. Have we seen this before? */
635 if (check_new(st, cur_entry->hent_hek)) {
636 st->total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
639 if (recurse >= TOTAL_SIZE_RECURSION)
640 sv_size(aTHX_ st, HeVAL(cur_entry), recurse);
641 cur_entry = cur_entry->hent_next;
645 magic_size(thing, st);
648 st->total_size += sizeof(XPVCV);
649 magic_size(thing, st);
651 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
652 sv_size(aTHX_ st, (SV *)CvSTASH(thing), SOME_RECURSION);
653 sv_size(aTHX_ st, (SV *)SvSTASH(thing), SOME_RECURSION);
654 sv_size(aTHX_ st, (SV *)CvGV(thing), SOME_RECURSION);
655 sv_size(aTHX_ st, (SV *)CvPADLIST(thing), SOME_RECURSION);
656 sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), recurse);
657 if (CvISXSUB(thing)) {
658 sv_size(aTHX_ st, cv_const_sv((CV *)thing), recurse);
660 op_size(aTHX_ CvSTART(thing), st);
661 op_size(aTHX_ CvROOT(thing), st);
666 magic_size(thing, st);
667 st->total_size += sizeof(XPVGV);
668 if(isGV_with_GP(thing)) {
669 st->total_size += GvNAMELEN(thing);
671 /* Is there a file? */
672 check_new_and_strlen(st, GvFILE(thing));
674 /* Is there something hanging off the glob? */
675 if (check_new(st, GvGP(thing))) {
676 st->total_size += sizeof(GP);
677 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_sv), recurse);
678 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_form), recurse);
679 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_av), recurse);
680 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_hv), recurse);
681 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_egv), recurse);
682 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_cv), recurse);
687 st->total_size += sizeof(XPVFM);
688 magic_size(thing, st);
689 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
690 sv_size(aTHX_ st, (SV *)CvPADLIST(thing), SOME_RECURSION);
691 sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), recurse);
693 if (st->go_yell && !st->fm_whine) {
694 carp("Devel::Size: Calculated sizes for FMs are incomplete");
699 st->total_size += sizeof(XPVIO);
700 magic_size(thing, st);
701 if (check_new(st, (SvPVX_const(thing)))) {
702 st->total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
704 /* Some embedded char pointers */
705 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_top_name);
706 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_fmt_name);
707 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_bottom_name);
708 /* Throw the GVs on the list to be walked if they're not-null */
709 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, recurse);
710 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, recurse);
711 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, recurse);
713 /* Only go trotting through the IO structures if they're really
714 trottable. If USE_PERLIO is defined we can do this. If
715 not... we can't, so we don't even try */
717 /* Dig into xio_ifp and xio_ofp here */
718 warn("Devel::Size: Can't size up perlio layers yet\n");
722 warn("Devel::Size: Unknown variable type: %d encountered\n", SvTYPE(thing) );
727 static struct state *
732 Newxz(st, 1, struct state);
734 if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
735 st->dangle_whine = st->go_yell = SvIV(warn_flag) ? TRUE : FALSE;
737 if (NULL != (warn_flag = perl_get_sv("Devel::Size::dangle", FALSE))) {
738 st->dangle_whine = SvIV(warn_flag) ? TRUE : FALSE;
740 check_new(st, &PL_sv_undef);
741 check_new(st, &PL_sv_no);
742 check_new(st, &PL_sv_yes);
746 MODULE = Devel::Size PACKAGE = Devel::Size
755 SV *thing = orig_thing;
756 struct state *st = new_state(aTHX);
758 /* If they passed us a reference then dereference it. This is the
759 only way we can check the sizes of arrays and hashes */
760 #if (PERL_VERSION < 11)
761 if (SvOK(thing) && SvROK(thing)) {
770 sv_size(aTHX_ st, thing, NO_RECURSION);
771 RETVAL = st->total_size;
779 total_size(orig_thing)
783 SV *thing = orig_thing;
784 /* Array with things we still need to do */
787 struct state *st = new_state(aTHX);
789 /* Size starts at zero */
792 pending_array = newAV();
794 /* If they passed us a reference then dereference it.
795 This is the only way we can check the sizes of arrays and hashes. */
800 /* Put it on the pending array */
801 av_push(pending_array, thing);
803 /* Now just yank things off the end of the array until it's done */
804 while (av_len(pending_array) >= 0) {
805 thing = av_pop(pending_array);
806 /* Process it if we've not seen it */
807 if (sv_size(aTHX_ st, thing, TOTAL_SIZE_RECURSION)) {
808 dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
809 switch (SvTYPE(thing)) {
810 /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
814 av_push(pending_array, SvRV(thing));
817 #if (PERL_VERSION < 11)
822 dbg_printf(("# Found RV\n"));
824 dbg_printf(("# Found RV\n"));
825 av_push(pending_array, SvRV(thing));
833 /* check_new() returned false: */
834 #ifdef DEVEL_SIZE_DEBUGGING
835 if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
836 else printf("# Ignore non-sv 0x%x\n", sv);
841 RETVAL = st->total_size;
843 SvREFCNT_dec(pending_array);