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);
164 STATIC void a_thread_cleanup(pTHX_ void *ud) {
167 ptable_hints_free(MY_CXT.tbl);
170 #endif /* A_THREADSAFE */
172 STATIC IV a_require_tag(pTHX) {
173 #define a_require_tag() a_require_tag(aTHX)
174 const CV *cv, *outside;
179 /* If for some reason the pragma is operational at run-time, try to discover
180 * the current cv in use. */
183 for (si = PL_curstackinfo; si; si = si->si_prev) {
186 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
187 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
189 switch (CxTYPE(cx)) {
192 /* The propagation workaround is only needed up to 5.10.0 and at that
193 * time format and sub contexts were still identical. And even later the
194 * cv members offsets should have been kept the same. */
196 goto get_enclosing_cv;
198 cv = cx->blk_eval.cv;
199 goto get_enclosing_cv;
210 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
216 STATIC SV *a_tag(pTHX_ UV bits) {
217 #define a_tag(B) a_tag(aTHX_ (B))
221 h = PerlMemShared_malloc(sizeof *h);
223 h->require_tag = a_require_tag();
226 /* We only need for the key to be an unique tag for looking up the value later.
227 * Allocated memory provides convenient unique identifiers, so that's why we
228 * use the hint as the key itself. */
229 ptable_hints_store(MY_CXT.tbl, h, h);
230 #endif /* A_THREADSAFE */
232 return newSViv(PTR2IV(h));
235 STATIC UV a_detag(pTHX_ const SV *hint) {
236 #define a_detag(H) a_detag(aTHX_ (H))
240 if (!(hint && SvIOK(hint)))
243 h = INT2PTR(a_hint_t *, SvIVX(hint));
245 h = ptable_fetch(MY_CXT.tbl, h);
246 #endif /* A_THREADSAFE */
248 if (a_require_tag() != h->require_tag)
254 #else /* A_WORKAROUND_REQUIRE_PROPAGATION */
256 #define a_tag(B) newSVuv(B)
257 /* PVs fetched from the hints chain have their SvLEN set to zero, so get the UV
264 ? sv_2uv(SvLEN(H) ? (H) : sv_mortalcopy(H)) \
270 #endif /* !A_WORKAROUND_REQUIRE_PROPAGATION */
272 /* Used both for hints and op flags */
273 #define A_HINT_STRICT 1
274 #define A_HINT_WARN 2
275 #define A_HINT_FETCH 4
276 #define A_HINT_STORE 8
277 #define A_HINT_EXISTS 16
278 #define A_HINT_DELETE 32
279 #define A_HINT_NOTIFY (A_HINT_STRICT|A_HINT_WARN)
280 #define A_HINT_DO (A_HINT_FETCH|A_HINT_STORE|A_HINT_EXISTS|A_HINT_DELETE)
281 #define A_HINT_MASK (A_HINT_NOTIFY|A_HINT_DO)
283 /* Only used in op flags */
284 #define A_HINT_ROOT 64
285 #define A_HINT_DEREF 128
287 STATIC U32 a_hash = 0;
289 STATIC UV a_hint(pTHX) {
290 #define a_hint() a_hint(aTHX)
292 #if A_HAS_PERL(5, 9, 5)
293 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
295 __PACKAGE__, __PACKAGE_LEN__,
299 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, a_hash);
304 return a_detag(hint);
307 /* ... op => info map ...................................................... */
315 #define PTABLE_NAME ptable_map
316 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
320 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
321 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
323 STATIC ptable *a_op_map = NULL;
326 STATIC perl_mutex a_op_map_mutex;
329 STATIC const a_op_info *a_map_fetch(const OP *o, a_op_info *oi) {
330 const a_op_info *val;
333 MUTEX_LOCK(&a_op_map_mutex);
336 val = ptable_fetch(a_op_map, o);
343 MUTEX_UNLOCK(&a_op_map_mutex);
349 STATIC const a_op_info *a_map_store_locked(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
350 #define a_map_store_locked(O, PP, N, F) a_map_store_locked(aPTBLMS_ (O), (PP), (N), (F))
353 if (!(oi = ptable_fetch(a_op_map, o))) {
354 oi = PerlMemShared_malloc(sizeof *oi);
355 ptable_map_store(a_op_map, o, oi);
365 STATIC void a_map_store(pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), void *next, UV flags) {
366 #define a_map_store(O, PP, N, F) a_map_store(aPTBLMS_ (O), (PP), (N), (F))
369 MUTEX_LOCK(&a_op_map_mutex);
372 a_map_store_locked(o, old_pp, next, flags);
375 MUTEX_UNLOCK(&a_op_map_mutex);
379 STATIC void a_map_delete(pTHX_ const OP *o) {
380 #define a_map_delete(O) a_map_delete(aTHX_ (O))
382 MUTEX_LOCK(&a_op_map_mutex);
385 ptable_map_store(a_op_map, o, NULL);
388 MUTEX_UNLOCK(&a_op_map_mutex);
392 STATIC const OP *a_map_descend(const OP *o) {
393 switch (PL_opargs[o->op_type] & OA_CLASS_MASK) {
397 case OA_BASEOP_OR_UNOP:
398 return cUNOPo->op_first;
401 return cLISTOPo->op_last;
407 STATIC void a_map_store_root(pPTBLMS_ const OP *root, OP *(*old_pp)(pTHX), UV flags) {
408 #define a_map_store_root(R, PP, F) a_map_store_root(aPTBLMS_ (R), (PP), (F))
409 const a_op_info *roi;
414 MUTEX_LOCK(&a_op_map_mutex);
417 roi = a_map_store_locked(o, old_pp, (OP *) root, flags | A_HINT_ROOT);
419 while (o->op_flags & OPf_KIDS) {
420 o = a_map_descend(o);
423 if ((oi = ptable_fetch(a_op_map, o))) {
424 oi->flags &= ~A_HINT_ROOT;
425 oi->next = (a_op_info *) roi;
431 MUTEX_UNLOCK(&a_op_map_mutex);
437 STATIC void a_map_update_flags_topdown(const OP *root, UV flags) {
442 MUTEX_LOCK(&a_op_map_mutex);
445 flags &= ~A_HINT_ROOT;
448 if ((oi = ptable_fetch(a_op_map, o)))
449 oi->flags = (oi->flags & A_HINT_ROOT) | flags;
450 if (!(o->op_flags & OPf_KIDS))
452 o = a_map_descend(o);
456 MUTEX_UNLOCK(&a_op_map_mutex);
462 #define a_map_cancel(R) a_map_update_flags_topdown((R), 0)
464 STATIC void a_map_update_flags_bottomup(const OP *o, UV flags, UV rflags) {
468 MUTEX_LOCK(&a_op_map_mutex);
471 flags &= ~A_HINT_ROOT;
472 rflags |= A_HINT_ROOT;
474 oi = ptable_fetch(a_op_map, o);
475 while (!(oi->flags & A_HINT_ROOT)) {
482 MUTEX_UNLOCK(&a_op_map_mutex);
488 /* ... Decide whether this expression should be autovivified or not ........ */
490 STATIC UV a_map_resolve(const OP *o, a_op_info *oi) {
491 UV flags = 0, rflags;
495 while (!(roi->flags & A_HINT_ROOT))
500 rflags = roi->flags & ~A_HINT_ROOT;
505 if (root->op_flags & OPf_MOD) {
506 if (rflags & A_HINT_STORE)
507 flags = (A_HINT_STORE|A_HINT_DEREF);
508 } else if (rflags & A_HINT_FETCH)
509 flags = (A_HINT_FETCH|A_HINT_DEREF);
513 a_map_update_flags_bottomup(o, 0, 0);
517 flags |= (rflags & A_HINT_NOTIFY);
518 a_map_update_flags_bottomup(o, flags, 0);
520 return oi->flags & A_HINT_ROOT ? 0 : flags;
523 /* ... Inspired from pp_defined() .......................................... */
525 STATIC int a_undef(pTHX_ SV *sv) {
526 #define a_undef(S) a_undef(aTHX_ (S))
527 switch (SvTYPE(sv)) {
531 if (AvMAX(sv) >= 0 || SvGMAGICAL(sv)
532 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
536 if (HvARRAY(sv) || SvGMAGICAL(sv)
537 || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied)))
549 /* --- PP functions -------------------------------------------------------- */
551 /* Be aware that we restore PL_op->op_ppaddr from the pointer table old_pp
552 * value, another extension might have saved our pp replacement as the ppaddr
553 * for this op, so this doesn't ensure that our function will never be called
554 * again. That's why we don't remove the op info from our map, so that it can
555 * still run correctly if required. */
557 /* ... pp_rv2av ............................................................ */
559 STATIC OP *a_pp_rv2av(pTHX) {
564 a_map_fetch(PL_op, &oi);
567 if (flags & A_HINT_DEREF) {
569 /* We always need to push an empty array to fool the pp_aelem() that comes
573 av = sv_2mortal((SV *) newAV());
578 PL_op->op_ppaddr = oi.old_pp;
581 return CALL_FPTR(oi.old_pp)(aTHX);
584 /* ... pp_rv2hv ............................................................ */
586 STATIC OP *a_pp_rv2hv_simple(pTHX) {
591 a_map_fetch(PL_op, &oi);
594 if (flags & A_HINT_DEREF) {
598 PL_op->op_ppaddr = oi.old_pp;
601 return CALL_FPTR(oi.old_pp)(aTHX);
604 STATIC OP *a_pp_rv2hv(pTHX) {
609 a_map_fetch(PL_op, &oi);
612 if (flags & A_HINT_DEREF) {
616 hv = sv_2mortal((SV *) newHV());
621 PL_op->op_ppaddr = oi.old_pp;
624 return CALL_FPTR(oi.old_pp)(aTHX);
627 /* ... pp_deref (aelem,helem,rv2sv,padsv) .................................. */
629 STATIC OP *a_pp_deref(pTHX) {
634 a_map_fetch(PL_op, &oi);
637 if (flags & A_HINT_DEREF) {
642 old_private = PL_op->op_private;
643 PL_op->op_private = ((old_private & ~OPpDEREF) | OPpLVAL_DEFER);
644 o = CALL_FPTR(oi.old_pp)(aTHX);
645 PL_op->op_private = old_private;
647 if (flags & (A_HINT_NOTIFY|A_HINT_STORE)) {
650 if (flags & A_HINT_STRICT)
651 croak("Reference vivification forbidden");
652 else if (flags & A_HINT_WARN)
653 warn("Reference was vivified");
654 else /* A_HINT_STORE */
655 croak("Can't vivify reference");
660 } else if ((flags & ~A_HINT_ROOT)
661 && (PL_op->op_private & OPpDEREF || flags & A_HINT_ROOT)) {
662 /* Decide if the expression must autovivify or not.
663 * This branch should be called only once by expression. */
664 flags = a_map_resolve(PL_op, &oi);
666 /* We need the updated flags value in the deref branch. */
667 if (flags & A_HINT_DEREF)
671 /* This op doesn't need to skip autovivification, so restore the original
673 PL_op->op_ppaddr = oi.old_pp;
675 return CALL_FPTR(oi.old_pp)(aTHX);
678 /* ... pp_root (exists,delete,keys,values) ................................. */
680 STATIC OP *a_pp_root_unop(pTHX) {
686 /* Can only be reached by keys or values */
687 if (GIMME_V == G_SCALAR) {
694 a_map_fetch(PL_op, &oi);
696 return CALL_FPTR(oi.old_pp)(aTHX);
699 STATIC OP *a_pp_root_binop(pTHX) {
703 if (a_undef(TOPm1s)) {
706 if (PL_op->op_type == OP_EXISTS)
712 a_map_fetch(PL_op, &oi);
714 return CALL_FPTR(oi.old_pp)(aTHX);
717 /* --- Check functions ----------------------------------------------------- */
719 STATIC void a_recheck_rv2xv(pTHX_ OP *o, OPCODE type, OP *(*new_pp)(pTHX)) {
720 #define a_recheck_rv2xv(O, T, PP) a_recheck_rv2xv(aTHX_ (O), (T), (PP))
723 if (o->op_type == type && o->op_ppaddr != new_pp
724 && cUNOPo->op_first->op_type != OP_GV
725 && a_map_fetch(o, &oi)) {
726 a_map_store(o, o->op_ppaddr, oi.next, oi.flags);
727 o->op_ppaddr = new_pp;
733 /* ... ck_pad{any,sv} ...................................................... */
735 /* Sadly, the PADSV OPs we are interested in don't trigger the padsv check
736 * function, but are instead manually mutated from a PADANY. This is why we set
737 * PL_ppaddr[OP_PADSV] in the padany check function so that PADSV OPs will have
738 * their op_ppaddr set to our pp_padsv. PL_ppaddr[OP_PADSV] is then reset at the
739 * beginning of every ck_pad{any,sv}. Some unwanted OPs can still call our
740 * pp_padsv, but much less than if we would have set PL_ppaddr[OP_PADSV]
743 STATIC OP *(*a_pp_padsv_saved)(pTHX) = 0;
745 STATIC void a_pp_padsv_save(void) {
746 if (a_pp_padsv_saved)
749 a_pp_padsv_saved = PL_ppaddr[OP_PADSV];
750 PL_ppaddr[OP_PADSV] = a_pp_deref;
753 STATIC void a_pp_padsv_restore(OP *o) {
754 if (!a_pp_padsv_saved)
757 if (o->op_ppaddr == a_pp_deref)
758 o->op_ppaddr = a_pp_padsv_saved;
760 PL_ppaddr[OP_PADSV] = a_pp_padsv_saved;
761 a_pp_padsv_saved = 0;
764 STATIC OP *(*a_old_ck_padany)(pTHX_ OP *) = 0;
766 STATIC OP *a_ck_padany(pTHX_ OP *o) {
769 a_pp_padsv_restore(o);
771 o = CALL_FPTR(a_old_ck_padany)(aTHX_ o);
774 if (hint & A_HINT_DO) {
776 a_map_store_root(o, a_pp_padsv_saved, hint);
783 STATIC OP *(*a_old_ck_padsv)(pTHX_ OP *) = 0;
785 STATIC OP *a_ck_padsv(pTHX_ OP *o) {
788 a_pp_padsv_restore(o);
790 o = CALL_FPTR(a_old_ck_padsv)(aTHX_ o);
793 if (hint & A_HINT_DO) {
794 a_map_store_root(o, o->op_ppaddr, hint);
795 o->op_ppaddr = a_pp_deref;
802 /* ... ck_deref (aelem,helem,rv2sv) ........................................ */
804 /* Those ops appear both at the root and inside an expression but there's no
805 * way to distinguish both situations. Worse, we can't even know if we are in a
806 * modifying context, so the expression can't be resolved yet. It will be at the
807 * first invocation of a_pp_deref() for this expression. */
809 STATIC OP *(*a_old_ck_aelem)(pTHX_ OP *) = 0;
810 STATIC OP *(*a_old_ck_helem)(pTHX_ OP *) = 0;
811 STATIC OP *(*a_old_ck_rv2sv)(pTHX_ OP *) = 0;
813 STATIC OP *a_ck_deref(pTHX_ OP *o) {
814 OP * (*old_ck)(pTHX_ OP *o) = 0;
817 switch (o->op_type) {
819 old_ck = a_old_ck_aelem;
820 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
821 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2AV, a_pp_rv2av);
824 old_ck = a_old_ck_helem;
825 if ((hint & A_HINT_DO) && !(hint & A_HINT_STRICT))
826 a_recheck_rv2xv(cUNOPo->op_first, OP_RV2HV, a_pp_rv2hv_simple);
829 old_ck = a_old_ck_rv2sv;
832 o = CALL_FPTR(old_ck)(aTHX_ o);
834 if (hint & A_HINT_DO) {
835 a_map_store_root(o, o->op_ppaddr, hint);
836 o->op_ppaddr = a_pp_deref;
843 /* ... ck_rv2xv (rv2av,rv2hv) .............................................. */
845 /* Those ops also appear both inisde and at the root, hence the caveats for
846 * a_ck_deref() still apply here. Since a padsv/rv2sv must appear before a
847 * rv2[ah]v, resolution is handled by the first call to a_pp_deref() in the
850 STATIC OP *(*a_old_ck_rv2av)(pTHX_ OP *) = 0;
851 STATIC OP *(*a_old_ck_rv2hv)(pTHX_ OP *) = 0;
853 STATIC OP *a_ck_rv2xv(pTHX_ OP *o) {
854 OP * (*old_ck)(pTHX_ OP *o) = 0;
855 OP * (*new_pp)(pTHX) = 0;
858 switch (o->op_type) {
859 case OP_RV2AV: old_ck = a_old_ck_rv2av; new_pp = a_pp_rv2av; break;
860 case OP_RV2HV: old_ck = a_old_ck_rv2hv; new_pp = a_pp_rv2hv_simple; break;
862 o = CALL_FPTR(old_ck)(aTHX_ o);
864 if (cUNOPo->op_first->op_type == OP_GV)
868 if (hint & A_HINT_DO && !(hint & A_HINT_STRICT)) {
869 a_map_store_root(o, o->op_ppaddr, hint);
870 o->op_ppaddr = new_pp;
877 /* ... ck_xslice (aslice,hslice) ........................................... */
879 /* I think those are only found at the root, but there's nothing that really
880 * prevent them to be inside the expression too. We only need to update the
881 * root so that the rest of the expression will see the right context when
882 * resolving. That's why we don't replace the ppaddr. */
884 STATIC OP *(*a_old_ck_aslice)(pTHX_ OP *) = 0;
885 STATIC OP *(*a_old_ck_hslice)(pTHX_ OP *) = 0;
887 STATIC OP *a_ck_xslice(pTHX_ OP *o) {
888 OP * (*old_ck)(pTHX_ OP *o) = 0;
891 switch (o->op_type) {
893 old_ck = a_old_ck_aslice;
896 old_ck = a_old_ck_hslice;
897 if (hint & A_HINT_DO)
898 a_recheck_rv2xv(cUNOPo->op_first->op_sibling, OP_RV2HV, a_pp_rv2hv);
901 o = CALL_FPTR(old_ck)(aTHX_ o);
903 if (hint & A_HINT_DO) {
904 a_map_store_root(o, 0, hint);
911 /* ... ck_root (exists,delete,keys,values) ................................. */
913 /* Those ops are only found at the root of a dereferencing expression. We can
914 * then resolve at compile time if vivification must take place or not. */
916 STATIC OP *(*a_old_ck_exists)(pTHX_ OP *) = 0;
917 STATIC OP *(*a_old_ck_delete)(pTHX_ OP *) = 0;
918 STATIC OP *(*a_old_ck_keys) (pTHX_ OP *) = 0;
919 STATIC OP *(*a_old_ck_values)(pTHX_ OP *) = 0;
921 STATIC OP *a_ck_root(pTHX_ OP *o) {
922 OP * (*old_ck)(pTHX_ OP *o) = 0;
923 OP * (*new_pp)(pTHX) = 0;
924 bool enabled = FALSE;
927 switch (o->op_type) {
929 old_ck = a_old_ck_exists;
930 new_pp = a_pp_root_binop;
931 enabled = hint & A_HINT_EXISTS;
934 old_ck = a_old_ck_delete;
935 new_pp = a_pp_root_binop;
936 enabled = hint & A_HINT_DELETE;
939 old_ck = a_old_ck_keys;
940 new_pp = a_pp_root_unop;
941 enabled = hint & A_HINT_FETCH;
944 old_ck = a_old_ck_values;
945 new_pp = a_pp_root_unop;
946 enabled = hint & A_HINT_FETCH;
949 o = CALL_FPTR(old_ck)(aTHX_ o);
951 if (hint & A_HINT_DO) {
953 a_map_update_flags_topdown(o, hint | A_HINT_DEREF);
954 a_map_store_root(o, o->op_ppaddr, hint);
955 o->op_ppaddr = new_pp;
965 STATIC U32 a_initialized = 0;
967 STATIC void a_teardown(pTHX_ void *root) {
977 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
980 ptable_hints_free(MY_CXT.tbl);
984 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_old_ck_padany);
986 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_old_ck_padsv);
989 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_old_ck_aelem);
991 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_old_ck_helem);
993 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_old_ck_rv2sv);
996 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_old_ck_rv2av);
998 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_old_ck_rv2hv);
1001 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_old_ck_aslice);
1002 a_old_ck_aslice = 0;
1003 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_old_ck_hslice);
1004 a_old_ck_hslice = 0;
1006 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_old_ck_exists);
1007 a_old_ck_exists = 0;
1008 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_old_ck_delete);
1009 a_old_ck_delete = 0;
1010 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_old_ck_keys);
1012 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_old_ck_values);
1013 a_old_ck_values = 0;
1015 if (a_pp_padsv_saved) {
1016 PL_ppaddr[OP_PADSV] = a_pp_padsv_saved;
1017 a_pp_padsv_saved = 0;
1023 STATIC void a_setup(pTHX) {
1024 #define a_setup() a_setup(aTHX)
1028 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1031 MY_CXT.tbl = ptable_new();
1032 MY_CXT.owner = aTHX;
1036 a_old_ck_padany = PL_check[OP_PADANY];
1037 PL_check[OP_PADANY] = MEMBER_TO_FPTR(a_ck_padany);
1038 a_old_ck_padsv = PL_check[OP_PADSV];
1039 PL_check[OP_PADSV] = MEMBER_TO_FPTR(a_ck_padsv);
1041 a_old_ck_aelem = PL_check[OP_AELEM];
1042 PL_check[OP_AELEM] = MEMBER_TO_FPTR(a_ck_deref);
1043 a_old_ck_helem = PL_check[OP_HELEM];
1044 PL_check[OP_HELEM] = MEMBER_TO_FPTR(a_ck_deref);
1045 a_old_ck_rv2sv = PL_check[OP_RV2SV];
1046 PL_check[OP_RV2SV] = MEMBER_TO_FPTR(a_ck_deref);
1048 a_old_ck_rv2av = PL_check[OP_RV2AV];
1049 PL_check[OP_RV2AV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1050 a_old_ck_rv2hv = PL_check[OP_RV2HV];
1051 PL_check[OP_RV2HV] = MEMBER_TO_FPTR(a_ck_rv2xv);
1053 a_old_ck_aslice = PL_check[OP_ASLICE];
1054 PL_check[OP_ASLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1055 a_old_ck_hslice = PL_check[OP_HSLICE];
1056 PL_check[OP_HSLICE] = MEMBER_TO_FPTR(a_ck_xslice);
1058 a_old_ck_exists = PL_check[OP_EXISTS];
1059 PL_check[OP_EXISTS] = MEMBER_TO_FPTR(a_ck_root);
1060 a_old_ck_delete = PL_check[OP_DELETE];
1061 PL_check[OP_DELETE] = MEMBER_TO_FPTR(a_ck_root);
1062 a_old_ck_keys = PL_check[OP_KEYS];
1063 PL_check[OP_KEYS] = MEMBER_TO_FPTR(a_ck_root);
1064 a_old_ck_values = PL_check[OP_VALUES];
1065 PL_check[OP_VALUES] = MEMBER_TO_FPTR(a_ck_root);
1068 call_atexit(a_teardown, aTHX);
1070 call_atexit(a_teardown, NULL);
1076 STATIC U32 a_booted = 0;
1078 /* --- XS ------------------------------------------------------------------ */
1080 MODULE = autovivification PACKAGE = autovivification
1089 a_op_map = ptable_new();
1091 MUTEX_INIT(&a_op_map_mutex);
1094 PERL_HASH(a_hash, __PACKAGE__, __PACKAGE_LEN__);
1096 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1097 newCONSTSUB(stash, "A_HINT_STRICT", newSVuv(A_HINT_STRICT));
1098 newCONSTSUB(stash, "A_HINT_WARN", newSVuv(A_HINT_WARN));
1099 newCONSTSUB(stash, "A_HINT_FETCH", newSVuv(A_HINT_FETCH));
1100 newCONSTSUB(stash, "A_HINT_STORE", newSVuv(A_HINT_STORE));
1101 newCONSTSUB(stash, "A_HINT_EXISTS", newSVuv(A_HINT_EXISTS));
1102 newCONSTSUB(stash, "A_HINT_DELETE", newSVuv(A_HINT_DELETE));
1103 newCONSTSUB(stash, "A_HINT_MASK", newSVuv(A_HINT_MASK));
1104 newCONSTSUB(stash, "A_THREADSAFE", newSVuv(A_THREADSAFE));
1105 newCONSTSUB(stash, "A_FORKSAFE", newSVuv(A_FORKSAFE));
1111 #if A_THREADSAFE && A_WORKAROUND_REQUIRE_PROPAGATION
1122 ud.tbl = t = ptable_new();
1123 ud.owner = MY_CXT.owner;
1124 ptable_walk(MY_CXT.tbl, a_ptable_clone, &ud);
1129 MY_CXT.owner = aTHX;
1131 reap(3, a_thread_cleanup, NULL);
1140 RETVAL = a_tag(SvOK(hint) ? SvUV(hint) : 0);
1150 RETVAL = newSVuv(a_detag(tag));