1 #define PERL_NO_GET_CONTEXT /* we want efficiency */
6 /* ... op => info map ................................................. */
13 #define PTABLE_NAME ptable_map
14 #define PTABLE_VAL_FREE(V) PerlMemShared_free(V)
16 #define ptable_map_store(T, K, V) ptable_map_store(aPTBLMS_ (T), (K), (V))
18 STATIC ptable *ab_op_map = NULL;
21 STATIC perl_mutex ab_op_map_mutex;
24 STATIC const ab_op_info *ab_map_fetch(const OP *o, ab_op_info *oi) {
25 const ab_op_info *val;
28 MUTEX_LOCK(&ab_op_map_mutex);
31 val = (ab_op_info *)ptable_fetch(ab_op_map, o);
38 MUTEX_UNLOCK(&ab_op_map_mutex);
44 STATIC const ab_op_info *ab_map_store_locked(
45 pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), IV base
47 #define ab_map_store_locked(O, PP, B) \
48 ab_map_store_locked(aPTBLMS_ (O), (PP), (B))
51 if (!(oi = (ab_op_info *)ptable_fetch(ab_op_map, o))) {
52 oi = (ab_op_info *)PerlMemShared_malloc(sizeof *oi);
53 ptable_map_store(ab_op_map, o, oi);
61 STATIC void ab_map_store(
62 pPTBLMS_ const OP *o, OP *(*old_pp)(pTHX), IV base)
64 #define ab_map_store(O, PP, B) ab_map_store(aPTBLMS_ (O),(PP),(B))
67 MUTEX_LOCK(&ab_op_map_mutex);
70 ab_map_store_locked(o, old_pp, base);
73 MUTEX_UNLOCK(&ab_op_map_mutex);
77 STATIC void ab_map_delete(pTHX_ const OP *o) {
78 #define ab_map_delete(O) ab_map_delete(aTHX_ (O))
80 MUTEX_LOCK(&ab_op_map_mutex);
83 ptable_map_store(ab_op_map, o, NULL);
86 MUTEX_UNLOCK(&ab_op_map_mutex);
90 /* ... $[ Implementation .............................................. */
93 #define hintkey_len (sizeof(hintkey)-1)
95 STATIC SV * ab_hint(pTHX_ const bool create) {
96 #define ab_hint(c) ab_hint(aTHX_ c)
99 = hv_fetch(GvHV(PL_hintgv), hintkey, hintkey_len, create);
105 STATIC IV current_base(pTHX) {
106 #define current_base() current_base(aTHX)
107 SV *hsv = ab_hint(0);
108 if (!hsv || !SvOK(hsv)) return 0;
112 STATIC void set_arybase_to(pTHX_ IV base) {
113 #define set_arybase_to(base) set_arybase_to(aTHX_ (base))
115 SV *hsv = ab_hint(1);
116 sv_setiv_mg(hsv, base);
119 #define old_ck(opname) STATIC OP *(*ab_old_ck_##opname)(pTHX_ OP *) = 0
134 STATIC bool ab_op_is_dollar_bracket(pTHX_ OP *o) {
135 #define ab_op_is_dollar_bracket(o) ab_op_is_dollar_bracket(aTHX_ (o))
137 return o->op_type == OP_RV2SV && (o->op_flags & OPf_KIDS)
138 && (c = cUNOPx(o)->op_first)
139 && c->op_type == OP_GV
140 && strEQ(GvNAME(cGVOPx_gv(c)), "[");
143 STATIC void ab_neuter_dollar_bracket(pTHX_ OP *o) {
144 #define ab_neuter_dollar_bracket(o) ab_neuter_dollar_bracket(aTHX_ (o))
147 * Must replace the core's $[ with something that can accept assignment
148 * of non-zero value and can be local()ised. Simplest thing is a
149 * different global variable.
151 oldc = cUNOPx(o)->op_first;
152 newc = newGVOP(OP_GV, 0,
153 gv_fetchpvs("arybase::[", GV_ADDMULTI, SVt_PVGV));
154 cUNOPx(o)->op_first = newc;
158 STATIC void ab_process_assignment(pTHX_ OP *left, OP *right) {
159 #define ab_process_assignment(l, r) \
160 ab_process_assignment(aTHX_ (l), (r))
161 if (ab_op_is_dollar_bracket(left) && right->op_type == OP_CONST) {
162 set_arybase_to(SvIV(cSVOPx_sv(right)));
163 ab_neuter_dollar_bracket(left);
167 STATIC OP *ab_ck_sassign(pTHX_ OP *o) {
168 o = (*ab_old_ck_sassign)(aTHX_ o);
169 if (o->op_type == OP_SASSIGN) {
170 OP *right = cBINOPx(o)->op_first;
171 OP *left = right->op_sibling;
172 if (left) ab_process_assignment(left, right);
177 STATIC OP *ab_ck_aassign(pTHX_ OP *o) {
178 o = (*ab_old_ck_aassign)(aTHX_ o);
179 if (o->op_type == OP_AASSIGN) {
180 OP *right = cBINOPx(o)->op_first;
181 OP *left = cBINOPx(right->op_sibling)->op_first->op_sibling;
182 right = cBINOPx(right)->op_first->op_sibling;
183 ab_process_assignment(left, right);
189 tie(pTHX_ SV * const sv, SV * const obj, HV *const stash)
191 SV *rv = newSV_type(SVt_RV);
193 SvRV_set(rv, obj ? SvREFCNT_inc_simple_NN(obj) : newSV(0));
197 sv_unmagic((SV *)sv, PERL_MAGIC_tiedscalar);
198 sv_magic((SV *)sv, rv, PERL_MAGIC_tiedscalar, NULL, 0);
199 SvREFCNT_dec(rv); /* As sv_magic increased it by one. */
202 /* This function converts from base-based to 0-based an index to be passed
205 adjust_index(IV index, IV base)
207 if (index >= base || index > -1) return index-base;
210 /* This function converts from 0-based to base-based an index to
213 adjust_index_r(IV index, IV base)
218 #define replace_sv(sv,base) \
219 ((sv) = sv_2mortal(newSViv(adjust_index(SvIV(sv),base))))
220 #define replace_sv_r(sv,base) \
221 ((sv) = sv_2mortal(newSViv(adjust_index_r(SvIV(sv),base))))
223 static OP *ab_pp_basearg(pTHX) {
229 ab_map_fetch(PL_op, &oi);
231 switch (PL_op->op_type) {
236 firstp = PL_stack_base + TOPMARK + 1;
240 firstp = PL_stack_base + *(PL_markstack_ptr-2)+1;
241 count = TOPMARK - *(PL_markstack_ptr-2);
242 if (GIMME != G_ARRAY) {
248 if (SP - PL_stack_base - TOPMARK >= 2)
249 firstp = PL_stack_base + TOPMARK + 2;
253 firstp = SP-(PL_op->op_private & 7)+2;
257 "panic: invalid op type for arybase.xs:ab_pp_basearg: %d",
261 while (count--) replace_sv(*svp,oi.base), svp++;
262 return (*oi.old_pp)(aTHX);
265 static OP *ab_pp_av2arylen(pTHX) {
270 ab_map_fetch(PL_op, &oi);
271 ret = (*oi.old_pp)(aTHX);
272 if (PL_op->op_flags & OPf_MOD || LVRET) {
274 tie(aTHX_ sv, TOPs, gv_stashpv("arybase::mg",1));
279 if (SvOK(TOPs)) replace_sv_r(TOPs, oi.base);
284 static OP *ab_pp_keys(pTHX) {
288 const I32 offset = SP - PL_stack_base;
290 ab_map_fetch(PL_op, &oi);
291 retval = (*oi.old_pp)(aTHX);
292 if (GIMME_V == G_SCALAR) return retval;
294 svp = PL_stack_base + offset;
295 while (svp <= SP) replace_sv_r(*svp,oi.base), ++svp;
299 static OP *ab_pp_each(pTHX) {
303 const I32 offset = SP - PL_stack_base;
304 ab_map_fetch(PL_op, &oi);
305 retval = (*oi.old_pp)(aTHX);
307 if (GIMME_V == G_SCALAR) {
308 if (SvOK(TOPs)) replace_sv_r(TOPs,oi.base);
310 else if (offset < SP - PL_stack_base) replace_sv_r(TOPm1s,oi.base);
314 static OP *ab_pp_index(pTHX) {
318 ab_map_fetch(PL_op, &oi);
319 if (MAXARG == 3 && TOPs) replace_sv(TOPs,oi.base);
320 retval = (*oi.old_pp)(aTHX);
322 replace_sv_r(TOPs,oi.base);
326 static OP *ab_ck_base(pTHX_ OP *o)
328 OP * (*old_ck)(pTHX_ OP *o) = 0;
329 OP * (*new_pp)(pTHX) = ab_pp_basearg;
330 switch (o->op_type) {
331 case OP_AELEM : old_ck = ab_old_ck_aelem ; break;
332 case OP_ASLICE : old_ck = ab_old_ck_aslice ; break;
333 case OP_LSLICE : old_ck = ab_old_ck_lslice ; break;
334 case OP_AV2ARYLEN: old_ck = ab_old_ck_av2arylen; break;
335 case OP_SPLICE : old_ck = ab_old_ck_splice ; break;
336 case OP_KEYS : old_ck = ab_old_ck_keys ; break;
337 case OP_EACH : old_ck = ab_old_ck_each ; break;
338 case OP_SUBSTR : old_ck = ab_old_ck_substr ; break;
339 case OP_RINDEX : old_ck = ab_old_ck_rindex ; break;
340 case OP_INDEX : old_ck = ab_old_ck_index ; break;
341 case OP_POS : old_ck = ab_old_ck_pos ; break;
343 o = (*old_ck)(aTHX_ o);
344 /* We need two switch blocks, as the type may have changed. */
345 switch (o->op_type) {
350 case OP_SUBSTR : break;
352 case OP_AV2ARYLEN: new_pp = ab_pp_av2arylen ; break;
353 case OP_AKEYS : new_pp = ab_pp_keys ; break;
354 case OP_AEACH : new_pp = ab_pp_each ; break;
356 case OP_INDEX : new_pp = ab_pp_index ; break;
360 IV const base = current_base();
362 ab_map_store(o, o->op_ppaddr, base);
363 o->op_ppaddr = new_pp;
364 /* Break the aelemfast optimisation */
365 if (o->op_type == OP_AELEM &&
366 cBINOPo->op_first->op_sibling->op_type == OP_CONST) {
367 cBINOPo->op_first->op_sibling
368 = newUNOP(OP_NULL,0,cBINOPo->op_first->op_sibling);
371 else ab_map_delete(o);
377 STATIC U32 ab_initialized = 0;
379 /* --- XS ------------------------------------------------------------- */
381 MODULE = arybase PACKAGE = arybase
386 GV *const gv = gv_fetchpvn("[", 1, GV_ADDMULTI|GV_NOTQUAL, SVt_PV);
387 tie(aTHX_ GvSV(gv), NULL, GvSTASH(CvGV(cv)));
389 if (!ab_initialized++) {
390 ab_op_map = ptable_new();
392 MUTEX_INIT(&ab_op_map_mutex);
394 #define check(uc,lc,ck) ab_old_ck_##lc = PL_check[OP_##uc]; \
395 PL_check[OP_##uc] = ab_ck_##ck
396 check(SASSIGN, sassign, sassign);
397 check(AASSIGN, aassign, aassign);
398 check(AELEM, aelem, base);
399 check(ASLICE, aslice, base);
400 check(LSLICE, lslice, base);
401 check(AV2ARYLEN,av2arylen,base);
402 check(SPLICE, splice, base);
403 check(KEYS, keys, base);
404 check(EACH, each, base);
405 check(SUBSTR, substr, base);
406 check(RINDEX, rindex, base);
407 check(INDEX, index, base);
408 check(POS, pos, base);
415 SV *ret = cop_hints_fetch_pvs(PL_curcop, "$[", 0);
417 if (!SvOK(ret)) mXPUSHi(0);
421 STORE(SV *sv, IV newbase)
423 SV *base = cop_hints_fetch_pvs(PL_curcop, "$[", 0);
425 if (SvOK(base) ? SvIV(base) == newbase : !newbase) XSRETURN_EMPTY;
426 Perl_croak(aTHX_ "That use of $[ is unsupported");
429 MODULE = arybase PACKAGE = arybase::mg
435 if (!SvROK(sv) || SvTYPE(SvRV(sv)) >= SVt_PVAV)
436 Perl_croak(aTHX_ "Not a SCALAR reference");
438 SV *base = cop_hints_fetch_pvs(PL_curcop, "$[", 0);
439 SvGETMAGIC(SvRV(sv));
440 if (!SvOK(SvRV(sv))) XSRETURN_UNDEF;
441 mXPUSHi(adjust_index_r(
442 SvIV_nomg(SvRV(sv)), SvOK(base)?SvIV(base):0
447 STORE(SV *sv, SV *newbase)
449 if (!SvROK(sv) || SvTYPE(SvRV(sv)) >= SVt_PVAV)
450 Perl_croak(aTHX_ "Not a SCALAR reference");
452 SV *base = cop_hints_fetch_pvs(PL_curcop, "$[", 0);
454 if (!SvOK(newbase)) SvSetMagicSV(SvRV(sv),&PL_sv_undef);
458 adjust_index(SvIV_nomg(newbase),SvOK(base)?SvIV(base):0)