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))
43 # define OP_SIBLING(O) ((O)->op_sibling)
46 #ifndef SvREFCNT_inc_simple_void_NN
47 # define SvREFCNT_inc_simple_void_NN(S) ((void) SvREFCNT_inc(S))
50 /* ... Thread safety and multiplicity ...................................... */
52 /* Safe unless stated otherwise in Makefile.PL */
54 # define LT_FORKSAFE 1
57 #ifndef LT_MULTIPLICITY
58 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
59 # define LT_MULTIPLICITY 1
61 # define LT_MULTIPLICITY 0
66 # define tTHX PerlInterpreter*
69 #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))
70 # define LT_THREADSAFE 1
72 # define MY_CXT_CLONE \
74 my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1)); \
75 Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t); \
76 sv_setuv(my_cxt_sv, PTR2UV(my_cxtp))
79 # define LT_THREADSAFE 0
81 # define dMY_CXT dNOOP
83 # define MY_CXT lt_globaldata
85 # define START_MY_CXT STATIC my_cxt_t MY_CXT;
87 # define MY_CXT_INIT NOOP
89 # define MY_CXT_CLONE NOOP
100 #if defined(OP_CHECK_MUTEX_LOCK) && defined(OP_CHECK_MUTEX_UNLOCK)
101 # define LT_CHECK_MUTEX_LOCK OP_CHECK_MUTEX_LOCK
102 # define LT_CHECK_MUTEX_UNLOCK OP_CHECK_MUTEX_UNLOCK
104 # define LT_CHECK_MUTEX_LOCK OP_REFCNT_LOCK
105 # define LT_CHECK_MUTEX_UNLOCK OP_REFCNT_UNLOCK
108 typedef OP *(*lt_ck_t)(pTHX_ OP *);
110 #ifdef wrap_op_checker
112 # define lt_ck_replace(T, NC, OCP) wrap_op_checker((T), (NC), (OCP))
116 STATIC void lt_ck_replace(pTHX_ OPCODE type, lt_ck_t new_ck, lt_ck_t *old_ck_p){
117 #define lt_ck_replace(T, NC, OCP) lt_ck_replace(aTHX_ (T), (NC), (OCP))
120 *old_ck_p = PL_check[type];
121 PL_check[type] = new_ck;
123 LT_CHECK_MUTEX_UNLOCK;
128 STATIC void lt_ck_restore(pTHX_ OPCODE type, lt_ck_t *old_ck_p) {
129 #define lt_ck_restore(T, OCP) lt_ck_restore(aTHX_ (T), (OCP))
132 PL_check[type] = *old_ck_p;
135 LT_CHECK_MUTEX_UNLOCK;
138 /* --- Helpers ------------------------------------------------------------- */
140 /* ... Thread-safe hints ................................................... */
142 #if LT_WORKAROUND_REQUIRE_PROPAGATION
149 #define LT_HINT_STRUCT 1
151 #define LT_HINT_CODE(H) ((H)->code)
153 #define LT_HINT_FREE(H) { \
154 lt_hint_t *h = (H); \
155 SvREFCNT_dec(h->code); \
156 PerlMemShared_free(h); \
159 #else /* LT_WORKAROUND_REQUIRE_PROPAGATION */
161 typedef SV lt_hint_t;
163 #define LT_HINT_STRUCT 0
165 #define LT_HINT_CODE(H) (H)
167 #define LT_HINT_FREE(H) SvREFCNT_dec(H);
169 #endif /* !LT_WORKAROUND_REQUIRE_PROPAGATION */
173 #define PTABLE_NAME ptable_hints
174 #define PTABLE_VAL_FREE(V) LT_HINT_FREE(V)
183 #define ptable_hints_store(T, K, V) ptable_hints_store(aTHX_ (T), (K), (V))
184 #define ptable_hints_free(T) ptable_hints_free(aTHX_ (T))
186 #endif /* LT_THREADSAFE */
188 /* ... "Seen" pointer table ................................................ */
190 #define PTABLE_NAME ptable_seen
191 #define PTABLE_VAL_FREE(V) NOOP
195 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
196 #define ptable_seen_store(T, K, V) ptable_seen_store(aPTBLMS_ (T), (K), (V))
197 #define ptable_seen_clear(T) ptable_seen_clear(aPTBLMS_ (T))
198 #define ptable_seen_free(T) ptable_seen_free(aPTBLMS_ (T))
200 /* ... Global data ......................................................... */
202 #define MY_CXT_KEY __PACKAGE__ "::_guts" XS_VERSION
206 ptable *tbl; /* It really is a ptable_hints */
209 ptable *seen; /* It really is a ptable_seen */
215 /* ... Cloning global data ................................................. */
221 #if LT_HAS_PERL(5, 13, 2)
222 CLONE_PARAMS *params;
226 } lt_ptable_clone_ud;
228 #if LT_HAS_PERL(5, 13, 2)
229 # define lt_ptable_clone_ud_init(U, T, O) \
231 (U).params = Perl_clone_params_new((O), aTHX)
232 # define lt_ptable_clone_ud_deinit(U) Perl_clone_params_del((U).params)
233 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), (U)->params))
235 # define lt_ptable_clone_ud_init(U, T, O) \
237 (U).params.stashes = newAV(); \
238 (U).params.flags = 0; \
239 (U).params.proto_perl = (O)
240 # define lt_ptable_clone_ud_deinit(U) SvREFCNT_dec((U).params.stashes)
241 # define lt_dup_inc(S, U) SvREFCNT_inc(sv_dup((S), &((U)->params)))
244 STATIC void lt_ptable_clone(pTHX_ ptable_ent *ent, void *ud_) {
245 lt_ptable_clone_ud *ud = ud_;
246 lt_hint_t *h1 = ent->val;
251 h2 = PerlMemShared_malloc(sizeof *h2);
252 h2->code = lt_dup_inc(h1->code, ud);
253 #if LT_WORKAROUND_REQUIRE_PROPAGATION
254 h2->require_tag = PTR2IV(lt_dup_inc(INT2PTR(SV *, h1->require_tag), ud));
257 #else /* LT_HINT_STRUCT */
259 h2 = lt_dup_inc(h1, ud);
261 #endif /* !LT_HINT_STRUCT */
263 ptable_hints_store(ud->tbl, ent->key, h2);
266 STATIC void lt_thread_cleanup(pTHX_ void *ud) {
269 ptable_hints_free(MY_CXT.tbl);
271 ptable_seen_free(MY_CXT.seen);
273 SvREFCNT_dec(MY_CXT.default_meth);
274 MY_CXT.default_meth = NULL;
277 STATIC int lt_endav_free(pTHX_ SV *sv, MAGIC *mg) {
278 SAVEDESTRUCTOR_X(lt_thread_cleanup, NULL);
283 STATIC MGVTBL lt_endav_vtbl = {
300 #endif /* LT_THREADSAFE */
302 /* ... Hint tags ........................................................... */
304 #if LT_WORKAROUND_REQUIRE_PROPAGATION
306 STATIC IV lt_require_tag(pTHX) {
307 #define lt_require_tag() lt_require_tag(aTHX)
308 const CV *cv, *outside;
313 /* If for some reason the pragma is operational at run-time, try to discover
314 * the current cv in use. */
317 for (si = PL_curstackinfo; si; si = si->si_prev) {
320 for (cxix = si->si_cxix; cxix >= 0; --cxix) {
321 const PERL_CONTEXT *cx = si->si_cxstack + cxix;
323 switch (CxTYPE(cx)) {
326 /* The propagation workaround is only needed up to 5.10.0 and at that
327 * time format and sub contexts were still identical. And even later the
328 * cv members offsets should have been kept the same. */
330 goto get_enclosing_cv;
332 cv = cx->blk_eval.cv;
333 goto get_enclosing_cv;
344 for (outside = CvOUTSIDE(cv); outside; outside = CvOUTSIDE(cv))
350 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
352 STATIC SV *lt_tag(pTHX_ SV *value) {
353 #define lt_tag(V) lt_tag(aTHX_ (V))
361 #endif /* LT_THREADSAFE */
365 if (SvTYPE(value) >= SVt_PVCV) {
367 SvREFCNT_inc_simple_void_NN(code);
372 h = PerlMemShared_malloc(sizeof *h);
374 # if LT_WORKAROUND_REQUIRE_PROPAGATION
375 h->require_tag = lt_require_tag();
376 # endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
377 #else /* LT_HINT_STRUCT */
379 #endif /* !LT_HINT_STRUCT */
382 /* We only need for the key to be an unique tag for looking up the value later
383 * Allocated memory provides convenient unique identifiers, so that's why we
384 * use the hint as the key itself. */
385 ptable_hints_store(MY_CXT.tbl, h, h);
386 #endif /* LT_THREADSAFE */
388 return newSViv(PTR2IV(h));
391 STATIC SV *lt_detag(pTHX_ const SV *hint) {
392 #define lt_detag(H) lt_detag(aTHX_ (H))
399 #endif /* LT_THREADSAFE */
401 if (!(hint && SvIOK(hint)))
404 h = INT2PTR(lt_hint_t *, SvIVX(hint));
406 h = ptable_fetch(MY_CXT.tbl, h);
407 #endif /* LT_THREADSAFE */
408 #if LT_WORKAROUND_REQUIRE_PROPAGATION
409 if (lt_require_tag() != h->require_tag)
411 #endif /* LT_WORKAROUND_REQUIRE_PROPAGATION */
413 return LT_HINT_CODE(h);
416 STATIC U32 lt_hash = 0;
418 STATIC SV *lt_hint(pTHX) {
419 #define lt_hint() lt_hint(aTHX)
421 #ifdef cop_hints_fetch_pvn
422 hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__, lt_hash,0);
423 #elif LT_HAS_PERL(5, 9, 5)
424 hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
426 __PACKAGE__, __PACKAGE_LEN__,
430 SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, 0);
435 return lt_detag(hint);
438 /* ... op => info map ...................................................... */
440 #define PTABLE_NAME ptable_map
441 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
445 /* PerlMemShared_free() needs the [ap]PTBLMS_? default values */
446 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
447 #define ptable_map_delete(T, K) ptable_map_delete(aPTBLMS_ (T), (K))
451 STATIC perl_mutex lt_op_map_mutex;
453 #define LT_LOCK(M) MUTEX_LOCK(M)
454 #define LT_UNLOCK(M) MUTEX_UNLOCK(M)
456 #else /* USE_ITHREADS */
461 #endif /* !USE_ITHREADS */
463 STATIC ptable *lt_op_padxv_map = NULL;
468 STRLEN buf_size, orig_pkg_len, type_pkg_len, type_meth_len;
470 #else /* MULTIPLICITY */
474 #endif /* !MULTIPLICITY */
477 STATIC void lt_op_padxv_info_call(pTHX_ const lt_op_padxv_info *oi, SV *sv) {
478 #define lt_op_padxv_info_call(O, S) lt_op_padxv_info_call(aTHX_ (O), (S))
479 SV *orig_pkg, *type_pkg, *type_meth;
488 STRLEN op_len = oi->orig_pkg_len, tp_len = oi->type_pkg_len;
490 orig_pkg = sv_2mortal(newSVpvn(buf, op_len));
491 SvREADONLY_on(orig_pkg);
493 type_pkg = sv_2mortal(newSVpvn(buf, tp_len));
494 SvREADONLY_on(type_pkg);
496 type_meth = sv_2mortal(newSVpvn(buf, oi->type_meth_len));
497 SvREADONLY_on(type_meth);
499 #else /* MULTIPLICITY */
500 orig_pkg = oi->orig_pkg;
501 type_pkg = oi->type_pkg;
502 type_meth = oi->type_meth;
503 #endif /* !MULTIPLICITY */
512 items = call_sv(type_meth, G_ARRAY | G_METHOD);
522 croak("Typed scalar initializer method should return zero or one scalar, but got %d", items);
532 STATIC void lt_padxv_map_store(pTHX_ const OP *o, SV *orig_pkg, SV *type_pkg, SV *type_meth, OP *(*old_pp)(pTHX)) {
533 #define lt_padxv_map_store(O, OP, TP, TM, PP) lt_padxv_map_store(aTHX_ (O), (OP), (TP), (TM), (PP))
534 lt_op_padxv_info *oi;
536 LT_LOCK(<_op_map_mutex);
538 if (!(oi = ptable_fetch(lt_op_padxv_map, o))) {
539 oi = PerlMemShared_malloc(sizeof *oi);
540 ptable_map_store(lt_op_padxv_map, o, oi);
544 #else /* MULTIPLICITY */
546 SvREFCNT_dec(oi->orig_pkg);
547 SvREFCNT_dec(oi->type_pkg);
548 SvREFCNT_dec(oi->type_meth);
549 #endif /* !MULTIPLICITY */
554 STRLEN op_len = SvCUR(orig_pkg);
555 STRLEN tp_len = SvCUR(type_pkg);
556 STRLEN tm_len = SvCUR(type_meth);
557 STRLEN new_buf_size = op_len + tp_len + tm_len;
559 if (new_buf_size > oi->buf_size) {
560 PerlMemShared_free(oi->buf);
561 oi->buf = PerlMemShared_malloc(new_buf_size);
562 oi->buf_size = new_buf_size;
565 Copy(SvPVX(orig_pkg), buf, op_len, char);
567 Copy(SvPVX(type_pkg), buf, tp_len, char);
569 Copy(SvPVX(type_meth), buf, tm_len, char);
570 oi->orig_pkg_len = op_len;
571 oi->type_pkg_len = tp_len;
572 oi->type_meth_len = tm_len;
573 SvREFCNT_dec(orig_pkg);
574 SvREFCNT_dec(type_pkg);
575 SvREFCNT_dec(type_meth);
577 #else /* MULTIPLICITY */
578 oi->orig_pkg = orig_pkg;
579 oi->type_pkg = type_pkg;
580 oi->type_meth = type_meth;
581 #endif /* !MULTIPLICITY */
585 LT_UNLOCK(<_op_map_mutex);
588 STATIC const lt_op_padxv_info *lt_padxv_map_fetch(const OP *o, lt_op_padxv_info *oi) {
589 const lt_op_padxv_info *val;
591 LT_LOCK(<_op_map_mutex);
593 val = ptable_fetch(lt_op_padxv_map, o);
599 LT_UNLOCK(<_op_map_mutex);
604 #if LT_HAS_PERL(5, 17, 6)
606 STATIC ptable *lt_op_padrange_map = NULL;
610 const OP *padxv_start;
611 } lt_op_padrange_info;
613 STATIC void lt_padrange_map_store(pTHX_ const OP *o, const OP *s, OP *(*old_pp)(pTHX)) {
614 #define lt_padrange_map_store(O, S, PP) lt_padrange_map_store(aTHX_ (O), (S), (PP))
615 lt_op_padrange_info *oi;
617 LT_LOCK(<_op_map_mutex);
619 if (!(oi = ptable_fetch(lt_op_padrange_map, o))) {
620 oi = PerlMemShared_malloc(sizeof *oi);
621 ptable_map_store(lt_op_padrange_map, o, oi);
627 LT_UNLOCK(<_op_map_mutex);
630 STATIC const lt_op_padrange_info *lt_padrange_map_fetch(const OP *o, lt_op_padrange_info *oi) {
631 const lt_op_padrange_info *val;
633 LT_LOCK(<_op_map_mutex);
635 val = ptable_fetch(lt_op_padrange_map, o);
641 LT_UNLOCK(<_op_map_mutex);
648 STATIC void lt_map_delete(pTHX_ const OP *o) {
649 #define lt_map_delete(O) lt_map_delete(aTHX_ (O))
650 LT_LOCK(<_op_map_mutex);
652 ptable_map_delete(lt_op_padxv_map, o);
653 #if LT_HAS_PERL(5, 17, 6)
654 ptable_map_delete(lt_op_padrange_map, o);
657 LT_UNLOCK(<_op_map_mutex);
660 /* --- Hooks --------------------------------------------------------------- */
662 /* ... Our pp_padsv ........................................................ */
664 STATIC OP *lt_pp_padsv(pTHX) {
667 if (lt_padxv_map_fetch(PL_op, &oi)) {
669 lt_op_padxv_info_call(&oi, TARG);
670 return oi.old_pp(aTHX);
673 return PL_op->op_ppaddr(aTHX);
676 /* ... Our pp_padrange (on perl 5.17.6 and above) .......................... */
678 #if LT_HAS_PERL(5, 17, 6)
680 STATIC OP *lt_pp_padrange(pTHX) {
681 lt_op_padrange_info roi;
683 if (lt_padrange_map_fetch(PL_op, &roi)) {
684 PADOFFSET i, base, count;
687 base = PL_op->op_targ;
688 count = PL_op->op_private & OPpPADRANGE_COUNTMASK;
690 for (i = 0, p = roi.padxv_start; i < count && p; ++i, p = p->op_next) {
691 while (p->op_type == OP_NULL)
694 if (p->op_type == OP_PADSV && lt_padxv_map_fetch(p, &oi))
695 lt_op_padxv_info_call(&oi, PAD_SV(base + i));
698 return roi.old_pp(aTHX);
701 return PL_op->op_ppaddr(aTHX);
706 /* ... Our ck_pad{any,sv} .................................................. */
708 /* Sadly, the padsv OPs we are interested in don't trigger the padsv check
709 * function, but are instead manually mutated from a padany. So we store
710 * the op entry in the op map in the padany check function, and we set their
711 * op_ppaddr member in our peephole optimizer replacement below. */
713 STATIC OP *(*lt_old_ck_padany)(pTHX_ OP *) = 0;
715 STATIC OP *lt_ck_padany(pTHX_ OP *o) {
719 o = lt_old_ck_padany(aTHX_ o);
721 stash = PL_in_my_stash;
722 if (stash && (code = lt_hint())) {
724 SV *orig_pkg = newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash));
725 SV *orig_meth = MY_CXT.default_meth; /* Guarded by lt_hint() */
727 SV *type_meth = NULL;
732 SvREADONLY_on(orig_pkg);
743 items = call_sv(code, G_ARRAY);
747 croak(__PACKAGE__ " mangler should return zero, one or two scalars, but got %d", items);
749 SvREFCNT_dec(orig_pkg);
758 type_meth = newSVsv(rsv);
759 SvREADONLY_on(type_meth);
764 type_pkg = newSVsv(rsv);
765 SvREADONLY_on(type_pkg);
775 SvREFCNT_inc_simple_void_NN(orig_pkg);
779 type_meth = orig_meth;
780 SvREFCNT_inc_simple_void_NN(orig_meth);
783 lt_padxv_map_store(o, orig_pkg, type_pkg, type_meth, o->op_ppaddr);
792 STATIC OP *(*lt_old_ck_padsv)(pTHX_ OP *) = 0;
794 STATIC OP *lt_ck_padsv(pTHX_ OP *o) {
797 return lt_old_ck_padsv(aTHX_ o);
800 /* ... Our peephole optimizer .............................................. */
802 #if LT_HAS_PERL(5, 17, 6)
804 STATIC int lt_maybe_padrange_setup(pTHX_ OP *o, const OP *start) {
805 #define lt_maybe_padrange_setup(O, S) lt_maybe_padrange_setup(aTHX_ (O), (S))
809 count = o->op_private & OPpPADRANGE_COUNTMASK;
811 for (i = 0, p = start; i < count && p; ++i, p = p->op_next) {
812 if (p->op_type == OP_PADSV) {
813 /* In a padrange sequence, either all lexicals are typed, or none are.
814 * Thus we can stop at the first padsv op. However, note that these
815 * lexicals can need to call different methods in different packages. */
816 LT_LOCK(<_op_map_mutex);
817 if (ptable_fetch(lt_op_padxv_map, p)) {
818 LT_UNLOCK(<_op_map_mutex);
819 lt_padrange_map_store(o, start, o->op_ppaddr);
820 o->op_ppaddr = lt_pp_padrange;
822 LT_UNLOCK(<_op_map_mutex);
833 STATIC peep_t lt_old_peep = 0; /* This is actually the rpeep past 5.13.5 */
835 STATIC void lt_peep_rec(pTHX_ OP *o, ptable *seen) {
836 #define lt_peep_rec(O) lt_peep_rec(aTHX_ (O), seen)
837 for (; o; o = o->op_next) {
838 if (ptable_fetch(seen, o))
840 ptable_seen_store(seen, o, o);
842 switch (o->op_type) {
844 if (o->op_ppaddr != lt_pp_padsv && o->op_private & OPpLVAL_INTRO) {
845 lt_op_padxv_info *oi;
846 LT_LOCK(<_op_map_mutex);
847 oi = ptable_fetch(lt_op_padxv_map, o);
849 oi->old_pp = o->op_ppaddr;
850 o->op_ppaddr = lt_pp_padsv;
852 LT_UNLOCK(<_op_map_mutex);
855 #if LT_HAS_PERL(5, 17, 6)
857 /* We deal with special padrange ops later, in the aassign op they belong
859 if (o->op_ppaddr != lt_pp_padrange && o->op_private & OPpLVAL_INTRO
860 && !(o->op_flags & OPf_SPECIAL)) {
861 /* A padrange op is guaranteed to have previously been a pushmark.
862 * Moreover, for non-special padrange ops (i.e. that aren't for
863 * my (...) = @_), the first original padxv is its sibling or nephew.
865 OP *kid = OP_SIBLING(o);
866 if (kid->op_type == OP_NULL && kid->op_flags & OPf_KIDS) {
867 kid = kUNOP->op_first;
868 if (kid->op_type == OP_NULL)
869 kid = OP_SIBLING(kid);
871 lt_maybe_padrange_setup(o, kid);
876 if (cBINOPo->op_first && cBINOPo->op_first->op_flags & OPf_KIDS
877 && (op = cUNOPx(cBINOPo->op_first)->op_first)
878 && op->op_type == OP_PADRANGE
879 && op->op_ppaddr != lt_pp_padrange
880 && op->op_private & OPpLVAL_INTRO
881 && op->op_flags & OPf_SPECIAL) {
882 const OP *start = cUNOPx(cBINOPo->op_last)->op_first;
883 if (start->op_type == OP_PUSHMARK)
884 start = OP_SIBLING(start);
885 lt_maybe_padrange_setup(op, start);
899 # if LT_HAS_PERL(5, 10, 0)
904 lt_peep_rec(cLOGOPo->op_other);
908 lt_peep_rec(cLOOPo->op_redoop);
909 lt_peep_rec(cLOOPo->op_nextop);
910 lt_peep_rec(cLOOPo->op_lastop);
912 # if LT_HAS_PERL(5, 9, 5)
914 lt_peep_rec(cPMOPo->op_pmstashstartu.op_pmreplstart);
920 lt_peep_rec(cPMOPo->op_pmreplstart);
923 #endif /* !LT_HAS_RPEEP */
930 STATIC void lt_peep(pTHX_ OP *o) {
932 ptable *seen = MY_CXT.seen;
934 lt_old_peep(aTHX_ o);
937 ptable_seen_clear(seen);
939 ptable_seen_clear(seen);
943 /* --- Interpreter setup/teardown ------------------------------------------ */
946 STATIC U32 lt_initialized = 0;
948 STATIC void lt_teardown(pTHX_ void *root) {
960 ptable_hints_free(MY_CXT.tbl);
963 ptable_seen_free(MY_CXT.seen);
965 SvREFCNT_dec(MY_CXT.default_meth);
966 MY_CXT.default_meth = NULL;
969 lt_ck_restore(OP_PADANY, <_old_ck_padany);
970 lt_ck_restore(OP_PADSV, <_old_ck_padsv);
973 PL_rpeepp = lt_old_peep;
975 PL_peepp = lt_old_peep;
982 STATIC void lt_setup(pTHX) {
983 #define lt_setup() lt_setup(aTHX)
990 MY_CXT.tbl = ptable_new();
993 MY_CXT.seen = ptable_new();
994 MY_CXT.default_meth = newSVpvn("TYPEDSCALAR", 11);
995 SvREADONLY_on(MY_CXT.default_meth);
998 lt_ck_replace(OP_PADANY, lt_ck_padany, <_old_ck_padany);
999 lt_ck_replace(OP_PADSV, lt_ck_padsv, <_old_ck_padsv);
1002 lt_old_peep = PL_rpeepp;
1003 PL_rpeepp = lt_peep;
1005 lt_old_peep = PL_peepp;
1010 call_atexit(lt_teardown, aTHX);
1012 call_atexit(lt_teardown, NULL);
1018 STATIC U32 lt_booted = 0;
1020 /* --- XS ------------------------------------------------------------------ */
1022 MODULE = Lexical::Types PACKAGE = Lexical::Types
1031 lt_op_padxv_map = ptable_new();
1032 #if LT_HAS_PERL(5, 17, 6)
1033 lt_op_padrange_map = ptable_new();
1036 MUTEX_INIT(<_op_map_mutex);
1039 PERL_HASH(lt_hash, __PACKAGE__, __PACKAGE_LEN__);
1041 stash = gv_stashpvn(__PACKAGE__, __PACKAGE_LEN__, 1);
1042 newCONSTSUB(stash, "LT_THREADSAFE", newSVuv(LT_THREADSAFE));
1043 newCONSTSUB(stash, "LT_FORKSAFE", newSVuv(LT_FORKSAFE));
1057 SV *cloned_default_meth;
1062 lt_ptable_clone_ud ud;
1066 lt_ptable_clone_ud_init(ud, t, MY_CXT.owner);
1067 ptable_walk(MY_CXT.tbl, lt_ptable_clone, &ud);
1068 cloned_default_meth = lt_dup_inc(MY_CXT.default_meth, &ud);
1069 lt_ptable_clone_ud_deinit(ud);
1076 MY_CXT.owner = aTHX;
1078 MY_CXT.default_meth = cloned_default_meth;
1080 gv = gv_fetchpv(__PACKAGE__ "::_THREAD_CLEANUP", 0, SVt_PVCV);
1086 if (!av_store(PL_endav, av_len(PL_endav) + 1, (SV *) cv))
1088 sv_magicext((SV *) PL_endav, NULL, PERL_MAGIC_ext, <_endav_vtbl, NULL, 0);
1093 _THREAD_CLEANUP(...)
1096 lt_thread_cleanup(aTHX_ NULL);
1105 RETVAL = lt_tag(value);