| 1 | /* gv.c |
| 2 | * |
| 3 | * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
| 4 | * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall and others |
| 5 | * |
| 6 | * You may distribute under the terms of either the GNU General Public |
| 7 | * License or the Artistic License, as specified in the README file. |
| 8 | * |
| 9 | */ |
| 10 | |
| 11 | /* |
| 12 | * 'Mercy!' cried Gandalf. 'If the giving of information is to be the cure |
| 13 | * of your inquisitiveness, I shall spend all the rest of my days in answering |
| 14 | * you. What more do you want to know?' |
| 15 | * 'The names of all the stars, and of all living things, and the whole |
| 16 | * history of Middle-earth and Over-heaven and of the Sundering Seas,' |
| 17 | * laughed Pippin. |
| 18 | * |
| 19 | * [p.599 of _The Lord of the Rings_, III/xi: "The PalantÃr"] |
| 20 | */ |
| 21 | |
| 22 | /* |
| 23 | =head1 GV Functions |
| 24 | A GV is a structure which corresponds to to a Perl typeglob, ie *foo. |
| 25 | It is a structure that holds a pointer to a scalar, an array, a hash etc, |
| 26 | corresponding to $foo, @foo, %foo. |
| 27 | |
| 28 | GVs are usually found as values in stashes (symbol table hashes) where |
| 29 | Perl stores its global variables. |
| 30 | |
| 31 | =cut |
| 32 | */ |
| 33 | |
| 34 | #include "EXTERN.h" |
| 35 | #define PERL_IN_GV_C |
| 36 | #include "perl.h" |
| 37 | #include "overload.inc" |
| 38 | #include "keywords.h" |
| 39 | #include "feature.h" |
| 40 | |
| 41 | static const char S_autoload[] = "AUTOLOAD"; |
| 42 | #define S_autolen (sizeof("AUTOLOAD")-1) |
| 43 | |
| 44 | GV * |
| 45 | Perl_gv_add_by_type(pTHX_ GV *gv, svtype type) |
| 46 | { |
| 47 | SV **where; |
| 48 | |
| 49 | if ( |
| 50 | !gv |
| 51 | || ( |
| 52 | SvTYPE((const SV *)gv) != SVt_PVGV |
| 53 | && SvTYPE((const SV *)gv) != SVt_PVLV |
| 54 | ) |
| 55 | ) { |
| 56 | const char *what; |
| 57 | if (type == SVt_PVIO) { |
| 58 | /* |
| 59 | * if it walks like a dirhandle, then let's assume that |
| 60 | * this is a dirhandle. |
| 61 | */ |
| 62 | what = OP_IS_DIRHOP(PL_op->op_type) ? |
| 63 | "dirhandle" : "filehandle"; |
| 64 | } else if (type == SVt_PVHV) { |
| 65 | what = "hash"; |
| 66 | } else { |
| 67 | what = type == SVt_PVAV ? "array" : "scalar"; |
| 68 | } |
| 69 | /* diag_listed_as: Bad symbol for filehandle */ |
| 70 | Perl_croak(aTHX_ "Bad symbol for %s", what); |
| 71 | } |
| 72 | |
| 73 | if (type == SVt_PVHV) { |
| 74 | where = (SV **)&GvHV(gv); |
| 75 | } else if (type == SVt_PVAV) { |
| 76 | where = (SV **)&GvAV(gv); |
| 77 | } else if (type == SVt_PVIO) { |
| 78 | where = (SV **)&GvIOp(gv); |
| 79 | } else { |
| 80 | where = &GvSV(gv); |
| 81 | } |
| 82 | |
| 83 | if (!*where) |
| 84 | { |
| 85 | *where = newSV_type(type); |
| 86 | if (type == SVt_PVAV |
| 87 | && memEQs(GvNAME(gv), GvNAMELEN(gv), "ISA")) |
| 88 | sv_magic(*where, (SV *)gv, PERL_MAGIC_isa, NULL, 0); |
| 89 | } |
| 90 | return gv; |
| 91 | } |
| 92 | |
| 93 | GV * |
| 94 | Perl_gv_fetchfile(pTHX_ const char *name) |
| 95 | { |
| 96 | PERL_ARGS_ASSERT_GV_FETCHFILE; |
| 97 | return gv_fetchfile_flags(name, strlen(name), 0); |
| 98 | } |
| 99 | |
| 100 | GV * |
| 101 | Perl_gv_fetchfile_flags(pTHX_ const char *const name, const STRLEN namelen, |
| 102 | const U32 flags) |
| 103 | { |
| 104 | char smallbuf[128]; |
| 105 | char *tmpbuf; |
| 106 | const STRLEN tmplen = namelen + 2; |
| 107 | GV *gv; |
| 108 | |
| 109 | PERL_ARGS_ASSERT_GV_FETCHFILE_FLAGS; |
| 110 | PERL_UNUSED_ARG(flags); |
| 111 | |
| 112 | if (!PL_defstash) |
| 113 | return NULL; |
| 114 | |
| 115 | if (tmplen <= sizeof smallbuf) |
| 116 | tmpbuf = smallbuf; |
| 117 | else |
| 118 | Newx(tmpbuf, tmplen, char); |
| 119 | /* This is where the debugger's %{"::_<$filename"} hash is created */ |
| 120 | tmpbuf[0] = '_'; |
| 121 | tmpbuf[1] = '<'; |
| 122 | memcpy(tmpbuf + 2, name, namelen); |
| 123 | gv = *(GV**)hv_fetch(PL_defstash, tmpbuf, tmplen, TRUE); |
| 124 | if (!isGV(gv)) { |
| 125 | gv_init(gv, PL_defstash, tmpbuf, tmplen, FALSE); |
| 126 | #ifdef PERL_DONT_CREATE_GVSV |
| 127 | GvSV(gv) = newSVpvn(name, namelen); |
| 128 | #else |
| 129 | sv_setpvn(GvSV(gv), name, namelen); |
| 130 | #endif |
| 131 | } |
| 132 | if (PERLDB_LINE_OR_SAVESRC && !GvAV(gv)) |
| 133 | hv_magic(GvHVn(gv), GvAVn(gv), PERL_MAGIC_dbfile); |
| 134 | if (tmpbuf != smallbuf) |
| 135 | Safefree(tmpbuf); |
| 136 | return gv; |
| 137 | } |
| 138 | |
| 139 | /* |
| 140 | =for apidoc gv_const_sv |
| 141 | |
| 142 | If C<gv> is a typeglob whose subroutine entry is a constant sub eligible for |
| 143 | inlining, or C<gv> is a placeholder reference that would be promoted to such |
| 144 | a typeglob, then returns the value returned by the sub. Otherwise, returns |
| 145 | C<NULL>. |
| 146 | |
| 147 | =cut |
| 148 | */ |
| 149 | |
| 150 | SV * |
| 151 | Perl_gv_const_sv(pTHX_ GV *gv) |
| 152 | { |
| 153 | PERL_ARGS_ASSERT_GV_CONST_SV; |
| 154 | PERL_UNUSED_CONTEXT; |
| 155 | |
| 156 | if (SvTYPE(gv) == SVt_PVGV) |
| 157 | return cv_const_sv(GvCVu(gv)); |
| 158 | return SvROK(gv) && SvTYPE(SvRV(gv)) != SVt_PVAV && SvTYPE(SvRV(gv)) != SVt_PVCV ? SvRV(gv) : NULL; |
| 159 | } |
| 160 | |
| 161 | GP * |
| 162 | Perl_newGP(pTHX_ GV *const gv) |
| 163 | { |
| 164 | GP *gp; |
| 165 | U32 hash; |
| 166 | const char *file; |
| 167 | STRLEN len; |
| 168 | #ifndef USE_ITHREADS |
| 169 | GV *filegv; |
| 170 | #endif |
| 171 | dVAR; |
| 172 | |
| 173 | PERL_ARGS_ASSERT_NEWGP; |
| 174 | Newxz(gp, 1, GP); |
| 175 | gp->gp_egv = gv; /* allow compiler to reuse gv after this */ |
| 176 | #ifndef PERL_DONT_CREATE_GVSV |
| 177 | gp->gp_sv = newSV(0); |
| 178 | #endif |
| 179 | |
| 180 | /* PL_curcop may be null here. E.g., |
| 181 | INIT { bless {} and exit } |
| 182 | frees INIT before looking up DESTROY (and creating *DESTROY) |
| 183 | */ |
| 184 | if (PL_curcop) { |
| 185 | gp->gp_line = CopLINE(PL_curcop); /* 0 otherwise Newxz */ |
| 186 | #ifdef USE_ITHREADS |
| 187 | if (CopFILE(PL_curcop)) { |
| 188 | file = CopFILE(PL_curcop); |
| 189 | len = strlen(file); |
| 190 | } |
| 191 | #else |
| 192 | filegv = CopFILEGV(PL_curcop); |
| 193 | if (filegv) { |
| 194 | file = GvNAME(filegv)+2; |
| 195 | len = GvNAMELEN(filegv)-2; |
| 196 | } |
| 197 | #endif |
| 198 | else goto no_file; |
| 199 | } |
| 200 | else { |
| 201 | no_file: |
| 202 | file = ""; |
| 203 | len = 0; |
| 204 | } |
| 205 | |
| 206 | PERL_HASH(hash, file, len); |
| 207 | gp->gp_file_hek = share_hek(file, len, hash); |
| 208 | gp->gp_refcnt = 1; |
| 209 | |
| 210 | return gp; |
| 211 | } |
| 212 | |
| 213 | /* Assign CvGV(cv) = gv, handling weak references. |
| 214 | * See also S_anonymise_cv_maybe */ |
| 215 | |
| 216 | void |
| 217 | Perl_cvgv_set(pTHX_ CV* cv, GV* gv) |
| 218 | { |
| 219 | GV * const oldgv = CvNAMED(cv) ? NULL : SvANY(cv)->xcv_gv_u.xcv_gv; |
| 220 | HEK *hek; |
| 221 | PERL_ARGS_ASSERT_CVGV_SET; |
| 222 | |
| 223 | if (oldgv == gv) |
| 224 | return; |
| 225 | |
| 226 | if (oldgv) { |
| 227 | if (CvCVGV_RC(cv)) { |
| 228 | SvREFCNT_dec_NN(oldgv); |
| 229 | CvCVGV_RC_off(cv); |
| 230 | } |
| 231 | else { |
| 232 | sv_del_backref(MUTABLE_SV(oldgv), MUTABLE_SV(cv)); |
| 233 | } |
| 234 | } |
| 235 | else if ((hek = CvNAME_HEK(cv))) { |
| 236 | unshare_hek(hek); |
| 237 | CvLEXICAL_off(cv); |
| 238 | } |
| 239 | |
| 240 | CvNAMED_off(cv); |
| 241 | SvANY(cv)->xcv_gv_u.xcv_gv = gv; |
| 242 | assert(!CvCVGV_RC(cv)); |
| 243 | |
| 244 | if (!gv) |
| 245 | return; |
| 246 | |
| 247 | if (isGV_with_GP(gv) && GvGP(gv) && (GvCV(gv) == cv || GvFORM(gv) == cv)) |
| 248 | Perl_sv_add_backref(aTHX_ MUTABLE_SV(gv), MUTABLE_SV(cv)); |
| 249 | else { |
| 250 | CvCVGV_RC_on(cv); |
| 251 | SvREFCNT_inc_simple_void_NN(gv); |
| 252 | } |
| 253 | } |
| 254 | |
| 255 | /* Convert CvSTASH + CvNAME_HEK into a GV. Conceptually, all subs have a |
| 256 | GV, but for efficiency that GV may not in fact exist. This function, |
| 257 | called by CvGV, reifies it. */ |
| 258 | |
| 259 | GV * |
| 260 | Perl_cvgv_from_hek(pTHX_ CV *cv) |
| 261 | { |
| 262 | GV *gv; |
| 263 | SV **svp; |
| 264 | PERL_ARGS_ASSERT_CVGV_FROM_HEK; |
| 265 | assert(SvTYPE(cv) == SVt_PVCV); |
| 266 | if (!CvSTASH(cv)) return NULL; |
| 267 | ASSUME(CvNAME_HEK(cv)); |
| 268 | svp = hv_fetchhek(CvSTASH(cv), CvNAME_HEK(cv), 0); |
| 269 | gv = MUTABLE_GV(svp && *svp ? *svp : newSV(0)); |
| 270 | if (!isGV(gv)) |
| 271 | gv_init_pvn(gv, CvSTASH(cv), HEK_KEY(CvNAME_HEK(cv)), |
| 272 | HEK_LEN(CvNAME_HEK(cv)), |
| 273 | SVf_UTF8 * !!HEK_UTF8(CvNAME_HEK(cv))); |
| 274 | if (!CvNAMED(cv)) { /* gv_init took care of it */ |
| 275 | assert (SvANY(cv)->xcv_gv_u.xcv_gv == gv); |
| 276 | return gv; |
| 277 | } |
| 278 | unshare_hek(CvNAME_HEK(cv)); |
| 279 | CvNAMED_off(cv); |
| 280 | SvANY(cv)->xcv_gv_u.xcv_gv = gv; |
| 281 | if (svp && *svp) SvREFCNT_inc_simple_void_NN(gv); |
| 282 | CvCVGV_RC_on(cv); |
| 283 | return gv; |
| 284 | } |
| 285 | |
| 286 | /* Assign CvSTASH(cv) = st, handling weak references. */ |
| 287 | |
| 288 | void |
| 289 | Perl_cvstash_set(pTHX_ CV *cv, HV *st) |
| 290 | { |
| 291 | HV *oldst = CvSTASH(cv); |
| 292 | PERL_ARGS_ASSERT_CVSTASH_SET; |
| 293 | if (oldst == st) |
| 294 | return; |
| 295 | if (oldst) |
| 296 | sv_del_backref(MUTABLE_SV(oldst), MUTABLE_SV(cv)); |
| 297 | SvANY(cv)->xcv_stash = st; |
| 298 | if (st) |
| 299 | Perl_sv_add_backref(aTHX_ MUTABLE_SV(st), MUTABLE_SV(cv)); |
| 300 | } |
| 301 | |
| 302 | /* |
| 303 | =for apidoc gv_init_pvn |
| 304 | |
| 305 | Converts a scalar into a typeglob. This is an incoercible typeglob; |
| 306 | assigning a reference to it will assign to one of its slots, instead of |
| 307 | overwriting it as happens with typeglobs created by C<SvSetSV>. Converting |
| 308 | any scalar that is C<SvOK()> may produce unpredictable results and is reserved |
| 309 | for perl's internal use. |
| 310 | |
| 311 | C<gv> is the scalar to be converted. |
| 312 | |
| 313 | C<stash> is the parent stash/package, if any. |
| 314 | |
| 315 | C<name> and C<len> give the name. The name must be unqualified; |
| 316 | that is, it must not include the package name. If C<gv> is a |
| 317 | stash element, it is the caller's responsibility to ensure that the name |
| 318 | passed to this function matches the name of the element. If it does not |
| 319 | match, perl's internal bookkeeping will get out of sync. |
| 320 | |
| 321 | C<flags> can be set to C<SVf_UTF8> if C<name> is a UTF-8 string, or |
| 322 | the return value of SvUTF8(sv). It can also take the |
| 323 | C<GV_ADDMULTI> flag, which means to pretend that the GV has been |
| 324 | seen before (i.e., suppress "Used once" warnings). |
| 325 | |
| 326 | =for apidoc gv_init |
| 327 | |
| 328 | The old form of C<gv_init_pvn()>. It does not work with UTF-8 strings, as it |
| 329 | has no flags parameter. If the C<multi> parameter is set, the |
| 330 | C<GV_ADDMULTI> flag will be passed to C<gv_init_pvn()>. |
| 331 | |
| 332 | =for apidoc gv_init_pv |
| 333 | |
| 334 | Same as C<gv_init_pvn()>, but takes a nul-terminated string for the name |
| 335 | instead of separate char * and length parameters. |
| 336 | |
| 337 | =for apidoc gv_init_sv |
| 338 | |
| 339 | Same as C<gv_init_pvn()>, but takes an SV * for the name instead of separate |
| 340 | char * and length parameters. C<flags> is currently unused. |
| 341 | |
| 342 | =cut |
| 343 | */ |
| 344 | |
| 345 | void |
| 346 | Perl_gv_init_sv(pTHX_ GV *gv, HV *stash, SV* namesv, U32 flags) |
| 347 | { |
| 348 | char *namepv; |
| 349 | STRLEN namelen; |
| 350 | PERL_ARGS_ASSERT_GV_INIT_SV; |
| 351 | namepv = SvPV(namesv, namelen); |
| 352 | if (SvUTF8(namesv)) |
| 353 | flags |= SVf_UTF8; |
| 354 | gv_init_pvn(gv, stash, namepv, namelen, flags); |
| 355 | } |
| 356 | |
| 357 | void |
| 358 | Perl_gv_init_pv(pTHX_ GV *gv, HV *stash, const char *name, U32 flags) |
| 359 | { |
| 360 | PERL_ARGS_ASSERT_GV_INIT_PV; |
| 361 | gv_init_pvn(gv, stash, name, strlen(name), flags); |
| 362 | } |
| 363 | |
| 364 | void |
| 365 | Perl_gv_init_pvn(pTHX_ GV *gv, HV *stash, const char *name, STRLEN len, U32 flags) |
| 366 | { |
| 367 | const U32 old_type = SvTYPE(gv); |
| 368 | const bool doproto = old_type > SVt_NULL; |
| 369 | char * const proto = (doproto && SvPOK(gv)) |
| 370 | ? ((void)(SvIsCOW(gv) && (sv_force_normal((SV *)gv), 0)), SvPVX(gv)) |
| 371 | : NULL; |
| 372 | const STRLEN protolen = proto ? SvCUR(gv) : 0; |
| 373 | const U32 proto_utf8 = proto ? SvUTF8(gv) : 0; |
| 374 | SV *const has_constant = doproto && SvROK(gv) ? SvRV(gv) : NULL; |
| 375 | const U32 exported_constant = has_constant ? SvPCS_IMPORTED(gv) : 0; |
| 376 | const bool really_sub = |
| 377 | has_constant && SvTYPE(has_constant) == SVt_PVCV; |
| 378 | COP * const old = PL_curcop; |
| 379 | |
| 380 | PERL_ARGS_ASSERT_GV_INIT_PVN; |
| 381 | assert (!(proto && has_constant)); |
| 382 | |
| 383 | if (has_constant) { |
| 384 | /* The constant has to be a scalar, array or subroutine. */ |
| 385 | switch (SvTYPE(has_constant)) { |
| 386 | case SVt_PVHV: |
| 387 | case SVt_PVFM: |
| 388 | case SVt_PVIO: |
| 389 | Perl_croak(aTHX_ "Cannot convert a reference to %s to typeglob", |
| 390 | sv_reftype(has_constant, 0)); |
| 391 | NOT_REACHED; /* NOTREACHED */ |
| 392 | break; |
| 393 | |
| 394 | default: NOOP; |
| 395 | } |
| 396 | SvRV_set(gv, NULL); |
| 397 | SvROK_off(gv); |
| 398 | } |
| 399 | |
| 400 | |
| 401 | if (old_type < SVt_PVGV) { |
| 402 | if (old_type >= SVt_PV) |
| 403 | SvCUR_set(gv, 0); |
| 404 | sv_upgrade(MUTABLE_SV(gv), SVt_PVGV); |
| 405 | } |
| 406 | if (SvLEN(gv)) { |
| 407 | if (proto) { |
| 408 | SvPV_set(gv, NULL); |
| 409 | SvLEN_set(gv, 0); |
| 410 | SvPOK_off(gv); |
| 411 | } else |
| 412 | Safefree(SvPVX_mutable(gv)); |
| 413 | } |
| 414 | SvIOK_off(gv); |
| 415 | isGV_with_GP_on(gv); |
| 416 | |
| 417 | if (really_sub && !CvISXSUB(has_constant) && CvSTART(has_constant) |
| 418 | && ( CvSTART(has_constant)->op_type == OP_NEXTSTATE |
| 419 | || CvSTART(has_constant)->op_type == OP_DBSTATE)) |
| 420 | PL_curcop = (COP *)CvSTART(has_constant); |
| 421 | GvGP_set(gv, Perl_newGP(aTHX_ gv)); |
| 422 | PL_curcop = old; |
| 423 | GvSTASH(gv) = stash; |
| 424 | if (stash) |
| 425 | Perl_sv_add_backref(aTHX_ MUTABLE_SV(stash), MUTABLE_SV(gv)); |
| 426 | gv_name_set(gv, name, len, GV_ADD | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 )); |
| 427 | if (flags & GV_ADDMULTI || doproto) /* doproto means it */ |
| 428 | GvMULTI_on(gv); /* _was_ mentioned */ |
| 429 | if (really_sub) { |
| 430 | /* Not actually a constant. Just a regular sub. */ |
| 431 | CV * const cv = (CV *)has_constant; |
| 432 | GvCV_set(gv,cv); |
| 433 | if (CvNAMED(cv) && CvSTASH(cv) == stash && ( |
| 434 | CvNAME_HEK(cv) == GvNAME_HEK(gv) |
| 435 | || ( HEK_LEN(CvNAME_HEK(cv)) == HEK_LEN(GvNAME_HEK(gv)) |
| 436 | && HEK_FLAGS(CvNAME_HEK(cv)) != HEK_FLAGS(GvNAME_HEK(gv)) |
| 437 | && HEK_UTF8(CvNAME_HEK(cv)) == HEK_UTF8(GvNAME_HEK(gv)) |
| 438 | && memEQ(HEK_KEY(CvNAME_HEK(cv)), GvNAME(gv), GvNAMELEN(gv)) |
| 439 | ) |
| 440 | )) |
| 441 | CvGV_set(cv,gv); |
| 442 | } |
| 443 | else if (doproto) { |
| 444 | CV *cv; |
| 445 | if (has_constant) { |
| 446 | /* newCONSTSUB takes ownership of the reference from us. */ |
| 447 | cv = newCONSTSUB_flags(stash, name, len, flags, has_constant); |
| 448 | /* In case op.c:S_process_special_blocks stole it: */ |
| 449 | if (!GvCV(gv)) |
| 450 | GvCV_set(gv, (CV *)SvREFCNT_inc_simple_NN(cv)); |
| 451 | assert(GvCV(gv) == cv); /* newCONSTSUB should have set this */ |
| 452 | /* If this reference was a copy of another, then the subroutine |
| 453 | must have been "imported", by a Perl space assignment to a GV |
| 454 | from a reference to CV. */ |
| 455 | if (exported_constant) |
| 456 | GvIMPORTED_CV_on(gv); |
| 457 | CvSTASH_set(cv, PL_curstash); /* XXX Why is this needed? */ |
| 458 | } else { |
| 459 | cv = newSTUB(gv,1); |
| 460 | } |
| 461 | if (proto) { |
| 462 | sv_usepvn_flags(MUTABLE_SV(cv), proto, protolen, |
| 463 | SV_HAS_TRAILING_NUL); |
| 464 | if ( proto_utf8 ) SvUTF8_on(MUTABLE_SV(cv)); |
| 465 | } |
| 466 | } |
| 467 | } |
| 468 | |
| 469 | STATIC void |
| 470 | S_gv_init_svtype(pTHX_ GV *gv, const svtype sv_type) |
| 471 | { |
| 472 | PERL_ARGS_ASSERT_GV_INIT_SVTYPE; |
| 473 | |
| 474 | switch (sv_type) { |
| 475 | case SVt_PVIO: |
| 476 | (void)GvIOn(gv); |
| 477 | break; |
| 478 | case SVt_PVAV: |
| 479 | (void)GvAVn(gv); |
| 480 | break; |
| 481 | case SVt_PVHV: |
| 482 | (void)GvHVn(gv); |
| 483 | break; |
| 484 | #ifdef PERL_DONT_CREATE_GVSV |
| 485 | case SVt_NULL: |
| 486 | case SVt_PVCV: |
| 487 | case SVt_PVFM: |
| 488 | case SVt_PVGV: |
| 489 | break; |
| 490 | default: |
| 491 | if(GvSVn(gv)) { |
| 492 | /* Work round what appears to be a bug in Sun C++ 5.8 2005/10/13 |
| 493 | If we just cast GvSVn(gv) to void, it ignores evaluating it for |
| 494 | its side effect */ |
| 495 | } |
| 496 | #endif |
| 497 | } |
| 498 | } |
| 499 | |
| 500 | static void core_xsub(pTHX_ CV* cv); |
| 501 | |
| 502 | static GV * |
| 503 | S_maybe_add_coresub(pTHX_ HV * const stash, GV *gv, |
| 504 | const char * const name, const STRLEN len) |
| 505 | { |
| 506 | const int code = keyword(name, len, 1); |
| 507 | static const char file[] = __FILE__; |
| 508 | CV *cv, *oldcompcv = NULL; |
| 509 | int opnum = 0; |
| 510 | bool ampable = TRUE; /* &{}-able */ |
| 511 | COP *oldcurcop = NULL; |
| 512 | yy_parser *oldparser = NULL; |
| 513 | I32 oldsavestack_ix = 0; |
| 514 | |
| 515 | assert(gv || stash); |
| 516 | assert(name); |
| 517 | |
| 518 | if (!code) return NULL; /* Not a keyword */ |
| 519 | switch (code < 0 ? -code : code) { |
| 520 | /* no support for \&CORE::infix; |
| 521 | no support for funcs that do not parse like funcs */ |
| 522 | case KEY___DATA__: case KEY___END__: case KEY_and: case KEY_AUTOLOAD: |
| 523 | case KEY_BEGIN : case KEY_CHECK : case KEY_cmp: |
| 524 | case KEY_default : case KEY_DESTROY: |
| 525 | case KEY_do : case KEY_dump : case KEY_else : case KEY_elsif : |
| 526 | case KEY_END : case KEY_eq : case KEY_eval : |
| 527 | case KEY_for : case KEY_foreach: case KEY_format: case KEY_ge : |
| 528 | case KEY_given : case KEY_goto : case KEY_grep : |
| 529 | case KEY_gt : case KEY_if: case KEY_INIT: case KEY_last: case KEY_le: |
| 530 | case KEY_local: case KEY_lt: case KEY_m : case KEY_map : case KEY_my: |
| 531 | case KEY_ne : case KEY_next : case KEY_no: case KEY_or: case KEY_our: |
| 532 | case KEY_package: case KEY_print: case KEY_printf: |
| 533 | case KEY_q : case KEY_qq : case KEY_qr : case KEY_qw : |
| 534 | case KEY_qx : case KEY_redo : case KEY_require: case KEY_return: |
| 535 | case KEY_s : case KEY_say : case KEY_sort : |
| 536 | case KEY_state: case KEY_sub : |
| 537 | case KEY_tr : case KEY_UNITCHECK: case KEY_unless: |
| 538 | case KEY_until: case KEY_use : case KEY_when : case KEY_while : |
| 539 | case KEY_x : case KEY_xor : case KEY_y : |
| 540 | return NULL; |
| 541 | case KEY_chdir: |
| 542 | case KEY_chomp: case KEY_chop: case KEY_defined: case KEY_delete: |
| 543 | case KEY_eof : case KEY_exec: case KEY_exists : |
| 544 | case KEY_lstat: |
| 545 | case KEY_split: |
| 546 | case KEY_stat: |
| 547 | case KEY_system: |
| 548 | case KEY_truncate: case KEY_unlink: |
| 549 | ampable = FALSE; |
| 550 | } |
| 551 | if (!gv) { |
| 552 | gv = (GV *)newSV(0); |
| 553 | gv_init(gv, stash, name, len, TRUE); |
| 554 | } |
| 555 | GvMULTI_on(gv); |
| 556 | if (ampable) { |
| 557 | ENTER; |
| 558 | oldcurcop = PL_curcop; |
| 559 | oldparser = PL_parser; |
| 560 | lex_start(NULL, NULL, 0); |
| 561 | oldcompcv = PL_compcv; |
| 562 | PL_compcv = NULL; /* Prevent start_subparse from setting |
| 563 | CvOUTSIDE. */ |
| 564 | oldsavestack_ix = start_subparse(FALSE,0); |
| 565 | cv = PL_compcv; |
| 566 | } |
| 567 | else { |
| 568 | /* Avoid calling newXS, as it calls us, and things start to |
| 569 | get hairy. */ |
| 570 | cv = MUTABLE_CV(newSV_type(SVt_PVCV)); |
| 571 | GvCV_set(gv,cv); |
| 572 | GvCVGEN(gv) = 0; |
| 573 | CvISXSUB_on(cv); |
| 574 | CvXSUB(cv) = core_xsub; |
| 575 | PoisonPADLIST(cv); |
| 576 | } |
| 577 | CvGV_set(cv, gv); /* This stops new ATTRSUB from setting CvFILE |
| 578 | from PL_curcop. */ |
| 579 | /* XSUBs can't be perl lang/perl5db.pl debugged |
| 580 | if (PERLDB_LINE_OR_SAVESRC) |
| 581 | (void)gv_fetchfile(file); */ |
| 582 | CvFILE(cv) = (char *)file; |
| 583 | /* XXX This is inefficient, as doing things this order causes |
| 584 | a prototype check in newATTRSUB. But we have to do |
| 585 | it this order as we need an op number before calling |
| 586 | new ATTRSUB. */ |
| 587 | (void)core_prototype((SV *)cv, name, code, &opnum); |
| 588 | if (stash) |
| 589 | (void)hv_store(stash,name,len,(SV *)gv,0); |
| 590 | if (ampable) { |
| 591 | #ifdef DEBUGGING |
| 592 | CV *orig_cv = cv; |
| 593 | #endif |
| 594 | CvLVALUE_on(cv); |
| 595 | /* newATTRSUB will free the CV and return NULL if we're still |
| 596 | compiling after a syntax error */ |
| 597 | if ((cv = newATTRSUB_x( |
| 598 | oldsavestack_ix, (OP *)gv, |
| 599 | NULL,NULL, |
| 600 | coresub_op( |
| 601 | opnum |
| 602 | ? newSVuv((UV)opnum) |
| 603 | : newSVpvn(name,len), |
| 604 | code, opnum |
| 605 | ), |
| 606 | TRUE |
| 607 | )) != NULL) { |
| 608 | assert(GvCV(gv) == orig_cv); |
| 609 | if (opnum != OP_VEC && opnum != OP_SUBSTR && opnum != OP_POS |
| 610 | && opnum != OP_UNDEF && opnum != OP_KEYS) |
| 611 | CvLVALUE_off(cv); /* Now *that* was a neat trick. */ |
| 612 | } |
| 613 | LEAVE; |
| 614 | PL_parser = oldparser; |
| 615 | PL_curcop = oldcurcop; |
| 616 | PL_compcv = oldcompcv; |
| 617 | } |
| 618 | if (cv) { |
| 619 | SV *opnumsv = newSViv( |
| 620 | (opnum == OP_ENTEREVAL && len == 9 && memEQ(name, "evalbytes", 9)) ? |
| 621 | (OP_ENTEREVAL | (1<<16)) |
| 622 | : opnum ? opnum : (((I32)name[2]) << 16)); |
| 623 | cv_set_call_checker_flags(cv, Perl_ck_entersub_args_core, opnumsv, 0); |
| 624 | SvREFCNT_dec_NN(opnumsv); |
| 625 | } |
| 626 | |
| 627 | return gv; |
| 628 | } |
| 629 | |
| 630 | /* |
| 631 | =for apidoc gv_fetchmeth |
| 632 | |
| 633 | Like L</gv_fetchmeth_pvn>, but lacks a flags parameter. |
| 634 | |
| 635 | =for apidoc gv_fetchmeth_sv |
| 636 | |
| 637 | Exactly like L</gv_fetchmeth_pvn>, but takes the name string in the form |
| 638 | of an SV instead of a string/length pair. |
| 639 | |
| 640 | =cut |
| 641 | */ |
| 642 | |
| 643 | GV * |
| 644 | Perl_gv_fetchmeth_sv(pTHX_ HV *stash, SV *namesv, I32 level, U32 flags) |
| 645 | { |
| 646 | char *namepv; |
| 647 | STRLEN namelen; |
| 648 | PERL_ARGS_ASSERT_GV_FETCHMETH_SV; |
| 649 | if (LIKELY(SvPOK_nog(namesv))) /* common case */ |
| 650 | return gv_fetchmeth_internal(stash, namesv, NULL, 0, level, |
| 651 | flags | SvUTF8(namesv)); |
| 652 | namepv = SvPV(namesv, namelen); |
| 653 | if (SvUTF8(namesv)) flags |= SVf_UTF8; |
| 654 | return gv_fetchmeth_pvn(stash, namepv, namelen, level, flags); |
| 655 | } |
| 656 | |
| 657 | /* |
| 658 | =for apidoc gv_fetchmeth_pv |
| 659 | |
| 660 | Exactly like L</gv_fetchmeth_pvn>, but takes a nul-terminated string |
| 661 | instead of a string/length pair. |
| 662 | |
| 663 | =cut |
| 664 | */ |
| 665 | |
| 666 | GV * |
| 667 | Perl_gv_fetchmeth_pv(pTHX_ HV *stash, const char *name, I32 level, U32 flags) |
| 668 | { |
| 669 | PERL_ARGS_ASSERT_GV_FETCHMETH_PV; |
| 670 | return gv_fetchmeth_internal(stash, NULL, name, strlen(name), level, flags); |
| 671 | } |
| 672 | |
| 673 | /* |
| 674 | =for apidoc gv_fetchmeth_pvn |
| 675 | |
| 676 | Returns the glob with the given C<name> and a defined subroutine or |
| 677 | C<NULL>. The glob lives in the given C<stash>, or in the stashes |
| 678 | accessible via C<@ISA> and C<UNIVERSAL::>. |
| 679 | |
| 680 | The argument C<level> should be either 0 or -1. If C<level==0>, as a |
| 681 | side-effect creates a glob with the given C<name> in the given C<stash> |
| 682 | which in the case of success contains an alias for the subroutine, and sets |
| 683 | up caching info for this glob. |
| 684 | |
| 685 | The only significant values for C<flags> are C<GV_SUPER> and C<SVf_UTF8>. |
| 686 | |
| 687 | C<GV_SUPER> indicates that we want to look up the method in the superclasses |
| 688 | of the C<stash>. |
| 689 | |
| 690 | The |
| 691 | GV returned from C<gv_fetchmeth> may be a method cache entry, which is not |
| 692 | visible to Perl code. So when calling C<call_sv>, you should not use |
| 693 | the GV directly; instead, you should use the method's CV, which can be |
| 694 | obtained from the GV with the C<GvCV> macro. |
| 695 | |
| 696 | =cut |
| 697 | */ |
| 698 | |
| 699 | /* NOTE: No support for tied ISA */ |
| 700 | |
| 701 | PERL_STATIC_INLINE GV* |
| 702 | S_gv_fetchmeth_internal(pTHX_ HV* stash, SV* meth, const char* name, STRLEN len, I32 level, U32 flags) |
| 703 | { |
| 704 | GV** gvp; |
| 705 | HE* he; |
| 706 | AV* linear_av; |
| 707 | SV** linear_svp; |
| 708 | SV* linear_sv; |
| 709 | HV* cstash, *cachestash; |
| 710 | GV* candidate = NULL; |
| 711 | CV* cand_cv = NULL; |
| 712 | GV* topgv = NULL; |
| 713 | const char *hvname; |
| 714 | I32 create = (level >= 0) ? HV_FETCH_LVALUE : 0; |
| 715 | I32 items; |
| 716 | U32 topgen_cmp; |
| 717 | U32 is_utf8 = flags & SVf_UTF8; |
| 718 | |
| 719 | /* UNIVERSAL methods should be callable without a stash */ |
| 720 | if (!stash) { |
| 721 | create = 0; /* probably appropriate */ |
| 722 | if(!(stash = gv_stashpvs("UNIVERSAL", 0))) |
| 723 | return 0; |
| 724 | } |
| 725 | |
| 726 | assert(stash); |
| 727 | |
| 728 | hvname = HvNAME_get(stash); |
| 729 | if (!hvname) |
| 730 | Perl_croak(aTHX_ "Can't use anonymous symbol table for method lookup"); |
| 731 | |
| 732 | assert(hvname); |
| 733 | assert(name || meth); |
| 734 | |
| 735 | DEBUG_o( Perl_deb(aTHX_ "Looking for %smethod %s in package %s\n", |
| 736 | flags & GV_SUPER ? "SUPER " : "", |
| 737 | name ? name : SvPV_nolen(meth), hvname) ); |
| 738 | |
| 739 | topgen_cmp = HvMROMETA(stash)->cache_gen + PL_sub_generation; |
| 740 | |
| 741 | if (flags & GV_SUPER) { |
| 742 | if (!HvAUX(stash)->xhv_mro_meta->super) |
| 743 | HvAUX(stash)->xhv_mro_meta->super = newHV(); |
| 744 | cachestash = HvAUX(stash)->xhv_mro_meta->super; |
| 745 | } |
| 746 | else cachestash = stash; |
| 747 | |
| 748 | /* check locally for a real method or a cache entry */ |
| 749 | he = (HE*)hv_common( |
| 750 | cachestash, meth, name, len, is_utf8 ? HVhek_UTF8 : 0, create, NULL, 0 |
| 751 | ); |
| 752 | if (he) gvp = (GV**)&HeVAL(he); |
| 753 | else gvp = NULL; |
| 754 | |
| 755 | if(gvp) { |
| 756 | topgv = *gvp; |
| 757 | have_gv: |
| 758 | assert(topgv); |
| 759 | if (SvTYPE(topgv) != SVt_PVGV) |
| 760 | { |
| 761 | if (!name) |
| 762 | name = SvPV_nomg(meth, len); |
| 763 | gv_init_pvn(topgv, stash, name, len, GV_ADDMULTI|is_utf8); |
| 764 | } |
| 765 | if ((cand_cv = GvCV(topgv))) { |
| 766 | /* If genuine method or valid cache entry, use it */ |
| 767 | if (!GvCVGEN(topgv) || GvCVGEN(topgv) == topgen_cmp) { |
| 768 | return topgv; |
| 769 | } |
| 770 | else { |
| 771 | /* stale cache entry, junk it and move on */ |
| 772 | SvREFCNT_dec_NN(cand_cv); |
| 773 | GvCV_set(topgv, NULL); |
| 774 | cand_cv = NULL; |
| 775 | GvCVGEN(topgv) = 0; |
| 776 | } |
| 777 | } |
| 778 | else if (GvCVGEN(topgv) == topgen_cmp) { |
| 779 | /* cache indicates no such method definitively */ |
| 780 | return 0; |
| 781 | } |
| 782 | else if (stash == cachestash |
| 783 | && len > 1 /* shortest is uc */ |
| 784 | && memEQs(hvname, HvNAMELEN_get(stash), "CORE") |
| 785 | && S_maybe_add_coresub(aTHX_ NULL,topgv,name,len)) |
| 786 | goto have_gv; |
| 787 | } |
| 788 | |
| 789 | linear_av = mro_get_linear_isa(stash); /* has ourselves at the top of the list */ |
| 790 | linear_svp = AvARRAY(linear_av) + 1; /* skip over self */ |
| 791 | items = AvFILLp(linear_av); /* no +1, to skip over self */ |
| 792 | while (items--) { |
| 793 | linear_sv = *linear_svp++; |
| 794 | assert(linear_sv); |
| 795 | cstash = gv_stashsv(linear_sv, 0); |
| 796 | |
| 797 | if (!cstash) { |
| 798 | Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), |
| 799 | "Can't locate package %" SVf " for @%" HEKf "::ISA", |
| 800 | SVfARG(linear_sv), |
| 801 | HEKfARG(HvNAME_HEK(stash))); |
| 802 | continue; |
| 803 | } |
| 804 | |
| 805 | assert(cstash); |
| 806 | |
| 807 | gvp = (GV**)hv_common( |
| 808 | cstash, meth, name, len, is_utf8 ? HVhek_UTF8 : 0, HV_FETCH_JUST_SV, NULL, 0 |
| 809 | ); |
| 810 | if (!gvp) { |
| 811 | if (len > 1 && HvNAMELEN_get(cstash) == 4) { |
| 812 | const char *hvname = HvNAME(cstash); assert(hvname); |
| 813 | if (strBEGINs(hvname, "CORE") |
| 814 | && (candidate = |
| 815 | S_maybe_add_coresub(aTHX_ cstash,NULL,name,len) |
| 816 | )) |
| 817 | goto have_candidate; |
| 818 | } |
| 819 | continue; |
| 820 | } |
| 821 | else candidate = *gvp; |
| 822 | have_candidate: |
| 823 | assert(candidate); |
| 824 | if (SvTYPE(candidate) != SVt_PVGV) |
| 825 | gv_init_pvn(candidate, cstash, name, len, GV_ADDMULTI|is_utf8); |
| 826 | if (SvTYPE(candidate) == SVt_PVGV && (cand_cv = GvCV(candidate)) && !GvCVGEN(candidate)) { |
| 827 | /* |
| 828 | * Found real method, cache method in topgv if: |
| 829 | * 1. topgv has no synonyms (else inheritance crosses wires) |
| 830 | * 2. method isn't a stub (else AUTOLOAD fails spectacularly) |
| 831 | */ |
| 832 | if (topgv && (GvREFCNT(topgv) == 1) && (CvROOT(cand_cv) || CvXSUB(cand_cv))) { |
| 833 | CV *old_cv = GvCV(topgv); |
| 834 | SvREFCNT_dec(old_cv); |
| 835 | SvREFCNT_inc_simple_void_NN(cand_cv); |
| 836 | GvCV_set(topgv, cand_cv); |
| 837 | GvCVGEN(topgv) = topgen_cmp; |
| 838 | } |
| 839 | return candidate; |
| 840 | } |
| 841 | } |
| 842 | |
| 843 | /* Check UNIVERSAL without caching */ |
| 844 | if(level == 0 || level == -1) { |
| 845 | candidate = gv_fetchmeth_internal(NULL, meth, name, len, 1, |
| 846 | flags &~GV_SUPER); |
| 847 | if(candidate) { |
| 848 | cand_cv = GvCV(candidate); |
| 849 | if (topgv && (GvREFCNT(topgv) == 1) && (CvROOT(cand_cv) || CvXSUB(cand_cv))) { |
| 850 | CV *old_cv = GvCV(topgv); |
| 851 | SvREFCNT_dec(old_cv); |
| 852 | SvREFCNT_inc_simple_void_NN(cand_cv); |
| 853 | GvCV_set(topgv, cand_cv); |
| 854 | GvCVGEN(topgv) = topgen_cmp; |
| 855 | } |
| 856 | return candidate; |
| 857 | } |
| 858 | } |
| 859 | |
| 860 | if (topgv && GvREFCNT(topgv) == 1) { |
| 861 | /* cache the fact that the method is not defined */ |
| 862 | GvCVGEN(topgv) = topgen_cmp; |
| 863 | } |
| 864 | |
| 865 | return 0; |
| 866 | } |
| 867 | |
| 868 | GV * |
| 869 | Perl_gv_fetchmeth_pvn(pTHX_ HV *stash, const char *name, STRLEN len, I32 level, U32 flags) |
| 870 | { |
| 871 | PERL_ARGS_ASSERT_GV_FETCHMETH_PVN; |
| 872 | return gv_fetchmeth_internal(stash, NULL, name, len, level, flags); |
| 873 | } |
| 874 | |
| 875 | /* |
| 876 | =for apidoc gv_fetchmeth_autoload |
| 877 | |
| 878 | This is the old form of L</gv_fetchmeth_pvn_autoload>, which has no flags |
| 879 | parameter. |
| 880 | |
| 881 | =for apidoc gv_fetchmeth_sv_autoload |
| 882 | |
| 883 | Exactly like L</gv_fetchmeth_pvn_autoload>, but takes the name string in the form |
| 884 | of an SV instead of a string/length pair. |
| 885 | |
| 886 | =cut |
| 887 | */ |
| 888 | |
| 889 | GV * |
| 890 | Perl_gv_fetchmeth_sv_autoload(pTHX_ HV *stash, SV *namesv, I32 level, U32 flags) |
| 891 | { |
| 892 | char *namepv; |
| 893 | STRLEN namelen; |
| 894 | PERL_ARGS_ASSERT_GV_FETCHMETH_SV_AUTOLOAD; |
| 895 | namepv = SvPV(namesv, namelen); |
| 896 | if (SvUTF8(namesv)) |
| 897 | flags |= SVf_UTF8; |
| 898 | return gv_fetchmeth_pvn_autoload(stash, namepv, namelen, level, flags); |
| 899 | } |
| 900 | |
| 901 | /* |
| 902 | =for apidoc gv_fetchmeth_pv_autoload |
| 903 | |
| 904 | Exactly like L</gv_fetchmeth_pvn_autoload>, but takes a nul-terminated string |
| 905 | instead of a string/length pair. |
| 906 | |
| 907 | =cut |
| 908 | */ |
| 909 | |
| 910 | GV * |
| 911 | Perl_gv_fetchmeth_pv_autoload(pTHX_ HV *stash, const char *name, I32 level, U32 flags) |
| 912 | { |
| 913 | PERL_ARGS_ASSERT_GV_FETCHMETH_PV_AUTOLOAD; |
| 914 | return gv_fetchmeth_pvn_autoload(stash, name, strlen(name), level, flags); |
| 915 | } |
| 916 | |
| 917 | /* |
| 918 | =for apidoc gv_fetchmeth_pvn_autoload |
| 919 | |
| 920 | Same as C<gv_fetchmeth_pvn()>, but looks for autoloaded subroutines too. |
| 921 | Returns a glob for the subroutine. |
| 922 | |
| 923 | For an autoloaded subroutine without a GV, will create a GV even |
| 924 | if C<level < 0>. For an autoloaded subroutine without a stub, C<GvCV()> |
| 925 | of the result may be zero. |
| 926 | |
| 927 | Currently, the only significant value for C<flags> is C<SVf_UTF8>. |
| 928 | |
| 929 | =cut |
| 930 | */ |
| 931 | |
| 932 | GV * |
| 933 | Perl_gv_fetchmeth_pvn_autoload(pTHX_ HV *stash, const char *name, STRLEN len, I32 level, U32 flags) |
| 934 | { |
| 935 | GV *gv = gv_fetchmeth_pvn(stash, name, len, level, flags); |
| 936 | |
| 937 | PERL_ARGS_ASSERT_GV_FETCHMETH_PVN_AUTOLOAD; |
| 938 | |
| 939 | if (!gv) { |
| 940 | CV *cv; |
| 941 | GV **gvp; |
| 942 | |
| 943 | if (!stash) |
| 944 | return NULL; /* UNIVERSAL::AUTOLOAD could cause trouble */ |
| 945 | if (len == S_autolen && memEQ(name, S_autoload, S_autolen)) |
| 946 | return NULL; |
| 947 | if (!(gv = gv_fetchmeth_pvn(stash, S_autoload, S_autolen, FALSE, flags))) |
| 948 | return NULL; |
| 949 | cv = GvCV(gv); |
| 950 | if (!(CvROOT(cv) || CvXSUB(cv))) |
| 951 | return NULL; |
| 952 | /* Have an autoload */ |
| 953 | if (level < 0) /* Cannot do without a stub */ |
| 954 | gv_fetchmeth_pvn(stash, name, len, 0, flags); |
| 955 | gvp = (GV**)hv_fetch(stash, name, |
| 956 | (flags & SVf_UTF8) ? -(I32)len : (I32)len, (level >= 0)); |
| 957 | if (!gvp) |
| 958 | return NULL; |
| 959 | return *gvp; |
| 960 | } |
| 961 | return gv; |
| 962 | } |
| 963 | |
| 964 | /* |
| 965 | =for apidoc gv_fetchmethod_autoload |
| 966 | |
| 967 | Returns the glob which contains the subroutine to call to invoke the method |
| 968 | on the C<stash>. In fact in the presence of autoloading this may be the |
| 969 | glob for "AUTOLOAD". In this case the corresponding variable C<$AUTOLOAD> is |
| 970 | already setup. |
| 971 | |
| 972 | The third parameter of C<gv_fetchmethod_autoload> determines whether |
| 973 | AUTOLOAD lookup is performed if the given method is not present: non-zero |
| 974 | means yes, look for AUTOLOAD; zero means no, don't look for AUTOLOAD. |
| 975 | Calling C<gv_fetchmethod> is equivalent to calling C<gv_fetchmethod_autoload> |
| 976 | with a non-zero C<autoload> parameter. |
| 977 | |
| 978 | These functions grant C<"SUPER"> token |
| 979 | as a prefix of the method name. Note |
| 980 | that if you want to keep the returned glob for a long time, you need to |
| 981 | check for it being "AUTOLOAD", since at the later time the call may load a |
| 982 | different subroutine due to C<$AUTOLOAD> changing its value. Use the glob |
| 983 | created as a side effect to do this. |
| 984 | |
| 985 | These functions have the same side-effects as C<gv_fetchmeth> with |
| 986 | C<level==0>. The warning against passing the GV returned by |
| 987 | C<gv_fetchmeth> to C<call_sv> applies equally to these functions. |
| 988 | |
| 989 | =cut |
| 990 | */ |
| 991 | |
| 992 | GV * |
| 993 | Perl_gv_fetchmethod_autoload(pTHX_ HV *stash, const char *name, I32 autoload) |
| 994 | { |
| 995 | PERL_ARGS_ASSERT_GV_FETCHMETHOD_AUTOLOAD; |
| 996 | |
| 997 | return gv_fetchmethod_flags(stash, name, autoload ? GV_AUTOLOAD : 0); |
| 998 | } |
| 999 | |
| 1000 | GV * |
| 1001 | Perl_gv_fetchmethod_sv_flags(pTHX_ HV *stash, SV *namesv, U32 flags) |
| 1002 | { |
| 1003 | char *namepv; |
| 1004 | STRLEN namelen; |
| 1005 | PERL_ARGS_ASSERT_GV_FETCHMETHOD_SV_FLAGS; |
| 1006 | namepv = SvPV(namesv, namelen); |
| 1007 | if (SvUTF8(namesv)) |
| 1008 | flags |= SVf_UTF8; |
| 1009 | return gv_fetchmethod_pvn_flags(stash, namepv, namelen, flags); |
| 1010 | } |
| 1011 | |
| 1012 | GV * |
| 1013 | Perl_gv_fetchmethod_pv_flags(pTHX_ HV *stash, const char *name, U32 flags) |
| 1014 | { |
| 1015 | PERL_ARGS_ASSERT_GV_FETCHMETHOD_PV_FLAGS; |
| 1016 | return gv_fetchmethod_pvn_flags(stash, name, strlen(name), flags); |
| 1017 | } |
| 1018 | |
| 1019 | GV * |
| 1020 | Perl_gv_fetchmethod_pvn_flags(pTHX_ HV *stash, const char *name, const STRLEN len, U32 flags) |
| 1021 | { |
| 1022 | const char * const origname = name; |
| 1023 | const char * const name_end = name + len; |
| 1024 | const char *last_separator = NULL; |
| 1025 | GV* gv; |
| 1026 | HV* ostash = stash; |
| 1027 | SV *const error_report = MUTABLE_SV(stash); |
| 1028 | const U32 autoload = flags & GV_AUTOLOAD; |
| 1029 | const U32 do_croak = flags & GV_CROAK; |
| 1030 | const U32 is_utf8 = flags & SVf_UTF8; |
| 1031 | |
| 1032 | PERL_ARGS_ASSERT_GV_FETCHMETHOD_PVN_FLAGS; |
| 1033 | |
| 1034 | if (SvTYPE(stash) < SVt_PVHV) |
| 1035 | stash = NULL; |
| 1036 | else { |
| 1037 | /* The only way stash can become NULL later on is if last_separator is set, |
| 1038 | which in turn means that there is no need for a SVt_PVHV case |
| 1039 | the error reporting code. */ |
| 1040 | } |
| 1041 | |
| 1042 | { |
| 1043 | /* check if the method name is fully qualified or |
| 1044 | * not, and separate the package name from the actual |
| 1045 | * method name. |
| 1046 | * |
| 1047 | * leaves last_separator pointing to the beginning of the |
| 1048 | * last package separator (either ' or ::) or 0 |
| 1049 | * if none was found. |
| 1050 | * |
| 1051 | * leaves name pointing at the beginning of the |
| 1052 | * method name. |
| 1053 | */ |
| 1054 | const char *name_cursor = name; |
| 1055 | const char * const name_em1 = name_end - 1; /* name_end minus 1 */ |
| 1056 | for (name_cursor = name; name_cursor < name_end ; name_cursor++) { |
| 1057 | if (*name_cursor == '\'') { |
| 1058 | last_separator = name_cursor; |
| 1059 | name = name_cursor + 1; |
| 1060 | } |
| 1061 | else if (name_cursor < name_em1 && *name_cursor == ':' && name_cursor[1] == ':') { |
| 1062 | last_separator = name_cursor++; |
| 1063 | name = name_cursor + 1; |
| 1064 | } |
| 1065 | } |
| 1066 | } |
| 1067 | |
| 1068 | /* did we find a separator? */ |
| 1069 | if (last_separator) { |
| 1070 | STRLEN sep_len= last_separator - origname; |
| 1071 | if ( memEQs(origname, sep_len, "SUPER")) { |
| 1072 | /* ->SUPER::method should really be looked up in original stash */ |
| 1073 | stash = CopSTASH(PL_curcop); |
| 1074 | flags |= GV_SUPER; |
| 1075 | DEBUG_o( Perl_deb(aTHX_ "Treating %s as %s::%s\n", |
| 1076 | origname, HvENAME_get(stash), name) ); |
| 1077 | } |
| 1078 | else if ( sep_len >= 7 && |
| 1079 | strBEGINs(last_separator - 7, "::SUPER")) { |
| 1080 | /* don't autovifify if ->NoSuchStash::SUPER::method */ |
| 1081 | stash = gv_stashpvn(origname, sep_len - 7, is_utf8); |
| 1082 | if (stash) flags |= GV_SUPER; |
| 1083 | } |
| 1084 | else { |
| 1085 | /* don't autovifify if ->NoSuchStash::method */ |
| 1086 | stash = gv_stashpvn(origname, sep_len, is_utf8); |
| 1087 | } |
| 1088 | ostash = stash; |
| 1089 | } |
| 1090 | |
| 1091 | gv = gv_fetchmeth_pvn(stash, name, name_end - name, 0, flags); |
| 1092 | if (!gv) { |
| 1093 | /* This is the special case that exempts Foo->import and |
| 1094 | Foo->unimport from being an error even if there's no |
| 1095 | import/unimport subroutine */ |
| 1096 | if (strEQ(name,"import") || strEQ(name,"unimport")) { |
| 1097 | gv = (GV*)sv_2mortal((SV*)newCONSTSUB_flags(NULL, |
| 1098 | NULL, 0, 0, NULL)); |
| 1099 | } else if (autoload) |
| 1100 | gv = gv_autoload_pvn( |
| 1101 | ostash, name, name_end - name, GV_AUTOLOAD_ISMETHOD|flags |
| 1102 | ); |
| 1103 | if (!gv && do_croak) { |
| 1104 | /* Right now this is exclusively for the benefit of S_method_common |
| 1105 | in pp_hot.c */ |
| 1106 | if (stash) { |
| 1107 | /* If we can't find an IO::File method, it might be a call on |
| 1108 | * a filehandle. If IO:File has not been loaded, try to |
| 1109 | * require it first instead of croaking */ |
| 1110 | const char *stash_name = HvNAME_get(stash); |
| 1111 | if (stash_name && memEQs(stash_name, HvNAMELEN_get(stash), "IO::File") |
| 1112 | && !Perl_hv_common(aTHX_ GvHVn(PL_incgv), NULL, |
| 1113 | STR_WITH_LEN("IO/File.pm"), 0, |
| 1114 | HV_FETCH_ISEXISTS, NULL, 0) |
| 1115 | ) { |
| 1116 | require_pv("IO/File.pm"); |
| 1117 | gv = gv_fetchmeth_pvn(stash, name, name_end - name, 0, flags); |
| 1118 | if (gv) |
| 1119 | return gv; |
| 1120 | } |
| 1121 | Perl_croak(aTHX_ |
| 1122 | "Can't locate object method \"%" UTF8f |
| 1123 | "\" via package \"%" HEKf "\"", |
| 1124 | UTF8fARG(is_utf8, name_end - name, name), |
| 1125 | HEKfARG(HvNAME_HEK(stash))); |
| 1126 | } |
| 1127 | else { |
| 1128 | SV* packnamesv; |
| 1129 | |
| 1130 | if (last_separator) { |
| 1131 | packnamesv = newSVpvn_flags(origname, last_separator - origname, |
| 1132 | SVs_TEMP | is_utf8); |
| 1133 | } else { |
| 1134 | packnamesv = error_report; |
| 1135 | } |
| 1136 | |
| 1137 | Perl_croak(aTHX_ |
| 1138 | "Can't locate object method \"%" UTF8f |
| 1139 | "\" via package \"%" SVf "\"" |
| 1140 | " (perhaps you forgot to load \"%" SVf "\"?)", |
| 1141 | UTF8fARG(is_utf8, name_end - name, name), |
| 1142 | SVfARG(packnamesv), SVfARG(packnamesv)); |
| 1143 | } |
| 1144 | } |
| 1145 | } |
| 1146 | else if (autoload) { |
| 1147 | CV* const cv = GvCV(gv); |
| 1148 | if (!CvROOT(cv) && !CvXSUB(cv)) { |
| 1149 | GV* stubgv; |
| 1150 | GV* autogv; |
| 1151 | |
| 1152 | if (CvANON(cv) || CvLEXICAL(cv)) |
| 1153 | stubgv = gv; |
| 1154 | else { |
| 1155 | stubgv = CvGV(cv); |
| 1156 | if (GvCV(stubgv) != cv) /* orphaned import */ |
| 1157 | stubgv = gv; |
| 1158 | } |
| 1159 | autogv = gv_autoload_pvn(GvSTASH(stubgv), |
| 1160 | GvNAME(stubgv), GvNAMELEN(stubgv), |
| 1161 | GV_AUTOLOAD_ISMETHOD |
| 1162 | | (GvNAMEUTF8(stubgv) ? SVf_UTF8 : 0)); |
| 1163 | if (autogv) |
| 1164 | gv = autogv; |
| 1165 | } |
| 1166 | } |
| 1167 | |
| 1168 | return gv; |
| 1169 | } |
| 1170 | |
| 1171 | GV* |
| 1172 | Perl_gv_autoload_sv(pTHX_ HV *stash, SV* namesv, U32 flags) |
| 1173 | { |
| 1174 | char *namepv; |
| 1175 | STRLEN namelen; |
| 1176 | PERL_ARGS_ASSERT_GV_AUTOLOAD_SV; |
| 1177 | namepv = SvPV(namesv, namelen); |
| 1178 | if (SvUTF8(namesv)) |
| 1179 | flags |= SVf_UTF8; |
| 1180 | return gv_autoload_pvn(stash, namepv, namelen, flags); |
| 1181 | } |
| 1182 | |
| 1183 | GV* |
| 1184 | Perl_gv_autoload_pv(pTHX_ HV *stash, const char *namepv, U32 flags) |
| 1185 | { |
| 1186 | PERL_ARGS_ASSERT_GV_AUTOLOAD_PV; |
| 1187 | return gv_autoload_pvn(stash, namepv, strlen(namepv), flags); |
| 1188 | } |
| 1189 | |
| 1190 | GV* |
| 1191 | Perl_gv_autoload_pvn(pTHX_ HV *stash, const char *name, STRLEN len, U32 flags) |
| 1192 | { |
| 1193 | GV* gv; |
| 1194 | CV* cv; |
| 1195 | HV* varstash; |
| 1196 | GV* vargv; |
| 1197 | SV* varsv; |
| 1198 | SV *packname = NULL; |
| 1199 | U32 is_utf8 = flags & SVf_UTF8 ? SVf_UTF8 : 0; |
| 1200 | |
| 1201 | PERL_ARGS_ASSERT_GV_AUTOLOAD_PVN; |
| 1202 | |
| 1203 | if (len == S_autolen && memEQ(name, S_autoload, S_autolen)) |
| 1204 | return NULL; |
| 1205 | if (stash) { |
| 1206 | if (SvTYPE(stash) < SVt_PVHV) { |
| 1207 | STRLEN packname_len = 0; |
| 1208 | const char * const packname_ptr = SvPV_const(MUTABLE_SV(stash), packname_len); |
| 1209 | packname = newSVpvn_flags(packname_ptr, packname_len, |
| 1210 | SVs_TEMP | SvUTF8(stash)); |
| 1211 | stash = NULL; |
| 1212 | } |
| 1213 | else |
| 1214 | packname = sv_2mortal(newSVhek(HvNAME_HEK(stash))); |
| 1215 | if (flags & GV_SUPER) sv_catpvs(packname, "::SUPER"); |
| 1216 | } |
| 1217 | if (!(gv = gv_fetchmeth_pvn(stash, S_autoload, S_autolen, FALSE, |
| 1218 | is_utf8 | (flags & GV_SUPER)))) |
| 1219 | return NULL; |
| 1220 | cv = GvCV(gv); |
| 1221 | |
| 1222 | if (!(CvROOT(cv) || CvXSUB(cv))) |
| 1223 | return NULL; |
| 1224 | |
| 1225 | /* |
| 1226 | * Inheriting AUTOLOAD for non-methods no longer works |
| 1227 | */ |
| 1228 | if ( |
| 1229 | !(flags & GV_AUTOLOAD_ISMETHOD) |
| 1230 | && (GvCVGEN(gv) || GvSTASH(gv) != stash) |
| 1231 | ) |
| 1232 | Perl_croak(aTHX_ "Use of inherited AUTOLOAD for non-method %" SVf |
| 1233 | "::%" UTF8f "() is no longer allowed", |
| 1234 | SVfARG(packname), |
| 1235 | UTF8fARG(is_utf8, len, name)); |
| 1236 | |
| 1237 | if (CvISXSUB(cv)) { |
| 1238 | /* Instead of forcing the XSUB do another lookup for $AUTOLOAD |
| 1239 | * and split that value on the last '::', pass along the same data |
| 1240 | * via the SvPVX field in the CV, and the stash in CvSTASH. |
| 1241 | * |
| 1242 | * Due to an unfortunate accident of history, the SvPVX field |
| 1243 | * serves two purposes. It is also used for the subroutine's pro- |
| 1244 | * type. Since SvPVX has been documented as returning the sub name |
| 1245 | * for a long time, but not as returning the prototype, we have |
| 1246 | * to preserve the SvPVX AUTOLOAD behaviour and put the prototype |
| 1247 | * elsewhere. |
| 1248 | * |
| 1249 | * We put the prototype in the same allocated buffer, but after |
| 1250 | * the sub name. The SvPOK flag indicates the presence of a proto- |
| 1251 | * type. The CvAUTOLOAD flag indicates the presence of a sub name. |
| 1252 | * If both flags are on, then SvLEN is used to indicate the end of |
| 1253 | * the prototype (artificially lower than what is actually allo- |
| 1254 | * cated), at the risk of having to reallocate a few bytes unneces- |
| 1255 | * sarily--but that should happen very rarely, if ever. |
| 1256 | * |
| 1257 | * We use SvUTF8 for both prototypes and sub names, so if one is |
| 1258 | * UTF8, the other must be upgraded. |
| 1259 | */ |
| 1260 | CvSTASH_set(cv, stash); |
| 1261 | if (SvPOK(cv)) { /* Ouch! */ |
| 1262 | SV * const tmpsv = newSVpvn_flags(name, len, is_utf8); |
| 1263 | STRLEN ulen; |
| 1264 | const char *proto = CvPROTO(cv); |
| 1265 | assert(proto); |
| 1266 | if (SvUTF8(cv)) |
| 1267 | sv_utf8_upgrade_flags_grow(tmpsv, 0, CvPROTOLEN(cv) + 2); |
| 1268 | ulen = SvCUR(tmpsv); |
| 1269 | SvCUR(tmpsv)++; /* include null in string */ |
| 1270 | sv_catpvn_flags( |
| 1271 | tmpsv, proto, CvPROTOLEN(cv), SV_CATBYTES*!SvUTF8(cv) |
| 1272 | ); |
| 1273 | SvTEMP_on(tmpsv); /* Allow theft */ |
| 1274 | sv_setsv_nomg((SV *)cv, tmpsv); |
| 1275 | SvTEMP_off(tmpsv); |
| 1276 | SvREFCNT_dec_NN(tmpsv); |
| 1277 | SvLEN_set(cv, SvCUR(cv) + 1); |
| 1278 | SvCUR(cv) = ulen; |
| 1279 | } |
| 1280 | else { |
| 1281 | sv_setpvn((SV *)cv, name, len); |
| 1282 | SvPOK_off(cv); |
| 1283 | if (is_utf8) |
| 1284 | SvUTF8_on(cv); |
| 1285 | else SvUTF8_off(cv); |
| 1286 | } |
| 1287 | CvAUTOLOAD_on(cv); |
| 1288 | } |
| 1289 | |
| 1290 | /* |
| 1291 | * Given &FOO::AUTOLOAD, set $FOO::AUTOLOAD to desired function name. |
| 1292 | * The subroutine's original name may not be "AUTOLOAD", so we don't |
| 1293 | * use that, but for lack of anything better we will use the sub's |
| 1294 | * original package to look up $AUTOLOAD. |
| 1295 | */ |
| 1296 | varstash = CvNAMED(cv) ? CvSTASH(cv) : GvSTASH(CvGV(cv)); |
| 1297 | vargv = *(GV**)hv_fetch(varstash, S_autoload, S_autolen, TRUE); |
| 1298 | ENTER; |
| 1299 | |
| 1300 | if (!isGV(vargv)) { |
| 1301 | gv_init_pvn(vargv, varstash, S_autoload, S_autolen, 0); |
| 1302 | #ifdef PERL_DONT_CREATE_GVSV |
| 1303 | GvSV(vargv) = newSV(0); |
| 1304 | #endif |
| 1305 | } |
| 1306 | LEAVE; |
| 1307 | varsv = GvSVn(vargv); |
| 1308 | SvTAINTED_off(varsv); /* previous $AUTOLOAD taint is obsolete */ |
| 1309 | /* XXX: this process is not careful to avoid extra magic gets and sets; tied $AUTOLOAD will get noise */ |
| 1310 | sv_setsv(varsv, packname); |
| 1311 | sv_catpvs(varsv, "::"); |
| 1312 | /* Ensure SvSETMAGIC() is called if necessary. In particular, to clear |
| 1313 | tainting if $FOO::AUTOLOAD was previously tainted, but is not now. */ |
| 1314 | sv_catpvn_flags( |
| 1315 | varsv, name, len, |
| 1316 | SV_SMAGIC|(is_utf8 ? SV_CATUTF8 : SV_CATBYTES) |
| 1317 | ); |
| 1318 | if (is_utf8) |
| 1319 | SvUTF8_on(varsv); |
| 1320 | return gv; |
| 1321 | } |
| 1322 | |
| 1323 | |
| 1324 | /* require_tie_mod() internal routine for requiring a module |
| 1325 | * that implements the logic of automatic ties like %! and %- |
| 1326 | * It loads the module and then calls the _tie_it subroutine |
| 1327 | * with the passed gv as an argument. |
| 1328 | * |
| 1329 | * The "gv" parameter should be the glob. |
| 1330 | * "varname" holds the 1-char name of the var, used for error messages. |
| 1331 | * "namesv" holds the module name. Its refcount will be decremented. |
| 1332 | * "flags": if flag & 1 then save the scalar before loading. |
| 1333 | * For the protection of $! to work (it is set by this routine) |
| 1334 | * the sv slot must already be magicalized. |
| 1335 | */ |
| 1336 | STATIC void |
| 1337 | S_require_tie_mod(pTHX_ GV *gv, const char varname, const char * name, |
| 1338 | STRLEN len, const U32 flags) |
| 1339 | { |
| 1340 | const SV * const target = varname == '[' ? GvSV(gv) : (SV *)GvHV(gv); |
| 1341 | |
| 1342 | PERL_ARGS_ASSERT_REQUIRE_TIE_MOD; |
| 1343 | |
| 1344 | /* If it is not tied */ |
| 1345 | if (!target || !SvRMAGICAL(target) |
| 1346 | || !mg_find(target, |
| 1347 | varname == '[' ? PERL_MAGIC_tiedscalar : PERL_MAGIC_tied)) |
| 1348 | { |
| 1349 | HV *stash; |
| 1350 | GV **gvp; |
| 1351 | dSP; |
| 1352 | |
| 1353 | PUSHSTACKi(PERLSI_MAGIC); |
| 1354 | ENTER; |
| 1355 | |
| 1356 | #define GET_HV_FETCH_TIE_FUNC \ |
| 1357 | ( (gvp = (GV **)hv_fetchs(stash, "_tie_it", 0)) \ |
| 1358 | && *gvp \ |
| 1359 | && ( (isGV(*gvp) && GvCV(*gvp)) \ |
| 1360 | || (SvROK(*gvp) && SvTYPE(SvRV(*gvp)) == SVt_PVCV) ) \ |
| 1361 | ) |
| 1362 | |
| 1363 | /* Load the module if it is not loaded. */ |
| 1364 | if (!(stash = gv_stashpvn(name, len, 0)) |
| 1365 | || ! GET_HV_FETCH_TIE_FUNC) |
| 1366 | { |
| 1367 | SV * const module = newSVpvn(name, len); |
| 1368 | const char type = varname == '[' ? '$' : '%'; |
| 1369 | if ( flags & 1 ) |
| 1370 | save_scalar(gv); |
| 1371 | Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, module, NULL); |
| 1372 | assert(sp == PL_stack_sp); |
| 1373 | stash = gv_stashpvn(name, len, 0); |
| 1374 | if (!stash) |
| 1375 | Perl_croak(aTHX_ "panic: Can't use %c%c because %s is not available", |
| 1376 | type, varname, name); |
| 1377 | else if (! GET_HV_FETCH_TIE_FUNC) |
| 1378 | Perl_croak(aTHX_ "panic: Can't use %c%c because %s does not define _tie_it", |
| 1379 | type, varname, name); |
| 1380 | } |
| 1381 | /* Now call the tie function. It should be in *gvp. */ |
| 1382 | assert(gvp); assert(*gvp); |
| 1383 | PUSHMARK(SP); |
| 1384 | XPUSHs((SV *)gv); |
| 1385 | PUTBACK; |
| 1386 | call_sv((SV *)*gvp, G_VOID|G_DISCARD); |
| 1387 | LEAVE; |
| 1388 | POPSTACK; |
| 1389 | } |
| 1390 | } |
| 1391 | |
| 1392 | /* add a require_tie_mod_s - the _s suffix is similar to pvs type suffixes, |
| 1393 | * IOW it means we do STR_WITH_LEN() ourselves and the user should pass in |
| 1394 | * a true string WITHOUT a len. |
| 1395 | */ |
| 1396 | #define require_tie_mod_s(gv, varname, name, flags) \ |
| 1397 | S_require_tie_mod(aTHX_ gv, varname, STR_WITH_LEN(name), flags) |
| 1398 | |
| 1399 | /* |
| 1400 | =for apidoc gv_stashpv |
| 1401 | |
| 1402 | Returns a pointer to the stash for a specified package. Uses C<strlen> to |
| 1403 | determine the length of C<name>, then calls C<gv_stashpvn()>. |
| 1404 | |
| 1405 | =cut |
| 1406 | */ |
| 1407 | |
| 1408 | HV* |
| 1409 | Perl_gv_stashpv(pTHX_ const char *name, I32 create) |
| 1410 | { |
| 1411 | PERL_ARGS_ASSERT_GV_STASHPV; |
| 1412 | return gv_stashpvn(name, strlen(name), create); |
| 1413 | } |
| 1414 | |
| 1415 | /* |
| 1416 | =for apidoc gv_stashpvn |
| 1417 | |
| 1418 | Returns a pointer to the stash for a specified package. The C<namelen> |
| 1419 | parameter indicates the length of the C<name>, in bytes. C<flags> is passed |
| 1420 | to C<gv_fetchpvn_flags()>, so if set to C<GV_ADD> then the package will be |
| 1421 | created if it does not already exist. If the package does not exist and |
| 1422 | C<flags> is 0 (or any other setting that does not create packages) then C<NULL> |
| 1423 | is returned. |
| 1424 | |
| 1425 | Flags may be one of: |
| 1426 | |
| 1427 | GV_ADD |
| 1428 | SVf_UTF8 |
| 1429 | GV_NOADD_NOINIT |
| 1430 | GV_NOINIT |
| 1431 | GV_NOEXPAND |
| 1432 | GV_ADDMG |
| 1433 | |
| 1434 | The most important of which are probably C<GV_ADD> and C<SVf_UTF8>. |
| 1435 | |
| 1436 | Note, use of C<gv_stashsv> instead of C<gv_stashpvn> where possible is strongly |
| 1437 | recommended for performance reasons. |
| 1438 | |
| 1439 | =cut |
| 1440 | */ |
| 1441 | |
| 1442 | /* |
| 1443 | gv_stashpvn_internal |
| 1444 | |
| 1445 | Perform the internal bits of gv_stashsvpvn_cached. You could think of this |
| 1446 | as being one half of the logic. Not to be called except from gv_stashsvpvn_cached(). |
| 1447 | |
| 1448 | */ |
| 1449 | |
| 1450 | PERL_STATIC_INLINE HV* |
| 1451 | S_gv_stashpvn_internal(pTHX_ const char *name, U32 namelen, I32 flags) |
| 1452 | { |
| 1453 | char smallbuf[128]; |
| 1454 | char *tmpbuf; |
| 1455 | HV *stash; |
| 1456 | GV *tmpgv; |
| 1457 | U32 tmplen = namelen + 2; |
| 1458 | |
| 1459 | PERL_ARGS_ASSERT_GV_STASHPVN_INTERNAL; |
| 1460 | |
| 1461 | if (tmplen <= sizeof smallbuf) |
| 1462 | tmpbuf = smallbuf; |
| 1463 | else |
| 1464 | Newx(tmpbuf, tmplen, char); |
| 1465 | Copy(name, tmpbuf, namelen, char); |
| 1466 | tmpbuf[namelen] = ':'; |
| 1467 | tmpbuf[namelen+1] = ':'; |
| 1468 | tmpgv = gv_fetchpvn_flags(tmpbuf, tmplen, flags, SVt_PVHV); |
| 1469 | if (tmpbuf != smallbuf) |
| 1470 | Safefree(tmpbuf); |
| 1471 | if (!tmpgv || !isGV_with_GP(tmpgv)) |
| 1472 | return NULL; |
| 1473 | stash = GvHV(tmpgv); |
| 1474 | if (!(flags & ~GV_NOADD_MASK) && !stash) return NULL; |
| 1475 | assert(stash); |
| 1476 | if (!HvNAME_get(stash)) { |
| 1477 | hv_name_set(stash, name, namelen, flags & SVf_UTF8 ? SVf_UTF8 : 0 ); |
| 1478 | |
| 1479 | /* FIXME: This is a repeat of logic in gv_fetchpvn_flags */ |
| 1480 | /* If the containing stash has multiple effective |
| 1481 | names, see that this one gets them, too. */ |
| 1482 | if (HvAUX(GvSTASH(tmpgv))->xhv_name_count) |
| 1483 | mro_package_moved(stash, NULL, tmpgv, 1); |
| 1484 | } |
| 1485 | return stash; |
| 1486 | } |
| 1487 | |
| 1488 | /* |
| 1489 | gv_stashsvpvn_cached |
| 1490 | |
| 1491 | Returns a pointer to the stash for a specified package, possibly |
| 1492 | cached. Implements both C<gv_stashpvn> and C<gv_stashsv>. |
| 1493 | |
| 1494 | Requires one of either namesv or namepv to be non-null. |
| 1495 | |
| 1496 | See C<L</gv_stashpvn>> for details on "flags". |
| 1497 | |
| 1498 | Note the sv interface is strongly preferred for performance reasons. |
| 1499 | |
| 1500 | */ |
| 1501 | |
| 1502 | #define PERL_ARGS_ASSERT_GV_STASHSVPVN_CACHED \ |
| 1503 | assert(namesv || name) |
| 1504 | |
| 1505 | PERL_STATIC_INLINE HV* |
| 1506 | S_gv_stashsvpvn_cached(pTHX_ SV *namesv, const char *name, U32 namelen, I32 flags) |
| 1507 | { |
| 1508 | HV* stash; |
| 1509 | HE* he; |
| 1510 | |
| 1511 | PERL_ARGS_ASSERT_GV_STASHSVPVN_CACHED; |
| 1512 | |
| 1513 | he = (HE *)hv_common( |
| 1514 | PL_stashcache, namesv, name, namelen, |
| 1515 | (flags & SVf_UTF8) ? HVhek_UTF8 : 0, 0, NULL, 0 |
| 1516 | ); |
| 1517 | |
| 1518 | if (he) { |
| 1519 | SV *sv = HeVAL(he); |
| 1520 | HV *hv; |
| 1521 | assert(SvIOK(sv)); |
| 1522 | hv = INT2PTR(HV*, SvIVX(sv)); |
| 1523 | assert(SvTYPE(hv) == SVt_PVHV); |
| 1524 | return hv; |
| 1525 | } |
| 1526 | else if (flags & GV_CACHE_ONLY) return NULL; |
| 1527 | |
| 1528 | if (namesv) { |
| 1529 | if (SvOK(namesv)) { /* prevent double uninit warning */ |
| 1530 | STRLEN len; |
| 1531 | name = SvPV_const(namesv, len); |
| 1532 | namelen = len; |
| 1533 | flags |= SvUTF8(namesv); |
| 1534 | } else { |
| 1535 | name = ""; namelen = 0; |
| 1536 | } |
| 1537 | } |
| 1538 | stash = gv_stashpvn_internal(name, namelen, flags); |
| 1539 | |
| 1540 | if (stash && namelen) { |
| 1541 | SV* const ref = newSViv(PTR2IV(stash)); |
| 1542 | (void)hv_store(PL_stashcache, name, |
| 1543 | (flags & SVf_UTF8) ? -(I32)namelen : (I32)namelen, ref, 0); |
| 1544 | } |
| 1545 | |
| 1546 | return stash; |
| 1547 | } |
| 1548 | |
| 1549 | HV* |
| 1550 | Perl_gv_stashpvn(pTHX_ const char *name, U32 namelen, I32 flags) |
| 1551 | { |
| 1552 | PERL_ARGS_ASSERT_GV_STASHPVN; |
| 1553 | return gv_stashsvpvn_cached(NULL, name, namelen, flags); |
| 1554 | } |
| 1555 | |
| 1556 | /* |
| 1557 | =for apidoc gv_stashsv |
| 1558 | |
| 1559 | Returns a pointer to the stash for a specified package. See |
| 1560 | C<L</gv_stashpvn>>. |
| 1561 | |
| 1562 | Note this interface is strongly preferred over C<gv_stashpvn> for performance |
| 1563 | reasons. |
| 1564 | |
| 1565 | =cut |
| 1566 | */ |
| 1567 | |
| 1568 | HV* |
| 1569 | Perl_gv_stashsv(pTHX_ SV *sv, I32 flags) |
| 1570 | { |
| 1571 | PERL_ARGS_ASSERT_GV_STASHSV; |
| 1572 | return gv_stashsvpvn_cached(sv, NULL, 0, flags); |
| 1573 | } |
| 1574 | |
| 1575 | |
| 1576 | GV * |
| 1577 | Perl_gv_fetchpv(pTHX_ const char *nambeg, I32 add, const svtype sv_type) { |
| 1578 | PERL_ARGS_ASSERT_GV_FETCHPV; |
| 1579 | return gv_fetchpvn_flags(nambeg, strlen(nambeg), add, sv_type); |
| 1580 | } |
| 1581 | |
| 1582 | GV * |
| 1583 | Perl_gv_fetchsv(pTHX_ SV *name, I32 flags, const svtype sv_type) { |
| 1584 | STRLEN len; |
| 1585 | const char * const nambeg = |
| 1586 | SvPV_flags_const(name, len, flags & GV_NO_SVGMAGIC ? 0 : SV_GMAGIC); |
| 1587 | PERL_ARGS_ASSERT_GV_FETCHSV; |
| 1588 | return gv_fetchpvn_flags(nambeg, len, flags | SvUTF8(name), sv_type); |
| 1589 | } |
| 1590 | |
| 1591 | PERL_STATIC_INLINE void |
| 1592 | S_gv_magicalize_isa(pTHX_ GV *gv) |
| 1593 | { |
| 1594 | AV* av; |
| 1595 | |
| 1596 | PERL_ARGS_ASSERT_GV_MAGICALIZE_ISA; |
| 1597 | |
| 1598 | av = GvAVn(gv); |
| 1599 | GvMULTI_on(gv); |
| 1600 | sv_magic(MUTABLE_SV(av), MUTABLE_SV(gv), PERL_MAGIC_isa, |
| 1601 | NULL, 0); |
| 1602 | } |
| 1603 | |
| 1604 | /* This function grabs name and tries to split a stash and glob |
| 1605 | * from its contents. TODO better description, comments |
| 1606 | * |
| 1607 | * If the function returns TRUE and 'name == name_end', then |
| 1608 | * 'gv' can be directly returned to the caller of gv_fetchpvn_flags |
| 1609 | */ |
| 1610 | PERL_STATIC_INLINE bool |
| 1611 | S_parse_gv_stash_name(pTHX_ HV **stash, GV **gv, const char **name, |
| 1612 | STRLEN *len, const char *nambeg, STRLEN full_len, |
| 1613 | const U32 is_utf8, const I32 add) |
| 1614 | { |
| 1615 | char *tmpfullbuf = NULL; /* only malloc one big chunk of memory when the smallbuff is not large enough */ |
| 1616 | const char *name_cursor; |
| 1617 | const char *const name_end = nambeg + full_len; |
| 1618 | const char *const name_em1 = name_end - 1; |
| 1619 | char smallbuf[64]; /* small buffer to avoid a malloc when possible */ |
| 1620 | |
| 1621 | PERL_ARGS_ASSERT_PARSE_GV_STASH_NAME; |
| 1622 | |
| 1623 | if ( full_len > 2 |
| 1624 | && **name == '*' |
| 1625 | && isIDFIRST_lazy_if_safe(*name + 1, name_end, is_utf8)) |
| 1626 | { |
| 1627 | /* accidental stringify on a GV? */ |
| 1628 | (*name)++; |
| 1629 | } |
| 1630 | |
| 1631 | for (name_cursor = *name; name_cursor < name_end; name_cursor++) { |
| 1632 | if (name_cursor < name_em1 && |
| 1633 | ((*name_cursor == ':' && name_cursor[1] == ':') |
| 1634 | || *name_cursor == '\'')) |
| 1635 | { |
| 1636 | if (!*stash) |
| 1637 | *stash = PL_defstash; |
| 1638 | if (!*stash || !SvREFCNT(*stash)) /* symbol table under destruction */ |
| 1639 | return FALSE; |
| 1640 | |
| 1641 | *len = name_cursor - *name; |
| 1642 | if (name_cursor > nambeg) { /* Skip for initial :: or ' */ |
| 1643 | const char *key; |
| 1644 | GV**gvp; |
| 1645 | if (*name_cursor == ':') { |
| 1646 | key = *name; |
| 1647 | *len += 2; |
| 1648 | } |
| 1649 | else { /* using ' for package separator */ |
| 1650 | /* use our pre-allocated buffer when possible to save a malloc */ |
| 1651 | char *tmpbuf; |
| 1652 | if ( *len+2 <= sizeof smallbuf) |
| 1653 | tmpbuf = smallbuf; |
| 1654 | else { |
| 1655 | /* only malloc once if needed */ |
| 1656 | if (tmpfullbuf == NULL) /* only malloc&free once, a little more than needed */ |
| 1657 | Newx(tmpfullbuf, full_len+2, char); |
| 1658 | tmpbuf = tmpfullbuf; |
| 1659 | } |
| 1660 | Copy(*name, tmpbuf, *len, char); |
| 1661 | tmpbuf[(*len)++] = ':'; |
| 1662 | tmpbuf[(*len)++] = ':'; |
| 1663 | key = tmpbuf; |
| 1664 | } |
| 1665 | gvp = (GV**)hv_fetch(*stash, key, is_utf8 ? -((I32)*len) : (I32)*len, add); |
| 1666 | *gv = gvp ? *gvp : NULL; |
| 1667 | if (!*gv || *gv == (const GV *)&PL_sv_undef) { |
| 1668 | Safefree(tmpfullbuf); /* free our tmpfullbuf if it was used */ |
| 1669 | return FALSE; |
| 1670 | } |
| 1671 | /* here we know that *gv && *gv != &PL_sv_undef */ |
| 1672 | if (SvTYPE(*gv) != SVt_PVGV) |
| 1673 | gv_init_pvn(*gv, *stash, key, *len, (add & GV_ADDMULTI)|is_utf8); |
| 1674 | else |
| 1675 | GvMULTI_on(*gv); |
| 1676 | |
| 1677 | if (!(*stash = GvHV(*gv))) { |
| 1678 | *stash = GvHV(*gv) = newHV(); |
| 1679 | if (!HvNAME_get(*stash)) { |
| 1680 | if (GvSTASH(*gv) == PL_defstash && *len == 6 |
| 1681 | && strBEGINs(*name, "CORE")) |
| 1682 | hv_name_sets(*stash, "CORE", 0); |
| 1683 | else |
| 1684 | hv_name_set( |
| 1685 | *stash, nambeg, name_cursor-nambeg, is_utf8 |
| 1686 | ); |
| 1687 | /* If the containing stash has multiple effective |
| 1688 | names, see that this one gets them, too. */ |
| 1689 | if (HvAUX(GvSTASH(*gv))->xhv_name_count) |
| 1690 | mro_package_moved(*stash, NULL, *gv, 1); |
| 1691 | } |
| 1692 | } |
| 1693 | else if (!HvNAME_get(*stash)) |
| 1694 | hv_name_set(*stash, nambeg, name_cursor - nambeg, is_utf8); |
| 1695 | } |
| 1696 | |
| 1697 | if (*name_cursor == ':') |
| 1698 | name_cursor++; |
| 1699 | *name = name_cursor+1; |
| 1700 | if (*name == name_end) { |
| 1701 | if (!*gv) { |
| 1702 | *gv = MUTABLE_GV(*hv_fetchs(PL_defstash, "main::", TRUE)); |
| 1703 | if (SvTYPE(*gv) != SVt_PVGV) { |
| 1704 | gv_init_pvn(*gv, PL_defstash, "main::", 6, |
| 1705 | GV_ADDMULTI); |
| 1706 | GvHV(*gv) = |
| 1707 | MUTABLE_HV(SvREFCNT_inc_simple(PL_defstash)); |
| 1708 | } |
| 1709 | } |
| 1710 | Safefree(tmpfullbuf); /* free our tmpfullbuf if it was used */ |
| 1711 | return TRUE; |
| 1712 | } |
| 1713 | } |
| 1714 | } |
| 1715 | *len = name_cursor - *name; |
| 1716 | return TRUE; |
| 1717 | } |
| 1718 | |
| 1719 | /* Checks if an unqualified name is in the main stash */ |
| 1720 | PERL_STATIC_INLINE bool |
| 1721 | S_gv_is_in_main(pTHX_ const char *name, STRLEN len, const U32 is_utf8) |
| 1722 | { |
| 1723 | PERL_ARGS_ASSERT_GV_IS_IN_MAIN; |
| 1724 | |
| 1725 | /* If it's an alphanumeric variable */ |
| 1726 | if ( len && isIDFIRST_lazy_if_safe(name, name + len, is_utf8) ) { |
| 1727 | /* Some "normal" variables are always in main::, |
| 1728 | * like INC or STDOUT. |
| 1729 | */ |
| 1730 | switch (len) { |
| 1731 | case 1: |
| 1732 | if (*name == '_') |
| 1733 | return TRUE; |
| 1734 | break; |
| 1735 | case 3: |
| 1736 | if ((name[0] == 'I' && name[1] == 'N' && name[2] == 'C') |
| 1737 | || (name[0] == 'E' && name[1] == 'N' && name[2] == 'V') |
| 1738 | || (name[0] == 'S' && name[1] == 'I' && name[2] == 'G')) |
| 1739 | return TRUE; |
| 1740 | break; |
| 1741 | case 4: |
| 1742 | if (name[0] == 'A' && name[1] == 'R' && name[2] == 'G' |
| 1743 | && name[3] == 'V') |
| 1744 | return TRUE; |
| 1745 | break; |
| 1746 | case 5: |
| 1747 | if (name[0] == 'S' && name[1] == 'T' && name[2] == 'D' |
| 1748 | && name[3] == 'I' && name[4] == 'N') |
| 1749 | return TRUE; |
| 1750 | break; |
| 1751 | case 6: |
| 1752 | if ((name[0] == 'S' && name[1] == 'T' && name[2] == 'D') |
| 1753 | &&((name[3] == 'O' && name[4] == 'U' && name[5] == 'T') |
| 1754 | ||(name[3] == 'E' && name[4] == 'R' && name[5] == 'R'))) |
| 1755 | return TRUE; |
| 1756 | break; |
| 1757 | case 7: |
| 1758 | if (name[0] == 'A' && name[1] == 'R' && name[2] == 'G' |
| 1759 | && name[3] == 'V' && name[4] == 'O' && name[5] == 'U' |
| 1760 | && name[6] == 'T') |
| 1761 | return TRUE; |
| 1762 | break; |
| 1763 | } |
| 1764 | } |
| 1765 | /* *{""}, or a special variable like $@ */ |
| 1766 | else |
| 1767 | return TRUE; |
| 1768 | |
| 1769 | return FALSE; |
| 1770 | } |
| 1771 | |
| 1772 | |
| 1773 | /* This function is called if parse_gv_stash_name() failed to |
| 1774 | * find a stash, or if GV_NOTQUAL or an empty name was passed |
| 1775 | * to gv_fetchpvn_flags. |
| 1776 | * |
| 1777 | * It returns FALSE if the default stash can't be found nor created, |
| 1778 | * which might happen during global destruction. |
| 1779 | */ |
| 1780 | PERL_STATIC_INLINE bool |
| 1781 | S_find_default_stash(pTHX_ HV **stash, const char *name, STRLEN len, |
| 1782 | const U32 is_utf8, const I32 add, |
| 1783 | const svtype sv_type) |
| 1784 | { |
| 1785 | PERL_ARGS_ASSERT_FIND_DEFAULT_STASH; |
| 1786 | |
| 1787 | /* No stash in name, so see how we can default */ |
| 1788 | |
| 1789 | if ( gv_is_in_main(name, len, is_utf8) ) { |
| 1790 | *stash = PL_defstash; |
| 1791 | } |
| 1792 | else { |
| 1793 | if (IN_PERL_COMPILETIME) { |
| 1794 | *stash = PL_curstash; |
| 1795 | if (add && (PL_hints & HINT_STRICT_VARS) && |
| 1796 | sv_type != SVt_PVCV && |
| 1797 | sv_type != SVt_PVGV && |
| 1798 | sv_type != SVt_PVFM && |
| 1799 | sv_type != SVt_PVIO && |
| 1800 | !(len == 1 && sv_type == SVt_PV && |
| 1801 | (*name == 'a' || *name == 'b')) ) |
| 1802 | { |
| 1803 | GV**gvp = (GV**)hv_fetch(*stash,name,is_utf8 ? -(I32)len : (I32)len,0); |
| 1804 | if (!gvp || *gvp == (const GV *)&PL_sv_undef || |
| 1805 | SvTYPE(*gvp) != SVt_PVGV) |
| 1806 | { |
| 1807 | *stash = NULL; |
| 1808 | } |
| 1809 | else if ((sv_type == SVt_PV && !GvIMPORTED_SV(*gvp)) || |
| 1810 | (sv_type == SVt_PVAV && !GvIMPORTED_AV(*gvp)) || |
| 1811 | (sv_type == SVt_PVHV && !GvIMPORTED_HV(*gvp)) ) |
| 1812 | { |
| 1813 | /* diag_listed_as: Variable "%s" is not imported%s */ |
| 1814 | Perl_ck_warner_d( |
| 1815 | aTHX_ packWARN(WARN_MISC), |
| 1816 | "Variable \"%c%" UTF8f "\" is not imported", |
| 1817 | sv_type == SVt_PVAV ? '@' : |
| 1818 | sv_type == SVt_PVHV ? '%' : '$', |
| 1819 | UTF8fARG(is_utf8, len, name)); |
| 1820 | if (GvCVu(*gvp)) |
| 1821 | Perl_ck_warner_d( |
| 1822 | aTHX_ packWARN(WARN_MISC), |
| 1823 | "\t(Did you mean &%" UTF8f " instead?)\n", |
| 1824 | UTF8fARG(is_utf8, len, name) |
| 1825 | ); |
| 1826 | *stash = NULL; |
| 1827 | } |
| 1828 | } |
| 1829 | } |
| 1830 | else { |
| 1831 | /* Use the current op's stash */ |
| 1832 | *stash = CopSTASH(PL_curcop); |
| 1833 | } |
| 1834 | } |
| 1835 | |
| 1836 | if (!*stash) { |
| 1837 | if (add && !PL_in_clean_all) { |
| 1838 | GV *gv; |
| 1839 | qerror(Perl_mess(aTHX_ |
| 1840 | "Global symbol \"%s%" UTF8f |
| 1841 | "\" requires explicit package name (did you forget to " |
| 1842 | "declare \"my %s%" UTF8f "\"?)", |
| 1843 | (sv_type == SVt_PV ? "$" |
| 1844 | : sv_type == SVt_PVAV ? "@" |
| 1845 | : sv_type == SVt_PVHV ? "%" |
| 1846 | : ""), UTF8fARG(is_utf8, len, name), |
| 1847 | (sv_type == SVt_PV ? "$" |
| 1848 | : sv_type == SVt_PVAV ? "@" |
| 1849 | : sv_type == SVt_PVHV ? "%" |
| 1850 | : ""), UTF8fARG(is_utf8, len, name))); |
| 1851 | /* To maintain the output of errors after the strict exception |
| 1852 | * above, and to keep compat with older releases, rather than |
| 1853 | * placing the variables in the pad, we place |
| 1854 | * them in the <none>:: stash. |
| 1855 | */ |
| 1856 | gv = gv_fetchpvs("<none>::", GV_ADDMULTI, SVt_PVHV); |
| 1857 | if (!gv) { |
| 1858 | /* symbol table under destruction */ |
| 1859 | return FALSE; |
| 1860 | } |
| 1861 | *stash = GvHV(gv); |
| 1862 | } |
| 1863 | else |
| 1864 | return FALSE; |
| 1865 | } |
| 1866 | |
| 1867 | if (!SvREFCNT(*stash)) /* symbol table under destruction */ |
| 1868 | return FALSE; |
| 1869 | |
| 1870 | return TRUE; |
| 1871 | } |
| 1872 | |
| 1873 | /* gv_magicalize only turns on the SVf_READONLY flag, not SVf_PROTECT. So |
| 1874 | redefine SvREADONLY_on for that purpose. We don’t use it later on in |
| 1875 | this file. */ |
| 1876 | #undef SvREADONLY_on |
| 1877 | #define SvREADONLY_on(sv) (SvFLAGS(sv) |= SVf_READONLY) |
| 1878 | |
| 1879 | /* gv_magicalize() is called by gv_fetchpvn_flags when creating |
| 1880 | * a new GV. |
| 1881 | * Note that it does not insert the GV into the stash prior to |
| 1882 | * magicalization, which some variables require need in order |
| 1883 | * to work (like %+, %-, %!), so callers must take care of |
| 1884 | * that. |
| 1885 | * |
| 1886 | * It returns true if the gv did turn out to be magical one; i.e., |
| 1887 | * if gv_magicalize actually did something. |
| 1888 | */ |
| 1889 | PERL_STATIC_INLINE bool |
| 1890 | S_gv_magicalize(pTHX_ GV *gv, HV *stash, const char *name, STRLEN len, |
| 1891 | const svtype sv_type) |
| 1892 | { |
| 1893 | SSize_t paren; |
| 1894 | |
| 1895 | PERL_ARGS_ASSERT_GV_MAGICALIZE; |
| 1896 | |
| 1897 | if (stash != PL_defstash) { /* not the main stash */ |
| 1898 | /* We only have to check for a few names here: a, b, EXPORT, ISA |
| 1899 | and VERSION. All the others apply only to the main stash or to |
| 1900 | CORE (which is checked right after this). */ |
| 1901 | if (len) { |
| 1902 | switch (*name) { |
| 1903 | case 'E': |
| 1904 | if ( |
| 1905 | len >= 6 && name[1] == 'X' && |
| 1906 | (memEQs(name, len, "EXPORT") |
| 1907 | ||memEQs(name, len, "EXPORT_OK") |
| 1908 | ||memEQs(name, len, "EXPORT_FAIL") |
| 1909 | ||memEQs(name, len, "EXPORT_TAGS")) |
| 1910 | ) |
| 1911 | GvMULTI_on(gv); |
| 1912 | break; |
| 1913 | case 'I': |
| 1914 | if (memEQs(name, len, "ISA")) |
| 1915 | gv_magicalize_isa(gv); |
| 1916 | break; |
| 1917 | case 'V': |
| 1918 | if (memEQs(name, len, "VERSION")) |
| 1919 | GvMULTI_on(gv); |
| 1920 | break; |
| 1921 | case 'a': |
| 1922 | if (stash == PL_debstash && memEQs(name, len, "args")) { |
| 1923 | GvMULTI_on(gv_AVadd(gv)); |
| 1924 | break; |
| 1925 | } |
| 1926 | /* FALLTHROUGH */ |
| 1927 | case 'b': |
| 1928 | if (len == 1 && sv_type == SVt_PV) |
| 1929 | GvMULTI_on(gv); |
| 1930 | /* FALLTHROUGH */ |
| 1931 | default: |
| 1932 | goto try_core; |
| 1933 | } |
| 1934 | goto ret; |
| 1935 | } |
| 1936 | try_core: |
| 1937 | if (len > 1 /* shortest is uc */ && HvNAMELEN_get(stash) == 4) { |
| 1938 | /* Avoid null warning: */ |
| 1939 | const char * const stashname = HvNAME(stash); assert(stashname); |
| 1940 | if (strBEGINs(stashname, "CORE")) |
| 1941 | S_maybe_add_coresub(aTHX_ 0, gv, name, len); |
| 1942 | } |
| 1943 | } |
| 1944 | else if (len > 1) { |
| 1945 | #ifndef EBCDIC |
| 1946 | if (*name > 'V' ) { |
| 1947 | NOOP; |
| 1948 | /* Nothing else to do. |
| 1949 | The compiler will probably turn the switch statement into a |
| 1950 | branch table. Make sure we avoid even that small overhead for |
| 1951 | the common case of lower case variable names. (On EBCDIC |
| 1952 | platforms, we can't just do: |
| 1953 | if (NATIVE_TO_ASCII(*name) > NATIVE_TO_ASCII('V') ) { |
| 1954 | because cases like '\027' in the switch statement below are |
| 1955 | C1 (non-ASCII) controls on those platforms, so the remapping |
| 1956 | would make them larger than 'V') |
| 1957 | */ |
| 1958 | } else |
| 1959 | #endif |
| 1960 | { |
| 1961 | switch (*name) { |
| 1962 | case 'A': |
| 1963 | if (memEQs(name, len, "ARGV")) { |
| 1964 | IoFLAGS(GvIOn(gv)) |= IOf_ARGV|IOf_START; |
| 1965 | } |
| 1966 | else if (memEQs(name, len, "ARGVOUT")) { |
| 1967 | GvMULTI_on(gv); |
| 1968 | } |
| 1969 | break; |
| 1970 | case 'E': |
| 1971 | if ( |
| 1972 | len >= 6 && name[1] == 'X' && |
| 1973 | (memEQs(name, len, "EXPORT") |
| 1974 | ||memEQs(name, len, "EXPORT_OK") |
| 1975 | ||memEQs(name, len, "EXPORT_FAIL") |
| 1976 | ||memEQs(name, len, "EXPORT_TAGS")) |
| 1977 | ) |
| 1978 | GvMULTI_on(gv); |
| 1979 | break; |
| 1980 | case 'I': |
| 1981 | if (memEQs(name, len, "ISA")) { |
| 1982 | gv_magicalize_isa(gv); |
| 1983 | } |
| 1984 | break; |
| 1985 | case 'S': |
| 1986 | if (memEQs(name, len, "SIG")) { |
| 1987 | HV *hv; |
| 1988 | I32 i; |
| 1989 | if (!PL_psig_name) { |
| 1990 | Newxz(PL_psig_name, 2 * SIG_SIZE, SV*); |
| 1991 | Newxz(PL_psig_pend, SIG_SIZE, int); |
| 1992 | PL_psig_ptr = PL_psig_name + SIG_SIZE; |
| 1993 | } else { |
| 1994 | /* I think that the only way to get here is to re-use an |
| 1995 | embedded perl interpreter, where the previous |
| 1996 | use didn't clean up fully because |
| 1997 | PL_perl_destruct_level was 0. I'm not sure that we |
| 1998 | "support" that, in that I suspect in that scenario |
| 1999 | there are sufficient other garbage values left in the |
| 2000 | interpreter structure that something else will crash |
| 2001 | before we get here. I suspect that this is one of |
| 2002 | those "doctor, it hurts when I do this" bugs. */ |
| 2003 | Zero(PL_psig_name, 2 * SIG_SIZE, SV*); |
| 2004 | Zero(PL_psig_pend, SIG_SIZE, int); |
| 2005 | } |
| 2006 | GvMULTI_on(gv); |
| 2007 | hv = GvHVn(gv); |
| 2008 | hv_magic(hv, NULL, PERL_MAGIC_sig); |
| 2009 | for (i = 1; i < SIG_SIZE; i++) { |
| 2010 | SV * const * const init = hv_fetch(hv, PL_sig_name[i], strlen(PL_sig_name[i]), 1); |
| 2011 | if (init) |
| 2012 | sv_setsv(*init, &PL_sv_undef); |
| 2013 | } |
| 2014 | } |
| 2015 | break; |
| 2016 | case 'V': |
| 2017 | if (memEQs(name, len, "VERSION")) |
| 2018 | GvMULTI_on(gv); |
| 2019 | break; |
| 2020 | case '\003': /* $^CHILD_ERROR_NATIVE */ |
| 2021 | if (memEQs(name, len, "\003HILD_ERROR_NATIVE")) |
| 2022 | goto magicalize; |
| 2023 | /* @{^CAPTURE} %{^CAPTURE} */ |
| 2024 | if (memEQs(name, len, "\003APTURE")) { |
| 2025 | AV* const av = GvAVn(gv); |
| 2026 | const Size_t n = *name; |
| 2027 | |
| 2028 | sv_magic(MUTABLE_SV(av), (SV*)n, PERL_MAGIC_regdata, NULL, 0); |
| 2029 | SvREADONLY_on(av); |
| 2030 | |
| 2031 | if (sv_type == SVt_PVHV || sv_type == SVt_PVGV) |
| 2032 | require_tie_mod_s(gv, '-', "Tie::Hash::NamedCapture",0); |
| 2033 | |
| 2034 | } else /* %{^CAPTURE_ALL} */ |
| 2035 | if (memEQs(name, len, "\003APTURE_ALL")) { |
| 2036 | if (sv_type == SVt_PVHV || sv_type == SVt_PVGV) |
| 2037 | require_tie_mod_s(gv, '+', "Tie::Hash::NamedCapture",0); |
| 2038 | } |
| 2039 | break; |
| 2040 | case '\005': /* $^ENCODING */ |
| 2041 | if (memEQs(name, len, "\005NCODING")) |
| 2042 | goto magicalize; |
| 2043 | break; |
| 2044 | case '\007': /* $^GLOBAL_PHASE */ |
| 2045 | if (memEQs(name, len, "\007LOBAL_PHASE")) |
| 2046 | goto ro_magicalize; |
| 2047 | break; |
| 2048 | case '\014': /* $^LAST_FH */ |
| 2049 | if (memEQs(name, len, "\014AST_FH")) |
| 2050 | goto ro_magicalize; |
| 2051 | break; |
| 2052 | case '\015': /* $^MATCH */ |
| 2053 | if (memEQs(name, len, "\015ATCH")) { |
| 2054 | paren = RX_BUFF_IDX_CARET_FULLMATCH; |
| 2055 | goto storeparen; |
| 2056 | } |
| 2057 | break; |
| 2058 | case '\017': /* $^OPEN */ |
| 2059 | if (memEQs(name, len, "\017PEN")) |
| 2060 | goto magicalize; |
| 2061 | break; |
| 2062 | case '\020': /* $^PREMATCH $^POSTMATCH */ |
| 2063 | if (memEQs(name, len, "\020REMATCH")) { |
| 2064 | paren = RX_BUFF_IDX_CARET_PREMATCH; |
| 2065 | goto storeparen; |
| 2066 | } |
| 2067 | if (memEQs(name, len, "\020OSTMATCH")) { |
| 2068 | paren = RX_BUFF_IDX_CARET_POSTMATCH; |
| 2069 | goto storeparen; |
| 2070 | } |
| 2071 | break; |
| 2072 | case '\023': |
| 2073 | if (memEQs(name, len, "\023AFE_LOCALES")) |
| 2074 | goto ro_magicalize; |
| 2075 | break; |
| 2076 | case '\024': /* ${^TAINT} */ |
| 2077 | if (memEQs(name, len, "\024AINT")) |
| 2078 | goto ro_magicalize; |
| 2079 | break; |
| 2080 | case '\025': /* ${^UNICODE}, ${^UTF8LOCALE} */ |
| 2081 | if (memEQs(name, len, "\025NICODE")) |
| 2082 | goto ro_magicalize; |
| 2083 | if (memEQs(name, len, "\025TF8LOCALE")) |
| 2084 | goto ro_magicalize; |
| 2085 | if (memEQs(name, len, "\025TF8CACHE")) |
| 2086 | goto magicalize; |
| 2087 | break; |
| 2088 | case '\027': /* $^WARNING_BITS */ |
| 2089 | if (memEQs(name, len, "\027ARNING_BITS")) |
| 2090 | goto magicalize; |
| 2091 | #ifdef WIN32 |
| 2092 | else if (memEQs(name, len, "\027IN32_SLOPPY_STAT")) |
| 2093 | goto magicalize; |
| 2094 | #endif |
| 2095 | break; |
| 2096 | case '1': |
| 2097 | case '2': |
| 2098 | case '3': |
| 2099 | case '4': |
| 2100 | case '5': |
| 2101 | case '6': |
| 2102 | case '7': |
| 2103 | case '8': |
| 2104 | case '9': |
| 2105 | { |
| 2106 | /* Ensures that we have an all-digit variable, ${"1foo"} fails |
| 2107 | this test */ |
| 2108 | UV uv; |
| 2109 | if (!grok_atoUV(name, &uv, NULL) || uv > I32_MAX) |
| 2110 | goto ret; |
| 2111 | /* XXX why are we using a SSize_t? */ |
| 2112 | paren = (SSize_t)(I32)uv; |
| 2113 | goto storeparen; |
| 2114 | } |
| 2115 | } |
| 2116 | } |
| 2117 | } else { |
| 2118 | /* Names of length 1. (Or 0. But name is NUL terminated, so that will |
| 2119 | be case '\0' in this switch statement (ie a default case) */ |
| 2120 | switch (*name) { |
| 2121 | case '&': /* $& */ |
| 2122 | paren = RX_BUFF_IDX_FULLMATCH; |
| 2123 | goto sawampersand; |
| 2124 | case '`': /* $` */ |
| 2125 | paren = RX_BUFF_IDX_PREMATCH; |
| 2126 | goto sawampersand; |
| 2127 | case '\'': /* $' */ |
| 2128 | paren = RX_BUFF_IDX_POSTMATCH; |
| 2129 | sawampersand: |
| 2130 | #ifdef PERL_SAWAMPERSAND |
| 2131 | if (!( |
| 2132 | sv_type == SVt_PVAV || |
| 2133 | sv_type == SVt_PVHV || |
| 2134 | sv_type == SVt_PVCV || |
| 2135 | sv_type == SVt_PVFM || |
| 2136 | sv_type == SVt_PVIO |
| 2137 | )) { PL_sawampersand |= |
| 2138 | (*name == '`') |
| 2139 | ? SAWAMPERSAND_LEFT |
| 2140 | : (*name == '&') |
| 2141 | ? SAWAMPERSAND_MIDDLE |
| 2142 | : SAWAMPERSAND_RIGHT; |
| 2143 | } |
| 2144 | #endif |
| 2145 | goto storeparen; |
| 2146 | case '1': /* $1 */ |
| 2147 | case '2': /* $2 */ |
| 2148 | case '3': /* $3 */ |
| 2149 | case '4': /* $4 */ |
| 2150 | case '5': /* $5 */ |
| 2151 | case '6': /* $6 */ |
| 2152 | case '7': /* $7 */ |
| 2153 | case '8': /* $8 */ |
| 2154 | case '9': /* $9 */ |
| 2155 | paren = *name - '0'; |
| 2156 | |
| 2157 | storeparen: |
| 2158 | /* Flag the capture variables with a NULL mg_ptr |
| 2159 | Use mg_len for the array index to lookup. */ |
| 2160 | sv_magic(GvSVn(gv), MUTABLE_SV(gv), PERL_MAGIC_sv, NULL, paren); |
| 2161 | break; |
| 2162 | |
| 2163 | case ':': /* $: */ |
| 2164 | sv_setpv(GvSVn(gv),PL_chopset); |
| 2165 | goto magicalize; |
| 2166 | |
| 2167 | case '?': /* $? */ |
| 2168 | #ifdef COMPLEX_STATUS |
| 2169 | SvUPGRADE(GvSVn(gv), SVt_PVLV); |
| 2170 | #endif |
| 2171 | goto magicalize; |
| 2172 | |
| 2173 | case '!': /* $! */ |
| 2174 | GvMULTI_on(gv); |
| 2175 | /* If %! has been used, automatically load Errno.pm. */ |
| 2176 | |
| 2177 | sv_magic(GvSVn(gv), MUTABLE_SV(gv), PERL_MAGIC_sv, name, len); |
| 2178 | |
| 2179 | /* magicalization must be done before require_tie_mod_s is called */ |
| 2180 | if (sv_type == SVt_PVHV || sv_type == SVt_PVGV) |
| 2181 | require_tie_mod_s(gv, '!', "Errno", 1); |
| 2182 | |
| 2183 | break; |
| 2184 | case '-': /* $-, %-, @- */ |
| 2185 | case '+': /* $+, %+, @+ */ |
| 2186 | GvMULTI_on(gv); /* no used once warnings here */ |
| 2187 | { /* $- $+ */ |
| 2188 | sv_magic(GvSVn(gv), MUTABLE_SV(gv), PERL_MAGIC_sv, name, len); |
| 2189 | if (*name == '+') |
| 2190 | SvREADONLY_on(GvSVn(gv)); |
| 2191 | } |
| 2192 | { /* %- %+ */ |
| 2193 | if (sv_type == SVt_PVHV || sv_type == SVt_PVGV) |
| 2194 | require_tie_mod_s(gv, *name, "Tie::Hash::NamedCapture",0); |
| 2195 | } |
| 2196 | { /* @- @+ */ |
| 2197 | AV* const av = GvAVn(gv); |
| 2198 | const Size_t n = *name; |
| 2199 | |
| 2200 | sv_magic(MUTABLE_SV(av), (SV*)n, PERL_MAGIC_regdata, NULL, 0); |
| 2201 | SvREADONLY_on(av); |
| 2202 | } |
| 2203 | break; |
| 2204 | case '*': /* $* */ |
| 2205 | case '#': /* $# */ |
| 2206 | if (sv_type == SVt_PV) |
| 2207 | /* diag_listed_as: $* is no longer supported as of Perl 5.30 */ |
| 2208 | Perl_croak(aTHX_ "$%c is no longer supported as of Perl 5.30", *name); |
| 2209 | break; |
| 2210 | case '\010': /* $^H */ |
| 2211 | { |
| 2212 | HV *const hv = GvHVn(gv); |
| 2213 | hv_magic(hv, NULL, PERL_MAGIC_hints); |
| 2214 | } |
| 2215 | goto magicalize; |
| 2216 | case '\023': /* $^S */ |
| 2217 | ro_magicalize: |
| 2218 | SvREADONLY_on(GvSVn(gv)); |
| 2219 | /* FALLTHROUGH */ |
| 2220 | case '0': /* $0 */ |
| 2221 | case '^': /* $^ */ |
| 2222 | case '~': /* $~ */ |
| 2223 | case '=': /* $= */ |
| 2224 | case '%': /* $% */ |
| 2225 | case '.': /* $. */ |
| 2226 | case '(': /* $( */ |
| 2227 | case ')': /* $) */ |
| 2228 | case '<': /* $< */ |
| 2229 | case '>': /* $> */ |
| 2230 | case '\\': /* $\ */ |
| 2231 | case '/': /* $/ */ |
| 2232 | case '|': /* $| */ |
| 2233 | case '$': /* $$ */ |
| 2234 | case '[': /* $[ */ |
| 2235 | case '\001': /* $^A */ |
| 2236 | case '\003': /* $^C */ |
| 2237 | case '\004': /* $^D */ |
| 2238 | case '\005': /* $^E */ |
| 2239 | case '\006': /* $^F */ |
| 2240 | case '\011': /* $^I, NOT \t in EBCDIC */ |
| 2241 | case '\016': /* $^N */ |
| 2242 | case '\017': /* $^O */ |
| 2243 | case '\020': /* $^P */ |
| 2244 | case '\024': /* $^T */ |
| 2245 | case '\027': /* $^W */ |
| 2246 | magicalize: |
| 2247 | sv_magic(GvSVn(gv), MUTABLE_SV(gv), PERL_MAGIC_sv, name, len); |
| 2248 | break; |
| 2249 | |
| 2250 | case '\014': /* $^L */ |
| 2251 | sv_setpvs(GvSVn(gv),"\f"); |
| 2252 | break; |
| 2253 | case ';': /* $; */ |
| 2254 | sv_setpvs(GvSVn(gv),"\034"); |
| 2255 | break; |
| 2256 | case ']': /* $] */ |
| 2257 | { |
| 2258 | SV * const sv = GvSV(gv); |
| 2259 | if (!sv_derived_from(PL_patchlevel, "version")) |
| 2260 | upg_version(PL_patchlevel, TRUE); |
| 2261 | GvSV(gv) = vnumify(PL_patchlevel); |
| 2262 | SvREADONLY_on(GvSV(gv)); |
| 2263 | SvREFCNT_dec(sv); |
| 2264 | } |
| 2265 | break; |
| 2266 | case '\026': /* $^V */ |
| 2267 | { |
| 2268 | SV * const sv = GvSV(gv); |
| 2269 | GvSV(gv) = new_version(PL_patchlevel); |
| 2270 | SvREADONLY_on(GvSV(gv)); |
| 2271 | SvREFCNT_dec(sv); |
| 2272 | } |
| 2273 | break; |
| 2274 | case 'a': |
| 2275 | case 'b': |
| 2276 | if (sv_type == SVt_PV) |
| 2277 | GvMULTI_on(gv); |
| 2278 | } |
| 2279 | } |
| 2280 | |
| 2281 | ret: |
| 2282 | /* Return true if we actually did something. */ |
| 2283 | return GvAV(gv) || GvHV(gv) || GvIO(gv) || GvCV(gv) |
| 2284 | || ( GvSV(gv) && ( |
| 2285 | SvOK(GvSV(gv)) || SvMAGICAL(GvSV(gv)) |
| 2286 | ) |
| 2287 | ); |
| 2288 | } |
| 2289 | |
| 2290 | /* If we do ever start using this later on in the file, we need to make |
| 2291 | sure we don’t accidentally use the wrong definition. */ |
| 2292 | #undef SvREADONLY_on |
| 2293 | |
| 2294 | /* This function is called when the stash already holds the GV of the magic |
| 2295 | * variable we're looking for, but we need to check that it has the correct |
| 2296 | * kind of magic. For example, if someone first uses $! and then %!, the |
| 2297 | * latter would end up here, and we add the Errno tie to the HASH slot of |
| 2298 | * the *! glob. |
| 2299 | */ |
| 2300 | PERL_STATIC_INLINE void |
| 2301 | S_maybe_multimagic_gv(pTHX_ GV *gv, const char *name, const svtype sv_type) |
| 2302 | { |
| 2303 | PERL_ARGS_ASSERT_MAYBE_MULTIMAGIC_GV; |
| 2304 | |
| 2305 | if (sv_type == SVt_PVHV || sv_type == SVt_PVGV) { |
| 2306 | if (*name == '!') |
| 2307 | require_tie_mod_s(gv, '!', "Errno", 1); |
| 2308 | else if (*name == '-' || *name == '+') |
| 2309 | require_tie_mod_s(gv, *name, "Tie::Hash::NamedCapture", 0); |
| 2310 | } else if (sv_type == SVt_PV) { |
| 2311 | if (*name == '*' || *name == '#') { |
| 2312 | /* diag_listed_as: $* is no longer supported as of Perl 5.30 */ |
| 2313 | Perl_croak(aTHX_ "$%c is no longer supported as of Perl 5.30", *name); |
| 2314 | } |
| 2315 | } |
| 2316 | if (sv_type==SVt_PV || sv_type==SVt_PVGV) { |
| 2317 | switch (*name) { |
| 2318 | #ifdef PERL_SAWAMPERSAND |
| 2319 | case '`': |
| 2320 | PL_sawampersand |= SAWAMPERSAND_LEFT; |
| 2321 | (void)GvSVn(gv); |
| 2322 | break; |
| 2323 | case '&': |
| 2324 | PL_sawampersand |= SAWAMPERSAND_MIDDLE; |
| 2325 | (void)GvSVn(gv); |
| 2326 | break; |
| 2327 | case '\'': |
| 2328 | PL_sawampersand |= SAWAMPERSAND_RIGHT; |
| 2329 | (void)GvSVn(gv); |
| 2330 | break; |
| 2331 | #endif |
| 2332 | } |
| 2333 | } |
| 2334 | } |
| 2335 | |
| 2336 | GV * |
| 2337 | Perl_gv_fetchpvn_flags(pTHX_ const char *nambeg, STRLEN full_len, I32 flags, |
| 2338 | const svtype sv_type) |
| 2339 | { |
| 2340 | const char *name = nambeg; |
| 2341 | GV *gv = NULL; |
| 2342 | GV**gvp; |
| 2343 | STRLEN len; |
| 2344 | HV *stash = NULL; |
| 2345 | const I32 no_init = flags & (GV_NOADD_NOINIT | GV_NOINIT); |
| 2346 | const I32 no_expand = flags & GV_NOEXPAND; |
| 2347 | const I32 add = flags & ~GV_NOADD_MASK; |
| 2348 | const U32 is_utf8 = flags & SVf_UTF8; |
| 2349 | bool addmg = cBOOL(flags & GV_ADDMG); |
| 2350 | const char *const name_end = nambeg + full_len; |
| 2351 | U32 faking_it; |
| 2352 | |
| 2353 | PERL_ARGS_ASSERT_GV_FETCHPVN_FLAGS; |
| 2354 | |
| 2355 | /* If we have GV_NOTQUAL, the caller promised that |
| 2356 | * there is no stash, so we can skip the check. |
| 2357 | * Similarly if full_len is 0, since then we're |
| 2358 | * dealing with something like *{""} or ""->foo() |
| 2359 | */ |
| 2360 | if ((flags & GV_NOTQUAL) || !full_len) { |
| 2361 | len = full_len; |
| 2362 | } |
| 2363 | else if (parse_gv_stash_name(&stash, &gv, &name, &len, nambeg, full_len, is_utf8, add)) { |
| 2364 | if (name == name_end) return gv; |
| 2365 | } |
| 2366 | else { |
| 2367 | return NULL; |
| 2368 | } |
| 2369 | |
| 2370 | if (!stash && !find_default_stash(&stash, name, len, is_utf8, add, sv_type)) { |
| 2371 | return NULL; |
| 2372 | } |
| 2373 | |
| 2374 | /* By this point we should have a stash and a name */ |
| 2375 | gvp = (GV**)hv_fetch(stash,name,is_utf8 ? -(I32)len : (I32)len,add); |
| 2376 | if (!gvp || *gvp == (const GV *)&PL_sv_undef) { |
| 2377 | if (addmg) gv = (GV *)newSV(0); |
| 2378 | else return NULL; |
| 2379 | } |
| 2380 | else gv = *gvp, addmg = 0; |
| 2381 | /* From this point on, addmg means gv has not been inserted in the |
| 2382 | symtab yet. */ |
| 2383 | |
| 2384 | if (SvTYPE(gv) == SVt_PVGV) { |
| 2385 | /* The GV already exists, so return it, but check if we need to do |
| 2386 | * anything else with it before that. |
| 2387 | */ |
| 2388 | if (add) { |
| 2389 | /* This is the heuristic that handles if a variable triggers the |
| 2390 | * 'used only once' warning. If there's already a GV in the stash |
| 2391 | * with this name, then we assume that the variable has been used |
| 2392 | * before and turn its MULTI flag on. |
| 2393 | * It's a heuristic because it can easily be "tricked", like with |
| 2394 | * BEGIN { $a = 1; $::{foo} = *a }; () = $foo |
| 2395 | * not warning about $main::foo being used just once |
| 2396 | */ |
| 2397 | GvMULTI_on(gv); |
| 2398 | gv_init_svtype(gv, sv_type); |
| 2399 | /* You reach this path once the typeglob has already been created, |
| 2400 | either by the same or a different sigil. If this path didn't |
| 2401 | exist, then (say) referencing $! first, and %! second would |
| 2402 | mean that %! was not handled correctly. */ |
| 2403 | if (len == 1 && stash == PL_defstash) { |
| 2404 | maybe_multimagic_gv(gv, name, sv_type); |
| 2405 | } |
| 2406 | else if (sv_type == SVt_PVAV |
| 2407 | && memEQs(name, len, "ISA") |
| 2408 | && (!GvAV(gv) || !SvSMAGICAL(GvAV(gv)))) |
| 2409 | gv_magicalize_isa(gv); |
| 2410 | } |
| 2411 | return gv; |
| 2412 | } else if (no_init) { |
| 2413 | assert(!addmg); |
| 2414 | return gv; |
| 2415 | } |
| 2416 | /* If GV_NOEXPAND is true and what we got off the stash is a ref, |
| 2417 | * don't expand it to a glob. This is an optimization so that things |
| 2418 | * copying constants over, like Exporter, don't have to be rewritten |
| 2419 | * to take into account that you can store more than just globs in |
| 2420 | * stashes. |
| 2421 | */ |
| 2422 | else if (no_expand && SvROK(gv)) { |
| 2423 | assert(!addmg); |
| 2424 | return gv; |
| 2425 | } |
| 2426 | |
| 2427 | /* Adding a new symbol. |
| 2428 | Unless of course there was already something non-GV here, in which case |
| 2429 | we want to behave as if there was always a GV here, containing some sort |
| 2430 | of subroutine. |
| 2431 | Otherwise we run the risk of creating things like GvIO, which can cause |
| 2432 | subtle bugs. eg the one that tripped up SQL::Translator */ |
| 2433 | |
| 2434 | faking_it = SvOK(gv); |
| 2435 | |
| 2436 | if (add & GV_ADDWARN) |
| 2437 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), |
| 2438 | "Had to create %" UTF8f " unexpectedly", |
| 2439 | UTF8fARG(is_utf8, name_end-nambeg, nambeg)); |
| 2440 | gv_init_pvn(gv, stash, name, len, (add & GV_ADDMULTI)|is_utf8); |
| 2441 | |
| 2442 | if ( full_len != 0 |
| 2443 | && isIDFIRST_lazy_if_safe(name, name + full_len, is_utf8) |
| 2444 | && !ckWARN(WARN_ONCE) ) |
| 2445 | { |
| 2446 | GvMULTI_on(gv) ; |
| 2447 | } |
| 2448 | |
| 2449 | /* set up magic where warranted */ |
| 2450 | if ( gv_magicalize(gv, stash, name, len, sv_type) ) { |
| 2451 | /* See 23496c6 */ |
| 2452 | if (addmg) { |
| 2453 | /* gv_magicalize magicalised this gv, so we want it |
| 2454 | * stored in the symtab. |
| 2455 | * Effectively the caller is asking, ‘Does this gv exist?’ |
| 2456 | * And we respond, ‘Er, *now* it does!’ |
| 2457 | */ |
| 2458 | (void)hv_store(stash,name,len,(SV *)gv,0); |
| 2459 | } |
| 2460 | } |
| 2461 | else if (addmg) { |
| 2462 | /* The temporary GV created above */ |
| 2463 | SvREFCNT_dec_NN(gv); |
| 2464 | gv = NULL; |
| 2465 | } |
| 2466 | |
| 2467 | if (gv) gv_init_svtype(gv, faking_it ? SVt_PVCV : sv_type); |
| 2468 | return gv; |
| 2469 | } |
| 2470 | |
| 2471 | void |
| 2472 | Perl_gv_fullname4(pTHX_ SV *sv, const GV *gv, const char *prefix, bool keepmain) |
| 2473 | { |
| 2474 | const char *name; |
| 2475 | const HV * const hv = GvSTASH(gv); |
| 2476 | |
| 2477 | PERL_ARGS_ASSERT_GV_FULLNAME4; |
| 2478 | |
| 2479 | sv_setpv(sv, prefix ? prefix : ""); |
| 2480 | |
| 2481 | if (hv && (name = HvNAME(hv))) { |
| 2482 | const STRLEN len = HvNAMELEN(hv); |
| 2483 | if (keepmain || ! memBEGINs(name, len, "main")) { |
| 2484 | sv_catpvn_flags(sv,name,len,HvNAMEUTF8(hv)?SV_CATUTF8:SV_CATBYTES); |
| 2485 | sv_catpvs(sv,"::"); |
| 2486 | } |
| 2487 | } |
| 2488 | else sv_catpvs(sv,"__ANON__::"); |
| 2489 | sv_catsv(sv,sv_2mortal(newSVhek(GvNAME_HEK(gv)))); |
| 2490 | } |
| 2491 | |
| 2492 | void |
| 2493 | Perl_gv_efullname4(pTHX_ SV *sv, const GV *gv, const char *prefix, bool keepmain) |
| 2494 | { |
| 2495 | const GV * const egv = GvEGVx(gv); |
| 2496 | |
| 2497 | PERL_ARGS_ASSERT_GV_EFULLNAME4; |
| 2498 | |
| 2499 | gv_fullname4(sv, egv ? egv : gv, prefix, keepmain); |
| 2500 | } |
| 2501 | |
| 2502 | |
| 2503 | /* recursively scan a stash and any nested stashes looking for entries |
| 2504 | * that need the "only used once" warning raised |
| 2505 | */ |
| 2506 | |
| 2507 | void |
| 2508 | Perl_gv_check(pTHX_ HV *stash) |
| 2509 | { |
| 2510 | I32 i; |
| 2511 | |
| 2512 | PERL_ARGS_ASSERT_GV_CHECK; |
| 2513 | |
| 2514 | if (!SvOOK(stash)) |
| 2515 | return; |
| 2516 | |
| 2517 | assert(HvARRAY(stash)); |
| 2518 | |
| 2519 | for (i = 0; i <= (I32) HvMAX(stash); i++) { |
| 2520 | const HE *entry; |
| 2521 | /* mark stash is being scanned, to avoid recursing */ |
| 2522 | HvAUX(stash)->xhv_aux_flags |= HvAUXf_SCAN_STASH; |
| 2523 | for (entry = HvARRAY(stash)[i]; entry; entry = HeNEXT(entry)) { |
| 2524 | GV *gv; |
| 2525 | HV *hv; |
| 2526 | STRLEN keylen = HeKLEN(entry); |
| 2527 | const char * const key = HeKEY(entry); |
| 2528 | |
| 2529 | if (keylen >= 2 && key[keylen-2] == ':' && key[keylen-1] == ':' && |
| 2530 | (gv = MUTABLE_GV(HeVAL(entry))) && isGV(gv) && (hv = GvHV(gv))) |
| 2531 | { |
| 2532 | if (hv != PL_defstash && hv != stash |
| 2533 | && !(SvOOK(hv) |
| 2534 | && (HvAUX(hv)->xhv_aux_flags & HvAUXf_SCAN_STASH)) |
| 2535 | ) |
| 2536 | gv_check(hv); /* nested package */ |
| 2537 | } |
| 2538 | else if ( HeKLEN(entry) != 0 |
| 2539 | && *HeKEY(entry) != '_' |
| 2540 | && isIDFIRST_lazy_if_safe(HeKEY(entry), |
| 2541 | HeKEY(entry) + HeKLEN(entry), |
| 2542 | HeUTF8(entry)) ) |
| 2543 | { |
| 2544 | const char *file; |
| 2545 | gv = MUTABLE_GV(HeVAL(entry)); |
| 2546 | if (SvTYPE(gv) != SVt_PVGV || GvMULTI(gv)) |
| 2547 | continue; |
| 2548 | file = GvFILE(gv); |
| 2549 | CopLINE_set(PL_curcop, GvLINE(gv)); |
| 2550 | #ifdef USE_ITHREADS |
| 2551 | CopFILE(PL_curcop) = (char *)file; /* set for warning */ |
| 2552 | #else |
| 2553 | CopFILEGV(PL_curcop) |
| 2554 | = gv_fetchfile_flags(file, HEK_LEN(GvFILE_HEK(gv)), 0); |
| 2555 | #endif |
| 2556 | Perl_warner(aTHX_ packWARN(WARN_ONCE), |
| 2557 | "Name \"%" HEKf "::%" HEKf |
| 2558 | "\" used only once: possible typo", |
| 2559 | HEKfARG(HvNAME_HEK(stash)), |
| 2560 | HEKfARG(GvNAME_HEK(gv))); |
| 2561 | } |
| 2562 | } |
| 2563 | HvAUX(stash)->xhv_aux_flags &= ~HvAUXf_SCAN_STASH; |
| 2564 | } |
| 2565 | } |
| 2566 | |
| 2567 | GV * |
| 2568 | Perl_newGVgen_flags(pTHX_ const char *pack, U32 flags) |
| 2569 | { |
| 2570 | PERL_ARGS_ASSERT_NEWGVGEN_FLAGS; |
| 2571 | assert(!(flags & ~SVf_UTF8)); |
| 2572 | |
| 2573 | return gv_fetchpv(Perl_form(aTHX_ "%" UTF8f "::_GEN_%ld", |
| 2574 | UTF8fARG(flags, strlen(pack), pack), |
| 2575 | (long)PL_gensym++), |
| 2576 | GV_ADD, SVt_PVGV); |
| 2577 | } |
| 2578 | |
| 2579 | /* hopefully this is only called on local symbol table entries */ |
| 2580 | |
| 2581 | GP* |
| 2582 | Perl_gp_ref(pTHX_ GP *gp) |
| 2583 | { |
| 2584 | if (!gp) |
| 2585 | return NULL; |
| 2586 | gp->gp_refcnt++; |
| 2587 | if (gp->gp_cv) { |
| 2588 | if (gp->gp_cvgen) { |
| 2589 | /* If the GP they asked for a reference to contains |
| 2590 | a method cache entry, clear it first, so that we |
| 2591 | don't infect them with our cached entry */ |
| 2592 | SvREFCNT_dec_NN(gp->gp_cv); |
| 2593 | gp->gp_cv = NULL; |
| 2594 | gp->gp_cvgen = 0; |
| 2595 | } |
| 2596 | } |
| 2597 | return gp; |
| 2598 | } |
| 2599 | |
| 2600 | void |
| 2601 | Perl_gp_free(pTHX_ GV *gv) |
| 2602 | { |
| 2603 | GP* gp; |
| 2604 | int attempts = 100; |
| 2605 | |
| 2606 | if (!gv || !isGV_with_GP(gv) || !(gp = GvGP(gv))) |
| 2607 | return; |
| 2608 | if (gp->gp_refcnt == 0) { |
| 2609 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), |
| 2610 | "Attempt to free unreferenced glob pointers" |
| 2611 | pTHX__FORMAT pTHX__VALUE); |
| 2612 | return; |
| 2613 | } |
| 2614 | if (gp->gp_refcnt > 1) { |
| 2615 | borrowed: |
| 2616 | if (gp->gp_egv == gv) |
| 2617 | gp->gp_egv = 0; |
| 2618 | gp->gp_refcnt--; |
| 2619 | GvGP_set(gv, NULL); |
| 2620 | return; |
| 2621 | } |
| 2622 | |
| 2623 | while (1) { |
| 2624 | /* Copy and null out all the glob slots, so destructors do not see |
| 2625 | freed SVs. */ |
| 2626 | HEK * const file_hek = gp->gp_file_hek; |
| 2627 | SV * const sv = gp->gp_sv; |
| 2628 | AV * const av = gp->gp_av; |
| 2629 | HV * const hv = gp->gp_hv; |
| 2630 | IO * const io = gp->gp_io; |
| 2631 | CV * const cv = gp->gp_cv; |
| 2632 | CV * const form = gp->gp_form; |
| 2633 | |
| 2634 | gp->gp_file_hek = NULL; |
| 2635 | gp->gp_sv = NULL; |
| 2636 | gp->gp_av = NULL; |
| 2637 | gp->gp_hv = NULL; |
| 2638 | gp->gp_io = NULL; |
| 2639 | gp->gp_cv = NULL; |
| 2640 | gp->gp_form = NULL; |
| 2641 | |
| 2642 | if (file_hek) |
| 2643 | unshare_hek(file_hek); |
| 2644 | |
| 2645 | SvREFCNT_dec(sv); |
| 2646 | SvREFCNT_dec(av); |
| 2647 | /* FIXME - another reference loop GV -> symtab -> GV ? |
| 2648 | Somehow gp->gp_hv can end up pointing at freed garbage. */ |
| 2649 | if (hv && SvTYPE(hv) == SVt_PVHV) { |
| 2650 | const HEK *hvname_hek = HvNAME_HEK(hv); |
| 2651 | if (PL_stashcache && hvname_hek) { |
| 2652 | DEBUG_o(Perl_deb(aTHX_ |
| 2653 | "gp_free clearing PL_stashcache for '%" HEKf "'\n", |
| 2654 | HEKfARG(hvname_hek))); |
| 2655 | (void)hv_deletehek(PL_stashcache, hvname_hek, G_DISCARD); |
| 2656 | } |
| 2657 | SvREFCNT_dec(hv); |
| 2658 | } |
| 2659 | if (io && SvREFCNT(io) == 1 && IoIFP(io) |
| 2660 | && (IoTYPE(io) == IoTYPE_WRONLY || |
| 2661 | IoTYPE(io) == IoTYPE_RDWR || |
| 2662 | IoTYPE(io) == IoTYPE_APPEND) |
| 2663 | && ckWARN_d(WARN_IO) |
| 2664 | && IoIFP(io) != PerlIO_stdin() |
| 2665 | && IoIFP(io) != PerlIO_stdout() |
| 2666 | && IoIFP(io) != PerlIO_stderr() |
| 2667 | && !(IoFLAGS(io) & IOf_FAKE_DIRP)) |
| 2668 | io_close(io, gv, FALSE, TRUE); |
| 2669 | SvREFCNT_dec(io); |
| 2670 | SvREFCNT_dec(cv); |
| 2671 | SvREFCNT_dec(form); |
| 2672 | |
| 2673 | /* Possibly reallocated by a destructor */ |
| 2674 | gp = GvGP(gv); |
| 2675 | |
| 2676 | if (!gp->gp_file_hek |
| 2677 | && !gp->gp_sv |
| 2678 | && !gp->gp_av |
| 2679 | && !gp->gp_hv |
| 2680 | && !gp->gp_io |
| 2681 | && !gp->gp_cv |
| 2682 | && !gp->gp_form) break; |
| 2683 | |
| 2684 | if (--attempts == 0) { |
| 2685 | Perl_die(aTHX_ |
| 2686 | "panic: gp_free failed to free glob pointer - " |
| 2687 | "something is repeatedly re-creating entries" |
| 2688 | ); |
| 2689 | } |
| 2690 | } |
| 2691 | |
| 2692 | /* Possibly incremented by a destructor doing glob assignment */ |
| 2693 | if (gp->gp_refcnt > 1) goto borrowed; |
| 2694 | Safefree(gp); |
| 2695 | GvGP_set(gv, NULL); |
| 2696 | } |
| 2697 | |
| 2698 | int |
| 2699 | Perl_magic_freeovrld(pTHX_ SV *sv, MAGIC *mg) |
| 2700 | { |
| 2701 | AMT * const amtp = (AMT*)mg->mg_ptr; |
| 2702 | PERL_UNUSED_ARG(sv); |
| 2703 | |
| 2704 | PERL_ARGS_ASSERT_MAGIC_FREEOVRLD; |
| 2705 | |
| 2706 | if (amtp && AMT_AMAGIC(amtp)) { |
| 2707 | int i; |
| 2708 | for (i = 1; i < NofAMmeth; i++) { |
| 2709 | CV * const cv = amtp->table[i]; |
| 2710 | if (cv) { |
| 2711 | SvREFCNT_dec_NN(MUTABLE_SV(cv)); |
| 2712 | amtp->table[i] = NULL; |
| 2713 | } |
| 2714 | } |
| 2715 | } |
| 2716 | return 0; |
| 2717 | } |
| 2718 | |
| 2719 | /* Updates and caches the CV's */ |
| 2720 | /* Returns: |
| 2721 | * 1 on success and there is some overload |
| 2722 | * 0 if there is no overload |
| 2723 | * -1 if some error occurred and it couldn't croak |
| 2724 | */ |
| 2725 | |
| 2726 | int |
| 2727 | Perl_Gv_AMupdate(pTHX_ HV *stash, bool destructing) |
| 2728 | { |
| 2729 | MAGIC* const mg = mg_find((const SV *)stash, PERL_MAGIC_overload_table); |
| 2730 | AMT amt; |
| 2731 | const struct mro_meta* stash_meta = HvMROMETA(stash); |
| 2732 | U32 newgen; |
| 2733 | |
| 2734 | PERL_ARGS_ASSERT_GV_AMUPDATE; |
| 2735 | |
| 2736 | newgen = PL_sub_generation + stash_meta->pkg_gen + stash_meta->cache_gen; |
| 2737 | if (mg) { |
| 2738 | const AMT * const amtp = (AMT*)mg->mg_ptr; |
| 2739 | if (amtp->was_ok_sub == newgen) { |
| 2740 | return AMT_AMAGIC(amtp) ? 1 : 0; |
| 2741 | } |
| 2742 | sv_unmagic(MUTABLE_SV(stash), PERL_MAGIC_overload_table); |
| 2743 | } |
| 2744 | |
| 2745 | DEBUG_o( Perl_deb(aTHX_ "Recalcing overload magic in package %s\n",HvNAME_get(stash)) ); |
| 2746 | |
| 2747 | Zero(&amt,1,AMT); |
| 2748 | amt.was_ok_sub = newgen; |
| 2749 | amt.fallback = AMGfallNO; |
| 2750 | amt.flags = 0; |
| 2751 | |
| 2752 | { |
| 2753 | int filled = 0; |
| 2754 | int i; |
| 2755 | bool deref_seen = 0; |
| 2756 | |
| 2757 | |
| 2758 | /* Work with "fallback" key, which we assume to be first in PL_AMG_names */ |
| 2759 | |
| 2760 | /* Try to find via inheritance. */ |
| 2761 | GV *gv = gv_fetchmeth_pvn(stash, PL_AMG_names[0], 2, -1, 0); |
| 2762 | SV * const sv = gv ? GvSV(gv) : NULL; |
| 2763 | CV* cv; |
| 2764 | |
| 2765 | if (!gv) |
| 2766 | { |
| 2767 | if (!gv_fetchmeth_pvn(stash, "((", 2, -1, 0)) |
| 2768 | goto no_table; |
| 2769 | } |
| 2770 | #ifdef PERL_DONT_CREATE_GVSV |
| 2771 | else if (!sv) { |
| 2772 | NOOP; /* Equivalent to !SvTRUE and !SvOK */ |
| 2773 | } |
| 2774 | #endif |
| 2775 | else if (SvTRUE(sv)) |
| 2776 | /* don't need to set overloading here because fallback => 1 |
| 2777 | * is the default setting for classes without overloading */ |
| 2778 | amt.fallback=AMGfallYES; |
| 2779 | else if (SvOK(sv)) { |
| 2780 | amt.fallback=AMGfallNEVER; |
| 2781 | filled = 1; |
| 2782 | } |
| 2783 | else { |
| 2784 | filled = 1; |
| 2785 | } |
| 2786 | |
| 2787 | assert(SvOOK(stash)); |
| 2788 | /* initially assume the worst */ |
| 2789 | HvAUX(stash)->xhv_aux_flags &= ~HvAUXf_NO_DEREF; |
| 2790 | |
| 2791 | for (i = 1; i < NofAMmeth; i++) { |
| 2792 | const char * const cooky = PL_AMG_names[i]; |
| 2793 | /* Human-readable form, for debugging: */ |
| 2794 | const char * const cp = AMG_id2name(i); |
| 2795 | const STRLEN l = PL_AMG_namelens[i]; |
| 2796 | |
| 2797 | DEBUG_o( Perl_deb(aTHX_ "Checking overloading of \"%s\" in package \"%.256s\"\n", |
| 2798 | cp, HvNAME_get(stash)) ); |
| 2799 | /* don't fill the cache while looking up! |
| 2800 | Creation of inheritance stubs in intermediate packages may |
| 2801 | conflict with the logic of runtime method substitution. |
| 2802 | Indeed, for inheritance A -> B -> C, if C overloads "+0", |
| 2803 | then we could have created stubs for "(+0" in A and C too. |
| 2804 | But if B overloads "bool", we may want to use it for |
| 2805 | numifying instead of C's "+0". */ |
| 2806 | gv = Perl_gv_fetchmeth_pvn(aTHX_ stash, cooky, l, -1, 0); |
| 2807 | cv = 0; |
| 2808 | if (gv && (cv = GvCV(gv)) && CvHASGV(cv)) { |
| 2809 | const HEK * const gvhek = CvGvNAME_HEK(cv); |
| 2810 | const HEK * const stashek = |
| 2811 | HvNAME_HEK(CvNAMED(cv) ? CvSTASH(cv) : GvSTASH(CvGV(cv))); |
| 2812 | if (memEQs(HEK_KEY(gvhek), HEK_LEN(gvhek), "nil") |
| 2813 | && stashek |
| 2814 | && memEQs(HEK_KEY(stashek), HEK_LEN(stashek), "overload")) { |
| 2815 | /* This is a hack to support autoloading..., while |
| 2816 | knowing *which* methods were declared as overloaded. */ |
| 2817 | /* GvSV contains the name of the method. */ |
| 2818 | GV *ngv = NULL; |
| 2819 | SV *gvsv = GvSV(gv); |
| 2820 | |
| 2821 | DEBUG_o( Perl_deb(aTHX_ "Resolving method \"%" SVf256\ |
| 2822 | "\" for overloaded \"%s\" in package \"%.256s\"\n", |
| 2823 | (void*)GvSV(gv), cp, HvNAME(stash)) ); |
| 2824 | if (!gvsv || !SvPOK(gvsv) |
| 2825 | || !(ngv = gv_fetchmethod_sv_flags(stash, gvsv, 0))) |
| 2826 | { |
| 2827 | /* Can be an import stub (created by "can"). */ |
| 2828 | if (destructing) { |
| 2829 | return -1; |
| 2830 | } |
| 2831 | else { |
| 2832 | const SV * const name = (gvsv && SvPOK(gvsv)) |
| 2833 | ? gvsv |
| 2834 | : newSVpvs_flags("???", SVs_TEMP); |
| 2835 | /* diag_listed_as: Can't resolve method "%s" overloading "%s" in package "%s" */ |
| 2836 | Perl_croak(aTHX_ "%s method \"%" SVf256 |
| 2837 | "\" overloading \"%s\" "\ |
| 2838 | "in package \"%" HEKf256 "\"", |
| 2839 | (GvCVGEN(gv) ? "Stub found while resolving" |
| 2840 | : "Can't resolve"), |
| 2841 | SVfARG(name), cp, |
| 2842 | HEKfARG( |
| 2843 | HvNAME_HEK(stash) |
| 2844 | )); |
| 2845 | } |
| 2846 | } |
| 2847 | cv = GvCV(gv = ngv); |
| 2848 | } |
| 2849 | DEBUG_o( Perl_deb(aTHX_ "Overloading \"%s\" in package \"%.256s\" via \"%.256s::%.256s\"\n", |
| 2850 | cp, HvNAME_get(stash), HvNAME_get(GvSTASH(CvGV(cv))), |
| 2851 | GvNAME(CvGV(cv))) ); |
| 2852 | filled = 1; |
| 2853 | } else if (gv) { /* Autoloaded... */ |
| 2854 | cv = MUTABLE_CV(gv); |
| 2855 | filled = 1; |
| 2856 | } |
| 2857 | amt.table[i]=MUTABLE_CV(SvREFCNT_inc_simple(cv)); |
| 2858 | |
| 2859 | if (gv) { |
| 2860 | switch (i) { |
| 2861 | case to_sv_amg: |
| 2862 | case to_av_amg: |
| 2863 | case to_hv_amg: |
| 2864 | case to_gv_amg: |
| 2865 | case to_cv_amg: |
| 2866 | case nomethod_amg: |
| 2867 | deref_seen = 1; |
| 2868 | break; |
| 2869 | } |
| 2870 | } |
| 2871 | } |
| 2872 | if (!deref_seen) |
| 2873 | /* none of @{} etc overloaded; we can do $obj->[N] quicker. |
| 2874 | * NB - aux var invalid here, HvARRAY() could have been |
| 2875 | * reallocated since it was assigned to */ |
| 2876 | HvAUX(stash)->xhv_aux_flags |= HvAUXf_NO_DEREF; |
| 2877 | |
| 2878 | if (filled) { |
| 2879 | AMT_AMAGIC_on(&amt); |
| 2880 | sv_magic(MUTABLE_SV(stash), 0, PERL_MAGIC_overload_table, |
| 2881 | (char*)&amt, sizeof(AMT)); |
| 2882 | return TRUE; |
| 2883 | } |
| 2884 | } |
| 2885 | /* Here we have no table: */ |
| 2886 | no_table: |
| 2887 | AMT_AMAGIC_off(&amt); |
| 2888 | sv_magic(MUTABLE_SV(stash), 0, PERL_MAGIC_overload_table, |
| 2889 | (char*)&amt, sizeof(AMTS)); |
| 2890 | return 0; |
| 2891 | } |
| 2892 | |
| 2893 | |
| 2894 | CV* |
| 2895 | Perl_gv_handler(pTHX_ HV *stash, I32 id) |
| 2896 | { |
| 2897 | MAGIC *mg; |
| 2898 | AMT *amtp; |
| 2899 | U32 newgen; |
| 2900 | struct mro_meta* stash_meta; |
| 2901 | |
| 2902 | if (!stash || !HvNAME_get(stash)) |
| 2903 | return NULL; |
| 2904 | |
| 2905 | stash_meta = HvMROMETA(stash); |
| 2906 | newgen = PL_sub_generation + stash_meta->pkg_gen + stash_meta->cache_gen; |
| 2907 | |
| 2908 | mg = mg_find((const SV *)stash, PERL_MAGIC_overload_table); |
| 2909 | if (!mg) { |
| 2910 | do_update: |
| 2911 | if (Gv_AMupdate(stash, 0) == -1) |
| 2912 | return NULL; |
| 2913 | mg = mg_find((const SV *)stash, PERL_MAGIC_overload_table); |
| 2914 | } |
| 2915 | assert(mg); |
| 2916 | amtp = (AMT*)mg->mg_ptr; |
| 2917 | if ( amtp->was_ok_sub != newgen ) |
| 2918 | goto do_update; |
| 2919 | if (AMT_AMAGIC(amtp)) { |
| 2920 | CV * const ret = amtp->table[id]; |
| 2921 | if (ret && isGV(ret)) { /* Autoloading stab */ |
| 2922 | /* Passing it through may have resulted in a warning |
| 2923 | "Inherited AUTOLOAD for a non-method deprecated", since |
| 2924 | our caller is going through a function call, not a method call. |
| 2925 | So return the CV for AUTOLOAD, setting $AUTOLOAD. */ |
| 2926 | GV * const gv = gv_fetchmethod(stash, PL_AMG_names[id]); |
| 2927 | |
| 2928 | if (gv && GvCV(gv)) |
| 2929 | return GvCV(gv); |
| 2930 | } |
| 2931 | return ret; |
| 2932 | } |
| 2933 | |
| 2934 | return NULL; |
| 2935 | } |
| 2936 | |
| 2937 | |
| 2938 | /* Implement tryAMAGICun_MG macro. |
| 2939 | Do get magic, then see if the stack arg is overloaded and if so call it. |
| 2940 | Flags: |
| 2941 | AMGf_set return the arg using SETs rather than assigning to |
| 2942 | the targ |
| 2943 | AMGf_numeric apply sv_2num to the stack arg. |
| 2944 | */ |
| 2945 | |
| 2946 | bool |
| 2947 | Perl_try_amagic_un(pTHX_ int method, int flags) { |
| 2948 | dSP; |
| 2949 | SV* tmpsv; |
| 2950 | SV* const arg = TOPs; |
| 2951 | |
| 2952 | SvGETMAGIC(arg); |
| 2953 | |
| 2954 | if (SvAMAGIC(arg) && (tmpsv = amagic_call(arg, &PL_sv_undef, method, |
| 2955 | AMGf_noright | AMGf_unary |
| 2956 | | (flags & AMGf_numarg)))) |
| 2957 | { |
| 2958 | if (flags & AMGf_set) { |
| 2959 | SETs(tmpsv); |
| 2960 | } |
| 2961 | else { |
| 2962 | dTARGET; |
| 2963 | if (SvPADMY(TARG)) { |
| 2964 | sv_setsv(TARG, tmpsv); |
| 2965 | SETTARG; |
| 2966 | } |
| 2967 | else |
| 2968 | SETs(tmpsv); |
| 2969 | } |
| 2970 | PUTBACK; |
| 2971 | return TRUE; |
| 2972 | } |
| 2973 | |
| 2974 | if ((flags & AMGf_numeric) && SvROK(arg)) |
| 2975 | *sp = sv_2num(arg); |
| 2976 | return FALSE; |
| 2977 | } |
| 2978 | |
| 2979 | |
| 2980 | /* Implement tryAMAGICbin_MG macro. |
| 2981 | Do get magic, then see if the two stack args are overloaded and if so |
| 2982 | call it. |
| 2983 | Flags: |
| 2984 | AMGf_set return the arg using SETs rather than assigning to |
| 2985 | the targ |
| 2986 | AMGf_assign op may be called as mutator (eg +=) |
| 2987 | AMGf_numeric apply sv_2num to the stack arg. |
| 2988 | */ |
| 2989 | |
| 2990 | bool |
| 2991 | Perl_try_amagic_bin(pTHX_ int method, int flags) { |
| 2992 | dSP; |
| 2993 | SV* const left = TOPm1s; |
| 2994 | SV* const right = TOPs; |
| 2995 | |
| 2996 | SvGETMAGIC(left); |
| 2997 | if (left != right) |
| 2998 | SvGETMAGIC(right); |
| 2999 | |
| 3000 | if (SvAMAGIC(left) || SvAMAGIC(right)) { |
| 3001 | SV * const tmpsv = amagic_call(left, right, method, |
| 3002 | ((flags & AMGf_assign) && opASSIGN ? AMGf_assign: 0) |
| 3003 | | (flags & AMGf_numarg)); |
| 3004 | if (tmpsv) { |
| 3005 | if (flags & AMGf_set) { |
| 3006 | (void)POPs; |
| 3007 | SETs(tmpsv); |
| 3008 | } |
| 3009 | else { |
| 3010 | dATARGET; |
| 3011 | (void)POPs; |
| 3012 | if (opASSIGN || SvPADMY(TARG)) { |
| 3013 | sv_setsv(TARG, tmpsv); |
| 3014 | SETTARG; |
| 3015 | } |
| 3016 | else |
| 3017 | SETs(tmpsv); |
| 3018 | } |
| 3019 | PUTBACK; |
| 3020 | return TRUE; |
| 3021 | } |
| 3022 | } |
| 3023 | if(left==right && SvGMAGICAL(left)) { |
| 3024 | SV * const left = sv_newmortal(); |
| 3025 | *(sp-1) = left; |
| 3026 | /* Print the uninitialized warning now, so it includes the vari- |
| 3027 | able name. */ |
| 3028 | if (!SvOK(right)) { |
| 3029 | if (ckWARN(WARN_UNINITIALIZED)) report_uninit(right); |
| 3030 | sv_setsv_flags(left, &PL_sv_no, 0); |
| 3031 | } |
| 3032 | else sv_setsv_flags(left, right, 0); |
| 3033 | SvGETMAGIC(right); |
| 3034 | } |
| 3035 | if (flags & AMGf_numeric) { |
| 3036 | if (SvROK(TOPm1s)) |
| 3037 | *(sp-1) = sv_2num(TOPm1s); |
| 3038 | if (SvROK(right)) |
| 3039 | *sp = sv_2num(right); |
| 3040 | } |
| 3041 | return FALSE; |
| 3042 | } |
| 3043 | |
| 3044 | SV * |
| 3045 | Perl_amagic_deref_call(pTHX_ SV *ref, int method) { |
| 3046 | SV *tmpsv = NULL; |
| 3047 | HV *stash; |
| 3048 | |
| 3049 | PERL_ARGS_ASSERT_AMAGIC_DEREF_CALL; |
| 3050 | |
| 3051 | if (!SvAMAGIC(ref)) |
| 3052 | return ref; |
| 3053 | /* return quickly if none of the deref ops are overloaded */ |
| 3054 | stash = SvSTASH(SvRV(ref)); |
| 3055 | assert(SvOOK(stash)); |
| 3056 | if (HvAUX(stash)->xhv_aux_flags & HvAUXf_NO_DEREF) |
| 3057 | return ref; |
| 3058 | |
| 3059 | while ((tmpsv = amagic_call(ref, &PL_sv_undef, method, |
| 3060 | AMGf_noright | AMGf_unary))) { |
| 3061 | if (!SvROK(tmpsv)) |
| 3062 | Perl_croak(aTHX_ "Overloaded dereference did not return a reference"); |
| 3063 | if (tmpsv == ref || SvRV(tmpsv) == SvRV(ref)) { |
| 3064 | /* Bail out if it returns us the same reference. */ |
| 3065 | return tmpsv; |
| 3066 | } |
| 3067 | ref = tmpsv; |
| 3068 | if (!SvAMAGIC(ref)) |
| 3069 | break; |
| 3070 | } |
| 3071 | return tmpsv ? tmpsv : ref; |
| 3072 | } |
| 3073 | |
| 3074 | bool |
| 3075 | Perl_amagic_is_enabled(pTHX_ int method) |
| 3076 | { |
| 3077 | SV *lex_mask = cop_hints_fetch_pvs(PL_curcop, "overloading", 0); |
| 3078 | |
| 3079 | assert(PL_curcop->cop_hints & HINT_NO_AMAGIC); |
| 3080 | |
| 3081 | if ( !lex_mask || !SvOK(lex_mask) ) |
| 3082 | /* overloading lexically disabled */ |
| 3083 | return FALSE; |
| 3084 | else if ( lex_mask && SvPOK(lex_mask) ) { |
| 3085 | /* we have an entry in the hints hash, check if method has been |
| 3086 | * masked by overloading.pm */ |
| 3087 | STRLEN len; |
| 3088 | const int offset = method / 8; |
| 3089 | const int bit = method % 8; |
| 3090 | char *pv = SvPV(lex_mask, len); |
| 3091 | |
| 3092 | /* Bit set, so this overloading operator is disabled */ |
| 3093 | if ( (STRLEN)offset < len && pv[offset] & ( 1 << bit ) ) |
| 3094 | return FALSE; |
| 3095 | } |
| 3096 | return TRUE; |
| 3097 | } |
| 3098 | |
| 3099 | SV* |
| 3100 | Perl_amagic_call(pTHX_ SV *left, SV *right, int method, int flags) |
| 3101 | { |
| 3102 | dVAR; |
| 3103 | MAGIC *mg; |
| 3104 | CV *cv=NULL; |
| 3105 | CV **cvp=NULL, **ocvp=NULL; |
| 3106 | AMT *amtp=NULL, *oamtp=NULL; |
| 3107 | int off = 0, off1, lr = 0, notfound = 0; |
| 3108 | int postpr = 0, force_cpy = 0; |
| 3109 | int assign = AMGf_assign & flags; |
| 3110 | const int assignshift = assign ? 1 : 0; |
| 3111 | int use_default_op = 0; |
| 3112 | int force_scalar = 0; |
| 3113 | #ifdef DEBUGGING |
| 3114 | int fl=0; |
| 3115 | #endif |
| 3116 | HV* stash=NULL; |
| 3117 | |
| 3118 | PERL_ARGS_ASSERT_AMAGIC_CALL; |
| 3119 | |
| 3120 | if ( PL_curcop->cop_hints & HINT_NO_AMAGIC ) { |
| 3121 | if (!amagic_is_enabled(method)) return NULL; |
| 3122 | } |
| 3123 | |
| 3124 | if (!(AMGf_noleft & flags) && SvAMAGIC(left) |
| 3125 | && (stash = SvSTASH(SvRV(left))) && Gv_AMG(stash) |
| 3126 | && (mg = mg_find((const SV *)stash, PERL_MAGIC_overload_table)) |
| 3127 | && (ocvp = cvp = (AMT_AMAGIC((AMT*)mg->mg_ptr) |
| 3128 | ? (oamtp = amtp = (AMT*)mg->mg_ptr)->table |
| 3129 | : NULL)) |
| 3130 | && ((cv = cvp[off=method+assignshift]) |
| 3131 | || (assign && amtp->fallback > AMGfallNEVER && /* fallback to |
| 3132 | * usual method */ |
| 3133 | ( |
| 3134 | #ifdef DEBUGGING |
| 3135 | fl = 1, |
| 3136 | #endif |
| 3137 | cv = cvp[off=method])))) { |
| 3138 | lr = -1; /* Call method for left argument */ |
| 3139 | } else { |
| 3140 | if (cvp && amtp->fallback > AMGfallNEVER && flags & AMGf_unary) { |
| 3141 | int logic; |
| 3142 | |
| 3143 | /* look for substituted methods */ |
| 3144 | /* In all the covered cases we should be called with assign==0. */ |
| 3145 | switch (method) { |
| 3146 | case inc_amg: |
| 3147 | force_cpy = 1; |
| 3148 | if ((cv = cvp[off=add_ass_amg]) |
| 3149 | || ((cv = cvp[off = add_amg]) && (force_cpy = 0, postpr = 1))) { |
| 3150 | right = &PL_sv_yes; lr = -1; assign = 1; |
| 3151 | } |
| 3152 | break; |
| 3153 | case dec_amg: |
| 3154 | force_cpy = 1; |
| 3155 | if ((cv = cvp[off = subtr_ass_amg]) |
| 3156 | || ((cv = cvp[off = subtr_amg]) && (force_cpy = 0, postpr=1))) { |
| 3157 | right = &PL_sv_yes; lr = -1; assign = 1; |
| 3158 | } |
| 3159 | break; |
| 3160 | case bool__amg: |
| 3161 | (void)((cv = cvp[off=numer_amg]) || (cv = cvp[off=string_amg])); |
| 3162 | break; |
| 3163 | case numer_amg: |
| 3164 | (void)((cv = cvp[off=string_amg]) || (cv = cvp[off=bool__amg])); |
| 3165 | break; |
| 3166 | case string_amg: |
| 3167 | (void)((cv = cvp[off=numer_amg]) || (cv = cvp[off=bool__amg])); |
| 3168 | break; |
| 3169 | case not_amg: |
| 3170 | (void)((cv = cvp[off=bool__amg]) |
| 3171 | || (cv = cvp[off=numer_amg]) |
| 3172 | || (cv = cvp[off=string_amg])); |
| 3173 | if (cv) |
| 3174 | postpr = 1; |
| 3175 | break; |
| 3176 | case copy_amg: |
| 3177 | { |
| 3178 | /* |
| 3179 | * SV* ref causes confusion with the interpreter variable of |
| 3180 | * the same name |
| 3181 | */ |
| 3182 | SV* const tmpRef=SvRV(left); |
| 3183 | if (!SvROK(tmpRef) && SvTYPE(tmpRef) <= SVt_PVMG) { |
| 3184 | /* |
| 3185 | * Just to be extra cautious. Maybe in some |
| 3186 | * additional cases sv_setsv is safe, too. |
| 3187 | */ |
| 3188 | SV* const newref = newSVsv(tmpRef); |
| 3189 | SvOBJECT_on(newref); |
| 3190 | /* No need to do SvAMAGIC_on here, as SvAMAGIC macros |
| 3191 | delegate to the stash. */ |
| 3192 | SvSTASH_set(newref, MUTABLE_HV(SvREFCNT_inc(SvSTASH(tmpRef)))); |
| 3193 | return newref; |
| 3194 | } |
| 3195 | } |
| 3196 | break; |
| 3197 | case abs_amg: |
| 3198 | if ((cvp[off1=lt_amg] || cvp[off1=ncmp_amg]) |
| 3199 | && ((cv = cvp[off=neg_amg]) || (cv = cvp[off=subtr_amg]))) { |
| 3200 | SV* const nullsv=&PL_sv_zero; |
| 3201 | if (off1==lt_amg) { |
| 3202 | SV* const lessp = amagic_call(left,nullsv, |
| 3203 | lt_amg,AMGf_noright); |
| 3204 | logic = SvTRUE_NN(lessp); |
| 3205 | } else { |
| 3206 | SV* const lessp = amagic_call(left,nullsv, |
| 3207 | ncmp_amg,AMGf_noright); |
| 3208 | logic = (SvNV(lessp) < 0); |
| 3209 | } |
| 3210 | if (logic) { |
| 3211 | if (off==subtr_amg) { |
| 3212 | right = left; |
| 3213 | left = nullsv; |
| 3214 | lr = 1; |
| 3215 | } |
| 3216 | } else { |
| 3217 | return left; |
| 3218 | } |
| 3219 | } |
| 3220 | break; |
| 3221 | case neg_amg: |
| 3222 | if ((cv = cvp[off=subtr_amg])) { |
| 3223 | right = left; |
| 3224 | left = &PL_sv_zero; |
| 3225 | lr = 1; |
| 3226 | } |
| 3227 | break; |
| 3228 | case int_amg: |
| 3229 | case iter_amg: /* XXXX Eventually should do to_gv. */ |
| 3230 | case ftest_amg: /* XXXX Eventually should do to_gv. */ |
| 3231 | case regexp_amg: |
| 3232 | /* FAIL safe */ |
| 3233 | return NULL; /* Delegate operation to standard mechanisms. */ |
| 3234 | |
| 3235 | case to_sv_amg: |
| 3236 | case to_av_amg: |
| 3237 | case to_hv_amg: |
| 3238 | case to_gv_amg: |
| 3239 | case to_cv_amg: |
| 3240 | /* FAIL safe */ |
| 3241 | return left; /* Delegate operation to standard mechanisms. */ |
| 3242 | |
| 3243 | default: |
| 3244 | goto not_found; |
| 3245 | } |
| 3246 | if (!cv) goto not_found; |
| 3247 | } else if (!(AMGf_noright & flags) && SvAMAGIC(right) |
| 3248 | && (stash = SvSTASH(SvRV(right))) && Gv_AMG(stash) |
| 3249 | && (mg = mg_find((const SV *)stash, PERL_MAGIC_overload_table)) |
| 3250 | && (cvp = (AMT_AMAGIC((AMT*)mg->mg_ptr) |
| 3251 | ? (amtp = (AMT*)mg->mg_ptr)->table |
| 3252 | : NULL)) |
| 3253 | && (cv = cvp[off=method])) { /* Method for right |
| 3254 | * argument found */ |
| 3255 | lr=1; |
| 3256 | } else if (((cvp && amtp->fallback > AMGfallNEVER) |
| 3257 | || (ocvp && oamtp->fallback > AMGfallNEVER)) |
| 3258 | && !(flags & AMGf_unary)) { |
| 3259 | /* We look for substitution for |
| 3260 | * comparison operations and |
| 3261 | * concatenation */ |
| 3262 | if (method==concat_amg || method==concat_ass_amg |
| 3263 | || method==repeat_amg || method==repeat_ass_amg) { |
| 3264 | return NULL; /* Delegate operation to string conversion */ |
| 3265 | } |
| 3266 | off = -1; |
| 3267 | switch (method) { |
| 3268 | case lt_amg: |
| 3269 | case le_amg: |
| 3270 | case gt_amg: |
| 3271 | case ge_amg: |
| 3272 | case eq_amg: |
| 3273 | case ne_amg: |
| 3274 | off = ncmp_amg; |
| 3275 | break; |
| 3276 | case slt_amg: |
| 3277 | case sle_amg: |
| 3278 | case sgt_amg: |
| 3279 | case sge_amg: |
| 3280 | case seq_amg: |
| 3281 | case sne_amg: |
| 3282 | off = scmp_amg; |
| 3283 | break; |
| 3284 | } |
| 3285 | if (off != -1) { |
| 3286 | if (ocvp && (oamtp->fallback > AMGfallNEVER)) { |
| 3287 | cv = ocvp[off]; |
| 3288 | lr = -1; |
| 3289 | } |
| 3290 | if (!cv && (cvp && amtp->fallback > AMGfallNEVER)) { |
| 3291 | cv = cvp[off]; |
| 3292 | lr = 1; |
| 3293 | } |
| 3294 | } |
| 3295 | if (cv) |
| 3296 | postpr = 1; |
| 3297 | else |
| 3298 | goto not_found; |
| 3299 | } else { |
| 3300 | not_found: /* No method found, either report or croak */ |
| 3301 | switch (method) { |
| 3302 | case to_sv_amg: |
| 3303 | case to_av_amg: |
| 3304 | case to_hv_amg: |
| 3305 | case to_gv_amg: |
| 3306 | case to_cv_amg: |
| 3307 | /* FAIL safe */ |
| 3308 | return left; /* Delegate operation to standard mechanisms. */ |
| 3309 | } |
| 3310 | if (ocvp && (cv=ocvp[nomethod_amg])) { /* Call report method */ |
| 3311 | notfound = 1; lr = -1; |
| 3312 | } else if (cvp && (cv=cvp[nomethod_amg])) { |
| 3313 | notfound = 1; lr = 1; |
| 3314 | } else if ((use_default_op = |
| 3315 | (!ocvp || oamtp->fallback >= AMGfallYES) |
| 3316 | && (!cvp || amtp->fallback >= AMGfallYES)) |
| 3317 | && !DEBUG_o_TEST) { |
| 3318 | /* Skip generating the "no method found" message. */ |
| 3319 | return NULL; |
| 3320 | } else { |
| 3321 | SV *msg; |
| 3322 | if (off==-1) off=method; |
| 3323 | msg = sv_2mortal(Perl_newSVpvf(aTHX_ |
| 3324 | "Operation \"%s\": no method found,%sargument %s%" SVf "%s%" SVf, |
| 3325 | AMG_id2name(method + assignshift), |
| 3326 | (flags & AMGf_unary ? " " : "\n\tleft "), |
| 3327 | SvAMAGIC(left)? |
| 3328 | "in overloaded package ": |
| 3329 | "has no overloaded magic", |
| 3330 | SvAMAGIC(left)? |
| 3331 | SVfARG(sv_2mortal(newSVhek(HvNAME_HEK(SvSTASH(SvRV(left)))))): |
| 3332 | SVfARG(&PL_sv_no), |
| 3333 | SvAMAGIC(right)? |
| 3334 | ",\n\tright argument in overloaded package ": |
| 3335 | (flags & AMGf_unary |
| 3336 | ? "" |
| 3337 | : ",\n\tright argument has no overloaded magic"), |
| 3338 | SvAMAGIC(right)? |
| 3339 | SVfARG(sv_2mortal(newSVhek(HvNAME_HEK(SvSTASH(SvRV(right)))))): |
| 3340 | SVfARG(&PL_sv_no))); |
| 3341 | if (use_default_op) { |
| 3342 | DEBUG_o( Perl_deb(aTHX_ "%" SVf, SVfARG(msg)) ); |
| 3343 | } else { |
| 3344 | Perl_croak(aTHX_ "%" SVf, SVfARG(msg)); |
| 3345 | } |
| 3346 | return NULL; |
| 3347 | } |
| 3348 | force_cpy = force_cpy || assign; |
| 3349 | } |
| 3350 | } |
| 3351 | |
| 3352 | switch (method) { |
| 3353 | /* in these cases, we're calling '+' or '-' as a fallback for a ++ or -- |
| 3354 | * operation. we need this to return a value, so that it can be assigned |
| 3355 | * later on, in the postpr block (case inc_amg/dec_amg), even if the |
| 3356 | * increment or decrement was itself called in void context */ |
| 3357 | case inc_amg: |
| 3358 | if (off == add_amg) |
| 3359 | force_scalar = 1; |
| 3360 | break; |
| 3361 | case dec_amg: |
| 3362 | if (off == subtr_amg) |
| 3363 | force_scalar = 1; |
| 3364 | break; |
| 3365 | /* in these cases, we're calling an assignment variant of an operator |
| 3366 | * (+= rather than +, for instance). regardless of whether it's a |
| 3367 | * fallback or not, it always has to return a value, which will be |
| 3368 | * assigned to the proper variable later */ |
| 3369 | case add_amg: |
| 3370 | case subtr_amg: |
| 3371 | case mult_amg: |
| 3372 | case div_amg: |
| 3373 | case modulo_amg: |
| 3374 | case pow_amg: |
| 3375 | case lshift_amg: |
| 3376 | case rshift_amg: |
| 3377 | case repeat_amg: |
| 3378 | case concat_amg: |
| 3379 | case band_amg: |
| 3380 | case bor_amg: |
| 3381 | case bxor_amg: |
| 3382 | case sband_amg: |
| 3383 | case sbor_amg: |
| 3384 | case sbxor_amg: |
| 3385 | if (assign) |
| 3386 | force_scalar = 1; |
| 3387 | break; |
| 3388 | /* the copy constructor always needs to return a value */ |
| 3389 | case copy_amg: |
| 3390 | force_scalar = 1; |
| 3391 | break; |
| 3392 | /* because of the way these are implemented (they don't perform the |
| 3393 | * dereferencing themselves, they return a reference that perl then |
| 3394 | * dereferences later), they always have to be in scalar context */ |
| 3395 | case to_sv_amg: |
| 3396 | case to_av_amg: |
| 3397 | case to_hv_amg: |
| 3398 | case to_gv_amg: |
| 3399 | case to_cv_amg: |
| 3400 | force_scalar = 1; |
| 3401 | break; |
| 3402 | /* these don't have an op of their own; they're triggered by their parent |
| 3403 | * op, so the context there isn't meaningful ('$a and foo()' in void |
| 3404 | * context still needs to pass scalar context on to $a's bool overload) */ |
| 3405 | case bool__amg: |
| 3406 | case numer_amg: |
| 3407 | case string_amg: |
| 3408 | force_scalar = 1; |
| 3409 | break; |
| 3410 | } |
| 3411 | |
| 3412 | #ifdef DEBUGGING |
| 3413 | if (!notfound) { |
| 3414 | DEBUG_o(Perl_deb(aTHX_ |
| 3415 | "Overloaded operator \"%s\"%s%s%s:\n\tmethod%s found%s in package %" SVf "%s\n", |
| 3416 | AMG_id2name(off), |
| 3417 | method+assignshift==off? "" : |
| 3418 | " (initially \"", |
| 3419 | method+assignshift==off? "" : |
| 3420 | AMG_id2name(method+assignshift), |
| 3421 | method+assignshift==off? "" : "\")", |
| 3422 | flags & AMGf_unary? "" : |
| 3423 | lr==1 ? " for right argument": " for left argument", |
| 3424 | flags & AMGf_unary? " for argument" : "", |
| 3425 | stash ? SVfARG(sv_2mortal(newSVhek(HvNAME_HEK(stash)))) : SVfARG(newSVpvs_flags("null", SVs_TEMP)), |
| 3426 | fl? ",\n\tassignment variant used": "") ); |
| 3427 | } |
| 3428 | #endif |
| 3429 | /* Since we use shallow copy during assignment, we need |
| 3430 | * to dublicate the contents, probably calling user-supplied |
| 3431 | * version of copy operator |
| 3432 | */ |
| 3433 | /* We need to copy in following cases: |
| 3434 | * a) Assignment form was called. |
| 3435 | * assignshift==1, assign==T, method + 1 == off |
| 3436 | * b) Increment or decrement, called directly. |
| 3437 | * assignshift==0, assign==0, method + 0 == off |
| 3438 | * c) Increment or decrement, translated to assignment add/subtr. |
| 3439 | * assignshift==0, assign==T, |
| 3440 | * force_cpy == T |
| 3441 | * d) Increment or decrement, translated to nomethod. |
| 3442 | * assignshift==0, assign==0, |
| 3443 | * force_cpy == T |
| 3444 | * e) Assignment form translated to nomethod. |
| 3445 | * assignshift==1, assign==T, method + 1 != off |
| 3446 | * force_cpy == T |
| 3447 | */ |
| 3448 | /* off is method, method+assignshift, or a result of opcode substitution. |
| 3449 | * In the latter case assignshift==0, so only notfound case is important. |
| 3450 | */ |
| 3451 | if ( (lr == -1) && ( ( (method + assignshift == off) |
| 3452 | && (assign || (method == inc_amg) || (method == dec_amg))) |
| 3453 | || force_cpy) ) |
| 3454 | { |
| 3455 | /* newSVsv does not behave as advertised, so we copy missing |
| 3456 | * information by hand */ |
| 3457 | SV *tmpRef = SvRV(left); |
| 3458 | SV *rv_copy; |
| 3459 | if (SvREFCNT(tmpRef) > 1 && (rv_copy = AMG_CALLunary(left,copy_amg))) { |
| 3460 | SvRV_set(left, rv_copy); |
| 3461 | SvSETMAGIC(left); |
| 3462 | SvREFCNT_dec_NN(tmpRef); |
| 3463 | } |
| 3464 | } |
| 3465 | |
| 3466 | { |
| 3467 | dSP; |
| 3468 | BINOP myop; |
| 3469 | SV* res; |
| 3470 | const bool oldcatch = CATCH_GET; |
| 3471 | I32 oldmark, nret; |
| 3472 | /* for multiconcat, we may call overload several times, |
| 3473 | * with the context of individual concats being scalar, |
| 3474 | * regardless of the overall context of the multiconcat op |
| 3475 | */ |
| 3476 | U8 gimme = (force_scalar || PL_op->op_type == OP_MULTICONCAT) |
| 3477 | ? G_SCALAR : GIMME_V; |
| 3478 | |
| 3479 | CATCH_SET(TRUE); |
| 3480 | Zero(&myop, 1, BINOP); |
| 3481 | myop.op_last = (OP *) &myop; |
| 3482 | myop.op_next = NULL; |
| 3483 | myop.op_flags = OPf_STACKED; |
| 3484 | |
| 3485 | switch (gimme) { |
| 3486 | case G_VOID: |
| 3487 | myop.op_flags |= OPf_WANT_VOID; |
| 3488 | break; |
| 3489 | case G_ARRAY: |
| 3490 | if (flags & AMGf_want_list) { |
| 3491 | myop.op_flags |= OPf_WANT_LIST; |
| 3492 | break; |
| 3493 | } |
| 3494 | /* FALLTHROUGH */ |
| 3495 | default: |
| 3496 | myop.op_flags |= OPf_WANT_SCALAR; |
| 3497 | break; |
| 3498 | } |
| 3499 | |
| 3500 | PUSHSTACKi(PERLSI_OVERLOAD); |
| 3501 | ENTER; |
| 3502 | SAVEOP(); |
| 3503 | PL_op = (OP *) &myop; |
| 3504 | if (PERLDB_SUB && PL_curstash != PL_debstash) |
| 3505 | PL_op->op_private |= OPpENTERSUB_DB; |
| 3506 | Perl_pp_pushmark(aTHX); |
| 3507 | |
| 3508 | EXTEND(SP, notfound + 5); |
| 3509 | PUSHs(lr>0? right: left); |
| 3510 | PUSHs(lr>0? left: right); |
| 3511 | PUSHs( lr > 0 ? &PL_sv_yes : ( assign ? &PL_sv_undef : &PL_sv_no )); |
| 3512 | if (notfound) { |
| 3513 | PUSHs(newSVpvn_flags(AMG_id2name(method + assignshift), |
| 3514 | AMG_id2namelen(method + assignshift), SVs_TEMP)); |
| 3515 | } |
| 3516 | else if (flags & AMGf_numarg) |
| 3517 | PUSHs(&PL_sv_undef); |
| 3518 | if (flags & AMGf_numarg) |
| 3519 | PUSHs(&PL_sv_yes); |
| 3520 | PUSHs(MUTABLE_SV(cv)); |
| 3521 | PUTBACK; |
| 3522 | oldmark = TOPMARK; |
| 3523 | |
| 3524 | if ((PL_op = PL_ppaddr[OP_ENTERSUB](aTHX))) |
| 3525 | CALLRUNOPS(aTHX); |
| 3526 | LEAVE; |
| 3527 | SPAGAIN; |
| 3528 | nret = SP - (PL_stack_base + oldmark); |
| 3529 | |
| 3530 | switch (gimme) { |
| 3531 | case G_VOID: |
| 3532 | /* returning NULL has another meaning, and we check the context |
| 3533 | * at the call site too, so this can be differentiated from the |
| 3534 | * scalar case */ |
| 3535 | res = &PL_sv_undef; |
| 3536 | SP = PL_stack_base + oldmark; |
| 3537 | break; |
| 3538 | case G_ARRAY: |
| 3539 | if (flags & AMGf_want_list) { |
| 3540 | res = sv_2mortal((SV *)newAV()); |
| 3541 | av_extend((AV *)res, nret); |
| 3542 | while (nret--) |
| 3543 | av_store((AV *)res, nret, POPs); |
| 3544 | break; |
| 3545 | } |
| 3546 | /* FALLTHROUGH */ |
| 3547 | default: |
| 3548 | res = POPs; |
| 3549 | break; |
| 3550 | } |
| 3551 | |
| 3552 | PUTBACK; |
| 3553 | POPSTACK; |
| 3554 | CATCH_SET(oldcatch); |
| 3555 | |
| 3556 | if (postpr) { |
| 3557 | int ans; |
| 3558 | switch (method) { |
| 3559 | case le_amg: |
| 3560 | case sle_amg: |
| 3561 | ans=SvIV(res)<=0; break; |
| 3562 | case lt_amg: |
| 3563 | case slt_amg: |
| 3564 | ans=SvIV(res)<0; break; |
| 3565 | case ge_amg: |
| 3566 | case sge_amg: |
| 3567 | ans=SvIV(res)>=0; break; |
| 3568 | case gt_amg: |
| 3569 | case sgt_amg: |
| 3570 | ans=SvIV(res)>0; break; |
| 3571 | case eq_amg: |
| 3572 | case seq_amg: |
| 3573 | ans=SvIV(res)==0; break; |
| 3574 | case ne_amg: |
| 3575 | case sne_amg: |
| 3576 | ans=SvIV(res)!=0; break; |
| 3577 | case inc_amg: |
| 3578 | case dec_amg: |
| 3579 | SvSetSV(left,res); return left; |
| 3580 | case not_amg: |
| 3581 | ans=!SvTRUE_NN(res); break; |
| 3582 | default: |
| 3583 | ans=0; break; |
| 3584 | } |
| 3585 | return boolSV(ans); |
| 3586 | } else if (method==copy_amg) { |
| 3587 | if (!SvROK(res)) { |
| 3588 | Perl_croak(aTHX_ "Copy method did not return a reference"); |
| 3589 | } |
| 3590 | return SvREFCNT_inc(SvRV(res)); |
| 3591 | } else { |
| 3592 | return res; |
| 3593 | } |
| 3594 | } |
| 3595 | } |
| 3596 | |
| 3597 | void |
| 3598 | Perl_gv_name_set(pTHX_ GV *gv, const char *name, U32 len, U32 flags) |
| 3599 | { |
| 3600 | dVAR; |
| 3601 | U32 hash; |
| 3602 | |
| 3603 | PERL_ARGS_ASSERT_GV_NAME_SET; |
| 3604 | |
| 3605 | if (len > I32_MAX) |
| 3606 | Perl_croak(aTHX_ "panic: gv name too long (%" UVuf ")", (UV) len); |
| 3607 | |
| 3608 | if (!(flags & GV_ADD) && GvNAME_HEK(gv)) { |
| 3609 | unshare_hek(GvNAME_HEK(gv)); |
| 3610 | } |
| 3611 | |
| 3612 | PERL_HASH(hash, name, len); |
| 3613 | GvNAME_HEK(gv) = share_hek(name, (flags & SVf_UTF8 ? -(I32)len : (I32)len), hash); |
| 3614 | } |
| 3615 | |
| 3616 | /* |
| 3617 | =for apidoc gv_try_downgrade |
| 3618 | |
| 3619 | If the typeglob C<gv> can be expressed more succinctly, by having |
| 3620 | something other than a real GV in its place in the stash, replace it |
| 3621 | with the optimised form. Basic requirements for this are that C<gv> |
| 3622 | is a real typeglob, is sufficiently ordinary, and is only referenced |
| 3623 | from its package. This function is meant to be used when a GV has been |
| 3624 | looked up in part to see what was there, causing upgrading, but based |
| 3625 | on what was found it turns out that the real GV isn't required after all. |
| 3626 | |
| 3627 | If C<gv> is a completely empty typeglob, it is deleted from the stash. |
| 3628 | |
| 3629 | If C<gv> is a typeglob containing only a sufficiently-ordinary constant |
| 3630 | sub, the typeglob is replaced with a scalar-reference placeholder that |
| 3631 | more compactly represents the same thing. |
| 3632 | |
| 3633 | =cut |
| 3634 | */ |
| 3635 | |
| 3636 | void |
| 3637 | Perl_gv_try_downgrade(pTHX_ GV *gv) |
| 3638 | { |
| 3639 | HV *stash; |
| 3640 | CV *cv; |
| 3641 | HEK *namehek; |
| 3642 | SV **gvp; |
| 3643 | PERL_ARGS_ASSERT_GV_TRY_DOWNGRADE; |
| 3644 | |
| 3645 | /* XXX Why and where does this leave dangling pointers during global |
| 3646 | destruction? */ |
| 3647 | if (PL_phase == PERL_PHASE_DESTRUCT) return; |
| 3648 | |
| 3649 | if (!(SvREFCNT(gv) == 1 && SvTYPE(gv) == SVt_PVGV && !SvFAKE(gv) && |
| 3650 | !SvOBJECT(gv) && !SvREADONLY(gv) && |
| 3651 | isGV_with_GP(gv) && GvGP(gv) && |
| 3652 | !GvINTRO(gv) && GvREFCNT(gv) == 1 && |
| 3653 | !GvSV(gv) && !GvAV(gv) && !GvHV(gv) && !GvIOp(gv) && !GvFORM(gv) && |
| 3654 | GvEGVx(gv) == gv && (stash = GvSTASH(gv)))) |
| 3655 | return; |
| 3656 | if (gv == PL_statgv || gv == PL_last_in_gv || gv == PL_stderrgv) |
| 3657 | return; |
| 3658 | if (SvMAGICAL(gv)) { |
| 3659 | MAGIC *mg; |
| 3660 | /* only backref magic is allowed */ |
| 3661 | if (SvGMAGICAL(gv) || SvSMAGICAL(gv)) |
| 3662 | return; |
| 3663 | for (mg = SvMAGIC(gv); mg; mg = mg->mg_moremagic) { |
| 3664 | if (mg->mg_type != PERL_MAGIC_backref) |
| 3665 | return; |
| 3666 | } |
| 3667 | } |
| 3668 | cv = GvCV(gv); |
| 3669 | if (!cv) { |
| 3670 | HEK *gvnhek = GvNAME_HEK(gv); |
| 3671 | (void)hv_deletehek(stash, gvnhek, G_DISCARD); |
| 3672 | } else if (GvMULTI(gv) && cv && SvREFCNT(cv) == 1 && |
| 3673 | !SvOBJECT(cv) && !SvMAGICAL(cv) && !SvREADONLY(cv) && |
| 3674 | CvSTASH(cv) == stash && !CvNAMED(cv) && CvGV(cv) == gv && |
| 3675 | CvCONST(cv) && !CvMETHOD(cv) && !CvLVALUE(cv) && !CvUNIQUE(cv) && |
| 3676 | !CvNODEBUG(cv) && !CvCLONE(cv) && !CvCLONED(cv) && !CvANON(cv) && |
| 3677 | (namehek = GvNAME_HEK(gv)) && |
| 3678 | (gvp = hv_fetchhek(stash, namehek, 0)) && |
| 3679 | *gvp == (SV*)gv) { |
| 3680 | SV *value = SvREFCNT_inc(CvXSUBANY(cv).any_ptr); |
| 3681 | const bool imported = !!GvIMPORTED_CV(gv); |
| 3682 | SvREFCNT(gv) = 0; |
| 3683 | sv_clear((SV*)gv); |
| 3684 | SvREFCNT(gv) = 1; |
| 3685 | SvFLAGS(gv) = SVt_IV|SVf_ROK|SVprv_PCS_IMPORTED * imported; |
| 3686 | |
| 3687 | /* See also: 'SET_SVANY_FOR_BODYLESS_IV' in sv.c */ |
| 3688 | SvANY(gv) = (XPVGV*)((char*)&(gv->sv_u.svu_iv) - |
| 3689 | STRUCT_OFFSET(XPVIV, xiv_iv)); |
| 3690 | SvRV_set(gv, value); |
| 3691 | } |
| 3692 | } |
| 3693 | |
| 3694 | GV * |
| 3695 | Perl_gv_override(pTHX_ const char * const name, const STRLEN len) |
| 3696 | { |
| 3697 | GV *gv = gv_fetchpvn(name, len, GV_NOTQUAL, SVt_PVCV); |
| 3698 | GV * const *gvp; |
| 3699 | PERL_ARGS_ASSERT_GV_OVERRIDE; |
| 3700 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) return gv; |
| 3701 | gvp = (GV**)hv_fetch(PL_globalstash, name, len, FALSE); |
| 3702 | gv = gvp ? *gvp : NULL; |
| 3703 | if (gv && !isGV(gv)) { |
| 3704 | if (!SvPCS_IMPORTED(gv)) return NULL; |
| 3705 | gv_init(gv, PL_globalstash, name, len, 0); |
| 3706 | return gv; |
| 3707 | } |
| 3708 | return gv && GvCVu(gv) && GvIMPORTED_CV(gv) ? gv : NULL; |
| 3709 | } |
| 3710 | |
| 3711 | #include "XSUB.h" |
| 3712 | |
| 3713 | static void |
| 3714 | core_xsub(pTHX_ CV* cv) |
| 3715 | { |
| 3716 | Perl_croak(aTHX_ |
| 3717 | "&CORE::%s cannot be called directly", GvNAME(CvGV(cv)) |
| 3718 | ); |
| 3719 | } |
| 3720 | |
| 3721 | /* |
| 3722 | * ex: set ts=8 sts=4 sw=4 et: |
| 3723 | */ |