Home
last modified time | relevance | path

Searched refs:PL_stack_base (Results 1 – 25 of 494) sorted by relevance

12345678910>>...20

/dports/devel/p5-XS-Parse-Keyword/XS-Parse-Keyword-0.21/t/
H A Dinfix.xs60 I32 items = SP - PL_stack_base - markidx; in pp_intersperse()
100 U32 rhs_count = SP - (PL_stack_base + rhs_mark); in pp_addpairs()
103 SP = PL_stack_base + lhs_mark; in pp_addpairs()
105 SV **lhs = PL_stack_base + lhs_mark + 1; in pp_addpairs()
106 SV **rhs = PL_stack_base + rhs_mark + 1; in pp_addpairs()
/dports/lang/perl5.32/perl-5.32.1/
H A Dpp.h64 *mark_stack_entry = (I32)((p) - PL_stack_base); \
83 #define dMARK SV **mark = PL_stack_base + POPMARK
84 #define dORIGMARK const I32 origmark = (I32)(mark - PL_stack_base)
85 #define ORIGMARK (PL_stack_base + origmark)
304 SSize_t ix = (p) - PL_stack_base + (n); \
333 mark = PL_stack_base + markoff; \
381 const SSize_t markoff = mark - PL_stack_base;\
540 AvFILLp(f) = sp - PL_stack_base; \
541 PL_stack_base = AvARRAY(t); \
542 PL_stack_max = PL_stack_base + AvMAX(t); \
[all …]
H A Ddeb.c87 PTR2UV(PL_curstack), PTR2UV(PL_stack_base), in Perl_debstackptrs()
88 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base), in Perl_debstackptrs()
89 (IV)(PL_stack_max-PL_stack_base)); in Perl_debstackptrs()
170 deb_stack_n(PL_stack_base, in Perl_debstack()
172 PL_stack_sp - PL_stack_base, in Perl_debstack()
H A DXSUB.h102 #define ST(off) PL_stack_base[ax + (off)]
148 #define dAX const I32 ax = (I32)(MARK - PL_stack_base + 1)
152 SV **mark = PL_stack_base + ax++
166 SV **mark = PL_stack_base + ax; dSP; dITEMS
169 SV **mark = PL_stack_base + ax; dSP; dITEMS
175 SV **mark = PL_stack_base + ax; dSP; dITEMS
181 #define XSprePUSH (sp = PL_stack_base + ax - 1)
318 PL_stack_sp = PL_stack_base + ax + (tmpXSoff - 1); \
H A Dpp_sort.c889 cx = cx_pushblock(CXt_NULL, gimme, PL_stack_base, old_savestack_ix); in PP()
919 PL_stack_sp = PL_stack_base + cx->blk_oldsp; in PP()
1067 PL_stack_sp = PL_stack_base; in S_sortcv()
1073 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv()
1114 PL_stack_sp = PL_stack_base; in S_sortcv_stacked()
1120 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_stacked()
1139 SP = PL_stack_base; in S_sortcv_xsub()
1148 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_xsub()
/dports/lang/perl5.34/perl-5.34.0/
H A Dpp.h74 *mark_stack_entry = (I32)((p) - PL_stack_base); \
93 #define dMARK SV **mark = PL_stack_base + POPMARK
94 #define dORIGMARK const I32 origmark = (I32)(mark - PL_stack_base)
95 #define ORIGMARK (PL_stack_base + origmark)
321 SSize_t ix = (p) - PL_stack_base + (n); \
350 mark = PL_stack_base + markoff; \
398 const SSize_t markoff = mark - PL_stack_base;\
557 AvFILLp(f) = sp - PL_stack_base; \
558 PL_stack_base = AvARRAY(t); \
559 PL_stack_max = PL_stack_base + AvMAX(t); \
[all …]
H A Ddeb.c87 PTR2UV(PL_curstack), PTR2UV(PL_stack_base), in Perl_debstackptrs()
88 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base), in Perl_debstackptrs()
89 (IV)(PL_stack_max-PL_stack_base)); in Perl_debstackptrs()
170 deb_stack_n(PL_stack_base, in Perl_debstack()
172 PL_stack_sp - PL_stack_base, in Perl_debstack()
H A DXSUB.h117 #define ST(off) PL_stack_base[ax + (off)]
160 #define dAX const I32 ax = (I32)(MARK - PL_stack_base + 1)
164 SV **mark = PL_stack_base + ax++
178 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
181 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
187 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
193 #define XSprePUSH (sp = PL_stack_base + ax - 1)
328 PL_stack_sp = PL_stack_base + ax + (tmpXSoff - 1); \
H A Dpp_sort.c886 cx = cx_pushblock(CXt_NULL, gimme, PL_stack_base, old_savestack_ix); in PP()
916 PL_stack_sp = PL_stack_base + cx->blk_oldsp; in PP()
1064 PL_stack_sp = PL_stack_base; in S_sortcv()
1070 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv()
1111 PL_stack_sp = PL_stack_base; in S_sortcv_stacked()
1117 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_stacked()
1136 SP = PL_stack_base; in S_sortcv_xsub()
1145 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_xsub()
H A Dpp_ctl.c975 if (PL_stack_base + TOPMARK == SP) { in PP()
991 src = PL_stack_base[TOPMARK]; in PP()
2179 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
2320 cx->blk_oldsp = SP - PL_stack_base; in PP()
2354 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
2398 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in PP()
2646 PL_stack_sp = PL_stack_base in PP()
4568 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
4727 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
4773 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
[all …]
/dports/lang/perl5.30/perl-5.30.3/
H A Dpp.h64 *mark_stack_entry = (I32)((p) - PL_stack_base); \
83 #define dMARK SV **mark = PL_stack_base + POPMARK
84 #define dORIGMARK const I32 origmark = (I32)(mark - PL_stack_base)
85 #define ORIGMARK (PL_stack_base + origmark)
304 SSize_t ix = (p) - PL_stack_base + (n); \
333 mark = PL_stack_base + markoff; \
381 const SSize_t markoff = mark - PL_stack_base;\
540 AvFILLp(f) = sp - PL_stack_base; \
541 PL_stack_base = AvARRAY(t); \
542 PL_stack_max = PL_stack_base + AvMAX(t); \
[all …]
H A Ddeb.c87 PTR2UV(PL_curstack), PTR2UV(PL_stack_base), in Perl_debstackptrs()
88 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base), in Perl_debstackptrs()
89 (IV)(PL_stack_max-PL_stack_base)); in Perl_debstackptrs()
170 deb_stack_n(PL_stack_base, in Perl_debstack()
172 PL_stack_sp - PL_stack_base, in Perl_debstack()
H A DXSUB.h102 #define ST(off) PL_stack_base[ax + (off)]
148 #define dAX const I32 ax = (I32)(MARK - PL_stack_base + 1)
152 SV **mark = PL_stack_base + ax++
166 SV **mark = PL_stack_base + ax; dSP; dITEMS
169 SV **mark = PL_stack_base + ax; dSP; dITEMS
175 SV **mark = PL_stack_base + ax; dSP; dITEMS
181 #define XSprePUSH (sp = PL_stack_base + ax - 1)
314 PL_stack_sp = PL_stack_base + ax + (tmpXSoff - 1); \
H A Dpp_sort.c991 cx = cx_pushblock(CXt_NULL, gimme, PL_stack_base, old_savestack_ix); in PP()
1021 PL_stack_sp = PL_stack_base + cx->blk_oldsp; in PP()
1130 PL_stack_sp = PL_stack_base; in S_sortcv()
1136 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv()
1177 PL_stack_sp = PL_stack_base; in S_sortcv_stacked()
1183 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_stacked()
1202 SP = PL_stack_base; in S_sortcv_xsub()
1211 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_xsub()
/dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/
H A Dpp.h74 *mark_stack_entry = (I32)((p) - PL_stack_base); \
93 #define dMARK SV **mark = PL_stack_base + POPMARK
94 #define dORIGMARK const I32 origmark = (I32)(mark - PL_stack_base)
95 #define ORIGMARK (PL_stack_base + origmark)
321 SSize_t ix = (p) - PL_stack_base + (n); \
350 mark = PL_stack_base + markoff; \
398 const SSize_t markoff = mark - PL_stack_base;\
557 AvFILLp(f) = sp - PL_stack_base; \
558 PL_stack_base = AvARRAY(t); \
559 PL_stack_max = PL_stack_base + AvMAX(t); \
[all …]
H A Ddeb.c87 PTR2UV(PL_curstack), PTR2UV(PL_stack_base), in Perl_debstackptrs()
88 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base), in Perl_debstackptrs()
89 (IV)(PL_stack_max-PL_stack_base)); in Perl_debstackptrs()
170 deb_stack_n(PL_stack_base, in Perl_debstack()
172 PL_stack_sp - PL_stack_base, in Perl_debstack()
H A DXSUB.h117 #define ST(off) PL_stack_base[ax + (off)]
160 #define dAX const I32 ax = (I32)(MARK - PL_stack_base + 1)
164 SV **mark = PL_stack_base + ax++
178 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
181 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
187 SV **mark = PL_stack_base + ax - 1; dSP; dITEMS
193 #define XSprePUSH (sp = PL_stack_base + ax - 1)
328 PL_stack_sp = PL_stack_base + ax + (tmpXSoff - 1); \
H A Dpp_sort.c878 cx = cx_pushblock(CXt_NULL, gimme, PL_stack_base, old_savestack_ix); in PP()
908 PL_stack_sp = PL_stack_base + cx->blk_oldsp; in PP()
1056 PL_stack_sp = PL_stack_base; in S_sortcv()
1062 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv()
1103 PL_stack_sp = PL_stack_base; in S_sortcv_stacked()
1109 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_stacked()
1128 SP = PL_stack_base; in S_sortcv_xsub()
1137 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in S_sortcv_xsub()
H A Dpp_ctl.c975 if (PL_stack_base + TOPMARK == SP) { in PP()
991 src = PL_stack_base[TOPMARK]; in PP()
2179 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
2320 cx->blk_oldsp = SP - PL_stack_base; in PP()
2354 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
2398 assert(PL_stack_sp > PL_stack_base || *PL_stack_base == &PL_sv_undef); in PP()
2659 PL_stack_sp = PL_stack_base in PP()
4589 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
4748 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
4794 oldsp = PL_stack_base + cx->blk_oldsp; in PP()
[all …]
/dports/math/polymake/polymake-4.5/lib/core/src/perl/
H A DRefHash.xxs210 SV** firstkey=PL_stack_base+TOPMARK+1;
424 sp = PL_stack_base + sp_dist;
464 SV** lhs = PL_stack_base+lastR+1;
491 …SV* tmp_val = PL_stack_base[firstR] ? newSVsv(PL_stack_base[firstR]) : newSV_type(SVt_NULL); //…
516 SP = PL_stack_base + lastR;
524 SP = PL_stack_base+firstR-1;
526 SP = PL_stack_base+lastR;
529 SP = PL_stack_base+firstR;
578 SSize_t sp_dist = SP - PL_stack_base;
589 SSize_t sp_dist = SP - PL_stack_base+1;
[all …]
/dports/devel/p5-B-C/B-C-1.57/ramblings/
H A Dblogs-optimizing-4.md35 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* only needed once */
41 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* unneeded */
47 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* unneeded */
53 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* unneeded */
58 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* unneeded */
84 `sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;` is the 2nd part of the inlined code for
118 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
124 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
165 sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; /* rarely needed */
/dports/devel/p5-List-SomeUtils-XS/List-SomeUtils-XS-0.58/
H A DXS.xs620 SV **args = &PL_stack_base[ax];
658 SV **args = &PL_stack_base[ax];
697 SV **args = &PL_stack_base[ax];
835 SV **args = &PL_stack_base[ax];
872 SV **args = &PL_stack_base[ax];
913 SV **args = &PL_stack_base[ax];
952 SV **args = &PL_stack_base[ax];
990 SV **args = &PL_stack_base[ax];
1029 SV **args = &PL_stack_base[ax];
1312 SV **args = &PL_stack_base[ax]; in uniq()
[all …]
/dports/devel/p5-List-UtilsBy-XS/List-UtilsBy-XS-0.05/xs-src/
H A DUtilsBy.xs83 SV **args = &PL_stack_base[ax]; in sort_by()
149 SV **args = &PL_stack_base[ax]; in nsort_by()
304 SV **args = &PL_stack_base[ax]; in uniq_by()
357 SV **args = &PL_stack_base[ax]; in partition_by()
419 SV **args = &PL_stack_base[ax]; in count_by()
477 SV **args = &PL_stack_base[ax]; in zip_by()
550 SV **args = &PL_stack_base[ax]; in unzip_by()
621 SV **args = &PL_stack_base[ax]; in extract_by()
697 SV **args = &PL_stack_base[ax]; in weighted_shuffle_by()
790 SV **args = &PL_stack_base[ax]; in bundle_by()
/dports/lang/p5-List-MoreUtils-XS/List-MoreUtils-XS-0.430/
H A DXS.xs1123 SV **args = &PL_stack_base[ax];
1476 SV **args = &PL_stack_base[ax];
1570 SV **args = &PL_stack_base[ax];
1970 SV **args = &PL_stack_base[ax]; in uniq()
2026 SV **args = &PL_stack_base[ax]; in singleton()
2081 SV **args = &PL_stack_base[ax]; in duplicates()
2137 SV **args = &PL_stack_base[ax]; in frequency()
2190 SV **args = &PL_stack_base[ax]; in occurrences()
2257 SV **args = &PL_stack_base[ax]; in mode()
2467 SV **args = &PL_stack_base[ax];
[all …]
/dports/japanese/p5-Unicode-Japanese/Unicode-Japanese-0.49/
H A Dgetcode.c11 #define dAX I32 ax = MARK - PL_stack_base + 1
24 #if PERL_VERSION <= 4 && !defined(PL_stack_base)
27 #define PL_stack_base Perl_stack_base macro

12345678910>>...20