3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
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.
12 * 'It all comes from here, the stench and the peril.' --Frodo
14 * [p.719 of _The Lord of the Rings_, IV/ix: "Shelob's Lair"]
18 * This file is the lexer for Perl. It's closely linked to the
21 * The main routine is yylex(), which returns the next token.
25 =head1 Lexer interface
27 This is the lower layer of the Perl parser, managing characters and tokens.
29 =for apidoc AmU|yy_parser *|PL_parser
31 Pointer to a structure encapsulating the state of the parsing operation
32 currently in progress. The pointer can be locally changed to perform
33 a nested parse without interfering with the state of an outer parse.
34 Individual members of C<PL_parser> have their own documentation.
40 #define PERL_IN_TOKE_C
42 #include "dquote_static.c"
44 #define new_constant(a,b,c,d,e,f,g) \
45 S_new_constant(aTHX_ a,b,STR_WITH_LEN(c),d,e,f, g)
47 #define pl_yylval (PL_parser->yylval)
49 /* XXX temporary backwards compatibility */
50 #define PL_lex_brackets (PL_parser->lex_brackets)
51 #define PL_lex_allbrackets (PL_parser->lex_allbrackets)
52 #define PL_lex_fakeeof (PL_parser->lex_fakeeof)
53 #define PL_lex_brackstack (PL_parser->lex_brackstack)
54 #define PL_lex_casemods (PL_parser->lex_casemods)
55 #define PL_lex_casestack (PL_parser->lex_casestack)
56 #define PL_lex_defer (PL_parser->lex_defer)
57 #define PL_lex_dojoin (PL_parser->lex_dojoin)
58 #define PL_lex_expect (PL_parser->lex_expect)
59 #define PL_lex_formbrack (PL_parser->lex_formbrack)
60 #define PL_lex_inpat (PL_parser->lex_inpat)
61 #define PL_lex_inwhat (PL_parser->lex_inwhat)
62 #define PL_lex_op (PL_parser->lex_op)
63 #define PL_lex_repl (PL_parser->lex_repl)
64 #define PL_lex_starts (PL_parser->lex_starts)
65 #define PL_lex_stuff (PL_parser->lex_stuff)
66 #define PL_multi_start (PL_parser->multi_start)
67 #define PL_multi_open (PL_parser->multi_open)
68 #define PL_multi_close (PL_parser->multi_close)
69 #define PL_pending_ident (PL_parser->pending_ident)
70 #define PL_preambled (PL_parser->preambled)
71 #define PL_sublex_info (PL_parser->sublex_info)
72 #define PL_linestr (PL_parser->linestr)
73 #define PL_expect (PL_parser->expect)
74 #define PL_copline (PL_parser->copline)
75 #define PL_bufptr (PL_parser->bufptr)
76 #define PL_oldbufptr (PL_parser->oldbufptr)
77 #define PL_oldoldbufptr (PL_parser->oldoldbufptr)
78 #define PL_linestart (PL_parser->linestart)
79 #define PL_bufend (PL_parser->bufend)
80 #define PL_last_uni (PL_parser->last_uni)
81 #define PL_last_lop (PL_parser->last_lop)
82 #define PL_last_lop_op (PL_parser->last_lop_op)
83 #define PL_lex_state (PL_parser->lex_state)
84 #define PL_rsfp (PL_parser->rsfp)
85 #define PL_rsfp_filters (PL_parser->rsfp_filters)
86 #define PL_in_my (PL_parser->in_my)
87 #define PL_in_my_stash (PL_parser->in_my_stash)
88 #define PL_tokenbuf (PL_parser->tokenbuf)
89 #define PL_multi_end (PL_parser->multi_end)
90 #define PL_error_count (PL_parser->error_count)
93 # define PL_endwhite (PL_parser->endwhite)
94 # define PL_faketokens (PL_parser->faketokens)
95 # define PL_lasttoke (PL_parser->lasttoke)
96 # define PL_nextwhite (PL_parser->nextwhite)
97 # define PL_realtokenstart (PL_parser->realtokenstart)
98 # define PL_skipwhite (PL_parser->skipwhite)
99 # define PL_thisclose (PL_parser->thisclose)
100 # define PL_thismad (PL_parser->thismad)
101 # define PL_thisopen (PL_parser->thisopen)
102 # define PL_thisstuff (PL_parser->thisstuff)
103 # define PL_thistoken (PL_parser->thistoken)
104 # define PL_thiswhite (PL_parser->thiswhite)
105 # define PL_thiswhite (PL_parser->thiswhite)
106 # define PL_nexttoke (PL_parser->nexttoke)
107 # define PL_curforce (PL_parser->curforce)
109 # define PL_nexttoke (PL_parser->nexttoke)
110 # define PL_nexttype (PL_parser->nexttype)
111 # define PL_nextval (PL_parser->nextval)
114 /* This can't be done with embed.fnc, because struct yy_parser contains a
115 member named pending_ident, which clashes with the generated #define */
117 S_pending_ident(pTHX);
119 static const char ident_too_long[] = "Identifier too long";
122 # define CURMAD(slot,sv) if (PL_madskills) { curmad(slot,sv); sv = 0; }
123 # define NEXTVAL_NEXTTOKE PL_nexttoke[PL_curforce].next_val
125 # define CURMAD(slot,sv)
126 # define NEXTVAL_NEXTTOKE PL_nextval[PL_nexttoke]
129 #define XENUMMASK 0x3f
130 #define XFAKEEOF 0x40
131 #define XFAKEBRACK 0x80
133 #ifdef USE_UTF8_SCRIPTS
134 # define UTF (!IN_BYTES)
136 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || ( !(PL_parser->lex_flags & LEX_IGNORE_UTF8_HINTS) && (PL_hints & HINT_UTF8)))
139 /* The maximum number of characters preceding the unrecognized one to display */
140 #define UNRECOGNIZED_PRECEDE_COUNT 10
142 /* In variables named $^X, these are the legal values for X.
143 * 1999-02-27 mjd-perl-patch@plover.com */
144 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
146 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
148 /* LEX_* are values for PL_lex_state, the state of the lexer.
149 * They are arranged oddly so that the guard on the switch statement
150 * can get by with a single comparison (if the compiler is smart enough).
152 * These values refer to the various states within a sublex parse,
153 * i.e. within a double quotish string
156 /* #define LEX_NOTPARSING 11 is done in perl.h. */
158 #define LEX_NORMAL 10 /* normal code (ie not within "...") */
159 #define LEX_INTERPNORMAL 9 /* code within a string, eg "$foo[$x+1]" */
160 #define LEX_INTERPCASEMOD 8 /* expecting a \U, \Q or \E etc */
161 #define LEX_INTERPPUSH 7 /* starting a new sublex parse level */
162 #define LEX_INTERPSTART 6 /* expecting the start of a $var */
164 /* at end of code, eg "$x" followed by: */
165 #define LEX_INTERPEND 5 /* ... eg not one of [, { or -> */
166 #define LEX_INTERPENDMAYBE 4 /* ... eg one of [, { or -> */
168 #define LEX_INTERPCONCAT 3 /* expecting anything, eg at start of
169 string or after \E, $foo, etc */
170 #define LEX_INTERPCONST 2 /* NOT USED */
171 #define LEX_FORMLINE 1 /* expecting a format line */
172 #define LEX_KNOWNEXT 0 /* next token known; just return it */
176 static const char* const lex_state_names[] = {
195 #include "keywords.h"
197 /* CLINE is a macro that ensures PL_copline has a sane value */
202 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
205 # define SKIPSPACE0(s) skipspace0(s)
206 # define SKIPSPACE1(s) skipspace1(s)
207 # define SKIPSPACE2(s,tsv) skipspace2(s,&tsv)
208 # define PEEKSPACE(s) skipspace2(s,0)
210 # define SKIPSPACE0(s) skipspace(s)
211 # define SKIPSPACE1(s) skipspace(s)
212 # define SKIPSPACE2(s,tsv) skipspace(s)
213 # define PEEKSPACE(s) skipspace(s)
217 * Convenience functions to return different tokens and prime the
218 * lexer for the next token. They all take an argument.
220 * TOKEN : generic token (used for '(', DOLSHARP, etc)
221 * OPERATOR : generic operator
222 * AOPERATOR : assignment operator
223 * PREBLOCK : beginning the block after an if, while, foreach, ...
224 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
225 * PREREF : *EXPR where EXPR is not a simple identifier
226 * TERM : expression term
227 * LOOPX : loop exiting command (goto, last, dump, etc)
228 * FTST : file test operator
229 * FUN0 : zero-argument function
230 * FUN0OP : zero-argument function, with its op created in this file
231 * FUN1 : not used, except for not, which isn't a UNIOP
232 * BOop : bitwise or or xor
234 * SHop : shift operator
235 * PWop : power operator
236 * PMop : pattern-matching operator
237 * Aop : addition-level operator
238 * Mop : multiplication-level operator
239 * Eop : equality-testing operator
240 * Rop : relational operator <= != gt
242 * Also see LOP and lop() below.
245 #ifdef DEBUGGING /* Serve -DT. */
246 # define REPORT(retval) tokereport((I32)retval, &pl_yylval)
248 # define REPORT(retval) (retval)
251 #define TOKEN(retval) return ( PL_bufptr = s, REPORT(retval))
252 #define OPERATOR(retval) return (PL_expect = XTERM, PL_bufptr = s, REPORT(retval))
253 #define AOPERATOR(retval) return ao((PL_expect = XTERM, PL_bufptr = s, REPORT(retval)))
254 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s, REPORT(retval))
255 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s, REPORT(retval))
256 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s, REPORT(retval))
257 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR, PL_bufptr = s, REPORT(retval))
258 #define LOOPX(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)LOOPEX))
259 #define FTST(f) return (pl_yylval.ival=f, PL_expect=XTERMORDORDOR, PL_bufptr=s, REPORT((int)UNIOP))
260 #define FUN0(f) return (pl_yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC0))
261 #define FUN0OP(f) return (pl_yylval.opval=f, CLINE, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC0OP))
262 #define FUN1(f) return (pl_yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC1))
263 #define BOop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITOROP)))
264 #define BAop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITANDOP)))
265 #define SHop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)SHIFTOP)))
266 #define PWop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)POWOP)))
267 #define PMop(f) return(pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MATCHOP))
268 #define Aop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)ADDOP)))
269 #define Mop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MULOP)))
270 #define Eop(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)EQOP))
271 #define Rop(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)RELOP))
273 /* This bit of chicanery makes a unary function followed by
274 * a parenthesis into a function with one argument, highest precedence.
275 * The UNIDOR macro is for unary functions that can be followed by the //
276 * operator (such as C<shift // 0>).
278 #define UNI3(f,x,have_x) { \
279 pl_yylval.ival = f; \
280 if (have_x) PL_expect = x; \
282 PL_last_uni = PL_oldbufptr; \
283 PL_last_lop_op = f; \
285 return REPORT( (int)FUNC1 ); \
287 return REPORT( *s=='(' ? (int)FUNC1 : (int)UNIOP ); \
289 #define UNI(f) UNI3(f,XTERM,1)
290 #define UNIDOR(f) UNI3(f,XTERMORDORDOR,1)
291 #define UNIPROTO(f,optional) { \
292 if (optional) PL_last_uni = PL_oldbufptr; \
296 #define UNIBRACK(f) UNI3(f,0,0)
298 /* grandfather return to old style */
301 if (!PL_lex_allbrackets && PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC) \
302 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC; \
303 pl_yylval.ival = (f); \
311 /* how to interpret the pl_yylval associated with the token */
315 TOKENTYPE_OPNUM, /* pl_yylval.ival contains an opcode number */
321 static struct debug_tokens {
323 enum token_type type;
325 } const debug_tokens[] =
327 { ADDOP, TOKENTYPE_OPNUM, "ADDOP" },
328 { ANDAND, TOKENTYPE_NONE, "ANDAND" },
329 { ANDOP, TOKENTYPE_NONE, "ANDOP" },
330 { ANONSUB, TOKENTYPE_IVAL, "ANONSUB" },
331 { ARROW, TOKENTYPE_NONE, "ARROW" },
332 { ASSIGNOP, TOKENTYPE_OPNUM, "ASSIGNOP" },
333 { BITANDOP, TOKENTYPE_OPNUM, "BITANDOP" },
334 { BITOROP, TOKENTYPE_OPNUM, "BITOROP" },
335 { COLONATTR, TOKENTYPE_NONE, "COLONATTR" },
336 { CONTINUE, TOKENTYPE_NONE, "CONTINUE" },
337 { DEFAULT, TOKENTYPE_NONE, "DEFAULT" },
338 { DO, TOKENTYPE_NONE, "DO" },
339 { DOLSHARP, TOKENTYPE_NONE, "DOLSHARP" },
340 { DORDOR, TOKENTYPE_NONE, "DORDOR" },
341 { DOROP, TOKENTYPE_OPNUM, "DOROP" },
342 { DOTDOT, TOKENTYPE_IVAL, "DOTDOT" },
343 { ELSE, TOKENTYPE_NONE, "ELSE" },
344 { ELSIF, TOKENTYPE_IVAL, "ELSIF" },
345 { EQOP, TOKENTYPE_OPNUM, "EQOP" },
346 { FOR, TOKENTYPE_IVAL, "FOR" },
347 { FORMAT, TOKENTYPE_NONE, "FORMAT" },
348 { FUNC, TOKENTYPE_OPNUM, "FUNC" },
349 { FUNC0, TOKENTYPE_OPNUM, "FUNC0" },
350 { FUNC0OP, TOKENTYPE_OPVAL, "FUNC0OP" },
351 { FUNC0SUB, TOKENTYPE_OPVAL, "FUNC0SUB" },
352 { FUNC1, TOKENTYPE_OPNUM, "FUNC1" },
353 { FUNCMETH, TOKENTYPE_OPVAL, "FUNCMETH" },
354 { GIVEN, TOKENTYPE_IVAL, "GIVEN" },
355 { HASHBRACK, TOKENTYPE_NONE, "HASHBRACK" },
356 { IF, TOKENTYPE_IVAL, "IF" },
357 { LABEL, TOKENTYPE_OPVAL, "LABEL" },
358 { LOCAL, TOKENTYPE_IVAL, "LOCAL" },
359 { LOOPEX, TOKENTYPE_OPNUM, "LOOPEX" },
360 { LSTOP, TOKENTYPE_OPNUM, "LSTOP" },
361 { LSTOPSUB, TOKENTYPE_OPVAL, "LSTOPSUB" },
362 { MATCHOP, TOKENTYPE_OPNUM, "MATCHOP" },
363 { METHOD, TOKENTYPE_OPVAL, "METHOD" },
364 { MULOP, TOKENTYPE_OPNUM, "MULOP" },
365 { MY, TOKENTYPE_IVAL, "MY" },
366 { MYSUB, TOKENTYPE_NONE, "MYSUB" },
367 { NOAMP, TOKENTYPE_NONE, "NOAMP" },
368 { NOTOP, TOKENTYPE_NONE, "NOTOP" },
369 { OROP, TOKENTYPE_IVAL, "OROP" },
370 { OROR, TOKENTYPE_NONE, "OROR" },
371 { PACKAGE, TOKENTYPE_NONE, "PACKAGE" },
372 { PLUGEXPR, TOKENTYPE_OPVAL, "PLUGEXPR" },
373 { PLUGSTMT, TOKENTYPE_OPVAL, "PLUGSTMT" },
374 { PMFUNC, TOKENTYPE_OPVAL, "PMFUNC" },
375 { POSTDEC, TOKENTYPE_NONE, "POSTDEC" },
376 { POSTINC, TOKENTYPE_NONE, "POSTINC" },
377 { POWOP, TOKENTYPE_OPNUM, "POWOP" },
378 { PREDEC, TOKENTYPE_NONE, "PREDEC" },
379 { PREINC, TOKENTYPE_NONE, "PREINC" },
380 { PRIVATEREF, TOKENTYPE_OPVAL, "PRIVATEREF" },
381 { REFGEN, TOKENTYPE_NONE, "REFGEN" },
382 { RELOP, TOKENTYPE_OPNUM, "RELOP" },
383 { SHIFTOP, TOKENTYPE_OPNUM, "SHIFTOP" },
384 { SUB, TOKENTYPE_NONE, "SUB" },
385 { THING, TOKENTYPE_OPVAL, "THING" },
386 { UMINUS, TOKENTYPE_NONE, "UMINUS" },
387 { UNIOP, TOKENTYPE_OPNUM, "UNIOP" },
388 { UNIOPSUB, TOKENTYPE_OPVAL, "UNIOPSUB" },
389 { UNLESS, TOKENTYPE_IVAL, "UNLESS" },
390 { UNTIL, TOKENTYPE_IVAL, "UNTIL" },
391 { USE, TOKENTYPE_IVAL, "USE" },
392 { WHEN, TOKENTYPE_IVAL, "WHEN" },
393 { WHILE, TOKENTYPE_IVAL, "WHILE" },
394 { WORD, TOKENTYPE_OPVAL, "WORD" },
395 { YADAYADA, TOKENTYPE_IVAL, "YADAYADA" },
396 { 0, TOKENTYPE_NONE, NULL }
399 /* dump the returned token in rv, plus any optional arg in pl_yylval */
402 S_tokereport(pTHX_ I32 rv, const YYSTYPE* lvalp)
406 PERL_ARGS_ASSERT_TOKEREPORT;
409 const char *name = NULL;
410 enum token_type type = TOKENTYPE_NONE;
411 const struct debug_tokens *p;
412 SV* const report = newSVpvs("<== ");
414 for (p = debug_tokens; p->token; p++) {
415 if (p->token == (int)rv) {
422 Perl_sv_catpv(aTHX_ report, name);
423 else if ((char)rv > ' ' && (char)rv < '~')
424 Perl_sv_catpvf(aTHX_ report, "'%c'", (char)rv);
426 sv_catpvs(report, "EOF");
428 Perl_sv_catpvf(aTHX_ report, "?? %"IVdf, (IV)rv);
431 case TOKENTYPE_GVVAL: /* doesn't appear to be used */
434 Perl_sv_catpvf(aTHX_ report, "(ival=%"IVdf")", (IV)lvalp->ival);
436 case TOKENTYPE_OPNUM:
437 Perl_sv_catpvf(aTHX_ report, "(ival=op_%s)",
438 PL_op_name[lvalp->ival]);
441 Perl_sv_catpvf(aTHX_ report, "(pval=\"%s\")", lvalp->pval);
443 case TOKENTYPE_OPVAL:
445 Perl_sv_catpvf(aTHX_ report, "(opval=op_%s)",
446 PL_op_name[lvalp->opval->op_type]);
447 if (lvalp->opval->op_type == OP_CONST) {
448 Perl_sv_catpvf(aTHX_ report, " %s",
449 SvPEEK(cSVOPx_sv(lvalp->opval)));
454 sv_catpvs(report, "(opval=null)");
457 PerlIO_printf(Perl_debug_log, "### %s\n\n", SvPV_nolen_const(report));
463 /* print the buffer with suitable escapes */
466 S_printbuf(pTHX_ const char *const fmt, const char *const s)
468 SV* const tmp = newSVpvs("");
470 PERL_ARGS_ASSERT_PRINTBUF;
472 PerlIO_printf(Perl_debug_log, fmt, pv_display(tmp, s, strlen(s), 0, 60));
479 S_deprecate_commaless_var_list(pTHX) {
481 deprecate("comma-less variable list");
482 return REPORT(','); /* grandfather non-comma-format format */
488 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
489 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
493 S_ao(pTHX_ int toketype)
496 if (*PL_bufptr == '=') {
498 if (toketype == ANDAND)
499 pl_yylval.ival = OP_ANDASSIGN;
500 else if (toketype == OROR)
501 pl_yylval.ival = OP_ORASSIGN;
502 else if (toketype == DORDOR)
503 pl_yylval.ival = OP_DORASSIGN;
511 * When Perl expects an operator and finds something else, no_op
512 * prints the warning. It always prints "<something> found where
513 * operator expected. It prints "Missing semicolon on previous line?"
514 * if the surprise occurs at the start of the line. "do you need to
515 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
516 * where the compiler doesn't know if foo is a method call or a function.
517 * It prints "Missing operator before end of line" if there's nothing
518 * after the missing operator, or "... before <...>" if there is something
519 * after the missing operator.
523 S_no_op(pTHX_ const char *const what, char *s)
526 char * const oldbp = PL_bufptr;
527 const bool is_first = (PL_oldbufptr == PL_linestart);
529 PERL_ARGS_ASSERT_NO_OP;
535 yywarn(Perl_form(aTHX_ "%s found where operator expected", what), UTF ? SVf_UTF8 : 0);
536 if (ckWARN_d(WARN_SYNTAX)) {
538 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
539 "\t(Missing semicolon on previous line?)\n");
540 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
542 for (t = PL_oldoldbufptr; (isALNUM_lazy_if(t,UTF) || *t == ':');
543 t += UTF ? UTF8SKIP(t) : 1)
545 if (t < PL_bufptr && isSPACE(*t))
546 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
547 "\t(Do you need to predeclare %"SVf"?)\n",
548 SVfARG(newSVpvn_flags(PL_oldoldbufptr, (STRLEN)(t - PL_oldoldbufptr),
549 SVs_TEMP | (UTF ? SVf_UTF8 : 0))));
553 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
554 "\t(Missing operator before %"SVf"?)\n",
555 SVfARG(newSVpvn_flags(oldbp, (STRLEN)(s - oldbp),
556 SVs_TEMP | (UTF ? SVf_UTF8 : 0))));
564 * Complain about missing quote/regexp/heredoc terminator.
565 * If it's called with NULL then it cauterizes the line buffer.
566 * If we're in a delimited string and the delimiter is a control
567 * character, it's reformatted into a two-char sequence like ^C.
572 S_missingterm(pTHX_ char *s)
578 char * const nl = strrchr(s,'\n');
582 else if (isCNTRL(PL_multi_close)) {
584 tmpbuf[1] = (char)toCTRL(PL_multi_close);
589 *tmpbuf = (char)PL_multi_close;
593 q = strchr(s,'"') ? '\'' : '"';
594 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
600 * Check whether the named feature is enabled.
603 Perl_feature_is_enabled(pTHX_ const char *const name, STRLEN namelen)
606 char he_name[8 + MAX_FEATURE_LEN] = "feature_";
608 PERL_ARGS_ASSERT_FEATURE_IS_ENABLED;
610 assert(CURRENT_FEATURE_BUNDLE == FEATURE_BUNDLE_CUSTOM);
612 if (namelen > MAX_FEATURE_LEN)
614 memcpy(&he_name[8], name, namelen);
616 return cBOOL(cop_hints_fetch_pvn(PL_curcop, he_name, 8 + namelen, 0,
617 REFCOUNTED_HE_EXISTS));
621 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
622 * utf16-to-utf8-reversed.
625 #ifdef PERL_CR_FILTER
629 register const char *s = SvPVX_const(sv);
630 register const char * const e = s + SvCUR(sv);
632 PERL_ARGS_ASSERT_STRIP_RETURN;
634 /* outer loop optimized to do nothing if there are no CR-LFs */
636 if (*s++ == '\r' && *s == '\n') {
637 /* hit a CR-LF, need to copy the rest */
638 register char *d = s - 1;
641 if (*s == '\r' && s[1] == '\n')
652 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
654 const I32 count = FILTER_READ(idx+1, sv, maxlen);
655 if (count > 0 && !maxlen)
662 =for apidoc Amx|void|lex_start|SV *line|PerlIO *rsfp|U32 flags
664 Creates and initialises a new lexer/parser state object, supplying
665 a context in which to lex and parse from a new source of Perl code.
666 A pointer to the new state object is placed in L</PL_parser>. An entry
667 is made on the save stack so that upon unwinding the new state object
668 will be destroyed and the former value of L</PL_parser> will be restored.
669 Nothing else need be done to clean up the parsing context.
671 The code to be parsed comes from I<line> and I<rsfp>. I<line>, if
672 non-null, provides a string (in SV form) containing code to be parsed.
673 A copy of the string is made, so subsequent modification of I<line>
674 does not affect parsing. I<rsfp>, if non-null, provides an input stream
675 from which code will be read to be parsed. If both are non-null, the
676 code in I<line> comes first and must consist of complete lines of input,
677 and I<rsfp> supplies the remainder of the source.
679 The I<flags> parameter is reserved for future use. Currently it is only
680 used by perl internally, so extensions should always pass zero.
685 /* LEX_START_SAME_FILTER indicates that this is not a new file, so it
686 can share filters with the current parser.
687 LEX_START_DONT_CLOSE indicates that the file handle wasn't opened by the
688 caller, hence isn't owned by the parser, so shouldn't be closed on parser
689 destruction. This is used to handle the case of defaulting to reading the
690 script from the standard input because no filename was given on the command
691 line (without getting confused by situation where STDIN has been closed, so
692 the script handle is opened on fd 0) */
695 Perl_lex_start(pTHX_ SV *line, PerlIO *rsfp, U32 flags)
698 const char *s = NULL;
699 yy_parser *parser, *oparser;
700 if (flags && flags & ~LEX_START_FLAGS)
701 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_start");
703 /* create and initialise a parser */
705 Newxz(parser, 1, yy_parser);
706 parser->old_parser = oparser = PL_parser;
709 parser->stack = NULL;
711 parser->stack_size = 0;
713 /* on scope exit, free this parser and restore any outer one */
715 parser->saved_curcop = PL_curcop;
717 /* initialise lexer state */
720 parser->curforce = -1;
722 parser->nexttoke = 0;
724 parser->error_count = oparser ? oparser->error_count : 0;
725 parser->copline = NOLINE;
726 parser->lex_state = LEX_NORMAL;
727 parser->expect = XSTATE;
729 parser->rsfp_filters =
730 !(flags & LEX_START_SAME_FILTER) || !oparser
732 : MUTABLE_AV(SvREFCNT_inc(
733 oparser->rsfp_filters
734 ? oparser->rsfp_filters
735 : (oparser->rsfp_filters = newAV())
738 Newx(parser->lex_brackstack, 120, char);
739 Newx(parser->lex_casestack, 12, char);
740 *parser->lex_casestack = '\0';
744 s = SvPV_const(line, len);
745 parser->linestr = flags & LEX_START_COPIED
746 ? SvREFCNT_inc_simple_NN(line)
747 : newSVpvn_flags(s, len, SvUTF8(line));
748 if (!len || s[len-1] != ';')
749 sv_catpvs(parser->linestr, "\n;");
751 parser->linestr = newSVpvs("\n;");
753 parser->oldoldbufptr =
756 parser->linestart = SvPVX(parser->linestr);
757 parser->bufend = parser->bufptr + SvCUR(parser->linestr);
758 parser->last_lop = parser->last_uni = NULL;
759 parser->lex_flags = flags & (LEX_IGNORE_UTF8_HINTS|LEX_EVALBYTES
760 |LEX_DONT_CLOSE_RSFP);
762 parser->in_pod = parser->filtered = 0;
766 /* delete a parser object */
769 Perl_parser_free(pTHX_ const yy_parser *parser)
771 PERL_ARGS_ASSERT_PARSER_FREE;
773 PL_curcop = parser->saved_curcop;
774 SvREFCNT_dec(parser->linestr);
776 if (PL_parser->lex_flags & LEX_DONT_CLOSE_RSFP)
777 PerlIO_clearerr(parser->rsfp);
778 else if (parser->rsfp && (!parser->old_parser ||
779 (parser->old_parser && parser->rsfp != parser->old_parser->rsfp)))
780 PerlIO_close(parser->rsfp);
781 SvREFCNT_dec(parser->rsfp_filters);
783 Safefree(parser->lex_brackstack);
784 Safefree(parser->lex_casestack);
785 PL_parser = parser->old_parser;
791 =for apidoc AmxU|SV *|PL_parser-E<gt>linestr
793 Buffer scalar containing the chunk currently under consideration of the
794 text currently being lexed. This is always a plain string scalar (for
795 which C<SvPOK> is true). It is not intended to be used as a scalar by
796 normal scalar means; instead refer to the buffer directly by the pointer
797 variables described below.
799 The lexer maintains various C<char*> pointers to things in the
800 C<PL_parser-E<gt>linestr> buffer. If C<PL_parser-E<gt>linestr> is ever
801 reallocated, all of these pointers must be updated. Don't attempt to
802 do this manually, but rather use L</lex_grow_linestr> if you need to
803 reallocate the buffer.
805 The content of the text chunk in the buffer is commonly exactly one
806 complete line of input, up to and including a newline terminator,
807 but there are situations where it is otherwise. The octets of the
808 buffer may be intended to be interpreted as either UTF-8 or Latin-1.
809 The function L</lex_bufutf8> tells you which. Do not use the C<SvUTF8>
810 flag on this scalar, which may disagree with it.
812 For direct examination of the buffer, the variable
813 L</PL_parser-E<gt>bufend> points to the end of the buffer. The current
814 lexing position is pointed to by L</PL_parser-E<gt>bufptr>. Direct use
815 of these pointers is usually preferable to examination of the scalar
816 through normal scalar means.
818 =for apidoc AmxU|char *|PL_parser-E<gt>bufend
820 Direct pointer to the end of the chunk of text currently being lexed, the
821 end of the lexer buffer. This is equal to C<SvPVX(PL_parser-E<gt>linestr)
822 + SvCUR(PL_parser-E<gt>linestr)>. A NUL character (zero octet) is
823 always located at the end of the buffer, and does not count as part of
824 the buffer's contents.
826 =for apidoc AmxU|char *|PL_parser-E<gt>bufptr
828 Points to the current position of lexing inside the lexer buffer.
829 Characters around this point may be freely examined, within
830 the range delimited by C<SvPVX(L</PL_parser-E<gt>linestr>)> and
831 L</PL_parser-E<gt>bufend>. The octets of the buffer may be intended to be
832 interpreted as either UTF-8 or Latin-1, as indicated by L</lex_bufutf8>.
834 Lexing code (whether in the Perl core or not) moves this pointer past
835 the characters that it consumes. It is also expected to perform some
836 bookkeeping whenever a newline character is consumed. This movement
837 can be more conveniently performed by the function L</lex_read_to>,
838 which handles newlines appropriately.
840 Interpretation of the buffer's octets can be abstracted out by
841 using the slightly higher-level functions L</lex_peek_unichar> and
842 L</lex_read_unichar>.
844 =for apidoc AmxU|char *|PL_parser-E<gt>linestart
846 Points to the start of the current line inside the lexer buffer.
847 This is useful for indicating at which column an error occurred, and
848 not much else. This must be updated by any lexing code that consumes
849 a newline; the function L</lex_read_to> handles this detail.
855 =for apidoc Amx|bool|lex_bufutf8
857 Indicates whether the octets in the lexer buffer
858 (L</PL_parser-E<gt>linestr>) should be interpreted as the UTF-8 encoding
859 of Unicode characters. If not, they should be interpreted as Latin-1
860 characters. This is analogous to the C<SvUTF8> flag for scalars.
862 In UTF-8 mode, it is not guaranteed that the lexer buffer actually
863 contains valid UTF-8. Lexing code must be robust in the face of invalid
866 The actual C<SvUTF8> flag of the L</PL_parser-E<gt>linestr> scalar
867 is significant, but not the whole story regarding the input character
868 encoding. Normally, when a file is being read, the scalar contains octets
869 and its C<SvUTF8> flag is off, but the octets should be interpreted as
870 UTF-8 if the C<use utf8> pragma is in effect. During a string eval,
871 however, the scalar may have the C<SvUTF8> flag on, and in this case its
872 octets should be interpreted as UTF-8 unless the C<use bytes> pragma
873 is in effect. This logic may change in the future; use this function
874 instead of implementing the logic yourself.
880 Perl_lex_bufutf8(pTHX)
886 =for apidoc Amx|char *|lex_grow_linestr|STRLEN len
888 Reallocates the lexer buffer (L</PL_parser-E<gt>linestr>) to accommodate
889 at least I<len> octets (including terminating NUL). Returns a
890 pointer to the reallocated buffer. This is necessary before making
891 any direct modification of the buffer that would increase its length.
892 L</lex_stuff_pvn> provides a more convenient way to insert text into
895 Do not use C<SvGROW> or C<sv_grow> directly on C<PL_parser-E<gt>linestr>;
896 this function updates all of the lexer's variables that point directly
903 Perl_lex_grow_linestr(pTHX_ STRLEN len)
907 STRLEN bufend_pos, bufptr_pos, oldbufptr_pos, oldoldbufptr_pos;
908 STRLEN linestart_pos, last_uni_pos, last_lop_pos, re_eval_start_pos;
909 linestr = PL_parser->linestr;
910 buf = SvPVX(linestr);
911 if (len <= SvLEN(linestr))
913 bufend_pos = PL_parser->bufend - buf;
914 bufptr_pos = PL_parser->bufptr - buf;
915 oldbufptr_pos = PL_parser->oldbufptr - buf;
916 oldoldbufptr_pos = PL_parser->oldoldbufptr - buf;
917 linestart_pos = PL_parser->linestart - buf;
918 last_uni_pos = PL_parser->last_uni ? PL_parser->last_uni - buf : 0;
919 last_lop_pos = PL_parser->last_lop ? PL_parser->last_lop - buf : 0;
920 re_eval_start_pos = PL_sublex_info.re_eval_start ?
921 PL_sublex_info.re_eval_start - buf : 0;
923 buf = sv_grow(linestr, len);
925 PL_parser->bufend = buf + bufend_pos;
926 PL_parser->bufptr = buf + bufptr_pos;
927 PL_parser->oldbufptr = buf + oldbufptr_pos;
928 PL_parser->oldoldbufptr = buf + oldoldbufptr_pos;
929 PL_parser->linestart = buf + linestart_pos;
930 if (PL_parser->last_uni)
931 PL_parser->last_uni = buf + last_uni_pos;
932 if (PL_parser->last_lop)
933 PL_parser->last_lop = buf + last_lop_pos;
934 if (PL_sublex_info.re_eval_start)
935 PL_sublex_info.re_eval_start = buf + re_eval_start_pos;
940 =for apidoc Amx|void|lex_stuff_pvn|const char *pv|STRLEN len|U32 flags
942 Insert characters into the lexer buffer (L</PL_parser-E<gt>linestr>),
943 immediately after the current lexing point (L</PL_parser-E<gt>bufptr>),
944 reallocating the buffer if necessary. This means that lexing code that
945 runs later will see the characters as if they had appeared in the input.
946 It is not recommended to do this as part of normal parsing, and most
947 uses of this facility run the risk of the inserted characters being
948 interpreted in an unintended manner.
950 The string to be inserted is represented by I<len> octets starting
951 at I<pv>. These octets are interpreted as either UTF-8 or Latin-1,
952 according to whether the C<LEX_STUFF_UTF8> flag is set in I<flags>.
953 The characters are recoded for the lexer buffer, according to how the
954 buffer is currently being interpreted (L</lex_bufutf8>). If a string
955 to be inserted is available as a Perl scalar, the L</lex_stuff_sv>
956 function is more convenient.
962 Perl_lex_stuff_pvn(pTHX_ const char *pv, STRLEN len, U32 flags)
966 PERL_ARGS_ASSERT_LEX_STUFF_PVN;
967 if (flags & ~(LEX_STUFF_UTF8))
968 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_stuff_pvn");
970 if (flags & LEX_STUFF_UTF8) {
974 const char *p, *e = pv+len;
975 for (p = pv; p != e; p++)
976 highhalf += !!(((U8)*p) & 0x80);
979 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len+highhalf);
980 bufptr = PL_parser->bufptr;
981 Move(bufptr, bufptr+len+highhalf, PL_parser->bufend+1-bufptr, char);
982 SvCUR_set(PL_parser->linestr,
983 SvCUR(PL_parser->linestr) + len+highhalf);
984 PL_parser->bufend += len+highhalf;
985 for (p = pv; p != e; p++) {
988 *bufptr++ = (char)(0xc0 | (c >> 6));
989 *bufptr++ = (char)(0x80 | (c & 0x3f));
996 if (flags & LEX_STUFF_UTF8) {
998 const char *p, *e = pv+len;
999 for (p = pv; p != e; p++) {
1002 Perl_croak(aTHX_ "Lexing code attempted to stuff "
1003 "non-Latin-1 character into Latin-1 input");
1004 } else if (c >= 0xc2 && p+1 != e &&
1005 (((U8)p[1]) & 0xc0) == 0x80) {
1008 } else if (c >= 0x80) {
1009 /* malformed UTF-8 */
1011 SAVESPTR(PL_warnhook);
1012 PL_warnhook = PERL_WARNHOOK_FATAL;
1013 utf8n_to_uvuni((U8*)p, e-p, NULL, 0);
1019 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len-highhalf);
1020 bufptr = PL_parser->bufptr;
1021 Move(bufptr, bufptr+len-highhalf, PL_parser->bufend+1-bufptr, char);
1022 SvCUR_set(PL_parser->linestr,
1023 SvCUR(PL_parser->linestr) + len-highhalf);
1024 PL_parser->bufend += len-highhalf;
1025 for (p = pv; p != e; p++) {
1028 *bufptr++ = (char)(((c & 0x3) << 6) | (p[1] & 0x3f));
1031 *bufptr++ = (char)c;
1036 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len);
1037 bufptr = PL_parser->bufptr;
1038 Move(bufptr, bufptr+len, PL_parser->bufend+1-bufptr, char);
1039 SvCUR_set(PL_parser->linestr, SvCUR(PL_parser->linestr) + len);
1040 PL_parser->bufend += len;
1041 Copy(pv, bufptr, len, char);
1047 =for apidoc Amx|void|lex_stuff_pv|const char *pv|U32 flags
1049 Insert characters into the lexer buffer (L</PL_parser-E<gt>linestr>),
1050 immediately after the current lexing point (L</PL_parser-E<gt>bufptr>),
1051 reallocating the buffer if necessary. This means that lexing code that
1052 runs later will see the characters as if they had appeared in the input.
1053 It is not recommended to do this as part of normal parsing, and most
1054 uses of this facility run the risk of the inserted characters being
1055 interpreted in an unintended manner.
1057 The string to be inserted is represented by octets starting at I<pv>
1058 and continuing to the first nul. These octets are interpreted as either
1059 UTF-8 or Latin-1, according to whether the C<LEX_STUFF_UTF8> flag is set
1060 in I<flags>. The characters are recoded for the lexer buffer, according
1061 to how the buffer is currently being interpreted (L</lex_bufutf8>).
1062 If it is not convenient to nul-terminate a string to be inserted, the
1063 L</lex_stuff_pvn> function is more appropriate.
1069 Perl_lex_stuff_pv(pTHX_ const char *pv, U32 flags)
1071 PERL_ARGS_ASSERT_LEX_STUFF_PV;
1072 lex_stuff_pvn(pv, strlen(pv), flags);
1076 =for apidoc Amx|void|lex_stuff_sv|SV *sv|U32 flags
1078 Insert characters into the lexer buffer (L</PL_parser-E<gt>linestr>),
1079 immediately after the current lexing point (L</PL_parser-E<gt>bufptr>),
1080 reallocating the buffer if necessary. This means that lexing code that
1081 runs later will see the characters as if they had appeared in the input.
1082 It is not recommended to do this as part of normal parsing, and most
1083 uses of this facility run the risk of the inserted characters being
1084 interpreted in an unintended manner.
1086 The string to be inserted is the string value of I<sv>. The characters
1087 are recoded for the lexer buffer, according to how the buffer is currently
1088 being interpreted (L</lex_bufutf8>). If a string to be inserted is
1089 not already a Perl scalar, the L</lex_stuff_pvn> function avoids the
1090 need to construct a scalar.
1096 Perl_lex_stuff_sv(pTHX_ SV *sv, U32 flags)
1100 PERL_ARGS_ASSERT_LEX_STUFF_SV;
1102 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_stuff_sv");
1104 lex_stuff_pvn(pv, len, flags | (SvUTF8(sv) ? LEX_STUFF_UTF8 : 0));
1108 =for apidoc Amx|void|lex_unstuff|char *ptr
1110 Discards text about to be lexed, from L</PL_parser-E<gt>bufptr> up to
1111 I<ptr>. Text following I<ptr> will be moved, and the buffer shortened.
1112 This hides the discarded text from any lexing code that runs later,
1113 as if the text had never appeared.
1115 This is not the normal way to consume lexed text. For that, use
1122 Perl_lex_unstuff(pTHX_ char *ptr)
1126 PERL_ARGS_ASSERT_LEX_UNSTUFF;
1127 buf = PL_parser->bufptr;
1129 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_unstuff");
1132 bufend = PL_parser->bufend;
1134 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_unstuff");
1135 unstuff_len = ptr - buf;
1136 Move(ptr, buf, bufend+1-ptr, char);
1137 SvCUR_set(PL_parser->linestr, SvCUR(PL_parser->linestr) - unstuff_len);
1138 PL_parser->bufend = bufend - unstuff_len;
1142 =for apidoc Amx|void|lex_read_to|char *ptr
1144 Consume text in the lexer buffer, from L</PL_parser-E<gt>bufptr> up
1145 to I<ptr>. This advances L</PL_parser-E<gt>bufptr> to match I<ptr>,
1146 performing the correct bookkeeping whenever a newline character is passed.
1147 This is the normal way to consume lexed text.
1149 Interpretation of the buffer's octets can be abstracted out by
1150 using the slightly higher-level functions L</lex_peek_unichar> and
1151 L</lex_read_unichar>.
1157 Perl_lex_read_to(pTHX_ char *ptr)
1160 PERL_ARGS_ASSERT_LEX_READ_TO;
1161 s = PL_parser->bufptr;
1162 if (ptr < s || ptr > PL_parser->bufend)
1163 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_to");
1164 for (; s != ptr; s++)
1166 CopLINE_inc(PL_curcop);
1167 PL_parser->linestart = s+1;
1169 PL_parser->bufptr = ptr;
1173 =for apidoc Amx|void|lex_discard_to|char *ptr
1175 Discards the first part of the L</PL_parser-E<gt>linestr> buffer,
1176 up to I<ptr>. The remaining content of the buffer will be moved, and
1177 all pointers into the buffer updated appropriately. I<ptr> must not
1178 be later in the buffer than the position of L</PL_parser-E<gt>bufptr>:
1179 it is not permitted to discard text that has yet to be lexed.
1181 Normally it is not necessarily to do this directly, because it suffices to
1182 use the implicit discarding behaviour of L</lex_next_chunk> and things
1183 based on it. However, if a token stretches across multiple lines,
1184 and the lexing code has kept multiple lines of text in the buffer for
1185 that purpose, then after completion of the token it would be wise to
1186 explicitly discard the now-unneeded earlier lines, to avoid future
1187 multi-line tokens growing the buffer without bound.
1193 Perl_lex_discard_to(pTHX_ char *ptr)
1197 PERL_ARGS_ASSERT_LEX_DISCARD_TO;
1198 buf = SvPVX(PL_parser->linestr);
1200 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_discard_to");
1203 if (ptr > PL_parser->bufptr)
1204 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_discard_to");
1205 discard_len = ptr - buf;
1206 if (PL_parser->oldbufptr < ptr)
1207 PL_parser->oldbufptr = ptr;
1208 if (PL_parser->oldoldbufptr < ptr)
1209 PL_parser->oldoldbufptr = ptr;
1210 if (PL_parser->last_uni && PL_parser->last_uni < ptr)
1211 PL_parser->last_uni = NULL;
1212 if (PL_parser->last_lop && PL_parser->last_lop < ptr)
1213 PL_parser->last_lop = NULL;
1214 Move(ptr, buf, PL_parser->bufend+1-ptr, char);
1215 SvCUR_set(PL_parser->linestr, SvCUR(PL_parser->linestr) - discard_len);
1216 PL_parser->bufend -= discard_len;
1217 PL_parser->bufptr -= discard_len;
1218 PL_parser->oldbufptr -= discard_len;
1219 PL_parser->oldoldbufptr -= discard_len;
1220 if (PL_parser->last_uni)
1221 PL_parser->last_uni -= discard_len;
1222 if (PL_parser->last_lop)
1223 PL_parser->last_lop -= discard_len;
1227 =for apidoc Amx|bool|lex_next_chunk|U32 flags
1229 Reads in the next chunk of text to be lexed, appending it to
1230 L</PL_parser-E<gt>linestr>. This should be called when lexing code has
1231 looked to the end of the current chunk and wants to know more. It is
1232 usual, but not necessary, for lexing to have consumed the entirety of
1233 the current chunk at this time.
1235 If L</PL_parser-E<gt>bufptr> is pointing to the very end of the current
1236 chunk (i.e., the current chunk has been entirely consumed), normally the
1237 current chunk will be discarded at the same time that the new chunk is
1238 read in. If I<flags> includes C<LEX_KEEP_PREVIOUS>, the current chunk
1239 will not be discarded. If the current chunk has not been entirely
1240 consumed, then it will not be discarded regardless of the flag.
1242 Returns true if some new text was added to the buffer, or false if the
1243 buffer has reached the end of the input text.
1248 #define LEX_FAKE_EOF 0x80000000
1251 Perl_lex_next_chunk(pTHX_ U32 flags)
1255 STRLEN old_bufend_pos, new_bufend_pos;
1256 STRLEN bufptr_pos, oldbufptr_pos, oldoldbufptr_pos;
1257 STRLEN linestart_pos, last_uni_pos, last_lop_pos;
1258 bool got_some_for_debugger = 0;
1260 if (flags & ~(LEX_KEEP_PREVIOUS|LEX_FAKE_EOF))
1261 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_next_chunk");
1262 linestr = PL_parser->linestr;
1263 buf = SvPVX(linestr);
1264 if (!(flags & LEX_KEEP_PREVIOUS) &&
1265 PL_parser->bufptr == PL_parser->bufend) {
1266 old_bufend_pos = bufptr_pos = oldbufptr_pos = oldoldbufptr_pos = 0;
1268 if (PL_parser->last_uni != PL_parser->bufend)
1269 PL_parser->last_uni = NULL;
1270 if (PL_parser->last_lop != PL_parser->bufend)
1271 PL_parser->last_lop = NULL;
1272 last_uni_pos = last_lop_pos = 0;
1276 old_bufend_pos = PL_parser->bufend - buf;
1277 bufptr_pos = PL_parser->bufptr - buf;
1278 oldbufptr_pos = PL_parser->oldbufptr - buf;
1279 oldoldbufptr_pos = PL_parser->oldoldbufptr - buf;
1280 linestart_pos = PL_parser->linestart - buf;
1281 last_uni_pos = PL_parser->last_uni ? PL_parser->last_uni - buf : 0;
1282 last_lop_pos = PL_parser->last_lop ? PL_parser->last_lop - buf : 0;
1284 if (flags & LEX_FAKE_EOF) {
1286 } else if (!PL_parser->rsfp && !PL_parser->filtered) {
1288 } else if (filter_gets(linestr, old_bufend_pos)) {
1290 got_some_for_debugger = 1;
1292 if (!SvPOK(linestr)) /* can get undefined by filter_gets */
1293 sv_setpvs(linestr, "");
1295 /* End of real input. Close filehandle (unless it was STDIN),
1296 * then add implicit termination.
1298 if (PL_parser->lex_flags & LEX_DONT_CLOSE_RSFP)
1299 PerlIO_clearerr(PL_parser->rsfp);
1300 else if (PL_parser->rsfp)
1301 (void)PerlIO_close(PL_parser->rsfp);
1302 PL_parser->rsfp = NULL;
1303 PL_parser->in_pod = PL_parser->filtered = 0;
1305 if (PL_madskills && !PL_in_eval && (PL_minus_p || PL_minus_n))
1308 if (!PL_in_eval && PL_minus_p) {
1310 /*{*/";}continue{print or die qq(-p destination: $!\\n);}");
1311 PL_minus_n = PL_minus_p = 0;
1312 } else if (!PL_in_eval && PL_minus_n) {
1313 sv_catpvs(linestr, /*{*/";}");
1316 sv_catpvs(linestr, ";");
1319 buf = SvPVX(linestr);
1320 new_bufend_pos = SvCUR(linestr);
1321 PL_parser->bufend = buf + new_bufend_pos;
1322 PL_parser->bufptr = buf + bufptr_pos;
1323 PL_parser->oldbufptr = buf + oldbufptr_pos;
1324 PL_parser->oldoldbufptr = buf + oldoldbufptr_pos;
1325 PL_parser->linestart = buf + linestart_pos;
1326 if (PL_parser->last_uni)
1327 PL_parser->last_uni = buf + last_uni_pos;
1328 if (PL_parser->last_lop)
1329 PL_parser->last_lop = buf + last_lop_pos;
1330 if (got_some_for_debugger && (PERLDB_LINE || PERLDB_SAVESRC) &&
1331 PL_curstash != PL_debstash) {
1332 /* debugger active and we're not compiling the debugger code,
1333 * so store the line into the debugger's array of lines
1335 update_debugger_info(NULL, buf+old_bufend_pos,
1336 new_bufend_pos-old_bufend_pos);
1342 =for apidoc Amx|I32|lex_peek_unichar|U32 flags
1344 Looks ahead one (Unicode) character in the text currently being lexed.
1345 Returns the codepoint (unsigned integer value) of the next character,
1346 or -1 if lexing has reached the end of the input text. To consume the
1347 peeked character, use L</lex_read_unichar>.
1349 If the next character is in (or extends into) the next chunk of input
1350 text, the next chunk will be read in. Normally the current chunk will be
1351 discarded at the same time, but if I<flags> includes C<LEX_KEEP_PREVIOUS>
1352 then the current chunk will not be discarded.
1354 If the input is being interpreted as UTF-8 and a UTF-8 encoding error
1355 is encountered, an exception is generated.
1361 Perl_lex_peek_unichar(pTHX_ U32 flags)
1365 if (flags & ~(LEX_KEEP_PREVIOUS))
1366 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_peek_unichar");
1367 s = PL_parser->bufptr;
1368 bufend = PL_parser->bufend;
1374 if (!lex_next_chunk(flags))
1376 s = PL_parser->bufptr;
1377 bufend = PL_parser->bufend;
1383 len = PL_utf8skip[head];
1384 while ((STRLEN)(bufend-s) < len) {
1385 if (!lex_next_chunk(flags | LEX_KEEP_PREVIOUS))
1387 s = PL_parser->bufptr;
1388 bufend = PL_parser->bufend;
1391 unichar = utf8n_to_uvuni((U8*)s, bufend-s, &retlen, UTF8_CHECK_ONLY);
1392 if (retlen == (STRLEN)-1) {
1393 /* malformed UTF-8 */
1395 SAVESPTR(PL_warnhook);
1396 PL_warnhook = PERL_WARNHOOK_FATAL;
1397 utf8n_to_uvuni((U8*)s, bufend-s, NULL, 0);
1403 if (!lex_next_chunk(flags))
1405 s = PL_parser->bufptr;
1412 =for apidoc Amx|I32|lex_read_unichar|U32 flags
1414 Reads the next (Unicode) character in the text currently being lexed.
1415 Returns the codepoint (unsigned integer value) of the character read,
1416 and moves L</PL_parser-E<gt>bufptr> past the character, or returns -1
1417 if lexing has reached the end of the input text. To non-destructively
1418 examine the next character, use L</lex_peek_unichar> instead.
1420 If the next character is in (or extends into) the next chunk of input
1421 text, the next chunk will be read in. Normally the current chunk will be
1422 discarded at the same time, but if I<flags> includes C<LEX_KEEP_PREVIOUS>
1423 then the current chunk will not be discarded.
1425 If the input is being interpreted as UTF-8 and a UTF-8 encoding error
1426 is encountered, an exception is generated.
1432 Perl_lex_read_unichar(pTHX_ U32 flags)
1435 if (flags & ~(LEX_KEEP_PREVIOUS))
1436 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_unichar");
1437 c = lex_peek_unichar(flags);
1440 CopLINE_inc(PL_curcop);
1442 PL_parser->bufptr += UTF8SKIP(PL_parser->bufptr);
1444 ++(PL_parser->bufptr);
1450 =for apidoc Amx|void|lex_read_space|U32 flags
1452 Reads optional spaces, in Perl style, in the text currently being
1453 lexed. The spaces may include ordinary whitespace characters and
1454 Perl-style comments. C<#line> directives are processed if encountered.
1455 L</PL_parser-E<gt>bufptr> is moved past the spaces, so that it points
1456 at a non-space character (or the end of the input text).
1458 If spaces extend into the next chunk of input text, the next chunk will
1459 be read in. Normally the current chunk will be discarded at the same
1460 time, but if I<flags> includes C<LEX_KEEP_PREVIOUS> then the current
1461 chunk will not be discarded.
1466 #define LEX_NO_NEXT_CHUNK 0x80000000
1469 Perl_lex_read_space(pTHX_ U32 flags)
1472 bool need_incline = 0;
1473 if (flags & ~(LEX_KEEP_PREVIOUS|LEX_NO_NEXT_CHUNK))
1474 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_space");
1477 sv_free(PL_skipwhite);
1478 PL_skipwhite = NULL;
1481 PL_skipwhite = newSVpvs("");
1482 #endif /* PERL_MAD */
1483 s = PL_parser->bufptr;
1484 bufend = PL_parser->bufend;
1490 } while (!(c == '\n' || (c == 0 && s == bufend)));
1491 } else if (c == '\n') {
1493 PL_parser->linestart = s;
1498 } else if (isSPACE(c)) {
1500 } else if (c == 0 && s == bufend) {
1504 sv_catpvn(PL_skipwhite, PL_parser->bufptr, s-PL_parser->bufptr);
1505 #endif /* PERL_MAD */
1506 if (flags & LEX_NO_NEXT_CHUNK)
1508 PL_parser->bufptr = s;
1509 CopLINE_inc(PL_curcop);
1510 got_more = lex_next_chunk(flags);
1511 CopLINE_dec(PL_curcop);
1512 s = PL_parser->bufptr;
1513 bufend = PL_parser->bufend;
1516 if (need_incline && PL_parser->rsfp) {
1526 sv_catpvn(PL_skipwhite, PL_parser->bufptr, s-PL_parser->bufptr);
1527 #endif /* PERL_MAD */
1528 PL_parser->bufptr = s;
1533 * This subroutine has nothing to do with tilting, whether at windmills
1534 * or pinball tables. Its name is short for "increment line". It
1535 * increments the current line number in CopLINE(PL_curcop) and checks
1536 * to see whether the line starts with a comment of the form
1537 * # line 500 "foo.pm"
1538 * If so, it sets the current line number and file to the values in the comment.
1542 S_incline(pTHX_ const char *s)
1550 PERL_ARGS_ASSERT_INCLINE;
1552 CopLINE_inc(PL_curcop);
1555 while (SPACE_OR_TAB(*s))
1557 if (strnEQ(s, "line", 4))
1561 if (SPACE_OR_TAB(*s))
1565 while (SPACE_OR_TAB(*s))
1573 if (!SPACE_OR_TAB(*s) && *s != '\r' && *s != '\n' && *s != '\0')
1575 while (SPACE_OR_TAB(*s))
1577 if (*s == '"' && (t = strchr(s+1, '"'))) {
1583 while (!isSPACE(*t))
1587 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
1589 if (*e != '\n' && *e != '\0')
1590 return; /* false alarm */
1592 line_num = atoi(n)-1;
1595 const STRLEN len = t - s;
1596 SV *const temp_sv = CopFILESV(PL_curcop);
1601 cf = SvPVX(temp_sv);
1602 tmplen = SvCUR(temp_sv);
1608 if (!PL_rsfp && !PL_parser->filtered) {
1609 /* must copy *{"::_<(eval N)[oldfilename:L]"}
1610 * to *{"::_<newfilename"} */
1611 /* However, the long form of evals is only turned on by the
1612 debugger - usually they're "(eval %lu)" */
1616 STRLEN tmplen2 = len;
1617 if (tmplen + 2 <= sizeof smallbuf)
1620 Newx(tmpbuf, tmplen + 2, char);
1623 memcpy(tmpbuf + 2, cf, tmplen);
1625 gvp = (GV**)hv_fetch(PL_defstash, tmpbuf, tmplen, FALSE);
1630 if (tmplen2 + 2 <= sizeof smallbuf)
1633 Newx(tmpbuf2, tmplen2 + 2, char);
1635 if (tmpbuf2 != smallbuf || tmpbuf != smallbuf) {
1636 /* Either they malloc'd it, or we malloc'd it,
1637 so no prefix is present in ours. */
1642 memcpy(tmpbuf2 + 2, s, tmplen2);
1645 gv2 = *(GV**)hv_fetch(PL_defstash, tmpbuf2, tmplen2, TRUE);
1647 gv_init(gv2, PL_defstash, tmpbuf2, tmplen2, FALSE);
1648 /* adjust ${"::_<newfilename"} to store the new file name */
1649 GvSV(gv2) = newSVpvn(tmpbuf2 + 2, tmplen2 - 2);
1650 /* The line number may differ. If that is the case,
1651 alias the saved lines that are in the array.
1652 Otherwise alias the whole array. */
1653 if (CopLINE(PL_curcop) == line_num) {
1654 GvHV(gv2) = MUTABLE_HV(SvREFCNT_inc(GvHV(*gvp)));
1655 GvAV(gv2) = MUTABLE_AV(SvREFCNT_inc(GvAV(*gvp)));
1657 else if (GvAV(*gvp)) {
1658 AV * const av = GvAV(*gvp);
1659 const I32 start = CopLINE(PL_curcop)+1;
1660 I32 items = AvFILLp(av) - start;
1662 AV * const av2 = GvAVn(gv2);
1663 SV **svp = AvARRAY(av) + start;
1664 I32 l = (I32)line_num+1;
1666 av_store(av2, l++, SvREFCNT_inc(*svp++));
1671 if (tmpbuf2 != smallbuf) Safefree(tmpbuf2);
1673 if (tmpbuf != smallbuf) Safefree(tmpbuf);
1675 CopFILE_free(PL_curcop);
1676 CopFILE_setn(PL_curcop, s, len);
1678 CopLINE_set(PL_curcop, line_num);
1682 /* skip space before PL_thistoken */
1685 S_skipspace0(pTHX_ register char *s)
1687 PERL_ARGS_ASSERT_SKIPSPACE0;
1694 PL_thiswhite = newSVpvs("");
1695 sv_catsv(PL_thiswhite, PL_skipwhite);
1696 sv_free(PL_skipwhite);
1699 PL_realtokenstart = s - SvPVX(PL_linestr);
1703 /* skip space after PL_thistoken */
1706 S_skipspace1(pTHX_ register char *s)
1708 const char *start = s;
1709 I32 startoff = start - SvPVX(PL_linestr);
1711 PERL_ARGS_ASSERT_SKIPSPACE1;
1716 start = SvPVX(PL_linestr) + startoff;
1717 if (!PL_thistoken && PL_realtokenstart >= 0) {
1718 const char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
1719 PL_thistoken = newSVpvn(tstart, start - tstart);
1721 PL_realtokenstart = -1;
1724 PL_nextwhite = newSVpvs("");
1725 sv_catsv(PL_nextwhite, PL_skipwhite);
1726 sv_free(PL_skipwhite);
1733 S_skipspace2(pTHX_ register char *s, SV **svp)
1736 const I32 bufptroff = PL_bufptr - SvPVX(PL_linestr);
1737 const I32 startoff = s - SvPVX(PL_linestr);
1739 PERL_ARGS_ASSERT_SKIPSPACE2;
1742 PL_bufptr = SvPVX(PL_linestr) + bufptroff;
1743 if (!PL_madskills || !svp)
1745 start = SvPVX(PL_linestr) + startoff;
1746 if (!PL_thistoken && PL_realtokenstart >= 0) {
1747 char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
1748 PL_thistoken = newSVpvn(tstart, start - tstart);
1749 PL_realtokenstart = -1;
1753 *svp = newSVpvs("");
1754 sv_setsv(*svp, PL_skipwhite);
1755 sv_free(PL_skipwhite);
1764 S_update_debugger_info(pTHX_ SV *orig_sv, const char *const buf, STRLEN len)
1766 AV *av = CopFILEAVx(PL_curcop);
1768 SV * const sv = newSV_type(SVt_PVMG);
1770 sv_setsv(sv, orig_sv);
1772 sv_setpvn(sv, buf, len);
1775 av_store(av, (I32)CopLINE(PL_curcop), sv);
1781 * Called to gobble the appropriate amount and type of whitespace.
1782 * Skips comments as well.
1786 S_skipspace(pTHX_ register char *s)
1790 #endif /* PERL_MAD */
1791 PERL_ARGS_ASSERT_SKIPSPACE;
1794 sv_free(PL_skipwhite);
1795 PL_skipwhite = NULL;
1797 #endif /* PERL_MAD */
1798 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
1799 while (s < PL_bufend && SPACE_OR_TAB(*s))
1802 STRLEN bufptr_pos = PL_bufptr - SvPVX(PL_linestr);
1804 lex_read_space(LEX_KEEP_PREVIOUS |
1805 (PL_sublex_info.sub_inwhat || PL_lex_state == LEX_FORMLINE ?
1806 LEX_NO_NEXT_CHUNK : 0));
1808 PL_bufptr = SvPVX(PL_linestr) + bufptr_pos;
1809 if (PL_linestart > PL_bufptr)
1810 PL_bufptr = PL_linestart;
1815 PL_skipwhite = newSVpvn(start, s-start);
1816 #endif /* PERL_MAD */
1822 * Check the unary operators to ensure there's no ambiguity in how they're
1823 * used. An ambiguous piece of code would be:
1825 * This doesn't mean rand() + 5. Because rand() is a unary operator,
1826 * the +5 is its argument.
1836 if (PL_oldoldbufptr != PL_last_uni)
1838 while (isSPACE(*PL_last_uni))
1841 while (isALNUM_lazy_if(s,UTF) || *s == '-')
1843 if ((t = strchr(s, '(')) && t < PL_bufptr)
1846 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
1847 "Warning: Use of \"%.*s\" without parentheses is ambiguous",
1848 (int)(s - PL_last_uni), PL_last_uni);
1852 * LOP : macro to build a list operator. Its behaviour has been replaced
1853 * with a subroutine, S_lop() for which LOP is just another name.
1856 #define LOP(f,x) return lop(f,x,s)
1860 * Build a list operator (or something that might be one). The rules:
1861 * - if we have a next token, then it's a list operator [why?]
1862 * - if the next thing is an opening paren, then it's a function
1863 * - else it's a list operator
1867 S_lop(pTHX_ I32 f, int x, char *s)
1871 PERL_ARGS_ASSERT_LOP;
1877 PL_last_lop = PL_oldbufptr;
1878 PL_last_lop_op = (OPCODE)f;
1887 return REPORT(FUNC);
1890 return REPORT(FUNC);
1893 if (!PL_lex_allbrackets && PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
1894 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
1895 return REPORT(LSTOP);
1902 * Sets up for an eventual force_next(). start_force(0) basically does
1903 * an unshift, while start_force(-1) does a push. yylex removes items
1908 S_start_force(pTHX_ int where)
1912 if (where < 0) /* so people can duplicate start_force(PL_curforce) */
1913 where = PL_lasttoke;
1914 assert(PL_curforce < 0 || PL_curforce == where);
1915 if (PL_curforce != where) {
1916 for (i = PL_lasttoke; i > where; --i) {
1917 PL_nexttoke[i] = PL_nexttoke[i-1];
1921 if (PL_curforce < 0) /* in case of duplicate start_force() */
1922 Zero(&PL_nexttoke[where], 1, NEXTTOKE);
1923 PL_curforce = where;
1926 curmad('^', newSVpvs(""));
1927 CURMAD('_', PL_nextwhite);
1932 S_curmad(pTHX_ char slot, SV *sv)
1938 if (PL_curforce < 0)
1939 where = &PL_thismad;
1941 where = &PL_nexttoke[PL_curforce].next_mad;
1947 if (UTF && is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
1949 else if (PL_encoding) {
1950 sv_recode_to_utf8(sv, PL_encoding);
1955 /* keep a slot open for the head of the list? */
1956 if (slot != '_' && *where && (*where)->mad_key == '^') {
1957 (*where)->mad_key = slot;
1958 sv_free(MUTABLE_SV(((*where)->mad_val)));
1959 (*where)->mad_val = (void*)sv;
1962 addmad(newMADsv(slot, sv), where, 0);
1965 # define start_force(where) NOOP
1966 # define curmad(slot, sv) NOOP
1971 * When the lexer realizes it knows the next token (for instance,
1972 * it is reordering tokens for the parser) then it can call S_force_next
1973 * to know what token to return the next time the lexer is called. Caller
1974 * will need to set PL_nextval[] (or PL_nexttoke[].next_val with PERL_MAD),
1975 * and possibly PL_expect to ensure the lexer handles the token correctly.
1979 S_force_next(pTHX_ I32 type)
1984 PerlIO_printf(Perl_debug_log, "### forced token:\n");
1985 tokereport(type, &NEXTVAL_NEXTTOKE);
1989 if (PL_curforce < 0)
1990 start_force(PL_lasttoke);
1991 PL_nexttoke[PL_curforce].next_type = type;
1992 if (PL_lex_state != LEX_KNOWNEXT)
1993 PL_lex_defer = PL_lex_state;
1994 PL_lex_state = LEX_KNOWNEXT;
1995 PL_lex_expect = PL_expect;
1998 PL_nexttype[PL_nexttoke] = type;
2000 if (PL_lex_state != LEX_KNOWNEXT) {
2001 PL_lex_defer = PL_lex_state;
2002 PL_lex_expect = PL_expect;
2003 PL_lex_state = LEX_KNOWNEXT;
2011 int yyc = PL_parser->yychar;
2012 if (yyc != YYEMPTY) {
2015 NEXTVAL_NEXTTOKE = PL_parser->yylval;
2016 if (yyc == '{'/*}*/ || yyc == HASHBRACK || yyc == '['/*]*/) {
2017 PL_lex_allbrackets--;
2019 yyc |= (3<<24) | (PL_lex_brackstack[PL_lex_brackets] << 16);
2020 } else if (yyc == '('/*)*/) {
2021 PL_lex_allbrackets--;
2026 PL_parser->yychar = YYEMPTY;
2031 S_newSV_maybe_utf8(pTHX_ const char *const start, STRLEN len)
2034 SV * const sv = newSVpvn_utf8(start, len,
2037 && !is_ascii_string((const U8*)start, len)
2038 && is_utf8_string((const U8*)start, len));
2044 * When the lexer knows the next thing is a word (for instance, it has
2045 * just seen -> and it knows that the next char is a word char, then
2046 * it calls S_force_word to stick the next word into the PL_nexttoke/val
2050 * char *start : buffer position (must be within PL_linestr)
2051 * int token : PL_next* will be this type of bare word (e.g., METHOD,WORD)
2052 * int check_keyword : if true, Perl checks to make sure the word isn't
2053 * a keyword (do this if the word is a label, e.g. goto FOO)
2054 * int allow_pack : if true, : characters will also be allowed (require,
2055 * use, etc. do this)
2056 * int allow_initial_tick : used by the "sub" lexer only.
2060 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
2066 PERL_ARGS_ASSERT_FORCE_WORD;
2068 start = SKIPSPACE1(start);
2070 if (isIDFIRST_lazy_if(s,UTF) ||
2071 (allow_pack && *s == ':') ||
2072 (allow_initial_tick && *s == '\'') )
2074 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
2075 if (check_keyword && keyword(PL_tokenbuf, len, 0))
2077 start_force(PL_curforce);
2079 curmad('X', newSVpvn(start,s-start));
2080 if (token == METHOD) {
2085 PL_expect = XOPERATOR;
2089 curmad('g', newSVpvs( "forced" ));
2090 NEXTVAL_NEXTTOKE.opval
2091 = (OP*)newSVOP(OP_CONST,0,
2092 S_newSV_maybe_utf8(aTHX_ PL_tokenbuf, len));
2093 NEXTVAL_NEXTTOKE.opval->op_private |= OPpCONST_BARE;
2101 * Called when the lexer wants $foo *foo &foo etc, but the program
2102 * text only contains the "foo" portion. The first argument is a pointer
2103 * to the "foo", and the second argument is the type symbol to prefix.
2104 * Forces the next token to be a "WORD".
2105 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
2109 S_force_ident(pTHX_ register const char *s, int kind)
2113 PERL_ARGS_ASSERT_FORCE_IDENT;
2116 const STRLEN len = strlen(s);
2117 OP* const o = (OP*)newSVOP(OP_CONST, 0, newSVpvn_flags(s, len,
2118 UTF ? SVf_UTF8 : 0));
2119 start_force(PL_curforce);
2120 NEXTVAL_NEXTTOKE.opval = o;
2123 o->op_private = OPpCONST_ENTERED;
2124 /* XXX see note in pp_entereval() for why we forgo typo
2125 warnings if the symbol must be introduced in an eval.
2127 gv_fetchpvn_flags(s, len,
2128 (PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL)
2129 : GV_ADD) | ( UTF ? SVf_UTF8 : 0 ),
2130 kind == '$' ? SVt_PV :
2131 kind == '@' ? SVt_PVAV :
2132 kind == '%' ? SVt_PVHV :
2140 Perl_str_to_version(pTHX_ SV *sv)
2145 const char *start = SvPV_const(sv,len);
2146 const char * const end = start + len;
2147 const bool utf = SvUTF8(sv) ? TRUE : FALSE;
2149 PERL_ARGS_ASSERT_STR_TO_VERSION;
2151 while (start < end) {
2155 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
2160 retval += ((NV)n)/nshift;
2169 * Forces the next token to be a version number.
2170 * If the next token appears to be an invalid version number, (e.g. "v2b"),
2171 * and if "guessing" is TRUE, then no new token is created (and the caller
2172 * must use an alternative parsing method).
2176 S_force_version(pTHX_ char *s, int guessing)
2182 I32 startoff = s - SvPVX(PL_linestr);
2185 PERL_ARGS_ASSERT_FORCE_VERSION;
2193 while (isDIGIT(*d) || *d == '_' || *d == '.')
2197 start_force(PL_curforce);
2198 curmad('X', newSVpvn(s,d-s));
2201 if (*d == ';' || isSPACE(*d) || *d == '{' || *d == '}' || !*d) {
2203 #ifdef USE_LOCALE_NUMERIC
2204 char *loc = savepv(setlocale(LC_NUMERIC, NULL));
2205 setlocale(LC_NUMERIC, "C");
2207 s = scan_num(s, &pl_yylval);
2208 #ifdef USE_LOCALE_NUMERIC
2209 setlocale(LC_NUMERIC, loc);
2212 version = pl_yylval.opval;
2213 ver = cSVOPx(version)->op_sv;
2214 if (SvPOK(ver) && !SvNIOK(ver)) {
2215 SvUPGRADE(ver, SVt_PVNV);
2216 SvNV_set(ver, str_to_version(ver));
2217 SvNOK_on(ver); /* hint that it is a version */
2220 else if (guessing) {
2223 sv_free(PL_nextwhite); /* let next token collect whitespace */
2225 s = SvPVX(PL_linestr) + startoff;
2233 if (PL_madskills && !version) {
2234 sv_free(PL_nextwhite); /* let next token collect whitespace */
2236 s = SvPVX(PL_linestr) + startoff;
2239 /* NOTE: The parser sees the package name and the VERSION swapped */
2240 start_force(PL_curforce);
2241 NEXTVAL_NEXTTOKE.opval = version;
2248 * S_force_strict_version
2249 * Forces the next token to be a version number using strict syntax rules.
2253 S_force_strict_version(pTHX_ char *s)
2258 I32 startoff = s - SvPVX(PL_linestr);
2260 const char *errstr = NULL;
2262 PERL_ARGS_ASSERT_FORCE_STRICT_VERSION;
2264 while (isSPACE(*s)) /* leading whitespace */
2267 if (is_STRICT_VERSION(s,&errstr)) {
2269 s = (char *)scan_version(s, ver, 0);
2270 version = newSVOP(OP_CONST, 0, ver);
2272 else if ( (*s != ';' && *s != '{' && *s != '}' ) &&
2273 (s = SKIPSPACE1(s), (*s != ';' && *s != '{' && *s != '}' )))
2277 yyerror(errstr); /* version required */
2282 if (PL_madskills && !version) {
2283 sv_free(PL_nextwhite); /* let next token collect whitespace */
2285 s = SvPVX(PL_linestr) + startoff;
2288 /* NOTE: The parser sees the package name and the VERSION swapped */
2289 start_force(PL_curforce);
2290 NEXTVAL_NEXTTOKE.opval = version;
2298 * Tokenize a quoted string passed in as an SV. It finds the next
2299 * chunk, up to end of string or a backslash. It may make a new
2300 * SV containing that chunk (if HINT_NEW_STRING is on). It also
2305 S_tokeq(pTHX_ SV *sv)
2309 register char *send;
2314 PERL_ARGS_ASSERT_TOKEQ;
2319 s = SvPV_force(sv, len);
2320 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
2323 /* This is relying on the SV being "well formed" with a trailing '\0' */
2324 while (s < send && !(*s == '\\' && s[1] == '\\'))
2329 if ( PL_hints & HINT_NEW_STRING ) {
2330 pv = newSVpvn_flags(SvPVX_const(pv), len, SVs_TEMP | SvUTF8(sv));
2334 if (s + 1 < send && (s[1] == '\\'))
2335 s++; /* all that, just for this */
2340 SvCUR_set(sv, d - SvPVX_const(sv));
2342 if ( PL_hints & HINT_NEW_STRING )
2343 return new_constant(NULL, 0, "q", sv, pv, "q", 1);
2348 * Now come three functions related to double-quote context,
2349 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
2350 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
2351 * interact with PL_lex_state, and create fake ( ... ) argument lists
2352 * to handle functions and concatenation.
2356 * stringify ( const[foo] concat lcfirst ( const[bar] ) )
2361 * Assumes that pl_yylval.ival is the op we're creating (e.g. OP_LCFIRST).
2363 * Pattern matching will set PL_lex_op to the pattern-matching op to
2364 * make (we return THING if pl_yylval.ival is OP_NULL, PMFUNC otherwise).
2366 * OP_CONST and OP_READLINE are easy--just make the new op and return.
2368 * Everything else becomes a FUNC.
2370 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
2371 * had an OP_CONST or OP_READLINE). This just sets us up for a
2372 * call to S_sublex_push().
2376 S_sublex_start(pTHX)
2379 register const I32 op_type = pl_yylval.ival;
2381 if (op_type == OP_NULL) {
2382 pl_yylval.opval = PL_lex_op;
2386 if (op_type == OP_CONST || op_type == OP_READLINE) {
2387 SV *sv = tokeq(PL_lex_stuff);
2389 if (SvTYPE(sv) == SVt_PVIV) {
2390 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
2392 const char * const p = SvPV_const(sv, len);
2393 SV * const nsv = newSVpvn_flags(p, len, SvUTF8(sv));
2397 pl_yylval.opval = (OP*)newSVOP(op_type, 0, sv);
2398 PL_lex_stuff = NULL;
2399 /* Allow <FH> // "foo" */
2400 if (op_type == OP_READLINE)
2401 PL_expect = XTERMORDORDOR;
2404 else if (op_type == OP_BACKTICK && PL_lex_op) {
2405 /* readpipe() vas overriden */
2406 cSVOPx(cLISTOPx(cUNOPx(PL_lex_op)->op_first)->op_first->op_sibling)->op_sv = tokeq(PL_lex_stuff);
2407 pl_yylval.opval = PL_lex_op;
2409 PL_lex_stuff = NULL;
2413 PL_sublex_info.super_state = PL_lex_state;
2414 PL_sublex_info.sub_inwhat = (U16)op_type;
2415 PL_sublex_info.sub_op = PL_lex_op;
2416 PL_lex_state = LEX_INTERPPUSH;
2420 pl_yylval.opval = PL_lex_op;
2430 * Create a new scope to save the lexing state. The scope will be
2431 * ended in S_sublex_done. Returns a '(', starting the function arguments
2432 * to the uc, lc, etc. found before.
2433 * Sets PL_lex_state to LEX_INTERPCONCAT.
2442 PL_lex_state = PL_sublex_info.super_state;
2443 SAVEBOOL(PL_lex_dojoin);
2444 SAVEI32(PL_lex_brackets);
2445 SAVEI32(PL_lex_allbrackets);
2446 SAVEI8(PL_lex_fakeeof);
2447 SAVEI32(PL_lex_casemods);
2448 SAVEI32(PL_lex_starts);
2449 SAVEI8(PL_lex_state);
2450 SAVEPPTR(PL_sublex_info.re_eval_start);
2451 SAVEVPTR(PL_lex_inpat);
2452 SAVEI16(PL_lex_inwhat);
2453 SAVECOPLINE(PL_curcop);
2454 SAVEPPTR(PL_bufptr);
2455 SAVEPPTR(PL_bufend);
2456 SAVEPPTR(PL_oldbufptr);
2457 SAVEPPTR(PL_oldoldbufptr);
2458 SAVEPPTR(PL_last_lop);
2459 SAVEPPTR(PL_last_uni);
2460 SAVEPPTR(PL_linestart);
2461 SAVESPTR(PL_linestr);
2462 SAVEGENERICPV(PL_lex_brackstack);
2463 SAVEGENERICPV(PL_lex_casestack);
2465 PL_linestr = PL_lex_stuff;
2466 PL_lex_stuff = NULL;
2467 PL_sublex_info.re_eval_start = NULL;
2469 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
2470 = SvPVX(PL_linestr);
2471 PL_bufend += SvCUR(PL_linestr);
2472 PL_last_lop = PL_last_uni = NULL;
2473 SAVEFREESV(PL_linestr);
2475 PL_lex_dojoin = FALSE;
2476 PL_lex_brackets = 0;
2477 PL_lex_allbrackets = 0;
2478 PL_lex_fakeeof = LEX_FAKEEOF_NEVER;
2479 Newx(PL_lex_brackstack, 120, char);
2480 Newx(PL_lex_casestack, 12, char);
2481 PL_lex_casemods = 0;
2482 *PL_lex_casestack = '\0';
2484 PL_lex_state = LEX_INTERPCONCAT;
2485 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
2487 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
2488 if (PL_lex_inwhat == OP_TRANSR) PL_lex_inwhat = OP_TRANS;
2489 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
2490 PL_lex_inpat = PL_sublex_info.sub_op;
2492 PL_lex_inpat = NULL;
2499 * Restores lexer state after a S_sublex_push.
2506 if (!PL_lex_starts++) {
2507 SV * const sv = newSVpvs("");
2508 if (SvUTF8(PL_linestr))
2510 PL_expect = XOPERATOR;
2511 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2515 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
2516 PL_lex_state = LEX_INTERPCASEMOD;
2520 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
2521 assert(PL_lex_inwhat != OP_TRANSR);
2522 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
2523 PL_linestr = PL_lex_repl;
2525 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
2526 PL_bufend += SvCUR(PL_linestr);
2527 PL_last_lop = PL_last_uni = NULL;
2528 SAVEFREESV(PL_linestr);
2529 PL_lex_dojoin = FALSE;
2530 PL_lex_brackets = 0;
2531 PL_lex_allbrackets = 0;
2532 PL_lex_fakeeof = LEX_FAKEEOF_NEVER;
2533 PL_lex_casemods = 0;
2534 *PL_lex_casestack = '\0';
2536 if (SvEVALED(PL_lex_repl)) {
2537 PL_lex_state = LEX_INTERPNORMAL;
2539 /* we don't clear PL_lex_repl here, so that we can check later
2540 whether this is an evalled subst; that means we rely on the
2541 logic to ensure sublex_done() is called again only via the
2542 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
2545 PL_lex_state = LEX_INTERPCONCAT;
2555 PL_endwhite = newSVpvs("");
2556 sv_catsv(PL_endwhite, PL_thiswhite);
2560 sv_setpvs(PL_thistoken,"");
2562 PL_realtokenstart = -1;
2566 PL_bufend = SvPVX(PL_linestr);
2567 PL_bufend += SvCUR(PL_linestr);
2568 PL_expect = XOPERATOR;
2569 PL_sublex_info.sub_inwhat = 0;
2577 Extracts the next constant part of a pattern, double-quoted string,
2578 or transliteration. This is terrifying code.
2580 For example, in parsing the double-quoted string "ab\x63$d", it would
2581 stop at the '$' and return an OP_CONST containing 'abc'.
2583 It looks at PL_lex_inwhat and PL_lex_inpat to find out whether it's
2584 processing a pattern (PL_lex_inpat is true), a transliteration
2585 (PL_lex_inwhat == OP_TRANS is true), or a double-quoted string.
2587 Returns a pointer to the character scanned up to. If this is
2588 advanced from the start pointer supplied (i.e. if anything was
2589 successfully parsed), will leave an OP_CONST for the substring scanned
2590 in pl_yylval. Caller must intuit reason for not parsing further
2591 by looking at the next characters herself.
2595 \N{ABC} => \N{U+41.42.43}
2598 all other \-char, including \N and \N{ apart from \N{ABC}
2601 @ and $ where it appears to be a var, but not for $ as tail anchor
2606 In transliterations:
2607 characters are VERY literal, except for - not at the start or end
2608 of the string, which indicates a range. If the range is in bytes,
2609 scan_const expands the range to the full set of intermediate
2610 characters. If the range is in utf8, the hyphen is replaced with
2611 a certain range mark which will be handled by pmtrans() in op.c.
2613 In double-quoted strings:
2615 double-quoted style: \r and \n
2616 constants: \x31, etc.
2617 deprecated backrefs: \1 (in substitution replacements)
2618 case and quoting: \U \Q \E
2621 scan_const does *not* construct ops to handle interpolated strings.
2622 It stops processing as soon as it finds an embedded $ or @ variable
2623 and leaves it to the caller to work out what's going on.
2625 embedded arrays (whether in pattern or not) could be:
2626 @foo, @::foo, @'foo, @{foo}, @$foo, @+, @-.
2628 $ in double-quoted strings must be the symbol of an embedded scalar.
2630 $ in pattern could be $foo or could be tail anchor. Assumption:
2631 it's a tail anchor if $ is the last thing in the string, or if it's
2632 followed by one of "()| \r\n\t"
2634 \1 (backreferences) are turned into $1 in substitutions
2636 The structure of the code is
2637 while (there's a character to process) {
2638 handle transliteration ranges
2639 skip regexp comments /(?#comment)/ and codes /(?{code})/
2640 skip #-initiated comments in //x patterns
2641 check for embedded arrays
2642 check for embedded scalars
2644 deprecate \1 in substitution replacements
2645 handle string-changing backslashes \l \U \Q \E, etc.
2646 switch (what was escaped) {
2647 handle \- in a transliteration (becomes a literal -)
2648 if a pattern and not \N{, go treat as regular character
2649 handle \132 (octal characters)
2650 handle \x15 and \x{1234} (hex characters)
2651 handle \N{name} (named characters, also \N{3,5} in a pattern)
2652 handle \cV (control characters)
2653 handle printf-style backslashes (\f, \r, \n, etc)
2656 } (end if backslash)
2657 handle regular character
2658 } (end while character to read)
2663 S_scan_const(pTHX_ char *start)
2666 register char *send = PL_bufend; /* end of the constant */
2667 SV *sv = newSV(send - start); /* sv for the constant. See
2668 note below on sizing. */
2669 register char *s = start; /* start of the constant */
2670 register char *d = SvPVX(sv); /* destination for copies */
2671 bool dorange = FALSE; /* are we in a translit range? */
2672 bool didrange = FALSE; /* did we just finish a range? */
2673 bool in_charclass = FALSE; /* within /[...]/ */
2674 bool has_utf8 = FALSE; /* Output constant is UTF8 */
2675 bool this_utf8 = cBOOL(UTF); /* Is the source string assumed
2676 to be UTF8? But, this can
2677 show as true when the source
2678 isn't utf8, as for example
2679 when it is entirely composed
2682 /* Note on sizing: The scanned constant is placed into sv, which is
2683 * initialized by newSV() assuming one byte of output for every byte of
2684 * input. This routine expects newSV() to allocate an extra byte for a
2685 * trailing NUL, which this routine will append if it gets to the end of
2686 * the input. There may be more bytes of input than output (eg., \N{LATIN
2687 * CAPITAL LETTER A}), or more output than input if the constant ends up
2688 * recoded to utf8, but each time a construct is found that might increase
2689 * the needed size, SvGROW() is called. Its size parameter each time is
2690 * based on the best guess estimate at the time, namely the length used so
2691 * far, plus the length the current construct will occupy, plus room for
2692 * the trailing NUL, plus one byte for every input byte still unscanned */
2696 UV literal_endpoint = 0;
2697 bool native_range = TRUE; /* turned to FALSE if the first endpoint is Unicode. */
2700 PERL_ARGS_ASSERT_SCAN_CONST;
2702 assert(PL_lex_inwhat != OP_TRANSR);
2703 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
2704 /* If we are doing a trans and we know we want UTF8 set expectation */
2705 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
2706 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
2710 while (s < send || dorange) {
2712 /* get transliterations out of the way (they're most literal) */
2713 if (PL_lex_inwhat == OP_TRANS) {
2714 /* expand a range A-Z to the full set of characters. AIE! */
2716 I32 i; /* current expanded character */
2717 I32 min; /* first character in range */
2718 I32 max; /* last character in range */
2729 char * const c = (char*)utf8_hop((U8*)d, -1);
2733 *c = (char)UTF_TO_NATIVE(0xff);
2734 /* mark the range as done, and continue */
2740 i = d - SvPVX_const(sv); /* remember current offset */
2743 SvLEN(sv) + (has_utf8 ?
2744 (512 - UTF_CONTINUATION_MARK +
2747 /* How many two-byte within 0..255: 128 in UTF-8,
2748 * 96 in UTF-8-mod. */
2750 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
2752 d = SvPVX(sv) + i; /* refresh d after realloc */
2756 for (j = 0; j <= 1; j++) {
2757 char * const c = (char*)utf8_hop((U8*)d, -1);
2758 const UV uv = utf8n_to_uvchr((U8*)c, d - c, NULL, 0);
2764 max = (U8)0xff; /* only to \xff */
2765 uvmax = uv; /* \x{100} to uvmax */
2767 d = c; /* eat endpoint chars */
2772 d -= 2; /* eat the first char and the - */
2773 min = (U8)*d; /* first char in range */
2774 max = (U8)d[1]; /* last char in range */
2781 "Invalid range \"%c-%c\" in transliteration operator",
2782 (char)min, (char)max);
2786 if (literal_endpoint == 2 &&
2787 ((isLOWER(min) && isLOWER(max)) ||
2788 (isUPPER(min) && isUPPER(max)))) {
2790 for (i = min; i <= max; i++)
2792 *d++ = NATIVE_TO_NEED(has_utf8,i);
2794 for (i = min; i <= max; i++)
2796 *d++ = NATIVE_TO_NEED(has_utf8,i);
2801 for (i = min; i <= max; i++)
2804 const U8 ch = (U8)NATIVE_TO_UTF(i);
2805 if (UNI_IS_INVARIANT(ch))
2808 *d++ = (U8)UTF8_EIGHT_BIT_HI(ch);
2809 *d++ = (U8)UTF8_EIGHT_BIT_LO(ch);
2818 d = (char*)uvchr_to_utf8((U8*)d, 0x100);
2820 *d++ = (char)UTF_TO_NATIVE(0xff);
2822 d = (char*)uvchr_to_utf8((U8*)d, uvmax);
2826 /* mark the range as done, and continue */
2830 literal_endpoint = 0;
2835 /* range begins (ignore - as first or last char) */
2836 else if (*s == '-' && s+1 < send && s != start) {
2838 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
2845 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
2855 literal_endpoint = 0;
2856 native_range = TRUE;
2861 /* if we get here, we're not doing a transliteration */
2863 else if (*s == '[' && PL_lex_inpat && !in_charclass) {
2866 while (s1 >= start && *s1-- == '\\')
2869 in_charclass = TRUE;
2872 else if (*s == ']' && PL_lex_inpat && in_charclass) {
2875 while (s1 >= start && *s1-- == '\\')
2878 in_charclass = FALSE;
2881 /* skip for regexp comments /(?#comment)/, except for the last
2882 * char, which will be done separately.
2883 * Stop on (?{..}) and friends */
2885 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
2887 while (s+1 < send && *s != ')')
2888 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
2890 else if (!PL_lex_casemods && !in_charclass &&
2891 ( s[2] == '{' /* This should match regcomp.c */
2892 || (s[2] == '?' && s[3] == '{')))
2898 /* likewise skip #-initiated comments in //x patterns */
2899 else if (*s == '#' && PL_lex_inpat &&
2900 ((PMOP*)PL_lex_inpat)->op_pmflags & RXf_PMf_EXTENDED) {
2901 while (s+1 < send && *s != '\n')
2902 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
2905 /* no further processing of single-quoted regex */
2906 else if (PL_lex_inpat && SvIVX(PL_linestr) == '\'')
2907 goto default_action;
2909 /* check for embedded arrays
2910 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
2912 else if (*s == '@' && s[1]) {
2913 if (isALNUM_lazy_if(s+1,UTF))
2915 if (strchr(":'{$", s[1]))
2917 if (!PL_lex_inpat && (s[1] == '+' || s[1] == '-'))
2918 break; /* in regexp, neither @+ nor @- are interpolated */
2921 /* check for embedded scalars. only stop if we're sure it's a
2924 else if (*s == '$') {
2925 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
2927 if (s + 1 < send && !strchr("()| \r\n\t", s[1])) {
2929 Perl_ck_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
2930 "Possible unintended interpolation of $\\ in regex");
2932 break; /* in regexp, $ might be tail anchor */
2936 /* End of else if chain - OP_TRANS rejoin rest */
2939 if (*s == '\\' && s+1 < send) {
2940 char* e; /* Can be used for ending '}', etc. */
2944 /* warn on \1 - \9 in substitution replacements, but note that \11
2945 * is an octal; and \19 is \1 followed by '9' */
2946 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
2947 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
2949 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
2954 /* string-change backslash escapes */
2955 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQF", *s)) {
2959 /* In a pattern, process \N, but skip any other backslash escapes.
2960 * This is because we don't want to translate an escape sequence
2961 * into a meta symbol and have the regex compiler use the meta
2962 * symbol meaning, e.g. \x{2E} would be confused with a dot. But
2963 * in spite of this, we do have to process \N here while the proper
2964 * charnames handler is in scope. See bugs #56444 and #62056.
2965 * There is a complication because \N in a pattern may also stand
2966 * for 'match a non-nl', and not mean a charname, in which case its
2967 * processing should be deferred to the regex compiler. To be a
2968 * charname it must be followed immediately by a '{', and not look
2969 * like \N followed by a curly quantifier, i.e., not something like
2970 * \N{3,}. regcurly returns a boolean indicating if it is a legal
2972 else if (PL_lex_inpat
2975 || regcurly(s + 1)))
2977 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
2978 goto default_action;
2983 /* quoted - in transliterations */
2985 if (PL_lex_inwhat == OP_TRANS) {
2993 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
2994 "Unrecognized escape \\%c passed through",
2996 /* default action is to copy the quoted character */
2997 goto default_action;
3000 /* eg. \132 indicates the octal constant 0132 */
3001 case '0': case '1': case '2': case '3':
3002 case '4': case '5': case '6': case '7':
3006 uv = NATIVE_TO_UNI(grok_oct(s, &len, &flags, NULL));
3009 goto NUM_ESCAPE_INSERT;
3011 /* eg. \o{24} indicates the octal constant \024 */
3017 bool valid = grok_bslash_o(s, &uv, &len, &error, 1);
3023 goto NUM_ESCAPE_INSERT;
3026 /* eg. \x24 indicates the hex constant 0x24 */
3032 bool valid = grok_bslash_x(s, &uv, &len, &error, 1);
3041 /* Insert oct or hex escaped character. There will always be
3042 * enough room in sv since such escapes will be longer than any
3043 * UTF-8 sequence they can end up as, except if they force us
3044 * to recode the rest of the string into utf8 */
3046 /* Here uv is the ordinal of the next character being added in
3047 * unicode (converted from native). */
3048 if (!UNI_IS_INVARIANT(uv)) {
3049 if (!has_utf8 && uv > 255) {
3050 /* Might need to recode whatever we have accumulated so
3051 * far if it contains any chars variant in utf8 or
3054 SvCUR_set(sv, d - SvPVX_const(sv));
3057 /* See Note on sizing above. */
3058 sv_utf8_upgrade_flags_grow(sv,
3059 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3060 UNISKIP(uv) + (STRLEN)(send - s) + 1);
3061 d = SvPVX(sv) + SvCUR(sv);
3066 d = (char*)uvuni_to_utf8((U8*)d, uv);
3067 if (PL_lex_inwhat == OP_TRANS &&
3068 PL_sublex_info.sub_op) {
3069 PL_sublex_info.sub_op->op_private |=
3070 (PL_lex_repl ? OPpTRANS_FROM_UTF
3074 if (uv > 255 && !dorange)
3075 native_range = FALSE;
3088 /* In a non-pattern \N must be a named character, like \N{LATIN
3089 * SMALL LETTER A} or \N{U+0041}. For patterns, it also can
3090 * mean to match a non-newline. For non-patterns, named
3091 * characters are converted to their string equivalents. In
3092 * patterns, named characters are not converted to their
3093 * ultimate forms for the same reasons that other escapes
3094 * aren't. Instead, they are converted to the \N{U+...} form
3095 * to get the value from the charnames that is in effect right
3096 * now, while preserving the fact that it was a named character
3097 * so that the regex compiler knows this */
3099 /* This section of code doesn't generally use the
3100 * NATIVE_TO_NEED() macro to transform the input. I (khw) did
3101 * a close examination of this macro and determined it is a
3102 * no-op except on utfebcdic variant characters. Every
3103 * character generated by this that would normally need to be
3104 * enclosed by this macro is invariant, so the macro is not
3105 * needed, and would complicate use of copy(). XXX There are
3106 * other parts of this file where the macro is used
3107 * inconsistently, but are saved by it being a no-op */
3109 /* The structure of this section of code (besides checking for
3110 * errors and upgrading to utf8) is:
3111 * Further disambiguate between the two meanings of \N, and if
3112 * not a charname, go process it elsewhere
3113 * If of form \N{U+...}, pass it through if a pattern;
3114 * otherwise convert to utf8
3115 * Otherwise must be \N{NAME}: convert to \N{U+c1.c2...} if a
3116 * pattern; otherwise convert to utf8 */
3118 /* Here, s points to the 'N'; the test below is guaranteed to
3119 * succeed if we are being called on a pattern as we already
3120 * know from a test above that the next character is a '{'.
3121 * On a non-pattern \N must mean 'named sequence, which
3122 * requires braces */
3125 yyerror("Missing braces on \\N{}");
3130 /* If there is no matching '}', it is an error. */
3131 if (! (e = strchr(s, '}'))) {
3132 if (! PL_lex_inpat) {
3133 yyerror("Missing right brace on \\N{}");
3135 yyerror("Missing right brace on \\N{} or unescaped left brace after \\N.");
3140 /* Here it looks like a named character */
3144 /* XXX This block is temporary code. \N{} implies that the
3145 * pattern is to have Unicode semantics, and therefore
3146 * currently has to be encoded in utf8. By putting it in
3147 * utf8 now, we save a whole pass in the regular expression
3148 * compiler. Once that code is changed so Unicode
3149 * semantics doesn't necessarily have to be in utf8, this
3150 * block should be removed. However, the code that parses
3151 * the output of this would have to be changed to not
3152 * necessarily expect utf8 */
3154 SvCUR_set(sv, d - SvPVX_const(sv));
3157 /* See Note on sizing above. */
3158 sv_utf8_upgrade_flags_grow(sv,
3159 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3160 /* 5 = '\N{' + cur char + NUL */
3161 (STRLEN)(send - s) + 5);
3162 d = SvPVX(sv) + SvCUR(sv);
3167 if (*s == 'U' && s[1] == '+') { /* \N{U+...} */
3168 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES
3169 | PERL_SCAN_DISALLOW_PREFIX;
3172 /* For \N{U+...}, the '...' is a unicode value even on
3173 * EBCDIC machines */
3174 s += 2; /* Skip to next char after the 'U+' */
3176 uv = grok_hex(s, &len, &flags, NULL);
3177 if (len == 0 || len != (STRLEN)(e - s)) {
3178 yyerror("Invalid hexadecimal number in \\N{U+...}");
3185 /* On non-EBCDIC platforms, pass through to the regex
3186 * compiler unchanged. The reason we evaluated the
3187 * number above is to make sure there wasn't a syntax
3188 * error. But on EBCDIC we convert to native so
3189 * downstream code can continue to assume it's native
3191 s -= 5; /* Include the '\N{U+' */
3193 d += my_snprintf(d, e - s + 1 + 1, /* includes the }
3196 (unsigned int) UNI_TO_NATIVE(uv));
3198 Copy(s, d, e - s + 1, char); /* 1 = include the } */
3202 else { /* Not a pattern: convert the hex to string */
3204 /* If destination is not in utf8, unconditionally
3205 * recode it to be so. This is because \N{} implies
3206 * Unicode semantics, and scalars have to be in utf8
3207 * to guarantee those semantics */
3209 SvCUR_set(sv, d - SvPVX_const(sv));
3212 /* See Note on sizing above. */
3213 sv_utf8_upgrade_flags_grow(
3215 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3216 UNISKIP(uv) + (STRLEN)(send - e) + 1);
3217 d = SvPVX(sv) + SvCUR(sv);
3221 /* Add the string to the output */
3222 if (UNI_IS_INVARIANT(uv)) {
3225 else d = (char*)uvuni_to_utf8((U8*)d, uv);
3228 else { /* Here is \N{NAME} but not \N{U+...}. */
3230 SV *res; /* result from charnames */
3231 const char *str; /* the string in 'res' */
3232 STRLEN len; /* its length */
3234 /* Get the value for NAME */
3235 res = newSVpvn(s, e - s);
3236 res = new_constant( NULL, 0, "charnames",
3237 /* includes all of: \N{...} */
3238 res, NULL, s - 3, e - s + 4 );
3240 /* Most likely res will be in utf8 already since the
3241 * standard charnames uses pack U, but a custom translator
3242 * can leave it otherwise, so make sure. XXX This can be
3243 * revisited to not have charnames use utf8 for characters
3244 * that don't need it when regexes don't have to be in utf8
3245 * for Unicode semantics. If doing so, remember EBCDIC */
3246 sv_utf8_upgrade(res);
3247 str = SvPV_const(res, len);
3249 /* Don't accept malformed input */
3250 if (! is_utf8_string((U8 *) str, len)) {
3251 yyerror("Malformed UTF-8 returned by \\N");
3253 else if (PL_lex_inpat) {
3255 if (! len) { /* The name resolved to an empty string */
3256 Copy("\\N{}", d, 4, char);
3260 /* In order to not lose information for the regex
3261 * compiler, pass the result in the specially made
3262 * syntax: \N{U+c1.c2.c3...}, where c1 etc. are
3263 * the code points in hex of each character
3264 * returned by charnames */
3266 const char *str_end = str + len;
3267 STRLEN char_length; /* cur char's byte length */
3268 STRLEN output_length; /* and the number of bytes
3269 after this is translated
3271 const STRLEN off = d - SvPVX_const(sv);
3273 /* 2 hex per byte; 2 chars for '\N'; 2 chars for
3274 * max('U+', '.'); and 1 for NUL */
3275 char hex_string[2 * UTF8_MAXBYTES + 5];
3277 /* Get the first character of the result. */
3278 U32 uv = utf8n_to_uvuni((U8 *) str,
3283 /* The call to is_utf8_string() above hopefully
3284 * guarantees that there won't be an error. But
3285 * it's easy here to make sure. The function just
3286 * above warns and returns 0 if invalid utf8, but
3287 * it can also return 0 if the input is validly a
3288 * NUL. Disambiguate */
3289 if (uv == 0 && NATIVE_TO_ASCII(*str) != '\0') {
3290 uv = UNICODE_REPLACEMENT;
3293 /* Convert first code point to hex, including the
3294 * boiler plate before it. For all these, we
3295 * convert to native format so that downstream code
3296 * can continue to assume the input is native */
3298 my_snprintf(hex_string, sizeof(hex_string),
3300 (unsigned int) UNI_TO_NATIVE(uv));
3302 /* Make sure there is enough space to hold it */
3303 d = off + SvGROW(sv, off
3305 + (STRLEN)(send - e)
3306 + 2); /* '}' + NUL */
3308 Copy(hex_string, d, output_length, char);
3311 /* For each subsequent character, append dot and
3312 * its ordinal in hex */
3313 while ((str += char_length) < str_end) {
3314 const STRLEN off = d - SvPVX_const(sv);
3315 U32 uv = utf8n_to_uvuni((U8 *) str,
3319 if (uv == 0 && NATIVE_TO_ASCII(*str) != '\0') {
3320 uv = UNICODE_REPLACEMENT;
3324 my_snprintf(hex_string, sizeof(hex_string),
3326 (unsigned int) UNI_TO_NATIVE(uv));
3328 d = off + SvGROW(sv, off
3330 + (STRLEN)(send - e)
3331 + 2); /* '}' + NUL */
3332 Copy(hex_string, d, output_length, char);
3336 *d++ = '}'; /* Done. Add the trailing brace */
3339 else { /* Here, not in a pattern. Convert the name to a
3342 /* If destination is not in utf8, unconditionally
3343 * recode it to be so. This is because \N{} implies
3344 * Unicode semantics, and scalars have to be in utf8
3345 * to guarantee those semantics */
3347 SvCUR_set(sv, d - SvPVX_const(sv));
3350 /* See Note on sizing above. */
3351 sv_utf8_upgrade_flags_grow(sv,
3352 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3353 len + (STRLEN)(send - s) + 1);
3354 d = SvPVX(sv) + SvCUR(sv);
3356 } else if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
3358 /* See Note on sizing above. (NOTE: SvCUR() is not
3359 * set correctly here). */
3360 const STRLEN off = d - SvPVX_const(sv);
3361 d = off + SvGROW(sv, off + len + (STRLEN)(send - s) + 1);
3363 Copy(str, d, len, char);
3368 /* Deprecate non-approved name syntax */
3369 if (ckWARN_d(WARN_DEPRECATED)) {
3370 bool problematic = FALSE;
3373 /* For non-ut8 input, look to see that the first
3374 * character is an alpha, then loop through the rest
3375 * checking that each is a continuation */
3377 if (! isALPHAU(*i)) problematic = TRUE;
3378 else for (i = s + 1; i < e; i++) {
3379 if (isCHARNAME_CONT(*i)) continue;
3385 /* Similarly for utf8. For invariants can check
3386 * directly. We accept anything above the latin1
3387 * range because it is immaterial to Perl if it is
3388 * correct or not, and is expensive to check. But
3389 * it is fairly easy in the latin1 range to convert
3390 * the variants into a single character and check
3392 if (UTF8_IS_INVARIANT(*i)) {
3393 if (! isALPHAU(*i)) problematic = TRUE;
3394 } else if (UTF8_IS_DOWNGRADEABLE_START(*i)) {
3395 if (! isALPHAU(UNI_TO_NATIVE(TWO_BYTE_UTF8_TO_UNI(*i,
3401 if (! problematic) for (i = s + UTF8SKIP(s);
3405 if (UTF8_IS_INVARIANT(*i)) {
3406 if (isCHARNAME_CONT(*i)) continue;
3407 } else if (! UTF8_IS_DOWNGRADEABLE_START(*i)) {
3409 } else if (isCHARNAME_CONT(
3411 TWO_BYTE_UTF8_TO_UNI(*i, *(i+1)))))
3420 /* The e-i passed to the final %.*s makes sure that
3421 * should the trailing NUL be missing that this
3422 * print won't run off the end of the string */
3423 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
3424 "Deprecated character in \\N{...}; marked by <-- HERE in \\N{%.*s<-- HERE %.*s",
3425 (int)(i - s + 1), s, (int)(e - i), i + 1);
3428 } /* End \N{NAME} */
3431 native_range = FALSE; /* \N{} is defined to be Unicode */
3433 s = e + 1; /* Point to just after the '}' */
3436 /* \c is a control character */
3440 *d++ = grok_bslash_c(*s++, has_utf8, 1);
3443 yyerror("Missing control char name in \\c");
3447 /* printf-style backslashes, formfeeds, newlines, etc */
3449 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
3452 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
3455 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
3458 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
3461 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
3464 *d++ = ASCII_TO_NEED(has_utf8,'\033');
3467 *d++ = ASCII_TO_NEED(has_utf8,'\007');
3473 } /* end if (backslash) */
3480 /* If we started with encoded form, or already know we want it,
3481 then encode the next character */
3482 if (! NATIVE_IS_INVARIANT((U8)(*s)) && (this_utf8 || has_utf8)) {
3486 /* One might think that it is wasted effort in the case of the
3487 * source being utf8 (this_utf8 == TRUE) to take the next character
3488 * in the source, convert it to an unsigned value, and then convert
3489 * it back again. But the source has not been validated here. The
3490 * routine that does the conversion checks for errors like
3493 const UV nextuv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
3494 const STRLEN need = UNISKIP(NATIVE_TO_UNI(nextuv));
3496 SvCUR_set(sv, d - SvPVX_const(sv));
3499 /* See Note on sizing above. */
3500 sv_utf8_upgrade_flags_grow(sv,
3501 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3502 need + (STRLEN)(send - s) + 1);
3503 d = SvPVX(sv) + SvCUR(sv);
3505 } else if (need > len) {
3506 /* encoded value larger than old, may need extra space (NOTE:
3507 * SvCUR() is not set correctly here). See Note on sizing
3509 const STRLEN off = d - SvPVX_const(sv);
3510 d = SvGROW(sv, off + need + (STRLEN)(send - s) + 1) + off;
3514 d = (char*)uvchr_to_utf8((U8*)d, nextuv);
3516 if (uv > 255 && !dorange)
3517 native_range = FALSE;
3521 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
3523 } /* while loop to process each character */
3525 /* terminate the string and set up the sv */
3527 SvCUR_set(sv, d - SvPVX_const(sv));
3528 if (SvCUR(sv) >= SvLEN(sv))
3529 Perl_croak(aTHX_ "panic: constant overflowed allocated space, %"UVuf
3530 " >= %"UVuf, (UV)SvCUR(sv), (UV)SvLEN(sv));
3533 if (PL_encoding && !has_utf8) {
3534 sv_recode_to_utf8(sv, PL_encoding);
3540 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
3541 PL_sublex_info.sub_op->op_private |=
3542 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
3546 /* shrink the sv if we allocated more than we used */
3547 if (SvCUR(sv) + 5 < SvLEN(sv)) {
3548 SvPV_shrink_to_cur(sv);
3551 /* return the substring (via pl_yylval) only if we parsed anything */
3552 if (s > PL_bufptr) {
3553 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) ) {
3554 const char *const key = PL_lex_inpat ? "qr" : "q";
3555 const STRLEN keylen = PL_lex_inpat ? 2 : 1;
3559 if (PL_lex_inwhat == OP_TRANS) {
3562 } else if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat) {
3565 } else if (PL_lex_inpat && SvIVX(PL_linestr) == '\'') {
3573 sv = S_new_constant(aTHX_ start, s - start, key, keylen, sv, NULL,
3576 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3583 * Returns TRUE if there's more to the expression (e.g., a subscript),
3586 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
3588 * ->[ and ->{ return TRUE
3589 * { and [ outside a pattern are always subscripts, so return TRUE
3590 * if we're outside a pattern and it's not { or [, then return FALSE
3591 * if we're in a pattern and the first char is a {
3592 * {4,5} (any digits around the comma) returns FALSE
3593 * if we're in a pattern and the first char is a [
3595 * [SOMETHING] has a funky algorithm to decide whether it's a
3596 * character class or not. It has to deal with things like
3597 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
3598 * anything else returns TRUE
3601 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
3604 S_intuit_more(pTHX_ register char *s)
3608 PERL_ARGS_ASSERT_INTUIT_MORE;
3610 if (PL_lex_brackets)
3612 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
3614 if (*s != '{' && *s != '[')
3619 /* In a pattern, so maybe we have {n,m}. */
3627 /* On the other hand, maybe we have a character class */
3630 if (*s == ']' || *s == '^')
3633 /* this is terrifying, and it works */
3634 int weight = 2; /* let's weigh the evidence */
3636 unsigned char un_char = 255, last_un_char;
3637 const char * const send = strchr(s,']');
3638 char tmpbuf[sizeof PL_tokenbuf * 4];
3640 if (!send) /* has to be an expression */
3643 Zero(seen,256,char);
3646 else if (isDIGIT(*s)) {
3648 if (isDIGIT(s[1]) && s[2] == ']')
3654 for (; s < send; s++) {
3655 last_un_char = un_char;
3656 un_char = (unsigned char)*s;
3661 weight -= seen[un_char] * 10;
3662 if (isALNUM_lazy_if(s+1,UTF)) {
3664 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
3665 len = (int)strlen(tmpbuf);
3666 if (len > 1 && gv_fetchpvn_flags(tmpbuf, len,
3667 UTF ? SVf_UTF8 : 0, SVt_PV))
3672 else if (*s == '$' && s[1] &&
3673 strchr("[#!%*<>()-=",s[1])) {
3674 if (/*{*/ strchr("])} =",s[2]))
3683 if (strchr("wds]",s[1]))
3685 else if (seen[(U8)'\''] || seen[(U8)'"'])
3687 else if (strchr("rnftbxcav",s[1]))
3689 else if (isDIGIT(s[1])) {
3691 while (s[1] && isDIGIT(s[1]))
3701 if (strchr("aA01! ",last_un_char))
3703 if (strchr("zZ79~",s[1]))
3705 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
3706 weight -= 5; /* cope with negative subscript */
3709 if (!isALNUM(last_un_char)
3710 && !(last_un_char == '$' || last_un_char == '@'
3711 || last_un_char == '&')
3712 && isALPHA(*s) && s[1] && isALPHA(s[1])) {
3717 if (keyword(tmpbuf, d - tmpbuf, 0))
3720 if (un_char == last_un_char + 1)
3722 weight -= seen[un_char];
3727 if (weight >= 0) /* probably a character class */
3737 * Does all the checking to disambiguate
3739 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
3740 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
3742 * First argument is the stuff after the first token, e.g. "bar".
3744 * Not a method if foo is a filehandle.
3745 * Not a method if foo is a subroutine prototyped to take a filehandle.
3746 * Not a method if it's really "Foo $bar"
3747 * Method if it's "foo $bar"
3748 * Not a method if it's really "print foo $bar"
3749 * Method if it's really "foo package::" (interpreted as package->foo)
3750 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
3751 * Not a method if bar is a filehandle or package, but is quoted with
3756 S_intuit_method(pTHX_ char *start, GV *gv, CV *cv)
3759 char *s = start + (*start == '$');
3760 char tmpbuf[sizeof PL_tokenbuf];
3767 PERL_ARGS_ASSERT_INTUIT_METHOD;
3769 if (gv && SvTYPE(gv) == SVt_PVGV && GvIO(gv))
3771 if (cv && SvPOK(cv)) {
3772 const char *proto = CvPROTO(cv);
3780 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3781 /* start is the beginning of the possible filehandle/object,
3782 * and s is the end of it
3783 * tmpbuf is a copy of it
3786 if (*start == '$') {
3787 if (cv || PL_last_lop_op == OP_PRINT || PL_last_lop_op == OP_SAY ||
3788 isUPPER(*PL_tokenbuf))
3791 len = start - SvPVX(PL_linestr);
3795 start = SvPVX(PL_linestr) + len;
3799 return *s == '(' ? FUNCMETH : METHOD;
3801 if (!keyword(tmpbuf, len, 0)) {
3802 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
3806 soff = s - SvPVX(PL_linestr);
3810 indirgv = gv_fetchpvn_flags(tmpbuf, len, ( UTF ? SVf_UTF8 : 0 ), SVt_PVCV);
3811 if (indirgv && GvCVu(indirgv))
3813 /* filehandle or package name makes it a method */
3814 if (!cv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, UTF ? SVf_UTF8 : 0)) {
3816 soff = s - SvPVX(PL_linestr);
3819 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
3820 return 0; /* no assumptions -- "=>" quotes bareword */
3822 start_force(PL_curforce);
3823 NEXTVAL_NEXTTOKE.opval = (OP*)newSVOP(OP_CONST, 0,
3824 S_newSV_maybe_utf8(aTHX_ tmpbuf, len));
3825 NEXTVAL_NEXTTOKE.opval->op_private = OPpCONST_BARE;
3827 curmad('X', newSVpvn_flags(start,SvPVX(PL_linestr) + soff - start,
3828 ( UTF ? SVf_UTF8 : 0 )));
3833 PL_bufptr = SvPVX(PL_linestr) + soff; /* restart before space */
3835 return *s == '(' ? FUNCMETH : METHOD;
3841 /* Encoded script support. filter_add() effectively inserts a
3842 * 'pre-processing' function into the current source input stream.
3843 * Note that the filter function only applies to the current source file
3844 * (e.g., it will not affect files 'require'd or 'use'd by this one).
3846 * The datasv parameter (which may be NULL) can be used to pass
3847 * private data to this instance of the filter. The filter function
3848 * can recover the SV using the FILTER_DATA macro and use it to
3849 * store private buffers and state information.
3851 * The supplied datasv parameter is upgraded to a PVIO type
3852 * and the IoDIRP/IoANY field is used to store the function pointer,
3853 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
3854 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
3855 * private use must be set using malloc'd pointers.
3859 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
3868 if (PL_parser->lex_flags & LEX_IGNORE_UTF8_HINTS)
3869 Perl_croak(aTHX_ "Source filters apply only to byte streams");
3871 if (!PL_rsfp_filters)
3872 PL_rsfp_filters = newAV();
3875 SvUPGRADE(datasv, SVt_PVIO);
3876 IoANY(datasv) = FPTR2DPTR(void *, funcp); /* stash funcp into spare field */
3877 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
3878 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
3879 FPTR2DPTR(void *, IoANY(datasv)),
3880 SvPV_nolen(datasv)));
3881 av_unshift(PL_rsfp_filters, 1);
3882 av_store(PL_rsfp_filters, 0, datasv) ;
3884 !PL_parser->filtered
3885 && PL_parser->lex_flags & LEX_EVALBYTES
3886 && PL_bufptr < PL_bufend
3888 const char *s = PL_bufptr;
3889 while (s < PL_bufend) {
3891 SV *linestr = PL_parser->linestr;
3892 char *buf = SvPVX(linestr);
3893 STRLEN const bufptr_pos = PL_parser->bufptr - buf;
3894 STRLEN const oldbufptr_pos = PL_parser->oldbufptr - buf;
3895 STRLEN const oldoldbufptr_pos=PL_parser->oldoldbufptr-buf;
3896 STRLEN const linestart_pos = PL_parser->linestart - buf;
3897 STRLEN const last_uni_pos =
3898 PL_parser->last_uni ? PL_parser->last_uni - buf : 0;
3899 STRLEN const last_lop_pos =
3900 PL_parser->last_lop ? PL_parser->last_lop - buf : 0;
3901 av_push(PL_rsfp_filters, linestr);
3902 PL_parser->linestr =
3903 newSVpvn(SvPVX(linestr), ++s-SvPVX(linestr));
3904 buf = SvPVX(PL_parser->linestr);
3905 PL_parser->bufend = buf + SvCUR(PL_parser->linestr);
3906 PL_parser->bufptr = buf + bufptr_pos;
3907 PL_parser->oldbufptr = buf + oldbufptr_pos;
3908 PL_parser->oldoldbufptr = buf + oldoldbufptr_pos;
3909 PL_parser->linestart = buf + linestart_pos;
3910 if (PL_parser->last_uni)
3911 PL_parser->last_uni = buf + last_uni_pos;
3912 if (PL_parser->last_lop)
3913 PL_parser->last_lop = buf + last_lop_pos;
3914 SvLEN(linestr) = SvCUR(linestr);
3915 SvCUR(linestr) = s-SvPVX(linestr);
3916 PL_parser->filtered = 1;
3926 /* Delete most recently added instance of this filter function. */
3928 Perl_filter_del(pTHX_ filter_t funcp)
3933 PERL_ARGS_ASSERT_FILTER_DEL;
3936 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p",
3937 FPTR2DPTR(void*, funcp)));
3939 if (!PL_parser || !PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
3941 /* if filter is on top of stack (usual case) just pop it off */
3942 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
3943 if (IoANY(datasv) == FPTR2DPTR(void *, funcp)) {
3944 sv_free(av_pop(PL_rsfp_filters));
3948 /* we need to search for the correct entry and clear it */
3949 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
3953 /* Invoke the idxth filter function for the current rsfp. */
3954 /* maxlen 0 = read one text line */
3956 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
3961 /* This API is bad. It should have been using unsigned int for maxlen.
3962 Not sure if we want to change the API, but if not we should sanity
3963 check the value here. */
3964 unsigned int correct_length
3973 PERL_ARGS_ASSERT_FILTER_READ;
3975 if (!PL_parser || !PL_rsfp_filters)
3977 if (idx > AvFILLp(PL_rsfp_filters)) { /* Any more filters? */
3978 /* Provide a default input filter to make life easy. */
3979 /* Note that we append to the line. This is handy. */
3980 DEBUG_P(PerlIO_printf(Perl_debug_log,
3981 "filter_read %d: from rsfp\n", idx));
3982 if (correct_length) {
3985 const int old_len = SvCUR(buf_sv);
3987 /* ensure buf_sv is large enough */
3988 SvGROW(buf_sv, (STRLEN)(old_len + correct_length + 1)) ;
3989 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len,
3990 correct_length)) <= 0) {
3991 if (PerlIO_error(PL_rsfp))
3992 return -1; /* error */
3994 return 0 ; /* end of file */
3996 SvCUR_set(buf_sv, old_len + len) ;
3997 SvPVX(buf_sv)[old_len + len] = '\0';
4000 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
4001 if (PerlIO_error(PL_rsfp))
4002 return -1; /* error */
4004 return 0 ; /* end of file */
4007 return SvCUR(buf_sv);
4009 /* Skip this filter slot if filter has been deleted */
4010 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef) {
4011 DEBUG_P(PerlIO_printf(Perl_debug_log,
4012 "filter_read %d: skipped (filter deleted)\n",
4014 return FILTER_READ(idx+1, buf_sv, correct_length); /* recurse */
4016 if (SvTYPE(datasv) != SVt_PVIO) {
4017 if (correct_length) {
4019 const STRLEN remainder = SvLEN(datasv) - SvCUR(datasv);
4020 if (!remainder) return 0; /* eof */
4021 if (correct_length > remainder) correct_length = remainder;
4022 sv_catpvn(buf_sv, SvEND(datasv), correct_length);
4023 SvCUR_set(datasv, SvCUR(datasv) + correct_length);
4026 const char *s = SvEND(datasv);
4027 const char *send = SvPVX(datasv) + SvLEN(datasv);
4035 if (s == send) return 0; /* eof */
4036 sv_catpvn(buf_sv, SvEND(datasv), s-SvEND(datasv));
4037 SvCUR_set(datasv, s-SvPVX(datasv));
4039 return SvCUR(buf_sv);
4041 /* Get function pointer hidden within datasv */
4042 funcp = DPTR2FPTR(filter_t, IoANY(datasv));
4043 DEBUG_P(PerlIO_printf(Perl_debug_log,
4044 "filter_read %d: via function %p (%s)\n",
4045 idx, (void*)datasv, SvPV_nolen_const(datasv)));
4046 /* Call function. The function is expected to */
4047 /* call "FILTER_READ(idx+1, buf_sv)" first. */
4048 /* Return: <0:error, =0:eof, >0:not eof */
4049 return (*funcp)(aTHX_ idx, buf_sv, correct_length);
4053 S_filter_gets(pTHX_ register SV *sv, STRLEN append)
4057 PERL_ARGS_ASSERT_FILTER_GETS;
4059 #ifdef PERL_CR_FILTER
4060 if (!PL_rsfp_filters) {
4061 filter_add(S_cr_textfilter,NULL);
4064 if (PL_rsfp_filters) {
4066 SvCUR_set(sv, 0); /* start with empty line */
4067 if (FILTER_READ(0, sv, 0) > 0)
4068 return ( SvPVX(sv) ) ;
4073 return (sv_gets(sv, PL_rsfp, append));
4077 S_find_in_my_stash(pTHX_ const char *pkgname, STRLEN len)
4082 PERL_ARGS_ASSERT_FIND_IN_MY_STASH;
4084 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
4088 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
4089 (gv = gv_fetchpvn_flags(pkgname, len, ( UTF ? SVf_UTF8 : 0 ), SVt_PVHV)))
4091 return GvHV(gv); /* Foo:: */
4094 /* use constant CLASS => 'MyClass' */
4095 gv = gv_fetchpvn_flags(pkgname, len, UTF ? SVf_UTF8 : 0, SVt_PVCV);
4096 if (gv && GvCV(gv)) {
4097 SV * const sv = cv_const_sv(GvCV(gv));
4099 pkgname = SvPV_const(sv, len);
4102 return gv_stashpvn(pkgname, len, UTF ? SVf_UTF8 : 0);
4106 * S_readpipe_override
4107 * Check whether readpipe() is overridden, and generates the appropriate
4108 * optree, provided sublex_start() is called afterwards.
4111 S_readpipe_override(pTHX)
4114 GV *gv_readpipe = gv_fetchpvs("readpipe", GV_NOTQUAL, SVt_PVCV);
4115 pl_yylval.ival = OP_BACKTICK;
4117 && GvCVu(gv_readpipe) && GvIMPORTED_CV(gv_readpipe))
4119 ((gvp = (GV**)hv_fetchs(PL_globalstash, "readpipe", FALSE))
4120 && (gv_readpipe = *gvp) && isGV_with_GP(gv_readpipe)
4121 && GvCVu(gv_readpipe) && GvIMPORTED_CV(gv_readpipe)))
4123 PL_lex_op = (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
4124 op_append_elem(OP_LIST,
4125 newSVOP(OP_CONST, 0, &PL_sv_undef), /* value will be read later */
4126 newCVREF(0, newGVOP(OP_GV, 0, gv_readpipe))));
4133 * The intent of this yylex wrapper is to minimize the changes to the
4134 * tokener when we aren't interested in collecting madprops. It remains
4135 * to be seen how successful this strategy will be...
4142 char *s = PL_bufptr;
4144 /* make sure PL_thiswhite is initialized */
4148 /* just do what yylex would do on pending identifier; leave PL_thiswhite alone */
4149 if (PL_lex_state != LEX_KNOWNEXT && PL_pending_ident)
4150 return S_pending_ident(aTHX);
4152 /* previous token ate up our whitespace? */
4153 if (!PL_lasttoke && PL_nextwhite) {
4154 PL_thiswhite = PL_nextwhite;
4158 /* isolate the token, and figure out where it is without whitespace */
4159 PL_realtokenstart = -1;
4163 assert(PL_curforce < 0);
4165 if (!PL_thismad || PL_thismad->mad_key == '^') { /* not forced already? */
4166 if (!PL_thistoken) {
4167 if (PL_realtokenstart < 0 || !CopLINE(PL_curcop))
4168 PL_thistoken = newSVpvs("");
4170 char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
4171 PL_thistoken = newSVpvn(tstart, s - tstart);
4174 if (PL_thismad) /* install head */
4175 CURMAD('X', PL_thistoken);
4178 /* last whitespace of a sublex? */
4179 if (optype == ')' && PL_endwhite) {
4180 CURMAD('X', PL_endwhite);
4185 /* if no whitespace and we're at EOF, bail. Otherwise fake EOF below. */
4186 if (!PL_thiswhite && !PL_endwhite && !optype) {
4187 sv_free(PL_thistoken);
4192 /* put off final whitespace till peg */
4193 if (optype == ';' && !PL_rsfp && !PL_parser->filtered) {
4194 PL_nextwhite = PL_thiswhite;
4197 else if (PL_thisopen) {
4198 CURMAD('q', PL_thisopen);
4200 sv_free(PL_thistoken);
4204 /* Store actual token text as madprop X */
4205 CURMAD('X', PL_thistoken);
4209 /* add preceding whitespace as madprop _ */
4210 CURMAD('_', PL_thiswhite);
4214 /* add quoted material as madprop = */
4215 CURMAD('=', PL_thisstuff);
4219 /* add terminating quote as madprop Q */
4220 CURMAD('Q', PL_thisclose);
4224 /* special processing based on optype */
4228 /* opval doesn't need a TOKEN since it can already store mp */
4239 if (pl_yylval.opval)
4240 append_madprops(PL_thismad, pl_yylval.opval, 0);
4248 addmad(newMADsv('p', PL_endwhite), &PL_thismad, 0);
4257 /* remember any fake bracket that lexer is about to discard */
4258 if (PL_lex_brackets == 1 &&
4259 ((expectation)PL_lex_brackstack[0] & XFAKEBRACK))
4262 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
4265 PL_thiswhite = newSVpvn(PL_bufptr, ++s - PL_bufptr);
4266 addmad(newMADsv('#', PL_thiswhite), &PL_thismad, 0);
4269 break; /* don't bother looking for trailing comment */
4278 /* attach a trailing comment to its statement instead of next token */
4282 if (PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == optype) {
4284 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
4286 if (*s == '\n' || *s == '#') {
4287 while (s < PL_bufend && *s != '\n')
4291 PL_thiswhite = newSVpvn(PL_bufptr, s - PL_bufptr);
4292 addmad(newMADsv('#', PL_thiswhite), &PL_thismad, 0);
4305 /* Create new token struct. Note: opvals return early above. */
4306 pl_yylval.tkval = newTOKEN(optype, pl_yylval, PL_thismad);
4313 S_tokenize_use(pTHX_ int is_use, char *s) {
4316 PERL_ARGS_ASSERT_TOKENIZE_USE;
4318 if (PL_expect != XSTATE)
4319 yyerror(Perl_form(aTHX_ "\"%s\" not allowed in expression",
4320 is_use ? "use" : "no"));
4322 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4323 s = force_version(s, TRUE);
4324 if (*s == ';' || *s == '}'
4325 || (s = SKIPSPACE1(s), (*s == ';' || *s == '}'))) {
4326 start_force(PL_curforce);
4327 NEXTVAL_NEXTTOKE.opval = NULL;
4330 else if (*s == 'v') {
4331 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4332 s = force_version(s, FALSE);
4336 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4337 s = force_version(s, FALSE);
4339 pl_yylval.ival = is_use;
4343 static const char* const exp_name[] =
4344 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
4345 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
4349 #define word_takes_any_delimeter(p,l) S_word_takes_any_delimeter(p,l)
4351 S_word_takes_any_delimeter(char *p, STRLEN len)
4353 return (len == 1 && strchr("msyq", p[0])) ||
4355 (p[0] == 't' && p[1] == 'r') ||
4356 (p[0] == 'q' && strchr("qwxr", p[1]))));
4362 Works out what to call the token just pulled out of the input
4363 stream. The yacc parser takes care of taking the ops we return and
4364 stitching them into a tree.
4370 if read an identifier
4371 if we're in a my declaration
4372 croak if they tried to say my($foo::bar)
4373 build the ops for a my() declaration
4374 if it's an access to a my() variable
4375 are we in a sort block?
4376 croak if my($a); $a <=> $b
4377 build ops for access to a my() variable
4378 if in a dq string, and they've said @foo and we can't find @foo
4380 build ops for a bareword
4381 if we already built the token before, use it.
4386 #pragma segment Perl_yylex
4392 register char *s = PL_bufptr;
4398 /* orig_keyword, gvp, and gv are initialized here because
4399 * jump to the label just_a_word_zero can bypass their
4400 * initialization later. */
4401 I32 orig_keyword = 0;
4406 SV* tmp = newSVpvs("");
4407 PerlIO_printf(Perl_debug_log, "### %"IVdf":LEX_%s/X%s %s\n",
4408 (IV)CopLINE(PL_curcop),
4409 lex_state_names[PL_lex_state],
4410 exp_name[PL_expect],
4411 pv_display(tmp, s, strlen(s), 0, 60));
4414 /* check if there's an identifier for us to look at */
4415 if (PL_lex_state != LEX_KNOWNEXT && PL_pending_ident)
4416 return REPORT(S_pending_ident(aTHX));
4418 /* no identifier pending identification */
4420 switch (PL_lex_state) {
4422 case LEX_NORMAL: /* Some compilers will produce faster */
4423 case LEX_INTERPNORMAL: /* code if we comment these out. */
4427 /* when we've already built the next token, just pull it out of the queue */
4431 pl_yylval = PL_nexttoke[PL_lasttoke].next_val;
4433 PL_thismad = PL_nexttoke[PL_lasttoke].next_mad;
4434 PL_nexttoke[PL_lasttoke].next_mad = 0;
4435 if (PL_thismad && PL_thismad->mad_key == '_') {
4436 PL_thiswhite = MUTABLE_SV(PL_thismad->mad_val);
4437 PL_thismad->mad_val = 0;
4438 mad_free(PL_thismad);
4443 PL_lex_state = PL_lex_defer;
4444 PL_expect = PL_lex_expect;
4445 PL_lex_defer = LEX_NORMAL;
4446 if (!PL_nexttoke[PL_lasttoke].next_type)
4451 pl_yylval = PL_nextval[PL_nexttoke];
4453 PL_lex_state = PL_lex_defer;
4454 PL_expect = PL_lex_expect;
4455 PL_lex_defer = LEX_NORMAL;
4461 next_type = PL_nexttoke[PL_lasttoke].next_type;
4463 next_type = PL_nexttype[PL_nexttoke];
4465 if (next_type & (7<<24)) {
4466 if (next_type & (1<<24)) {
4467 if (PL_lex_brackets > 100)
4468 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
4469 PL_lex_brackstack[PL_lex_brackets++] =
4470 (char) ((next_type >> 16) & 0xff);
4472 if (next_type & (2<<24))
4473 PL_lex_allbrackets++;
4474 if (next_type & (4<<24))
4475 PL_lex_allbrackets--;
4476 next_type &= 0xffff;
4479 /* FIXME - can these be merged? */
4482 return REPORT(next_type);
4486 /* interpolated case modifiers like \L \U, including \Q and \E.
4487 when we get here, PL_bufptr is at the \
4489 case LEX_INTERPCASEMOD:
4491 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
4493 "panic: INTERPCASEMOD bufptr=%p, bufend=%p, *bufptr=%u",
4494 PL_bufptr, PL_bufend, *PL_bufptr);
4496 /* handle \E or end of string */
4497 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
4499 if (PL_lex_casemods) {
4500 const char oldmod = PL_lex_casestack[--PL_lex_casemods];
4501 PL_lex_casestack[PL_lex_casemods] = '\0';
4503 if (PL_bufptr != PL_bufend
4504 && (oldmod == 'L' || oldmod == 'U' || oldmod == 'Q'
4505 || oldmod == 'F')) {
4507 PL_lex_state = LEX_INTERPCONCAT;
4510 PL_thistoken = newSVpvs("\\E");
4513 PL_lex_allbrackets--;
4516 else if ( PL_bufptr != PL_bufend && PL_bufptr[1] == 'E' ) {
4517 /* Got an unpaired \E */
4518 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4519 "Useless use of \\E");
4522 while (PL_bufptr != PL_bufend &&
4523 PL_bufptr[0] == '\\' && PL_bufptr[1] == 'E') {
4525 PL_thiswhite = newSVpvs("");
4526 sv_catpvn(PL_thiswhite, PL_bufptr, 2);
4530 if (PL_bufptr != PL_bufend)
4533 PL_lex_state = LEX_INTERPCONCAT;
4537 DEBUG_T({ PerlIO_printf(Perl_debug_log,
4538 "### Saw case modifier\n"); });
4540 if (s[1] == '\\' && s[2] == 'E') {
4543 PL_thiswhite = newSVpvs("");
4544 sv_catpvn(PL_thiswhite, PL_bufptr, 4);
4547 PL_lex_state = LEX_INTERPCONCAT;
4552 if (!PL_madskills) /* when just compiling don't need correct */
4553 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
4554 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
4555 if ((*s == 'L' || *s == 'U' || *s == 'F') &&
4556 (strchr(PL_lex_casestack, 'L')
4557 || strchr(PL_lex_casestack, 'U')
4558 || strchr(PL_lex_casestack, 'F'))) {
4559 PL_lex_casestack[--PL_lex_casemods] = '\0';
4560 PL_lex_allbrackets--;
4563 if (PL_lex_casemods > 10)
4564 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
4565 PL_lex_casestack[PL_lex_casemods++] = *s;
4566 PL_lex_casestack[PL_lex_casemods] = '\0';
4567 PL_lex_state = LEX_INTERPCONCAT;
4568 start_force(PL_curforce);
4569 NEXTVAL_NEXTTOKE.ival = 0;
4570 force_next((2<<24)|'(');
4571 start_force(PL_curforce);
4573 NEXTVAL_NEXTTOKE.ival = OP_LCFIRST;
4575 NEXTVAL_NEXTTOKE.ival = OP_UCFIRST;
4577 NEXTVAL_NEXTTOKE.ival = OP_LC;
4579 NEXTVAL_NEXTTOKE.ival = OP_UC;
4581 NEXTVAL_NEXTTOKE.ival = OP_QUOTEMETA;
4583 NEXTVAL_NEXTTOKE.ival = OP_FC;
4585 Perl_croak(aTHX_ "panic: yylex, *s=%u", *s);
4587 SV* const tmpsv = newSVpvs("\\ ");
4588 /* replace the space with the character we want to escape
4590 SvPVX(tmpsv)[1] = *s;
4596 if (PL_lex_starts) {
4602 sv_free(PL_thistoken);
4603 PL_thistoken = newSVpvs("");
4606 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4607 if (PL_lex_casemods == 1 && PL_lex_inpat)
4616 case LEX_INTERPPUSH:
4617 return REPORT(sublex_push());
4619 case LEX_INTERPSTART:
4620 if (PL_bufptr == PL_bufend)
4621 return REPORT(sublex_done());
4622 DEBUG_T({ if(*PL_bufptr != '(') PerlIO_printf(Perl_debug_log,
4623 "### Interpolated variable\n"); });
4625 PL_lex_dojoin = (*PL_bufptr == '@');
4626 PL_lex_state = LEX_INTERPNORMAL;
4627 if (PL_lex_dojoin) {
4628 start_force(PL_curforce);
4629 NEXTVAL_NEXTTOKE.ival = 0;
4631 start_force(PL_curforce);
4632 force_ident("\"", '$');
4633 start_force(PL_curforce);
4634 NEXTVAL_NEXTTOKE.ival = 0;
4636 start_force(PL_curforce);
4637 NEXTVAL_NEXTTOKE.ival = 0;
4638 force_next((2<<24)|'(');
4639 start_force(PL_curforce);
4640 NEXTVAL_NEXTTOKE.ival = OP_JOIN; /* emulate join($", ...) */
4643 /* Convert (?{...}) and friends to 'do {...}' */
4644 if (PL_lex_inpat && *PL_bufptr == '(') {
4645 PL_sublex_info.re_eval_start = PL_bufptr;
4647 if (*PL_bufptr != '{')
4649 start_force(PL_curforce);
4650 /* XXX probably need a CURMAD(something) here */
4651 PL_expect = XTERMBLOCK;
4655 if (PL_lex_starts++) {
4660 sv_free(PL_thistoken);
4661 PL_thistoken = newSVpvs("");
4664 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4665 if (!PL_lex_casemods && PL_lex_inpat)
4672 case LEX_INTERPENDMAYBE:
4673 if (intuit_more(PL_bufptr)) {
4674 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
4680 if (PL_lex_dojoin) {
4681 PL_lex_dojoin = FALSE;
4682 PL_lex_state = LEX_INTERPCONCAT;
4686 sv_free(PL_thistoken);
4687 PL_thistoken = newSVpvs("");
4690 PL_lex_allbrackets--;
4693 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
4694 && SvEVALED(PL_lex_repl))
4696 if (PL_bufptr != PL_bufend)
4697 Perl_croak(aTHX_ "Bad evalled substitution pattern");
4700 if (PL_sublex_info.re_eval_start) {
4701 if (*PL_bufptr != ')')
4702 Perl_croak(aTHX_ "Sequence (?{...}) not terminated with ')'");
4704 /* having compiled a (?{..}) expression, return the original
4705 * text too, as a const */
4706 start_force(PL_curforce);
4707 /* XXX probably need a CURMAD(something) here */
4708 NEXTVAL_NEXTTOKE.opval =
4709 (OP*)newSVOP(OP_CONST, 0,
4710 newSVpvn(PL_sublex_info.re_eval_start,
4711 PL_bufptr - PL_sublex_info.re_eval_start));
4713 PL_sublex_info.re_eval_start = NULL;
4719 case LEX_INTERPCONCAT:
4721 if (PL_lex_brackets)
4722 Perl_croak(aTHX_ "panic: INTERPCONCAT, lex_brackets=%ld",
4723 (long) PL_lex_brackets);
4725 if (PL_bufptr == PL_bufend)
4726 return REPORT(sublex_done());
4728 /* m'foo' still needs to be parsed for possible (?{...}) */
4729 if (SvIVX(PL_linestr) == '\'' && !PL_lex_inpat) {
4730 SV *sv = newSVsv(PL_linestr);
4732 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
4736 s = scan_const(PL_bufptr);
4738 PL_lex_state = LEX_INTERPCASEMOD;
4740 PL_lex_state = LEX_INTERPSTART;
4743 if (s != PL_bufptr) {
4744 start_force(PL_curforce);
4746 curmad('X', newSVpvn(PL_bufptr,s-PL_bufptr));
4748 NEXTVAL_NEXTTOKE = pl_yylval;
4751 if (PL_lex_starts++) {
4755 sv_free(PL_thistoken);
4756 PL_thistoken = newSVpvs("");
4759 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4760 if (!PL_lex_casemods && PL_lex_inpat)
4773 PL_lex_state = LEX_NORMAL;
4774 s = scan_formline(PL_bufptr);
4775 if (!PL_lex_formbrack)
4781 PL_oldoldbufptr = PL_oldbufptr;
4787 sv_free(PL_thistoken);
4790 PL_realtokenstart = s - SvPVX(PL_linestr); /* assume but undo on ws */
4794 if (isIDFIRST_lazy_if(s,UTF))
4797 SV *dsv = newSVpvs_flags("", SVs_TEMP);
4798 const char *c = UTF ? savepv(sv_uni_display(dsv, newSVpvn_flags(s,
4800 SVs_TEMP | SVf_UTF8),
4801 10, UNI_DISPLAY_ISPRINT))
4802 : Perl_form(aTHX_ "\\x%02X", (unsigned char)*s);
4803 len = UTF ? Perl_utf8_length(aTHX_ (U8 *) PL_linestart, (U8 *) s) : (STRLEN) (s - PL_linestart);
4804 if (len > UNRECOGNIZED_PRECEDE_COUNT) {
4805 d = UTF ? (char *) Perl_utf8_hop(aTHX_ (U8 *) s, -UNRECOGNIZED_PRECEDE_COUNT) : s - UNRECOGNIZED_PRECEDE_COUNT;
4813 Perl_croak(aTHX_ "Unrecognized character %s; marked by <-- HERE after %"SVf"<-- HERE near column %d", c, SVfARG(dsv), (int) len + 1);
4817 goto fake_eof; /* emulate EOF on ^D or ^Z */
4823 if (!PL_rsfp && (!PL_parser->filtered || s+1 < PL_bufend)) {
4826 if (PL_lex_brackets &&
4827 PL_lex_brackstack[PL_lex_brackets-1] != XFAKEEOF) {
4828 yyerror((const char *)
4830 ? "Format not terminated"
4831 : "Missing right curly or square bracket"));
4833 DEBUG_T( { PerlIO_printf(Perl_debug_log,
4834 "### Tokener got EOF\n");
4838 if (s++ < PL_bufend)
4839 goto retry; /* ignore stray nulls */
4842 if (!PL_in_eval && !PL_preambled) {
4843 PL_preambled = TRUE;
4849 /* Generate a string of Perl code to load the debugger.
4850 * If PERL5DB is set, it will return the contents of that,
4851 * otherwise a compile-time require of perl5db.pl. */
4853 const char * const pdb = PerlEnv_getenv("PERL5DB");
4856 sv_setpv(PL_linestr, pdb);
4857 sv_catpvs(PL_linestr,";");
4859 SETERRNO(0,SS_NORMAL);
4860 sv_setpvs(PL_linestr, "BEGIN { require 'perl5db.pl' };");
4863 sv_setpvs(PL_linestr,"");
4864 if (PL_preambleav) {
4865 SV **svp = AvARRAY(PL_preambleav);
4866 SV **const end = svp + AvFILLp(PL_preambleav);
4868 sv_catsv(PL_linestr, *svp);
4870 sv_catpvs(PL_linestr, ";");
4872 sv_free(MUTABLE_SV(PL_preambleav));
4873 PL_preambleav = NULL;
4876 sv_catpvs(PL_linestr,
4877 "use feature ':5." STRINGIFY(PERL_VERSION) "';");
4878 if (PL_minus_n || PL_minus_p) {
4879 sv_catpvs(PL_linestr, "LINE: while (<>) {"/*}*/);
4881 sv_catpvs(PL_linestr,"chomp;");
4884 if ((*PL_splitstr == '/' || *PL_splitstr == '\''
4885 || *PL_splitstr == '"')
4886 && strchr(PL_splitstr + 1, *PL_splitstr))
4887 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
4889 /* "q\0${splitstr}\0" is legal perl. Yes, even NUL
4890 bytes can be used as quoting characters. :-) */
4891 const char *splits = PL_splitstr;
4892 sv_catpvs(PL_linestr, "our @F=split(q\0");
4895 if (*splits == '\\')
4896 sv_catpvn(PL_linestr, splits, 1);
4897 sv_catpvn(PL_linestr, splits, 1);
4898 } while (*splits++);
4899 /* This loop will embed the trailing NUL of
4900 PL_linestr as the last thing it does before
4902 sv_catpvs(PL_linestr, ");");
4906 sv_catpvs(PL_linestr,"our @F=split(' ');");
4909 sv_catpvs(PL_linestr, "\n");
4910 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
4911 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4912 PL_last_lop = PL_last_uni = NULL;
4913 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
4914 update_debugger_info(PL_linestr, NULL, 0);
4919 bof = PL_rsfp ? TRUE : FALSE;
4922 fake_eof = LEX_FAKE_EOF;
4924 PL_bufptr = PL_bufend;
4925 CopLINE_inc(PL_curcop);
4926 if (!lex_next_chunk(fake_eof)) {
4927 CopLINE_dec(PL_curcop);
4929 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
4931 CopLINE_dec(PL_curcop);
4934 PL_realtokenstart = -1;
4937 /* If it looks like the start of a BOM or raw UTF-16,
4938 * check if it in fact is. */
4939 if (bof && PL_rsfp &&
4944 Off_t offset = (IV)PerlIO_tell(PL_rsfp);
4945 bof = (offset == (Off_t)SvCUR(PL_linestr));
4946 #if defined(PERLIO_USING_CRLF) && defined(PERL_TEXTMODE_SCRIPTS)
4947 /* offset may include swallowed CR */
4949 bof = (offset == (Off_t)SvCUR(PL_linestr)+1);
4952 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4953 s = swallow_bom((U8*)s);
4956 if (PL_parser->in_pod) {
4957 /* Incest with pod. */
4960 sv_catsv(PL_thiswhite, PL_linestr);
4962 if (*s == '=' && strnEQ(s, "=cut", 4) && !isALPHA(s[4])) {
4963 sv_setpvs(PL_linestr, "");
4964 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
4965 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4966 PL_last_lop = PL_last_uni = NULL;
4967 PL_parser->in_pod = 0;
4970 if (PL_rsfp || PL_parser->filtered)
4972 } while (PL_parser->in_pod);
4973 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
4974 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4975 PL_last_lop = PL_last_uni = NULL;
4976 if (CopLINE(PL_curcop) == 1) {
4977 while (s < PL_bufend && isSPACE(*s))
4979 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
4983 PL_thiswhite = newSVpvn(PL_linestart, s - PL_linestart);
4987 if (*s == '#' && *(s+1) == '!')
4989 #ifdef ALTERNATE_SHEBANG
4991 static char const as[] = ALTERNATE_SHEBANG;
4992 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
4993 d = s + (sizeof(as) - 1);
4995 #endif /* ALTERNATE_SHEBANG */
5004 while (*d && !isSPACE(*d))
5008 #ifdef ARG_ZERO_IS_SCRIPT
5009 if (ipathend > ipath) {
5011 * HP-UX (at least) sets argv[0] to the script name,
5012 * which makes $^X incorrect. And Digital UNIX and Linux,
5013 * at least, set argv[0] to the basename of the Perl
5014 * interpreter. So, having found "#!", we'll set it right.
5016 SV * const x = GvSV(gv_fetchpvs("\030", GV_ADD|GV_NOTQUAL,
5018 assert(SvPOK(x) || SvGMAGICAL(x));
5019 if (sv_eq(x, CopFILESV(PL_curcop))) {
5020 sv_setpvn(x, ipath, ipathend - ipath);
5026 const char *bstart = SvPV_const(CopFILESV(PL_curcop),blen);
5027 const char * const lstart = SvPV_const(x,llen);
5029 bstart += blen - llen;
5030 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
5031 sv_setpvn(x, ipath, ipathend - ipath);
5036 TAINT_NOT; /* $^X is always tainted, but that's OK */
5038 #endif /* ARG_ZERO_IS_SCRIPT */
5043 d = instr(s,"perl -");
5045 d = instr(s,"perl");
5047 /* avoid getting into infinite loops when shebang
5048 * line contains "Perl" rather than "perl" */
5050 for (d = ipathend-4; d >= ipath; --d) {
5051 if ((*d == 'p' || *d == 'P')
5052 && !ibcmp(d, "perl", 4))
5062 #ifdef ALTERNATE_SHEBANG
5064 * If the ALTERNATE_SHEBANG on this system starts with a
5065 * character that can be part of a Perl expression, then if
5066 * we see it but not "perl", we're probably looking at the
5067 * start of Perl code, not a request to hand off to some
5068 * other interpreter. Similarly, if "perl" is there, but
5069 * not in the first 'word' of the line, we assume the line
5070 * contains the start of the Perl program.
5072 if (d && *s != '#') {
5073 const char *c = ipath;
5074 while (*c && !strchr("; \t\r\n\f\v#", *c))
5077 d = NULL; /* "perl" not in first word; ignore */
5079 *s = '#'; /* Don't try to parse shebang line */
5081 #endif /* ALTERNATE_SHEBANG */
5086 !instr(s,"indir") &&
5087 instr(PL_origargv[0],"perl"))
5094 while (s < PL_bufend && isSPACE(*s))
5096 if (s < PL_bufend) {
5097 Newx(newargv,PL_origargc+3,char*);
5099 while (s < PL_bufend && !isSPACE(*s))
5102 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
5105 newargv = PL_origargv;
5108 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
5110 Perl_croak(aTHX_ "Can't exec %s", ipath);
5113 while (*d && !isSPACE(*d))
5115 while (SPACE_OR_TAB(*d))
5119 const bool switches_done = PL_doswitches;
5120 const U32 oldpdb = PL_perldb;
5121 const bool oldn = PL_minus_n;
5122 const bool oldp = PL_minus_p;
5126 bool baduni = FALSE;
5128 const char *d2 = d1 + 1;
5129 if (parse_unicode_opts((const char **)&d2)
5133 if (baduni || *d1 == 'M' || *d1 == 'm') {
5134 const char * const m = d1;
5135 while (*d1 && !isSPACE(*d1))
5137 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
5140 d1 = moreswitches(d1);
5142 if (PL_doswitches && !switches_done) {
5143 int argc = PL_origargc;
5144 char **argv = PL_origargv;
5147 } while (argc && argv[0][0] == '-' && argv[0][1]);
5148 init_argv_symbols(argc,argv);
5150 if (((PERLDB_LINE || PERLDB_SAVESRC) && !oldpdb) ||
5151 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
5152 /* if we have already added "LINE: while (<>) {",
5153 we must not do it again */
5155 sv_setpvs(PL_linestr, "");
5156 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
5157 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
5158 PL_last_lop = PL_last_uni = NULL;
5159 PL_preambled = FALSE;
5160 if (PERLDB_LINE || PERLDB_SAVESRC)
5161 (void)gv_fetchfile(PL_origfilename);
5168 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
5170 PL_lex_state = LEX_FORMLINE;
5175 #ifdef PERL_STRICT_CR
5176 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
5178 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
5180 case ' ': case '\t': case '\f': case 013:
5182 PL_realtokenstart = -1;
5184 PL_thiswhite = newSVpvs("");
5185 sv_catpvn(PL_thiswhite, s, 1);
5192 PL_realtokenstart = -1;
5196 if (PL_lex_state != LEX_NORMAL ||
5197 (PL_in_eval && !PL_rsfp && !PL_parser->filtered)) {
5198 if (*s == '#' && s == PL_linestart && PL_in_eval
5199 && !PL_rsfp && !PL_parser->filtered) {
5200 /* handle eval qq[#line 1 "foo"\n ...] */
5201 CopLINE_dec(PL_curcop);
5204 if (PL_madskills && !PL_lex_formbrack && !PL_in_eval) {
5206 if (!PL_in_eval || PL_rsfp || PL_parser->filtered)
5211 while (d < PL_bufend && *d != '\n')
5215 else if (d > PL_bufend) /* Found by Ilya: feed random input to Perl. */
5216 Perl_croak(aTHX_ "panic: input overflow, %p > %p",
5220 PL_thiswhite = newSVpvn(s, d - s);
5225 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
5227 PL_lex_state = LEX_FORMLINE;
5233 if (PL_madskills && CopLINE(PL_curcop) >= 1 && !PL_lex_formbrack) {
5234 if (CopLINE(PL_curcop) == 1 && s[0] == '#' && s[1] == '!') {
5237 TOKEN(PEG); /* make sure any #! line is accessible */
5242 /* if (PL_madskills && PL_lex_formbrack) { */
5244 while (d < PL_bufend && *d != '\n')
5248 else if (d > PL_bufend) /* Found by Ilya: feed random input to Perl. */
5249 Perl_croak(aTHX_ "panic: input overflow");
5250 if (PL_madskills && CopLINE(PL_curcop) >= 1) {
5252 PL_thiswhite = newSVpvs("");
5253 if (CopLINE(PL_curcop) == 1) {
5254 sv_setpvs(PL_thiswhite, "");
5257 sv_catpvn(PL_thiswhite, s, d - s);
5271 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
5279 while (s < PL_bufend && SPACE_OR_TAB(*s))
5282 if (strnEQ(s,"=>",2)) {
5283 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
5284 DEBUG_T( { printbuf("### Saw unary minus before =>, forcing word %s\n", s); } );
5285 OPERATOR('-'); /* unary minus */
5287 PL_last_uni = PL_oldbufptr;
5289 case 'r': ftst = OP_FTEREAD; break;
5290 case 'w': ftst = OP_FTEWRITE; break;
5291 case 'x': ftst = OP_FTEEXEC; break;
5292 case 'o': ftst = OP_FTEOWNED; break;
5293 case 'R': ftst = OP_FTRREAD; break;
5294 case 'W': ftst = OP_FTRWRITE; break;
5295 case 'X': ftst = OP_FTREXEC; break;
5296 case 'O': ftst = OP_FTROWNED; break;
5297 case 'e': ftst = OP_FTIS; break;
5298 case 'z': ftst = OP_FTZERO; break;
5299 case 's': ftst = OP_FTSIZE; break;
5300 case 'f': ftst = OP_FTFILE; break;
5301 case 'd': ftst = OP_FTDIR; break;
5302 case 'l': ftst = OP_FTLINK; break;
5303 case 'p': ftst = OP_FTPIPE; break;
5304 case 'S': ftst = OP_FTSOCK; break;
5305 case 'u': ftst = OP_FTSUID; break;
5306 case 'g': ftst = OP_FTSGID; break;
5307 case 'k': ftst = OP_FTSVTX; break;
5308 case 'b': ftst = OP_FTBLK; break;
5309 case 'c': ftst = OP_FTCHR; break;
5310 case 't': ftst = OP_FTTTY; break;
5311 case 'T': ftst = OP_FTTEXT; break;
5312 case 'B': ftst = OP_FTBINARY; break;
5313 case 'M': case 'A': case 'C':
5314 gv_fetchpvs("\024", GV_ADD|GV_NOTQUAL, SVt_PV);
5316 case 'M': ftst = OP_FTMTIME; break;
5317 case 'A': ftst = OP_FTATIME; break;
5318 case 'C': ftst = OP_FTCTIME; break;
5326 PL_last_lop_op = (OPCODE)ftst;
5327 DEBUG_T( { PerlIO_printf(Perl_debug_log,
5328 "### Saw file test %c\n", (int)tmp);
5333 /* Assume it was a minus followed by a one-letter named
5334 * subroutine call (or a -bareword), then. */
5335 DEBUG_T( { PerlIO_printf(Perl_debug_log,
5336 "### '-%c' looked like a file test but was not\n",
5343 const char tmp = *s++;
5346 if (PL_expect == XOPERATOR)
5351 else if (*s == '>') {
5354 if (isIDFIRST_lazy_if(s,UTF)) {
5355 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
5363 if (PL_expect == XOPERATOR) {
5364 if (*s == '=' && !PL_lex_allbrackets &&
5365 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
5372 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
5374 OPERATOR('-'); /* unary minus */
5380 const char tmp = *s++;
5383 if (PL_expect == XOPERATOR)
5388 if (PL_expect == XOPERATOR) {
5389 if (*s == '=' && !PL_lex_allbrackets &&
5390 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
5397 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
5404 if (PL_expect != XOPERATOR) {
5405 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
5406 PL_expect = XOPERATOR;
5407 force_ident(PL_tokenbuf, '*');
5415 if (*s == '=' && !PL_lex_allbrackets &&
5416 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
5422 if (*s == '=' && !PL_lex_allbrackets &&
5423 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
5430 if (PL_expect == XOPERATOR) {
5431 if (s[1] == '=' && !PL_lex_allbrackets &&
5432 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN)
5437 PL_tokenbuf[0] = '%';
5438 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
5439 sizeof PL_tokenbuf - 1, FALSE);
5440 if (!PL_tokenbuf[1]) {
5443 PL_pending_ident = '%';
5447 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
5448 (s[1] == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_BITWISE))
5453 if (PL_lex_brackets > 100)
5454 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
5455 PL_lex_brackstack[PL_lex_brackets++] = 0;
5456 PL_lex_allbrackets++;
5458 const char tmp = *s++;
5463 && (PL_expect == XOPERATOR || PL_expect == XTERMORDORDOR))
5465 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
5473 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMMA)
5480 goto just_a_word_zero_gv;
5483 switch (PL_expect) {
5489 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
5491 PL_bufptr = s; /* update in case we back off */
5494 "Use of := for an empty attribute list is not allowed");
5501 PL_expect = XTERMBLOCK;
5504 stuffstart = s - SvPVX(PL_linestr) - 1;
5508 while (isIDFIRST_lazy_if(s,UTF)) {
5511 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
5512 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len, 0))) {
5513 if (tmp < 0) tmp = -tmp;
5528 sv = newSVpvn_flags(s, len, UTF ? SVf_UTF8 : 0);
5530 d = scan_str(d,TRUE,TRUE,FALSE);
5532 /* MUST advance bufptr here to avoid bogus
5533 "at end of line" context messages from yyerror().
5535 PL_bufptr = s + len;
5536 yyerror("Unterminated attribute parameter in attribute list");
5540 return REPORT(0); /* EOF indicator */
5544 sv_catsv(sv, PL_lex_stuff);
5545 attrs = op_append_elem(OP_LIST, attrs,
5546 newSVOP(OP_CONST, 0, sv));
5547 SvREFCNT_dec(PL_lex_stuff);
5548 PL_lex_stuff = NULL;
5551 if (len == 6 && strnEQ(SvPVX(sv), "unique", len)) {
5553 if (PL_in_my == KEY_our) {
5554 deprecate(":unique");
5557 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
5560 /* NOTE: any CV attrs applied here need to be part of
5561 the CVf_BUILTIN_ATTRS define in cv.h! */
5562 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "lvalue", len)) {
5564 CvLVALUE_on(PL_compcv);
5566 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "locked", len)) {
5568 deprecate(":locked");
5570 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "method", len)) {
5572 CvMETHOD_on(PL_compcv);
5574 /* After we've set the flags, it could be argued that
5575 we don't need to do the attributes.pm-based setting
5576 process, and shouldn't bother appending recognized
5577 flags. To experiment with that, uncomment the
5578 following "else". (Note that's already been
5579 uncommented. That keeps the above-applied built-in
5580 attributes from being intercepted (and possibly
5581 rejected) by a package's attribute routines, but is
5582 justified by the performance win for the common case
5583 of applying only built-in attributes.) */
5585 attrs = op_append_elem(OP_LIST, attrs,
5586 newSVOP(OP_CONST, 0,
5590 if (*s == ':' && s[1] != ':')
5593 break; /* require real whitespace or :'s */
5594 /* XXX losing whitespace on sequential attributes here */
5598 = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
5599 if (*s != ';' && *s != '}' && *s != tmp
5600 && (tmp != '=' || *s != ')')) {
5601 const char q = ((*s == '\'') ? '"' : '\'');
5602 /* If here for an expression, and parsed no attrs, back
5604 if (tmp == '=' && !attrs) {
5608 /* MUST advance bufptr here to avoid bogus "at end of line"
5609 context messages from yyerror().
5612 yyerror( (const char *)
5614 ? Perl_form(aTHX_ "Invalid separator character "
5615 "%c%c%c in attribute list", q, *s, q)
5616 : "Unterminated attribute list" ) );
5624 start_force(PL_curforce);
5625 NEXTVAL_NEXTTOKE.opval = attrs;
5626 CURMAD('_', PL_nextwhite);
5631 PL_thistoken = newSVpvn(SvPVX(PL_linestr) + stuffstart,
5632 (s - SvPVX(PL_linestr)) - stuffstart);
5637 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_CLOSING) {
5641 PL_lex_allbrackets--;
5645 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
5646 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
5650 PL_lex_allbrackets++;
5653 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
5659 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_CLOSING)
5662 PL_lex_allbrackets--;
5668 if (PL_lex_brackets && PL_lex_brackstack[PL_lex_brackets-1] == XFAKEEOF)
5671 if (PL_lex_brackets <= 0)
5672 yyerror("Unmatched right square bracket");
5675 PL_lex_allbrackets--;
5676 if (PL_lex_state == LEX_INTERPNORMAL) {
5677 if (PL_lex_brackets == 0) {
5678 if (*s == '-' && s[1] == '>')
5679 PL_lex_state = LEX_INTERPENDMAYBE;
5680 else if (*s != '[' && *s != '{')
5681 PL_lex_state = LEX_INTERPEND;
5688 if (PL_lex_brackets > 100) {
5689 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
5691 switch (PL_expect) {
5693 if (PL_lex_formbrack) {
5697 if (PL_oldoldbufptr == PL_last_lop)
5698 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
5700 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5701 PL_lex_allbrackets++;
5702 OPERATOR(HASHBRACK);
5704 while (s < PL_bufend && SPACE_OR_TAB(*s))
5707 PL_tokenbuf[0] = '\0';
5708 if (d < PL_bufend && *d == '-') {
5709 PL_tokenbuf[0] = '-';
5711 while (d < PL_bufend && SPACE_OR_TAB(*d))
5714 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
5715 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
5717 while (d < PL_bufend && SPACE_OR_TAB(*d))
5720 const char minus = (PL_tokenbuf[0] == '-');
5721 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
5729 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
5730 PL_lex_allbrackets++;
5735 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5736 PL_lex_allbrackets++;
5741 if (PL_oldoldbufptr == PL_last_lop)
5742 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
5744 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5745 PL_lex_allbrackets++;
5748 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
5750 /* This hack is to get the ${} in the message. */
5752 yyerror("syntax error");
5755 OPERATOR(HASHBRACK);
5757 /* This hack serves to disambiguate a pair of curlies
5758 * as being a block or an anon hash. Normally, expectation
5759 * determines that, but in cases where we're not in a
5760 * position to expect anything in particular (like inside
5761 * eval"") we have to resolve the ambiguity. This code
5762 * covers the case where the first term in the curlies is a
5763 * quoted string. Most other cases need to be explicitly
5764 * disambiguated by prepending a "+" before the opening
5765 * curly in order to force resolution as an anon hash.
5767 * XXX should probably propagate the outer expectation
5768 * into eval"" to rely less on this hack, but that could
5769 * potentially break current behavior of eval"".
5773 if (*s == '\'' || *s == '"' || *s == '`') {
5774 /* common case: get past first string, handling escapes */
5775 for (t++; t < PL_bufend && *t != *s;)
5776 if (*t++ == '\\' && (*t == '\\' || *t == *s))
5780 else if (*s == 'q') {
5783 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
5786 /* skip q//-like construct */
5788 char open, close, term;
5791 while (t < PL_bufend && isSPACE(*t))
5793 /* check for q => */
5794 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
5795 OPERATOR(HASHBRACK);
5799 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
5803 for (t++; t < PL_bufend; t++) {
5804 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
5806 else if (*t == open)
5810 for (t++; t < PL_bufend; t++) {
5811 if (*t == '\\' && t+1 < PL_bufend)
5813 else if (*t == close && --brackets <= 0)
5815 else if (*t == open)
5822 /* skip plain q word */
5823 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
5826 else if (isALNUM_lazy_if(t,UTF)) {
5828 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
5831 while (t < PL_bufend && isSPACE(*t))
5833 /* if comma follows first term, call it an anon hash */
5834 /* XXX it could be a comma expression with loop modifiers */
5835 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
5836 || (*t == '=' && t[1] == '>')))
5837 OPERATOR(HASHBRACK);
5838 if (PL_expect == XREF)
5841 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
5847 pl_yylval.ival = CopLINE(PL_curcop);
5848 if (isSPACE(*s) || *s == '#')
5849 PL_copline = NOLINE; /* invalidate current command line number */
5852 if (PL_lex_brackets && PL_lex_brackstack[PL_lex_brackets-1] == XFAKEEOF)
5856 if (PL_lex_brackets <= 0)
5857 yyerror("Unmatched right curly bracket");
5859 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
5860 PL_lex_allbrackets--;
5861 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
5862 PL_lex_formbrack = 0;
5863 if (PL_lex_state == LEX_INTERPNORMAL) {
5864 if (PL_lex_brackets == 0) {
5865 if (PL_expect & XFAKEBRACK) {
5866 PL_expect &= XENUMMASK;
5867 PL_lex_state = LEX_INTERPEND;
5872 PL_thiswhite = newSVpvs("");
5873 sv_catpvs(PL_thiswhite,"}");
5876 return yylex(); /* ignore fake brackets */
5878 if (*s == '-' && s[1] == '>')
5879 PL_lex_state = LEX_INTERPENDMAYBE;
5880 else if (*s != '[' && *s != '{')
5881 PL_lex_state = LEX_INTERPEND;
5884 if (PL_expect & XFAKEBRACK) {
5885 PL_expect &= XENUMMASK;
5887 return yylex(); /* ignore fake brackets */
5889 start_force(PL_curforce);
5891 curmad('X', newSVpvn(s-1,1));
5892 CURMAD('_', PL_thiswhite);
5897 PL_thistoken = newSVpvs("");
5903 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
5904 (*s == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_LOGIC)) {
5911 if (PL_expect == XOPERATOR) {
5912 if (PL_bufptr == PL_linestart && ckWARN(WARN_SEMICOLON)
5913 && isIDFIRST_lazy_if(s,UTF))
5915 CopLINE_dec(PL_curcop);
5916 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), "%s", PL_warn_nosemi);
5917 CopLINE_inc(PL_curcop);
5919 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
5920 (*s == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_BITWISE)) {
5927 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
5929 PL_expect = XOPERATOR;
5930 force_ident(PL_tokenbuf, '&');
5934 pl_yylval.ival = (OPpENTERSUB_AMPER<<8);
5940 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
5941 (*s == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_LOGIC)) {
5948 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
5949 (*s == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_BITWISE)) {
5957 const char tmp = *s++;
5959 if (!PL_lex_allbrackets &&
5960 PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
5967 if (!PL_lex_allbrackets &&
5968 PL_lex_fakeeof >= LEX_FAKEEOF_COMMA) {
5976 if (tmp && isSPACE(*s) && ckWARN(WARN_SYNTAX)
5977 && strchr("+-*/%.^&|<",tmp))
5978 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5979 "Reversed %c= operator",(int)tmp);
5981 if (PL_expect == XSTATE && isALPHA(tmp) &&
5982 (s == PL_linestart+1 || s[-2] == '\n') )
5984 if (PL_in_eval && !PL_rsfp && !PL_parser->filtered) {
5989 if (strnEQ(s,"=cut",4)) {
6005 PL_thiswhite = newSVpvs("");
6006 sv_catpvn(PL_thiswhite, PL_linestart,
6007 PL_bufend - PL_linestart);
6011 PL_parser->in_pod = 1;
6015 if (PL_lex_brackets < PL_lex_formbrack) {
6017 #ifdef PERL_STRICT_CR
6018 while (SPACE_OR_TAB(*t))
6020 while (SPACE_OR_TAB(*t) || *t == '\r')
6023 if (*t == '\n' || *t == '#') {
6029 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
6038 const char tmp = *s++;
6040 /* was this !=~ where !~ was meant?
6041 * warn on m:!=~\s+([/?]|[msy]\W|tr\W): */
6043 if (*s == '~' && ckWARN(WARN_SYNTAX)) {
6044 const char *t = s+1;
6046 while (t < PL_bufend && isSPACE(*t))
6049 if (*t == '/' || *t == '?' ||
6050 ((*t == 'm' || *t == 's' || *t == 'y')
6051 && !isALNUM(t[1])) ||
6052 (*t == 't' && t[1] == 'r' && !isALNUM(t[2])))
6053 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6054 "!=~ should be !~");
6056 if (!PL_lex_allbrackets &&
6057 PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6069 if (PL_expect != XOPERATOR) {
6070 if (s[1] != '<' && !strchr(s,'>'))
6073 s = scan_heredoc(s);
6075 s = scan_inputsymbol(s);
6076 TERM(sublex_start());
6082 if (*s == '=' && !PL_lex_allbrackets &&
6083 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
6087 SHop(OP_LEFT_SHIFT);
6092 if (!PL_lex_allbrackets &&
6093 PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6100 if (!PL_lex_allbrackets &&
6101 PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6109 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6117 const char tmp = *s++;
6119 if (*s == '=' && !PL_lex_allbrackets &&
6120 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
6124 SHop(OP_RIGHT_SHIFT);
6126 else if (tmp == '=') {
6127 if (!PL_lex_allbrackets &&
6128 PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6136 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE) {
6145 if (PL_expect == XOPERATOR) {
6146 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
6147 return deprecate_commaless_var_list();
6151 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-@", s[2]))) {
6152 PL_tokenbuf[0] = '@';
6153 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
6154 sizeof PL_tokenbuf - 1, FALSE);
6155 if (PL_expect == XOPERATOR)
6156 no_op("Array length", s);
6157 if (!PL_tokenbuf[1])
6159 PL_expect = XOPERATOR;
6160 PL_pending_ident = '#';
6164 PL_tokenbuf[0] = '$';
6165 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
6166 sizeof PL_tokenbuf - 1, FALSE);
6167 if (PL_expect == XOPERATOR)
6169 if (!PL_tokenbuf[1]) {
6171 yyerror("Final $ should be \\$ or $name");
6177 const char tmp = *s;
6178 if (PL_lex_state == LEX_NORMAL || PL_lex_brackets)
6181 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop)
6182 && intuit_more(s)) {
6184 PL_tokenbuf[0] = '@';
6185 if (ckWARN(WARN_SYNTAX)) {
6188 while (isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$')
6191 PL_bufptr = PEEKSPACE(PL_bufptr); /* XXX can realloc */
6192 while (t < PL_bufend && *t != ']')
6194 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6195 "Multidimensional syntax %.*s not supported",
6196 (int)((t - PL_bufptr) + 1), PL_bufptr);
6200 else if (*s == '{') {
6202 PL_tokenbuf[0] = '%';
6203 if (strEQ(PL_tokenbuf+1, "SIG") && ckWARN(WARN_SYNTAX)
6204 && (t = strchr(s, '}')) && (t = strchr(t, '=')))
6206 char tmpbuf[sizeof PL_tokenbuf];
6209 } while (isSPACE(*t));
6210 if (isIDFIRST_lazy_if(t,UTF)) {
6212 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE,
6217 && get_cvn_flags(tmpbuf, len, UTF ? SVf_UTF8 : 0))
6218 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6219 "You need to quote \"%"SVf"\"",
6220 SVfARG(newSVpvn_flags(tmpbuf, len,
6221 SVs_TEMP | (UTF ? SVf_UTF8 : 0))));
6227 PL_expect = XOPERATOR;
6228 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
6229 const bool islop = (PL_last_lop == PL_oldoldbufptr);
6230 if (!islop || PL_last_lop_op == OP_GREPSTART)
6231 PL_expect = XOPERATOR;
6232 else if (strchr("$@\"'`q", *s))
6233 PL_expect = XTERM; /* e.g. print $fh "foo" */
6234 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
6235 PL_expect = XTERM; /* e.g. print $fh &sub */
6236 else if (isIDFIRST_lazy_if(s,UTF)) {
6237 char tmpbuf[sizeof PL_tokenbuf];
6239 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
6240 if ((t2 = keyword(tmpbuf, len, 0))) {
6241 /* binary operators exclude handle interpretations */
6253 PL_expect = XTERM; /* e.g. print $fh length() */
6258 PL_expect = XTERM; /* e.g. print $fh subr() */
6261 else if (isDIGIT(*s))
6262 PL_expect = XTERM; /* e.g. print $fh 3 */
6263 else if (*s == '.' && isDIGIT(s[1]))
6264 PL_expect = XTERM; /* e.g. print $fh .3 */
6265 else if ((*s == '?' || *s == '-' || *s == '+')
6266 && !isSPACE(s[1]) && s[1] != '=')
6267 PL_expect = XTERM; /* e.g. print $fh -1 */
6268 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '='
6270 PL_expect = XTERM; /* e.g. print $fh /.../
6271 XXX except DORDOR operator
6273 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2])
6275 PL_expect = XTERM; /* print $fh <<"EOF" */
6278 PL_pending_ident = '$';
6282 if (PL_expect == XOPERATOR)
6284 PL_tokenbuf[0] = '@';
6285 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
6286 if (!PL_tokenbuf[1]) {
6289 if (PL_lex_state == LEX_NORMAL)
6291 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
6293 PL_tokenbuf[0] = '%';
6295 /* Warn about @ where they meant $. */
6296 if (*s == '[' || *s == '{') {
6297 if (ckWARN(WARN_SYNTAX)) {
6298 const char *t = s + 1;
6299 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
6300 t += UTF ? UTF8SKIP(t) : 1;
6301 if (*t == '}' || *t == ']') {
6303 PL_bufptr = PEEKSPACE(PL_bufptr); /* XXX can realloc */
6304 /* diag_listed_as: Scalar value @%s[%s] better written as $%s[%s] */
6305 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6306 "Scalar value %"SVf" better written as $%"SVf,
6307 SVfARG(newSVpvn_flags(PL_bufptr, (STRLEN)(t-PL_bufptr),
6308 SVs_TEMP | (UTF ? SVf_UTF8 : 0 ))),
6309 SVfARG(newSVpvn_flags(PL_bufptr+1, (STRLEN)(t-PL_bufptr-1),
6310 SVs_TEMP | (UTF ? SVf_UTF8 : 0 ))));
6315 PL_pending_ident = '@';
6318 case '/': /* may be division, defined-or, or pattern */
6319 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
6320 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
6321 (s[2] == '=' ? LEX_FAKEEOF_ASSIGN : LEX_FAKEEOF_LOGIC))
6326 case '?': /* may either be conditional or pattern */
6327 if (PL_expect == XOPERATOR) {
6330 if (!PL_lex_allbrackets &&
6331 PL_lex_fakeeof >= LEX_FAKEEOF_IFELSE) {
6335 PL_lex_allbrackets++;
6341 /* A // operator. */
6342 if (!PL_lex_allbrackets && PL_lex_fakeeof >=
6343 (*s == '=' ? LEX_FAKEEOF_ASSIGN :
6344 LEX_FAKEEOF_LOGIC)) {
6352 if (*s == '=' && !PL_lex_allbrackets &&
6353 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
6362 /* Disable warning on "study /blah/" */
6363 if (PL_oldoldbufptr == PL_last_uni
6364 && (*PL_last_uni != 's' || s - PL_last_uni < 5
6365 || memNE(PL_last_uni, "study", 5)
6366 || isALNUM_lazy_if(PL_last_uni+5,UTF)
6370 deprecate("?PATTERN? without explicit operator");
6371 s = scan_pat(s,OP_MATCH);
6372 TERM(sublex_start());
6376 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
6377 #ifdef PERL_STRICT_CR
6380 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
6382 && (s == PL_linestart || s[-1] == '\n') )
6384 PL_lex_formbrack = 0;
6388 if (PL_expect == XSTATE && s[1] == '.' && s[2] == '.') {
6392 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
6395 if (!PL_lex_allbrackets &&
6396 PL_lex_fakeeof >= LEX_FAKEEOF_RANGE) {
6403 pl_yylval.ival = OPf_SPECIAL;
6409 if (*s == '=' && !PL_lex_allbrackets &&
6410 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN) {
6417 case '0': case '1': case '2': case '3': case '4':
6418 case '5': case '6': case '7': case '8': case '9':
6419 s = scan_num(s, &pl_yylval);
6420 DEBUG_T( { printbuf("### Saw number in %s\n", s); } );
6421 if (PL_expect == XOPERATOR)
6426 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
6427 DEBUG_T( { printbuf("### Saw string before %s\n", s); } );
6428 if (PL_expect == XOPERATOR) {
6429 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
6430 return deprecate_commaless_var_list();
6437 pl_yylval.ival = OP_CONST;
6438 TERM(sublex_start());
6441 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
6442 DEBUG_T( { printbuf("### Saw string before %s\n", s); } );
6443 if (PL_expect == XOPERATOR) {
6444 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
6445 return deprecate_commaless_var_list();
6452 pl_yylval.ival = OP_CONST;
6453 /* FIXME. I think that this can be const if char *d is replaced by
6454 more localised variables. */
6455 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
6456 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
6457 pl_yylval.ival = OP_STRINGIFY;
6461 TERM(sublex_start());
6464 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
6465 DEBUG_T( { printbuf("### Saw backtick string before %s\n", s); } );
6466 if (PL_expect == XOPERATOR)
6467 no_op("Backticks",s);
6470 readpipe_override();
6471 TERM(sublex_start());
6475 if (PL_lex_inwhat && isDIGIT(*s))
6476 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
6478 if (PL_expect == XOPERATOR)
6479 no_op("Backslash",s);
6483 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
6484 char *start = s + 2;
6485 while (isDIGIT(*start) || *start == '_')
6487 if (*start == '.' && isDIGIT(start[1])) {
6488 s = scan_num(s, &pl_yylval);
6491 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
6492 else if (!isALPHA(*start) && (PL_expect == XTERM
6493 || PL_expect == XREF || PL_expect == XSTATE
6494 || PL_expect == XTERMORDORDOR)) {
6495 GV *const gv = gv_fetchpvn_flags(s, start - s,
6496 UTF ? SVf_UTF8 : 0, SVt_PVCV);
6498 s = scan_num(s, &pl_yylval);
6505 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
6548 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
6550 /* Some keywords can be followed by any delimiter, including ':' */
6551 anydelim = word_takes_any_delimeter(PL_tokenbuf, len);
6553 /* x::* is just a word, unless x is "CORE" */
6554 if (!anydelim && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
6558 while (d < PL_bufend && isSPACE(*d))
6559 d++; /* no comments skipped here, or s### is misparsed */
6561 /* Is this a word before a => operator? */
6562 if (*d == '=' && d[1] == '>') {
6565 = (OP*)newSVOP(OP_CONST, 0,
6566 S_newSV_maybe_utf8(aTHX_ PL_tokenbuf, len));
6567 pl_yylval.opval->op_private = OPpCONST_BARE;
6571 /* Check for plugged-in keyword */
6575 char *saved_bufptr = PL_bufptr;
6577 result = PL_keyword_plugin(aTHX_ PL_tokenbuf, len, &o);
6579 if (result == KEYWORD_PLUGIN_DECLINE) {
6580 /* not a plugged-in keyword */
6581 PL_bufptr = saved_bufptr;
6582 } else if (result == KEYWORD_PLUGIN_STMT) {
6583 pl_yylval.opval = o;
6586 return REPORT(PLUGSTMT);
6587 } else if (result == KEYWORD_PLUGIN_EXPR) {
6588 pl_yylval.opval = o;
6590 PL_expect = XOPERATOR;
6591 return REPORT(PLUGEXPR);
6593 Perl_croak(aTHX_ "Bad plugin affecting keyword '%s'",
6598 /* Check for built-in keyword */
6599 tmp = keyword(PL_tokenbuf, len, 0);
6601 /* Is this a label? */
6602 if (!anydelim && PL_expect == XSTATE
6603 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
6605 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0,
6606 newSVpvn_flags(PL_tokenbuf,
6607 len, UTF ? SVf_UTF8 : 0));
6612 if (tmp < 0) { /* second-class keyword? */
6613 GV *ogv = NULL; /* override (winner) */
6614 GV *hgv = NULL; /* hidden (loser) */
6615 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
6617 if ((gv = gv_fetchpvn_flags(PL_tokenbuf, len,
6618 UTF ? SVf_UTF8 : 0, SVt_PVCV)) &&
6621 if (GvIMPORTED_CV(gv))
6623 else if (! CvMETHOD(cv))
6627 (gvp = (GV**)hv_fetch(PL_globalstash, PL_tokenbuf,
6628 UTF ? -(I32)len : (I32)len, FALSE)) &&
6629 (gv = *gvp) && isGV_with_GP(gv) &&
6630 GvCVu(gv) && GvIMPORTED_CV(gv))
6637 tmp = 0; /* overridden by import or by GLOBAL */
6640 && -tmp==KEY_lock /* XXX generalizable kludge */
6643 tmp = 0; /* any sub overrides "weak" keyword */
6645 else { /* no override */
6647 if (tmp == KEY_dump) {
6648 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
6649 "dump() better written as CORE::dump()");
6653 if (hgv && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
6654 Perl_ck_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6655 "Ambiguous call resolved as CORE::%s(), "
6656 "qualify as such or use &",
6664 default: /* not a keyword */
6665 /* Trade off - by using this evil construction we can pull the
6666 variable gv into the block labelled keylookup. If not, then
6667 we have to give it function scope so that the goto from the
6668 earlier ':' case doesn't bypass the initialisation. */
6670 just_a_word_zero_gv:
6678 const char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
6682 SV *nextPL_nextwhite = 0;
6686 /* Get the rest if it looks like a package qualifier */
6688 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
6690 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
6693 Perl_croak(aTHX_ "Bad name after %"SVf"%s",
6694 SVfARG(newSVpvn_flags(PL_tokenbuf, len,
6695 (UTF ? SVf_UTF8 : 0) | SVs_TEMP )),
6696 *s == '\'' ? "'" : "::");
6701 if (PL_expect == XOPERATOR) {
6702 if (PL_bufptr == PL_linestart) {
6703 CopLINE_dec(PL_curcop);
6704 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), "%s", PL_warn_nosemi);
6705 CopLINE_inc(PL_curcop);
6708 no_op("Bareword",s);
6711 /* Look for a subroutine with this name in current package,
6712 unless name is "Foo::", in which case Foo is a bareword
6713 (and a package name). */
6715 if (len > 2 && !PL_madskills &&
6716 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
6718 if (ckWARN(WARN_BAREWORD)
6719 && ! gv_fetchpvn_flags(PL_tokenbuf, len, UTF ? SVf_UTF8 : 0, SVt_PVHV))
6720 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
6721 "Bareword \"%"SVf"\" refers to nonexistent package",
6722 SVfARG(newSVpvn_flags(PL_tokenbuf, len,
6723 (UTF ? SVf_UTF8 : 0) | SVs_TEMP)));
6725 PL_tokenbuf[len] = '\0';
6731 /* Mustn't actually add anything to a symbol table.
6732 But also don't want to "initialise" any placeholder
6733 constants that might already be there into full
6734 blown PVGVs with attached PVCV. */
6735 gv = gv_fetchpvn_flags(PL_tokenbuf, len,
6736 GV_NOADD_NOINIT | ( UTF ? SVf_UTF8 : 0 ),
6742 /* if we saw a global override before, get the right name */
6744 sv = S_newSV_maybe_utf8(aTHX_ PL_tokenbuf,
6745 len ? len : strlen(PL_tokenbuf));
6747 SV * const tmp_sv = sv;
6748 sv = newSVpvs("CORE::GLOBAL::");
6749 sv_catsv(sv, tmp_sv);
6750 SvREFCNT_dec(tmp_sv);
6754 if (PL_madskills && !PL_thistoken) {
6755 char *start = SvPVX(PL_linestr) + PL_realtokenstart;
6756 PL_thistoken = newSVpvn(start,s - start);
6757 PL_realtokenstart = s - SvPVX(PL_linestr);
6761 /* Presume this is going to be a bareword of some sort. */
6763 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
6764 pl_yylval.opval->op_private = OPpCONST_BARE;
6766 /* And if "Foo::", then that's what it certainly is. */
6771 OP *const_op = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(sv));
6772 const_op->op_private = OPpCONST_BARE;
6773 rv2cv_op = newCVREF(0, const_op);
6775 cv = rv2cv_op_cv(rv2cv_op, 0);
6777 /* See if it's the indirect object for a list operator. */
6779 if (PL_oldoldbufptr &&
6780 PL_oldoldbufptr < PL_bufptr &&
6781 (PL_oldoldbufptr == PL_last_lop
6782 || PL_oldoldbufptr == PL_last_uni) &&
6783 /* NO SKIPSPACE BEFORE HERE! */
6784 (PL_expect == XREF ||
6785 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
6787 bool immediate_paren = *s == '(';
6789 /* (Now we can afford to cross potential line boundary.) */
6790 s = SKIPSPACE2(s,nextPL_nextwhite);
6792 PL_nextwhite = nextPL_nextwhite; /* assume no & deception */
6795 /* Two barewords in a row may indicate method call. */
6797 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') &&
6798 (tmp = intuit_method(s, gv, cv))) {
6800 if (tmp == METHOD && !PL_lex_allbrackets &&
6801 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
6802 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
6806 /* If not a declared subroutine, it's an indirect object. */
6807 /* (But it's an indir obj regardless for sort.) */
6808 /* Also, if "_" follows a filetest operator, it's a bareword */
6811 ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
6813 (PL_last_lop_op != OP_MAPSTART &&
6814 PL_last_lop_op != OP_GREPSTART))))
6815 || (PL_tokenbuf[0] == '_' && PL_tokenbuf[1] == '\0'
6816 && ((PL_opargs[PL_last_lop_op] & OA_CLASS_MASK) == OA_FILESTATOP))
6819 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
6824 PL_expect = XOPERATOR;
6827 s = SKIPSPACE2(s,nextPL_nextwhite);
6828 PL_nextwhite = nextPL_nextwhite;
6833 /* Is this a word before a => operator? */
6834 if (*s == '=' && s[1] == '>' && !pkgname) {
6837 sv_setpv(((SVOP*)pl_yylval.opval)->op_sv, PL_tokenbuf);
6838 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
6839 SvUTF8_on(((SVOP*)pl_yylval.opval)->op_sv);
6843 /* If followed by a paren, it's certainly a subroutine. */
6848 while (SPACE_OR_TAB(*d))
6850 if (*d == ')' && (sv = cv_const_sv(cv))) {
6857 PL_nextwhite = PL_thiswhite;
6860 start_force(PL_curforce);
6862 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6863 PL_expect = XOPERATOR;
6866 PL_nextwhite = nextPL_nextwhite;
6867 curmad('X', PL_thistoken);
6868 PL_thistoken = newSVpvs("");
6877 /* If followed by var or block, call it a method (unless sub) */
6879 if ((*s == '$' || *s == '{') && !cv) {
6881 PL_last_lop = PL_oldbufptr;
6882 PL_last_lop_op = OP_METHOD;
6883 if (!PL_lex_allbrackets &&
6884 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
6885 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
6889 /* If followed by a bareword, see if it looks like indir obj. */
6892 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
6893 && (tmp = intuit_method(s, gv, cv))) {
6895 if (tmp == METHOD && !PL_lex_allbrackets &&
6896 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
6897 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
6901 /* Not a method, so call it a subroutine (if defined) */
6904 if (lastchar == '-') {
6905 const SV *tmpsv = newSVpvn_flags( PL_tokenbuf, len ? len : strlen(PL_tokenbuf), (UTF ? SVf_UTF8 : 0) | SVs_TEMP );
6906 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
6907 "Ambiguous use of -%"SVf" resolved as -&%"SVf"()",
6908 SVfARG(tmpsv), SVfARG(tmpsv));
6910 /* Check for a constant sub */
6911 if ((sv = cv_const_sv(cv))) {
6914 SvREFCNT_dec(((SVOP*)pl_yylval.opval)->op_sv);
6915 ((SVOP*)pl_yylval.opval)->op_sv = SvREFCNT_inc_simple(sv);
6916 pl_yylval.opval->op_private = OPpCONST_FOLDED;
6917 pl_yylval.opval->op_flags |= OPf_SPECIAL;
6921 op_free(pl_yylval.opval);
6922 pl_yylval.opval = rv2cv_op;
6923 pl_yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
6924 PL_last_lop = PL_oldbufptr;
6925 PL_last_lop_op = OP_ENTERSUB;
6926 /* Is there a prototype? */
6933 STRLEN protolen = CvPROTOLEN(cv);
6934 const char *proto = CvPROTO(cv);
6938 if ((optional = *proto == ';'))
6941 while (*proto == ';');
6945 *proto == '$' || *proto == '_'
6946 || *proto == '*' || *proto == '+'
6951 *proto == '\\' && proto[1] && proto[2] == '\0'
6954 UNIPROTO(UNIOPSUB,optional);
6955 if (*proto == '\\' && proto[1] == '[') {
6956 const char *p = proto + 2;
6957 while(*p && *p != ']')
6959 if(*p == ']' && !p[1])
6960 UNIPROTO(UNIOPSUB,optional);
6962 if (*proto == '&' && *s == '{') {
6964 sv_setpvs(PL_subname, "__ANON__");
6966 sv_setpvs(PL_subname, "__ANON__::__ANON__");
6967 if (!PL_lex_allbrackets &&
6968 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
6969 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
6976 PL_nextwhite = PL_thiswhite;
6979 start_force(PL_curforce);
6980 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6983 PL_nextwhite = nextPL_nextwhite;
6984 curmad('X', PL_thistoken);
6985 PL_thistoken = newSVpvs("");
6988 if (!PL_lex_allbrackets &&
6989 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
6990 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
6995 /* Guess harder when madskills require "best effort". */
6996 if (PL_madskills && (!gv || !GvCVu(gv))) {
6997 int probable_sub = 0;
6998 if (strchr("\"'`$@%0123456789!*+{[<", *s))
7000 else if (isALPHA(*s)) {
7004 d = scan_word(d, tmpbuf, sizeof tmpbuf, TRUE, &tmplen);
7005 if (!keyword(tmpbuf, tmplen, 0))
7008 while (d < PL_bufend && isSPACE(*d))
7010 if (*d == '=' && d[1] == '>')
7015 gv = gv_fetchpv(PL_tokenbuf, GV_ADD | ( UTF ? SVf_UTF8 : 0 ),
7017 op_free(pl_yylval.opval);
7018 pl_yylval.opval = rv2cv_op;
7019 pl_yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
7020 PL_last_lop = PL_oldbufptr;
7021 PL_last_lop_op = OP_ENTERSUB;
7022 PL_nextwhite = PL_thiswhite;
7024 start_force(PL_curforce);
7025 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
7027 PL_nextwhite = nextPL_nextwhite;
7028 curmad('X', PL_thistoken);
7029 PL_thistoken = newSVpvs("");
7031 if (!PL_lex_allbrackets &&
7032 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
7033 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
7037 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
7040 if (!PL_lex_allbrackets &&
7041 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
7042 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
7047 /* Call it a bare word */
7049 if (PL_hints & HINT_STRICT_SUBS)
7050 pl_yylval.opval->op_private |= OPpCONST_STRICT;
7053 /* after "print" and similar functions (corresponding to
7054 * "F? L" in opcode.pl), whatever wasn't already parsed as
7055 * a filehandle should be subject to "strict subs".
7056 * Likewise for the optional indirect-object argument to system
7057 * or exec, which can't be a bareword */
7058 if ((PL_last_lop_op == OP_PRINT
7059 || PL_last_lop_op == OP_PRTF
7060 || PL_last_lop_op == OP_SAY
7061 || PL_last_lop_op == OP_SYSTEM
7062 || PL_last_lop_op == OP_EXEC)
7063 && (PL_hints & HINT_STRICT_SUBS))
7064 pl_yylval.opval->op_private |= OPpCONST_STRICT;
7065 if (lastchar != '-') {
7066 if (ckWARN(WARN_RESERVED)) {
7070 if (!*d && !gv_stashpv(PL_tokenbuf, UTF ? SVf_UTF8 : 0))
7071 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
7079 if ((lastchar == '*' || lastchar == '%' || lastchar == '&')) {
7080 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
7081 "Operator or semicolon missing before %c%"SVf,
7082 lastchar, SVfARG(newSVpvn_flags(PL_tokenbuf,
7083 strlen(PL_tokenbuf),
7084 SVs_TEMP | (UTF ? SVf_UTF8 : 0))));
7085 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
7086 "Ambiguous use of %c resolved as operator %c",
7087 lastchar, lastchar);
7094 (OP*)newSVOP(OP_CONST, 0, newSVpv(CopFILE(PL_curcop),0))
7099 (OP*)newSVOP(OP_CONST, 0,
7100 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)))
7103 case KEY___PACKAGE__:
7105 (OP*)newSVOP(OP_CONST, 0,
7107 ? newSVhek(HvNAME_HEK(PL_curstash))
7114 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
7115 const char *pname = "main";
7118 if (PL_tokenbuf[2] == 'D')
7121 PL_curstash ? PL_curstash : PL_defstash;
7122 pname = HvNAME_get(stash);
7123 plen = HvNAMELEN (stash);
7124 if(HvNAMEUTF8(stash)) putf8 = SVf_UTF8;
7126 gv = gv_fetchpvn_flags(
7127 Perl_form(aTHX_ "%*s::DATA", (int)plen, pname),
7128 plen+6, GV_ADD|putf8, SVt_PVIO
7132 GvIOp(gv) = newIO();
7133 IoIFP(GvIOp(gv)) = PL_rsfp;
7134 #if defined(HAS_FCNTL) && defined(F_SETFD)
7136 const int fd = PerlIO_fileno(PL_rsfp);
7137 fcntl(fd,F_SETFD,fd >= 3);
7140 /* Mark this internal pseudo-handle as clean */
7141 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
7142 if ((PerlIO*)PL_rsfp == PerlIO_stdin())
7143 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
7145 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
7146 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
7147 /* if the script was opened in binmode, we need to revert
7148 * it to text mode for compatibility; but only iff it has CRs
7149 * XXX this is a questionable hack at best. */
7150 if (PL_bufend-PL_bufptr > 2
7151 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
7154 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
7155 loc = PerlIO_tell(PL_rsfp);
7156 (void)PerlIO_seek(PL_rsfp, 0L, 0);
7159 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
7161 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
7162 #endif /* NETWARE */
7164 PerlIO_seek(PL_rsfp, loc, 0);
7168 #ifdef PERLIO_LAYERS
7171 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
7172 else if (PL_encoding) {
7179 XPUSHs(PL_encoding);
7181 call_method("name", G_SCALAR);
7185 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
7186 Perl_form(aTHX_ ":encoding(%"SVf")",
7195 if (PL_realtokenstart >= 0) {
7196 char *tstart = SvPVX(PL_linestr) + PL_realtokenstart;
7198 PL_endwhite = newSVpvs("");
7199 sv_catsv(PL_endwhite, PL_thiswhite);
7201 sv_catpvn(PL_endwhite, tstart, PL_bufend - tstart);
7202 PL_realtokenstart = -1;
7204 while ((s = filter_gets(PL_endwhite, SvCUR(PL_endwhite)))
7214 FUN0OP(newPVOP(OP_RUNCV,0,NULL));
7223 if (PL_expect == XSTATE) {
7230 if (*s == ':' && s[1] == ':') {
7234 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
7235 if ((*s == ':' && s[1] == ':')
7236 || (!(tmp = keyword(PL_tokenbuf, len, 1)) && *s == '\''))
7240 Copy(PL_bufptr, PL_tokenbuf, olen, char);
7244 Perl_croak(aTHX_ "CORE::%"SVf" is not a keyword",
7245 SVfARG(newSVpvn_flags(PL_tokenbuf, len,
7246 (UTF ? SVf_UTF8 : 0) | SVs_TEMP)));
7249 else if (tmp == KEY_require || tmp == KEY_do
7251 /* that's a way to remember we saw "CORE::" */
7264 LOP(OP_ACCEPT,XTERM);
7267 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_LOWLOGIC)
7272 LOP(OP_ATAN2,XTERM);
7278 LOP(OP_BINMODE,XTERM);
7281 LOP(OP_BLESS,XTERM);
7290 /* We have to disambiguate the two senses of
7291 "continue". If the next token is a '{' then
7292 treat it as the start of a continue block;
7293 otherwise treat it as a control operator.
7303 (void)gv_fetchpvs("ENV", GV_ADD|GV_NOTQUAL, SVt_PVHV);
7313 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7322 if (!PL_cryptseen) {
7323 PL_cryptseen = TRUE;
7327 LOP(OP_CRYPT,XTERM);
7330 LOP(OP_CHMOD,XTERM);
7333 LOP(OP_CHOWN,XTERM);
7336 LOP(OP_CONNECT,XTERM);
7355 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, 1, &len);
7358 if (*d == '(') s = force_word(s,WORD,TRUE,TRUE,FALSE);
7361 if (orig_keyword == KEY_do) {
7370 PL_hints |= HINT_BLOCK_SCOPE;
7380 Perl_populate_isa(aTHX_ STR_WITH_LEN("AnyDBM_File::ISA"),
7381 STR_WITH_LEN("NDBM_File::"),
7382 STR_WITH_LEN("DB_File::"),
7383 STR_WITH_LEN("GDBM_File::"),
7384 STR_WITH_LEN("SDBM_File::"),
7385 STR_WITH_LEN("ODBM_File::"),
7387 LOP(OP_DBMOPEN,XTERM);
7393 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7400 pl_yylval.ival = CopLINE(PL_curcop);
7404 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7418 if (*s == '{') { /* block eval */
7419 PL_expect = XTERMBLOCK;
7420 UNIBRACK(OP_ENTERTRY);
7422 else { /* string eval */
7424 UNIBRACK(OP_ENTEREVAL);
7429 UNIBRACK(-OP_ENTEREVAL);
7443 case KEY_endhostent:
7449 case KEY_endservent:
7452 case KEY_endprotoent:
7463 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
7465 pl_yylval.ival = CopLINE(PL_curcop);
7467 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
7470 int soff = s - SvPVX(PL_linestr); /* for skipspace realloc */
7473 if ((PL_bufend - p) >= 3 &&
7474 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
7476 else if ((PL_bufend - p) >= 4 &&
7477 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
7480 if (isIDFIRST_lazy_if(p,UTF)) {
7481 p = scan_ident(p, PL_bufend,
7482 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
7486 Perl_croak(aTHX_ "Missing $ on loop variable");
7488 s = SvPVX(PL_linestr) + soff;
7494 LOP(OP_FORMLINE,XTERM);
7503 LOP(OP_FCNTL,XTERM);
7509 LOP(OP_FLOCK,XTERM);
7512 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7517 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7522 LOP(OP_GREPSTART, XREF);
7525 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7540 case KEY_getpriority:
7541 LOP(OP_GETPRIORITY,XTERM);
7543 case KEY_getprotobyname:
7546 case KEY_getprotobynumber:
7547 LOP(OP_GPBYNUMBER,XTERM);
7549 case KEY_getprotoent:
7561 case KEY_getpeername:
7562 UNI(OP_GETPEERNAME);
7564 case KEY_gethostbyname:
7567 case KEY_gethostbyaddr:
7568 LOP(OP_GHBYADDR,XTERM);
7570 case KEY_gethostent:
7573 case KEY_getnetbyname:
7576 case KEY_getnetbyaddr:
7577 LOP(OP_GNBYADDR,XTERM);
7582 case KEY_getservbyname:
7583 LOP(OP_GSBYNAME,XTERM);
7585 case KEY_getservbyport:
7586 LOP(OP_GSBYPORT,XTERM);
7588 case KEY_getservent:
7591 case KEY_getsockname:
7592 UNI(OP_GETSOCKNAME);
7594 case KEY_getsockopt:
7595 LOP(OP_GSOCKOPT,XTERM);
7610 pl_yylval.ival = CopLINE(PL_curcop);
7615 orig_keyword==KEY_glob ? (orig_keyword=0, -OP_GLOB) : OP_GLOB,
7623 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
7625 pl_yylval.ival = CopLINE(PL_curcop);
7629 LOP(OP_INDEX,XTERM);
7635 LOP(OP_IOCTL,XTERM);
7647 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7664 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7669 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7683 LOP(OP_LISTEN,XTERM);
7692 s = scan_pat(s,OP_MATCH);
7693 TERM(sublex_start());
7696 LOP(OP_MAPSTART, XREF);
7699 LOP(OP_MKDIR,XTERM);
7702 LOP(OP_MSGCTL,XTERM);
7705 LOP(OP_MSGGET,XTERM);
7708 LOP(OP_MSGRCV,XTERM);
7711 LOP(OP_MSGSND,XTERM);
7716 PL_in_my = (U16)tmp;
7718 if (isIDFIRST_lazy_if(s,UTF)) {
7722 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
7723 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
7725 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
7726 if (!PL_in_my_stash) {
7729 my_snprintf(tmpbuf, sizeof(tmpbuf), "No such class %.1000s", PL_tokenbuf);
7730 yyerror_pv(tmpbuf, UTF ? SVf_UTF8 : 0);
7733 if (PL_madskills) { /* just add type to declarator token */
7734 sv_catsv(PL_thistoken, PL_nextwhite);
7736 sv_catpvn(PL_thistoken, start, s - start);
7744 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7748 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_COMPARE)
7753 s = tokenize_use(0, s);
7757 if (*s == '(' || (s = SKIPSPACE1(s), *s == '('))
7760 if (!PL_lex_allbrackets &&
7761 PL_lex_fakeeof > LEX_FAKEEOF_LOWLOGIC)
7762 PL_lex_fakeeof = LEX_FAKEEOF_LOWLOGIC;
7768 if (isIDFIRST_lazy_if(s,UTF)) {
7770 for (d = s; isALNUM_lazy_if(d,UTF);) {
7771 d += UTF ? UTF8SKIP(d) : 1;
7773 while (UTF8_IS_CONTINUED(*d) && is_utf8_mark((U8*)d)) {
7774 d += UTF ? UTF8SKIP(d) : 1;
7778 for (t=d; isSPACE(*t);)
7780 if ( *t && strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
7782 && !(t[0] == '=' && t[1] == '>')
7783 && !(t[0] == ':' && t[1] == ':')
7784 && !keyword(s, d-s, 0)
7786 SV *tmpsv = newSVpvn_flags(s, (STRLEN)(d-s),
7787 SVs_TEMP | (UTF ? SVf_UTF8 : 0));
7788 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7789 "Precedence problem: open %"SVf" should be open(%"SVf")",
7790 SVfARG(tmpsv), SVfARG(tmpsv));
7796 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_LOWLOGIC)
7798 pl_yylval.ival = OP_OR;
7808 LOP(OP_OPEN_DIR,XTERM);
7811 checkcomma(s,PL_tokenbuf,"filehandle");
7815 checkcomma(s,PL_tokenbuf,"filehandle");
7834 s = force_word(s,WORD,FALSE,TRUE,FALSE);
7836 s = force_strict_version(s);
7837 PL_lex_expect = XBLOCK;
7841 LOP(OP_PIPE_OP,XTERM);
7844 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
7847 pl_yylval.ival = OP_CONST;
7848 TERM(sublex_start());
7855 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
7858 PL_expect = XOPERATOR;
7859 if (SvCUR(PL_lex_stuff)) {
7860 int warned_comma = !ckWARN(WARN_QW);
7861 int warned_comment = warned_comma;
7862 d = SvPV_force(PL_lex_stuff, len);
7864 for (; isSPACE(*d) && len; --len, ++d)
7869 if (!warned_comma || !warned_comment) {
7870 for (; !isSPACE(*d) && len; --len, ++d) {
7871 if (!warned_comma && *d == ',') {
7872 Perl_warner(aTHX_ packWARN(WARN_QW),
7873 "Possible attempt to separate words with commas");
7876 else if (!warned_comment && *d == '#') {
7877 Perl_warner(aTHX_ packWARN(WARN_QW),
7878 "Possible attempt to put comments in qw() list");
7884 for (; !isSPACE(*d) && len; --len, ++d)
7887 sv = newSVpvn_utf8(b, d-b, DO_UTF8(PL_lex_stuff));
7888 words = op_append_elem(OP_LIST, words,
7889 newSVOP(OP_CONST, 0, tokeq(sv)));
7894 words = newNULLLIST();
7896 SvREFCNT_dec(PL_lex_stuff);
7897 PL_lex_stuff = NULL;
7899 PL_expect = XOPERATOR;
7900 pl_yylval.opval = sawparens(words);
7905 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
7908 pl_yylval.ival = OP_STRINGIFY;
7909 if (SvIVX(PL_lex_stuff) == '\'')
7910 SvIV_set(PL_lex_stuff, 0); /* qq'$foo' should interpolate */
7911 TERM(sublex_start());
7914 s = scan_pat(s,OP_QR);
7915 TERM(sublex_start());
7918 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
7921 readpipe_override();
7922 TERM(sublex_start());
7930 s = force_version(s, FALSE);
7932 else if (*s != 'v' || !isDIGIT(s[1])
7933 || (s = force_version(s, TRUE), *s == 'v'))
7935 *PL_tokenbuf = '\0';
7936 s = force_word(s,WORD,TRUE,TRUE,FALSE);
7937 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
7938 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf),
7939 GV_ADD | (UTF ? SVf_UTF8 : 0));
7941 yyerror("<> should be quotes");
7943 if (orig_keyword == KEY_require) {
7951 PL_last_uni = PL_oldbufptr;
7952 PL_last_lop_op = OP_REQUIRE;
7954 return REPORT( (int)REQUIRE );
7960 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7964 LOP(OP_RENAME,XTERM);
7973 LOP(OP_RINDEX,XTERM);
7982 UNIDOR(OP_READLINE);
7985 UNIDOR(OP_BACKTICK);
7994 LOP(OP_REVERSE,XTERM);
7997 UNIDOR(OP_READLINK);
8004 if (pl_yylval.opval)
8005 TERM(sublex_start());
8007 TOKEN(1); /* force error */
8010 checkcomma(s,PL_tokenbuf,"filehandle");
8020 LOP(OP_SELECT,XTERM);
8026 LOP(OP_SEMCTL,XTERM);
8029 LOP(OP_SEMGET,XTERM);
8032 LOP(OP_SEMOP,XTERM);
8038 LOP(OP_SETPGRP,XTERM);
8040 case KEY_setpriority:
8041 LOP(OP_SETPRIORITY,XTERM);
8043 case KEY_sethostent:
8049 case KEY_setservent:
8052 case KEY_setprotoent:
8062 LOP(OP_SEEKDIR,XTERM);
8064 case KEY_setsockopt:
8065 LOP(OP_SSOCKOPT,XTERM);
8071 LOP(OP_SHMCTL,XTERM);
8074 LOP(OP_SHMGET,XTERM);
8077 LOP(OP_SHMREAD,XTERM);
8080 LOP(OP_SHMWRITE,XTERM);
8083 LOP(OP_SHUTDOWN,XTERM);
8092 LOP(OP_SOCKET,XTERM);
8094 case KEY_socketpair:
8095 LOP(OP_SOCKPAIR,XTERM);
8098 checkcomma(s,PL_tokenbuf,"subroutine name");
8101 s = force_word(s,WORD,TRUE,TRUE,FALSE);
8105 LOP(OP_SPLIT,XTERM);
8108 LOP(OP_SPRINTF,XTERM);
8111 LOP(OP_SPLICE,XTERM);
8126 LOP(OP_SUBSTR,XTERM);
8132 char tmpbuf[sizeof PL_tokenbuf];
8133 SSize_t tboffset = 0;
8134 expectation attrful;
8135 bool have_name, have_proto;
8136 const int key = tmp;
8141 char *tstart = SvPVX(PL_linestr) + PL_realtokenstart;
8142 SV *subtoken = newSVpvn_flags(tstart, s - tstart, SvUTF8(PL_linestr));
8146 s = SKIPSPACE2(s,tmpwhite);
8151 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
8152 (*s == ':' && s[1] == ':'))
8155 SV *nametoke = NULL;
8159 attrful = XATTRBLOCK;
8160 /* remember buffer pos'n for later force_word */
8161 tboffset = s - PL_oldbufptr;
8162 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
8165 nametoke = newSVpvn_flags(s, d - s, SvUTF8(PL_linestr));
8167 if (memchr(tmpbuf, ':', len))
8168 sv_setpvn(PL_subname, tmpbuf, len);
8170 sv_setsv(PL_subname,PL_curstname);
8171 sv_catpvs(PL_subname,"::");
8172 sv_catpvn(PL_subname,tmpbuf,len);
8174 if (SvUTF8(PL_linestr))
8175 SvUTF8_on(PL_subname);
8181 CURMAD('X', nametoke);
8182 CURMAD('_', tmpwhite);
8183 (void) force_word(PL_oldbufptr + tboffset, WORD,
8186 s = SKIPSPACE2(d,tmpwhite);
8193 Perl_croak(aTHX_ "Missing name in \"my sub\"");
8194 PL_expect = XTERMBLOCK;
8195 attrful = XATTRTERM;
8196 sv_setpvs(PL_subname,"?");
8200 if (key == KEY_format) {
8202 PL_lex_formbrack = PL_lex_brackets + 1;
8204 PL_thistoken = subtoken;
8208 (void) force_word(PL_oldbufptr + tboffset, WORD,
8214 /* Look for a prototype */
8217 bool bad_proto = FALSE;
8218 bool in_brackets = FALSE;
8219 char greedy_proto = ' ';
8220 bool proto_after_greedy_proto = FALSE;
8221 bool must_be_last = FALSE;
8222 bool underscore = FALSE;
8223 bool seen_underscore = FALSE;
8224 const bool warnillegalproto = ckWARN(WARN_ILLEGALPROTO);
8227 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
8229 Perl_croak(aTHX_ "Prototype not terminated");
8230 /* strip spaces and check for bad characters */
8231 d = SvPV(PL_lex_stuff, tmplen);
8233 for (p = d; tmplen; tmplen--, ++p) {
8237 if (warnillegalproto) {
8239 proto_after_greedy_proto = TRUE;
8240 if (!strchr("$@%*;[]&\\_+", *p) || *p == '\0') {
8245 if ( !strchr(";@%", *p) )
8252 else if ( *p == ']' ) {
8253 in_brackets = FALSE;
8255 else if ( (*p == '@' || *p == '%') &&
8256 ( tmp < 2 || d[tmp-2] != '\\' ) &&
8258 must_be_last = TRUE;
8261 else if ( *p == '_' ) {
8262 underscore = seen_underscore = TRUE;
8269 if (proto_after_greedy_proto)
8270 Perl_warner(aTHX_ packWARN(WARN_ILLEGALPROTO),
8271 "Prototype after '%c' for %"SVf" : %s",
8272 greedy_proto, SVfARG(PL_subname), d);
8274 SV *dsv = newSVpvs_flags("", SVs_TEMP);
8275 Perl_warner(aTHX_ packWARN(WARN_ILLEGALPROTO),
8276 "Illegal character %sin prototype for %"SVf" : %s",
8277 seen_underscore ? "after '_' " : "",
8279 SvUTF8(PL_lex_stuff)
8280 ? sv_uni_display(dsv,
8281 newSVpvn_flags(d, tmp, SVs_TEMP | SVf_UTF8),
8283 UNI_DISPLAY_ISPRINT)
8284 : pv_pretty(dsv, d, tmp, 60, NULL, NULL,
8285 PERL_PV_ESCAPE_NONASCII));
8287 SvCUR_set(PL_lex_stuff, tmp);
8292 CURMAD('q', PL_thisopen);
8293 CURMAD('_', tmpwhite);
8294 CURMAD('=', PL_thisstuff);
8295 CURMAD('Q', PL_thisclose);
8296 NEXTVAL_NEXTTOKE.opval =
8297 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
8298 PL_lex_stuff = NULL;
8301 s = SKIPSPACE2(s,tmpwhite);
8309 if (*s == ':' && s[1] != ':')
8310 PL_expect = attrful;
8311 else if (*s != '{' && key == KEY_sub) {
8313 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
8314 else if (*s != ';' && *s != '}')
8315 Perl_croak(aTHX_ "Illegal declaration of subroutine %"SVf, SVfARG(PL_subname));
8322 curmad('^', newSVpvs(""));
8323 CURMAD('_', tmpwhite);
8327 PL_thistoken = subtoken;
8330 NEXTVAL_NEXTTOKE.opval =
8331 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
8332 PL_lex_stuff = NULL;
8338 sv_setpvs(PL_subname, "__ANON__");
8340 sv_setpvs(PL_subname, "__ANON__::__ANON__");
8344 (void) force_word(PL_oldbufptr + tboffset, WORD,
8353 LOP(OP_SYSTEM,XREF);
8356 LOP(OP_SYMLINK,XTERM);
8359 LOP(OP_SYSCALL,XTERM);
8362 LOP(OP_SYSOPEN,XTERM);
8365 LOP(OP_SYSSEEK,XTERM);
8368 LOP(OP_SYSREAD,XTERM);
8371 LOP(OP_SYSWRITE,XTERM);
8375 TERM(sublex_start());
8396 LOP(OP_TRUNCATE,XTERM);
8408 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
8410 pl_yylval.ival = CopLINE(PL_curcop);
8414 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
8416 pl_yylval.ival = CopLINE(PL_curcop);
8420 LOP(OP_UNLINK,XTERM);
8426 LOP(OP_UNPACK,XTERM);
8429 LOP(OP_UTIME,XTERM);
8435 LOP(OP_UNSHIFT,XTERM);
8438 s = tokenize_use(1, s);
8448 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
8450 pl_yylval.ival = CopLINE(PL_curcop);
8454 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_NONEXPR)
8456 pl_yylval.ival = CopLINE(PL_curcop);
8460 PL_hints |= HINT_BLOCK_SCOPE;
8467 LOP(OP_WAITPID,XTERM);
8476 ctl_l[0] = toCTRL('L');
8478 gv_fetchpvn_flags(ctl_l, 1, GV_ADD|GV_NOTQUAL, SVt_PV);
8481 /* Make sure $^L is defined */
8482 gv_fetchpvs("\f", GV_ADD|GV_NOTQUAL, SVt_PV);
8487 if (PL_expect == XOPERATOR) {
8488 if (*s == '=' && !PL_lex_allbrackets &&
8489 PL_lex_fakeeof >= LEX_FAKEEOF_ASSIGN)
8497 if (!PL_lex_allbrackets && PL_lex_fakeeof >= LEX_FAKEEOF_LOWLOGIC)
8499 pl_yylval.ival = OP_XOR;
8504 TERM(sublex_start());
8509 #pragma segment Main
8513 S_pending_ident(pTHX)
8517 /* pit holds the identifier we read and pending_ident is reset */
8518 char pit = PL_pending_ident;
8519 const STRLEN tokenbuf_len = strlen(PL_tokenbuf);
8520 /* All routes through this function want to know if there is a colon. */
8521 const char *const has_colon = (const char*) memchr (PL_tokenbuf, ':', tokenbuf_len);
8522 PL_pending_ident = 0;
8524 /* PL_realtokenstart = realtokenend = PL_bufptr - SvPVX(PL_linestr); */
8525 DEBUG_T({ PerlIO_printf(Perl_debug_log,
8526 "### Pending identifier '%s'\n", PL_tokenbuf); });
8528 /* if we're in a my(), we can't allow dynamics here.
8529 $foo'bar has already been turned into $foo::bar, so
8530 just check for colons.
8532 if it's a legal name, the OP is a PADANY.
8535 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
8537 yyerror_pv(Perl_form(aTHX_ "No package name allowed for "
8538 "variable %s in \"our\"",
8539 PL_tokenbuf), UTF ? SVf_UTF8 : 0);
8540 tmp = allocmy(PL_tokenbuf, tokenbuf_len, UTF ? SVf_UTF8 : 0);
8544 yyerror_pv(Perl_form(aTHX_ PL_no_myglob,
8545 PL_in_my == KEY_my ? "my" : "state", PL_tokenbuf),
8546 UTF ? SVf_UTF8 : 0);
8548 pl_yylval.opval = newOP(OP_PADANY, 0);
8549 pl_yylval.opval->op_targ = allocmy(PL_tokenbuf, tokenbuf_len,
8550 UTF ? SVf_UTF8 : 0);
8556 build the ops for accesses to a my() variable.
8561 tmp = pad_findmy_pvn(PL_tokenbuf, tokenbuf_len,
8562 UTF ? SVf_UTF8 : 0);
8563 if (tmp != NOT_IN_PAD) {
8564 /* might be an "our" variable" */
8565 if (PAD_COMPNAME_FLAGS_isOUR(tmp)) {
8566 /* build ops for a bareword */
8567 HV * const stash = PAD_COMPNAME_OURSTASH(tmp);
8568 HEK * const stashname = HvNAME_HEK(stash);
8569 SV * const sym = newSVhek(stashname);
8570 sv_catpvs(sym, "::");
8571 sv_catpvn_flags(sym, PL_tokenbuf+1, tokenbuf_len - 1, (UTF ? SV_CATUTF8 : SV_CATBYTES ));
8572 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
8573 pl_yylval.opval->op_private = OPpCONST_ENTERED;
8576 ? (GV_ADDMULTI | GV_ADDINEVAL)
8579 ((PL_tokenbuf[0] == '$') ? SVt_PV
8580 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
8585 pl_yylval.opval = newOP(OP_PADANY, 0);
8586 pl_yylval.opval->op_targ = tmp;
8592 Whine if they've said @foo in a doublequoted string,
8593 and @foo isn't a variable we can find in the symbol
8596 if (ckWARN(WARN_AMBIGUOUS) &&
8597 pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
8598 GV *const gv = gv_fetchpvn_flags(PL_tokenbuf + 1, tokenbuf_len - 1,
8599 ( UTF ? SVf_UTF8 : 0 ), SVt_PVAV);
8600 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
8601 /* DO NOT warn for @- and @+ */
8602 && !( PL_tokenbuf[2] == '\0' &&
8603 ( PL_tokenbuf[1] == '-' || PL_tokenbuf[1] == '+' ))
8606 /* Downgraded from fatal to warning 20000522 mjd */
8607 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
8608 "Possible unintended interpolation of %"SVf" in string",
8609 SVfARG(newSVpvn_flags(PL_tokenbuf, tokenbuf_len,
8610 SVs_TEMP | ( UTF ? SVf_UTF8 : 0 ))));
8614 /* build ops for a bareword */
8615 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn_flags(PL_tokenbuf + 1,
8617 UTF ? SVf_UTF8 : 0 ));
8618 pl_yylval.opval->op_private = OPpCONST_ENTERED;
8619 gv_fetchpvn_flags(PL_tokenbuf+1, tokenbuf_len - 1,
8620 (PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : GV_ADD)
8621 | ( UTF ? SVf_UTF8 : 0 ),
8622 ((PL_tokenbuf[0] == '$') ? SVt_PV
8623 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
8629 S_checkcomma(pTHX_ const char *s, const char *name, const char *what)
8633 PERL_ARGS_ASSERT_CHECKCOMMA;
8635 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
8636 if (ckWARN(WARN_SYNTAX)) {
8639 for (w = s+2; *w && level; w++) {
8647 /* the list of chars below is for end of statements or
8648 * block / parens, boolean operators (&&, ||, //) and branch
8649 * constructs (or, and, if, until, unless, while, err, for).
8650 * Not a very solid hack... */
8651 if (!*w || !strchr(";&/|})]oaiuwef!=", *w))
8652 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8653 "%s (...) interpreted as function",name);
8656 while (s < PL_bufend && isSPACE(*s))
8660 while (s < PL_bufend && isSPACE(*s))
8662 if (isIDFIRST_lazy_if(s,UTF)) {
8663 const char * const w = s;
8664 s += UTF ? UTF8SKIP(s) : 1;
8665 while (isALNUM_lazy_if(s,UTF))
8666 s += UTF ? UTF8SKIP(s) : 1;
8667 while (s < PL_bufend && isSPACE(*s))
8671 if (keyword(w, s - w, 0))
8674 gv = gv_fetchpvn_flags(w, s - w, ( UTF ? SVf_UTF8 : 0 ), SVt_PVCV);
8675 if (gv && GvCVu(gv))
8677 Perl_croak(aTHX_ "No comma allowed after %s", what);
8682 /* Either returns sv, or mortalizes sv and returns a new SV*.
8683 Best used as sv=new_constant(..., sv, ...).
8684 If s, pv are NULL, calls subroutine with one argument,
8685 and type is used with error messages only. */
8688 S_new_constant(pTHX_ const char *s, STRLEN len, const char *key, STRLEN keylen,
8689 SV *sv, SV *pv, const char *type, STRLEN typelen)
8692 HV * table = GvHV(PL_hintgv); /* ^H */
8696 const char *why1 = "", *why2 = "", *why3 = "";
8698 PERL_ARGS_ASSERT_NEW_CONSTANT;
8700 /* charnames doesn't work well if there have been errors found */
8701 if (PL_error_count > 0 && strEQ(key,"charnames"))
8702 return &PL_sv_undef;
8705 || ! (PL_hints & HINT_LOCALIZE_HH)
8706 || ! (cvp = hv_fetch(table, key, keylen, FALSE))
8711 /* Here haven't found what we're looking for. If it is charnames,
8712 * perhaps it needs to be loaded. Try doing that before giving up */
8713 if (strEQ(key,"charnames")) {
8714 Perl_load_module(aTHX_
8716 newSVpvs("_charnames"),
8717 /* version parameter; no need to specify it, as if
8718 * we get too early a version, will fail anyway,
8719 * not being able to find '_charnames' */
8725 table = GvHV(PL_hintgv);
8727 && (PL_hints & HINT_LOCALIZE_HH)
8728 && (cvp = hv_fetch(table, key, keylen, FALSE))
8734 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
8735 msg = Perl_newSVpvf(aTHX_
8736 "Constant(%s) unknown", (type ? type: "undef"));
8741 why3 = "} is not defined";
8743 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
8744 (type ? type: "undef"), why1, why2, why3);
8746 yyerror(SvPVX_const(msg));
8751 sv_2mortal(sv); /* Parent created it permanently */
8754 pv = newSVpvn_flags(s, len, SVs_TEMP);
8756 typesv = newSVpvn_flags(type, typelen, SVs_TEMP);
8758 typesv = &PL_sv_undef;
8760 PUSHSTACKi(PERLSI_OVERLOAD);
8772 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
8776 /* Check the eval first */
8777 if (!PL_in_eval && SvTRUE(ERRSV)) {
8778 sv_catpvs(ERRSV, "Propagated");
8779 yyerror(SvPV_nolen_const(ERRSV)); /* Duplicates the message inside eval */
8781 res = SvREFCNT_inc_simple(sv);
8785 SvREFCNT_inc_simple_void(res);
8794 why1 = "Call to &{$^H{";
8796 why3 = "}} did not return a defined value";
8804 /* Returns a NUL terminated string, with the length of the string written to
8808 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
8811 register char *d = dest;
8812 register char * const e = d + destlen - 3; /* two-character token, ending NUL */
8814 PERL_ARGS_ASSERT_SCAN_WORD;
8818 Perl_croak(aTHX_ ident_too_long);
8819 if (isALNUM(*s) || (!UTF && isALNUMC_L1(*s))) /* UTF handled below */
8821 else if (allow_package && (*s == '\'') && isIDFIRST_lazy_if(s+1,UTF)) {
8826 else if (allow_package && (s[0] == ':') && (s[1] == ':') && (s[2] != '$')) {
8830 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
8831 char *t = s + UTF8SKIP(s);
8833 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
8837 Perl_croak(aTHX_ ident_too_long);
8838 Copy(s, d, len, char);
8851 S_scan_ident(pTHX_ register char *s, register const char *send, char *dest, STRLEN destlen, I32 ck_uni)
8854 char *bracket = NULL;
8856 register char *d = dest;
8857 register char * const e = d + destlen - 3; /* two-character token, ending NUL */
8859 PERL_ARGS_ASSERT_SCAN_IDENT;
8864 while (isDIGIT(*s)) {
8866 Perl_croak(aTHX_ ident_too_long);
8873 Perl_croak(aTHX_ ident_too_long);
8874 if (isALNUM(*s)) /* UTF handled below */
8876 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
8881 else if (*s == ':' && s[1] == ':') {
8885 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
8886 char *t = s + UTF8SKIP(s);
8887 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
8889 if (d + (t - s) > e)
8890 Perl_croak(aTHX_ ident_too_long);
8891 Copy(s, d, t - s, char);
8902 if (PL_lex_state != LEX_NORMAL)
8903 PL_lex_state = LEX_INTERPENDMAYBE;
8906 if (*s == '$' && s[1] &&
8907 (isALNUM_lazy_if(s+1,UTF) || s[1] == '$' || s[1] == '{' || strnEQ(s+1,"::",2)) )
8917 const STRLEN skip = UTF8SKIP(s);
8920 for ( i = 0; i < skip; i++ )
8928 if (*d == '^' && *s && isCONTROLVAR(*s)) {
8932 else if (ck_uni && !bracket)
8935 if (isSPACE(s[-1])) {
8937 const char ch = *s++;
8938 if (!SPACE_OR_TAB(ch)) {
8944 if (isIDFIRST_lazy_if(d,UTF)) {
8948 while ((end < send && isALNUM_lazy_if(end,UTF)) || *end == ':') {
8949 end += UTF8SKIP(end);
8950 while (end < send && UTF8_IS_CONTINUED(*end) && is_utf8_mark((U8*)end))
8951 end += UTF8SKIP(end);
8953 Copy(s, d, end - s, char);
8958 while ((isALNUM(*s) || *s == ':') && d < e)
8961 Perl_croak(aTHX_ ident_too_long);
8964 while (s < send && SPACE_OR_TAB(*s))
8966 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
8967 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest, 0)) {
8968 const char * const brack =
8970 ((*s == '[') ? "[...]" : "{...}");
8971 /* diag_listed_as: Ambiguous use of %c{%s[...]} resolved to %c%s[...] */
8972 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
8973 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
8974 funny, dest, brack, funny, dest, brack);
8977 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
8978 PL_lex_allbrackets++;
8982 /* Handle extended ${^Foo} variables
8983 * 1999-02-27 mjd-perl-patch@plover.com */
8984 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
8988 while (isALNUM(*s) && d < e) {
8992 Perl_croak(aTHX_ ident_too_long);
8997 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
8998 PL_lex_state = LEX_INTERPEND;
9001 if (PL_lex_state == LEX_NORMAL) {
9002 if (ckWARN(WARN_AMBIGUOUS) &&
9003 (keyword(dest, d - dest, 0)
9004 || get_cvn_flags(dest, d - dest, UTF ? SVf_UTF8 : 0)))
9006 SV *tmp = newSVpvn_flags( dest, d - dest,
9007 SVs_TEMP | (UTF ? SVf_UTF8 : 0) );
9010 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
9011 "Ambiguous use of %c{%"SVf"} resolved to %c%"SVf,
9012 funny, tmp, funny, tmp);
9017 s = bracket; /* let the parser handle it */
9021 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
9022 PL_lex_state = LEX_INTERPEND;
9027 S_pmflag(pTHX_ const char* const valid_flags, U32 * pmfl, char** s, char* charset) {
9029 /* Adds, subtracts to/from 'pmfl' based on regex modifier flags found in
9030 * the parse starting at 's', based on the subset that are valid in this
9031 * context input to this routine in 'valid_flags'. Advances s. Returns
9032 * TRUE if the input should be treated as a valid flag, so the next char
9033 * may be as well; otherwise FALSE. 'charset' should point to a NUL upon
9034 * first call on the current regex. This routine will set it to any
9035 * charset modifier found. The caller shouldn't change it. This way,
9036 * another charset modifier encountered in the parse can be detected as an
9037 * error, as we have decided to allow only one */
9040 STRLEN charlen = UTF ? UTF8SKIP(*s) : 1;
9042 if ( charlen != 1 || ! strchr(valid_flags, c) ) {
9043 if (isALNUM_lazy_if(*s, UTF)) {
9044 yyerror_pv(Perl_form(aTHX_ "Unknown regexp modifier \"/%.*s\"", (int)charlen, *s),
9045 UTF ? SVf_UTF8 : 0);
9047 /* Pretend that it worked, so will continue processing before
9056 CASE_STD_PMMOD_FLAGS_PARSE_SET(pmfl);
9057 case GLOBAL_PAT_MOD: *pmfl |= PMf_GLOBAL; break;
9058 case CONTINUE_PAT_MOD: *pmfl |= PMf_CONTINUE; break;
9059 case ONCE_PAT_MOD: *pmfl |= PMf_KEEP; break;
9060 case KEEPCOPY_PAT_MOD: *pmfl |= RXf_PMf_KEEPCOPY; break;
9061 case NONDESTRUCT_PAT_MOD: *pmfl |= PMf_NONDESTRUCT; break;
9062 case LOCALE_PAT_MOD:
9064 goto multiple_charsets;
9066 set_regex_charset(pmfl, REGEX_LOCALE_CHARSET);
9069 case UNICODE_PAT_MOD:
9071 goto multiple_charsets;
9073 set_regex_charset(pmfl, REGEX_UNICODE_CHARSET);
9076 case ASCII_RESTRICT_PAT_MOD:
9078 set_regex_charset(pmfl, REGEX_ASCII_RESTRICTED_CHARSET);
9082 /* Error if previous modifier wasn't an 'a', but if it was, see
9083 * if, and accept, a second occurrence (only) */
9085 || get_regex_charset(*pmfl)
9086 != REGEX_ASCII_RESTRICTED_CHARSET)
9088 goto multiple_charsets;
9090 set_regex_charset(pmfl, REGEX_ASCII_MORE_RESTRICTED_CHARSET);
9094 case DEPENDS_PAT_MOD:
9096 goto multiple_charsets;
9098 set_regex_charset(pmfl, REGEX_DEPENDS_CHARSET);
9107 if (*charset != c) {
9108 yyerror(Perl_form(aTHX_ "Regexp modifiers \"/%c\" and \"/%c\" are mutually exclusive", *charset, c));
9110 else if (c == 'a') {
9111 yyerror("Regexp modifier \"/a\" may appear a maximum of twice");
9114 yyerror(Perl_form(aTHX_ "Regexp modifier \"/%c\" may not appear twice", c));
9117 /* Pretend that it worked, so will continue processing before dieing */
9123 S_scan_pat(pTHX_ char *start, I32 type)
9127 char *s = scan_str(start,!!PL_madskills,FALSE, PL_reg_state.re_reparsing);
9128 const char * const valid_flags =
9129 (const char *)((type == OP_QR) ? QR_PAT_MODS : M_PAT_MODS);
9130 char charset = '\0'; /* character set modifier */
9135 PERL_ARGS_ASSERT_SCAN_PAT;
9137 /* this was only needed for the initial scan_str; set it to false
9138 * so that any (?{}) code blocks etc are parsed normally */
9139 PL_reg_state.re_reparsing = FALSE;
9141 const char * const delimiter = skipspace(start);
9145 ? "Search pattern not terminated or ternary operator parsed as search pattern"
9146 : "Search pattern not terminated" ));
9149 pm = (PMOP*)newPMOP(type, 0);
9150 if (PL_multi_open == '?') {
9151 /* This is the only point in the code that sets PMf_ONCE: */
9152 pm->op_pmflags |= PMf_ONCE;
9154 /* Hence it's safe to do this bit of PMOP book-keeping here, which
9155 allows us to restrict the list needed by reset to just the ??
9157 assert(type != OP_TRANS);
9159 MAGIC *mg = mg_find((const SV *)PL_curstash, PERL_MAGIC_symtab);
9162 mg = sv_magicext(MUTABLE_SV(PL_curstash), 0, PERL_MAGIC_symtab, 0, 0,
9165 elements = mg->mg_len / sizeof(PMOP**);
9166 Renewc(mg->mg_ptr, elements + 1, PMOP*, char);
9167 ((PMOP**)mg->mg_ptr) [elements++] = pm;
9168 mg->mg_len = elements * sizeof(PMOP**);
9169 PmopSTASH_set(pm,PL_curstash);
9176 /* if qr/...(?{..}).../, then need to parse the pattern within a new
9177 * anon CV. False positives like qr/[(?{]/ are harmless */
9179 if (type == OP_QR) {
9181 char *e, *p = SvPV(PL_lex_stuff, len);
9183 for (; p < e; p++) {
9184 if (p[0] == '(' && p[1] == '?'
9185 && (p[2] == '{' || (p[2] == '?' && p[3] == '{')))
9187 pm->op_pmflags |= PMf_HAS_CV;
9191 pm->op_pmflags |= PMf_IS_QR;
9194 while (*s && S_pmflag(aTHX_ valid_flags, &(pm->op_pmflags), &s, &charset)) {};
9196 if (PL_madskills && modstart != s) {
9197 SV* tmptoken = newSVpvn(modstart, s - modstart);
9198 append_madprops(newMADPROP('m', MAD_SV, tmptoken, 0), (OP*)pm, 0);
9201 /* issue a warning if /c is specified,but /g is not */
9202 if ((pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
9204 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9205 "Use of /c modifier is meaningless without /g" );
9208 PL_lex_op = (OP*)pm;
9209 pl_yylval.ival = OP_MATCH;
9214 S_scan_subst(pTHX_ char *start)
9221 char charset = '\0'; /* character set modifier */
9226 PERL_ARGS_ASSERT_SCAN_SUBST;
9228 pl_yylval.ival = OP_NULL;
9230 s = scan_str(start,!!PL_madskills,FALSE,FALSE);
9233 Perl_croak(aTHX_ "Substitution pattern not terminated");
9235 if (s[-1] == PL_multi_open)
9239 CURMAD('q', PL_thisopen);
9240 CURMAD('_', PL_thiswhite);
9241 CURMAD('E', PL_thisstuff);
9242 CURMAD('Q', PL_thisclose);
9243 PL_realtokenstart = s - SvPVX(PL_linestr);
9247 first_start = PL_multi_start;
9248 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
9251 SvREFCNT_dec(PL_lex_stuff);
9252 PL_lex_stuff = NULL;
9254 Perl_croak(aTHX_ "Substitution replacement not terminated");
9256 PL_multi_start = first_start; /* so whole substitution is taken together */
9258 pm = (PMOP*)newPMOP(OP_SUBST, 0);
9262 CURMAD('z', PL_thisopen);
9263 CURMAD('R', PL_thisstuff);
9264 CURMAD('Z', PL_thisclose);
9270 if (*s == EXEC_PAT_MOD) {
9274 else if (! S_pmflag(aTHX_ S_PAT_MODS, &(pm->op_pmflags), &s, &charset))
9283 curmad('m', newSVpvn(modstart, s - modstart));
9284 append_madprops(PL_thismad, (OP*)pm, 0);
9288 if ((pm->op_pmflags & PMf_CONTINUE)) {
9289 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), "Use of /c modifier is meaningless in s///" );
9293 SV * const repl = newSVpvs("");
9295 PL_sublex_info.super_bufptr = s;
9296 PL_sublex_info.super_bufend = PL_bufend;
9298 pm->op_pmflags |= PMf_EVAL;
9301 sv_catpvs(repl, "eval ");
9303 sv_catpvs(repl, "do ");
9305 sv_catpvs(repl, "{");
9306 sv_catsv(repl, PL_lex_repl);
9307 if (strchr(SvPVX(PL_lex_repl), '#'))
9308 sv_catpvs(repl, "\n");
9309 sv_catpvs(repl, "}");
9311 SvREFCNT_dec(PL_lex_repl);
9315 PL_lex_op = (OP*)pm;
9316 pl_yylval.ival = OP_SUBST;
9321 S_scan_trans(pTHX_ char *start)
9329 bool nondestruct = 0;
9334 PERL_ARGS_ASSERT_SCAN_TRANS;
9336 pl_yylval.ival = OP_NULL;
9338 s = scan_str(start,!!PL_madskills,FALSE,FALSE);
9340 Perl_croak(aTHX_ "Transliteration pattern not terminated");
9342 if (s[-1] == PL_multi_open)
9346 CURMAD('q', PL_thisopen);
9347 CURMAD('_', PL_thiswhite);
9348 CURMAD('E', PL_thisstuff);
9349 CURMAD('Q', PL_thisclose);
9350 PL_realtokenstart = s - SvPVX(PL_linestr);
9354 s = scan_str(s,!!PL_madskills,FALSE,FALSE);
9357 SvREFCNT_dec(PL_lex_stuff);
9358 PL_lex_stuff = NULL;
9360 Perl_croak(aTHX_ "Transliteration replacement not terminated");
9363 CURMAD('z', PL_thisopen);
9364 CURMAD('R', PL_thisstuff);
9365 CURMAD('Z', PL_thisclose);
9368 complement = del = squash = 0;
9375 complement = OPpTRANS_COMPLEMENT;
9378 del = OPpTRANS_DELETE;
9381 squash = OPpTRANS_SQUASH;
9393 o = newPVOP(nondestruct ? OP_TRANSR : OP_TRANS, 0, (char*)NULL);
9394 o->op_private &= ~OPpTRANS_ALL;
9395 o->op_private |= del|squash|complement|
9396 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
9397 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
9400 pl_yylval.ival = nondestruct ? OP_TRANSR : OP_TRANS;
9405 curmad('m', newSVpvn(modstart, s - modstart));
9406 append_madprops(PL_thismad, o, 0);
9415 S_scan_heredoc(pTHX_ register char *s)
9419 I32 op_type = OP_SCALAR;
9423 const char *found_newline;
9427 const int outer = (PL_rsfp || PL_parser->filtered)
9428 && !(PL_lex_inwhat == OP_SCALAR);
9430 I32 stuffstart = s - SvPVX(PL_linestr);
9433 PL_realtokenstart = -1;
9436 PERL_ARGS_ASSERT_SCAN_HEREDOC;
9440 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
9444 while (SPACE_OR_TAB(*peek))
9446 if (*peek == '`' || *peek == '\'' || *peek =='"') {
9449 s = delimcpy(d, e, s, PL_bufend, term, &len);
9459 if (!isALNUM_lazy_if(s,UTF))
9460 deprecate("bare << to mean <<\"\"");
9461 for (; isALNUM_lazy_if(s,UTF); s++) {
9466 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
9467 Perl_croak(aTHX_ "Delimiter for here document is too long");
9470 len = d - PL_tokenbuf;
9474 tstart = PL_tokenbuf + !outer;
9475 PL_thisclose = newSVpvn(tstart, len - !outer);
9476 tstart = SvPVX(PL_linestr) + stuffstart;
9477 PL_thisopen = newSVpvn(tstart, s - tstart);
9478 stuffstart = s - SvPVX(PL_linestr);
9481 #ifndef PERL_STRICT_CR
9482 d = strchr(s, '\r');
9484 char * const olds = s;
9486 while (s < PL_bufend) {
9492 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
9501 SvCUR_set(PL_linestr, PL_bufend - SvPVX_const(PL_linestr));
9508 if ( outer || !(found_newline = (char*)memchr((void*)s, '\n', PL_bufend - s)) ) {
9509 herewas = newSVpvn(s,PL_bufend-s);
9513 herewas = newSVpvn(s-1,found_newline-s+1);
9516 herewas = newSVpvn(s,found_newline-s);
9521 tstart = SvPVX(PL_linestr) + stuffstart;
9523 sv_catpvn(PL_thisstuff, tstart, s - tstart);
9525 PL_thisstuff = newSVpvn(tstart, s - tstart);
9528 s += SvCUR(herewas);
9531 stuffstart = s - SvPVX(PL_linestr);
9537 tmpstr = newSV_type(SVt_PVIV);
9541 SvIV_set(tmpstr, -1);
9543 else if (term == '`') {
9544 op_type = OP_BACKTICK;
9545 SvIV_set(tmpstr, '\\');
9549 PL_multi_start = CopLINE(PL_curcop);
9550 PL_multi_open = PL_multi_close = '<';
9551 term = *PL_tokenbuf;
9552 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp
9553 && !PL_parser->filtered) {
9554 char * const bufptr = PL_sublex_info.super_bufptr;
9555 char * const bufend = PL_sublex_info.super_bufend;
9556 char * const olds = s - SvCUR(herewas);
9557 s = strchr(bufptr, '\n');
9561 while (s < bufend &&
9562 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
9564 CopLINE_inc(PL_curcop);
9567 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
9568 missingterm(PL_tokenbuf);
9570 sv_setpvn(herewas,bufptr,d-bufptr+1);
9571 sv_setpvn(tmpstr,d+1,s-d);
9573 sv_catpvn(herewas,s,bufend-s);
9574 Copy(SvPVX_const(herewas),bufptr,SvCUR(herewas) + 1,char);
9581 while (s < PL_bufend &&
9582 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
9584 CopLINE_inc(PL_curcop);
9586 if (s >= PL_bufend) {
9587 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
9588 missingterm(PL_tokenbuf);
9590 sv_setpvn(tmpstr,d+1,s-d);
9594 sv_catpvn(PL_thisstuff, d + 1, s - d);
9596 PL_thisstuff = newSVpvn(d + 1, s - d);
9597 stuffstart = s - SvPVX(PL_linestr);
9601 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
9603 sv_catpvn(herewas,s,PL_bufend-s);
9604 sv_setsv(PL_linestr,herewas);
9605 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
9606 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9607 PL_last_lop = PL_last_uni = NULL;
9610 sv_setpvs(tmpstr,""); /* avoid "uninitialized" warning */
9611 while (s >= PL_bufend) { /* multiple line string? */
9614 tstart = SvPVX(PL_linestr) + stuffstart;
9616 sv_catpvn(PL_thisstuff, tstart, PL_bufend - tstart);
9618 PL_thisstuff = newSVpvn(tstart, PL_bufend - tstart);
9622 CopLINE_inc(PL_curcop);
9623 if (!outer || !lex_next_chunk(0)) {
9624 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
9625 missingterm(PL_tokenbuf);
9627 CopLINE_dec(PL_curcop);
9630 stuffstart = s - SvPVX(PL_linestr);
9632 CopLINE_inc(PL_curcop);
9633 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9634 PL_last_lop = PL_last_uni = NULL;
9635 #ifndef PERL_STRICT_CR
9636 if (PL_bufend - PL_linestart >= 2) {
9637 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
9638 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
9640 PL_bufend[-2] = '\n';
9642 SvCUR_set(PL_linestr, PL_bufend - SvPVX_const(PL_linestr));
9644 else if (PL_bufend[-1] == '\r')
9645 PL_bufend[-1] = '\n';
9647 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
9648 PL_bufend[-1] = '\n';
9650 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
9651 STRLEN off = PL_bufend - 1 - SvPVX_const(PL_linestr);
9652 *(SvPVX(PL_linestr) + off ) = ' ';
9653 lex_grow_linestr(SvCUR(PL_linestr) + SvCUR(herewas) + 1);
9654 sv_catsv(PL_linestr,herewas);
9655 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9656 s = SvPVX(PL_linestr) + off; /* In case PV of PL_linestr moved. */
9660 sv_catsv(tmpstr,PL_linestr);
9665 PL_multi_end = CopLINE(PL_curcop);
9666 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
9667 SvPV_shrink_to_cur(tmpstr);
9669 SvREFCNT_dec(herewas);
9671 if (UTF && is_utf8_string((U8*)SvPVX_const(tmpstr), SvCUR(tmpstr)))
9673 else if (PL_encoding)
9674 sv_recode_to_utf8(tmpstr, PL_encoding);
9676 PL_lex_stuff = tmpstr;
9677 pl_yylval.ival = op_type;
9682 takes: current position in input buffer
9683 returns: new position in input buffer
9684 side-effects: pl_yylval and lex_op are set.
9689 <FH> read from filehandle
9690 <pkg::FH> read from package qualified filehandle
9691 <pkg'FH> read from package qualified filehandle
9692 <$fh> read from filehandle in $fh
9698 S_scan_inputsymbol(pTHX_ char *start)
9701 register char *s = start; /* current position in buffer */
9704 char *d = PL_tokenbuf; /* start of temp holding space */
9705 const char * const e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
9707 PERL_ARGS_ASSERT_SCAN_INPUTSYMBOL;
9709 end = strchr(s, '\n');
9712 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
9714 /* die if we didn't have space for the contents of the <>,
9715 or if it didn't end, or if we see a newline
9718 if (len >= (I32)sizeof PL_tokenbuf)
9719 Perl_croak(aTHX_ "Excessively long <> operator");
9721 Perl_croak(aTHX_ "Unterminated <> operator");
9726 Remember, only scalar variables are interpreted as filehandles by
9727 this code. Anything more complex (e.g., <$fh{$num}>) will be
9728 treated as a glob() call.
9729 This code makes use of the fact that except for the $ at the front,
9730 a scalar variable and a filehandle look the same.
9732 if (*d == '$' && d[1]) d++;
9734 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
9735 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
9736 d += UTF ? UTF8SKIP(d) : 1;
9738 /* If we've tried to read what we allow filehandles to look like, and
9739 there's still text left, then it must be a glob() and not a getline.
9740 Use scan_str to pull out the stuff between the <> and treat it
9741 as nothing more than a string.
9744 if (d - PL_tokenbuf != len) {
9745 pl_yylval.ival = OP_GLOB;
9746 s = scan_str(start,!!PL_madskills,FALSE,FALSE);
9748 Perl_croak(aTHX_ "Glob not terminated");
9752 bool readline_overriden = FALSE;
9755 /* we're in a filehandle read situation */
9758 /* turn <> into <ARGV> */
9760 Copy("ARGV",d,5,char);
9762 /* Check whether readline() is overriden */
9763 gv_readline = gv_fetchpvs("readline", GV_NOTQUAL, SVt_PVCV);
9765 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
9767 ((gvp = (GV**)hv_fetchs(PL_globalstash, "readline", FALSE))
9768 && (gv_readline = *gvp) && isGV_with_GP(gv_readline)
9769 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
9770 readline_overriden = TRUE;
9772 /* if <$fh>, create the ops to turn the variable into a
9776 /* try to find it in the pad for this block, otherwise find
9777 add symbol table ops
9779 const PADOFFSET tmp = pad_findmy_pvn(d, len, UTF ? SVf_UTF8 : 0);
9780 if (tmp != NOT_IN_PAD) {
9781 if (PAD_COMPNAME_FLAGS_isOUR(tmp)) {
9782 HV * const stash = PAD_COMPNAME_OURSTASH(tmp);
9783 HEK * const stashname = HvNAME_HEK(stash);
9784 SV * const sym = sv_2mortal(newSVhek(stashname));
9785 sv_catpvs(sym, "::");
9791 OP * const o = newOP(OP_PADSV, 0);
9793 PL_lex_op = readline_overriden
9794 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
9795 op_append_elem(OP_LIST, o,
9796 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
9797 : (OP*)newUNOP(OP_READLINE, 0, o);
9806 ? (GV_ADDMULTI | GV_ADDINEVAL)
9807 : GV_ADDMULTI) | ( UTF ? SVf_UTF8 : 0 ),
9809 PL_lex_op = readline_overriden
9810 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
9811 op_append_elem(OP_LIST,
9812 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
9813 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
9814 : (OP*)newUNOP(OP_READLINE, 0,
9815 newUNOP(OP_RV2SV, 0,
9816 newGVOP(OP_GV, 0, gv)));
9818 if (!readline_overriden)
9819 PL_lex_op->op_flags |= OPf_SPECIAL;
9820 /* we created the ops in PL_lex_op, so make pl_yylval.ival a null op */
9821 pl_yylval.ival = OP_NULL;
9824 /* If it's none of the above, it must be a literal filehandle
9825 (<Foo::BAR> or <FOO>) so build a simple readline OP */
9827 GV * const gv = gv_fetchpv(d, GV_ADD | ( UTF ? SVf_UTF8 : 0 ), SVt_PVIO);
9828 PL_lex_op = readline_overriden
9829 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
9830 op_append_elem(OP_LIST,
9831 newGVOP(OP_GV, 0, gv),
9832 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
9833 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
9834 pl_yylval.ival = OP_NULL;
9843 takes: start position in buffer
9844 keep_quoted preserve \ on the embedded delimiter(s)
9845 keep_delims preserve the delimiters around the string
9846 re_reparse compiling a run-time /(?{})/:
9847 collapse // to /, and skip encoding src
9848 returns: position to continue reading from buffer
9849 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
9850 updates the read buffer.
9852 This subroutine pulls a string out of the input. It is called for:
9853 q single quotes q(literal text)
9854 ' single quotes 'literal text'
9855 qq double quotes qq(interpolate $here please)
9856 " double quotes "interpolate $here please"
9857 qx backticks qx(/bin/ls -l)
9858 ` backticks `/bin/ls -l`
9859 qw quote words @EXPORT_OK = qw( func() $spam )
9860 m// regexp match m/this/
9861 s/// regexp substitute s/this/that/
9862 tr/// string transliterate tr/this/that/
9863 y/// string transliterate y/this/that/
9864 ($*@) sub prototypes sub foo ($)
9865 (stuff) sub attr parameters sub foo : attr(stuff)
9866 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
9868 In most of these cases (all but <>, patterns and transliterate)
9869 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
9870 calls scan_str(). s/// makes yylex() call scan_subst() which calls
9871 scan_str(). tr/// and y/// make yylex() call scan_trans() which
9874 It skips whitespace before the string starts, and treats the first
9875 character as the delimiter. If the delimiter is one of ([{< then
9876 the corresponding "close" character )]}> is used as the closing
9877 delimiter. It allows quoting of delimiters, and if the string has
9878 balanced delimiters ([{<>}]) it allows nesting.
9880 On success, the SV with the resulting string is put into lex_stuff or,
9881 if that is already non-NULL, into lex_repl. The second case occurs only
9882 when parsing the RHS of the special constructs s/// and tr/// (y///).
9883 For convenience, the terminating delimiter character is stuffed into
9888 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims, int re_reparse)
9891 SV *sv; /* scalar value: string */
9892 const char *tmps; /* temp string, used for delimiter matching */
9893 register char *s = start; /* current position in the buffer */
9894 register char term; /* terminating character */
9895 register char *to; /* current position in the sv's data */
9896 I32 brackets = 1; /* bracket nesting level */
9897 bool has_utf8 = FALSE; /* is there any utf8 content? */
9898 I32 termcode; /* terminating char. code */
9899 U8 termstr[UTF8_MAXBYTES]; /* terminating string */
9900 STRLEN termlen; /* length of terminating string */
9901 int last_off = 0; /* last position for nesting bracket */
9907 PERL_ARGS_ASSERT_SCAN_STR;
9909 /* skip space before the delimiter */
9915 if (PL_realtokenstart >= 0) {
9916 stuffstart = PL_realtokenstart;
9917 PL_realtokenstart = -1;
9920 stuffstart = start - SvPVX(PL_linestr);
9922 /* mark where we are, in case we need to report errors */
9925 /* after skipping whitespace, the next character is the terminator */
9928 termcode = termstr[0] = term;
9932 termcode = utf8_to_uvchr_buf((U8*)s, (U8*)PL_bufend, &termlen);
9933 Copy(s, termstr, termlen, U8);
9934 if (!UTF8_IS_INVARIANT(term))
9938 /* mark where we are */
9939 PL_multi_start = CopLINE(PL_curcop);
9940 PL_multi_open = term;
9942 /* find corresponding closing delimiter */
9943 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
9944 termcode = termstr[0] = term = tmps[5];
9946 PL_multi_close = term;
9948 /* create a new SV to hold the contents. 79 is the SV's initial length.
9949 What a random number. */
9950 sv = newSV_type(SVt_PVIV);
9952 SvIV_set(sv, termcode);
9953 (void)SvPOK_only(sv); /* validate pointer */
9955 /* move past delimiter and try to read a complete string */
9957 sv_catpvn(sv, s, termlen);
9960 tstart = SvPVX(PL_linestr) + stuffstart;
9961 if (!PL_thisopen && !keep_delims) {
9962 PL_thisopen = newSVpvn(tstart, s - tstart);
9963 stuffstart = s - SvPVX(PL_linestr);
9967 if (PL_encoding && !UTF && !re_reparse) {
9971 int offset = s - SvPVX_const(PL_linestr);
9972 const bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
9973 &offset, (char*)termstr, termlen);
9974 const char * const ns = SvPVX_const(PL_linestr) + offset;
9975 char * const svlast = SvEND(sv) - 1;
9977 for (; s < ns; s++) {
9978 if (*s == '\n' && !PL_rsfp && !PL_parser->filtered)
9979 CopLINE_inc(PL_curcop);
9982 goto read_more_line;
9984 /* handle quoted delimiters */
9985 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
9987 for (t = svlast-2; t >= SvPVX_const(sv) && *t == '\\';)
9989 if ((svlast-1 - t) % 2) {
9993 SvCUR_set(sv, SvCUR(sv) - 1);
9998 if (PL_multi_open == PL_multi_close) {
10004 for (t = w = SvPVX(sv)+last_off; t < svlast; w++, t++) {
10005 /* At here, all closes are "was quoted" one,
10006 so we don't check PL_multi_close. */
10008 if (!keep_quoted && *(t+1) == PL_multi_open)
10013 else if (*t == PL_multi_open)
10021 SvCUR_set(sv, w - SvPVX_const(sv));
10023 last_off = w - SvPVX(sv);
10024 if (--brackets <= 0)
10029 if (!keep_delims) {
10030 SvCUR_set(sv, SvCUR(sv) - 1);
10036 /* extend sv if need be */
10037 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
10038 /* set 'to' to the next character in the sv's string */
10039 to = SvPVX(sv)+SvCUR(sv);
10041 /* if open delimiter is the close delimiter read unbridle */
10042 if (PL_multi_open == PL_multi_close) {
10043 for (; s < PL_bufend; s++,to++) {
10044 /* embedded newlines increment the current line number */
10045 if (*s == '\n' && !PL_rsfp && !PL_parser->filtered)
10046 CopLINE_inc(PL_curcop);
10047 /* handle quoted delimiters */
10048 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
10051 || (re_reparse && s[1] == '\\'))
10054 /* any other quotes are simply copied straight through */
10058 /* terminate when run out of buffer (the for() condition), or
10059 have found the terminator */
10060 else if (*s == term) {
10063 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
10066 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
10072 /* if the terminator isn't the same as the start character (e.g.,
10073 matched brackets), we have to allow more in the quoting, and
10074 be prepared for nested brackets.
10077 /* read until we run out of string, or we find the terminator */
10078 for (; s < PL_bufend; s++,to++) {
10079 /* embedded newlines increment the line count */
10080 if (*s == '\n' && !PL_rsfp && !PL_parser->filtered)
10081 CopLINE_inc(PL_curcop);
10082 /* backslashes can escape the open or closing characters */
10083 if (*s == '\\' && s+1 < PL_bufend) {
10084 if (!keep_quoted &&
10085 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
10090 /* allow nested opens and closes */
10091 else if (*s == PL_multi_close && --brackets <= 0)
10093 else if (*s == PL_multi_open)
10095 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
10100 /* terminate the copied string and update the sv's end-of-string */
10102 SvCUR_set(sv, to - SvPVX_const(sv));
10105 * this next chunk reads more into the buffer if we're not done yet
10109 break; /* handle case where we are done yet :-) */
10111 #ifndef PERL_STRICT_CR
10112 if (to - SvPVX_const(sv) >= 2) {
10113 if ((to[-2] == '\r' && to[-1] == '\n') ||
10114 (to[-2] == '\n' && to[-1] == '\r'))
10118 SvCUR_set(sv, to - SvPVX_const(sv));
10120 else if (to[-1] == '\r')
10123 else if (to - SvPVX_const(sv) == 1 && to[-1] == '\r')
10128 /* if we're out of file, or a read fails, bail and reset the current
10129 line marker so we can report where the unterminated string began
10132 if (PL_madskills) {
10133 char * const tstart = SvPVX(PL_linestr) + stuffstart;
10135 sv_catpvn(PL_thisstuff, tstart, PL_bufend - tstart);
10137 PL_thisstuff = newSVpvn(tstart, PL_bufend - tstart);
10140 CopLINE_inc(PL_curcop);
10141 PL_bufptr = PL_bufend;
10142 if (!lex_next_chunk(0)) {
10144 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
10153 /* at this point, we have successfully read the delimited string */
10155 if (!PL_encoding || UTF || re_reparse) {
10157 if (PL_madskills) {
10158 char * const tstart = SvPVX(PL_linestr) + stuffstart;
10159 const int len = s - tstart;
10161 sv_catpvn(PL_thisstuff, tstart, len);
10163 PL_thisstuff = newSVpvn(tstart, len);
10164 if (!PL_thisclose && !keep_delims)
10165 PL_thisclose = newSVpvn(s,termlen);
10170 sv_catpvn(sv, s, termlen);
10175 if (PL_madskills) {
10176 char * const tstart = SvPVX(PL_linestr) + stuffstart;
10177 const int len = s - tstart - termlen;
10179 sv_catpvn(PL_thisstuff, tstart, len);
10181 PL_thisstuff = newSVpvn(tstart, len);
10182 if (!PL_thisclose && !keep_delims)
10183 PL_thisclose = newSVpvn(s - termlen,termlen);
10187 if (has_utf8 || (PL_encoding && !re_reparse))
10190 PL_multi_end = CopLINE(PL_curcop);
10192 /* if we allocated too much space, give some back */
10193 if (SvCUR(sv) + 5 < SvLEN(sv)) {
10194 SvLEN_set(sv, SvCUR(sv) + 1);
10195 SvPV_renew(sv, SvLEN(sv));
10198 /* decide whether this is the first or second quoted string we've read
10211 takes: pointer to position in buffer
10212 returns: pointer to new position in buffer
10213 side-effects: builds ops for the constant in pl_yylval.op
10215 Read a number in any of the formats that Perl accepts:
10217 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
10218 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
10221 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
10223 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
10226 If it reads a number without a decimal point or an exponent, it will
10227 try converting the number to an integer and see if it can do so
10228 without loss of precision.
10232 Perl_scan_num(pTHX_ const char *start, YYSTYPE* lvalp)
10235 register const char *s = start; /* current position in buffer */
10236 register char *d; /* destination in temp buffer */
10237 register char *e; /* end of temp buffer */
10238 NV nv; /* number read, as a double */
10239 SV *sv = NULL; /* place to put the converted number */
10240 bool floatit; /* boolean: int or float? */
10241 const char *lastub = NULL; /* position of last underbar */
10242 static char const number_too_long[] = "Number too long";
10244 PERL_ARGS_ASSERT_SCAN_NUM;
10246 /* We use the first character to decide what type of number this is */
10250 Perl_croak(aTHX_ "panic: scan_num, *s=%d", *s);
10252 /* if it starts with a 0, it could be an octal number, a decimal in
10253 0.13 disguise, or a hexadecimal number, or a binary number. */
10257 u holds the "number so far"
10258 shift the power of 2 of the base
10259 (hex == 4, octal == 3, binary == 1)
10260 overflowed was the number more than we can hold?
10262 Shift is used when we add a digit. It also serves as an "are
10263 we in octal/hex/binary?" indicator to disallow hex characters
10264 when in octal mode.
10269 bool overflowed = FALSE;
10270 bool just_zero = TRUE; /* just plain 0 or binary number? */
10271 static const NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
10272 static const char* const bases[5] =
10273 { "", "binary", "", "octal", "hexadecimal" };
10274 static const char* const Bases[5] =
10275 { "", "Binary", "", "Octal", "Hexadecimal" };
10276 static const char* const maxima[5] =
10278 "0b11111111111111111111111111111111",
10282 const char *base, *Base, *max;
10284 /* check for hex */
10285 if (s[1] == 'x' || s[1] == 'X') {
10289 } else if (s[1] == 'b' || s[1] == 'B') {
10294 /* check for a decimal in disguise */
10295 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
10297 /* so it must be octal */
10304 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10305 "Misplaced _ in number");
10309 base = bases[shift];
10310 Base = Bases[shift];
10311 max = maxima[shift];
10313 /* read the rest of the number */
10315 /* x is used in the overflow test,
10316 b is the digit we're adding on. */
10321 /* if we don't mention it, we're done */
10325 /* _ are ignored -- but warned about if consecutive */
10327 if (lastub && s == lastub + 1)
10328 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10329 "Misplaced _ in number");
10333 /* 8 and 9 are not octal */
10334 case '8': case '9':
10336 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
10340 case '2': case '3': case '4':
10341 case '5': case '6': case '7':
10343 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
10346 case '0': case '1':
10347 b = *s++ & 15; /* ASCII digit -> value of digit */
10351 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
10352 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
10353 /* make sure they said 0x */
10356 b = (*s++ & 7) + 9;
10358 /* Prepare to put the digit we have onto the end
10359 of the number so far. We check for overflows.
10365 x = u << shift; /* make room for the digit */
10367 if ((x >> shift) != u
10368 && !(PL_hints & HINT_NEW_BINARY)) {
10371 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
10372 "Integer overflow in %s number",
10375 u = x | b; /* add the digit to the end */
10378 n *= nvshift[shift];
10379 /* If an NV has not enough bits in its
10380 * mantissa to represent an UV this summing of
10381 * small low-order numbers is a waste of time
10382 * (because the NV cannot preserve the
10383 * low-order bits anyway): we could just
10384 * remember when did we overflow and in the
10385 * end just multiply n by the right
10393 /* if we get here, we had success: make a scalar value from
10398 /* final misplaced underbar check */
10399 if (s[-1] == '_') {
10400 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
10404 if (n > 4294967295.0)
10405 Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
10406 "%s number > %s non-portable",
10412 if (u > 0xffffffff)
10413 Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
10414 "%s number > %s non-portable",
10419 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
10420 sv = new_constant(start, s - start, "integer",
10421 sv, NULL, NULL, 0);
10422 else if (PL_hints & HINT_NEW_BINARY)
10423 sv = new_constant(start, s - start, "binary", sv, NULL, NULL, 0);
10428 handle decimal numbers.
10429 we're also sent here when we read a 0 as the first digit
10431 case '1': case '2': case '3': case '4': case '5':
10432 case '6': case '7': case '8': case '9': case '.':
10435 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
10438 /* read next group of digits and _ and copy into d */
10439 while (isDIGIT(*s) || *s == '_') {
10440 /* skip underscores, checking for misplaced ones
10444 if (lastub && s == lastub + 1)
10445 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10446 "Misplaced _ in number");
10450 /* check for end of fixed-length buffer */
10452 Perl_croak(aTHX_ number_too_long);
10453 /* if we're ok, copy the character */
10458 /* final misplaced underbar check */
10459 if (lastub && s == lastub + 1) {
10460 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
10463 /* read a decimal portion if there is one. avoid
10464 3..5 being interpreted as the number 3. followed
10467 if (*s == '.' && s[1] != '.') {
10472 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10473 "Misplaced _ in number");
10477 /* copy, ignoring underbars, until we run out of digits.
10479 for (; isDIGIT(*s) || *s == '_'; s++) {
10480 /* fixed length buffer check */
10482 Perl_croak(aTHX_ number_too_long);
10484 if (lastub && s == lastub + 1)
10485 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10486 "Misplaced _ in number");
10492 /* fractional part ending in underbar? */
10493 if (s[-1] == '_') {
10494 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10495 "Misplaced _ in number");
10497 if (*s == '.' && isDIGIT(s[1])) {
10498 /* oops, it's really a v-string, but without the "v" */
10504 /* read exponent part, if present */
10505 if ((*s == 'e' || *s == 'E') && strchr("+-0123456789_", s[1])) {
10509 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
10510 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
10512 /* stray preinitial _ */
10514 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10515 "Misplaced _ in number");
10519 /* allow positive or negative exponent */
10520 if (*s == '+' || *s == '-')
10523 /* stray initial _ */
10525 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10526 "Misplaced _ in number");
10530 /* read digits of exponent */
10531 while (isDIGIT(*s) || *s == '_') {
10534 Perl_croak(aTHX_ number_too_long);
10538 if (((lastub && s == lastub + 1) ||
10539 (!isDIGIT(s[1]) && s[1] != '_')))
10540 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
10541 "Misplaced _ in number");
10549 We try to do an integer conversion first if no characters
10550 indicating "float" have been found.
10555 const int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
10557 if (flags == IS_NUMBER_IN_UV) {
10559 sv = newSViv(uv); /* Prefer IVs over UVs. */
10562 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
10563 if (uv <= (UV) IV_MIN)
10564 sv = newSViv(-(IV)uv);
10571 /* terminate the string */
10573 nv = Atof(PL_tokenbuf);
10578 ? (PL_hints & HINT_NEW_FLOAT) : (PL_hints & HINT_NEW_INTEGER) ) {
10579 const char *const key = floatit ? "float" : "integer";
10580 const STRLEN keylen = floatit ? 5 : 7;
10581 sv = S_new_constant(aTHX_ PL_tokenbuf, d - PL_tokenbuf,
10582 key, keylen, sv, NULL, NULL, 0);
10586 /* if it starts with a v, it could be a v-string */
10589 sv = newSV(5); /* preallocate storage space */
10590 s = scan_vstring(s, PL_bufend, sv);
10594 /* make the op for the constant and return */
10597 lvalp->opval = newSVOP(OP_CONST, 0, sv);
10599 lvalp->opval = NULL;
10605 S_scan_formline(pTHX_ register char *s)
10608 register char *eol;
10610 SV * const stuff = newSVpvs("");
10611 bool needargs = FALSE;
10612 bool eofmt = FALSE;
10614 char *tokenstart = s;
10615 SV* savewhite = NULL;
10617 if (PL_madskills) {
10618 savewhite = PL_thiswhite;
10623 PERL_ARGS_ASSERT_SCAN_FORMLINE;
10625 while (!needargs) {
10628 #ifdef PERL_STRICT_CR
10629 while (SPACE_OR_TAB(*t))
10632 while (SPACE_OR_TAB(*t) || *t == '\r')
10635 if (*t == '\n' || t == PL_bufend) {
10640 if (PL_in_eval && !PL_rsfp && !PL_parser->filtered) {
10641 eol = (char *) memchr(s,'\n',PL_bufend-s);
10646 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10648 for (t = s; t < eol; t++) {
10649 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
10651 goto enough; /* ~~ must be first line in formline */
10653 if (*t == '@' || *t == '^')
10657 sv_catpvn(stuff, s, eol-s);
10658 #ifndef PERL_STRICT_CR
10659 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
10660 char *end = SvPVX(stuff) + SvCUR(stuff);
10663 SvCUR_set(stuff, SvCUR(stuff) - 1);
10671 if (PL_rsfp || PL_parser->filtered) {
10674 if (PL_madskills) {
10676 sv_catpvn(PL_thistoken, tokenstart, PL_bufend - tokenstart);
10678 PL_thistoken = newSVpvn(tokenstart, PL_bufend - tokenstart);
10681 PL_bufptr = PL_bufend;
10682 CopLINE_inc(PL_curcop);
10683 got_some = lex_next_chunk(0);
10684 CopLINE_dec(PL_curcop);
10687 tokenstart = PL_bufptr;
10695 if (SvCUR(stuff)) {
10698 PL_lex_state = LEX_NORMAL;
10699 start_force(PL_curforce);
10700 NEXTVAL_NEXTTOKE.ival = 0;
10704 PL_lex_state = LEX_FORMLINE;
10706 if (UTF && is_utf8_string((U8*)SvPVX_const(stuff), SvCUR(stuff)))
10708 else if (PL_encoding)
10709 sv_recode_to_utf8(stuff, PL_encoding);
10711 start_force(PL_curforce);
10712 NEXTVAL_NEXTTOKE.opval = (OP*)newSVOP(OP_CONST, 0, stuff);
10714 start_force(PL_curforce);
10715 NEXTVAL_NEXTTOKE.ival = OP_FORMLINE;
10719 SvREFCNT_dec(stuff);
10721 PL_lex_formbrack = 0;
10725 if (PL_madskills) {
10727 sv_catpvn(PL_thistoken, tokenstart, s - tokenstart);
10729 PL_thistoken = newSVpvn(tokenstart, s - tokenstart);
10730 PL_thiswhite = savewhite;
10737 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
10740 const I32 oldsavestack_ix = PL_savestack_ix;
10741 CV* const outsidecv = PL_compcv;
10744 assert(SvTYPE(PL_compcv) == SVt_PVCV);
10746 SAVEI32(PL_subline);
10747 save_item(PL_subname);
10748 SAVESPTR(PL_compcv);
10750 PL_compcv = MUTABLE_CV(newSV_type(is_format ? SVt_PVFM : SVt_PVCV));
10751 CvFLAGS(PL_compcv) |= flags;
10753 PL_subline = CopLINE(PL_curcop);
10754 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
10755 CvOUTSIDE(PL_compcv) = MUTABLE_CV(SvREFCNT_inc_simple(outsidecv));
10756 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
10758 return oldsavestack_ix;
10762 #pragma segment Perl_yylex
10765 S_yywarn(pTHX_ const char *const s, U32 flags)
10769 PERL_ARGS_ASSERT_YYWARN;
10771 PL_in_eval |= EVAL_WARNONLY;
10772 yyerror_pv(s, flags);
10773 PL_in_eval &= ~EVAL_WARNONLY;
10778 Perl_yyerror(pTHX_ const char *const s)
10780 PERL_ARGS_ASSERT_YYERROR;
10781 return yyerror_pvn(s, strlen(s), 0);
10785 Perl_yyerror_pv(pTHX_ const char *const s, U32 flags)
10787 PERL_ARGS_ASSERT_YYERROR_PV;
10788 return yyerror_pvn(s, strlen(s), flags);
10792 Perl_yyerror_pvn(pTHX_ const char *const s, STRLEN len, U32 flags)
10795 const char *context = NULL;
10798 SV * const where_sv = newSVpvs_flags("", SVs_TEMP);
10799 int yychar = PL_parser->yychar;
10800 U32 is_utf8 = flags & SVf_UTF8;
10802 PERL_ARGS_ASSERT_YYERROR_PVN;
10804 if (!yychar || (yychar == ';' && !PL_rsfp))
10805 sv_catpvs(where_sv, "at EOF");
10806 else if (PL_oldoldbufptr && PL_bufptr > PL_oldoldbufptr &&
10807 PL_bufptr - PL_oldoldbufptr < 200 && PL_oldoldbufptr != PL_oldbufptr &&
10808 PL_oldbufptr != PL_bufptr) {
10811 The code below is removed for NetWare because it abends/crashes on NetWare
10812 when the script has error such as not having the closing quotes like:
10813 if ($var eq "value)
10814 Checking of white spaces is anyway done in NetWare code.
10817 while (isSPACE(*PL_oldoldbufptr))
10820 context = PL_oldoldbufptr;
10821 contlen = PL_bufptr - PL_oldoldbufptr;
10823 else if (PL_oldbufptr && PL_bufptr > PL_oldbufptr &&
10824 PL_bufptr - PL_oldbufptr < 200 && PL_oldbufptr != PL_bufptr) {
10827 The code below is removed for NetWare because it abends/crashes on NetWare
10828 when the script has error such as not having the closing quotes like:
10829 if ($var eq "value)
10830 Checking of white spaces is anyway done in NetWare code.
10833 while (isSPACE(*PL_oldbufptr))
10836 context = PL_oldbufptr;
10837 contlen = PL_bufptr - PL_oldbufptr;
10839 else if (yychar > 255)
10840 sv_catpvs(where_sv, "next token ???");
10841 else if (yychar == -2) { /* YYEMPTY */
10842 if (PL_lex_state == LEX_NORMAL ||
10843 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
10844 sv_catpvs(where_sv, "at end of line");
10845 else if (PL_lex_inpat)
10846 sv_catpvs(where_sv, "within pattern");
10848 sv_catpvs(where_sv, "within string");
10851 sv_catpvs(where_sv, "next char ");
10853 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
10854 else if (isPRINT_LC(yychar)) {
10855 const char string = yychar;
10856 sv_catpvn(where_sv, &string, 1);
10859 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
10861 msg = sv_2mortal(newSVpvn_flags(s, len, is_utf8));
10862 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
10863 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
10865 Perl_sv_catpvf(aTHX_ msg, "near \"%"SVf"\"\n",
10866 SVfARG(newSVpvn_flags(context, contlen,
10867 SVs_TEMP | (UTF ? SVf_UTF8 : 0))));
10869 Perl_sv_catpvf(aTHX_ msg, "%"SVf"\n", SVfARG(where_sv));
10870 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
10871 Perl_sv_catpvf(aTHX_ msg,
10872 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
10873 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
10876 if (PL_in_eval & EVAL_WARNONLY) {
10877 Perl_ck_warner_d(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, SVfARG(msg));
10881 if (PL_error_count >= 10) {
10882 if (PL_in_eval && SvCUR(ERRSV))
10883 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
10884 SVfARG(ERRSV), OutCopFILE(PL_curcop));
10886 Perl_croak(aTHX_ "%s has too many errors.\n",
10887 OutCopFILE(PL_curcop));
10890 PL_in_my_stash = NULL;
10894 #pragma segment Main
10898 S_swallow_bom(pTHX_ U8 *s)
10901 const STRLEN slen = SvCUR(PL_linestr);
10903 PERL_ARGS_ASSERT_SWALLOW_BOM;
10907 if (s[1] == 0xFE) {
10908 /* UTF-16 little-endian? (or UTF-32LE?) */
10909 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
10910 /* diag_listed_as: Unsupported script encoding %s */
10911 Perl_croak(aTHX_ "Unsupported script encoding UTF-32LE");
10912 #ifndef PERL_NO_UTF16_FILTER
10913 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (BOM)\n");
10915 if (PL_bufend > (char*)s) {
10916 s = add_utf16_textfilter(s, TRUE);
10919 /* diag_listed_as: Unsupported script encoding %s */
10920 Perl_croak(aTHX_ "Unsupported script encoding UTF-16LE");
10925 if (s[1] == 0xFF) { /* UTF-16 big-endian? */
10926 #ifndef PERL_NO_UTF16_FILTER
10927 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (BOM)\n");
10929 if (PL_bufend > (char *)s) {
10930 s = add_utf16_textfilter(s, FALSE);
10933 /* diag_listed_as: Unsupported script encoding %s */
10934 Perl_croak(aTHX_ "Unsupported script encoding UTF-16BE");
10939 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
10940 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
10941 s += 3; /* UTF-8 */
10947 if (s[2] == 0xFE && s[3] == 0xFF) {
10948 /* UTF-32 big-endian */
10949 /* diag_listed_as: Unsupported script encoding %s */
10950 Perl_croak(aTHX_ "Unsupported script encoding UTF-32BE");
10953 else if (s[2] == 0 && s[3] != 0) {
10956 * are a good indicator of UTF-16BE. */
10957 #ifndef PERL_NO_UTF16_FILTER
10958 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (no BOM)\n");
10959 s = add_utf16_textfilter(s, FALSE);
10961 /* diag_listed_as: Unsupported script encoding %s */
10962 Perl_croak(aTHX_ "Unsupported script encoding UTF-16BE");
10968 if (slen > 3 && s[1] == 0x73 && s[2] == 0x66 && s[3] == 0x73) {
10969 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
10970 s += 4; /* UTF-8 */
10976 if (slen > 3 && s[1] == 0 && s[2] != 0 && s[3] == 0) {
10979 * are a good indicator of UTF-16LE. */
10980 #ifndef PERL_NO_UTF16_FILTER
10981 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (no BOM)\n");
10982 s = add_utf16_textfilter(s, TRUE);
10984 /* diag_listed_as: Unsupported script encoding %s */
10985 Perl_croak(aTHX_ "Unsupported script encoding UTF-16LE");
10993 #ifndef PERL_NO_UTF16_FILTER
10995 S_utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
10998 SV *const filter = FILTER_DATA(idx);
10999 /* We re-use this each time round, throwing the contents away before we
11001 SV *const utf16_buffer = MUTABLE_SV(IoTOP_GV(filter));
11002 SV *const utf8_buffer = filter;
11003 IV status = IoPAGE(filter);
11004 const bool reverse = cBOOL(IoLINES(filter));
11007 PERL_ARGS_ASSERT_UTF16_TEXTFILTER;
11009 /* As we're automatically added, at the lowest level, and hence only called
11010 from this file, we can be sure that we're not called in block mode. Hence
11011 don't bother writing code to deal with block mode. */
11013 Perl_croak(aTHX_ "panic: utf16_textfilter called in block mode (for %d characters)", maxlen);
11016 Perl_croak(aTHX_ "panic: utf16_textfilter called after error (status=%"IVdf")", status);
11018 DEBUG_P(PerlIO_printf(Perl_debug_log,
11019 "utf16_textfilter(%p,%ce): idx=%d maxlen=%d status=%"IVdf" utf16=%"UVuf" utf8=%"UVuf"\n",
11020 FPTR2DPTR(void *, S_utf16_textfilter),
11021 reverse ? 'l' : 'b', idx, maxlen, status,
11022 (UV)SvCUR(utf16_buffer), (UV)SvCUR(utf8_buffer)));
11029 /* First, look in our buffer of existing UTF-8 data: */
11030 char *nl = (char *)memchr(SvPVX(utf8_buffer), '\n', SvCUR(utf8_buffer));
11034 } else if (status == 0) {
11036 IoPAGE(filter) = 0;
11037 nl = SvEND(utf8_buffer);
11040 STRLEN got = nl - SvPVX(utf8_buffer);
11041 /* Did we have anything to append? */
11043 sv_catpvn(sv, SvPVX(utf8_buffer), got);
11044 /* Everything else in this code works just fine if SVp_POK isn't
11045 set. This, however, needs it, and we need it to work, else
11046 we loop infinitely because the buffer is never consumed. */
11047 sv_chop(utf8_buffer, nl);
11051 /* OK, not a complete line there, so need to read some more UTF-16.
11052 Read an extra octect if the buffer currently has an odd number. */
11056 if (SvCUR(utf16_buffer) >= 2) {
11057 /* Location of the high octet of the last complete code point.
11058 Gosh, UTF-16 is a pain. All the benefits of variable length,
11059 *coupled* with all the benefits of partial reads and
11061 const U8 *const last_hi = (U8*)SvPVX(utf16_buffer)
11062 + ((SvCUR(utf16_buffer) & ~1) - (reverse ? 1 : 2));
11064 if (*last_hi < 0xd8 || *last_hi > 0xdb) {
11068 /* We have the first half of a surrogate. Read more. */
11069 DEBUG_P(PerlIO_printf(Perl_debug_log, "utf16_textfilter partial surrogate detected at %p\n", last_hi));
11072 status = FILTER_READ(idx + 1, utf16_buffer,
11073 160 + (SvCUR(utf16_buffer) & 1));
11074 DEBUG_P(PerlIO_printf(Perl_debug_log, "utf16_textfilter status=%"IVdf" SvCUR(sv)=%"UVuf"\n", status, (UV)SvCUR(utf16_buffer)));
11075 DEBUG_P({ sv_dump(utf16_buffer); sv_dump(utf8_buffer);});
11078 IoPAGE(filter) = status;
11083 chars = SvCUR(utf16_buffer) >> 1;
11084 have = SvCUR(utf8_buffer);
11085 SvGROW(utf8_buffer, have + chars * 3 + 1);
11088 end = utf16_to_utf8_reversed((U8*)SvPVX(utf16_buffer),
11089 (U8*)SvPVX_const(utf8_buffer) + have,
11090 chars * 2, &newlen);
11092 end = utf16_to_utf8((U8*)SvPVX(utf16_buffer),
11093 (U8*)SvPVX_const(utf8_buffer) + have,
11094 chars * 2, &newlen);
11096 SvCUR_set(utf8_buffer, have + newlen);
11099 /* No need to keep this SV "well-formed" with a '\0' after the end, as
11100 it's private to us, and utf16_to_utf8{,reversed} take a
11101 (pointer,length) pair, rather than a NUL-terminated string. */
11102 if(SvCUR(utf16_buffer) & 1) {
11103 *SvPVX(utf16_buffer) = SvEND(utf16_buffer)[-1];
11104 SvCUR_set(utf16_buffer, 1);
11106 SvCUR_set(utf16_buffer, 0);
11109 DEBUG_P(PerlIO_printf(Perl_debug_log,
11110 "utf16_textfilter: returns, status=%"IVdf" utf16=%"UVuf" utf8=%"UVuf"\n",
11112 (UV)SvCUR(utf16_buffer), (UV)SvCUR(utf8_buffer)));
11113 DEBUG_P({ sv_dump(utf8_buffer); sv_dump(sv);});
11118 S_add_utf16_textfilter(pTHX_ U8 *const s, bool reversed)
11120 SV *filter = filter_add(S_utf16_textfilter, NULL);
11122 PERL_ARGS_ASSERT_ADD_UTF16_TEXTFILTER;
11124 IoTOP_GV(filter) = MUTABLE_GV(newSVpvn((char *)s, PL_bufend - (char*)s));
11125 sv_setpvs(filter, "");
11126 IoLINES(filter) = reversed;
11127 IoPAGE(filter) = 1; /* Not EOF */
11129 /* Sadly, we have to return a valid pointer, come what may, so we have to
11130 ignore any error return from this. */
11131 SvCUR_set(PL_linestr, 0);
11132 if (FILTER_READ(0, PL_linestr, 0)) {
11133 SvUTF8_on(PL_linestr);
11135 SvUTF8_on(PL_linestr);
11137 PL_bufend = SvEND(PL_linestr);
11138 return (U8*)SvPVX(PL_linestr);
11143 Returns a pointer to the next character after the parsed
11144 vstring, as well as updating the passed in sv.
11146 Function must be called like
11149 s = scan_vstring(s,e,sv);
11151 where s and e are the start and end of the string.
11152 The sv should already be large enough to store the vstring
11153 passed in, for performance reasons.
11158 Perl_scan_vstring(pTHX_ const char *s, const char *const e, SV *sv)
11161 const char *pos = s;
11162 const char *start = s;
11164 PERL_ARGS_ASSERT_SCAN_VSTRING;
11166 if (*pos == 'v') pos++; /* get past 'v' */
11167 while (pos < e && (isDIGIT(*pos) || *pos == '_'))
11169 if ( *pos != '.') {
11170 /* this may not be a v-string if followed by => */
11171 const char *next = pos;
11172 while (next < e && isSPACE(*next))
11174 if ((e - next) >= 2 && *next == '=' && next[1] == '>' ) {
11175 /* return string not v-string */
11176 sv_setpvn(sv,(char *)s,pos-s);
11177 return (char *)pos;
11181 if (!isALPHA(*pos)) {
11182 U8 tmpbuf[UTF8_MAXBYTES+1];
11185 s++; /* get past 'v' */
11190 /* this is atoi() that tolerates underscores */
11193 const char *end = pos;
11195 while (--end >= s) {
11197 const UV orev = rev;
11198 rev += (*end - '0') * mult;
11201 /* diag_listed_as: Integer overflow in %s number */
11202 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
11203 "Integer overflow in decimal number");
11207 if (rev > 0x7FFFFFFF)
11208 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
11210 /* Append native character for the rev point */
11211 tmpend = uvchr_to_utf8(tmpbuf, rev);
11212 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
11213 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
11215 if (pos + 1 < e && *pos == '.' && isDIGIT(pos[1]))
11221 while (pos < e && (isDIGIT(*pos) || *pos == '_'))
11225 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);
11232 Perl_keyword_plugin_standard(pTHX_
11233 char *keyword_ptr, STRLEN keyword_len, OP **op_ptr)
11235 PERL_ARGS_ASSERT_KEYWORD_PLUGIN_STANDARD;
11236 PERL_UNUSED_CONTEXT;
11237 PERL_UNUSED_ARG(keyword_ptr);
11238 PERL_UNUSED_ARG(keyword_len);
11239 PERL_UNUSED_ARG(op_ptr);
11240 return KEYWORD_PLUGIN_DECLINE;
11243 #define parse_recdescent(g,p) S_parse_recdescent(aTHX_ g,p)
11245 S_parse_recdescent(pTHX_ int gramtype, I32 fakeeof)
11247 SAVEI32(PL_lex_brackets);
11248 if (PL_lex_brackets > 100)
11249 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
11250 PL_lex_brackstack[PL_lex_brackets++] = XFAKEEOF;
11251 SAVEI32(PL_lex_allbrackets);
11252 PL_lex_allbrackets = 0;
11253 SAVEI8(PL_lex_fakeeof);
11254 PL_lex_fakeeof = (U8)fakeeof;
11255 if(yyparse(gramtype) && !PL_parser->error_count)
11256 qerror(Perl_mess(aTHX_ "Parse error"));
11259 #define parse_recdescent_for_op(g,p) S_parse_recdescent_for_op(aTHX_ g,p)
11261 S_parse_recdescent_for_op(pTHX_ int gramtype, I32 fakeeof)
11265 SAVEVPTR(PL_eval_root);
11266 PL_eval_root = NULL;
11267 parse_recdescent(gramtype, fakeeof);
11273 #define parse_expr(p,f) S_parse_expr(aTHX_ p,f)
11275 S_parse_expr(pTHX_ I32 fakeeof, U32 flags)
11278 if (flags & ~PARSE_OPTIONAL)
11279 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_expr");
11280 exprop = parse_recdescent_for_op(GRAMEXPR, fakeeof);
11281 if (!exprop && !(flags & PARSE_OPTIONAL)) {
11282 if (!PL_parser->error_count)
11283 qerror(Perl_mess(aTHX_ "Parse error"));
11284 exprop = newOP(OP_NULL, 0);
11290 =for apidoc Amx|OP *|parse_arithexpr|U32 flags
11292 Parse a Perl arithmetic expression. This may contain operators of precedence
11293 down to the bit shift operators. The expression must be followed (and thus
11294 terminated) either by a comparison or lower-precedence operator or by
11295 something that would normally terminate an expression such as semicolon.
11296 If I<flags> includes C<PARSE_OPTIONAL> then the expression is optional,
11297 otherwise it is mandatory. It is up to the caller to ensure that the
11298 dynamic parser state (L</PL_parser> et al) is correctly set to reflect
11299 the source of the code to be parsed and the lexical context for the
11302 The op tree representing the expression is returned. If an optional
11303 expression is absent, a null pointer is returned, otherwise the pointer
11306 If an error occurs in parsing or compilation, in most cases a valid op
11307 tree is returned anyway. The error is reflected in the parser state,
11308 normally resulting in a single exception at the top level of parsing
11309 which covers all the compilation errors that occurred. Some compilation
11310 errors, however, will throw an exception immediately.
11316 Perl_parse_arithexpr(pTHX_ U32 flags)
11318 return parse_expr(LEX_FAKEEOF_COMPARE, flags);
11322 =for apidoc Amx|OP *|parse_termexpr|U32 flags
11324 Parse a Perl term expression. This may contain operators of precedence
11325 down to the assignment operators. The expression must be followed (and thus
11326 terminated) either by a comma or lower-precedence operator or by
11327 something that would normally terminate an expression such as semicolon.
11328 If I<flags> includes C<PARSE_OPTIONAL> then the expression is optional,
11329 otherwise it is mandatory. It is up to the caller to ensure that the
11330 dynamic parser state (L</PL_parser> et al) is correctly set to reflect
11331 the source of the code to be parsed and the lexical context for the
11334 The op tree representing the expression is returned. If an optional
11335 expression is absent, a null pointer is returned, otherwise the pointer
11338 If an error occurs in parsing or compilation, in most cases a valid op
11339 tree is returned anyway. The error is reflected in the parser state,
11340 normally resulting in a single exception at the top level of parsing
11341 which covers all the compilation errors that occurred. Some compilation
11342 errors, however, will throw an exception immediately.
11348 Perl_parse_termexpr(pTHX_ U32 flags)
11350 return parse_expr(LEX_FAKEEOF_COMMA, flags);
11354 =for apidoc Amx|OP *|parse_listexpr|U32 flags
11356 Parse a Perl list expression. This may contain operators of precedence
11357 down to the comma operator. The expression must be followed (and thus
11358 terminated) either by a low-precedence logic operator such as C<or> or by
11359 something that would normally terminate an expression such as semicolon.
11360 If I<flags> includes C<PARSE_OPTIONAL> then the expression is optional,
11361 otherwise it is mandatory. It is up to the caller to ensure that the
11362 dynamic parser state (L</PL_parser> et al) is correctly set to reflect
11363 the source of the code to be parsed and the lexical context for the
11366 The op tree representing the expression is returned. If an optional
11367 expression is absent, a null pointer is returned, otherwise the pointer
11370 If an error occurs in parsing or compilation, in most cases a valid op
11371 tree is returned anyway. The error is reflected in the parser state,
11372 normally resulting in a single exception at the top level of parsing
11373 which covers all the compilation errors that occurred. Some compilation
11374 errors, however, will throw an exception immediately.
11380 Perl_parse_listexpr(pTHX_ U32 flags)
11382 return parse_expr(LEX_FAKEEOF_LOWLOGIC, flags);
11386 =for apidoc Amx|OP *|parse_fullexpr|U32 flags
11388 Parse a single complete Perl expression. This allows the full
11389 expression grammar, including the lowest-precedence operators such
11390 as C<or>. The expression must be followed (and thus terminated) by a
11391 token that an expression would normally be terminated by: end-of-file,
11392 closing bracketing punctuation, semicolon, or one of the keywords that
11393 signals a postfix expression-statement modifier. If I<flags> includes
11394 C<PARSE_OPTIONAL> then the expression is optional, otherwise it is
11395 mandatory. It is up to the caller to ensure that the dynamic parser
11396 state (L</PL_parser> et al) is correctly set to reflect the source of
11397 the code to be parsed and the lexical context for the expression.
11399 The op tree representing the expression is returned. If an optional
11400 expression is absent, a null pointer is returned, otherwise the pointer
11403 If an error occurs in parsing or compilation, in most cases a valid op
11404 tree is returned anyway. The error is reflected in the parser state,
11405 normally resulting in a single exception at the top level of parsing
11406 which covers all the compilation errors that occurred. Some compilation
11407 errors, however, will throw an exception immediately.
11413 Perl_parse_fullexpr(pTHX_ U32 flags)
11415 return parse_expr(LEX_FAKEEOF_NONEXPR, flags);
11419 =for apidoc Amx|OP *|parse_block|U32 flags
11421 Parse a single complete Perl code block. This consists of an opening
11422 brace, a sequence of statements, and a closing brace. The block
11423 constitutes a lexical scope, so C<my> variables and various compile-time
11424 effects can be contained within it. It is up to the caller to ensure
11425 that the dynamic parser state (L</PL_parser> et al) is correctly set to
11426 reflect the source of the code to be parsed and the lexical context for
11429 The op tree representing the code block is returned. This is always a
11430 real op, never a null pointer. It will normally be a C<lineseq> list,
11431 including C<nextstate> or equivalent ops. No ops to construct any kind
11432 of runtime scope are included by virtue of it being a block.
11434 If an error occurs in parsing or compilation, in most cases a valid op
11435 tree (most likely null) is returned anyway. The error is reflected in
11436 the parser state, normally resulting in a single exception at the top
11437 level of parsing which covers all the compilation errors that occurred.
11438 Some compilation errors, however, will throw an exception immediately.
11440 The I<flags> parameter is reserved for future use, and must always
11447 Perl_parse_block(pTHX_ U32 flags)
11450 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_block");
11451 return parse_recdescent_for_op(GRAMBLOCK, LEX_FAKEEOF_NEVER);
11455 =for apidoc Amx|OP *|parse_barestmt|U32 flags
11457 Parse a single unadorned Perl statement. This may be a normal imperative
11458 statement or a declaration that has compile-time effect. It does not
11459 include any label or other affixture. It is up to the caller to ensure
11460 that the dynamic parser state (L</PL_parser> et al) is correctly set to
11461 reflect the source of the code to be parsed and the lexical context for
11464 The op tree representing the statement is returned. This may be a
11465 null pointer if the statement is null, for example if it was actually
11466 a subroutine definition (which has compile-time side effects). If not
11467 null, it will be ops directly implementing the statement, suitable to
11468 pass to L</newSTATEOP>. It will not normally include a C<nextstate> or
11469 equivalent op (except for those embedded in a scope contained entirely
11470 within the statement).
11472 If an error occurs in parsing or compilation, in most cases a valid op
11473 tree (most likely null) is returned anyway. The error is reflected in
11474 the parser state, normally resulting in a single exception at the top
11475 level of parsing which covers all the compilation errors that occurred.
11476 Some compilation errors, however, will throw an exception immediately.
11478 The I<flags> parameter is reserved for future use, and must always
11485 Perl_parse_barestmt(pTHX_ U32 flags)
11488 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_barestmt");
11489 return parse_recdescent_for_op(GRAMBARESTMT, LEX_FAKEEOF_NEVER);
11493 =for apidoc Amx|SV *|parse_label|U32 flags
11495 Parse a single label, possibly optional, of the type that may prefix a
11496 Perl statement. It is up to the caller to ensure that the dynamic parser
11497 state (L</PL_parser> et al) is correctly set to reflect the source of
11498 the code to be parsed. If I<flags> includes C<PARSE_OPTIONAL> then the
11499 label is optional, otherwise it is mandatory.
11501 The name of the label is returned in the form of a fresh scalar. If an
11502 optional label is absent, a null pointer is returned.
11504 If an error occurs in parsing, which can only occur if the label is
11505 mandatory, a valid label is returned anyway. The error is reflected in
11506 the parser state, normally resulting in a single exception at the top
11507 level of parsing which covers all the compilation errors that occurred.
11513 Perl_parse_label(pTHX_ U32 flags)
11515 if (flags & ~PARSE_OPTIONAL)
11516 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_label");
11517 if (PL_lex_state == LEX_KNOWNEXT) {
11518 PL_parser->yychar = yylex();
11519 if (PL_parser->yychar == LABEL) {
11521 PL_parser->yychar = YYEMPTY;
11522 lsv = newSV_type(SVt_PV);
11523 sv_copypv(lsv, cSVOPx(pl_yylval.opval)->op_sv);
11531 STRLEN wlen, bufptr_pos;
11534 if (!isIDFIRST_lazy_if(s, UTF))
11536 t = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &wlen);
11537 if (word_takes_any_delimeter(s, wlen))
11539 bufptr_pos = s - SvPVX(PL_linestr);
11541 lex_read_space(LEX_KEEP_PREVIOUS);
11543 s = SvPVX(PL_linestr) + bufptr_pos;
11544 if (t[0] == ':' && t[1] != ':') {
11545 PL_oldoldbufptr = PL_oldbufptr;
11548 return newSVpvn_flags(s, wlen, UTF ? SVf_UTF8 : 0);
11552 if (flags & PARSE_OPTIONAL) {
11555 qerror(Perl_mess(aTHX_ "Parse error"));
11556 return newSVpvs("x");
11563 =for apidoc Amx|OP *|parse_fullstmt|U32 flags
11565 Parse a single complete Perl statement. This may be a normal imperative
11566 statement or a declaration that has compile-time effect, and may include
11567 optional labels. It is up to the caller to ensure that the dynamic
11568 parser state (L</PL_parser> et al) is correctly set to reflect the source
11569 of the code to be parsed and the lexical context for the statement.
11571 The op tree representing the statement is returned. This may be a
11572 null pointer if the statement is null, for example if it was actually
11573 a subroutine definition (which has compile-time side effects). If not
11574 null, it will be the result of a L</newSTATEOP> call, normally including
11575 a C<nextstate> or equivalent op.
11577 If an error occurs in parsing or compilation, in most cases a valid op
11578 tree (most likely null) is returned anyway. The error is reflected in
11579 the parser state, normally resulting in a single exception at the top
11580 level of parsing which covers all the compilation errors that occurred.
11581 Some compilation errors, however, will throw an exception immediately.
11583 The I<flags> parameter is reserved for future use, and must always
11590 Perl_parse_fullstmt(pTHX_ U32 flags)
11593 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_fullstmt");
11594 return parse_recdescent_for_op(GRAMFULLSTMT, LEX_FAKEEOF_NEVER);
11598 =for apidoc Amx|OP *|parse_stmtseq|U32 flags
11600 Parse a sequence of zero or more Perl statements. These may be normal
11601 imperative statements, including optional labels, or declarations
11602 that have compile-time effect, or any mixture thereof. The statement
11603 sequence ends when a closing brace or end-of-file is encountered in a
11604 place where a new statement could have validly started. It is up to
11605 the caller to ensure that the dynamic parser state (L</PL_parser> et al)
11606 is correctly set to reflect the source of the code to be parsed and the
11607 lexical context for the statements.
11609 The op tree representing the statement sequence is returned. This may
11610 be a null pointer if the statements were all null, for example if there
11611 were no statements or if there were only subroutine definitions (which
11612 have compile-time side effects). If not null, it will be a C<lineseq>
11613 list, normally including C<nextstate> or equivalent ops.
11615 If an error occurs in parsing or compilation, in most cases a valid op
11616 tree is returned anyway. The error is reflected in the parser state,
11617 normally resulting in a single exception at the top level of parsing
11618 which covers all the compilation errors that occurred. Some compilation
11619 errors, however, will throw an exception immediately.
11621 The I<flags> parameter is reserved for future use, and must always
11628 Perl_parse_stmtseq(pTHX_ U32 flags)
11633 Perl_croak(aTHX_ "Parsing code internal error (%s)", "parse_stmtseq");
11634 stmtseqop = parse_recdescent_for_op(GRAMSTMTSEQ, LEX_FAKEEOF_CLOSING);
11635 c = lex_peek_unichar(0);
11636 if (c != -1 && c != /*{*/'}')
11637 qerror(Perl_mess(aTHX_ "Parse error"));
11643 * c-indentation-style: bsd
11644 * c-basic-offset: 4
11645 * indent-tabs-mode: nil
11648 * ex: set ts=8 sts=4 sw=4 et: