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 static bool sv_size(pTHX_ struct state *, const SV *const, bool recurse);
181 cc_opclass(const OP * const o)
187 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
189 if (o->op_type == OP_SASSIGN)
190 return ((o->op_private & OPpASSIGN_BACKWARDS) ? OPc_UNOP : OPc_BINOP);
193 if (o->op_type == OP_GV || o->op_type == OP_GVSV || o->op_type == OP_AELEMFAST)
197 if ((o->op_type == OP_TRANS)) {
201 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
226 case OA_PVOP_OR_SVOP: TAG;
228 * Character translations (tr///) are usually a PVOP, keeping a
229 * pointer to a table of shorts used to look up translations.
230 * Under utf8, however, a simple table isn't practical; instead,
231 * the OP is an SVOP, and the SV is a reference to a swash
232 * (i.e., an RV pointing to an HV).
234 return (o->op_private & (OPpTRANS_TO_UTF|OPpTRANS_FROM_UTF))
235 ? OPc_SVOP : OPc_PVOP;
243 case OA_BASEOP_OR_UNOP: TAG;
245 * UNI(OP_foo) in toke.c returns token UNI or FUNC1 depending on
246 * whether parens were seen. perly.y uses OPf_SPECIAL to
247 * signal whether a BASEOP had empty parens or none.
248 * Some other UNOPs are created later, though, so the best
249 * test is OPf_KIDS, which is set in newUNOP.
251 return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP;
253 case OA_FILESTATOP: TAG;
255 * The file stat OPs are created via UNI(OP_foo) in toke.c but use
256 * the OPf_REF flag to distinguish between OP types instead of the
257 * usual OPf_SPECIAL flag. As usual, if OPf_KIDS is set, then we
258 * return OPc_UNOP so that walkoptree can find our children. If
259 * OPf_KIDS is not set then we check OPf_REF. Without OPf_REF set
260 * (no argument to the operator) it's an OP; with OPf_REF set it's
261 * an SVOP (and op_sv is the GV for the filehandle argument).
263 return ((o->op_flags & OPf_KIDS) ? OPc_UNOP :
265 (o->op_flags & OPf_REF) ? OPc_PADOP : OPc_BASEOP);
267 (o->op_flags & OPf_REF) ? OPc_SVOP : OPc_BASEOP);
269 case OA_LOOPEXOP: TAG;
271 * next, last, redo, dump and goto use OPf_SPECIAL to indicate that a
272 * label was omitted (in which case it's a BASEOP) or else a term was
273 * seen. In this last case, all except goto are definitely PVOP but
274 * goto is either a PVOP (with an ordinary constant label), an UNOP
275 * with OPf_STACKED (with a non-constant non-sub) or an UNOP for
276 * OP_REFGEN (with goto &sub) in which case OPf_STACKED also seems to
279 if (o->op_flags & OPf_STACKED)
281 else if (o->op_flags & OPf_SPECIAL)
286 warn("Devel::Size: Can't determine class of operator %s, assuming BASEOP\n",
287 PL_op_name[o->op_type]);
298 /* Figure out how much magic is attached to the SV and return the
301 magic_size(const SV * const thing, struct state *st) {
302 MAGIC *magic_pointer;
305 if (!SvMAGIC(thing)) {
310 /* Get the base magic pointer */
311 magic_pointer = SvMAGIC(thing);
313 /* Have we seen the magic pointer? */
314 while (check_new(st, magic_pointer)) {
315 st->total_size += sizeof(MAGIC);
318 /* Have we seen the magic vtable? */
319 if (check_new(st, magic_pointer->mg_virtual)) {
320 st->total_size += sizeof(MGVTBL);
323 /* Get the next in the chain */
324 magic_pointer = magic_pointer->mg_moremagic;
327 if (st->dangle_whine)
328 warn( "Devel::Size: Encountered bad magic at: %p\n", magic_pointer );
334 check_new_and_strlen(struct state *st, const char *const p) {
336 st->total_size += 1 + strlen(p);
340 regex_size(const REGEXP * const baseregex, struct state *st) {
341 if(!check_new(st, baseregex))
343 st->total_size += sizeof(REGEXP);
344 #if (PERL_VERSION < 11)
345 /* Note the size of the paren offset thing */
346 st->total_size += sizeof(I32) * baseregex->nparens * 2;
347 st->total_size += strlen(baseregex->precomp);
349 st->total_size += sizeof(struct regexp);
350 st->total_size += sizeof(I32) * SvANY(baseregex)->nparens * 2;
351 /*st->total_size += strlen(SvANY(baseregex)->subbeg);*/
353 if (st->go_yell && !st->regex_whine) {
354 carp("Devel::Size: Calculated sizes for compiled regexes are incompatible, and probably always will be");
360 op_size(pTHX_ const OP * const baseop, struct state *st)
364 if(!check_new(st, baseop))
367 op_size(aTHX_ baseop->op_next, st);
369 switch (cc_opclass(baseop)) {
370 case OPc_BASEOP: TAG;
371 st->total_size += sizeof(struct op);
374 st->total_size += sizeof(struct unop);
375 op_size(aTHX_ cUNOPx(baseop)->op_first, st);
378 st->total_size += sizeof(struct binop);
379 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
380 op_size(aTHX_ cBINOPx(baseop)->op_last, st);
383 st->total_size += sizeof(struct logop);
384 op_size(aTHX_ cBINOPx(baseop)->op_first, st);
385 op_size(aTHX_ cLOGOPx(baseop)->op_other, st);
387 case OPc_LISTOP: TAG;
388 st->total_size += sizeof(struct listop);
389 op_size(aTHX_ cLISTOPx(baseop)->op_first, st);
390 op_size(aTHX_ cLISTOPx(baseop)->op_last, st);
393 st->total_size += sizeof(struct pmop);
394 op_size(aTHX_ cPMOPx(baseop)->op_first, st);
395 op_size(aTHX_ cPMOPx(baseop)->op_last, st);
396 #if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
397 op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, st);
398 op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, st);
399 op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, st);
401 /* This is defined away in perl 5.8.x, but it is in there for
404 regex_size(PM_GETRE(cPMOPx(baseop)), st);
406 regex_size(cPMOPx(baseop)->op_pmregexp, st);
410 st->total_size += sizeof(struct pmop);
411 sv_size(aTHX_ st, cSVOPx(baseop)->op_sv, TRUE);
414 st->total_size += sizeof(struct padop);
417 check_new_and_strlen(st, 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 check_new_and_strlen(st, basecop->cop_label);
443 check_new_and_strlen(st, basecop->cop_file);
444 check_new_and_strlen(st, basecop->cop_stashpv);
446 sv_size(aTHX_ st, (SV *)basecop->cop_stash, TRUE);
447 sv_size(aTHX_ st, (SV *)basecop->cop_filegv, TRUE);
457 if (st->dangle_whine)
458 warn( "Devel::Size: Encountered dangling pointer in opcode at: %p\n", baseop );
462 #if PERL_VERSION > 9 || (PERL_VERSION == 9 && PERL_SUBVERSION > 2)
463 # define NEW_HEAD_LAYOUT
467 sv_size(pTHX_ struct state *const st, const SV * const orig_thing,
468 const bool recurse) {
469 const SV *thing = orig_thing;
471 if(!check_new(st, thing))
474 st->total_size += sizeof(SV);
476 switch (SvTYPE(thing)) {
480 /* Just a plain integer. This will be differently sized depending
481 on whether purify's been compiled in */
483 #ifndef NEW_HEAD_LAYOUT
485 st->total_size += sizeof(sizeof(XPVIV));
487 st->total_size += sizeof(IV);
490 if(recurse && SvROK(thing))
491 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
493 /* Is it a float? Like the int, it depends on purify */
496 st->total_size += sizeof(sizeof(XPVNV));
498 st->total_size += sizeof(NV);
501 #if (PERL_VERSION < 11)
502 /* Is it a reference? */
504 #ifndef NEW_HEAD_LAYOUT
505 st->total_size += sizeof(XRV);
507 if(recurse && SvROK(thing))
508 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
511 /* How about a plain string? In which case we need to add in how
512 much has been allocated */
514 st->total_size += sizeof(XPV);
515 if(recurse && SvROK(thing))
516 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
518 st->total_size += SvLEN(thing);
520 /* A string with an integer part? */
522 st->total_size += sizeof(XPVIV);
523 if(recurse && SvROK(thing))
524 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
526 st->total_size += SvLEN(thing);
528 st->total_size += SvIVX(thing);
531 /* A scalar/string/reference with a float part? */
533 st->total_size += sizeof(XPVNV);
534 if(recurse && SvROK(thing))
535 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
537 st->total_size += SvLEN(thing);
540 st->total_size += sizeof(XPVMG);
541 if(recurse && SvROK(thing))
542 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
544 st->total_size += SvLEN(thing);
545 magic_size(thing, st);
547 #if PERL_VERSION <= 8
549 st->total_size += sizeof(XPVBM);
550 if(recurse && SvROK(thing))
551 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
553 st->total_size += SvLEN(thing);
554 magic_size(thing, st);
558 st->total_size += sizeof(XPVLV);
559 if(recurse && SvROK(thing))
560 sv_size(aTHX_ st, SvRV_const(thing), TRUE);
562 st->total_size += SvLEN(thing);
563 magic_size(thing, st);
565 /* How much space is dedicated to the array? Not counting the
566 elements in the array, mind, just the array itself */
568 st->total_size += sizeof(XPVAV);
569 /* Is there anything in the array? */
570 if (AvMAX(thing) != -1) {
571 /* an array with 10 slots has AvMax() set to 9 - te 2007-04-22 */
572 st->total_size += sizeof(SV *) * (AvMAX(thing) + 1);
573 dbg_printf(("total_size: %li AvMAX: %li av_len: $i\n", st->total_size, AvMAX(thing), av_len((AV*)thing)));
575 /* Add in the bits on the other side of the beginning */
577 dbg_printf(("total_size %li, sizeof(SV *) %li, AvARRAY(thing) %li, AvALLOC(thing)%li , sizeof(ptr) %li \n",
578 st->total_size, sizeof(SV*), AvARRAY(thing), AvALLOC(thing), sizeof( thing )));
580 /* under Perl 5.8.8 64bit threading, AvARRAY(thing) was a pointer while AvALLOC was 0,
581 resulting in grossly overstated sized for arrays. Technically, this shouldn't happen... */
582 if (AvALLOC(thing) != 0) {
583 st->total_size += (sizeof(SV *) * (AvARRAY(thing) - AvALLOC(thing)));
585 #if (PERL_VERSION < 9)
586 /* Is there something hanging off the arylen element?
587 Post 5.9.something this is stored in magic, so will be found there,
588 and Perl_av_arylen_p() takes a non-const AV*, hence compilers rightly
589 complain about AvARYLEN() passing thing to it. */
590 sv_size(aTHX_ st, AvARYLEN(thing), TRUE);
592 magic_size(thing, st);
595 /* First the base struct */
596 st->total_size += sizeof(XPVHV);
597 /* Now the array of buckets */
598 st->total_size += (sizeof(HE *) * (HvMAX(thing) + 1));
599 /* Now walk the bucket chain */
600 if (HvARRAY(thing)) {
603 for (cur_bucket = 0; cur_bucket <= HvMAX(thing); cur_bucket++) {
604 cur_entry = *(HvARRAY(thing) + cur_bucket);
606 st->total_size += sizeof(HE);
607 if (cur_entry->hent_hek) {
608 /* Hash keys can be shared. Have we seen this before? */
609 if (check_new(st, cur_entry->hent_hek)) {
610 st->total_size += HEK_BASESIZE + cur_entry->hent_hek->hek_len + 2;
613 cur_entry = cur_entry->hent_next;
617 magic_size(thing, st);
620 st->total_size += sizeof(XPVCV);
621 magic_size(thing, st);
623 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
624 sv_size(aTHX_ st, (SV *)CvSTASH(thing), TRUE);
625 sv_size(aTHX_ st, (SV *)SvSTASH(thing), TRUE);
626 sv_size(aTHX_ st, (SV *)CvGV(thing), TRUE);
627 sv_size(aTHX_ st, (SV *)CvPADLIST(thing), TRUE);
628 sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), TRUE);
629 if (CvISXSUB(thing)) {
630 sv_size(aTHX_ st, cv_const_sv((CV *)thing), TRUE);
632 op_size(aTHX_ CvSTART(thing), st);
633 op_size(aTHX_ CvROOT(thing), st);
638 magic_size(thing, st);
639 st->total_size += sizeof(XPVGV);
640 st->total_size += GvNAMELEN(thing);
642 /* Is there a file? */
643 check_new_and_strlen(st, GvFILE(thing));
645 /* Is there something hanging off the glob? */
647 if (check_new(st, GvGP(thing))) {
648 st->total_size += sizeof(GP);
649 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_sv), TRUE);
650 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_form), TRUE);
651 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_av), TRUE);
652 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_hv), TRUE);
653 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_egv), TRUE);
654 sv_size(aTHX_ st, (SV *)(GvGP(thing)->gp_cv), TRUE);
659 st->total_size += sizeof(XPVFM);
660 magic_size(thing, st);
661 st->total_size += ((XPVIO *) SvANY(thing))->xpv_len;
662 sv_size(aTHX_ st, (SV *)CvPADLIST(thing), TRUE);
663 sv_size(aTHX_ st, (SV *)CvOUTSIDE(thing), TRUE);
665 if (st->go_yell && !st->fm_whine) {
666 carp("Devel::Size: Calculated sizes for FMs are incomplete");
671 st->total_size += sizeof(XPVIO);
672 magic_size(thing, st);
673 if (check_new(st, (SvPVX_const(thing)))) {
674 st->total_size += ((XPVIO *) SvANY(thing))->xpv_cur;
676 /* Some embedded char pointers */
677 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_top_name);
678 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_fmt_name);
679 check_new_and_strlen(st, ((XPVIO *) SvANY(thing))->xio_bottom_name);
680 /* Throw the GVs on the list to be walked if they're not-null */
681 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_top_gv, TRUE);
682 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv, TRUE);
683 sv_size(aTHX_ st, (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv, TRUE);
685 /* Only go trotting through the IO structures if they're really
686 trottable. If USE_PERLIO is defined we can do this. If
687 not... we can't, so we don't even try */
689 /* Dig into xio_ifp and xio_ofp here */
690 warn("Devel::Size: Can't size up perlio layers yet\n");
694 warn("Devel::Size: Unknown variable type: %d encountered\n", SvTYPE(thing) );
699 static struct state *
704 Newxz(st, 1, struct state);
706 if (NULL != (warn_flag = perl_get_sv("Devel::Size::warn", FALSE))) {
707 st->dangle_whine = st->go_yell = SvIV(warn_flag) ? TRUE : FALSE;
709 if (NULL != (warn_flag = perl_get_sv("Devel::Size::dangle", FALSE))) {
710 st->dangle_whine = SvIV(warn_flag) ? TRUE : FALSE;
712 check_new(st, &PL_sv_undef);
713 check_new(st, &PL_sv_no);
714 check_new(st, &PL_sv_yes);
718 MODULE = Devel::Size PACKAGE = Devel::Size
727 SV *thing = orig_thing;
728 struct state *st = new_state(aTHX);
730 /* If they passed us a reference then dereference it. This is the
731 only way we can check the sizes of arrays and hashes */
732 #if (PERL_VERSION < 11)
733 if (SvOK(thing) && SvROK(thing)) {
742 sv_size(aTHX_ st, thing, FALSE);
743 RETVAL = st->total_size;
751 total_size(orig_thing)
755 SV *thing = orig_thing;
756 /* Array with things we still need to do */
759 struct state *st = new_state(aTHX);
761 /* Size starts at zero */
764 pending_array = newAV();
766 /* If they passed us a reference then dereference it.
767 This is the only way we can check the sizes of arrays and hashes. */
772 /* Put it on the pending array */
773 av_push(pending_array, thing);
775 /* Now just yank things off the end of the array until it's done */
776 while (av_len(pending_array) >= 0) {
777 thing = av_pop(pending_array);
778 /* Process it if we've not seen it */
779 if (sv_size(aTHX_ st, thing, TRUE)) {
780 dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
781 switch (SvTYPE(thing)) {
782 /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
786 av_push(pending_array, SvRV(thing));
789 #if (PERL_VERSION < 11)
794 dbg_printf(("# Found RV\n"));
796 dbg_printf(("# Found RV\n"));
797 av_push(pending_array, SvRV(thing));
803 AV *tempAV = (AV *)thing;
806 dbg_printf(("# Found type AV\n"));
807 /* Quick alias to cut down on casting */
810 if (av_len(tempAV) != -1) {
812 /* Run through them all */
813 for (index = 0; index <= av_len(tempAV); index++) {
814 /* Did we get something? */
815 if ((tempSV = av_fetch(tempAV, index, 0))) {
817 if (*tempSV != &PL_sv_undef) {
818 /* Apparently not. Save it for later */
819 av_push(pending_array, *tempSV);
828 dbg_printf(("# Found type HV\n"));
829 /* Is there anything in here? */
830 if (hv_iterinit((HV *)thing)) {
832 while ((temp_he = hv_iternext((HV *)thing))) {
833 av_push(pending_array, hv_iterval((HV *)thing, temp_he));
839 dbg_printf(("# Found type GV\n"));
840 /* Run through all the pieces and push the ones with bits */
842 av_push(pending_array, (SV *)GvSV(thing));
845 av_push(pending_array, (SV *)GvFORM(thing));
848 av_push(pending_array, (SV *)GvAV(thing));
851 av_push(pending_array, (SV *)GvHV(thing));
854 av_push(pending_array, (SV *)GvCV(thing));
861 /* check_new() returned false: */
862 #ifdef DEVEL_SIZE_DEBUGGING
863 if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
864 else printf("# Ignore non-sv 0x%x\n", sv);
869 RETVAL = st->total_size;
871 SvREFCNT_dec(pending_array);