1 /* This file is part of the autovivification Perl module.
2 * See http://search.cpan.org/dist/autovivification/ */
4 #define PERL_NO_GET_CONTEXT
9 #define __PACKAGE__ "autovivification"
10 #define __PACKAGE_LEN__ (sizeof(__PACKAGE__)-1)
12 /* --- Compatibility wrappers ---------------------------------------------- */
15 # define HvNAME_get(H) HvNAME(H)
19 # define HvNAMELEN_get(H) strlen(HvNAME_get(H))
22 #define A_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
24 #define A_HAS_PERL_EXACT(R, V, S) ((PERL_REVISION == (R)) && (PERL_VERSION == (V)) && (PERL_SUBVERSION == (S)))
27 #if defined(ENTER_with_name) && !A_HAS_PERL(5, 11, 4)
28 # define ENTERn(N) ENTER_with_name(N)
30 # define ENTERn(N) ENTER
34 #if defined(LEAVE_with_name) && !A_HAS_PERL(5, 11, 4)
35 # define LEAVEn(N) LEAVE_with_name(N)
37 # define LEAVEn(N) LEAVE
40 #ifndef A_WORKAROUND_REQUIRE_PROPAGATION
41 # define A_WORKAROUND_REQUIRE_PROPAGATION !A_HAS_PERL(5, 10, 1)
45 # define A_HAS_RPEEP A_HAS_PERL(5, 13, 5)
48 /* ... Thread safety and multiplicity ...................................... */
50 /* Always safe when the workaround isn't needed */
51 #if !A_WORKAROUND_REQUIRE_PROPAGATION
54 /* Otherwise, safe unless Makefile.PL says it's Win32 */
55 #elif !defined(A_FORKSAFE)
59 #ifndef A_MULTIPLICITY
60 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
61 # define A_MULTIPLICITY 1
63 # define A_MULTIPLICITY 0
68 # define tTHX PerlInterpreter*
71 #if A_MULTIPLICITY && defined(USE_ITHREADS) && defined(dMY_CXT) && defined(MY_CXT) && defined(START_MY_CXT) && defined(MY_CXT_INIT) && (defined(MY_CXT_CLONE) || defined(dMY_CXT_SV))
72 # define A_THREADSAFE 1
74 # define MY_CXT_CLONE \
76 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
77 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
78 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
81 # define A_THREADSAFE 0
83 # define dMY_CXT dNOOP
85 # define MY_CXT a_globaldata
87 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
89 # define MY_CXT_INIT NOOP
91 # define MY_CXT_CLONE NOOP
94 /* --- Helpers ------------------------------------------------------------- */
96 /* ... Thread-safe hints ................................................... */
98 #if A_WORKAROUND_REQUIRE_PROPAGATION
105 #define A_HINT_FREE(H) PerlMemShared_free(H)
109 #define PTABLE_NAME ptable_hints
110 #define PTABLE_VAL_FREE(V) A_HINT_FREE(V)
119 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
120 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
122 #endif /* A_THREADSAFE */
124 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
128 #define PTABLE_NAME ptable_seen
129 #define PTABLE_VAL_FREE(V) NOOP
133 #endif /* !A_HAS_RPEEP */
135 #define A_NEED_CXT ((A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION) || !A_HAS_RPEEP)
139 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
142 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
143 ptable *tbl; /* It really is a ptable_hints */
145 #endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
147 ptable *seen; /* It really is a ptable_seen */
148 #endif /* !A_HAS_RPEEP */
155 #if A_WORKAROUND_REQUIRE_PROPAGATION
159 #if A_HAS_PERL(5, 13, 2)
160 CLONE_PARAMS *params;
166 #if A_HAS_PERL(5, 13, 2)
167 # define a_ptable_clone_ud_init(U, T, O) \
169 (U).params = Perl_clone_params_new((O), aTHX)
170 # define a_ptable_clone_ud_deinit(U) Perl_clone_params_del((U).params)
171 # define a_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), (U)->params))
173 # define a_ptable_clone_ud_init(U, T, O) \
175 (U).params.stashes = newAV(); \
176 (U).params.flags = 0; \
177 (U).params.proto_perl = (O)
178 # define a_ptable_clone_ud_deinit(U) SvREFCNT_dec((U).params.stashes)
179 # define a_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), &((U)->params)))
182 STATIC void a_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
183 a_ptable_clone_ud *ud = ud_;
184 a_hint_t *h1 = ent->val;
187 h2 = PerlMemShared_malloc(sizeof *h2);
189 h2->require_tag = PTR2IV(a_dup_inc(INT2PTR(SV *, h1->require_tag), ud));
191 ptable_hints_store(ud->tbl, ent->key, h2);
194 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
198 STATIC void a_thread_cleanup(pTHX_ void *ud) {
201 #if A_WORKAROUND_REQUIRE_PROPAGATION
202 ptable_hints_free(MY_CXT.tbl);
203 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
205 ptable_seen_free(MY_CXT.seen);
206 #endif /* !A_HAS_RPEEP */
209 #endif /* A_THREADSAFE */
211 #endif /* A_NEED_CXT */
213 #if A_WORKAROUND_REQUIRE_PROPAGATION
215 STATIC IV a_require_tag(pTHX) {
216 #define a_require_tag() a_require_tag(aTHX)
217 const CV *cv, *outside;
222 /* If for some reason the pragma is operational at run-time, try to discover
223 * the current cv in use. */
226 for (si = PL_curstackinfo; si; si = si->si_prev) {
229 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
230 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
232 switch (CxTYPE(cx)) {
235 /* The propagation workaround is only needed up to 5.10.0 and at that
236 * time format and sub contexts were still identical. And even later the
237 * cv members offsets should have been kept the same. */
239 goto get_enclosing_cv;
241 cv = cx->blk_eval.cv;
242 goto get_enclosing_cv;
253 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
259 STATIC SV *a_tag(pTHX_ UV bits) {
260 #define a_tag(B) a_tag(aTHX_ (B))
266 h = PerlMemShared_malloc(sizeof *h);
268 h->require_tag = a_require_tag();
271 /* We only need for the key to be an unique tag for looking up the value later.
272 * Allocated memory provides convenient unique identifiers, so that's why we
273 * use the hint as the key itself. */
274 ptable_hints_store(MY_CXT.tbl, h, h);
275 #endif /* A_THREADSAFE */
277 return newSViv(PTR2IV(h));
280 STATIC UV a_detag(pTHX_ const SV *hint) {
281 #define a_detag(H) a_detag(aTHX_ (H))
287 if (!(hint && SvIOK(hint)))
290 h = INT2PTR(a_hint_t *, SvIVX(hint));
292 h = ptable_fetch(MY_CXT.tbl, h);
293 #endif /* A_THREADSAFE */
295 if (a_require_tag() != h->require_tag)
301 #else /* A_WORKAROUND_REQUIRE_PROPAGATION */
303 #define a_tag(B) newSVuv(B)
304 /* PVs fetched from the hints chain have their SvLEN set to zero, so get the UV
311 ? sv_2uv(SvLEN(H) ? (H) : sv_mortalcopy(H)) \
317 #endif /* !A_WORKAROUND_REQUIRE_PROPAGATION */
319 /* Used both for hints and op flags */
320 #define A_HINT_STRICT 1
321 #define A_HINT_WARN 2
322 #define A_HINT_FETCH 4
323 #define A_HINT_STORE 8
324 #define A_HINT_EXISTS 16
325 #define A_HINT_DELETE 32
326 #define A_HINT_NOTIFY (A_HINT_STRICT|A_HINT_WARN)
327 #define A_HINT_DO (A_HINT_FETCH|A_HINT_STORE|A_HINT_EXISTS|A_HINT_DELETE)
328 #define A_HINT_MASK (A_HINT_NOTIFY|A_HINT_DO)
330 /* Only used in op flags */
331 #define A_HINT_ROOT 64
332 #define A_HINT_DEREF 128
334 STATIC U32 a_hash = 0;
336 STATIC UV a_hint(pTHX) {
337 #define a_hint() a_hint(aTHX)
339 #ifdef cop_hints_fetch_pvn
340 hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__, a_hash, 0);
341 #elif A_HAS_PERL(5, 9, 5)
342 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
344 __PACKAGE__, __PACKAGE_LEN__,
348 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, a_hash);
353 return a_detag(hint);
356 /* ... op => info map ...................................................... */
364 #define PTABLE_NAME ptable_map
365 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
369 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
370 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
372 STATIC ptable *a_op_map = NULL;
376 #define dA_MAP_THX a_op_info a_op_map_tmp_oi
378 STATIC perl_mutex a_op_map_mutex;
380 #define A_LOCK(M) MUTEX_LOCK(M)
381 #define A_UNLOCK(M) MUTEX_UNLOCK(M)
383 STATIC const a_op_info *a_map_fetch(const OP *o, a_op_info *oi) {
384 const a_op_info *val;
386 A_LOCK(&a_op_map_mutex);
388 val = ptable_fetch(a_op_map, o);
394 A_UNLOCK(&a_op_map_mutex);
399 #define a_map_fetch(O) a_map_fetch((O), &a_op_map_tmp_oi)
401 #else /* USE_ITHREADS */
403 #define dA_MAP_THX dNOOP
405 #define A_LOCK(M) NOOP
406 #define A_UNLOCK(M) NOOP
408 #define a_map_fetch(O) ptable_fetch(a_op_map, (O))
410 #endif /* !USE_ITHREADS */
412 STATIC const a_op_info *a_map_store_locked(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
413 #define a_map_store_locked(O, PP, N, F) a_map_store_locked(aPTBLMS_ (O), (PP), (N), (F))
416 if (!(oi = ptable_fetch(a_op_map, o))) {
417 oi = PerlMemShared_malloc(sizeof *oi);
418 ptable_map_store(a_op_map, o, oi);
428 STATIC void a_map_store(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
429 #define a_map_store(O, PP, N, F) a_map_store(aPTBLMS_ (O), (PP), (N), (F))
430 A_LOCK(&a_op_map_mutex);
432 a_map_store_locked(o, old_pp, next, flags);
434 A_UNLOCK(&a_op_map_mutex);
437 STATIC void a_map_delete(pTHX_ const OP *o) {
438 #define a_map_delete(O) a_map_delete(aTHX_ (O))
439 A_LOCK(&a_op_map_mutex);
441 ptable_map_delete(a_op_map, o);
443 A_UNLOCK(&a_op_map_mutex);
446 STATIC const OP *a_map_descend(const OP *o) {
447 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
451 case OA_BASEOP_OR_UNOP:
452 return cUNOPo->op_first;
455 return cLISTOPo->op_last;
461 STATIC void a_map_store_root(pPTBLMS_ const OP *root, OP *(*old_pp)(pTHX), UV flags) {
462 #define a_map_store_root(R, PP, F) a_map_store_root(aPTBLMS_ (R), (PP), (F))
463 const a_op_info *roi;
467 A_LOCK(&a_op_map_mutex);
469 roi = a_map_store_locked(o, old_pp, (OP *) root, flags | A_HINT_ROOT);
471 while (o->op_flags & OPf_KIDS) {
472 o = a_map_descend(o);
475 if ((oi = ptable_fetch(a_op_map, o))) {
476 oi->flags &= ~A_HINT_ROOT;
477 oi->next = (a_op_info *) roi;
482 A_UNLOCK(&a_op_map_mutex);
487 STATIC void a_map_update_flags_topdown(const OP *root, UV flags) {
491 A_LOCK(&a_op_map_mutex);
493 flags &= ~A_HINT_ROOT;
496 if ((oi = ptable_fetch(a_op_map, o)))
497 oi->flags = (oi->flags & A_HINT_ROOT) | flags;
498 if (!(o->op_flags & OPf_KIDS))
500 o = a_map_descend(o);
503 A_UNLOCK(&a_op_map_mutex);
508 #define a_map_cancel(R) a_map_update_flags_topdown((R), 0)
510 STATIC void a_map_update_flags_bottomup(const OP *o, UV flags, UV rflags) {
513 A_LOCK(&a_op_map_mutex);
515 flags &= ~A_HINT_ROOT;
516 rflags |= A_HINT_ROOT;
518 oi = ptable_fetch(a_op_map, o);
519 while (!(oi->flags & A_HINT_ROOT)) {
525 A_UNLOCK(&a_op_map_mutex);
530 /* ... Decide whether this expression should be autovivified or not ........ */
532 STATIC UV a_map_resolve(const OP *o, const a_op_info *oi) {
533 UV flags = 0, rflags;
535 const a_op_info *roi = oi;
537 while (!(roi->flags & A_HINT_ROOT))
542 rflags = roi->flags & ~A_HINT_ROOT;
547 if (root->op_flags & OPf_MOD) {
548 if (rflags & A_HINT_STORE)
549 flags = (A_HINT_STORE|A_HINT_DEREF);
550 } else if (rflags & A_HINT_FETCH)
551 flags = (A_HINT_FETCH|A_HINT_DEREF);
555 a_map_update_flags_bottomup(o, 0, 0);
559 flags |= (rflags & A_HINT_NOTIFY);
560 a_map_update_flags_bottomup(o, flags, 0);
562 return oi->flags & A_HINT_ROOT ? 0 : flags;
565 /* ... Inspired from pp_defined() .......................................... */
567 STATIC int a_undef(pTHX_ SV *sv) {
568 #define a_undef(S) a_undef(aTHX_ (S))
569 switch (SvTYPE(sv)) {
573 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv)
574 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
578 if (HvARRAY(sv) || SvGMAGICAL(sv)
579 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
591 /* --- PP functions -------------------------------------------------------- */
593 /* Be aware that we restore PL_op->op_ppaddr from the pointer table old_pp
594 * value, another extension might have saved our pp replacement as the ppaddr
595 * for this op, so this doesn't ensure that our function will never be called
596 * again. That's why we don't remove the op info from our map, so that it can
597 * still run correctly if required. */
599 /* ... pp_rv2av ............................................................ */
601 STATIC OP *a_pp_rv2av(pTHX) {
606 oi = a_map_fetch(PL_op);
608 if (oi->flags & A_HINT_DEREF) {
610 /* We always need to push an empty array to fool the pp_aelem() that comes
614 av = sv_2mortal((SV *) newAV());
619 PL_op->op_ppaddr = oi->old_pp;
622 return oi->old_pp(aTHX);
625 /* ... pp_rv2hv ............................................................ */
627 STATIC OP *a_pp_rv2hv_simple(pTHX) {
632 oi = a_map_fetch(PL_op);
634 if (oi->flags & A_HINT_DEREF) {
638 PL_op->op_ppaddr = oi->old_pp;
641 return oi->old_pp(aTHX);
644 STATIC OP *a_pp_rv2hv(pTHX) {
649 oi = a_map_fetch(PL_op);
651 if (oi->flags & A_HINT_DEREF) {
655 hv = sv_2mortal((SV *) newHV());
660 PL_op->op_ppaddr = oi->old_pp;
663 return oi->old_pp(aTHX);
666 /* ... pp_deref (aelem,helem,rv2sv,padsv) .................................. */
668 STATIC OP *a_pp_deref(pTHX) {
674 oi = a_map_fetch(PL_op);
677 if (flags & A_HINT_DEREF) {
682 old_private = PL_op->op_private;
683 PL_op->op_private = ((old_private & ~OPpDEREF) | OPpLVAL_DEFER);
684 o = oi->old_pp(aTHX);
685 PL_op->op_private = old_private;
687 if (flags & (A_HINT_NOTIFY|A_HINT_STORE)) {
690 if (flags & A_HINT_STRICT)
691 croak("Reference vivification forbidden");
692 else if (flags & A_HINT_WARN)
693 warn("Reference was vivified");
694 else /* A_HINT_STORE */
695 croak("Can't vivify reference");
700 } else if ((flags & ~A_HINT_ROOT)
701 && (PL_op->op_private & OPpDEREF || flags & A_HINT_ROOT)) {
702 /* Decide if the expression must autovivify or not.
703 * This branch should be called only once by expression. */
704 flags = a_map_resolve(PL_op, oi);
706 /* We need the updated flags value in the deref branch. */
707 if (flags & A_HINT_DEREF)
711 /* This op doesn't need to skip autovivification, so restore the original
713 PL_op->op_ppaddr = oi->old_pp;
715 return oi->old_pp(aTHX);
718 /* ... pp_root (exists,delete,keys,values) ................................. */
720 STATIC OP *a_pp_root_unop(pTHX) {
725 /* Can only be reached by keys or values */
726 if (GIMME_V == G_SCALAR) {
735 const a_op_info *oi = a_map_fetch(PL_op);
736 return oi->old_pp(aTHX);
740 STATIC OP *a_pp_root_binop(pTHX) {
743 if (a_undef(TOPm1s)) {
746 if (PL_op->op_type == OP_EXISTS)
754 const a_op_info *oi = a_map_fetch(PL_op);
755 return oi->old_pp(aTHX);
759 /* --- Check functions ----------------------------------------------------- */
761 STATIC void a_recheck_rv2xv(pTHX_ OP *o, OPCODE type, OP *(*new_pp)(pTHX)) {
762 #define a_recheck_rv2xv(O, T, PP) a_recheck_rv2xv(aTHX_ (O), (T), (PP))
764 if (o->op_type == type && o->op_ppaddr != new_pp
765 && cUNOPo->op_first->op_type != OP_GV) {
767 const a_op_info *oi = a_map_fetch(o);
769 a_map_store(o, o->op_ppaddr, oi->next, oi->flags);
770 o->op_ppaddr = new_pp;
777 /* ... ck_pad{any,sv} ...................................................... */
779 /* Sadly, the padsv OPs we are interested in don't trigger the padsv check
780 * function, but are instead manually mutated from a padany. So we store
781 * the op entry in the op map in the padany check function, and we set their
782 * op_ppaddr member in our peephole optimizer replacement below. */
784 STATIC OP *(*a_old_ck_padany)(pTHX_ OP *) = 0;
786 STATIC OP *a_ck_padany(pTHX_ OP *o) {
789 o = a_old_ck_padany(aTHX_ o);
792 if (hint & A_HINT_DO)
793 a_map_store_root(o, o->op_ppaddr, hint);
800 STATIC OP *(*a_old_ck_padsv)(pTHX_ OP *) = 0;
802 STATIC OP *a_ck_padsv(pTHX_ OP *o) {
805 o = a_old_ck_padsv(aTHX_ o);
808 if (hint & A_HINT_DO) {
809 a_map_store_root(o, o->op_ppaddr, hint);
810 o->op_ppaddr = a_pp_deref;
817 /* ... ck_deref (aelem,helem,rv2sv) ........................................ */
819 /* Those ops appear both at the root and inside an expression but there's no
820 * way to distinguish both situations. Worse, we can't even know if we are in a
821 * modifying context, so the expression can't be resolved yet. It will be at the
822 * first invocation of a_pp_deref() for this expression. */
824 STATIC OP *(*a_old_ck_aelem)(pTHX_ OP *) = 0;
825 STATIC OP *(*a_old_ck_helem)(pTHX_ OP *) = 0;
826 STATIC OP *(*a_old_ck_rv2sv)(pTHX_ OP *) = 0;
828 STATIC OP *a_ck_deref(pTHX_ OP *o) {
829 OP * (*old_ck)(pTHX_ OP *o) = 0;
832 switch (o->op_type) {
834 old_ck = a_old_ck_aelem;
835 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
836 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2AV, a_pp_rv2av);
839 old_ck = a_old_ck_helem;
840 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
841 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2HV, a_pp_rv2hv_simple);
844 old_ck = a_old_ck_rv2sv;
849 if (hint & A_HINT_DO) {
850 a_map_store_root(o, o->op_ppaddr, hint);
851 o->op_ppaddr = a_pp_deref;
858 /* ... ck_rv2xv (rv2av,rv2hv) .............................................. */
860 /* Those ops also appear both inisde and at the root, hence the caveats for
861 * a_ck_deref() still apply here. Since a padsv/rv2sv must appear before a
862 * rv2[ah]v, resolution is handled by the first call to a_pp_deref() in the
865 STATIC OP *(*a_old_ck_rv2av)(pTHX_ OP *) = 0;
866 STATIC OP *(*a_old_ck_rv2hv)(pTHX_ OP *) = 0;
868 STATIC OP *a_ck_rv2xv(pTHX_ OP *o) {
869 OP * (*old_ck)(pTHX_ OP *o) = 0;
870 OP * (*new_pp)(pTHX) = 0;
873 switch (o->op_type) {
874 case OP_RV2AV: old_ck = a_old_ck_rv2av; new_pp = a_pp_rv2av; break;
875 case OP_RV2HV: old_ck = a_old_ck_rv2hv; new_pp = a_pp_rv2hv_simple; break;
879 if (cUNOPo->op_first->op_type == OP_GV)
883 if (hint & A_HINT_DO && !(hint & A_HINT_STRICT)) {
884 a_map_store_root(o, o->op_ppaddr, hint);
885 o->op_ppaddr = new_pp;
892 /* ... ck_xslice (aslice,hslice) ........................................... */
894 /* I think those are only found at the root, but there's nothing that really
895 * prevent them to be inside the expression too. We only need to update the
896 * root so that the rest of the expression will see the right context when
897 * resolving. That's why we don't replace the ppaddr. */
899 STATIC OP *(*a_old_ck_aslice)(pTHX_ OP *) = 0;
900 STATIC OP *(*a_old_ck_hslice)(pTHX_ OP *) = 0;
902 STATIC OP *a_ck_xslice(pTHX_ OP *o) {
903 OP * (*old_ck)(pTHX_ OP *o) = 0;
906 switch (o->op_type) {
908 old_ck = a_old_ck_aslice;
911 old_ck = a_old_ck_hslice;
912 if (hint & A_HINT_DO)
913 a_recheck_rv2xv(cUNOPo->op_first->op_sibling, OP_RV2HV, a_pp_rv2hv);
918 if (hint & A_HINT_DO) {
919 a_map_store_root(o, 0, hint);
926 /* ... ck_root (exists,delete,keys,values) ................................. */
928 /* Those ops are only found at the root of a dereferencing expression. We can
929 * then resolve at compile time if vivification must take place or not. */
931 STATIC OP *(*a_old_ck_exists)(pTHX_ OP *) = 0;
932 STATIC OP *(*a_old_ck_delete)(pTHX_ OP *) = 0;
933 STATIC OP *(*a_old_ck_keys) (pTHX_ OP *) = 0;
934 STATIC OP *(*a_old_ck_values)(pTHX_ OP *) = 0;
936 STATIC OP *a_ck_root(pTHX_ OP *o) {
937 OP * (*old_ck)(pTHX_ OP *o) = 0;
938 OP * (*new_pp)(pTHX) = 0;
939 bool enabled = FALSE;
942 switch (o->op_type) {
944 old_ck = a_old_ck_exists;
945 new_pp = a_pp_root_binop;
946 enabled = hint & A_HINT_EXISTS;
949 old_ck = a_old_ck_delete;
950 new_pp = a_pp_root_binop;
951 enabled = hint & A_HINT_DELETE;
954 old_ck = a_old_ck_keys;
955 new_pp = a_pp_root_unop;
956 enabled = hint & A_HINT_FETCH;
959 old_ck = a_old_ck_values;
960 new_pp = a_pp_root_unop;
961 enabled = hint & A_HINT_FETCH;
966 if (hint & A_HINT_DO) {
968 a_map_update_flags_topdown(o, hint | A_HINT_DEREF);
969 a_map_store_root(o, o->op_ppaddr, hint);
970 o->op_ppaddr = new_pp;
980 /* ... Our peephole optimizer .............................................. */
982 STATIC peep_t a_old_peep = 0; /* This is actually the rpeep past 5.13.5 */
985 # define A_PEEP_REC_PROTO STATIC void a_peep_rec(pTHX_ OP *o, ptable *seen)
986 #else /* !A_HAS_RPEEP */
987 # define A_PEEP_REC_PROTO STATIC void a_peep_rec(pTHX_ OP *o)
988 #endif /* A_HAS_RPEEP */
993 # define a_peep_rec(O) a_peep_rec(aTHX_ (O), seen)
994 #else /* !A_HAS_RPEEP */
995 # define a_peep_rec(O) a_peep_rec(aTHX_ (O))
996 #endif /* A_HAS_RPEEP */
1001 if (ptable_fetch(seen, o))
1005 for (; o; o = o->op_next) {
1007 ptable_seen_store(seen, o, o);
1009 switch (o->op_type) {
1011 if (o->op_ppaddr != a_pp_deref) {
1012 oi = a_map_fetch(o);
1013 if (oi && (oi->flags & A_HINT_DO)) {
1014 a_map_store(o, o->op_ppaddr, oi->next, oi->flags);
1015 o->op_ppaddr = a_pp_deref;
1028 # if A_HAS_PERL(5, 10, 0)
1033 a_peep_rec(cLOGOPo->op_other);
1037 a_peep_rec(cLOOPo->op_redoop);
1038 a_peep_rec(cLOOPo->op_nextop);
1039 a_peep_rec(cLOOPo->op_lastop);
1041 # if A_HAS_PERL(5, 9, 5)
1043 a_peep_rec(cPMOPo->op_pmstashstartu.op_pmreplstart);
1049 a_peep_rec(cPMOPo->op_pmreplstart);
1052 #endif /* !A_HAS_RPEEP */
1059 STATIC void a_peep(pTHX_ OP *o) {
1062 ptable *seen = MY_CXT.seen;
1064 ptable_seen_clear(seen);
1065 #endif /* !A_HAS_RPEEP */
1067 #if A_HAS_PERL_EXACT(5, 8, 2)
1068 /* 5.8.2's peephole optimizer has a naughty bug with stub ops coming from
1071 a_old_peep(aTHX_ o);
1073 a_old_peep(aTHX_ o);
1078 /* --- Interpreter setup/teardown ------------------------------------------ */
1080 STATIC U32 a_initialized = 0;
1082 STATIC void a_teardown(pTHX_ void *root) {
1095 # if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1096 ptable_hints_free(MY_CXT.tbl);
1097 # endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
1099 ptable_seen_free(MY_CXT.seen);
1100 # endif /* !A_HAS_RPEEP */
1102 #endif /* A_NEED_CXT */
1104 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_old_ck_padany);
1105 a_old_ck_padany = 0;
1106 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_old_ck_padsv);
1109 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_old_ck_aelem);
1111 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_old_ck_helem);
1113 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_old_ck_rv2sv);
1116 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_old_ck_rv2av);
1118 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_old_ck_rv2hv);
1121 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_old_ck_aslice);
1122 a_old_ck_aslice = 0;
1123 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_old_ck_hslice);
1124 a_old_ck_hslice = 0;
1126 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_old_ck_exists);
1127 a_old_ck_exists = 0;
1128 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_old_ck_delete);
1129 a_old_ck_delete = 0;
1130 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_old_ck_keys);
1132 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_old_ck_values);
1133 a_old_ck_values = 0;
1136 PL_rpeepp = a_old_peep;
1138 PL_peepp = a_old_peep;
1145 STATIC void a_setup(pTHX) {
1146 #define a_setup() a_setup(aTHX)
1153 # if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1154 MY_CXT.tbl = ptable_new();
1155 MY_CXT.owner = aTHX;
1156 # endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
1158 MY_CXT.seen = ptable_new();
1159 # endif /* !A_RPEEP */
1161 #endif /* A_NEED_CXT */
1163 a_old_ck_padany = PL_check[OP_PADANY];
1164 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_ck_padany);
1165 a_old_ck_padsv = PL_check[OP_PADSV];
1166 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_ck_padsv);
1168 a_old_ck_aelem = PL_check[OP_AELEM];
1169 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_ck_deref);
1170 a_old_ck_helem = PL_check[OP_HELEM];
1171 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_ck_deref);
1172 a_old_ck_rv2sv = PL_check[OP_RV2SV];
1173 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_ck_deref);
1175 a_old_ck_rv2av = PL_check[OP_RV2AV];
1176 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1177 a_old_ck_rv2hv = PL_check[OP_RV2HV];
1178 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1180 a_old_ck_aslice = PL_check[OP_ASLICE];
1181 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1182 a_old_ck_hslice = PL_check[OP_HSLICE];
1183 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1185 a_old_ck_exists = PL_check[OP_EXISTS];
1186 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_ck_root);
1187 a_old_ck_delete = PL_check[OP_DELETE];
1188 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_ck_root);
1189 a_old_ck_keys = PL_check[OP_KEYS];
1190 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_ck_root);
1191 a_old_ck_values = PL_check[OP_VALUES];
1192 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_ck_root);
1195 a_old_peep = PL_rpeepp;
1198 a_old_peep = PL_peepp;
1203 call_atexit(a_teardown, aTHX);
1205 call_atexit(a_teardown, NULL);
1211 STATIC U32 a_booted = 0;
1213 /* --- XS ------------------------------------------------------------------ */
1215 MODULE = autovivification PACKAGE = autovivification
1224 a_op_map = ptable_new();
1226 MUTEX_INIT(&a_op_map_mutex);
1229 PERL_HASH(a_hash, __PACKAGE__, __PACKAGE_LEN__);
1231 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1232 newCONSTSUB(stash, "A_HINT_STRICT", newSVuv(A_HINT_STRICT));
1233 newCONSTSUB(stash, "A_HINT_WARN", newSVuv(A_HINT_WARN));
1234 newCONSTSUB(stash, "A_HINT_FETCH", newSVuv(A_HINT_FETCH));
1235 newCONSTSUB(stash, "A_HINT_STORE", newSVuv(A_HINT_STORE));
1236 newCONSTSUB(stash, "A_HINT_EXISTS", newSVuv(A_HINT_EXISTS));
1237 newCONSTSUB(stash, "A_HINT_DELETE", newSVuv(A_HINT_DELETE));
1238 newCONSTSUB(stash, "A_HINT_MASK", newSVuv(A_HINT_MASK));
1239 newCONSTSUB(stash, "A_THREADSAFE", newSVuv(A_THREADSAFE));
1240 newCONSTSUB(stash, "A_FORKSAFE", newSVuv(A_FORKSAFE));
1246 #if A_THREADSAFE && (A_WORKAROUND_REQUIRE_PROPAGATION || !A_HAS_RPEEP)
1252 #if A_WORKAROUND_REQUIRE_PROPAGATION
1261 #if A_WORKAROUND_REQUIRE_PROPAGATION
1263 a_ptable_clone_ud ud;
1266 a_ptable_clone_ud_init(ud, t, MY_CXT.owner);
1267 ptable_walk(MY_CXT.tbl, a_ptable_clone, &ud);
1268 a_ptable_clone_ud_deinit(ud);
1277 #if A_WORKAROUND_REQUIRE_PROPAGATION
1279 MY_CXT.owner = aTHX;
1285 reap(3, a_thread_cleanup, NULL);
1294 RETVAL = a_tag(SvOK(hint) ? SvUV(hint) : 0);
1304 RETVAL = newSVuv(a_detag(tag));