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 #ifndef A_WORKAROUND_REQUIRE_PROPAGATION
25 # define A_WORKAROUND_REQUIRE_PROPAGATION !A_HAS_PERL(5, 10, 1)
29 # define A_HAS_RPEEP A_HAS_PERL(5, 13, 5)
32 /* ... Thread safety and multiplicity ...................................... */
34 /* Always safe when the workaround isn't needed */
35 #if !A_WORKAROUND_REQUIRE_PROPAGATION
38 /* Otherwise, safe unless Makefile.PL says it's Win32 */
39 #elif !defined(A_FORKSAFE)
43 #ifndef A_MULTIPLICITY
44 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
45 # define A_MULTIPLICITY 1
47 # define A_MULTIPLICITY 0
52 # define tTHX PerlInterpreter*
55 #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))
56 # define A_THREADSAFE 1
58 # define MY_CXT_CLONE \
60 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
61 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
62 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
65 # define A_THREADSAFE 0
67 # define dMY_CXT dNOOP
69 # define MY_CXT a_globaldata
71 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
73 # define MY_CXT_INIT NOOP
75 # define MY_CXT_CLONE NOOP
78 /* --- Helpers ------------------------------------------------------------- */
80 /* ... Thread-safe hints ................................................... */
82 #if A_WORKAROUND_REQUIRE_PROPAGATION
89 #define A_HINT_FREE(H) PerlMemShared_free(H)
93 #define PTABLE_NAME ptable_hints
94 #define PTABLE_VAL_FREE(V) A_HINT_FREE(V)
103 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
104 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
106 #endif /* A_THREADSAFE */
108 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
112 #define PTABLE_NAME ptable_seen
113 #define PTABLE_VAL_FREE(V) NOOP
117 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
118 #define ptable_seen_store(T, K, V) ptable_seen_store(aPTBLMS_ (T), (K), (V))
119 #define ptable_seen_clear(T) ptable_seen_clear(aPTBLMS_ (T))
120 #define ptable_seen_free(T) ptable_seen_free(aPTBLMS_ (T))
122 #endif /* !A_HAS_RPEEP */
124 #define A_NEED_CXT ((A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION) || !A_HAS_RPEEP)
128 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
131 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
132 ptable *tbl; /* It really is a ptable_hints */
134 #endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
136 ptable *seen; /* It really is a ptable_seen */
137 #endif /* !A_HAS_RPEEP */
144 #if A_WORKAROUND_REQUIRE_PROPAGATION
148 #if A_HAS_PERL(5, 13, 2)
149 CLONE_PARAMS *params;
155 #if A_HAS_PERL(5, 13, 2)
156 # define a_ptable_clone_ud_init(U, T, O) \
158 (U).params = Perl_clone_params_new((O), aTHX)
159 # define a_ptable_clone_ud_deinit(U) Perl_clone_params_del((U).params)
160 # define a_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), (U)->params))
162 # define a_ptable_clone_ud_init(U, T, O) \
164 (U).params.stashes = newAV(); \
165 (U).params.flags = 0; \
166 (U).params.proto_perl = (O)
167 # define a_ptable_clone_ud_deinit(U) SvREFCNT_dec((U).params.stashes)
168 # define a_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), &((U)->params)))
171 STATIC void a_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
172 a_ptable_clone_ud *ud = ud_;
173 a_hint_t *h1 = ent->val;
176 h2 = PerlMemShared_malloc(sizeof *h2);
178 h2->require_tag = PTR2IV(a_dup_inc(INT2PTR(SV *, h1->require_tag), ud));
180 ptable_hints_store(ud->tbl, ent->key, h2);
183 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
187 STATIC void a_thread_cleanup(pTHX_ void *ud) {
190 #if A_WORKAROUND_REQUIRE_PROPAGATION
191 ptable_hints_free(MY_CXT.tbl);
192 #endif /* A_WORKAROUND_REQUIRE_PROPAGATION */
194 ptable_seen_free(MY_CXT.seen);
195 #endif /* !A_HAS_RPEEP */
198 #endif /* A_THREADSAFE */
200 #endif /* A_NEED_CXT */
202 #if A_WORKAROUND_REQUIRE_PROPAGATION
204 STATIC IV a_require_tag(pTHX) {
205 #define a_require_tag() a_require_tag(aTHX)
206 const CV *cv, *outside;
211 /* If for some reason the pragma is operational at run-time, try to discover
212 * the current cv in use. */
215 for (si = PL_curstackinfo; si; si = si->si_prev) {
218 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
219 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
221 switch (CxTYPE(cx)) {
224 /* The propagation workaround is only needed up to 5.10.0 and at that
225 * time format and sub contexts were still identical. And even later the
226 * cv members offsets should have been kept the same. */
228 goto get_enclosing_cv;
230 cv = cx->blk_eval.cv;
231 goto get_enclosing_cv;
242 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
248 STATIC SV *a_tag(pTHX_ UV bits) {
249 #define a_tag(B) a_tag(aTHX_ (B))
255 h = PerlMemShared_malloc(sizeof *h);
257 h->require_tag = a_require_tag();
260 /* We only need for the key to be an unique tag for looking up the value later.
261 * Allocated memory provides convenient unique identifiers, so that's why we
262 * use the hint as the key itself. */
263 ptable_hints_store(MY_CXT.tbl, h, h);
264 #endif /* A_THREADSAFE */
266 return newSViv(PTR2IV(h));
269 STATIC UV a_detag(pTHX_ const SV *hint) {
270 #define a_detag(H) a_detag(aTHX_ (H))
276 if (!(hint && SvIOK(hint)))
279 h = INT2PTR(a_hint_t *, SvIVX(hint));
281 h = ptable_fetch(MY_CXT.tbl, h);
282 #endif /* A_THREADSAFE */
284 if (a_require_tag() != h->require_tag)
290 #else /* A_WORKAROUND_REQUIRE_PROPAGATION */
292 #define a_tag(B) newSVuv(B)
293 /* PVs fetched from the hints chain have their SvLEN set to zero, so get the UV
300 ? sv_2uv(SvLEN(H) ? (H) : sv_mortalcopy(H)) \
306 #endif /* !A_WORKAROUND_REQUIRE_PROPAGATION */
308 /* Used both for hints and op flags */
309 #define A_HINT_STRICT 1
310 #define A_HINT_WARN 2
311 #define A_HINT_FETCH 4
312 #define A_HINT_STORE 8
313 #define A_HINT_EXISTS 16
314 #define A_HINT_DELETE 32
315 #define A_HINT_NOTIFY (A_HINT_STRICT|A_HINT_WARN)
316 #define A_HINT_DO (A_HINT_FETCH|A_HINT_STORE|A_HINT_EXISTS|A_HINT_DELETE)
317 #define A_HINT_MASK (A_HINT_NOTIFY|A_HINT_DO)
319 /* Only used in op flags */
320 #define A_HINT_ROOT 64
321 #define A_HINT_DEREF 128
323 STATIC U32 a_hash = 0;
325 STATIC UV a_hint(pTHX) {
326 #define a_hint() a_hint(aTHX)
328 #ifdef cop_hints_fetch_pvn
329 hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__, a_hash, 0);
330 #elif A_HAS_PERL(5, 9, 5)
331 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
333 __PACKAGE__, __PACKAGE_LEN__,
337 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, a_hash);
342 return a_detag(hint);
345 /* ... op => info map ...................................................... */
353 #define PTABLE_NAME ptable_map
354 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
358 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
359 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
360 #define ptable_map_delete(T, K) ptable_map_delete(aPTBLMS_ (T), (K))
362 STATIC ptable *a_op_map = NULL;
366 #define dA_MAP_THX a_op_info a_op_map_tmp_oi
368 STATIC perl_mutex a_op_map_mutex;
370 #define A_LOCK(M) MUTEX_LOCK(M)
371 #define A_UNLOCK(M) MUTEX_UNLOCK(M)
373 STATIC const a_op_info *a_map_fetch(const OP *o, a_op_info *oi) {
374 const a_op_info *val;
376 A_LOCK(&a_op_map_mutex);
378 val = ptable_fetch(a_op_map, o);
384 A_UNLOCK(&a_op_map_mutex);
389 #define a_map_fetch(O) a_map_fetch((O), &a_op_map_tmp_oi)
391 #else /* USE_ITHREADS */
393 #define dA_MAP_THX dNOOP
395 #define A_LOCK(M) NOOP
396 #define A_UNLOCK(M) NOOP
398 #define a_map_fetch(O) ptable_fetch(a_op_map, (O))
400 #endif /* !USE_ITHREADS */
402 STATIC const a_op_info *a_map_store_locked(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
403 #define a_map_store_locked(O, PP, N, F) a_map_store_locked(aPTBLMS_ (O), (PP), (N), (F))
406 if (!(oi = ptable_fetch(a_op_map, o))) {
407 oi = PerlMemShared_malloc(sizeof *oi);
408 ptable_map_store(a_op_map, o, oi);
418 STATIC void a_map_store(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
419 #define a_map_store(O, PP, N, F) a_map_store(aPTBLMS_ (O), (PP), (N), (F))
420 A_LOCK(&a_op_map_mutex);
422 a_map_store_locked(o, old_pp, next, flags);
424 A_UNLOCK(&a_op_map_mutex);
427 STATIC void a_map_delete(pTHX_ const OP *o) {
428 #define a_map_delete(O) a_map_delete(aTHX_ (O))
429 A_LOCK(&a_op_map_mutex);
431 ptable_map_delete(a_op_map, o);
433 A_UNLOCK(&a_op_map_mutex);
436 STATIC const OP *a_map_descend(const OP *o) {
437 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
441 case OA_BASEOP_OR_UNOP:
442 return cUNOPo->op_first;
445 return cLISTOPo->op_last;
451 STATIC void a_map_store_root(pPTBLMS_ const OP *root, OP *(*old_pp)(pTHX), UV flags) {
452 #define a_map_store_root(R, PP, F) a_map_store_root(aPTBLMS_ (R), (PP), (F))
453 const a_op_info *roi;
457 A_LOCK(&a_op_map_mutex);
459 roi = a_map_store_locked(o, old_pp, (OP *) root, flags | A_HINT_ROOT);
461 while (o->op_flags & OPf_KIDS) {
462 o = a_map_descend(o);
465 if ((oi = ptable_fetch(a_op_map, o))) {
466 oi->flags &= ~A_HINT_ROOT;
467 oi->next = (a_op_info *) roi;
472 A_UNLOCK(&a_op_map_mutex);
477 STATIC void a_map_update_flags_topdown(const OP *root, UV flags) {
481 A_LOCK(&a_op_map_mutex);
483 flags &= ~A_HINT_ROOT;
486 if ((oi = ptable_fetch(a_op_map, o)))
487 oi->flags = (oi->flags & A_HINT_ROOT) | flags;
488 if (!(o->op_flags & OPf_KIDS))
490 o = a_map_descend(o);
493 A_UNLOCK(&a_op_map_mutex);
498 #define a_map_cancel(R) a_map_update_flags_topdown((R), 0)
500 STATIC void a_map_update_flags_bottomup(const OP *o, UV flags, UV rflags) {
503 A_LOCK(&a_op_map_mutex);
505 flags &= ~A_HINT_ROOT;
506 rflags |= A_HINT_ROOT;
508 oi = ptable_fetch(a_op_map, o);
509 while (!(oi->flags & A_HINT_ROOT)) {
515 A_UNLOCK(&a_op_map_mutex);
520 /* ... Decide whether this expression should be autovivified or not ........ */
522 STATIC UV a_map_resolve(const OP *o, const a_op_info *oi) {
523 UV flags = 0, rflags;
525 const a_op_info *roi = oi;
527 while (!(roi->flags & A_HINT_ROOT))
532 rflags = roi->flags & ~A_HINT_ROOT;
537 if (root->op_flags & OPf_MOD) {
538 if (rflags & A_HINT_STORE)
539 flags = (A_HINT_STORE|A_HINT_DEREF);
540 } else if (rflags & A_HINT_FETCH)
541 flags = (A_HINT_FETCH|A_HINT_DEREF);
545 a_map_update_flags_bottomup(o, 0, 0);
549 flags |= (rflags & A_HINT_NOTIFY);
550 a_map_update_flags_bottomup(o, flags, 0);
552 return oi->flags & A_HINT_ROOT ? 0 : flags;
555 /* ... Inspired from pp_defined() .......................................... */
557 STATIC int a_undef(pTHX_ SV *sv) {
558 #define a_undef(S) a_undef(aTHX_ (S))
559 switch (SvTYPE(sv)) {
563 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv)
564 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
568 if (HvARRAY(sv) || SvGMAGICAL(sv)
569 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
581 /* --- PP functions -------------------------------------------------------- */
583 /* Be aware that we restore PL_op->op_ppaddr from the pointer table old_pp
584 * value, another extension might have saved our pp replacement as the ppaddr
585 * for this op, so this doesn't ensure that our function will never be called
586 * again. That's why we don't remove the op info from our map, so that it can
587 * still run correctly if required. */
589 /* ... pp_rv2av ............................................................ */
591 STATIC OP *a_pp_rv2av(pTHX) {
596 oi = a_map_fetch(PL_op);
598 if (oi->flags & A_HINT_DEREF) {
600 /* We always need to push an empty array to fool the pp_aelem() that comes
604 av = sv_2mortal((SV *) newAV());
610 return oi->old_pp(aTHX);
613 /* ... pp_rv2hv ............................................................ */
615 STATIC OP *a_pp_rv2hv_simple(pTHX) {
620 oi = a_map_fetch(PL_op);
622 if (oi->flags & A_HINT_DEREF) {
627 return oi->old_pp(aTHX);
630 STATIC OP *a_pp_rv2hv(pTHX) {
635 oi = a_map_fetch(PL_op);
637 if (oi->flags & A_HINT_DEREF) {
641 hv = sv_2mortal((SV *) newHV());
647 return oi->old_pp(aTHX);
650 /* ... pp_deref (aelem,helem,rv2sv,padsv) .................................. */
652 STATIC OP *a_pp_deref(pTHX) {
658 oi = a_map_fetch(PL_op);
661 if (flags & A_HINT_DEREF) {
664 o = oi->old_pp(aTHX);
666 if (flags & (A_HINT_NOTIFY|A_HINT_STORE)) {
669 if (flags & A_HINT_STRICT)
670 croak("Reference vivification forbidden");
671 else if (flags & A_HINT_WARN)
672 warn("Reference was vivified");
673 else /* A_HINT_STORE */
674 croak("Can't vivify reference");
681 return oi->old_pp(aTHX);
684 /* ... pp_root (exists,delete,keys,values) ................................. */
686 STATIC OP *a_pp_root_unop(pTHX) {
691 /* Can only be reached by keys or values */
692 if (GIMME_V == G_SCALAR) {
701 const a_op_info *oi = a_map_fetch(PL_op);
702 return oi->old_pp(aTHX);
706 STATIC OP *a_pp_root_binop(pTHX) {
709 if (a_undef(TOPm1s)) {
712 if (PL_op->op_type == OP_EXISTS)
720 const a_op_info *oi = a_map_fetch(PL_op);
721 return oi->old_pp(aTHX);
725 /* --- Check functions ----------------------------------------------------- */
727 STATIC void a_recheck_rv2xv(pTHX_ OP *o, OPCODE type, OP *(*new_pp)(pTHX)) {
728 #define a_recheck_rv2xv(O, T, PP) a_recheck_rv2xv(aTHX_ (O), (T), (PP))
730 if (o->op_type == type && o->op_ppaddr != new_pp
731 && cUNOPo->op_first->op_type != OP_GV) {
733 const a_op_info *oi = a_map_fetch(o);
735 a_map_store(o, o->op_ppaddr, oi->next, oi->flags);
736 o->op_ppaddr = new_pp;
743 /* ... ck_pad{any,sv} ...................................................... */
745 /* Sadly, the padsv OPs we are interested in don't trigger the padsv check
746 * function, but are instead manually mutated from a padany. So we store
747 * the op entry in the op map in the padany check function, and we set their
748 * op_ppaddr member in our peephole optimizer replacement below. */
750 STATIC OP *(*a_old_ck_padany)(pTHX_ OP *) = 0;
752 STATIC OP *a_ck_padany(pTHX_ OP *o) {
755 o = a_old_ck_padany(aTHX_ o);
758 if (hint & A_HINT_DO)
759 a_map_store_root(o, o->op_ppaddr, hint);
766 STATIC OP *(*a_old_ck_padsv)(pTHX_ OP *) = 0;
768 STATIC OP *a_ck_padsv(pTHX_ OP *o) {
771 o = a_old_ck_padsv(aTHX_ o);
774 if (hint & A_HINT_DO) {
775 a_map_store_root(o, o->op_ppaddr, hint);
776 o->op_ppaddr = a_pp_deref;
783 /* ... ck_deref (aelem,helem,rv2sv) ........................................ */
785 /* Those ops appear both at the root and inside an expression but there's no
786 * way to distinguish both situations. Worse, we can't even know if we are in a
787 * modifying context, so the expression can't be resolved yet. It will be at the
788 * first invocation of a_pp_deref() for this expression. */
790 STATIC OP *(*a_old_ck_aelem)(pTHX_ OP *) = 0;
791 STATIC OP *(*a_old_ck_helem)(pTHX_ OP *) = 0;
792 STATIC OP *(*a_old_ck_rv2sv)(pTHX_ OP *) = 0;
794 STATIC OP *a_ck_deref(pTHX_ OP *o) {
795 OP * (*old_ck)(pTHX_ OP *o) = 0;
798 switch (o->op_type) {
800 old_ck = a_old_ck_aelem;
801 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
802 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2AV, a_pp_rv2av);
805 old_ck = a_old_ck_helem;
806 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
807 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2HV, a_pp_rv2hv_simple);
810 old_ck = a_old_ck_rv2sv;
815 if (hint & A_HINT_DO) {
816 a_map_store_root(o, o->op_ppaddr, hint);
817 o->op_ppaddr = a_pp_deref;
824 /* ... ck_rv2xv (rv2av,rv2hv) .............................................. */
826 /* Those ops also appear both inisde and at the root, hence the caveats for
827 * a_ck_deref() still apply here. Since a padsv/rv2sv must appear before a
828 * rv2[ah]v, resolution is handled by the first call to a_pp_deref() in the
831 STATIC OP *(*a_old_ck_rv2av)(pTHX_ OP *) = 0;
832 STATIC OP *(*a_old_ck_rv2hv)(pTHX_ OP *) = 0;
834 STATIC OP *a_ck_rv2xv(pTHX_ OP *o) {
835 OP * (*old_ck)(pTHX_ OP *o) = 0;
836 OP * (*new_pp)(pTHX) = 0;
839 switch (o->op_type) {
840 case OP_RV2AV: old_ck = a_old_ck_rv2av; new_pp = a_pp_rv2av; break;
841 case OP_RV2HV: old_ck = a_old_ck_rv2hv; new_pp = a_pp_rv2hv_simple; break;
845 if (cUNOPo->op_first->op_type == OP_GV)
849 if (hint & A_HINT_DO && !(hint & A_HINT_STRICT)) {
850 a_map_store_root(o, o->op_ppaddr, hint);
851 o->op_ppaddr = new_pp;
858 /* ... ck_xslice (aslice,hslice) ........................................... */
860 /* I think those are only found at the root, but there's nothing that really
861 * prevent them to be inside the expression too. We only need to update the
862 * root so that the rest of the expression will see the right context when
863 * resolving. That's why we don't replace the ppaddr. */
865 STATIC OP *(*a_old_ck_aslice)(pTHX_ OP *) = 0;
866 STATIC OP *(*a_old_ck_hslice)(pTHX_ OP *) = 0;
868 STATIC OP *a_ck_xslice(pTHX_ OP *o) {
869 OP * (*old_ck)(pTHX_ OP *o) = 0;
872 switch (o->op_type) {
874 old_ck = a_old_ck_aslice;
877 old_ck = a_old_ck_hslice;
878 if (hint & A_HINT_DO)
879 a_recheck_rv2xv(cUNOPo->op_first->op_sibling, OP_RV2HV, a_pp_rv2hv);
884 if (hint & A_HINT_DO) {
885 a_map_store_root(o, 0, hint);
892 /* ... ck_root (exists,delete,keys,values) ................................. */
894 /* Those ops are only found at the root of a dereferencing expression. We can
895 * then resolve at compile time if vivification must take place or not. */
897 STATIC OP *(*a_old_ck_exists)(pTHX_ OP *) = 0;
898 STATIC OP *(*a_old_ck_delete)(pTHX_ OP *) = 0;
899 STATIC OP *(*a_old_ck_keys) (pTHX_ OP *) = 0;
900 STATIC OP *(*a_old_ck_values)(pTHX_ OP *) = 0;
902 STATIC OP *a_ck_root(pTHX_ OP *o) {
903 OP * (*old_ck)(pTHX_ OP *o) = 0;
904 OP * (*new_pp)(pTHX) = 0;
905 bool enabled = FALSE;
908 switch (o->op_type) {
910 old_ck = a_old_ck_exists;
911 new_pp = a_pp_root_binop;
912 enabled = hint & A_HINT_EXISTS;
915 old_ck = a_old_ck_delete;
916 new_pp = a_pp_root_binop;
917 enabled = hint & A_HINT_DELETE;
920 old_ck = a_old_ck_keys;
921 new_pp = a_pp_root_unop;
922 enabled = hint & A_HINT_FETCH;
925 old_ck = a_old_ck_values;
926 new_pp = a_pp_root_unop;
927 enabled = hint & A_HINT_FETCH;
932 if (hint & A_HINT_DO) {
934 a_map_update_flags_topdown(o, hint | A_HINT_DEREF);
935 a_map_store_root(o, o->op_ppaddr, hint);
936 o->op_ppaddr = new_pp;
946 /* ... Our peephole optimizer .............................................. */
948 STATIC peep_t a_old_peep = 0; /* This is actually the rpeep past 5.13.5 */
951 # define A_PEEP_REC_PROTO STATIC void a_peep_rec(pTHX_ OP *o, ptable *seen)
952 #else /* !A_HAS_RPEEP */
953 # define A_PEEP_REC_PROTO STATIC void a_peep_rec(pTHX_ OP *o)
954 #endif /* A_HAS_RPEEP */
959 # define a_peep_rec(O) a_peep_rec(aTHX_ (O), seen)
960 #else /* !A_HAS_RPEEP */
961 # define a_peep_rec(O) a_peep_rec(aTHX_ (O))
962 #endif /* A_HAS_RPEEP */
966 if (ptable_fetch(seen, o))
970 for (; o; o = o->op_next) {
971 const a_op_info *oi = NULL;
975 ptable_seen_store(seen, o, o);
977 switch (o->op_type) {
979 if (o->op_ppaddr != a_pp_deref) {
981 if (oi && (oi->flags & A_HINT_DO)) {
982 a_map_store(o, o->op_ppaddr, oi->next, oi->flags);
983 o->op_ppaddr = a_pp_deref;
991 if (o->op_ppaddr != a_pp_deref)
997 if (!(flags & A_HINT_DEREF)
998 && (flags & A_HINT_DO)
999 && (o->op_private & OPpDEREF || flags & A_HINT_ROOT)) {
1000 /* Decide if the expression must autovivify or not. */
1001 flags = a_map_resolve(o, oi);
1003 if (flags & A_HINT_DEREF)
1004 o->op_private = ((o->op_private & ~OPpDEREF) | OPpLVAL_DEFER);
1006 o->op_ppaddr = oi->old_pp;
1010 if ( o->op_ppaddr != a_pp_rv2av
1011 && o->op_ppaddr != a_pp_rv2hv
1012 && o->op_ppaddr != a_pp_rv2hv_simple)
1014 oi = a_map_fetch(o);
1017 if (!(oi->flags & A_HINT_DEREF))
1018 o->op_ppaddr = oi->old_pp;
1029 # if A_HAS_PERL(5, 10, 0)
1034 a_peep_rec(cLOGOPo->op_other);
1038 a_peep_rec(cLOOPo->op_redoop);
1039 a_peep_rec(cLOOPo->op_nextop);
1040 a_peep_rec(cLOOPo->op_lastop);
1042 # if A_HAS_PERL(5, 9, 5)
1044 a_peep_rec(cPMOPo->op_pmstashstartu.op_pmreplstart);
1050 a_peep_rec(cPMOPo->op_pmreplstart);
1053 #endif /* !A_HAS_RPEEP */
1060 STATIC void a_peep(pTHX_ OP *o) {
1063 ptable *seen = MY_CXT.seen;
1065 ptable_seen_clear(seen);
1066 #endif /* !A_HAS_RPEEP */
1068 a_old_peep(aTHX_ o);
1072 /* --- Interpreter setup/teardown ------------------------------------------ */
1074 STATIC U32 a_initialized = 0;
1076 STATIC void a_teardown(pTHX_ void *root) {
1089 # if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1090 ptable_hints_free(MY_CXT.tbl);
1091 # endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
1093 ptable_seen_free(MY_CXT.seen);
1094 # endif /* !A_HAS_RPEEP */
1096 #endif /* A_NEED_CXT */
1098 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_old_ck_padany);
1099 a_old_ck_padany = 0;
1100 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_old_ck_padsv);
1103 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_old_ck_aelem);
1105 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_old_ck_helem);
1107 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_old_ck_rv2sv);
1110 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_old_ck_rv2av);
1112 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_old_ck_rv2hv);
1115 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_old_ck_aslice);
1116 a_old_ck_aslice = 0;
1117 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_old_ck_hslice);
1118 a_old_ck_hslice = 0;
1120 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_old_ck_exists);
1121 a_old_ck_exists = 0;
1122 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_old_ck_delete);
1123 a_old_ck_delete = 0;
1124 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_old_ck_keys);
1126 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_old_ck_values);
1127 a_old_ck_values = 0;
1130 PL_rpeepp = a_old_peep;
1132 PL_peepp = a_old_peep;
1139 STATIC void a_setup(pTHX) {
1140 #define a_setup() a_setup(aTHX)
1147 # if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1148 MY_CXT.tbl = ptable_new();
1149 MY_CXT.owner = aTHX;
1150 # endif /* A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION */
1152 MY_CXT.seen = ptable_new();
1153 # endif /* !A_RPEEP */
1155 #endif /* A_NEED_CXT */
1157 a_old_ck_padany = PL_check[OP_PADANY];
1158 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_ck_padany);
1159 a_old_ck_padsv = PL_check[OP_PADSV];
1160 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_ck_padsv);
1162 a_old_ck_aelem = PL_check[OP_AELEM];
1163 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_ck_deref);
1164 a_old_ck_helem = PL_check[OP_HELEM];
1165 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_ck_deref);
1166 a_old_ck_rv2sv = PL_check[OP_RV2SV];
1167 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_ck_deref);
1169 a_old_ck_rv2av = PL_check[OP_RV2AV];
1170 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1171 a_old_ck_rv2hv = PL_check[OP_RV2HV];
1172 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1174 a_old_ck_aslice = PL_check[OP_ASLICE];
1175 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1176 a_old_ck_hslice = PL_check[OP_HSLICE];
1177 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1179 a_old_ck_exists = PL_check[OP_EXISTS];
1180 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_ck_root);
1181 a_old_ck_delete = PL_check[OP_DELETE];
1182 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_ck_root);
1183 a_old_ck_keys = PL_check[OP_KEYS];
1184 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_ck_root);
1185 a_old_ck_values = PL_check[OP_VALUES];
1186 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_ck_root);
1189 a_old_peep = PL_rpeepp;
1192 a_old_peep = PL_peepp;
1197 call_atexit(a_teardown, aTHX);
1199 call_atexit(a_teardown, NULL);
1205 STATIC U32 a_booted = 0;
1207 /* --- XS ------------------------------------------------------------------ */
1209 MODULE = autovivification PACKAGE = autovivification
1218 a_op_map = ptable_new();
1220 MUTEX_INIT(&a_op_map_mutex);
1223 PERL_HASH(a_hash, __PACKAGE__, __PACKAGE_LEN__);
1225 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1226 newCONSTSUB(stash, "A_HINT_STRICT", newSVuv(A_HINT_STRICT));
1227 newCONSTSUB(stash, "A_HINT_WARN", newSVuv(A_HINT_WARN));
1228 newCONSTSUB(stash, "A_HINT_FETCH", newSVuv(A_HINT_FETCH));
1229 newCONSTSUB(stash, "A_HINT_STORE", newSVuv(A_HINT_STORE));
1230 newCONSTSUB(stash, "A_HINT_EXISTS", newSVuv(A_HINT_EXISTS));
1231 newCONSTSUB(stash, "A_HINT_DELETE", newSVuv(A_HINT_DELETE));
1232 newCONSTSUB(stash, "A_HINT_MASK", newSVuv(A_HINT_MASK));
1233 newCONSTSUB(stash, "A_THREADSAFE", newSVuv(A_THREADSAFE));
1234 newCONSTSUB(stash, "A_FORKSAFE", newSVuv(A_FORKSAFE));
1240 #if A_THREADSAFE && (A_WORKAROUND_REQUIRE_PROPAGATION || !A_HAS_RPEEP)
1246 #if A_WORKAROUND_REQUIRE_PROPAGATION
1255 #if A_WORKAROUND_REQUIRE_PROPAGATION
1257 a_ptable_clone_ud ud;
1260 a_ptable_clone_ud_init(ud, t, MY_CXT.owner);
1261 ptable_walk(MY_CXT.tbl, a_ptable_clone, &ud);
1262 a_ptable_clone_ud_deinit(ud);
1271 #if A_WORKAROUND_REQUIRE_PROPAGATION
1273 MY_CXT.owner = aTHX;
1279 reap(3, a_thread_cleanup, NULL);
1288 RETVAL = a_tag(SvOK(hint) ? SvUV(hint) : 0);
1298 RETVAL = newSVuv(a_detag(tag));