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))))))
25 #if defined(ENTER_with_name) && !A_HAS_PERL(5, 11, 4)
26 # define ENTERn(N) ENTER_with_name(N)
28 # define ENTERn(N) ENTER
32 #if defined(LEAVE_with_name) && !A_HAS_PERL(5, 11, 4)
33 # define LEAVEn(N) LEAVE_with_name(N)
35 # define LEAVEn(N) LEAVE
38 #ifndef A_WORKAROUND_REQUIRE_PROPAGATION
39 # define A_WORKAROUND_REQUIRE_PROPAGATION !A_HAS_PERL(5, 10, 1)
42 /* ... Thread safety and multiplicity ...................................... */
44 /* Always safe when the workaround isn't needed */
45 #if !A_WORKAROUND_REQUIRE_PROPAGATION
48 /* Otherwise, safe unless Makefile.PL says it's Win32 */
49 #elif !defined(A_FORKSAFE)
53 #ifndef A_MULTIPLICITY
54 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
55 # define A_MULTIPLICITY 1
57 # define A_MULTIPLICITY 0
60 #if A_MULTIPLICITY && !defined(tTHX)
61 # define tTHX PerlInterpreter*
64 #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))
65 # define A_THREADSAFE 1
67 # define MY_CXT_CLONE \
69 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
70 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
71 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
74 # define A_THREADSAFE 0
76 # define dMY_CXT dNOOP
78 # define MY_CXT a_globaldata
80 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
82 # define MY_CXT_INIT NOOP
84 # define MY_CXT_CLONE NOOP
87 /* --- Helpers ------------------------------------------------------------- */
89 /* ... Thread-safe hints ................................................... */
91 #if A_WORKAROUND_REQUIRE_PROPAGATION
98 #define A_HINT_FREE(H) PerlMemShared_free(H)
102 #define PTABLE_NAME ptable_hints
103 #define PTABLE_VAL_FREE(V) A_HINT_FREE(V)
112 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
113 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
115 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
118 ptable *tbl; /* It really is a ptable_hints */
124 STATIC SV *a_clone(pTHX_ SV *sv, tTHX owner) {
125 #define a_clone(S, O) a_clone(aTHX_ (S), (O))
130 if (SvTYPE(sv) == SVt_PVHV && HvNAME_get(sv))
133 param.stashes = stashes;
135 param.proto_perl = owner;
137 dupsv = sv_dup(sv, ¶m);
141 SvREFCNT_dec(stashes);
144 return SvREFCNT_inc(dupsv);
147 STATIC void a_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
149 a_hint_t *h1 = ent->val;
152 if (ud->owner == aTHX)
155 h2 = PerlMemShared_malloc(sizeof *h2);
157 h2->require_tag = PTR2IV(a_clone(INT2PTR(SV *, h1->require_tag), ud->owner));
159 ptable_hints_store(ud->tbl, ent->key, h2);
162 STATIC void a_thread_cleanup(pTHX_ void *);
164 STATIC void a_thread_cleanup(pTHX_ void *ud) {
170 SAVEDESTRUCTOR_X(a_thread_cleanup, level);
174 PerlMemShared_free(level);
175 ptable_hints_free(MY_CXT.tbl);
179 #endif /* A_THREADSAFE */
181 STATIC IV a_require_tag(pTHX) {
182 #define a_require_tag() a_require_tag(aTHX)
183 const CV *cv, *outside;
188 /* If for some reason the pragma is operational at run-time, try to discover
189 * the current cv in use. */
192 for (si = PL_curstackinfo; si; si = si->si_prev) {
195 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
196 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
198 switch (CxTYPE(cx)) {
201 /* The propagation workaround is only needed up to 5.10.0 and at that
202 * time format and sub contexts were still identical. And even later the
203 * cv members offsets should have been kept the same. */
205 goto get_enclosing_cv;
207 cv = cx->blk_eval.cv;
208 goto get_enclosing_cv;
219 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
225 STATIC SV *a_tag(pTHX_ UV bits) {
226 #define a_tag(B) a_tag(aTHX_ (B))
230 h = PerlMemShared_malloc(sizeof *h);
232 h->require_tag = a_require_tag();
235 /* We only need for the key to be an unique tag for looking up the value later.
236 * Allocated memory provides convenient unique identifiers, so that's why we
237 * use the hint as the key itself. */
238 ptable_hints_store(MY_CXT.tbl, h, h);
239 #endif /* A_THREADSAFE */
241 return newSViv(PTR2IV(h));
244 STATIC UV a_detag(pTHX_ const SV *hint) {
245 #define a_detag(H) a_detag(aTHX_ (H))
249 if (!(hint && SvIOK(hint)))
252 h = INT2PTR(a_hint_t *, SvIVX(hint));
254 h = ptable_fetch(MY_CXT.tbl, h);
255 #endif /* A_THREADSAFE */
257 if (a_require_tag() != h->require_tag)
263 #else /* A_WORKAROUND_REQUIRE_PROPAGATION */
265 #define a_tag(B) newSVuv(B)
266 /* PVs fetched from the hints chain have their SvLEN set to zero, so get the UV
273 ? sv_2uv(SvLEN(H) ? (H) : sv_mortalcopy(H)) \
279 #endif /* !A_WORKAROUND_REQUIRE_PROPAGATION */
281 /* Used both for hints and op flags */
282 #define A_HINT_STRICT 1
283 #define A_HINT_WARN 2
284 #define A_HINT_FETCH 4
285 #define A_HINT_STORE 8
286 #define A_HINT_EXISTS 16
287 #define A_HINT_DELETE 32
288 #define A_HINT_NOTIFY (A_HINT_STRICT|A_HINT_WARN)
289 #define A_HINT_DO (A_HINT_FETCH|A_HINT_STORE|A_HINT_EXISTS|A_HINT_DELETE)
290 #define A_HINT_MASK (A_HINT_NOTIFY|A_HINT_DO)
292 /* Only used in op flags */
293 #define A_HINT_ROOT 64
294 #define A_HINT_DEREF 128
296 STATIC U32 a_hash = 0;
298 STATIC UV a_hint(pTHX) {
299 #define a_hint() a_hint(aTHX)
301 #if A_HAS_PERL(5, 9, 5)
302 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
304 __PACKAGE__, __PACKAGE_LEN__,
308 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, a_hash);
313 return a_detag(hint);
316 /* ... op => info map ...................................................... */
324 #define PTABLE_NAME ptable_map
325 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
329 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
330 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
332 STATIC ptable *a_op_map = NULL;
335 STATIC perl_mutex a_op_map_mutex;
338 STATIC const a_op_info *a_map_fetch(const OP *o, a_op_info *oi) {
339 const a_op_info *val;
342 MUTEX_LOCK(&a_op_map_mutex);
345 val = ptable_fetch(a_op_map, o);
352 MUTEX_UNLOCK(&a_op_map_mutex);
358 STATIC const a_op_info *a_map_store_locked(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
359 #define a_map_store_locked(O, PP, N, F) a_map_store_locked(aPTBLMS_ (O), (PP), (N), (F))
362 if (!(oi = ptable_fetch(a_op_map, o))) {
363 oi = PerlMemShared_malloc(sizeof *oi);
364 ptable_map_store(a_op_map, o, oi);
374 STATIC void a_map_store(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
375 #define a_map_store(O, PP, N, F) a_map_store(aPTBLMS_ (O), (PP), (N), (F))
378 MUTEX_LOCK(&a_op_map_mutex);
381 a_map_store_locked(o, old_pp, next, flags);
384 MUTEX_UNLOCK(&a_op_map_mutex);
388 STATIC void a_map_delete(pTHX_ const OP *o) {
389 #define a_map_delete(O) a_map_delete(aTHX_ (O))
391 MUTEX_LOCK(&a_op_map_mutex);
394 ptable_map_store(a_op_map, o, NULL);
397 MUTEX_UNLOCK(&a_op_map_mutex);
401 STATIC const OP *a_map_descend(const OP *o) {
402 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
406 case OA_BASEOP_OR_UNOP:
407 return cUNOPo->op_first;
410 return cLISTOPo->op_last;
416 STATIC void a_map_store_root(pPTBLMS_ const OP *root, OP *(*old_pp)(pTHX), UV flags) {
417 #define a_map_store_root(R, PP, F) a_map_store_root(aPTBLMS_ (R), (PP), (F))
418 const a_op_info *roi;
423 MUTEX_LOCK(&a_op_map_mutex);
426 roi = a_map_store_locked(o, old_pp, (OP *) root, flags | A_HINT_ROOT);
428 while (o->op_flags & OPf_KIDS) {
429 o = a_map_descend(o);
432 if ((oi = ptable_fetch(a_op_map, o))) {
433 oi->flags &= ~A_HINT_ROOT;
434 oi->next = (a_op_info *) roi;
440 MUTEX_UNLOCK(&a_op_map_mutex);
446 STATIC void a_map_update_flags_topdown(const OP *root, UV flags) {
451 MUTEX_LOCK(&a_op_map_mutex);
454 flags &= ~A_HINT_ROOT;
457 if ((oi = ptable_fetch(a_op_map, o)))
458 oi->flags = (oi->flags & A_HINT_ROOT) | flags;
459 if (!(o->op_flags & OPf_KIDS))
461 o = a_map_descend(o);
465 MUTEX_UNLOCK(&a_op_map_mutex);
471 #define a_map_cancel(R) a_map_update_flags_topdown((R), 0)
473 STATIC void a_map_update_flags_bottomup(const OP *o, UV flags, UV rflags) {
477 MUTEX_LOCK(&a_op_map_mutex);
480 flags &= ~A_HINT_ROOT;
481 rflags |= A_HINT_ROOT;
483 oi = ptable_fetch(a_op_map, o);
484 while (!(oi->flags & A_HINT_ROOT)) {
491 MUTEX_UNLOCK(&a_op_map_mutex);
497 /* ... Decide whether this expression should be autovivified or not ........ */
499 STATIC UV a_map_resolve(const OP *o, a_op_info *oi) {
500 UV flags = 0, rflags;
504 while (!(roi->flags & A_HINT_ROOT))
509 rflags = roi->flags & ~A_HINT_ROOT;
514 if (root->op_flags & OPf_MOD) {
515 if (rflags & A_HINT_STORE)
516 flags = (A_HINT_STORE|A_HINT_DEREF);
517 } else if (rflags & A_HINT_FETCH)
518 flags = (A_HINT_FETCH|A_HINT_DEREF);
522 a_map_update_flags_bottomup(o, 0, 0);
526 flags |= (rflags & A_HINT_NOTIFY);
527 a_map_update_flags_bottomup(o, flags, 0);
529 return oi->flags & A_HINT_ROOT ? 0 : flags;
532 /* ... Lightweight pp_defined() ............................................ */
534 STATIC bool a_defined(pTHX_ SV *sv) {
535 #define a_defined(S) a_defined(aTHX_ (S))
536 bool defined = FALSE;
538 switch (SvTYPE(sv)) {
540 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv)
541 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
545 if (HvARRAY(sv) || SvGMAGICAL(sv)
546 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
558 /* --- PP functions -------------------------------------------------------- */
560 /* Be aware that we restore PL_op->op_ppaddr from the pointer table old_pp
561 * value, another extension might have saved our pp replacement as the ppaddr
562 * for this op, so this doesn't ensure that our function will never be called
563 * again. That's why we don't remove the op info from our map, so that it can
564 * still run correctly if required. */
566 /* ... pp_rv2av ............................................................ */
568 STATIC OP *a_pp_rv2av(pTHX) {
573 a_map_fetch(PL_op, &oi);
576 if (flags & A_HINT_DEREF) {
577 if (!a_defined(TOPs)) {
578 /* We always need to push an empty array to fool the pp_aelem() that comes
582 av = sv_2mortal((SV *) newAV());
587 PL_op->op_ppaddr = oi.old_pp;
590 return CALL_FPTR(oi.old_pp)(aTHX);
593 /* ... pp_rv2hv ............................................................ */
595 STATIC OP *a_pp_rv2hv_simple(pTHX) {
600 a_map_fetch(PL_op, &oi);
603 if (flags & A_HINT_DEREF) {
604 if (!a_defined(TOPs))
607 PL_op->op_ppaddr = oi.old_pp;
610 return CALL_FPTR(oi.old_pp)(aTHX);
613 STATIC OP *a_pp_rv2hv(pTHX) {
618 a_map_fetch(PL_op, &oi);
621 if (flags & A_HINT_DEREF) {
622 if (!a_defined(TOPs)) {
625 hv = sv_2mortal((SV *) newHV());
630 PL_op->op_ppaddr = oi.old_pp;
633 return CALL_FPTR(oi.old_pp)(aTHX);
636 /* ... pp_deref (aelem,helem,rv2sv,padsv) .................................. */
638 STATIC OP *a_pp_deref(pTHX) {
643 a_map_fetch(PL_op, &oi);
646 if (flags & A_HINT_DEREF) {
651 old_private = PL_op->op_private;
652 PL_op->op_private = ((old_private & ~OPpDEREF) | OPpLVAL_DEFER);
653 o = CALL_FPTR(oi.old_pp)(aTHX);
654 PL_op->op_private = old_private;
656 if (flags & (A_HINT_NOTIFY|A_HINT_STORE)) {
658 if (!a_defined(TOPs)) {
659 if (flags & A_HINT_STRICT)
660 croak("Reference vivification forbidden");
661 else if (flags & A_HINT_WARN)
662 warn("Reference was vivified");
663 else /* A_HINT_STORE */
664 croak("Can't vivify reference");
669 } else if ((flags & ~A_HINT_ROOT)
670 && (PL_op->op_private & OPpDEREF || flags & A_HINT_ROOT)) {
671 /* Decide if the expression must autovivify or not.
672 * This branch should be called only once by expression. */
673 flags = a_map_resolve(PL_op, &oi);
675 /* We need the updated flags value in the deref branch. */
676 if (flags & A_HINT_DEREF)
680 /* This op doesn't need to skip autovivification, so restore the original
682 PL_op->op_ppaddr = oi.old_pp;
684 return CALL_FPTR(oi.old_pp)(aTHX);
687 /* ... pp_root (exists,delete,keys,values) ................................. */
689 STATIC OP *a_pp_root_unop(pTHX) {
693 if (!a_defined(TOPs)) {
695 /* Can only be reached by keys or values */
696 if (GIMME_V == G_SCALAR) {
703 a_map_fetch(PL_op, &oi);
705 return CALL_FPTR(oi.old_pp)(aTHX);
708 STATIC OP *a_pp_root_binop(pTHX) {
712 if (!a_defined(TOPm1s)) {
715 if (PL_op->op_type == OP_EXISTS)
721 a_map_fetch(PL_op, &oi);
723 return CALL_FPTR(oi.old_pp)(aTHX);
726 /* --- Check functions ----------------------------------------------------- */
728 STATIC void a_recheck_rv2xv(pTHX_ OP *o, OPCODE type, OP *(*new_pp)(pTHX)) {
729 #define a_recheck_rv2xv(O, T, PP) a_recheck_rv2xv(aTHX_ (O), (T), (PP))
732 if (o->op_type == type && o->op_ppaddr != new_pp
733 && cUNOPo->op_first->op_type != OP_GV
734 && a_map_fetch(o, &oi)) {
735 a_map_store(o, o->op_ppaddr, oi.next, oi.flags);
736 o->op_ppaddr = new_pp;
742 /* ... ck_pad{any,sv} ...................................................... */
744 /* Sadly, the PADSV OPs we are interested in don't trigger the padsv check
745 * function, but are instead manually mutated from a PADANY. This is why we set
746 * PL_ppaddr[OP_PADSV] in the padany check function so that PADSV OPs will have
747 * their op_ppaddr set to our pp_padsv. PL_ppaddr[OP_PADSV] is then reset at the
748 * beginning of every ck_pad{any,sv}. Some unwanted OPs can still call our
749 * pp_padsv, but much less than if we would have set PL_ppaddr[OP_PADSV]
752 STATIC OP *(*a_pp_padsv_saved)(pTHX) = 0;
754 STATIC void a_pp_padsv_save(void) {
755 if (a_pp_padsv_saved)
758 a_pp_padsv_saved = PL_ppaddr[OP_PADSV];
759 PL_ppaddr[OP_PADSV] = a_pp_deref;
762 STATIC void a_pp_padsv_restore(OP *o) {
763 if (!a_pp_padsv_saved)
766 if (o->op_ppaddr == a_pp_deref)
767 o->op_ppaddr = a_pp_padsv_saved;
769 PL_ppaddr[OP_PADSV] = a_pp_padsv_saved;
770 a_pp_padsv_saved = 0;
773 STATIC OP *(*a_old_ck_padany)(pTHX_ OP *) = 0;
775 STATIC OP *a_ck_padany(pTHX_ OP *o) {
778 a_pp_padsv_restore(o);
780 o = CALL_FPTR(a_old_ck_padany)(aTHX_ o);
783 if (hint & A_HINT_DO) {
785 a_map_store_root(o, a_pp_padsv_saved, hint);
792 STATIC OP *(*a_old_ck_padsv)(pTHX_ OP *) = 0;
794 STATIC OP *a_ck_padsv(pTHX_ OP *o) {
797 a_pp_padsv_restore(o);
799 o = CALL_FPTR(a_old_ck_padsv)(aTHX_ o);
802 if (hint & A_HINT_DO) {
803 a_map_store_root(o, o->op_ppaddr, hint);
804 o->op_ppaddr = a_pp_deref;
811 /* ... ck_deref (aelem,helem,rv2sv) ........................................ */
813 /* Those ops appear both at the root and inside an expression but there's no
814 * way to distinguish both situations. Worse, we can't even know if we are in a
815 * modifying context, so the expression can't be resolved yet. It will be at the
816 * first invocation of a_pp_deref() for this expression. */
818 STATIC OP *(*a_old_ck_aelem)(pTHX_ OP *) = 0;
819 STATIC OP *(*a_old_ck_helem)(pTHX_ OP *) = 0;
820 STATIC OP *(*a_old_ck_rv2sv)(pTHX_ OP *) = 0;
822 STATIC OP *a_ck_deref(pTHX_ OP *o) {
823 OP * (*old_ck)(pTHX_ OP *o) = 0;
826 switch (o->op_type) {
828 old_ck = a_old_ck_aelem;
829 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
830 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2AV, a_pp_rv2av);
833 old_ck = a_old_ck_helem;
834 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
835 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2HV, a_pp_rv2hv_simple);
838 old_ck = a_old_ck_rv2sv;
841 o = CALL_FPTR(old_ck)(aTHX_ o);
843 if (hint & A_HINT_DO) {
844 a_map_store_root(o, o->op_ppaddr, hint);
845 o->op_ppaddr = a_pp_deref;
852 /* ... ck_rv2xv (rv2av,rv2hv) .............................................. */
854 /* Those ops also appear both inisde and at the root, hence the caveats for
855 * a_ck_deref() still apply here. Since a padsv/rv2sv must appear before a
856 * rv2[ah]v, resolution is handled by the first call to a_pp_deref() in the
859 STATIC OP *(*a_old_ck_rv2av)(pTHX_ OP *) = 0;
860 STATIC OP *(*a_old_ck_rv2hv)(pTHX_ OP *) = 0;
862 STATIC OP *a_ck_rv2xv(pTHX_ OP *o) {
863 OP * (*old_ck)(pTHX_ OP *o) = 0;
864 OP * (*new_pp)(pTHX) = 0;
867 switch (o->op_type) {
868 case OP_RV2AV: old_ck = a_old_ck_rv2av; new_pp = a_pp_rv2av; break;
869 case OP_RV2HV: old_ck = a_old_ck_rv2hv; new_pp = a_pp_rv2hv_simple; break;
871 o = CALL_FPTR(old_ck)(aTHX_ o);
873 if (cUNOPo->op_first->op_type == OP_GV)
877 if (hint & A_HINT_DO && !(hint & A_HINT_STRICT)) {
878 a_map_store_root(o, o->op_ppaddr, hint);
879 o->op_ppaddr = new_pp;
886 /* ... ck_xslice (aslice,hslice) ........................................... */
888 /* I think those are only found at the root, but there's nothing that really
889 * prevent them to be inside the expression too. We only need to update the
890 * root so that the rest of the expression will see the right context when
891 * resolving. That's why we don't replace the ppaddr. */
893 STATIC OP *(*a_old_ck_aslice)(pTHX_ OP *) = 0;
894 STATIC OP *(*a_old_ck_hslice)(pTHX_ OP *) = 0;
896 STATIC OP *a_ck_xslice(pTHX_ OP *o) {
897 OP * (*old_ck)(pTHX_ OP *o) = 0;
900 switch (o->op_type) {
902 old_ck = a_old_ck_aslice;
905 old_ck = a_old_ck_hslice;
906 if (hint & A_HINT_DO)
907 a_recheck_rv2xv(cUNOPo->op_first->op_sibling, OP_RV2HV, a_pp_rv2hv);
910 o = CALL_FPTR(old_ck)(aTHX_ o);
912 if (hint & A_HINT_DO) {
913 a_map_store_root(o, 0, hint);
920 /* ... ck_root (exists,delete,keys,values) ................................. */
922 /* Those ops are only found at the root of a dereferencing expression. We can
923 * then resolve at compile time if vivification must take place or not. */
925 STATIC OP *(*a_old_ck_exists)(pTHX_ OP *) = 0;
926 STATIC OP *(*a_old_ck_delete)(pTHX_ OP *) = 0;
927 STATIC OP *(*a_old_ck_keys) (pTHX_ OP *) = 0;
928 STATIC OP *(*a_old_ck_values)(pTHX_ OP *) = 0;
930 STATIC OP *a_ck_root(pTHX_ OP *o) {
931 OP * (*old_ck)(pTHX_ OP *o) = 0;
932 OP * (*new_pp)(pTHX) = 0;
933 bool enabled = FALSE;
936 switch (o->op_type) {
938 old_ck = a_old_ck_exists;
939 new_pp = a_pp_root_binop;
940 enabled = hint & A_HINT_EXISTS;
943 old_ck = a_old_ck_delete;
944 new_pp = a_pp_root_binop;
945 enabled = hint & A_HINT_DELETE;
948 old_ck = a_old_ck_keys;
949 new_pp = a_pp_root_unop;
950 enabled = hint & A_HINT_FETCH;
953 old_ck = a_old_ck_values;
954 new_pp = a_pp_root_unop;
955 enabled = hint & A_HINT_FETCH;
958 o = CALL_FPTR(old_ck)(aTHX_ o);
960 if (hint & A_HINT_DO) {
962 a_map_update_flags_topdown(o, hint | A_HINT_DEREF);
963 a_map_store_root(o, o->op_ppaddr, hint);
964 o->op_ppaddr = new_pp;
974 STATIC U32 a_initialized = 0;
976 STATIC void a_teardown(pTHX_ void *root) {
986 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
989 ptable_hints_free(MY_CXT.tbl);
993 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_old_ck_padany);
995 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_old_ck_padsv);
998 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_old_ck_aelem);
1000 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_old_ck_helem);
1002 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_old_ck_rv2sv);
1005 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_old_ck_rv2av);
1007 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_old_ck_rv2hv);
1010 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_old_ck_aslice);
1011 a_old_ck_aslice = 0;
1012 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_old_ck_hslice);
1013 a_old_ck_hslice = 0;
1015 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_old_ck_exists);
1016 a_old_ck_exists = 0;
1017 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_old_ck_delete);
1018 a_old_ck_delete = 0;
1019 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_old_ck_keys);
1021 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_old_ck_values);
1022 a_old_ck_values = 0;
1024 if (a_pp_padsv_saved) {
1025 PL_ppaddr[OP_PADSV] = a_pp_padsv_saved;
1026 a_pp_padsv_saved = 0;
1032 STATIC void a_setup(pTHX) {
1033 #define a_setup() a_setup(aTHX)
1037 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1040 MY_CXT.tbl = ptable_new();
1041 MY_CXT.owner = aTHX;
1045 a_old_ck_padany = PL_check[OP_PADANY];
1046 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_ck_padany);
1047 a_old_ck_padsv = PL_check[OP_PADSV];
1048 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_ck_padsv);
1050 a_old_ck_aelem = PL_check[OP_AELEM];
1051 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_ck_deref);
1052 a_old_ck_helem = PL_check[OP_HELEM];
1053 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_ck_deref);
1054 a_old_ck_rv2sv = PL_check[OP_RV2SV];
1055 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_ck_deref);
1057 a_old_ck_rv2av = PL_check[OP_RV2AV];
1058 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1059 a_old_ck_rv2hv = PL_check[OP_RV2HV];
1060 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1062 a_old_ck_aslice = PL_check[OP_ASLICE];
1063 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1064 a_old_ck_hslice = PL_check[OP_HSLICE];
1065 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1067 a_old_ck_exists = PL_check[OP_EXISTS];
1068 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_ck_root);
1069 a_old_ck_delete = PL_check[OP_DELETE];
1070 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_ck_root);
1071 a_old_ck_keys = PL_check[OP_KEYS];
1072 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_ck_root);
1073 a_old_ck_values = PL_check[OP_VALUES];
1074 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_ck_root);
1077 call_atexit(a_teardown, aTHX);
1079 call_atexit(a_teardown, NULL);
1085 STATIC U32 a_booted = 0;
1087 /* --- XS ------------------------------------------------------------------ */
1089 MODULE = autovivification PACKAGE = autovivification
1098 a_op_map = ptable_new();
1100 MUTEX_INIT(&a_op_map_mutex);
1103 PERL_HASH(a_hash, __PACKAGE__, __PACKAGE_LEN__);
1105 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1106 newCONSTSUB(stash, "A_HINT_STRICT", newSVuv(A_HINT_STRICT));
1107 newCONSTSUB(stash, "A_HINT_WARN", newSVuv(A_HINT_WARN));
1108 newCONSTSUB(stash, "A_HINT_FETCH", newSVuv(A_HINT_FETCH));
1109 newCONSTSUB(stash, "A_HINT_STORE", newSVuv(A_HINT_STORE));
1110 newCONSTSUB(stash, "A_HINT_EXISTS", newSVuv(A_HINT_EXISTS));
1111 newCONSTSUB(stash, "A_HINT_DELETE", newSVuv(A_HINT_DELETE));
1112 newCONSTSUB(stash, "A_HINT_MASK", newSVuv(A_HINT_MASK));
1113 newCONSTSUB(stash, "A_THREADSAFE", newSVuv(A_THREADSAFE));
1114 newCONSTSUB(stash, "A_FORKSAFE", newSVuv(A_FORKSAFE));
1120 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1132 ud.tbl = t = ptable_new();
1133 ud.owner = MY_CXT.owner;
1134 ptable_walk(MY_CXT.tbl, a_ptable_clone, &ud);
1139 MY_CXT.owner = aTHX;
1142 level = PerlMemShared_malloc(sizeof *level);
1145 SAVEDESTRUCTOR_X(a_thread_cleanup, level);
1155 RETVAL = a_tag(SvOK(hint) ? SvUV(hint) : 0);
1165 RETVAL = newSVuv(a_detag(tag));