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
21 # ifndef PL_in_my_stash
22 # define PL_in_my_stash PL_Iin_my_stash
26 #ifndef LT_WORKAROUND_REQUIRE_PROPAGATION
27 # define LT_WORKAROUND_REQUIRE_PROPAGATION !LT_HAS_PERL(5, 10, 1)
31 # define LT_HAS_RPEEP LT_HAS_PERL(5, 13, 5)
35 # define HvNAME_get(H) HvNAME(H)
39 # define HvNAMELEN_get(H) strlen(HvNAME_get(H))
44 # define OpSIBLING(O) OP_SIBLING(O)
46 # define OpSIBLING(O) ((O)->op_sibling)
50 #ifndef SvREFCNT_inc_simple_void_NN
51 # define SvREFCNT_inc_simple_void_NN(S) ((void) SvREFCNT_inc(S))
54 /* ... Thread safety and multiplicity ...................................... */
56 /* Safe unless stated otherwise in Makefile.PL */
58 # define LT_FORKSAFE 1
61 #ifndef LT_MULTIPLICITY
62 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
63 # define LT_MULTIPLICITY 1
65 # define LT_MULTIPLICITY 0
70 # define tTHX PerlInterpreter*
73 #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))
74 # define LT_THREADSAFE 1
76 # define MY_CXT_CLONE \
78 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
79 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
80 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
83 # define LT_THREADSAFE 0
85 # define dMY_CXT dNOOP
87 # define MY_CXT lt_globaldata
89 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
91 # define MY_CXT_INIT NOOP
93 # define MY_CXT_CLONE NOOP
104 #if defined(OP_CHECK_MUTEX_LOCK) && defined(OP_CHECK_MUTEX_UNLOCK)
105 # define LT_CHECK_MUTEX_LOCK OP_CHECK_MUTEX_LOCK
106 # define LT_CHECK_MUTEX_UNLOCK OP_CHECK_MUTEX_UNLOCK
108 # define LT_CHECK_MUTEX_LOCK OP_REFCNT_LOCK
109 # define LT_CHECK_MUTEX_UNLOCK OP_REFCNT_UNLOCK
112 typedef OP *(*lt_ck_t)(pTHX_ OP *);
114 #ifdef wrap_op_checker
116 # define lt_ck_replace(T, NC, OCP) wrap_op_checker((T), (NC), (OCP))
120 STATIC void lt_ck_replace(pTHX_ OPCODE type, lt_ck_t new_ck, lt_ck_t *old_ck_p){
121 #define lt_ck_replace(T, NC, OCP) lt_ck_replace(aTHX_ (T), (NC), (OCP))
124 *old_ck_p = PL_check[type];
125 PL_check[type] = new_ck;
127 LT_CHECK_MUTEX_UNLOCK;
132 STATIC void lt_ck_restore(pTHX_ OPCODE type, lt_ck_t *old_ck_p) {
133 #define lt_ck_restore(T, OCP) lt_ck_restore(aTHX_ (T), (OCP))
136 PL_check[type] = *old_ck_p;
139 LT_CHECK_MUTEX_UNLOCK;
142 /* --- Helpers ------------------------------------------------------------- */
144 /* ... Thread-safe hints ................................................... */
146 #if LT_WORKAROUND_REQUIRE_PROPAGATION
153 #define LT_HINT_STRUCT 1
155 #define LT_HINT_CODE(H) ((H)->code)
157 #define LT_HINT_FREE(H) { \
158 lt_hint_t *h = (H); \
159 SvREFCNT_dec(h->code); \
160 PerlMemShared_free(h); \
163 #else /* LT_WORKAROUND_REQUIRE_PROPAGATION */
165 typedef SV lt_hint_t;
167 #define LT_HINT_STRUCT 0
169 #define LT_HINT_CODE(H) (H)
171 #define LT_HINT_FREE(H) SvREFCNT_dec(H);
173 #endif /* !LT_WORKAROUND_REQUIRE_PROPAGATION */
177 #define PTABLE_NAME ptable_hints
178 #define PTABLE_VAL_FREE(V) LT_HINT_FREE(V)
187 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
188 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
190 #endif /* LT_THREADSAFE */
192 /* ... "Seen" pointer table ................................................ */
194 #define PTABLE_NAME ptable_seen
195 #define PTABLE_VAL_FREE(V) NOOP
199 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
200 #define ptable_seen_store(T, K, V) ptable_seen_store(aPTBLMS_ (T), (K), (V))
201 #define ptable_seen_clear(T) ptable_seen_clear(aPTBLMS_ (T))
202 #define ptable_seen_free(T) ptable_seen_free(aPTBLMS_ (T))
204 /* ... Global data ......................................................... */
206 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
210 ptable *tbl; /* It really is a ptable_hints */
213 ptable *seen; /* It really is a ptable_seen */
219 /* ... Cloning global data ................................................. */
225 #if LT_HAS_PERL(5, 13, 2)
226 CLONE_PARAMS *params;
230 } lt_ptable_clone_ud;
232 #if LT_HAS_PERL(5, 13, 2)
233 # define lt_ptable_clone_ud_init(U, T, O) \
235 (U).params = Perl_clone_params_new((O), aTHX)
236 # define lt_ptable_clone_ud_deinit(U) Perl_clone_params_del((U).params)
237 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), (U)->params))
239 # define lt_ptable_clone_ud_init(U, T, O) \
241 (U).params.stashes = newAV(); \
242 (U).params.flags = 0; \
243 (U).params.proto_perl = (O)
244 # define lt_ptable_clone_ud_deinit(U) SvREFCNT_dec((U).params.stashes)
245 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), &((U)->params)))
248 STATIC void lt_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
249 lt_ptable_clone_ud *ud = ud_;
250 lt_hint_t *h1 = ent->val;
255 h2 = PerlMemShared_malloc(sizeof *h2);
256 h2->code = lt_dup_inc(h1->code, ud);
257 #if LT_WORKAROUND_REQUIRE_PROPAGATION
258 h2->require_tag = PTR2IV(lt_dup_inc(INT2PTR(SV *, h1->require_tag), ud));
261 #else /* LT_HINT_STRUCT */
263 h2 = lt_dup_inc(h1, ud);
265 #endif /* !LT_HINT_STRUCT */
267 ptable_hints_store(ud->tbl, ent->key, h2);
270 STATIC void lt_thread_cleanup(pTHX_ void *ud) {
273 ptable_hints_free(MY_CXT.tbl);
275 ptable_seen_free(MY_CXT.seen);
277 SvREFCNT_dec(MY_CXT.default_meth);
278 MY_CXT.default_meth = NULL;
281 STATIC int lt_endav_free(pTHX_ SV *sv, MAGIC *mg) {
282 SAVEDESTRUCTOR_X(lt_thread_cleanup, NULL);
287 STATIC MGVTBL lt_endav_vtbl = {
304 #endif /* LT_THREADSAFE */
306 /* ... Hint tags ........................................................... */
308 #if LT_WORKAROUND_REQUIRE_PROPAGATION
310 STATIC IV lt_require_tag(pTHX) {
311 #define lt_require_tag() lt_require_tag(aTHX)
312 const CV *cv, *outside;
317 /* If for some reason the pragma is operational at run-time, try to discover
318 * the current cv in use. */
321 for (si = PL_curstackinfo; si; si = si->si_prev) {
324 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
325 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
327 switch (CxTYPE(cx)) {
330 /* The propagation workaround is only needed up to 5.10.0 and at that
331 * time format and sub contexts were still identical. And even later the
332 * cv members offsets should have been kept the same. */
334 goto get_enclosing_cv;
336 cv = cx->blk_eval.cv;
337 goto get_enclosing_cv;
348 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
354 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
356 STATIC SV *lt_tag(pTHX_ SV *value) {
357 #define lt_tag(V) lt_tag(aTHX_ (V))
365 #endif /* LT_THREADSAFE */
369 if (SvTYPE(value) >= SVt_PVCV) {
371 SvREFCNT_inc_simple_void_NN(code);
376 h = PerlMemShared_malloc(sizeof *h);
378 # if LT_WORKAROUND_REQUIRE_PROPAGATION
379 h->require_tag = lt_require_tag();
380 # endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
381 #else /* LT_HINT_STRUCT */
383 #endif /* !LT_HINT_STRUCT */
386 /* We only need for the key to be an unique tag for looking up the value later
387 * Allocated memory provides convenient unique identifiers, so that's why we
388 * use the hint as the key itself. */
389 ptable_hints_store(MY_CXT.tbl, h, h);
390 #endif /* LT_THREADSAFE */
392 return newSViv(PTR2IV(h));
395 STATIC SV *lt_detag(pTHX_ const SV *hint) {
396 #define lt_detag(H) lt_detag(aTHX_ (H))
403 #endif /* LT_THREADSAFE */
405 if (!(hint && SvIOK(hint)))
408 h = INT2PTR(lt_hint_t *, SvIVX(hint));
410 h = ptable_fetch(MY_CXT.tbl, h);
411 #endif /* LT_THREADSAFE */
412 #if LT_WORKAROUND_REQUIRE_PROPAGATION
413 if (lt_require_tag() != h->require_tag)
415 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
417 return LT_HINT_CODE(h);
420 STATIC U32 lt_hash = 0;
422 STATIC SV *lt_hint(pTHX) {
423 #define lt_hint() lt_hint(aTHX)
425 #ifdef cop_hints_fetch_pvn
426 hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__, lt_hash,0);
427 #elif LT_HAS_PERL(5, 9, 5)
428 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
430 __PACKAGE__, __PACKAGE_LEN__,
434 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, 0);
439 return lt_detag(hint);
442 /* ... op => info map ...................................................... */
444 #define PTABLE_NAME ptable_map
445 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
449 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
450 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
451 #define ptable_map_delete(T, K) ptable_map_delete(aPTBLMS_ (T), (K))
455 STATIC perl_mutex lt_op_map_mutex;
457 #define LT_LOCK(M) MUTEX_LOCK(M)
458 #define LT_UNLOCK(M) MUTEX_UNLOCK(M)
460 #else /* USE_ITHREADS */
465 #endif /* !USE_ITHREADS */
467 STATIC ptable *lt_op_padxv_map = NULL;
472 STRLEN buf_size, orig_pkg_len, type_pkg_len, type_meth_len;
474 #else /* MULTIPLICITY */
478 #endif /* !MULTIPLICITY */
481 STATIC void lt_op_padxv_info_call(pTHX_ const lt_op_padxv_info *oi, SV *sv) {
482 #define lt_op_padxv_info_call(O, S) lt_op_padxv_info_call(aTHX_ (O), (S))
483 SV *orig_pkg, *type_pkg, *type_meth;
492 STRLEN op_len = oi->orig_pkg_len, tp_len = oi->type_pkg_len;
494 orig_pkg = sv_2mortal(newSVpvn(buf, op_len));
495 SvREADONLY_on(orig_pkg);
497 type_pkg = sv_2mortal(newSVpvn(buf, tp_len));
498 SvREADONLY_on(type_pkg);
500 type_meth = sv_2mortal(newSVpvn(buf, oi->type_meth_len));
501 SvREADONLY_on(type_meth);
503 #else /* MULTIPLICITY */
504 orig_pkg = oi->orig_pkg;
505 type_pkg = oi->type_pkg;
506 type_meth = oi->type_meth;
507 #endif /* !MULTIPLICITY */
516 items = call_sv(type_meth, G_ARRAY | G_METHOD);
526 croak("Typed scalar initializer method should return zero or one scalar, but got %d", items);
536 STATIC void lt_padxv_map_store(pTHX_ const OP *o, SV *orig_pkg, SV *type_pkg, SV *type_meth, OP *(*old_pp)(pTHX)) {
537 #define lt_padxv_map_store(O, OP, TP, TM, PP) lt_padxv_map_store(aTHX_ (O), (OP), (TP), (TM), (PP))
538 lt_op_padxv_info *oi;
540 LT_LOCK(<_op_map_mutex);
542 if (!(oi = ptable_fetch(lt_op_padxv_map, o))) {
543 oi = PerlMemShared_malloc(sizeof *oi);
544 ptable_map_store(lt_op_padxv_map, o, oi);
548 #else /* MULTIPLICITY */
550 SvREFCNT_dec(oi->orig_pkg);
551 SvREFCNT_dec(oi->type_pkg);
552 SvREFCNT_dec(oi->type_meth);
553 #endif /* !MULTIPLICITY */
558 STRLEN op_len = SvCUR(orig_pkg);
559 STRLEN tp_len = SvCUR(type_pkg);
560 STRLEN tm_len = SvCUR(type_meth);
561 STRLEN new_buf_size = op_len + tp_len + tm_len;
563 if (new_buf_size > oi->buf_size) {
564 PerlMemShared_free(oi->buf);
565 oi->buf = PerlMemShared_malloc(new_buf_size);
566 oi->buf_size = new_buf_size;
569 Copy(SvPVX(orig_pkg), buf, op_len, char);
571 Copy(SvPVX(type_pkg), buf, tp_len, char);
573 Copy(SvPVX(type_meth), buf, tm_len, char);
574 oi->orig_pkg_len = op_len;
575 oi->type_pkg_len = tp_len;
576 oi->type_meth_len = tm_len;
577 SvREFCNT_dec(orig_pkg);
578 SvREFCNT_dec(type_pkg);
579 SvREFCNT_dec(type_meth);
581 #else /* MULTIPLICITY */
582 oi->orig_pkg = orig_pkg;
583 oi->type_pkg = type_pkg;
584 oi->type_meth = type_meth;
585 #endif /* !MULTIPLICITY */
589 LT_UNLOCK(<_op_map_mutex);
592 STATIC const lt_op_padxv_info *lt_padxv_map_fetch(const OP *o, lt_op_padxv_info *oi) {
593 const lt_op_padxv_info *val;
595 LT_LOCK(<_op_map_mutex);
597 val = ptable_fetch(lt_op_padxv_map, o);
603 LT_UNLOCK(<_op_map_mutex);
608 #if LT_HAS_PERL(5, 17, 6)
610 STATIC ptable *lt_op_padrange_map = NULL;
614 const OP *padxv_start;
615 } lt_op_padrange_info;
617 STATIC void lt_padrange_map_store(pTHX_ const OP *o, const OP *s, OP *(*old_pp)(pTHX)) {
618 #define lt_padrange_map_store(O, S, PP) lt_padrange_map_store(aTHX_ (O), (S), (PP))
619 lt_op_padrange_info *oi;
621 LT_LOCK(<_op_map_mutex);
623 if (!(oi = ptable_fetch(lt_op_padrange_map, o))) {
624 oi = PerlMemShared_malloc(sizeof *oi);
625 ptable_map_store(lt_op_padrange_map, o, oi);
631 LT_UNLOCK(<_op_map_mutex);
634 STATIC const lt_op_padrange_info *lt_padrange_map_fetch(const OP *o, lt_op_padrange_info *oi) {
635 const lt_op_padrange_info *val;
637 LT_LOCK(<_op_map_mutex);
639 val = ptable_fetch(lt_op_padrange_map, o);
645 LT_UNLOCK(<_op_map_mutex);
652 STATIC void lt_map_delete(pTHX_ const OP *o) {
653 #define lt_map_delete(O) lt_map_delete(aTHX_ (O))
654 LT_LOCK(<_op_map_mutex);
656 ptable_map_delete(lt_op_padxv_map, o);
657 #if LT_HAS_PERL(5, 17, 6)
658 ptable_map_delete(lt_op_padrange_map, o);
661 LT_UNLOCK(<_op_map_mutex);
664 /* --- Hooks --------------------------------------------------------------- */
666 /* ... Our pp_padsv ........................................................ */
668 STATIC OP *lt_pp_padsv(pTHX) {
671 if (lt_padxv_map_fetch(PL_op, &oi)) {
673 lt_op_padxv_info_call(&oi, TARG);
674 return oi.old_pp(aTHX);
677 return PL_op->op_ppaddr(aTHX);
680 /* ... Our pp_padrange (on perl 5.17.6 and above) .......................... */
682 #if LT_HAS_PERL(5, 17, 6)
684 STATIC OP *lt_pp_padrange(pTHX) {
685 lt_op_padrange_info roi;
687 if (lt_padrange_map_fetch(PL_op, &roi)) {
688 PADOFFSET i, base, count;
691 base = PL_op->op_targ;
692 count = PL_op->op_private & OPpPADRANGE_COUNTMASK;
694 for (i = 0, p = roi.padxv_start; i < count && p; ++i, p = p->op_next) {
695 while (p->op_type == OP_NULL)
698 if (p->op_type == OP_PADSV && lt_padxv_map_fetch(p, &oi))
699 lt_op_padxv_info_call(&oi, PAD_SV(base + i));
702 return roi.old_pp(aTHX);
705 return PL_op->op_ppaddr(aTHX);
710 /* ... Our ck_pad{any,sv} .................................................. */
712 /* Sadly, the padsv OPs we are interested in don't trigger the padsv check
713 * function, but are instead manually mutated from a padany. So we store
714 * the op entry in the op map in the padany check function, and we set their
715 * op_ppaddr member in our peephole optimizer replacement below. */
717 STATIC OP *(*lt_old_ck_padany)(pTHX_ OP *) = 0;
719 STATIC OP *lt_ck_padany(pTHX_ OP *o) {
723 o = lt_old_ck_padany(aTHX_ o);
725 stash = PL_in_my_stash;
726 if (stash && (code = lt_hint())) {
728 SV *orig_pkg = newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash));
729 SV *orig_meth = MY_CXT.default_meth; /* Guarded by lt_hint() */
731 SV *type_meth = NULL;
736 SvREADONLY_on(orig_pkg);
747 items = call_sv(code, G_ARRAY);
751 croak(__PACKAGE__ " mangler should return zero, one or two scalars, but got %d", items);
753 SvREFCNT_dec(orig_pkg);
762 type_meth = newSVsv(rsv);
763 SvREADONLY_on(type_meth);
768 type_pkg = newSVsv(rsv);
769 SvREADONLY_on(type_pkg);
779 SvREFCNT_inc_simple_void_NN(orig_pkg);
783 type_meth = orig_meth;
784 SvREFCNT_inc_simple_void_NN(orig_meth);
787 lt_padxv_map_store(o, orig_pkg, type_pkg, type_meth, o->op_ppaddr);
796 STATIC OP *(*lt_old_ck_padsv)(pTHX_ OP *) = 0;
798 STATIC OP *lt_ck_padsv(pTHX_ OP *o) {
801 return lt_old_ck_padsv(aTHX_ o);
804 /* ... Our peephole optimizer .............................................. */
806 #if LT_HAS_PERL(5, 17, 6)
808 STATIC int lt_maybe_padrange_setup(pTHX_ OP *o, const OP *start) {
809 #define lt_maybe_padrange_setup(O, S) lt_maybe_padrange_setup(aTHX_ (O), (S))
813 count = o->op_private & OPpPADRANGE_COUNTMASK;
815 for (i = 0, p = start; i < count && p; ++i, p = p->op_next) {
816 if (p->op_type == OP_PADSV) {
817 /* In a padrange sequence, either all lexicals are typed, or none are.
818 * Thus we can stop at the first padsv op. However, note that these
819 * lexicals can need to call different methods in different packages. */
820 LT_LOCK(<_op_map_mutex);
821 if (ptable_fetch(lt_op_padxv_map, p)) {
822 LT_UNLOCK(<_op_map_mutex);
823 lt_padrange_map_store(o, start, o->op_ppaddr);
824 o->op_ppaddr = lt_pp_padrange;
826 LT_UNLOCK(<_op_map_mutex);
837 STATIC peep_t lt_old_peep = 0; /* This is actually the rpeep past 5.13.5 */
839 STATIC void lt_peep_rec(pTHX_ OP *o, ptable *seen) {
840 #define lt_peep_rec(O) lt_peep_rec(aTHX_ (O), seen)
841 for (; o; o = o->op_next) {
842 if (ptable_fetch(seen, o))
844 ptable_seen_store(seen, o, o);
846 switch (o->op_type) {
848 if (o->op_ppaddr != lt_pp_padsv && o->op_private & OPpLVAL_INTRO) {
849 lt_op_padxv_info *oi;
850 LT_LOCK(<_op_map_mutex);
851 oi = ptable_fetch(lt_op_padxv_map, o);
853 oi->old_pp = o->op_ppaddr;
854 o->op_ppaddr = lt_pp_padsv;
856 LT_UNLOCK(<_op_map_mutex);
859 #if LT_HAS_PERL(5, 17, 6)
861 /* We deal with special padrange ops later, in the aassign op they belong
863 if (o->op_ppaddr != lt_pp_padrange && o->op_private & OPpLVAL_INTRO
864 && !(o->op_flags & OPf_SPECIAL)) {
865 /* A padrange op is guaranteed to have previously been a pushmark.
866 * Moreover, for non-special padrange ops (i.e. that aren't for
867 * my (...) = @_), the first original padxv is its sibling or nephew.
869 OP *kid = OpSIBLING(o);
870 if (kid->op_type == OP_NULL && kid->op_flags & OPf_KIDS) {
871 kid = kUNOP->op_first;
872 if (kid->op_type == OP_NULL)
873 kid = OpSIBLING(kid);
875 lt_maybe_padrange_setup(o, kid);
880 if (cBINOPo->op_first && cBINOPo->op_first->op_flags & OPf_KIDS
881 && (op = cUNOPx(cBINOPo->op_first)->op_first)
882 && op->op_type == OP_PADRANGE
883 && op->op_ppaddr != lt_pp_padrange
884 && op->op_private & OPpLVAL_INTRO
885 && op->op_flags & OPf_SPECIAL) {
886 const OP *start = cUNOPx(cBINOPo->op_last)->op_first;
887 if (start->op_type == OP_PUSHMARK)
888 start = OpSIBLING(start);
889 lt_maybe_padrange_setup(op, start);
903 # if LT_HAS_PERL(5, 10, 0)
908 lt_peep_rec(cLOGOPo->op_other);
912 lt_peep_rec(cLOOPo->op_redoop);
913 lt_peep_rec(cLOOPo->op_nextop);
914 lt_peep_rec(cLOOPo->op_lastop);
916 # if LT_HAS_PERL(5, 9, 5)
918 lt_peep_rec(cPMOPo->op_pmstashstartu.op_pmreplstart);
924 lt_peep_rec(cPMOPo->op_pmreplstart);
927 #endif /* !LT_HAS_RPEEP */
934 STATIC void lt_peep(pTHX_ OP *o) {
936 ptable *seen = MY_CXT.seen;
938 lt_old_peep(aTHX_ o);
941 ptable_seen_clear(seen);
943 ptable_seen_clear(seen);
947 /* --- Interpreter setup/teardown ------------------------------------------ */
950 STATIC U32 lt_initialized = 0;
952 STATIC void lt_teardown(pTHX_ void *root) {
964 ptable_hints_free(MY_CXT.tbl);
967 ptable_seen_free(MY_CXT.seen);
969 SvREFCNT_dec(MY_CXT.default_meth);
970 MY_CXT.default_meth = NULL;
973 lt_ck_restore(OP_PADANY, <_old_ck_padany);
974 lt_ck_restore(OP_PADSV, <_old_ck_padsv);
977 PL_rpeepp = lt_old_peep;
979 PL_peepp = lt_old_peep;
986 STATIC void lt_setup(pTHX) {
987 #define lt_setup() lt_setup(aTHX)
994 MY_CXT.tbl = ptable_new();
997 MY_CXT.seen = ptable_new();
998 MY_CXT.default_meth = newSVpvn("TYPEDSCALAR", 11);
999 SvREADONLY_on(MY_CXT.default_meth);
1002 lt_ck_replace(OP_PADANY, lt_ck_padany, <_old_ck_padany);
1003 lt_ck_replace(OP_PADSV, lt_ck_padsv, <_old_ck_padsv);
1006 lt_old_peep = PL_rpeepp;
1007 PL_rpeepp = lt_peep;
1009 lt_old_peep = PL_peepp;
1014 call_atexit(lt_teardown, aTHX);
1016 call_atexit(lt_teardown, NULL);
1022 STATIC U32 lt_booted = 0;
1024 /* --- XS ------------------------------------------------------------------ */
1026 MODULE = Lexical::Types PACKAGE = Lexical::Types
1035 lt_op_padxv_map = ptable_new();
1036 #if LT_HAS_PERL(5, 17, 6)
1037 lt_op_padrange_map = ptable_new();
1040 MUTEX_INIT(<_op_map_mutex);
1043 PERL_HASH(lt_hash, __PACKAGE__, __PACKAGE_LEN__);
1045 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1046 newCONSTSUB(stash, "LT_THREADSAFE", newSVuv(LT_THREADSAFE));
1047 newCONSTSUB(stash, "LT_FORKSAFE", newSVuv(LT_FORKSAFE));
1061 SV *cloned_default_meth;
1066 lt_ptable_clone_ud ud;
1070 lt_ptable_clone_ud_init(ud, t, MY_CXT.owner);
1071 ptable_walk(MY_CXT.tbl, lt_ptable_clone, &ud);
1072 cloned_default_meth = lt_dup_inc(MY_CXT.default_meth, &ud);
1073 lt_ptable_clone_ud_deinit(ud);
1080 MY_CXT.owner = aTHX;
1082 MY_CXT.default_meth = cloned_default_meth;
1084 gv = gv_fetchpv(__PACKAGE__ "::_THREAD_CLEANUP", 0, SVt_PVCV);
1090 if (!av_store(PL_endav, av_len(PL_endav) + 1, (SV *) cv))
1092 sv_magicext((SV *) PL_endav, NULL, PERL_MAGIC_ext, <_endav_vtbl, NULL, 0);
1097 _THREAD_CLEANUP(...)
1100 lt_thread_cleanup(aTHX_ NULL);
1109 RETVAL = lt_tag(value);