1 /* This file is part of the Lexical-Types Perl module.
2 * See http://search.cpan.org/dist/Lexical-Types/ */
4 #define PERL_NO_GET_CONTEXT
9 #define __PACKAGE__ "Lexical::Types"
10 #define __PACKAGE_LEN__ (sizeof(__PACKAGE__)-1)
12 /* --- Compatibility wrappers ---------------------------------------------- */
14 #define LT_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
16 #if LT_HAS_PERL(5, 10, 0) || defined(PL_parser)
17 # ifndef PL_in_my_stash
18 # define PL_in_my_stash PL_parser->in_my_stash
19 # define PL_tokenbuf PL_parser->tokenbuf
22 # ifndef PL_in_my_stash
23 # define PL_in_my_stash PL_Iin_my_stash
24 # define PL_tokenbuf PL_Itokenbuf
28 #ifndef LT_WORKAROUND_REQUIRE_PROPAGATION
29 # define LT_WORKAROUND_REQUIRE_PROPAGATION !LT_HAS_PERL(5, 10, 1)
33 # define LT_HAS_RPEEP LT_HAS_PERL(5, 13, 5)
37 # define STR_WITH_LEN(s) ("" s ""), (sizeof(s)-1)
41 # define newSVpvs(S) Perl_newSVpvn(aTHX_ STR_WITH_LEN(S))
45 # define HvNAME_get(H) HvNAME(H)
49 # define HvNAMELEN_get(H) strlen(HvNAME_get(H))
52 #ifndef SvREFCNT_inc_simple_void_NN
53 # define SvREFCNT_inc_simple_void_NN(S) ((void) SvREFCNT_inc(S))
56 /* ... Thread safety and multiplicity ...................................... */
58 /* Safe unless stated otherwise in Makefile.PL */
60 # define LT_FORKSAFE 1
63 #ifndef LT_MULTIPLICITY
64 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
65 # define LT_MULTIPLICITY 1
67 # define LT_MULTIPLICITY 0
72 # define tTHX PerlInterpreter*
75 #if LT_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))
76 # define LT_THREADSAFE 1
78 # define MY_CXT_CLONE \
80 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
81 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
82 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
85 # define LT_THREADSAFE 0
87 # define dMY_CXT dNOOP
89 # define MY_CXT lt_globaldata
91 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
93 # define MY_CXT_INIT NOOP
95 # define MY_CXT_CLONE NOOP
106 #if defined(OP_CHECK_MUTEX_LOCK) && defined(OP_CHECK_MUTEX_UNLOCK)
107 # define LT_CHECK_MUTEX_LOCK OP_CHECK_MUTEX_LOCK
108 # define LT_CHECK_MUTEX_UNLOCK OP_CHECK_MUTEX_UNLOCK
110 # define LT_CHECK_MUTEX_LOCK OP_REFCNT_LOCK
111 # define LT_CHECK_MUTEX_UNLOCK OP_REFCNT_UNLOCK
114 typedef OP *(*lt_ck_t)(pTHX_ OP *);
116 #ifdef wrap_op_checker
118 # define lt_ck_replace(T, NC, OCP) wrap_op_checker((T), (NC), (OCP))
122 STATIC void lt_ck_replace(pTHX_ OPCODE type, lt_ck_t new_ck, lt_ck_t *old_ck_p){
123 #define lt_ck_replace(T, NC, OCP) lt_ck_replace(aTHX_ (T), (NC), (OCP))
126 *old_ck_p = PL_check[type];
127 PL_check[type] = new_ck;
129 LT_CHECK_MUTEX_UNLOCK;
134 STATIC void lt_ck_restore(pTHX_ OPCODE type, lt_ck_t *old_ck_p) {
135 #define lt_ck_restore(T, OCP) lt_ck_restore(aTHX_ (T), (OCP))
138 PL_check[type] = *old_ck_p;
141 LT_CHECK_MUTEX_UNLOCK;
144 /* --- Helpers ------------------------------------------------------------- */
146 /* ... Thread-safe hints ................................................... */
148 #if LT_WORKAROUND_REQUIRE_PROPAGATION
155 #define LT_HINT_STRUCT 1
157 #define LT_HINT_CODE(H) ((H)->code)
159 #define LT_HINT_FREE(H) { \
160 lt_hint_t *h = (H); \
161 SvREFCNT_dec(h->code); \
162 PerlMemShared_free(h); \
165 #else /* LT_WORKAROUND_REQUIRE_PROPAGATION */
167 typedef SV lt_hint_t;
169 #define LT_HINT_STRUCT 0
171 #define LT_HINT_CODE(H) (H)
173 #define LT_HINT_FREE(H) SvREFCNT_dec(H);
175 #endif /* !LT_WORKAROUND_REQUIRE_PROPAGATION */
179 #define PTABLE_NAME ptable_hints
180 #define PTABLE_VAL_FREE(V) LT_HINT_FREE(V)
189 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
190 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
192 #endif /* LT_THREADSAFE */
194 /* ... "Seen" pointer table ................................................ */
196 #define PTABLE_NAME ptable_seen
197 #define PTABLE_VAL_FREE(V) NOOP
201 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
202 #define ptable_seen_store(T, K, V) ptable_seen_store(aPTBLMS_ (T), (K), (V))
203 #define ptable_seen_clear(T) ptable_seen_clear(aPTBLMS_ (T))
204 #define ptable_seen_free(T) ptable_seen_free(aPTBLMS_ (T))
206 /* ... Global data ......................................................... */
208 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
210 #define LT_TYPE_SCALAR 0
212 #if LT_HAS_PERL(5, 11, 1)
214 #define LT_TYPE_ARRAY 1
215 #define LT_TYPE_HASH 2
217 #define LT_TYPE_COUNT 3
221 #define LT_TYPE_COUNT 1
227 ptable *tbl; /* It really is a ptable_hints */
230 ptable *seen; /* It really is a ptable_seen */
231 SV *default_meth[LT_TYPE_COUNT];
236 /* ... Cloning global data ................................................. */
242 #if LT_HAS_PERL(5, 13, 2)
243 CLONE_PARAMS *params;
247 } lt_ptable_clone_ud;
249 #if LT_HAS_PERL(5, 13, 2)
250 # define lt_ptable_clone_ud_init(U, T, O) \
252 (U).params = Perl_clone_params_new((O), aTHX)
253 # define lt_ptable_clone_ud_deinit(U) Perl_clone_params_del((U).params)
254 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), (U)->params))
256 # define lt_ptable_clone_ud_init(U, T, O) \
258 (U).params.stashes = newAV(); \
259 (U).params.flags = 0; \
260 (U).params.proto_perl = (O)
261 # define lt_ptable_clone_ud_deinit(U) SvREFCNT_dec((U).params.stashes)
262 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), &((U)->params)))
265 STATIC void lt_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
266 lt_ptable_clone_ud *ud = ud_;
267 lt_hint_t *h1 = ent->val;
272 h2 = PerlMemShared_malloc(sizeof *h2);
273 h2->code = lt_dup_inc(h1->code, ud);
274 #if LT_WORKAROUND_REQUIRE_PROPAGATION
275 h2->require_tag = PTR2IV(lt_dup_inc(INT2PTR(SV *, h1->require_tag), ud));
278 #else /* LT_HINT_STRUCT */
280 h2 = lt_dup_inc(h1, ud);
282 #endif /* !LT_HINT_STRUCT */
284 ptable_hints_store(ud->tbl, ent->key, h2);
289 STATIC void lt_thread_cleanup(pTHX_ void *ud) {
292 ptable_hints_free(MY_CXT.tbl);
293 ptable_seen_free(MY_CXT.seen);
296 #endif /* LT_THREADSAFE */
298 /* ... Hint tags ........................................................... */
300 #if LT_WORKAROUND_REQUIRE_PROPAGATION
302 STATIC IV lt_require_tag(pTHX) {
303 #define lt_require_tag() lt_require_tag(aTHX)
304 const CV *cv, *outside;
309 /* If for some reason the pragma is operational at run-time, try to discover
310 * the current cv in use. */
313 for (si = PL_curstackinfo; si; si = si->si_prev) {
316 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
317 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
319 switch (CxTYPE(cx)) {
322 /* The propagation workaround is only needed up to 5.10.0 and at that
323 * time format and sub contexts were still identical. And even later the
324 * cv members offsets should have been kept the same. */
326 goto get_enclosing_cv;
328 cv = cx->blk_eval.cv;
329 goto get_enclosing_cv;
340 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
346 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
348 STATIC SV *lt_tag(pTHX_ SV *value) {
349 #define lt_tag(V) lt_tag(aTHX_ (V))
355 if (SvTYPE(value) >= SVt_PVCV) {
357 SvREFCNT_inc_simple_void_NN(code);
362 h = PerlMemShared_malloc(sizeof *h);
364 # if LT_WORKAROUND_REQUIRE_PROPAGATION
365 h->require_tag = lt_require_tag();
366 # endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
367 #else /* LT_HINT_STRUCT */
369 #endif /* !LT_HINT_STRUCT */
374 /* We only need for the key to be an unique tag for looking up the value later
375 * Allocated memory provides convenient unique identifiers, so that's why we
376 * use the hint as the key itself. */
377 ptable_hints_store(MY_CXT.tbl, h, h);
379 #endif /* LT_THREADSAFE */
381 return newSViv(PTR2IV(h));
384 STATIC SV *lt_detag(pTHX_ const SV *hint) {
385 #define lt_detag(H) lt_detag(aTHX_ (H))
391 if (!(hint && SvIOK(hint)))
394 h = INT2PTR(lt_hint_t *, SvIVX(hint));
396 h = ptable_fetch(MY_CXT.tbl, h);
397 #endif /* LT_THREADSAFE */
398 #if LT_WORKAROUND_REQUIRE_PROPAGATION
399 if (lt_require_tag() != h->require_tag)
401 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
403 return LT_HINT_CODE(h);
406 STATIC U32 lt_hash = 0;
408 STATIC SV *lt_hint(pTHX) {
409 #define lt_hint() lt_hint(aTHX)
411 #ifdef cop_hints_fetch_pvn
412 hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__, lt_hash,0);
413 #elif LT_HAS_PERL(5, 9, 5)
414 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
416 __PACKAGE__, __PACKAGE_LEN__,
420 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, 0);
425 return lt_detag(hint);
428 /* ... op => info map ...................................................... */
430 #define PTABLE_NAME ptable_map
431 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
435 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
436 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
437 #define ptable_map_delete(T, K) ptable_map_delete(aPTBLMS_ (T), (K))
441 STATIC perl_mutex lt_op_map_mutex;
443 #define LT_LOCK(M) MUTEX_LOCK(M)
444 #define LT_UNLOCK(M) MUTEX_UNLOCK(M)
446 #else /* USE_ITHREADS */
451 #endif /* !USE_ITHREADS */
453 STATIC ptable *lt_op_padxv_map = NULL;
458 STRLEN buf_size, orig_pkg_len, type_pkg_len, type_meth_len;
460 #else /* MULTIPLICITY */
464 #endif /* !MULTIPLICITY */
467 STATIC const char lt_type_desc_scalar[] = "scalar";
468 STATIC const char lt_type_desc_array[] = "array";
469 STATIC const char lt_type_desc_hash[] = "hash";
471 STATIC void lt_op_padxv_info_call(pTHX_ const lt_op_padxv_info *oi, SV *sv) {
472 #define lt_op_padxv_info_call(O, S) lt_op_padxv_info_call(aTHX_ (O), (S))
473 SV *orig_pkg, *type_pkg, *type_meth;
483 STRLEN op_len = oi->orig_pkg_len, tp_len = oi->type_pkg_len;
485 orig_pkg = sv_2mortal(newSVpvn(buf, op_len));
486 SvREADONLY_on(orig_pkg);
488 type_pkg = sv_2mortal(newSVpvn(buf, tp_len));
489 SvREADONLY_on(type_pkg);
491 type_meth = sv_2mortal(newSVpvn(buf, oi->type_meth_len));
492 SvREADONLY_on(type_meth);
494 #else /* MULTIPLICITY */
495 orig_pkg = oi->orig_pkg;
496 type_pkg = oi->type_pkg;
497 type_meth = oi->type_meth;
498 #endif /* !MULTIPLICITY */
503 var_type = SvTYPE(sv);
507 PUSHs(sv_2mortal(newRV_inc(sv)));
516 items = call_sv(type_meth, G_ARRAY | G_METHOD);
526 if (SvROK(rsv) && SvTYPE(SvRV(rsv)) == var_type) {
527 AV *av = (AV *) SvRV(rsv);
529 I32 len = av_len(av);
531 av_fill((AV *) sv, len);
534 for (i = 0; i <= len; ++i, ++src, ++dst) {
536 *dst = SvREFCNT_inc(*src);
543 if (SvROK(rsv) && SvTYPE(SvRV(rsv)) == var_type) {
544 HV *hv = (HV *) SvRV(rsv);
548 while ((he = hv_iternext(hv)) != NULL) {
549 SV *val = SvREFCNT_inc(HeVAL(he));
550 if (!hv_store((HV *) sv, HeKEY(he), HeKLEN(he), val, HeHASH(he)))
563 croak("Type mismatch");
566 const char *type_desc;
569 type_desc = lt_type_desc_array;
572 type_desc = lt_type_desc_hash;
575 type_desc = lt_type_desc_scalar;
578 croak("Typed %s initializer method should return zero or one scalar, but got %d", type_desc, items);
589 STATIC void lt_padxv_map_store(pTHX_ const OP *o, SV *orig_pkg, SV *type_pkg, SV *type_meth, OP *(*old_pp)(pTHX)) {
590 #define lt_padxv_map_store(O, OP, TP, TM, PP) lt_padxv_map_store(aTHX_ (O), (OP), (TP), (TM), (PP))
591 lt_op_padxv_info *oi;
593 LT_LOCK(<_op_map_mutex);
595 if (!(oi = ptable_fetch(lt_op_padxv_map, o))) {
596 oi = PerlMemShared_malloc(sizeof *oi);
597 ptable_map_store(lt_op_padxv_map, o, oi);
601 #else /* MULTIPLICITY */
603 SvREFCNT_dec(oi->orig_pkg);
604 SvREFCNT_dec(oi->type_pkg);
605 SvREFCNT_dec(oi->type_meth);
606 #endif /* !MULTIPLICITY */
611 STRLEN op_len = SvCUR(orig_pkg);
612 STRLEN tp_len = SvCUR(type_pkg);
613 STRLEN tm_len = SvCUR(type_meth);
614 STRLEN new_buf_size = op_len + tp_len + tm_len;
616 if (new_buf_size > oi->buf_size) {
617 PerlMemShared_free(oi->buf);
618 oi->buf = PerlMemShared_malloc(new_buf_size);
619 oi->buf_size = new_buf_size;
622 Copy(SvPVX(orig_pkg), buf, op_len, char);
624 Copy(SvPVX(type_pkg), buf, tp_len, char);
626 Copy(SvPVX(type_meth), buf, tm_len, char);
627 oi->orig_pkg_len = op_len;
628 oi->type_pkg_len = tp_len;
629 oi->type_meth_len = tm_len;
630 SvREFCNT_dec(orig_pkg);
631 SvREFCNT_dec(type_pkg);
632 SvREFCNT_dec(type_meth);
634 #else /* MULTIPLICITY */
635 oi->orig_pkg = orig_pkg;
636 oi->type_pkg = type_pkg;
637 oi->type_meth = type_meth;
638 #endif /* !MULTIPLICITY */
642 LT_UNLOCK(<_op_map_mutex);
645 STATIC const lt_op_padxv_info *lt_padxv_map_fetch(const OP *o, lt_op_padxv_info *oi) {
646 const lt_op_padxv_info *val;
648 LT_LOCK(<_op_map_mutex);
650 val = ptable_fetch(lt_op_padxv_map, o);
656 LT_UNLOCK(<_op_map_mutex);
661 #if LT_HAS_PERL(5, 17, 6)
663 STATIC ptable *lt_op_padrange_map = NULL;
667 const OP *padxv_start;
668 } lt_op_padrange_info;
670 STATIC void lt_padrange_map_store(pTHX_ const OP *o, const OP *s, OP *(*old_pp)(pTHX)) {
671 #define lt_padrange_map_store(O, S, PP) lt_padrange_map_store(aTHX_ (O), (S), (PP))
672 lt_op_padrange_info *oi;
674 LT_LOCK(<_op_map_mutex);
676 if (!(oi = ptable_fetch(lt_op_padrange_map, o))) {
677 oi = PerlMemShared_malloc(sizeof *oi);
678 ptable_map_store(lt_op_padrange_map, o, oi);
684 LT_UNLOCK(<_op_map_mutex);
687 STATIC const lt_op_padrange_info *lt_padrange_map_fetch(const OP *o, lt_op_padrange_info *oi) {
688 const lt_op_padrange_info *val;
690 LT_LOCK(<_op_map_mutex);
692 val = ptable_fetch(lt_op_padrange_map, o);
698 LT_UNLOCK(<_op_map_mutex);
705 STATIC void lt_map_delete(pTHX_ const OP *o) {
706 #define lt_map_delete(O) lt_map_delete(aTHX_ (O))
707 LT_LOCK(<_op_map_mutex);
709 ptable_map_delete(lt_op_padxv_map, o);
710 #if LT_HAS_PERL(5, 17, 6)
711 ptable_map_delete(lt_op_padrange_map, o);
714 LT_UNLOCK(<_op_map_mutex);
717 /* --- Hooks --------------------------------------------------------------- */
719 /* ... Our pp_padsv ........................................................ */
721 STATIC OP *lt_pp_padxv(pTHX) {
724 if (lt_padxv_map_fetch(PL_op, &oi)) {
726 lt_op_padxv_info_call(&oi, TARG);
727 return oi.old_pp(aTHX);
730 return PL_op->op_ppaddr(aTHX);
733 /* ... Our pp_padrange (on perl 5.17.6 and above) .......................... */
735 #if LT_HAS_PERL(5, 17, 6)
737 STATIC OP *lt_pp_padrange(pTHX) {
738 lt_op_padrange_info roi;
740 if (lt_padrange_map_fetch(PL_op, &roi)) {
741 PADOFFSET i, base, count;
744 base = PL_op->op_targ;
745 count = PL_op->op_private & OPpPADRANGE_COUNTMASK;
747 for (i = 0, p = roi.padxv_start; i < count && p; ++i, p = p->op_sibling) {
750 switch (p->op_type) {
752 #if LT_HAS_PERL(5, 11, 1)
756 if (lt_padxv_map_fetch(p, &oi))
757 lt_op_padxv_info_call(&oi, PAD_SV(base + i));
764 return roi.old_pp(aTHX);
767 return PL_op->op_ppaddr(aTHX);
772 /* ... Our ck_pad{any,sv,av,hv} ............................................ */
774 /* Sadly, the padxv OPs we are interested in don't trigger the padxv check
775 * functions, but are instead manually mutated from a padany. So we store
776 * the op entry in the op map in the padany check function, and we set their
777 * op_ppaddr member in our peephole optimizer replacement below. */
779 STATIC OP *(*lt_old_ck_padany)(pTHX_ OP *) = 0;
781 STATIC OP *lt_ck_padany(pTHX_ OP *o) {
785 o = lt_old_ck_padany(aTHX_ o);
787 stash = PL_in_my_stash;
788 if (stash && (code = lt_hint())) {
790 SV *orig_pkg = newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash));
791 SV *orig_meth = NULL;
793 SV *type_meth = NULL;
799 while (*s && isSPACE(*s))
803 type = LT_TYPE_SCALAR;
805 #if LT_HAS_PERL(5, 11, 1)
807 type = LT_TYPE_ARRAY;
814 croak("Unsupported sigil '%c'", *s);
817 orig_meth = MY_CXT.default_meth[type];
821 SvREADONLY_on(orig_pkg);
832 items = call_sv(code, G_ARRAY);
836 croak(__PACKAGE__ " mangler should return zero, one or two scalars, but got %d", items);
838 SvREFCNT_dec(orig_pkg);
847 type_meth = newSVsv(rsv);
848 SvREADONLY_on(type_meth);
853 type_pkg = newSVsv(rsv);
854 SvREADONLY_on(type_pkg);
864 SvREFCNT_inc_simple_void_NN(orig_pkg);
868 type_meth = orig_meth;
869 SvREFCNT_inc_simple_void_NN(orig_meth);
872 lt_padxv_map_store(o, orig_pkg, type_pkg, type_meth, o->op_ppaddr);
881 STATIC OP *(*lt_old_ck_padsv)(pTHX_ OP *) = 0;
883 STATIC OP *lt_ck_padsv(pTHX_ OP *o) {
886 return lt_old_ck_padsv(aTHX_ o);
889 #if LT_HAS_PERL(5, 11, 1)
891 STATIC OP *(*lt_old_ck_padav)(pTHX_ OP *) = 0;
893 STATIC OP *lt_ck_padav(pTHX_ OP *o) {
896 return lt_old_ck_padav(aTHX_ o);
899 STATIC OP *(*lt_old_ck_padhv)(pTHX_ OP *) = 0;
901 STATIC OP *lt_ck_padhv(pTHX_ OP *o) {
904 return lt_old_ck_padhv(aTHX_ o);
909 /* ... Our peephole optimizer .............................................. */
911 #if LT_HAS_PERL(5, 17, 6)
913 STATIC int lt_maybe_padrange_setup(pTHX_ OP *o, const OP *start) {
914 #define lt_maybe_padrange_setup(O, S) lt_maybe_padrange_setup(aTHX_ (O), (S))
918 count = o->op_private & OPpPADRANGE_COUNTMASK;
920 for (i = 0, p = start; i < count && p; ++i, p = p->op_sibling) {
921 switch (p->op_type) {
923 #if LT_HAS_PERL(5, 11, 1)
927 /* In a padrange sequence, either all lexicals are typed, or none are.
928 * Thus we can stop at the first padsv op. However, note that these
929 * lexicals can need to call different methods in different packages. */
930 LT_LOCK(<_op_map_mutex);
931 if (ptable_fetch(lt_op_padxv_map, p)) {
932 LT_UNLOCK(<_op_map_mutex);
933 lt_padrange_map_store(o, start, o->op_ppaddr);
934 o->op_ppaddr = lt_pp_padrange;
936 LT_UNLOCK(<_op_map_mutex);
950 STATIC peep_t lt_old_peep = 0; /* This is actually the rpeep past 5.13.5 */
952 STATIC void lt_peep_rec(pTHX_ OP *o, ptable *seen) {
953 #define lt_peep_rec(O) lt_peep_rec(aTHX_ (O), seen)
954 for (; o; o = o->op_next) {
955 if (ptable_fetch(seen, o))
957 ptable_seen_store(seen, o, o);
959 switch (o->op_type) {
961 #if LT_HAS_PERL(5, 11, 1)
965 if (o->op_ppaddr != lt_pp_padxv && o->op_private & OPpLVAL_INTRO) {
966 lt_op_padxv_info *oi;
967 LT_LOCK(<_op_map_mutex);
968 oi = ptable_fetch(lt_op_padxv_map, o);
970 oi->old_pp = o->op_ppaddr;
971 o->op_ppaddr = lt_pp_padxv;
973 LT_UNLOCK(<_op_map_mutex);
976 #if LT_HAS_PERL(5, 17, 6)
978 /* We deal with special padrange ops later, in the aassign op they belong
980 if (o->op_ppaddr != lt_pp_padrange && o->op_private & OPpLVAL_INTRO
981 && !(o->op_flags & OPf_SPECIAL)) {
982 /* A padrange op is guaranteed to have previously been a pushmark.
983 * Moreover, for non-special padrange ops (i.e. that aren't for
984 * my (...) = @_), the original padxv ops are its siblings. */
985 lt_maybe_padrange_setup(o, o->op_sibling);
990 if (cBINOPo->op_first && cBINOPo->op_first->op_flags & OPf_KIDS
991 && (op = cUNOPx(cBINOPo->op_first)->op_first)
992 && op->op_type == OP_PADRANGE
993 && op->op_ppaddr != lt_pp_padrange
994 && op->op_private & OPpLVAL_INTRO
995 && op->op_flags & OPf_SPECIAL) {
996 const OP *start = cUNOPx(cBINOPo->op_last)->op_first;
997 if (start->op_type == OP_PUSHMARK)
998 start = start->op_sibling;
999 lt_maybe_padrange_setup(op, start);
1013 # if LT_HAS_PERL(5, 10, 0)
1018 lt_peep_rec(cLOGOPo->op_other);
1022 lt_peep_rec(cLOOPo->op_redoop);
1023 lt_peep_rec(cLOOPo->op_nextop);
1024 lt_peep_rec(cLOOPo->op_lastop);
1026 # if LT_HAS_PERL(5, 9, 5)
1028 lt_peep_rec(cPMOPo->op_pmstashstartu.op_pmreplstart);
1034 lt_peep_rec(cPMOPo->op_pmreplstart);
1037 #endif /* !LT_HAS_RPEEP */
1044 STATIC void lt_peep(pTHX_ OP *o) {
1046 ptable *seen = MY_CXT.seen;
1048 lt_old_peep(aTHX_ o);
1050 ptable_seen_clear(seen);
1052 ptable_seen_clear(seen);
1055 /* --- Interpreter setup/teardown ------------------------------------------ */
1058 STATIC U32 lt_initialized = 0;
1060 STATIC void lt_teardown(pTHX_ void *root) {
1061 if (!lt_initialized)
1073 ptable_hints_free(MY_CXT.tbl);
1075 ptable_seen_free(MY_CXT.seen);
1076 for (i = 0; i < LT_TYPE_COUNT; ++i)
1077 SvREFCNT_dec(MY_CXT.default_meth[i]);
1080 lt_ck_restore(OP_PADANY, <_old_ck_padany);
1081 lt_ck_restore(OP_PADSV, <_old_ck_padsv);
1082 #if LT_HAS_PERL(5, 11, 1)
1083 lt_ck_restore(OP_PADAV, <_old_ck_padav);
1084 lt_ck_restore(OP_PADHV, <_old_ck_padhv);
1088 PL_rpeepp = lt_old_peep;
1090 PL_peepp = lt_old_peep;
1097 STATIC void lt_setup(pTHX) {
1098 #define lt_setup() lt_setup(aTHX)
1105 MY_CXT.tbl = ptable_new();
1106 MY_CXT.owner = aTHX;
1108 MY_CXT.seen = ptable_new();
1109 MY_CXT.default_meth[LT_TYPE_SCALAR] = newSVpvs("TYPEDSCALAR");
1110 SvREADONLY_on(MY_CXT.default_meth[LT_TYPE_SCALAR]);
1111 #if LT_HAS_PERL(5, 11, 1)
1112 MY_CXT.default_meth[LT_TYPE_ARRAY] = newSVpvs("TYPEDARRAY");
1113 SvREADONLY_on(MY_CXT.default_meth[LT_TYPE_ARRAY]);
1114 MY_CXT.default_meth[LT_TYPE_HASH] = newSVpvs("TYPEDHASH");
1115 SvREADONLY_on(MY_CXT.default_meth[LT_TYPE_HASH]);
1119 lt_ck_replace(OP_PADANY, lt_ck_padany, <_old_ck_padany);
1120 lt_ck_replace(OP_PADSV, lt_ck_padsv, <_old_ck_padsv);
1121 #if LT_HAS_PERL(5, 11, 1)
1122 lt_ck_replace(OP_PADAV, lt_ck_padav, <_old_ck_padav);
1123 lt_ck_replace(OP_PADHV, lt_ck_padhv, <_old_ck_padhv);
1127 lt_old_peep = PL_rpeepp;
1128 PL_rpeepp = lt_peep;
1130 lt_old_peep = PL_peepp;
1135 call_atexit(lt_teardown, aTHX);
1137 call_atexit(lt_teardown, NULL);
1143 STATIC U32 lt_booted = 0;
1145 /* --- XS ------------------------------------------------------------------ */
1147 MODULE = Lexical::Types PACKAGE = Lexical::Types
1156 lt_op_padxv_map = ptable_new();
1157 #if LT_HAS_PERL(5, 17, 6)
1158 lt_op_padrange_map = ptable_new();
1161 MUTEX_INIT(<_op_map_mutex);
1164 PERL_HASH(lt_hash, __PACKAGE__, __PACKAGE_LEN__);
1166 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1167 newCONSTSUB(stash, "LT_THREADSAFE", newSVuv(LT_THREADSAFE));
1168 newCONSTSUB(stash, "LT_FORKSAFE", newSVuv(LT_FORKSAFE));
1182 SV *cloned_default_meth[LT_TYPE_COUNT];
1187 lt_ptable_clone_ud ud;
1191 lt_ptable_clone_ud_init(ud, t, MY_CXT.owner);
1192 ptable_walk(MY_CXT.tbl, lt_ptable_clone, &ud);
1193 for (i = 0; i < LT_TYPE_COUNT; ++i)
1194 cloned_default_meth[i] = lt_dup_inc(MY_CXT.default_meth[i], &ud);
1195 lt_ptable_clone_ud_deinit(ud);
1202 MY_CXT.owner = aTHX;
1204 for (i = 0; i < LT_TYPE_COUNT; ++i)
1205 MY_CXT.default_meth[i] = cloned_default_meth[i];
1207 reap(3, lt_thread_cleanup, NULL);
1216 RETVAL = lt_tag(value);