Lines Matching refs:tmps_base
2301 SSize_t tmps_base; in PP() local
2361 tmps_base = PL_tmps_ix + 1; in PP()
2363 PL_tmps_stack[tmps_base + i] = &PL_sv_undef; in PP()
2386 assert(tmps_base <= PL_tmps_max); in PP()
2387 PL_tmps_stack[tmps_base++] = rsv; in PP()
2411 assert(tmps_base <= PL_tmps_max); in PP()
2412 PL_tmps_stack[tmps_base++] = rsv; in PP()
2421 tmps_base -= nelems; in PP()
2427 SV **svp = &(PL_tmps_stack[tmps_base + i]); in PP()
2438 PL_tmps_stack[tmps_base - 1] = &PL_sv_undef; in PP()
2447 Copy(&(PL_tmps_stack[tmps_base]), AvARRAY(ary), nelems, SV*); in PP()
2452 if (UNLIKELY(PL_tmps_ix >= tmps_base + nelems)) in PP()
2453 Move(&PL_tmps_stack[tmps_base + nelems], in PP()
2454 &PL_tmps_stack[tmps_base - 1], in PP()
2455 PL_tmps_ix - (tmps_base + nelems) + 1, in PP()
2474 SSize_t tmps_base; in PP() local
2507 tmps_base = PL_tmps_ix + 1; in PP()
2509 PL_tmps_stack[tmps_base + i] = &PL_sv_undef; in PP()
2535 assert(tmps_base <= PL_tmps_max); in PP()
2536 PL_tmps_stack[tmps_base++] = rsv; in PP()
2538 tmps_base -= nelems; in PP()
2612 PL_tmps_stack[tmps_base + i] = &PL_sv_undef; in PP()
2639 PL_tmps_stack[tmps_base + i] = &PL_sv_undef; in PP()
2653 PL_tmps_stack[tmps_base - 1] = &PL_sv_undef; in PP()
2660 if (UNLIKELY(PL_tmps_ix >= tmps_base + nelems)) in PP()
2661 Move(&PL_tmps_stack[tmps_base + nelems], in PP()
2662 &PL_tmps_stack[tmps_base - 1], in PP()
2663 PL_tmps_ix - (tmps_base + nelems) + 1, in PP()
4624 SSize_t tmps_base; /* lowest index into tmps stack that needs freeing now */ in Perl_leave_adjust_stacks() local
4653 tmps_base = PL_tmps_floor + 1; in Perl_leave_adjust_stacks()
4662 tmps_basep = PL_tmps_stack + tmps_base; in Perl_leave_adjust_stacks()
4863 tmps_base = tmps_basep - PL_tmps_stack; in Perl_leave_adjust_stacks()
4869 while (PL_tmps_ix >= tmps_base) { in Perl_leave_adjust_stacks()