3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 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
16 * This file is the lexer for Perl. It's closely linked to the
19 * The main routine is yylex(), which returns the next token.
23 #define PERL_IN_TOKE_C
26 #define yychar (*PL_yycharp)
27 #define yylval (*PL_yylvalp)
29 static char ident_too_long[] = "Identifier too long";
30 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
31 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
33 static void restore_rsfp(pTHX_ void *f);
34 #ifndef PERL_NO_UTF16_FILTER
35 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
39 #define XFAKEBRACK 128
42 #ifdef USE_UTF8_SCRIPTS
43 # define UTF (!IN_BYTES)
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
48 /* In variables named $^X, these are the legal values for X.
49 * 1999-02-27 mjd-perl-patch@plover.com */
50 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
52 /* On MacOS, respect nonbreaking spaces */
53 #ifdef MACOS_TRADITIONAL
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
56 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
59 /* LEX_* are values for PL_lex_state, the state of the lexer.
60 * They are arranged oddly so that the guard on the switch statement
61 * can get by with a single comparison (if the compiler is smart enough).
64 /* #define LEX_NOTPARSING 11 is done in perl.h. */
67 #define LEX_INTERPNORMAL 9
68 #define LEX_INTERPCASEMOD 8
69 #define LEX_INTERPPUSH 7
70 #define LEX_INTERPSTART 6
71 #define LEX_INTERPEND 5
72 #define LEX_INTERPENDMAYBE 4
73 #define LEX_INTERPCONCAT 3
74 #define LEX_INTERPCONST 2
75 #define LEX_FORMLINE 1
76 #define LEX_KNOWNEXT 0
79 static char* lex_state_names[] = {
100 /* CLINE is a macro that ensures PL_copline has a sane value */
105 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
108 * Convenience functions to return different tokens and prime the
109 * lexer for the next token. They all take an argument.
111 * TOKEN : generic token (used for '(', DOLSHARP, etc)
112 * OPERATOR : generic operator
113 * AOPERATOR : assignment operator
114 * PREBLOCK : beginning the block after an if, while, foreach, ...
115 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
116 * PREREF : *EXPR where EXPR is not a simple identifier
117 * TERM : expression term
118 * LOOPX : loop exiting command (goto, last, dump, etc)
119 * FTST : file test operator
120 * FUN0 : zero-argument function
121 * FUN1 : not used, except for not, which isn't a UNIOP
122 * BOop : bitwise or or xor
124 * SHop : shift operator
125 * PWop : power operator
126 * PMop : pattern-matching operator
127 * Aop : addition-level operator
128 * Mop : multiplication-level operator
129 * Eop : equality-testing operator
130 * Rop : relational operator <= != gt
132 * Also see LOP and lop() below.
135 #ifdef DEBUGGING /* Serve -DT. */
136 # define REPORT(retval) tokereport(s,(int)retval)
138 # define REPORT(retval) (retval)
141 #define TOKEN(retval) return ( PL_bufptr = s, REPORT(retval))
142 #define OPERATOR(retval) return (PL_expect = XTERM, PL_bufptr = s, REPORT(retval))
143 #define AOPERATOR(retval) return ao((PL_expect = XTERM, PL_bufptr = s, REPORT(retval)))
144 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s, REPORT(retval))
145 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s, REPORT(retval))
146 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s, REPORT(retval))
147 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR, PL_bufptr = s, REPORT(retval))
148 #define LOOPX(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)LOOPEX))
149 #define FTST(f) return (yylval.ival=f, PL_expect=XTERMORDORDOR, PL_bufptr=s, REPORT((int)UNIOP))
150 #define FUN0(f) return (yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC0))
151 #define FUN1(f) return (yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC1))
152 #define BOop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITOROP)))
153 #define BAop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITANDOP)))
154 #define SHop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)SHIFTOP)))
155 #define PWop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)POWOP)))
156 #define PMop(f) return(yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MATCHOP))
157 #define Aop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)ADDOP)))
158 #define Mop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MULOP)))
159 #define Eop(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)EQOP))
160 #define Rop(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)RELOP))
162 /* This bit of chicanery makes a unary function followed by
163 * a parenthesis into a function with one argument, highest precedence.
164 * The UNIDOR macro is for unary functions that can be followed by the //
165 * operator (such as C<shift // 0>).
167 #define UNI2(f,x) return ( \
171 PL_last_uni = PL_oldbufptr, \
172 PL_last_lop_op = f, \
174 (*s == '(' || (s = skipspace(s), *s == '(') \
175 ? (int)FUNC1 : (int)UNIOP)))
176 #define UNI(f) UNI2(f,XTERM)
177 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
179 #define UNIBRACK(f) return ( \
182 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') \
185 ? (int)FUNC1 : (int)UNIOP)))
187 /* grandfather return to old style */
188 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 /* how to interpret the yylval associated with the token */
196 TOKENTYPE_OPNUM, /* yylval.ival contains an opcode number */
202 static struct debug_tokens { int token, type; char *name;} debug_tokens[] =
204 { ADDOP, TOKENTYPE_OPNUM, "ADDOP" },
205 { ANDAND, TOKENTYPE_NONE, "ANDAND" },
206 { ANDOP, TOKENTYPE_NONE, "ANDOP" },
207 { ANONSUB, TOKENTYPE_IVAL, "ANONSUB" },
208 { ARROW, TOKENTYPE_NONE, "ARROW" },
209 { ASSIGNOP, TOKENTYPE_OPNUM, "ASSIGNOP" },
210 { BITANDOP, TOKENTYPE_OPNUM, "BITANDOP" },
211 { BITOROP, TOKENTYPE_OPNUM, "BITOROP" },
212 { COLONATTR, TOKENTYPE_NONE, "COLONATTR" },
213 { CONTINUE, TOKENTYPE_NONE, "CONTINUE" },
214 { DO, TOKENTYPE_NONE, "DO" },
215 { DOLSHARP, TOKENTYPE_NONE, "DOLSHARP" },
216 { DORDOR, TOKENTYPE_NONE, "DORDOR" },
217 { DOROP, TOKENTYPE_OPNUM, "DOROP" },
218 { DOTDOT, TOKENTYPE_IVAL, "DOTDOT" },
219 { ELSE, TOKENTYPE_NONE, "ELSE" },
220 { ELSIF, TOKENTYPE_IVAL, "ELSIF" },
221 { EQOP, TOKENTYPE_OPNUM, "EQOP" },
222 { FOR, TOKENTYPE_IVAL, "FOR" },
223 { FORMAT, TOKENTYPE_NONE, "FORMAT" },
224 { FUNC, TOKENTYPE_OPNUM, "FUNC" },
225 { FUNC0, TOKENTYPE_OPNUM, "FUNC0" },
226 { FUNC0SUB, TOKENTYPE_OPVAL, "FUNC0SUB" },
227 { FUNC1, TOKENTYPE_OPNUM, "FUNC1" },
228 { FUNCMETH, TOKENTYPE_OPVAL, "FUNCMETH" },
229 { HASHBRACK, TOKENTYPE_NONE, "HASHBRACK" },
230 { IF, TOKENTYPE_IVAL, "IF" },
231 { LABEL, TOKENTYPE_PVAL, "LABEL" },
232 { LOCAL, TOKENTYPE_IVAL, "LOCAL" },
233 { LOOPEX, TOKENTYPE_OPNUM, "LOOPEX" },
234 { LSTOP, TOKENTYPE_OPNUM, "LSTOP" },
235 { LSTOPSUB, TOKENTYPE_OPVAL, "LSTOPSUB" },
236 { MATCHOP, TOKENTYPE_OPNUM, "MATCHOP" },
237 { METHOD, TOKENTYPE_OPVAL, "METHOD" },
238 { MULOP, TOKENTYPE_OPNUM, "MULOP" },
239 { MY, TOKENTYPE_IVAL, "MY" },
240 { MYSUB, TOKENTYPE_NONE, "MYSUB" },
241 { NOAMP, TOKENTYPE_NONE, "NOAMP" },
242 { NOTOP, TOKENTYPE_NONE, "NOTOP" },
243 { OROP, TOKENTYPE_IVAL, "OROP" },
244 { OROR, TOKENTYPE_NONE, "OROR" },
245 { PACKAGE, TOKENTYPE_NONE, "PACKAGE" },
246 { PMFUNC, TOKENTYPE_OPVAL, "PMFUNC" },
247 { POSTDEC, TOKENTYPE_NONE, "POSTDEC" },
248 { POSTINC, TOKENTYPE_NONE, "POSTINC" },
249 { POWOP, TOKENTYPE_OPNUM, "POWOP" },
250 { PREDEC, TOKENTYPE_NONE, "PREDEC" },
251 { PREINC, TOKENTYPE_NONE, "PREINC" },
252 { PRIVATEREF, TOKENTYPE_OPVAL, "PRIVATEREF" },
253 { REFGEN, TOKENTYPE_NONE, "REFGEN" },
254 { RELOP, TOKENTYPE_OPNUM, "RELOP" },
255 { SHIFTOP, TOKENTYPE_OPNUM, "SHIFTOP" },
256 { SUB, TOKENTYPE_NONE, "SUB" },
257 { THING, TOKENTYPE_OPVAL, "THING" },
258 { UMINUS, TOKENTYPE_NONE, "UMINUS" },
259 { UNIOP, TOKENTYPE_OPNUM, "UNIOP" },
260 { UNIOPSUB, TOKENTYPE_OPVAL, "UNIOPSUB" },
261 { UNLESS, TOKENTYPE_IVAL, "UNLESS" },
262 { UNTIL, TOKENTYPE_IVAL, "UNTIL" },
263 { USE, TOKENTYPE_IVAL, "USE" },
264 { WHILE, TOKENTYPE_IVAL, "WHILE" },
265 { WORD, TOKENTYPE_OPVAL, "WORD" },
266 { 0, TOKENTYPE_NONE, 0 }
269 /* dump the returned token in rv, plus any optional arg in yylval */
272 S_tokereport(pTHX_ char* s, I32 rv)
276 enum token_type type = TOKENTYPE_NONE;
277 struct debug_tokens *p;
278 SV* report = NEWSV(0, 60);
280 Perl_sv_catpvf(aTHX_ report, "<== ");
282 for (p = debug_tokens; p->token; p++) {
283 if (p->token == (int)rv) {
290 Perl_sv_catpvf(aTHX_ report, "%s", name);
291 else if ((char)rv > ' ' && (char)rv < '~')
292 Perl_sv_catpvf(aTHX_ report, "'%c'", (char)rv);
294 Perl_sv_catpvf(aTHX_ report, "EOF");
296 Perl_sv_catpvf(aTHX_ report, "?? %"IVdf, (IV)rv);
299 case TOKENTYPE_GVVAL: /* doesn't appear to be used */
302 Perl_sv_catpvf(aTHX_ report, "(ival=%"IVdf")", yylval.ival);
304 case TOKENTYPE_OPNUM:
305 Perl_sv_catpvf(aTHX_ report, "(ival=op_%s)",
306 PL_op_name[yylval.ival]);
309 Perl_sv_catpvf(aTHX_ report, "(pval=\"%s\")", yylval.pval);
311 case TOKENTYPE_OPVAL:
313 Perl_sv_catpvf(aTHX_ report, "(opval=op_%s)",
314 PL_op_name[yylval.opval->op_type]);
316 Perl_sv_catpv(aTHX_ report, "(opval=null)");
319 Perl_sv_catpvf(aTHX_ report, " at line %d [", CopLINE(PL_curcop));
320 if (s - PL_bufptr > 0)
321 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
323 if (PL_oldbufptr && *PL_oldbufptr)
324 sv_catpv(report, PL_tokenbuf);
326 PerlIO_printf(Perl_debug_log, "### %s]\n", SvPV_nolen(report));
336 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
337 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
341 S_ao(pTHX_ int toketype)
343 if (*PL_bufptr == '=') {
345 if (toketype == ANDAND)
346 yylval.ival = OP_ANDASSIGN;
347 else if (toketype == OROR)
348 yylval.ival = OP_ORASSIGN;
349 else if (toketype == DORDOR)
350 yylval.ival = OP_DORASSIGN;
358 * When Perl expects an operator and finds something else, no_op
359 * prints the warning. It always prints "<something> found where
360 * operator expected. It prints "Missing semicolon on previous line?"
361 * if the surprise occurs at the start of the line. "do you need to
362 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
363 * where the compiler doesn't know if foo is a method call or a function.
364 * It prints "Missing operator before end of line" if there's nothing
365 * after the missing operator, or "... before <...>" if there is something
366 * after the missing operator.
370 S_no_op(pTHX_ char *what, char *s)
372 char *oldbp = PL_bufptr;
373 bool is_first = (PL_oldbufptr == PL_linestart);
379 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
380 if (ckWARN_d(WARN_SYNTAX)) {
382 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
383 "\t(Missing semicolon on previous line?)\n");
384 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
386 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
387 if (t < PL_bufptr && isSPACE(*t))
388 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
389 "\t(Do you need to predeclare %.*s?)\n",
390 t - PL_oldoldbufptr, PL_oldoldbufptr);
394 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
395 "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
403 * Complain about missing quote/regexp/heredoc terminator.
404 * If it's called with (char *)NULL then it cauterizes the line buffer.
405 * If we're in a delimited string and the delimiter is a control
406 * character, it's reformatted into a two-char sequence like ^C.
411 S_missingterm(pTHX_ char *s)
416 char *nl = strrchr(s,'\n');
422 iscntrl(PL_multi_close)
424 PL_multi_close < 32 || PL_multi_close == 127
428 tmpbuf[1] = toCTRL(PL_multi_close);
434 *tmpbuf = (char)PL_multi_close;
438 q = strchr(s,'"') ? '\'' : '"';
439 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
447 Perl_deprecate(pTHX_ char *s)
449 if (ckWARN(WARN_DEPRECATED))
450 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
454 Perl_deprecate_old(pTHX_ char *s)
456 /* This function should NOT be called for any new deprecated warnings */
457 /* Use Perl_deprecate instead */
459 /* It is here to maintain backward compatibility with the pre-5.8 */
460 /* warnings category hierarchy. The "deprecated" category used to */
461 /* live under the "syntax" category. It is now a top-level category */
462 /* in its own right. */
464 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
465 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
466 "Use of %s is deprecated", s);
471 * Deprecate a comma-less variable list.
477 deprecate_old("comma-less variable list");
481 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
482 * utf16-to-utf8-reversed.
485 #ifdef PERL_CR_FILTER
489 register char *s = SvPVX(sv);
490 register char *e = s + SvCUR(sv);
491 /* outer loop optimized to do nothing if there are no CR-LFs */
493 if (*s++ == '\r' && *s == '\n') {
494 /* hit a CR-LF, need to copy the rest */
495 register char *d = s - 1;
498 if (*s == '\r' && s[1] == '\n')
509 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
511 I32 count = FILTER_READ(idx+1, sv, maxlen);
512 if (count > 0 && !maxlen)
520 * Initialize variables. Uses the Perl save_stack to save its state (for
521 * recursive calls to the parser).
525 Perl_lex_start(pTHX_ SV *line)
530 SAVEI32(PL_lex_dojoin);
531 SAVEI32(PL_lex_brackets);
532 SAVEI32(PL_lex_casemods);
533 SAVEI32(PL_lex_starts);
534 SAVEI32(PL_lex_state);
535 SAVEVPTR(PL_lex_inpat);
536 SAVEI32(PL_lex_inwhat);
537 if (PL_lex_state == LEX_KNOWNEXT) {
538 I32 toke = PL_nexttoke;
539 while (--toke >= 0) {
540 SAVEI32(PL_nexttype[toke]);
541 SAVEVPTR(PL_nextval[toke]);
543 SAVEI32(PL_nexttoke);
545 SAVECOPLINE(PL_curcop);
548 SAVEPPTR(PL_oldbufptr);
549 SAVEPPTR(PL_oldoldbufptr);
550 SAVEPPTR(PL_last_lop);
551 SAVEPPTR(PL_last_uni);
552 SAVEPPTR(PL_linestart);
553 SAVESPTR(PL_linestr);
554 SAVEGENERICPV(PL_lex_brackstack);
555 SAVEGENERICPV(PL_lex_casestack);
556 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
557 SAVESPTR(PL_lex_stuff);
558 SAVEI32(PL_lex_defer);
559 SAVEI32(PL_sublex_info.sub_inwhat);
560 SAVESPTR(PL_lex_repl);
562 SAVEINT(PL_lex_expect);
564 PL_lex_state = LEX_NORMAL;
568 New(899, PL_lex_brackstack, 120, char);
569 New(899, PL_lex_casestack, 12, char);
571 *PL_lex_casestack = '\0';
574 PL_lex_stuff = Nullsv;
575 PL_lex_repl = Nullsv;
579 PL_sublex_info.sub_inwhat = 0;
581 if (SvREADONLY(PL_linestr))
582 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
583 s = SvPV(PL_linestr, len);
584 if (!len || s[len-1] != ';') {
585 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
586 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
587 sv_catpvn(PL_linestr, "\n;", 2);
589 SvTEMP_off(PL_linestr);
590 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
591 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
592 PL_last_lop = PL_last_uni = Nullch;
598 * Finalizer for lexing operations. Must be called when the parser is
599 * done with the lexer.
605 PL_doextract = FALSE;
610 * This subroutine has nothing to do with tilting, whether at windmills
611 * or pinball tables. Its name is short for "increment line". It
612 * increments the current line number in CopLINE(PL_curcop) and checks
613 * to see whether the line starts with a comment of the form
614 * # line 500 "foo.pm"
615 * If so, it sets the current line number and file to the values in the comment.
619 S_incline(pTHX_ char *s)
626 CopLINE_inc(PL_curcop);
629 while (SPACE_OR_TAB(*s)) s++;
630 if (strnEQ(s, "line", 4))
634 if (SPACE_OR_TAB(*s))
638 while (SPACE_OR_TAB(*s)) s++;
644 while (SPACE_OR_TAB(*s))
646 if (*s == '"' && (t = strchr(s+1, '"'))) {
651 for (t = s; !isSPACE(*t); t++) ;
654 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
656 if (*e != '\n' && *e != '\0')
657 return; /* false alarm */
662 CopFILE_free(PL_curcop);
663 CopFILE_set(PL_curcop, s);
666 CopLINE_set(PL_curcop, atoi(n)-1);
671 * Called to gobble the appropriate amount and type of whitespace.
672 * Skips comments as well.
676 S_skipspace(pTHX_ register char *s)
678 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
679 while (s < PL_bufend && SPACE_OR_TAB(*s))
685 SSize_t oldprevlen, oldoldprevlen;
686 SSize_t oldloplen = 0, oldunilen = 0;
687 while (s < PL_bufend && isSPACE(*s)) {
688 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
693 if (s < PL_bufend && *s == '#') {
694 while (s < PL_bufend && *s != '\n')
698 if (PL_in_eval && !PL_rsfp) {
705 /* only continue to recharge the buffer if we're at the end
706 * of the buffer, we're not reading from a source filter, and
707 * we're in normal lexing mode
709 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
710 PL_lex_state == LEX_FORMLINE)
713 /* try to recharge the buffer */
714 if ((s = filter_gets(PL_linestr, PL_rsfp,
715 (prevlen = SvCUR(PL_linestr)))) == Nullch)
717 /* end of file. Add on the -p or -n magic */
718 if (PL_minus_n || PL_minus_p) {
719 sv_setpv(PL_linestr,PL_minus_p ?
720 ";}continue{print or die qq(-p destination: $!\\n)" :
722 sv_catpv(PL_linestr,";}");
723 PL_minus_n = PL_minus_p = 0;
726 sv_setpv(PL_linestr,";");
728 /* reset variables for next time we lex */
729 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
731 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
732 PL_last_lop = PL_last_uni = Nullch;
734 /* Close the filehandle. Could be from -P preprocessor,
735 * STDIN, or a regular file. If we were reading code from
736 * STDIN (because the commandline held no -e or filename)
737 * then we don't close it, we reset it so the code can
738 * read from STDIN too.
741 if (PL_preprocess && !PL_in_eval)
742 (void)PerlProc_pclose(PL_rsfp);
743 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
744 PerlIO_clearerr(PL_rsfp);
746 (void)PerlIO_close(PL_rsfp);
751 /* not at end of file, so we only read another line */
752 /* make corresponding updates to old pointers, for yyerror() */
753 oldprevlen = PL_oldbufptr - PL_bufend;
754 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
756 oldunilen = PL_last_uni - PL_bufend;
758 oldloplen = PL_last_lop - PL_bufend;
759 PL_linestart = PL_bufptr = s + prevlen;
760 PL_bufend = s + SvCUR(PL_linestr);
762 PL_oldbufptr = s + oldprevlen;
763 PL_oldoldbufptr = s + oldoldprevlen;
765 PL_last_uni = s + oldunilen;
767 PL_last_lop = s + oldloplen;
770 /* debugger active and we're not compiling the debugger code,
771 * so store the line into the debugger's array of lines
773 if (PERLDB_LINE && PL_curstash != PL_debstash) {
774 SV *sv = NEWSV(85,0);
776 sv_upgrade(sv, SVt_PVMG);
777 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
780 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
787 * Check the unary operators to ensure there's no ambiguity in how they're
788 * used. An ambiguous piece of code would be:
790 * This doesn't mean rand() + 5. Because rand() is a unary operator,
791 * the +5 is its argument.
800 if (PL_oldoldbufptr != PL_last_uni)
802 while (isSPACE(*PL_last_uni))
804 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
805 if ((t = strchr(s, '(')) && t < PL_bufptr)
807 if (ckWARN_d(WARN_AMBIGUOUS)){
810 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
811 "Warning: Use of \"%s\" without parentheses is ambiguous",
818 * LOP : macro to build a list operator. Its behaviour has been replaced
819 * with a subroutine, S_lop() for which LOP is just another name.
822 #define LOP(f,x) return lop(f,x,s)
826 * Build a list operator (or something that might be one). The rules:
827 * - if we have a next token, then it's a list operator [why?]
828 * - if the next thing is an opening paren, then it's a function
829 * - else it's a list operator
833 S_lop(pTHX_ I32 f, int x, char *s)
839 PL_last_lop = PL_oldbufptr;
840 PL_last_lop_op = (OPCODE)f;
842 return REPORT(LSTOP);
849 return REPORT(LSTOP);
854 * When the lexer realizes it knows the next token (for instance,
855 * it is reordering tokens for the parser) then it can call S_force_next
856 * to know what token to return the next time the lexer is called. Caller
857 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
858 * handles the token correctly.
862 S_force_next(pTHX_ I32 type)
864 PL_nexttype[PL_nexttoke] = type;
866 if (PL_lex_state != LEX_KNOWNEXT) {
867 PL_lex_defer = PL_lex_state;
868 PL_lex_expect = PL_expect;
869 PL_lex_state = LEX_KNOWNEXT;
875 * When the lexer knows the next thing is a word (for instance, it has
876 * just seen -> and it knows that the next char is a word char, then
877 * it calls S_force_word to stick the next word into the PL_next lookahead.
880 * char *start : buffer position (must be within PL_linestr)
881 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
882 * int check_keyword : if true, Perl checks to make sure the word isn't
883 * a keyword (do this if the word is a label, e.g. goto FOO)
884 * int allow_pack : if true, : characters will also be allowed (require,
886 * int allow_initial_tick : used by the "sub" lexer only.
890 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
895 start = skipspace(start);
897 if (isIDFIRST_lazy_if(s,UTF) ||
898 (allow_pack && *s == ':') ||
899 (allow_initial_tick && *s == '\'') )
901 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
902 if (check_keyword && keyword(PL_tokenbuf, len))
904 if (token == METHOD) {
909 PL_expect = XOPERATOR;
912 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
913 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
914 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
915 SvUTF8_on(((SVOP*)PL_nextval[PL_nexttoke].opval)->op_sv);
923 * Called when the lexer wants $foo *foo &foo etc, but the program
924 * text only contains the "foo" portion. The first argument is a pointer
925 * to the "foo", and the second argument is the type symbol to prefix.
926 * Forces the next token to be a "WORD".
927 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
931 S_force_ident(pTHX_ register char *s, int kind)
934 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
935 PL_nextval[PL_nexttoke].opval = o;
938 o->op_private = OPpCONST_ENTERED;
939 /* XXX see note in pp_entereval() for why we forgo typo
940 warnings if the symbol must be introduced in an eval.
942 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
943 kind == '$' ? SVt_PV :
944 kind == '@' ? SVt_PVAV :
945 kind == '%' ? SVt_PVHV :
953 Perl_str_to_version(pTHX_ SV *sv)
958 char *start = SvPVx(sv,len);
959 bool utf = SvUTF8(sv) ? TRUE : FALSE;
960 char *end = start + len;
961 while (start < end) {
965 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
970 retval += ((NV)n)/nshift;
979 * Forces the next token to be a version number.
980 * If the next token appears to be an invalid version number, (e.g. "v2b"),
981 * and if "guessing" is TRUE, then no new token is created (and the caller
982 * must use an alternative parsing method).
986 S_force_version(pTHX_ char *s, int guessing)
988 OP *version = Nullop;
997 while (isDIGIT(*d) || *d == '_' || *d == '.')
999 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
1001 s = scan_num(s, &yylval);
1002 version = yylval.opval;
1003 ver = cSVOPx(version)->op_sv;
1004 if (SvPOK(ver) && !SvNIOK(ver)) {
1005 (void)SvUPGRADE(ver, SVt_PVNV);
1006 SvNVX(ver) = str_to_version(ver);
1007 SvNOK_on(ver); /* hint that it is a version */
1014 /* NOTE: The parser sees the package name and the VERSION swapped */
1015 PL_nextval[PL_nexttoke].opval = version;
1023 * Tokenize a quoted string passed in as an SV. It finds the next
1024 * chunk, up to end of string or a backslash. It may make a new
1025 * SV containing that chunk (if HINT_NEW_STRING is on). It also
1030 S_tokeq(pTHX_ SV *sv)
1033 register char *send;
1041 s = SvPV_force(sv, len);
1042 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
1045 while (s < send && *s != '\\')
1050 if ( PL_hints & HINT_NEW_STRING ) {
1051 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
1057 if (s + 1 < send && (s[1] == '\\'))
1058 s++; /* all that, just for this */
1063 SvCUR_set(sv, d - SvPVX(sv));
1065 if ( PL_hints & HINT_NEW_STRING )
1066 return new_constant(NULL, 0, "q", sv, pv, "q");
1071 * Now come three functions related to double-quote context,
1072 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
1073 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
1074 * interact with PL_lex_state, and create fake ( ... ) argument lists
1075 * to handle functions and concatenation.
1076 * They assume that whoever calls them will be setting up a fake
1077 * join call, because each subthing puts a ',' after it. This lets
1080 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
1082 * (I'm not sure whether the spurious commas at the end of lcfirst's
1083 * arguments and join's arguments are created or not).
1088 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
1090 * Pattern matching will set PL_lex_op to the pattern-matching op to
1091 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
1093 * OP_CONST and OP_READLINE are easy--just make the new op and return.
1095 * Everything else becomes a FUNC.
1097 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
1098 * had an OP_CONST or OP_READLINE). This just sets us up for a
1099 * call to S_sublex_push().
1103 S_sublex_start(pTHX)
1105 register I32 op_type = yylval.ival;
1107 if (op_type == OP_NULL) {
1108 yylval.opval = PL_lex_op;
1112 if (op_type == OP_CONST || op_type == OP_READLINE) {
1113 SV *sv = tokeq(PL_lex_stuff);
1115 if (SvTYPE(sv) == SVt_PVIV) {
1116 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1122 nsv = newSVpvn(p, len);
1128 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1129 PL_lex_stuff = Nullsv;
1130 /* Allow <FH> // "foo" */
1131 if (op_type == OP_READLINE)
1132 PL_expect = XTERMORDORDOR;
1136 PL_sublex_info.super_state = PL_lex_state;
1137 PL_sublex_info.sub_inwhat = op_type;
1138 PL_sublex_info.sub_op = PL_lex_op;
1139 PL_lex_state = LEX_INTERPPUSH;
1143 yylval.opval = PL_lex_op;
1153 * Create a new scope to save the lexing state. The scope will be
1154 * ended in S_sublex_done. Returns a '(', starting the function arguments
1155 * to the uc, lc, etc. found before.
1156 * Sets PL_lex_state to LEX_INTERPCONCAT.
1164 PL_lex_state = PL_sublex_info.super_state;
1165 SAVEI32(PL_lex_dojoin);
1166 SAVEI32(PL_lex_brackets);
1167 SAVEI32(PL_lex_casemods);
1168 SAVEI32(PL_lex_starts);
1169 SAVEI32(PL_lex_state);
1170 SAVEVPTR(PL_lex_inpat);
1171 SAVEI32(PL_lex_inwhat);
1172 SAVECOPLINE(PL_curcop);
1173 SAVEPPTR(PL_bufptr);
1174 SAVEPPTR(PL_bufend);
1175 SAVEPPTR(PL_oldbufptr);
1176 SAVEPPTR(PL_oldoldbufptr);
1177 SAVEPPTR(PL_last_lop);
1178 SAVEPPTR(PL_last_uni);
1179 SAVEPPTR(PL_linestart);
1180 SAVESPTR(PL_linestr);
1181 SAVEGENERICPV(PL_lex_brackstack);
1182 SAVEGENERICPV(PL_lex_casestack);
1184 PL_linestr = PL_lex_stuff;
1185 PL_lex_stuff = Nullsv;
1187 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1188 = SvPVX(PL_linestr);
1189 PL_bufend += SvCUR(PL_linestr);
1190 PL_last_lop = PL_last_uni = Nullch;
1191 SAVEFREESV(PL_linestr);
1193 PL_lex_dojoin = FALSE;
1194 PL_lex_brackets = 0;
1195 New(899, PL_lex_brackstack, 120, char);
1196 New(899, PL_lex_casestack, 12, char);
1197 PL_lex_casemods = 0;
1198 *PL_lex_casestack = '\0';
1200 PL_lex_state = LEX_INTERPCONCAT;
1201 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1203 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1204 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1205 PL_lex_inpat = PL_sublex_info.sub_op;
1207 PL_lex_inpat = Nullop;
1214 * Restores lexer state after a S_sublex_push.
1220 if (!PL_lex_starts++) {
1221 SV *sv = newSVpvn("",0);
1222 if (SvUTF8(PL_linestr))
1224 PL_expect = XOPERATOR;
1225 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1229 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1230 PL_lex_state = LEX_INTERPCASEMOD;
1234 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1235 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1236 PL_linestr = PL_lex_repl;
1238 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1239 PL_bufend += SvCUR(PL_linestr);
1240 PL_last_lop = PL_last_uni = Nullch;
1241 SAVEFREESV(PL_linestr);
1242 PL_lex_dojoin = FALSE;
1243 PL_lex_brackets = 0;
1244 PL_lex_casemods = 0;
1245 *PL_lex_casestack = '\0';
1247 if (SvEVALED(PL_lex_repl)) {
1248 PL_lex_state = LEX_INTERPNORMAL;
1250 /* we don't clear PL_lex_repl here, so that we can check later
1251 whether this is an evalled subst; that means we rely on the
1252 logic to ensure sublex_done() is called again only via the
1253 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1256 PL_lex_state = LEX_INTERPCONCAT;
1257 PL_lex_repl = Nullsv;
1263 PL_bufend = SvPVX(PL_linestr);
1264 PL_bufend += SvCUR(PL_linestr);
1265 PL_expect = XOPERATOR;
1266 PL_sublex_info.sub_inwhat = 0;
1274 Extracts a pattern, double-quoted string, or transliteration. This
1277 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1278 processing a pattern (PL_lex_inpat is true), a transliteration
1279 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1281 Returns a pointer to the character scanned up to. Iff this is
1282 advanced from the start pointer supplied (ie if anything was
1283 successfully parsed), will leave an OP for the substring scanned
1284 in yylval. Caller must intuit reason for not parsing further
1285 by looking at the next characters herself.
1289 double-quoted style: \r and \n
1290 regexp special ones: \D \s
1292 backrefs: \1 (deprecated in substitution replacements)
1293 case and quoting: \U \Q \E
1294 stops on @ and $, but not for $ as tail anchor
1296 In transliterations:
1297 characters are VERY literal, except for - not at the start or end
1298 of the string, which indicates a range. scan_const expands the
1299 range to the full set of intermediate characters.
1301 In double-quoted strings:
1303 double-quoted style: \r and \n
1305 backrefs: \1 (deprecated)
1306 case and quoting: \U \Q \E
1309 scan_const does *not* construct ops to handle interpolated strings.
1310 It stops processing as soon as it finds an embedded $ or @ variable
1311 and leaves it to the caller to work out what's going on.
1313 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1315 $ in pattern could be $foo or could be tail anchor. Assumption:
1316 it's a tail anchor if $ is the last thing in the string, or if it's
1317 followed by one of ")| \n\t"
1319 \1 (backreferences) are turned into $1
1321 The structure of the code is
1322 while (there's a character to process) {
1323 handle transliteration ranges
1324 skip regexp comments
1325 skip # initiated comments in //x patterns
1326 check for embedded @foo
1327 check for embedded scalars
1329 leave intact backslashes from leave (below)
1330 deprecate \1 in strings and sub replacements
1331 handle string-changing backslashes \l \U \Q \E, etc.
1332 switch (what was escaped) {
1333 handle - in a transliteration (becomes a literal -)
1334 handle \132 octal characters
1335 handle 0x15 hex characters
1336 handle \cV (control V)
1337 handle printf backslashes (\f, \r, \n, etc)
1339 } (end if backslash)
1340 } (end while character to read)
1345 S_scan_const(pTHX_ char *start)
1347 register char *send = PL_bufend; /* end of the constant */
1348 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1349 register char *s = start; /* start of the constant */
1350 register char *d = SvPVX(sv); /* destination for copies */
1351 bool dorange = FALSE; /* are we in a translit range? */
1352 bool didrange = FALSE; /* did we just finish a range? */
1353 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1354 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1357 const char *leaveit = /* set of acceptably-backslashed characters */
1359 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxz0123456789[{]} \t\n\r\f\v#"
1362 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1363 /* If we are doing a trans and we know we want UTF8 set expectation */
1364 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1365 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1369 while (s < send || dorange) {
1370 /* get transliterations out of the way (they're most literal) */
1371 if (PL_lex_inwhat == OP_TRANS) {
1372 /* expand a range A-Z to the full set of characters. AIE! */
1374 I32 i; /* current expanded character */
1375 I32 min; /* first character in range */
1376 I32 max; /* last character in range */
1379 char *c = (char*)utf8_hop((U8*)d, -1);
1383 *c = (char)UTF_TO_NATIVE(0xff);
1384 /* mark the range as done, and continue */
1390 i = d - SvPVX(sv); /* remember current offset */
1391 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1392 d = SvPVX(sv) + i; /* refresh d after realloc */
1393 d -= 2; /* eat the first char and the - */
1395 min = (U8)*d; /* first char in range */
1396 max = (U8)d[1]; /* last char in range */
1400 "Invalid range \"%c-%c\" in transliteration operator",
1401 (char)min, (char)max);
1405 if ((isLOWER(min) && isLOWER(max)) ||
1406 (isUPPER(min) && isUPPER(max))) {
1408 for (i = min; i <= max; i++)
1410 *d++ = NATIVE_TO_NEED(has_utf8,i);
1412 for (i = min; i <= max; i++)
1414 *d++ = NATIVE_TO_NEED(has_utf8,i);
1419 for (i = min; i <= max; i++)
1422 /* mark the range as done, and continue */
1428 /* range begins (ignore - as first or last char) */
1429 else if (*s == '-' && s+1 < send && s != start) {
1431 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1434 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1446 /* if we get here, we're not doing a transliteration */
1448 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1449 except for the last char, which will be done separately. */
1450 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1452 while (s+1 < send && *s != ')')
1453 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1455 else if (s[2] == '{' /* This should match regcomp.c */
1456 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1459 char *regparse = s + (s[2] == '{' ? 3 : 4);
1462 while (count && (c = *regparse)) {
1463 if (c == '\\' && regparse[1])
1471 if (*regparse != ')')
1472 regparse--; /* Leave one char for continuation. */
1473 while (s < regparse)
1474 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1478 /* likewise skip #-initiated comments in //x patterns */
1479 else if (*s == '#' && PL_lex_inpat &&
1480 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1481 while (s+1 < send && *s != '\n')
1482 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1485 /* check for embedded arrays
1486 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1488 else if (*s == '@' && s[1]
1489 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1492 /* check for embedded scalars. only stop if we're sure it's a
1495 else if (*s == '$') {
1496 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1498 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1499 break; /* in regexp, $ might be tail anchor */
1502 /* End of else if chain - OP_TRANS rejoin rest */
1505 if (*s == '\\' && s+1 < send) {
1508 /* some backslashes we leave behind */
1509 if (*leaveit && *s && strchr(leaveit, *s)) {
1510 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1511 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1515 /* deprecate \1 in strings and substitution replacements */
1516 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1517 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1519 if (ckWARN(WARN_SYNTAX))
1520 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1525 /* string-change backslash escapes */
1526 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1531 /* if we get here, it's either a quoted -, or a digit */
1534 /* quoted - in transliterations */
1536 if (PL_lex_inwhat == OP_TRANS) {
1543 if (ckWARN(WARN_MISC) &&
1546 Perl_warner(aTHX_ packWARN(WARN_MISC),
1547 "Unrecognized escape \\%c passed through",
1549 /* default action is to copy the quoted character */
1550 goto default_action;
1553 /* \132 indicates an octal constant */
1554 case '0': case '1': case '2': case '3':
1555 case '4': case '5': case '6': case '7':
1559 uv = grok_oct(s, &len, &flags, NULL);
1562 goto NUM_ESCAPE_INSERT;
1564 /* \x24 indicates a hex constant */
1568 char* e = strchr(s, '}');
1569 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1570 PERL_SCAN_DISALLOW_PREFIX;
1575 yyerror("Missing right brace on \\x{}");
1579 uv = grok_hex(s, &len, &flags, NULL);
1585 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1586 uv = grok_hex(s, &len, &flags, NULL);
1592 /* Insert oct or hex escaped character.
1593 * There will always enough room in sv since such
1594 * escapes will be longer than any UTF-8 sequence
1595 * they can end up as. */
1597 /* We need to map to chars to ASCII before doing the tests
1600 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1601 if (!has_utf8 && uv > 255) {
1602 /* Might need to recode whatever we have
1603 * accumulated so far if it contains any
1606 * (Can't we keep track of that and avoid
1607 * this rescan? --jhi)
1611 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1612 if (!NATIVE_IS_INVARIANT(*c)) {
1617 STRLEN offset = d - SvPVX(sv);
1619 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1623 while (src >= (U8 *)SvPVX(sv)) {
1624 if (!NATIVE_IS_INVARIANT(*src)) {
1625 U8 ch = NATIVE_TO_ASCII(*src);
1626 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1627 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1637 if (has_utf8 || uv > 255) {
1638 d = (char*)uvchr_to_utf8((U8*)d, uv);
1640 if (PL_lex_inwhat == OP_TRANS &&
1641 PL_sublex_info.sub_op) {
1642 PL_sublex_info.sub_op->op_private |=
1643 (PL_lex_repl ? OPpTRANS_FROM_UTF
1656 /* \N{LATIN SMALL LETTER A} is a named character */
1660 char* e = strchr(s, '}');
1666 yyerror("Missing right brace on \\N{}");
1670 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1672 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1673 PERL_SCAN_DISALLOW_PREFIX;
1676 uv = grok_hex(s, &len, &flags, NULL);
1678 goto NUM_ESCAPE_INSERT;
1680 res = newSVpvn(s + 1, e - s - 1);
1681 res = new_constant( Nullch, 0, "charnames",
1682 res, Nullsv, "\\N{...}" );
1684 sv_utf8_upgrade(res);
1685 str = SvPV(res,len);
1686 #ifdef EBCDIC_NEVER_MIND
1687 /* charnames uses pack U and that has been
1688 * recently changed to do the below uni->native
1689 * mapping, so this would be redundant (and wrong,
1690 * the code point would be doubly converted).
1691 * But leave this in just in case the pack U change
1692 * gets revoked, but the semantics is still
1693 * desireable for charnames. --jhi */
1695 UV uv = utf8_to_uvchr((U8*)str, 0);
1698 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1700 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1701 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1702 str = SvPV(res, len);
1706 if (!has_utf8 && SvUTF8(res)) {
1707 char *ostart = SvPVX(sv);
1708 SvCUR_set(sv, d - ostart);
1711 sv_utf8_upgrade(sv);
1712 /* this just broke our allocation above... */
1713 SvGROW(sv, (STRLEN)(send - start));
1714 d = SvPVX(sv) + SvCUR(sv);
1717 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1718 char *odest = SvPVX(sv);
1720 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1721 d = SvPVX(sv) + (d - odest);
1723 Copy(str, d, len, char);
1730 yyerror("Missing braces on \\N{}");
1733 /* \c is a control character */
1742 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1745 yyerror("Missing control char name in \\c");
1749 /* printf-style backslashes, formfeeds, newlines, etc */
1751 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1754 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1757 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1760 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1763 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1766 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1769 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1775 } /* end if (backslash) */
1778 /* If we started with encoded form, or already know we want it
1779 and then encode the next character */
1780 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1782 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1783 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1786 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1787 STRLEN off = d - SvPVX(sv);
1788 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1790 d = (char*)uvchr_to_utf8((U8*)d, uv);
1794 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1796 } /* while loop to process each character */
1798 /* terminate the string and set up the sv */
1800 SvCUR_set(sv, d - SvPVX(sv));
1801 if (SvCUR(sv) >= SvLEN(sv))
1802 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1805 if (PL_encoding && !has_utf8) {
1806 sv_recode_to_utf8(sv, PL_encoding);
1812 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1813 PL_sublex_info.sub_op->op_private |=
1814 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1818 /* shrink the sv if we allocated more than we used */
1819 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1820 SvLEN_set(sv, SvCUR(sv) + 1);
1821 Renew(SvPVX(sv), SvLEN(sv), char);
1824 /* return the substring (via yylval) only if we parsed anything */
1825 if (s > PL_bufptr) {
1826 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1827 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1829 ( PL_lex_inwhat == OP_TRANS
1831 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1834 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1841 * Returns TRUE if there's more to the expression (e.g., a subscript),
1844 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1846 * ->[ and ->{ return TRUE
1847 * { and [ outside a pattern are always subscripts, so return TRUE
1848 * if we're outside a pattern and it's not { or [, then return FALSE
1849 * if we're in a pattern and the first char is a {
1850 * {4,5} (any digits around the comma) returns FALSE
1851 * if we're in a pattern and the first char is a [
1853 * [SOMETHING] has a funky algorithm to decide whether it's a
1854 * character class or not. It has to deal with things like
1855 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1856 * anything else returns TRUE
1859 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1862 S_intuit_more(pTHX_ register char *s)
1864 if (PL_lex_brackets)
1866 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1868 if (*s != '{' && *s != '[')
1873 /* In a pattern, so maybe we have {n,m}. */
1890 /* On the other hand, maybe we have a character class */
1893 if (*s == ']' || *s == '^')
1896 /* this is terrifying, and it works */
1897 int weight = 2; /* let's weigh the evidence */
1899 unsigned char un_char = 255, last_un_char;
1900 char *send = strchr(s,']');
1901 char tmpbuf[sizeof PL_tokenbuf * 4];
1903 if (!send) /* has to be an expression */
1906 Zero(seen,256,char);
1909 else if (isDIGIT(*s)) {
1911 if (isDIGIT(s[1]) && s[2] == ']')
1917 for (; s < send; s++) {
1918 last_un_char = un_char;
1919 un_char = (unsigned char)*s;
1924 weight -= seen[un_char] * 10;
1925 if (isALNUM_lazy_if(s+1,UTF)) {
1926 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1927 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1932 else if (*s == '$' && s[1] &&
1933 strchr("[#!%*<>()-=",s[1])) {
1934 if (/*{*/ strchr("])} =",s[2]))
1943 if (strchr("wds]",s[1]))
1945 else if (seen['\''] || seen['"'])
1947 else if (strchr("rnftbxcav",s[1]))
1949 else if (isDIGIT(s[1])) {
1951 while (s[1] && isDIGIT(s[1]))
1961 if (strchr("aA01! ",last_un_char))
1963 if (strchr("zZ79~",s[1]))
1965 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1966 weight -= 5; /* cope with negative subscript */
1969 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1970 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1975 if (keyword(tmpbuf, d - tmpbuf))
1978 if (un_char == last_un_char + 1)
1980 weight -= seen[un_char];
1985 if (weight >= 0) /* probably a character class */
1995 * Does all the checking to disambiguate
1997 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1998 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
2000 * First argument is the stuff after the first token, e.g. "bar".
2002 * Not a method if bar is a filehandle.
2003 * Not a method if foo is a subroutine prototyped to take a filehandle.
2004 * Not a method if it's really "Foo $bar"
2005 * Method if it's "foo $bar"
2006 * Not a method if it's really "print foo $bar"
2007 * Method if it's really "foo package::" (interpreted as package->foo)
2008 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
2009 * Not a method if bar is a filehandle or package, but is quoted with
2014 S_intuit_method(pTHX_ char *start, GV *gv)
2016 char *s = start + (*start == '$');
2017 char tmpbuf[sizeof PL_tokenbuf];
2025 if ((cv = GvCVu(gv))) {
2026 char *proto = SvPVX(cv);
2036 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
2037 /* start is the beginning of the possible filehandle/object,
2038 * and s is the end of it
2039 * tmpbuf is a copy of it
2042 if (*start == '$') {
2043 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
2048 return *s == '(' ? FUNCMETH : METHOD;
2050 if (!keyword(tmpbuf, len)) {
2051 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
2056 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
2057 if (indirgv && GvCVu(indirgv))
2059 /* filehandle or package name makes it a method */
2060 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
2062 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
2063 return 0; /* no assumptions -- "=>" quotes bearword */
2065 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
2066 newSVpvn(tmpbuf,len));
2067 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
2071 return *s == '(' ? FUNCMETH : METHOD;
2079 * Return a string of Perl code to load the debugger. If PERL5DB
2080 * is set, it will return the contents of that, otherwise a
2081 * compile-time require of perl5db.pl.
2088 char *pdb = PerlEnv_getenv("PERL5DB");
2092 SETERRNO(0,SS_NORMAL);
2093 return "BEGIN { require 'perl5db.pl' }";
2099 /* Encoded script support. filter_add() effectively inserts a
2100 * 'pre-processing' function into the current source input stream.
2101 * Note that the filter function only applies to the current source file
2102 * (e.g., it will not affect files 'require'd or 'use'd by this one).
2104 * The datasv parameter (which may be NULL) can be used to pass
2105 * private data to this instance of the filter. The filter function
2106 * can recover the SV using the FILTER_DATA macro and use it to
2107 * store private buffers and state information.
2109 * The supplied datasv parameter is upgraded to a PVIO type
2110 * and the IoDIRP/IoANY field is used to store the function pointer,
2111 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
2112 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
2113 * private use must be set using malloc'd pointers.
2117 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2122 if (!PL_rsfp_filters)
2123 PL_rsfp_filters = newAV();
2125 datasv = NEWSV(255,0);
2126 if (!SvUPGRADE(datasv, SVt_PVIO))
2127 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2128 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2129 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2130 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2131 (void*)funcp, SvPV_nolen(datasv)));
2132 av_unshift(PL_rsfp_filters, 1);
2133 av_store(PL_rsfp_filters, 0, datasv) ;
2138 /* Delete most recently added instance of this filter function. */
2140 Perl_filter_del(pTHX_ filter_t funcp)
2143 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2144 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2146 /* if filter is on top of stack (usual case) just pop it off */
2147 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2148 if (IoANY(datasv) == (void *)funcp) {
2149 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2150 IoANY(datasv) = (void *)NULL;
2151 sv_free(av_pop(PL_rsfp_filters));
2155 /* we need to search for the correct entry and clear it */
2156 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2160 /* Invoke the idxth filter function for the current rsfp. */
2161 /* maxlen 0 = read one text line */
2163 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2168 if (!PL_rsfp_filters)
2170 if (idx > AvFILLp(PL_rsfp_filters)) { /* Any more filters? */
2171 /* Provide a default input filter to make life easy. */
2172 /* Note that we append to the line. This is handy. */
2173 DEBUG_P(PerlIO_printf(Perl_debug_log,
2174 "filter_read %d: from rsfp\n", idx));
2178 int old_len = SvCUR(buf_sv) ;
2180 /* ensure buf_sv is large enough */
2181 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2182 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2183 if (PerlIO_error(PL_rsfp))
2184 return -1; /* error */
2186 return 0 ; /* end of file */
2188 SvCUR_set(buf_sv, old_len + len) ;
2191 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2192 if (PerlIO_error(PL_rsfp))
2193 return -1; /* error */
2195 return 0 ; /* end of file */
2198 return SvCUR(buf_sv);
2200 /* Skip this filter slot if filter has been deleted */
2201 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef) {
2202 DEBUG_P(PerlIO_printf(Perl_debug_log,
2203 "filter_read %d: skipped (filter deleted)\n",
2205 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2207 /* Get function pointer hidden within datasv */
2208 funcp = (filter_t)IoANY(datasv);
2209 DEBUG_P(PerlIO_printf(Perl_debug_log,
2210 "filter_read %d: via function %p (%s)\n",
2211 idx, (void*)funcp, SvPV_nolen(datasv)));
2212 /* Call function. The function is expected to */
2213 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2214 /* Return: <0:error, =0:eof, >0:not eof */
2215 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2219 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2221 #ifdef PERL_CR_FILTER
2222 if (!PL_rsfp_filters) {
2223 filter_add(S_cr_textfilter,NULL);
2226 if (PL_rsfp_filters) {
2228 SvCUR_set(sv, 0); /* start with empty line */
2229 if (FILTER_READ(0, sv, 0) > 0)
2230 return ( SvPVX(sv) ) ;
2235 return (sv_gets(sv, fp, append));
2239 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2243 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2247 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2248 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2250 return GvHV(gv); /* Foo:: */
2253 /* use constant CLASS => 'MyClass' */
2254 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2256 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2257 pkgname = SvPV_nolen(sv);
2261 return gv_stashpv(pkgname, FALSE);
2265 static char* exp_name[] =
2266 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2267 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
2274 Works out what to call the token just pulled out of the input
2275 stream. The yacc parser takes care of taking the ops we return and
2276 stitching them into a tree.
2282 if read an identifier
2283 if we're in a my declaration
2284 croak if they tried to say my($foo::bar)
2285 build the ops for a my() declaration
2286 if it's an access to a my() variable
2287 are we in a sort block?
2288 croak if my($a); $a <=> $b
2289 build ops for access to a my() variable
2290 if in a dq string, and they've said @foo and we can't find @foo
2292 build ops for a bareword
2293 if we already built the token before, use it.
2298 #pragma segment Perl_yylex
2303 register char *s = PL_bufptr;
2310 I32 orig_keyword = 0;
2313 PerlIO_printf(Perl_debug_log, "### LEX_%s\n",
2314 lex_state_names[PL_lex_state]);
2316 /* check if there's an identifier for us to look at */
2317 if (PL_pending_ident)
2318 return REPORT(S_pending_ident(aTHX));
2320 /* no identifier pending identification */
2322 switch (PL_lex_state) {
2324 case LEX_NORMAL: /* Some compilers will produce faster */
2325 case LEX_INTERPNORMAL: /* code if we comment these out. */
2329 /* when we've already built the next token, just pull it out of the queue */
2332 yylval = PL_nextval[PL_nexttoke];
2334 PL_lex_state = PL_lex_defer;
2335 PL_expect = PL_lex_expect;
2336 PL_lex_defer = LEX_NORMAL;
2338 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2339 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2340 (IV)PL_nexttype[PL_nexttoke]); });
2342 return REPORT(PL_nexttype[PL_nexttoke]);
2344 /* interpolated case modifiers like \L \U, including \Q and \E.
2345 when we get here, PL_bufptr is at the \
2347 case LEX_INTERPCASEMOD:
2349 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2350 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2352 /* handle \E or end of string */
2353 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2357 if (PL_lex_casemods) {
2358 oldmod = PL_lex_casestack[--PL_lex_casemods];
2359 PL_lex_casestack[PL_lex_casemods] = '\0';
2361 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2363 PL_lex_state = LEX_INTERPCONCAT;
2367 if (PL_bufptr != PL_bufend)
2369 PL_lex_state = LEX_INTERPCONCAT;
2373 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2374 "### Saw case modifier at '%s'\n", PL_bufptr); });
2376 if (s[1] == '\\' && s[2] == 'E') {
2378 PL_lex_state = LEX_INTERPCONCAT;
2382 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2383 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2384 if (strchr("LU", *s) &&
2385 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2386 PL_lex_casestack[--PL_lex_casemods] = '\0';
2389 if (PL_lex_casemods > 10)
2390 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2391 PL_lex_casestack[PL_lex_casemods++] = *s;
2392 PL_lex_casestack[PL_lex_casemods] = '\0';
2393 PL_lex_state = LEX_INTERPCONCAT;
2394 PL_nextval[PL_nexttoke].ival = 0;
2397 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2399 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2401 PL_nextval[PL_nexttoke].ival = OP_LC;
2403 PL_nextval[PL_nexttoke].ival = OP_UC;
2405 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2407 Perl_croak(aTHX_ "panic: yylex");
2411 if (PL_lex_starts) {
2414 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2415 if (PL_lex_casemods == 1 && PL_lex_inpat)
2424 case LEX_INTERPPUSH:
2425 return REPORT(sublex_push());
2427 case LEX_INTERPSTART:
2428 if (PL_bufptr == PL_bufend)
2429 return REPORT(sublex_done());
2430 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2431 "### Interpolated variable at '%s'\n", PL_bufptr); });
2433 PL_lex_dojoin = (*PL_bufptr == '@');
2434 PL_lex_state = LEX_INTERPNORMAL;
2435 if (PL_lex_dojoin) {
2436 PL_nextval[PL_nexttoke].ival = 0;
2438 force_ident("\"", '$');
2439 PL_nextval[PL_nexttoke].ival = 0;
2441 PL_nextval[PL_nexttoke].ival = 0;
2443 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2446 if (PL_lex_starts++) {
2448 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2449 if (!PL_lex_casemods && PL_lex_inpat)
2456 case LEX_INTERPENDMAYBE:
2457 if (intuit_more(PL_bufptr)) {
2458 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2464 if (PL_lex_dojoin) {
2465 PL_lex_dojoin = FALSE;
2466 PL_lex_state = LEX_INTERPCONCAT;
2469 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2470 && SvEVALED(PL_lex_repl))
2472 if (PL_bufptr != PL_bufend)
2473 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2474 PL_lex_repl = Nullsv;
2477 case LEX_INTERPCONCAT:
2479 if (PL_lex_brackets)
2480 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2482 if (PL_bufptr == PL_bufend)
2483 return REPORT(sublex_done());
2485 if (SvIVX(PL_linestr) == '\'') {
2486 SV *sv = newSVsv(PL_linestr);
2489 else if ( PL_hints & HINT_NEW_RE )
2490 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2491 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2495 s = scan_const(PL_bufptr);
2497 PL_lex_state = LEX_INTERPCASEMOD;
2499 PL_lex_state = LEX_INTERPSTART;
2502 if (s != PL_bufptr) {
2503 PL_nextval[PL_nexttoke] = yylval;
2506 if (PL_lex_starts++) {
2507 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2508 if (!PL_lex_casemods && PL_lex_inpat)
2521 PL_lex_state = LEX_NORMAL;
2522 s = scan_formline(PL_bufptr);
2523 if (!PL_lex_formbrack)
2529 PL_oldoldbufptr = PL_oldbufptr;
2532 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at [%s]\n",
2533 exp_name[PL_expect], s);
2539 if (isIDFIRST_lazy_if(s,UTF))
2541 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2544 goto fake_eof; /* emulate EOF on ^D or ^Z */
2549 if (PL_lex_brackets) {
2550 if (PL_lex_formbrack)
2551 yyerror("Format not terminated");
2553 yyerror("Missing right curly or square bracket");
2555 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2556 "### Tokener got EOF\n");
2560 if (s++ < PL_bufend)
2561 goto retry; /* ignore stray nulls */
2564 if (!PL_in_eval && !PL_preambled) {
2565 PL_preambled = TRUE;
2566 sv_setpv(PL_linestr,incl_perldb());
2567 if (SvCUR(PL_linestr))
2568 sv_catpv(PL_linestr,";");
2570 while(AvFILLp(PL_preambleav) >= 0) {
2571 SV *tmpsv = av_shift(PL_preambleav);
2572 sv_catsv(PL_linestr, tmpsv);
2573 sv_catpv(PL_linestr, ";");
2576 sv_free((SV*)PL_preambleav);
2577 PL_preambleav = NULL;
2579 if (PL_minus_n || PL_minus_p) {
2580 sv_catpv(PL_linestr, "LINE: while (<>) {");
2582 sv_catpv(PL_linestr,"chomp;");
2585 if (strchr("/'\"", *PL_splitstr)
2586 && strchr(PL_splitstr + 1, *PL_splitstr))
2587 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2590 s = "'~#\200\1'"; /* surely one char is unused...*/
2591 while (s[1] && strchr(PL_splitstr, *s)) s++;
2593 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2594 "q" + (delim == '\''), delim);
2595 for (s = PL_splitstr; *s; s++) {
2597 sv_catpvn(PL_linestr, "\\", 1);
2598 sv_catpvn(PL_linestr, s, 1);
2600 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2604 sv_catpv(PL_linestr,"our @F=split(' ');");
2607 sv_catpv(PL_linestr, "\n");
2608 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2609 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2610 PL_last_lop = PL_last_uni = Nullch;
2611 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2612 SV *sv = NEWSV(85,0);
2614 sv_upgrade(sv, SVt_PVMG);
2615 sv_setsv(sv,PL_linestr);
2618 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2623 bof = PL_rsfp ? TRUE : FALSE;
2624 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2627 if (PL_preprocess && !PL_in_eval)
2628 (void)PerlProc_pclose(PL_rsfp);
2629 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2630 PerlIO_clearerr(PL_rsfp);
2632 (void)PerlIO_close(PL_rsfp);
2634 PL_doextract = FALSE;
2636 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2637 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2638 sv_catpv(PL_linestr,";}");
2639 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2640 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2641 PL_last_lop = PL_last_uni = Nullch;
2642 PL_minus_n = PL_minus_p = 0;
2645 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2646 PL_last_lop = PL_last_uni = Nullch;
2647 sv_setpv(PL_linestr,"");
2648 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2650 /* If it looks like the start of a BOM or raw UTF-16,
2651 * check if it in fact is. */
2657 #ifdef PERLIO_IS_STDIO
2658 # ifdef __GNU_LIBRARY__
2659 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2660 # define FTELL_FOR_PIPE_IS_BROKEN
2664 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2665 # define FTELL_FOR_PIPE_IS_BROKEN
2670 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2671 /* This loses the possibility to detect the bof
2672 * situation on perl -P when the libc5 is being used.
2673 * Workaround? Maybe attach some extra state to PL_rsfp?
2676 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2678 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2681 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2682 s = swallow_bom((U8*)s);
2686 /* Incest with pod. */
2687 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2688 sv_setpv(PL_linestr, "");
2689 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2690 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2691 PL_last_lop = PL_last_uni = Nullch;
2692 PL_doextract = FALSE;
2696 } while (PL_doextract);
2697 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2698 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2699 SV *sv = NEWSV(85,0);
2701 sv_upgrade(sv, SVt_PVMG);
2702 sv_setsv(sv,PL_linestr);
2705 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2707 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2708 PL_last_lop = PL_last_uni = Nullch;
2709 if (CopLINE(PL_curcop) == 1) {
2710 while (s < PL_bufend && isSPACE(*s))
2712 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2716 if (*s == '#' && *(s+1) == '!')
2718 #ifdef ALTERNATE_SHEBANG
2720 static char as[] = ALTERNATE_SHEBANG;
2721 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2722 d = s + (sizeof(as) - 1);
2724 #endif /* ALTERNATE_SHEBANG */
2733 while (*d && !isSPACE(*d))
2737 #ifdef ARG_ZERO_IS_SCRIPT
2738 if (ipathend > ipath) {
2740 * HP-UX (at least) sets argv[0] to the script name,
2741 * which makes $^X incorrect. And Digital UNIX and Linux,
2742 * at least, set argv[0] to the basename of the Perl
2743 * interpreter. So, having found "#!", we'll set it right.
2745 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2746 assert(SvPOK(x) || SvGMAGICAL(x));
2747 if (sv_eq(x, CopFILESV(PL_curcop))) {
2748 sv_setpvn(x, ipath, ipathend - ipath);
2754 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2755 char *lstart = SvPV(x,llen);
2757 bstart += blen - llen;
2758 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2759 sv_setpvn(x, ipath, ipathend - ipath);
2764 TAINT_NOT; /* $^X is always tainted, but that's OK */
2766 #endif /* ARG_ZERO_IS_SCRIPT */
2771 d = instr(s,"perl -");
2773 d = instr(s,"perl");
2775 /* avoid getting into infinite loops when shebang
2776 * line contains "Perl" rather than "perl" */
2778 for (d = ipathend-4; d >= ipath; --d) {
2779 if ((*d == 'p' || *d == 'P')
2780 && !ibcmp(d, "perl", 4))
2790 #ifdef ALTERNATE_SHEBANG
2792 * If the ALTERNATE_SHEBANG on this system starts with a
2793 * character that can be part of a Perl expression, then if
2794 * we see it but not "perl", we're probably looking at the
2795 * start of Perl code, not a request to hand off to some
2796 * other interpreter. Similarly, if "perl" is there, but
2797 * not in the first 'word' of the line, we assume the line
2798 * contains the start of the Perl program.
2800 if (d && *s != '#') {
2802 while (*c && !strchr("; \t\r\n\f\v#", *c))
2805 d = Nullch; /* "perl" not in first word; ignore */
2807 *s = '#'; /* Don't try to parse shebang line */
2809 #endif /* ALTERNATE_SHEBANG */
2810 #ifndef MACOS_TRADITIONAL
2815 !instr(s,"indir") &&
2816 instr(PL_origargv[0],"perl"))
2822 while (s < PL_bufend && isSPACE(*s))
2824 if (s < PL_bufend) {
2825 Newz(899,newargv,PL_origargc+3,char*);
2827 while (s < PL_bufend && !isSPACE(*s))
2830 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2833 newargv = PL_origargv;
2836 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2838 Perl_croak(aTHX_ "Can't exec %s", ipath);
2842 U32 oldpdb = PL_perldb;
2843 bool oldn = PL_minus_n;
2844 bool oldp = PL_minus_p;
2846 while (*d && !isSPACE(*d)) d++;
2847 while (SPACE_OR_TAB(*d)) d++;
2850 bool switches_done = PL_doswitches;
2852 if (*d == 'M' || *d == 'm') {
2854 while (*d && !isSPACE(*d)) d++;
2855 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2858 d = moreswitches(d);
2860 if (PL_doswitches && !switches_done) {
2861 int argc = PL_origargc;
2862 char **argv = PL_origargv;
2865 } while (argc && argv[0][0] == '-' && argv[0][1]);
2866 init_argv_symbols(argc,argv);
2868 if ((PERLDB_LINE && !oldpdb) ||
2869 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2870 /* if we have already added "LINE: while (<>) {",
2871 we must not do it again */
2873 sv_setpv(PL_linestr, "");
2874 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2875 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2876 PL_last_lop = PL_last_uni = Nullch;
2877 PL_preambled = FALSE;
2879 (void)gv_fetchfile(PL_origfilename);
2882 if (PL_doswitches && !switches_done) {
2883 int argc = PL_origargc;
2884 char **argv = PL_origargv;
2887 } while (argc && argv[0][0] == '-' && argv[0][1]);
2888 init_argv_symbols(argc,argv);
2894 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2896 PL_lex_state = LEX_FORMLINE;
2901 #ifdef PERL_STRICT_CR
2902 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2904 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2906 case ' ': case '\t': case '\f': case 013:
2907 #ifdef MACOS_TRADITIONAL
2914 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2915 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2916 /* handle eval qq[#line 1 "foo"\n ...] */
2917 CopLINE_dec(PL_curcop);
2921 while (s < d && *s != '\n')
2925 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2926 Perl_croak(aTHX_ "panic: input overflow");
2928 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2930 PL_lex_state = LEX_FORMLINE;
2940 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2947 while (s < PL_bufend && SPACE_OR_TAB(*s))
2950 if (strnEQ(s,"=>",2)) {
2951 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2952 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2953 "### Saw unary minus before =>, forcing word '%s'\n", s);
2955 OPERATOR('-'); /* unary minus */
2957 PL_last_uni = PL_oldbufptr;
2959 case 'r': ftst = OP_FTEREAD; break;
2960 case 'w': ftst = OP_FTEWRITE; break;
2961 case 'x': ftst = OP_FTEEXEC; break;
2962 case 'o': ftst = OP_FTEOWNED; break;
2963 case 'R': ftst = OP_FTRREAD; break;
2964 case 'W': ftst = OP_FTRWRITE; break;
2965 case 'X': ftst = OP_FTREXEC; break;
2966 case 'O': ftst = OP_FTROWNED; break;
2967 case 'e': ftst = OP_FTIS; break;
2968 case 'z': ftst = OP_FTZERO; break;
2969 case 's': ftst = OP_FTSIZE; break;
2970 case 'f': ftst = OP_FTFILE; break;
2971 case 'd': ftst = OP_FTDIR; break;
2972 case 'l': ftst = OP_FTLINK; break;
2973 case 'p': ftst = OP_FTPIPE; break;
2974 case 'S': ftst = OP_FTSOCK; break;
2975 case 'u': ftst = OP_FTSUID; break;
2976 case 'g': ftst = OP_FTSGID; break;
2977 case 'k': ftst = OP_FTSVTX; break;
2978 case 'b': ftst = OP_FTBLK; break;
2979 case 'c': ftst = OP_FTCHR; break;
2980 case 't': ftst = OP_FTTTY; break;
2981 case 'T': ftst = OP_FTTEXT; break;
2982 case 'B': ftst = OP_FTBINARY; break;
2983 case 'M': case 'A': case 'C':
2984 gv_fetchpv("\024",TRUE, SVt_PV);
2986 case 'M': ftst = OP_FTMTIME; break;
2987 case 'A': ftst = OP_FTATIME; break;
2988 case 'C': ftst = OP_FTCTIME; break;
2996 PL_last_lop_op = (OPCODE)ftst;
2997 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2998 "### Saw file test %c\n", (int)ftst);
3003 /* Assume it was a minus followed by a one-letter named
3004 * subroutine call (or a -bareword), then. */
3005 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3006 "### '-%c' looked like a file test but was not\n",
3015 if (PL_expect == XOPERATOR)
3020 else if (*s == '>') {
3023 if (isIDFIRST_lazy_if(s,UTF)) {
3024 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
3032 if (PL_expect == XOPERATOR)
3035 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3037 OPERATOR('-'); /* unary minus */
3044 if (PL_expect == XOPERATOR)
3049 if (PL_expect == XOPERATOR)
3052 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3058 if (PL_expect != XOPERATOR) {
3059 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3060 PL_expect = XOPERATOR;
3061 force_ident(PL_tokenbuf, '*');
3074 if (PL_expect == XOPERATOR) {
3078 PL_tokenbuf[0] = '%';
3079 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
3080 if (!PL_tokenbuf[1]) {
3083 PL_pending_ident = '%';
3102 switch (PL_expect) {
3105 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3107 PL_bufptr = s; /* update in case we back off */
3113 PL_expect = XTERMBLOCK;
3117 while (isIDFIRST_lazy_if(s,UTF)) {
3118 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3119 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3120 if (tmp < 0) tmp = -tmp;
3136 d = scan_str(d,TRUE,TRUE);
3138 /* MUST advance bufptr here to avoid bogus
3139 "at end of line" context messages from yyerror().
3141 PL_bufptr = s + len;
3142 yyerror("Unterminated attribute parameter in attribute list");
3145 return REPORT(0); /* EOF indicator */
3149 SV *sv = newSVpvn(s, len);
3150 sv_catsv(sv, PL_lex_stuff);
3151 attrs = append_elem(OP_LIST, attrs,
3152 newSVOP(OP_CONST, 0, sv));
3153 SvREFCNT_dec(PL_lex_stuff);
3154 PL_lex_stuff = Nullsv;
3157 if (len == 6 && strnEQ(s, "unique", len)) {
3158 if (PL_in_my == KEY_our)
3160 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3162 ; /* skip to avoid loading attributes.pm */
3165 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3168 /* NOTE: any CV attrs applied here need to be part of
3169 the CVf_BUILTIN_ATTRS define in cv.h! */
3170 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3171 CvLVALUE_on(PL_compcv);
3172 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3173 CvLOCKED_on(PL_compcv);
3174 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3175 CvMETHOD_on(PL_compcv);
3176 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3177 CvASSERTION_on(PL_compcv);
3178 /* After we've set the flags, it could be argued that
3179 we don't need to do the attributes.pm-based setting
3180 process, and shouldn't bother appending recognized
3181 flags. To experiment with that, uncomment the
3182 following "else". (Note that's already been
3183 uncommented. That keeps the above-applied built-in
3184 attributes from being intercepted (and possibly
3185 rejected) by a package's attribute routines, but is
3186 justified by the performance win for the common case
3187 of applying only built-in attributes.) */
3189 attrs = append_elem(OP_LIST, attrs,
3190 newSVOP(OP_CONST, 0,
3194 if (*s == ':' && s[1] != ':')
3197 break; /* require real whitespace or :'s */
3199 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3200 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3201 char q = ((*s == '\'') ? '"' : '\'');
3202 /* If here for an expression, and parsed no attrs, back off. */
3203 if (tmp == '=' && !attrs) {
3207 /* MUST advance bufptr here to avoid bogus "at end of line"
3208 context messages from yyerror().
3212 yyerror("Unterminated attribute list");
3214 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3222 PL_nextval[PL_nexttoke].opval = attrs;
3230 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3231 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3248 if (PL_lex_brackets <= 0)
3249 yyerror("Unmatched right square bracket");
3252 if (PL_lex_state == LEX_INTERPNORMAL) {
3253 if (PL_lex_brackets == 0) {
3254 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3255 PL_lex_state = LEX_INTERPEND;
3262 if (PL_lex_brackets > 100) {
3263 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3265 switch (PL_expect) {
3267 if (PL_lex_formbrack) {
3271 if (PL_oldoldbufptr == PL_last_lop)
3272 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3274 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3275 OPERATOR(HASHBRACK);
3277 while (s < PL_bufend && SPACE_OR_TAB(*s))
3280 PL_tokenbuf[0] = '\0';
3281 if (d < PL_bufend && *d == '-') {
3282 PL_tokenbuf[0] = '-';
3284 while (d < PL_bufend && SPACE_OR_TAB(*d))
3287 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3288 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3290 while (d < PL_bufend && SPACE_OR_TAB(*d))
3293 char minus = (PL_tokenbuf[0] == '-');
3294 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3302 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3307 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3312 if (PL_oldoldbufptr == PL_last_lop)
3313 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3315 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3318 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3320 /* This hack is to get the ${} in the message. */
3322 yyerror("syntax error");
3325 OPERATOR(HASHBRACK);
3327 /* This hack serves to disambiguate a pair of curlies
3328 * as being a block or an anon hash. Normally, expectation
3329 * determines that, but in cases where we're not in a
3330 * position to expect anything in particular (like inside
3331 * eval"") we have to resolve the ambiguity. This code
3332 * covers the case where the first term in the curlies is a
3333 * quoted string. Most other cases need to be explicitly
3334 * disambiguated by prepending a `+' before the opening
3335 * curly in order to force resolution as an anon hash.
3337 * XXX should probably propagate the outer expectation
3338 * into eval"" to rely less on this hack, but that could
3339 * potentially break current behavior of eval"".
3343 if (*s == '\'' || *s == '"' || *s == '`') {
3344 /* common case: get past first string, handling escapes */
3345 for (t++; t < PL_bufend && *t != *s;)
3346 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3350 else if (*s == 'q') {
3353 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3356 /* skip q//-like construct */
3358 char open, close, term;
3361 while (t < PL_bufend && isSPACE(*t))
3363 /* check for q => */
3364 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3365 OPERATOR(HASHBRACK);
3369 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3373 for (t++; t < PL_bufend; t++) {
3374 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3376 else if (*t == open)
3380 for (t++; t < PL_bufend; t++) {
3381 if (*t == '\\' && t+1 < PL_bufend)
3383 else if (*t == close && --brackets <= 0)
3385 else if (*t == open)
3392 /* skip plain q word */
3393 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3396 else if (isALNUM_lazy_if(t,UTF)) {
3398 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3401 while (t < PL_bufend && isSPACE(*t))
3403 /* if comma follows first term, call it an anon hash */
3404 /* XXX it could be a comma expression with loop modifiers */
3405 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3406 || (*t == '=' && t[1] == '>')))
3407 OPERATOR(HASHBRACK);
3408 if (PL_expect == XREF)
3411 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3417 yylval.ival = CopLINE(PL_curcop);
3418 if (isSPACE(*s) || *s == '#')
3419 PL_copline = NOLINE; /* invalidate current command line number */
3424 if (PL_lex_brackets <= 0)
3425 yyerror("Unmatched right curly bracket");
3427 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3428 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3429 PL_lex_formbrack = 0;
3430 if (PL_lex_state == LEX_INTERPNORMAL) {
3431 if (PL_lex_brackets == 0) {
3432 if (PL_expect & XFAKEBRACK) {
3433 PL_expect &= XENUMMASK;
3434 PL_lex_state = LEX_INTERPEND;
3436 return yylex(); /* ignore fake brackets */
3438 if (*s == '-' && s[1] == '>')
3439 PL_lex_state = LEX_INTERPENDMAYBE;
3440 else if (*s != '[' && *s != '{')
3441 PL_lex_state = LEX_INTERPEND;
3444 if (PL_expect & XFAKEBRACK) {
3445 PL_expect &= XENUMMASK;
3447 return yylex(); /* ignore fake brackets */
3457 if (PL_expect == XOPERATOR) {
3458 if (ckWARN(WARN_SEMICOLON)
3459 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3461 CopLINE_dec(PL_curcop);
3462 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3463 CopLINE_inc(PL_curcop);
3468 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3470 PL_expect = XOPERATOR;
3471 force_ident(PL_tokenbuf, '&');
3475 yylval.ival = (OPpENTERSUB_AMPER<<8);
3494 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3495 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3497 if (PL_expect == XSTATE && isALPHA(tmp) &&
3498 (s == PL_linestart+1 || s[-2] == '\n') )
3500 if (PL_in_eval && !PL_rsfp) {
3505 if (strnEQ(s,"=cut",4)) {
3519 PL_doextract = TRUE;
3522 if (PL_lex_brackets < PL_lex_formbrack) {
3524 #ifdef PERL_STRICT_CR
3525 for (t = s; SPACE_OR_TAB(*t); t++) ;
3527 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3529 if (*t == '\n' || *t == '#') {
3541 /* was this !=~ where !~ was meant?
3542 * warn on m:!=~\s+([/?]|[msy]\W|tr\W): */
3544 if (*s == '~' && ckWARN(WARN_SYNTAX)) {
3547 while (t < PL_bufend && isSPACE(*t))
3550 if (*t == '/' || *t == '?' ||
3551 ((*t == 'm' || *t == 's' || *t == 'y') && !isALNUM(t[1])) ||
3552 (*t == 't' && t[1] == 'r' && !isALNUM(t[2])))
3553 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3554 "!=~ should be !~");
3563 if (PL_expect != XOPERATOR) {
3564 if (s[1] != '<' && !strchr(s,'>'))
3567 s = scan_heredoc(s);
3569 s = scan_inputsymbol(s);
3570 TERM(sublex_start());
3575 SHop(OP_LEFT_SHIFT);
3589 SHop(OP_RIGHT_SHIFT);
3598 if (PL_expect == XOPERATOR) {
3599 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3602 return REPORT(','); /* grandfather non-comma-format format */
3606 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3607 PL_tokenbuf[0] = '@';
3608 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3609 sizeof PL_tokenbuf - 1, FALSE);
3610 if (PL_expect == XOPERATOR)
3611 no_op("Array length", s);
3612 if (!PL_tokenbuf[1])
3614 PL_expect = XOPERATOR;
3615 PL_pending_ident = '#';
3619 PL_tokenbuf[0] = '$';
3620 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3621 sizeof PL_tokenbuf - 1, FALSE);
3622 if (PL_expect == XOPERATOR)
3624 if (!PL_tokenbuf[1]) {
3626 yyerror("Final $ should be \\$ or $name");
3630 /* This kludge not intended to be bulletproof. */
3631 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3632 yylval.opval = newSVOP(OP_CONST, 0,
3633 newSViv(PL_compiling.cop_arybase));
3634 yylval.opval->op_private = OPpCONST_ARYBASE;
3640 if (PL_lex_state == LEX_NORMAL)
3643 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3646 PL_tokenbuf[0] = '@';
3647 if (ckWARN(WARN_SYNTAX)) {
3649 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3652 PL_bufptr = skipspace(PL_bufptr);
3653 while (t < PL_bufend && *t != ']')
3655 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3656 "Multidimensional syntax %.*s not supported",
3657 (t - PL_bufptr) + 1, PL_bufptr);
3661 else if (*s == '{') {
3662 PL_tokenbuf[0] = '%';
3663 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3664 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3666 char tmpbuf[sizeof PL_tokenbuf];
3668 for (t++; isSPACE(*t); t++) ;
3669 if (isIDFIRST_lazy_if(t,UTF)) {
3670 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3671 for (; isSPACE(*t); t++) ;
3672 if (*t == ';' && get_cv(tmpbuf, FALSE))
3673 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3674 "You need to quote \"%s\"", tmpbuf);
3680 PL_expect = XOPERATOR;
3681 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3682 bool islop = (PL_last_lop == PL_oldoldbufptr);
3683 if (!islop || PL_last_lop_op == OP_GREPSTART)
3684 PL_expect = XOPERATOR;
3685 else if (strchr("$@\"'`q", *s))
3686 PL_expect = XTERM; /* e.g. print $fh "foo" */
3687 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3688 PL_expect = XTERM; /* e.g. print $fh &sub */
3689 else if (isIDFIRST_lazy_if(s,UTF)) {
3690 char tmpbuf[sizeof PL_tokenbuf];
3691 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3692 if ((tmp = keyword(tmpbuf, len))) {
3693 /* binary operators exclude handle interpretations */
3705 PL_expect = XTERM; /* e.g. print $fh length() */
3710 PL_expect = XTERM; /* e.g. print $fh subr() */
3713 else if (isDIGIT(*s))
3714 PL_expect = XTERM; /* e.g. print $fh 3 */
3715 else if (*s == '.' && isDIGIT(s[1]))
3716 PL_expect = XTERM; /* e.g. print $fh .3 */
3717 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3718 PL_expect = XTERM; /* e.g. print $fh -1 */
3719 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3720 PL_expect = XTERM; /* e.g. print $fh /.../
3721 XXX except DORDOR operator */
3722 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3723 PL_expect = XTERM; /* print $fh <<"EOF" */
3725 PL_pending_ident = '$';
3729 if (PL_expect == XOPERATOR)
3731 PL_tokenbuf[0] = '@';
3732 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3733 if (!PL_tokenbuf[1]) {
3736 if (PL_lex_state == LEX_NORMAL)
3738 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3740 PL_tokenbuf[0] = '%';
3742 /* Warn about @ where they meant $. */
3743 if (ckWARN(WARN_SYNTAX)) {
3744 if (*s == '[' || *s == '{') {
3746 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3748 if (*t == '}' || *t == ']') {
3750 PL_bufptr = skipspace(PL_bufptr);
3751 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3752 "Scalar value %.*s better written as $%.*s",
3753 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3758 PL_pending_ident = '@';
3761 case '/': /* may be division, defined-or, or pattern */
3762 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3766 case '?': /* may either be conditional or pattern */
3767 if(PL_expect == XOPERATOR) {
3775 /* A // operator. */
3785 /* Disable warning on "study /blah/" */
3786 if (PL_oldoldbufptr == PL_last_uni
3787 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3788 || memNE(PL_last_uni, "study", 5)
3789 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3792 s = scan_pat(s,OP_MATCH);
3793 TERM(sublex_start());
3797 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3798 #ifdef PERL_STRICT_CR
3801 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3803 && (s == PL_linestart || s[-1] == '\n') )
3805 PL_lex_formbrack = 0;
3809 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3815 yylval.ival = OPf_SPECIAL;
3821 if (PL_expect != XOPERATOR)
3826 case '0': case '1': case '2': case '3': case '4':
3827 case '5': case '6': case '7': case '8': case '9':
3828 s = scan_num(s, &yylval);
3829 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3830 "### Saw number in '%s'\n", s);
3832 if (PL_expect == XOPERATOR)
3837 s = scan_str(s,FALSE,FALSE);
3838 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3839 "### Saw string before '%s'\n", s);
3841 if (PL_expect == XOPERATOR) {
3842 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3845 return REPORT(','); /* grandfather non-comma-format format */
3851 missingterm((char*)0);
3852 yylval.ival = OP_CONST;
3853 TERM(sublex_start());
3856 s = scan_str(s,FALSE,FALSE);
3857 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3858 "### Saw string before '%s'\n", s);
3860 if (PL_expect == XOPERATOR) {
3861 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3864 return REPORT(','); /* grandfather non-comma-format format */
3870 missingterm((char*)0);
3871 yylval.ival = OP_CONST;
3872 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3873 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3874 yylval.ival = OP_STRINGIFY;
3878 TERM(sublex_start());
3881 s = scan_str(s,FALSE,FALSE);
3882 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3883 "### Saw backtick string before '%s'\n", s);
3885 if (PL_expect == XOPERATOR)
3886 no_op("Backticks",s);
3888 missingterm((char*)0);
3889 yylval.ival = OP_BACKTICK;
3891 TERM(sublex_start());
3895 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3896 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3898 if (PL_expect == XOPERATOR)
3899 no_op("Backslash",s);
3903 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3907 while (isDIGIT(*start) || *start == '_')
3909 if (*start == '.' && isDIGIT(start[1])) {
3910 s = scan_num(s, &yylval);
3913 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3914 else if (!isALPHA(*start) && (PL_expect == XTERM
3915 || PL_expect == XREF || PL_expect == XSTATE
3916 || PL_expect == XTERMORDORDOR)) {
3920 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3923 s = scan_num(s, &yylval);
3930 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3970 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3972 /* Some keywords can be followed by any delimiter, including ':' */
3973 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3974 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3975 (PL_tokenbuf[0] == 'q' &&
3976 strchr("qwxr", PL_tokenbuf[1])))));
3978 /* x::* is just a word, unless x is "CORE" */
3979 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3983 while (d < PL_bufend && isSPACE(*d))
3984 d++; /* no comments skipped here, or s### is misparsed */
3986 /* Is this a label? */
3987 if (!tmp && PL_expect == XSTATE
3988 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3990 yylval.pval = savepv(PL_tokenbuf);
3995 /* Check for keywords */
3996 tmp = keyword(PL_tokenbuf, len);
3998 /* Is this a word before a => operator? */
3999 if (*d == '=' && d[1] == '>') {
4001 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
4002 yylval.opval->op_private = OPpCONST_BARE;
4003 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4004 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4008 if (tmp < 0) { /* second-class keyword? */
4009 GV *ogv = Nullgv; /* override (winner) */
4010 GV *hgv = Nullgv; /* hidden (loser) */
4011 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
4013 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
4016 if (GvIMPORTED_CV(gv))
4018 else if (! CvMETHOD(cv))
4022 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
4023 (gv = *gvp) != (GV*)&PL_sv_undef &&
4024 GvCVu(gv) && GvIMPORTED_CV(gv))
4031 tmp = 0; /* overridden by import or by GLOBAL */
4034 && -tmp==KEY_lock /* XXX generalizable kludge */
4036 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
4038 tmp = 0; /* any sub overrides "weak" keyword */
4043 && PL_expect != XOPERATOR
4044 && PL_expect != XTERMORDORDOR)
4046 /* any sub overrides the "err" keyword, except when really an
4047 * operator is expected */
4050 else { /* no override */
4052 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
4053 Perl_warner(aTHX_ packWARN(WARN_MISC),
4054 "dump() better written as CORE::dump()");
4058 if (ckWARN(WARN_AMBIGUOUS) && hgv
4059 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
4060 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4061 "Ambiguous call resolved as CORE::%s(), %s",
4062 GvENAME(hgv), "qualify as such or use &");
4069 default: /* not a keyword */
4073 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
4075 /* Get the rest if it looks like a package qualifier */
4077 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
4079 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
4082 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
4083 *s == '\'' ? "'" : "::");
4088 if (PL_expect == XOPERATOR) {
4089 if (PL_bufptr == PL_linestart) {
4090 CopLINE_dec(PL_curcop);
4091 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
4092 CopLINE_inc(PL_curcop);
4095 no_op("Bareword",s);
4098 /* Look for a subroutine with this name in current package,
4099 unless name is "Foo::", in which case Foo is a bearword
4100 (and a package name). */
4103 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
4105 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
4106 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
4107 "Bareword \"%s\" refers to nonexistent package",
4110 PL_tokenbuf[len] = '\0';
4117 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
4120 /* if we saw a global override before, get the right name */
4123 sv = newSVpvn("CORE::GLOBAL::",14);
4124 sv_catpv(sv,PL_tokenbuf);
4127 sv = newSVpv(PL_tokenbuf,0);
4129 /* Presume this is going to be a bareword of some sort. */
4132 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
4133 yylval.opval->op_private = OPpCONST_BARE;
4134 /* UTF-8 package name? */
4135 if (UTF && !IN_BYTES &&
4136 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
4139 /* And if "Foo::", then that's what it certainly is. */
4144 /* See if it's the indirect object for a list operator. */
4146 if (PL_oldoldbufptr &&
4147 PL_oldoldbufptr < PL_bufptr &&
4148 (PL_oldoldbufptr == PL_last_lop
4149 || PL_oldoldbufptr == PL_last_uni) &&
4150 /* NO SKIPSPACE BEFORE HERE! */
4151 (PL_expect == XREF ||
4152 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4154 bool immediate_paren = *s == '(';
4156 /* (Now we can afford to cross potential line boundary.) */
4159 /* Two barewords in a row may indicate method call. */
4161 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4164 /* If not a declared subroutine, it's an indirect object. */
4165 /* (But it's an indir obj regardless for sort.) */
4167 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4168 ((!gv || !GvCVu(gv)) &&
4169 (PL_last_lop_op != OP_MAPSTART &&
4170 PL_last_lop_op != OP_GREPSTART))))
4172 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4177 PL_expect = XOPERATOR;
4180 /* Is this a word before a => operator? */
4181 if (*s == '=' && s[1] == '>' && !pkgname) {
4183 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4184 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4185 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4189 /* If followed by a paren, it's certainly a subroutine. */
4192 if (gv && GvCVu(gv)) {
4193 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4194 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4199 PL_nextval[PL_nexttoke].opval = yylval.opval;
4200 PL_expect = XOPERATOR;
4206 /* If followed by var or block, call it a method (unless sub) */
4208 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4209 PL_last_lop = PL_oldbufptr;
4210 PL_last_lop_op = OP_METHOD;
4214 /* If followed by a bareword, see if it looks like indir obj. */
4217 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4218 && (tmp = intuit_method(s,gv)))
4221 /* Not a method, so call it a subroutine (if defined) */
4223 if (gv && GvCVu(gv)) {
4225 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4226 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4227 "Ambiguous use of -%s resolved as -&%s()",
4228 PL_tokenbuf, PL_tokenbuf);
4229 /* Check for a constant sub */
4231 if ((sv = cv_const_sv(cv))) {
4233 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4234 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4235 yylval.opval->op_private = 0;
4239 /* Resolve to GV now. */
4240 op_free(yylval.opval);
4241 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4242 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4243 PL_last_lop = PL_oldbufptr;
4244 PL_last_lop_op = OP_ENTERSUB;
4245 /* Is there a prototype? */
4248 char *proto = SvPV((SV*)cv, len);
4251 if (strEQ(proto, "$"))
4253 while (*proto == ';')
4255 if (*proto == '&' && *s == '{') {
4256 sv_setpv(PL_subname, PL_curstash ?
4257 "__ANON__" : "__ANON__::__ANON__");
4261 PL_nextval[PL_nexttoke].opval = yylval.opval;
4267 /* Call it a bare word */
4269 if (PL_hints & HINT_STRICT_SUBS)
4270 yylval.opval->op_private |= OPpCONST_STRICT;
4273 if (ckWARN(WARN_RESERVED)) {
4274 if (lastchar != '-') {
4275 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4276 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4277 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4284 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4285 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4286 "Operator or semicolon missing before %c%s",
4287 lastchar, PL_tokenbuf);
4288 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4289 "Ambiguous use of %c resolved as operator %c",
4290 lastchar, lastchar);
4296 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4297 newSVpv(CopFILE(PL_curcop),0));
4301 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4302 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4305 case KEY___PACKAGE__:
4306 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4308 ? newSVsv(PL_curstname)
4317 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4318 char *pname = "main";
4319 if (PL_tokenbuf[2] == 'D')
4320 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4321 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4324 GvIOp(gv) = newIO();
4325 IoIFP(GvIOp(gv)) = PL_rsfp;
4326 #if defined(HAS_FCNTL) && defined(F_SETFD)
4328 int fd = PerlIO_fileno(PL_rsfp);
4329 fcntl(fd,F_SETFD,fd >= 3);
4332 /* Mark this internal pseudo-handle as clean */
4333 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4335 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4336 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4337 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4339 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4340 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4341 /* if the script was opened in binmode, we need to revert
4342 * it to text mode for compatibility; but only iff it has CRs
4343 * XXX this is a questionable hack at best. */
4344 if (PL_bufend-PL_bufptr > 2
4345 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4348 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4349 loc = PerlIO_tell(PL_rsfp);
4350 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4353 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4355 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4356 #endif /* NETWARE */
4357 #ifdef PERLIO_IS_STDIO /* really? */
4358 # if defined(__BORLANDC__)
4359 /* XXX see note in do_binmode() */
4360 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4364 PerlIO_seek(PL_rsfp, loc, 0);
4368 #ifdef PERLIO_LAYERS
4371 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4372 else if (PL_encoding) {
4379 XPUSHs(PL_encoding);
4381 call_method("name", G_SCALAR);
4385 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4386 Perl_form(aTHX_ ":encoding(%"SVf")",
4404 if (PL_expect == XSTATE) {
4411 if (*s == ':' && s[1] == ':') {
4414 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4415 if (!(tmp = keyword(PL_tokenbuf, len)))
4416 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4430 LOP(OP_ACCEPT,XTERM);
4436 LOP(OP_ATAN2,XTERM);
4442 LOP(OP_BINMODE,XTERM);
4445 LOP(OP_BLESS,XTERM);
4454 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4471 if (!PL_cryptseen) {
4472 PL_cryptseen = TRUE;
4476 LOP(OP_CRYPT,XTERM);
4479 LOP(OP_CHMOD,XTERM);
4482 LOP(OP_CHOWN,XTERM);
4485 LOP(OP_CONNECT,XTERM);
4501 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4505 PL_hints |= HINT_BLOCK_SCOPE;
4515 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4516 LOP(OP_DBMOPEN,XTERM);
4522 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4529 yylval.ival = CopLINE(PL_curcop);
4543 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4544 UNIBRACK(OP_ENTEREVAL);
4562 case KEY_endhostent:
4568 case KEY_endservent:
4571 case KEY_endprotoent:
4582 yylval.ival = CopLINE(PL_curcop);
4584 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4586 if ((PL_bufend - p) >= 3 &&
4587 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4589 else if ((PL_bufend - p) >= 4 &&
4590 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4593 if (isIDFIRST_lazy_if(p,UTF)) {
4594 p = scan_ident(p, PL_bufend,
4595 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4599 Perl_croak(aTHX_ "Missing $ on loop variable");
4604 LOP(OP_FORMLINE,XTERM);
4610 LOP(OP_FCNTL,XTERM);
4616 LOP(OP_FLOCK,XTERM);
4625 LOP(OP_GREPSTART, XREF);
4628 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4643 case KEY_getpriority:
4644 LOP(OP_GETPRIORITY,XTERM);
4646 case KEY_getprotobyname:
4649 case KEY_getprotobynumber:
4650 LOP(OP_GPBYNUMBER,XTERM);
4652 case KEY_getprotoent:
4664 case KEY_getpeername:
4665 UNI(OP_GETPEERNAME);
4667 case KEY_gethostbyname:
4670 case KEY_gethostbyaddr:
4671 LOP(OP_GHBYADDR,XTERM);
4673 case KEY_gethostent:
4676 case KEY_getnetbyname:
4679 case KEY_getnetbyaddr:
4680 LOP(OP_GNBYADDR,XTERM);
4685 case KEY_getservbyname:
4686 LOP(OP_GSBYNAME,XTERM);
4688 case KEY_getservbyport:
4689 LOP(OP_GSBYPORT,XTERM);
4691 case KEY_getservent:
4694 case KEY_getsockname:
4695 UNI(OP_GETSOCKNAME);
4697 case KEY_getsockopt:
4698 LOP(OP_GSOCKOPT,XTERM);
4720 yylval.ival = CopLINE(PL_curcop);
4724 LOP(OP_INDEX,XTERM);
4730 LOP(OP_IOCTL,XTERM);
4742 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4774 LOP(OP_LISTEN,XTERM);
4783 s = scan_pat(s,OP_MATCH);
4784 TERM(sublex_start());
4787 LOP(OP_MAPSTART, XREF);
4790 LOP(OP_MKDIR,XTERM);
4793 LOP(OP_MSGCTL,XTERM);
4796 LOP(OP_MSGGET,XTERM);
4799 LOP(OP_MSGRCV,XTERM);
4802 LOP(OP_MSGSND,XTERM);
4808 if (isIDFIRST_lazy_if(s,UTF)) {
4809 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4810 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4812 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4813 if (!PL_in_my_stash) {
4816 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4824 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4831 if (PL_expect != XSTATE)
4832 yyerror("\"no\" not allowed in expression");
4833 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4834 s = force_version(s, FALSE);
4839 if (*s == '(' || (s = skipspace(s), *s == '('))
4846 if (isIDFIRST_lazy_if(s,UTF)) {
4848 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4849 for (t=d; *t && isSPACE(*t); t++) ;
4850 if ( *t && strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4852 && !(t[0] == '=' && t[1] == '>')
4854 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4855 "Precedence problem: open %.*s should be open(%.*s)",
4856 d - s, s, d - s, s);
4862 yylval.ival = OP_OR;
4872 LOP(OP_OPEN_DIR,XTERM);
4875 checkcomma(s,PL_tokenbuf,"filehandle");
4879 checkcomma(s,PL_tokenbuf,"filehandle");
4898 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4902 LOP(OP_PIPE_OP,XTERM);
4905 s = scan_str(s,FALSE,FALSE);
4907 missingterm((char*)0);
4908 yylval.ival = OP_CONST;
4909 TERM(sublex_start());
4915 s = scan_str(s,FALSE,FALSE);
4917 missingterm((char*)0);
4919 if (SvCUR(PL_lex_stuff)) {
4922 d = SvPV_force(PL_lex_stuff, len);
4925 for (; isSPACE(*d) && len; --len, ++d) ;
4928 if (!warned && ckWARN(WARN_QW)) {
4929 for (; !isSPACE(*d) && len; --len, ++d) {
4931 Perl_warner(aTHX_ packWARN(WARN_QW),
4932 "Possible attempt to separate words with commas");
4935 else if (*d == '#') {
4936 Perl_warner(aTHX_ packWARN(WARN_QW),
4937 "Possible attempt to put comments in qw() list");
4943 for (; !isSPACE(*d) && len; --len, ++d) ;
4945 sv = newSVpvn(b, d-b);
4946 if (DO_UTF8(PL_lex_stuff))
4948 words = append_elem(OP_LIST, words,
4949 newSVOP(OP_CONST, 0, tokeq(sv)));
4953 PL_nextval[PL_nexttoke].opval = words;
4958 SvREFCNT_dec(PL_lex_stuff);
4959 PL_lex_stuff = Nullsv;
4965 s = scan_str(s,FALSE,FALSE);
4967 missingterm((char*)0);
4968 yylval.ival = OP_STRINGIFY;
4969 if (SvIVX(PL_lex_stuff) == '\'')
4970 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4971 TERM(sublex_start());
4974 s = scan_pat(s,OP_QR);
4975 TERM(sublex_start());
4978 s = scan_str(s,FALSE,FALSE);
4980 missingterm((char*)0);
4981 yylval.ival = OP_BACKTICK;
4983 TERM(sublex_start());
4991 s = force_version(s, FALSE);
4993 else if (*s != 'v' || !isDIGIT(s[1])
4994 || (s = force_version(s, TRUE), *s == 'v'))
4996 *PL_tokenbuf = '\0';
4997 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4998 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4999 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
5001 yyerror("<> should be quotes");
5009 s = force_word(s,WORD,TRUE,FALSE,FALSE);
5013 LOP(OP_RENAME,XTERM);
5022 LOP(OP_RINDEX,XTERM);
5032 UNIDOR(OP_READLINE);
5045 LOP(OP_REVERSE,XTERM);
5048 UNIDOR(OP_READLINK);
5056 TERM(sublex_start());
5058 TOKEN(1); /* force error */
5067 LOP(OP_SELECT,XTERM);
5073 LOP(OP_SEMCTL,XTERM);
5076 LOP(OP_SEMGET,XTERM);
5079 LOP(OP_SEMOP,XTERM);
5085 LOP(OP_SETPGRP,XTERM);
5087 case KEY_setpriority:
5088 LOP(OP_SETPRIORITY,XTERM);
5090 case KEY_sethostent:
5096 case KEY_setservent:
5099 case KEY_setprotoent:
5109 LOP(OP_SEEKDIR,XTERM);
5111 case KEY_setsockopt:
5112 LOP(OP_SSOCKOPT,XTERM);
5118 LOP(OP_SHMCTL,XTERM);
5121 LOP(OP_SHMGET,XTERM);
5124 LOP(OP_SHMREAD,XTERM);
5127 LOP(OP_SHMWRITE,XTERM);
5130 LOP(OP_SHUTDOWN,XTERM);
5139 LOP(OP_SOCKET,XTERM);
5141 case KEY_socketpair:
5142 LOP(OP_SOCKPAIR,XTERM);
5145 checkcomma(s,PL_tokenbuf,"subroutine name");
5147 if (*s == ';' || *s == ')') /* probably a close */
5148 Perl_croak(aTHX_ "sort is now a reserved word");
5150 s = force_word(s,WORD,TRUE,TRUE,FALSE);
5154 LOP(OP_SPLIT,XTERM);
5157 LOP(OP_SPRINTF,XTERM);
5160 LOP(OP_SPLICE,XTERM);
5175 LOP(OP_SUBSTR,XTERM);
5181 char tmpbuf[sizeof PL_tokenbuf];
5182 SSize_t tboffset = 0;
5183 expectation attrful;
5184 bool have_name, have_proto, bad_proto;
5189 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5190 (*s == ':' && s[1] == ':'))
5193 attrful = XATTRBLOCK;
5194 /* remember buffer pos'n for later force_word */
5195 tboffset = s - PL_oldbufptr;
5196 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5197 if (strchr(tmpbuf, ':'))
5198 sv_setpv(PL_subname, tmpbuf);
5200 sv_setsv(PL_subname,PL_curstname);
5201 sv_catpvn(PL_subname,"::",2);
5202 sv_catpvn(PL_subname,tmpbuf,len);
5209 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5210 PL_expect = XTERMBLOCK;
5211 attrful = XATTRTERM;
5212 sv_setpv(PL_subname,"?");
5216 if (key == KEY_format) {
5218 PL_lex_formbrack = PL_lex_brackets + 1;
5220 (void) force_word(PL_oldbufptr + tboffset, WORD,
5225 /* Look for a prototype */
5229 s = scan_str(s,FALSE,FALSE);
5231 Perl_croak(aTHX_ "Prototype not terminated");
5232 /* strip spaces and check for bad characters */
5233 d = SvPVX(PL_lex_stuff);
5236 for (p = d; *p; ++p) {
5239 if (!strchr("$@%*;[]&\\", *p))
5244 if (bad_proto && ckWARN(WARN_SYNTAX))
5245 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5246 "Illegal character in prototype for %"SVf" : %s",
5248 SvCUR(PL_lex_stuff) = tmp;
5256 if (*s == ':' && s[1] != ':')
5257 PL_expect = attrful;
5258 else if (*s != '{' && key == KEY_sub) {
5260 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5262 Perl_croak(aTHX_ "Illegal declaration of subroutine %"SVf, PL_subname);
5266 PL_nextval[PL_nexttoke].opval =
5267 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5268 PL_lex_stuff = Nullsv;
5272 sv_setpv(PL_subname,
5273 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5276 (void) force_word(PL_oldbufptr + tboffset, WORD,
5285 LOP(OP_SYSTEM,XREF);
5288 LOP(OP_SYMLINK,XTERM);
5291 LOP(OP_SYSCALL,XTERM);
5294 LOP(OP_SYSOPEN,XTERM);
5297 LOP(OP_SYSSEEK,XTERM);
5300 LOP(OP_SYSREAD,XTERM);
5303 LOP(OP_SYSWRITE,XTERM);
5307 TERM(sublex_start());
5328 LOP(OP_TRUNCATE,XTERM);
5340 yylval.ival = CopLINE(PL_curcop);
5344 yylval.ival = CopLINE(PL_curcop);
5348 LOP(OP_UNLINK,XTERM);
5354 LOP(OP_UNPACK,XTERM);
5357 LOP(OP_UTIME,XTERM);
5363 LOP(OP_UNSHIFT,XTERM);
5366 if (PL_expect != XSTATE)
5367 yyerror("\"use\" not allowed in expression");
5369 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5370 s = force_version(s, TRUE);
5371 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5372 PL_nextval[PL_nexttoke].opval = Nullop;
5375 else if (*s == 'v') {
5376 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5377 s = force_version(s, FALSE);
5381 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5382 s = force_version(s, FALSE);
5394 yylval.ival = CopLINE(PL_curcop);
5398 PL_hints |= HINT_BLOCK_SCOPE;
5405 LOP(OP_WAITPID,XTERM);
5414 ctl_l[0] = toCTRL('L');
5416 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5419 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5424 if (PL_expect == XOPERATOR)
5430 yylval.ival = OP_XOR;
5435 TERM(sublex_start());
5440 #pragma segment Main
5444 S_pending_ident(pTHX)
5447 register I32 tmp = 0;
5448 /* pit holds the identifier we read and pending_ident is reset */
5449 char pit = PL_pending_ident;
5450 PL_pending_ident = 0;
5452 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5453 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5455 /* if we're in a my(), we can't allow dynamics here.
5456 $foo'bar has already been turned into $foo::bar, so
5457 just check for colons.
5459 if it's a legal name, the OP is a PADANY.
5462 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5463 if (strchr(PL_tokenbuf,':'))
5464 yyerror(Perl_form(aTHX_ "No package name allowed for "
5465 "variable %s in \"our\"",
5467 tmp = allocmy(PL_tokenbuf);
5470 if (strchr(PL_tokenbuf,':'))
5471 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5473 yylval.opval = newOP(OP_PADANY, 0);
5474 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5480 build the ops for accesses to a my() variable.
5482 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5483 then used in a comparison. This catches most, but not
5484 all cases. For instance, it catches
5485 sort { my($a); $a <=> $b }
5487 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5488 (although why you'd do that is anyone's guess).
5491 if (!strchr(PL_tokenbuf,':')) {
5493 tmp = pad_findmy(PL_tokenbuf);
5494 if (tmp != NOT_IN_PAD) {
5495 /* might be an "our" variable" */
5496 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5497 /* build ops for a bareword */
5498 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5499 sv_catpvn(sym, "::", 2);
5500 sv_catpv(sym, PL_tokenbuf+1);
5501 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5502 yylval.opval->op_private = OPpCONST_ENTERED;
5503 gv_fetchpv(SvPVX(sym),
5505 ? (GV_ADDMULTI | GV_ADDINEVAL)
5508 ((PL_tokenbuf[0] == '$') ? SVt_PV
5509 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5514 /* if it's a sort block and they're naming $a or $b */
5515 if (PL_last_lop_op == OP_SORT &&
5516 PL_tokenbuf[0] == '$' &&
5517 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5520 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5521 d < PL_bufend && *d != '\n';
5524 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5525 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5531 yylval.opval = newOP(OP_PADANY, 0);
5532 yylval.opval->op_targ = tmp;
5538 Whine if they've said @foo in a doublequoted string,
5539 and @foo isn't a variable we can find in the symbol
5542 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5543 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5544 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5545 && ckWARN(WARN_AMBIGUOUS))
5547 /* Downgraded from fatal to warning 20000522 mjd */
5548 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5549 "Possible unintended interpolation of %s in string",
5554 /* build ops for a bareword */
5555 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5556 yylval.opval->op_private = OPpCONST_ENTERED;
5557 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5558 ((PL_tokenbuf[0] == '$') ? SVt_PV
5559 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5565 Perl_keyword(pTHX_ register char *d, I32 len)
5570 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5571 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5572 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5573 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5574 if (strEQ(d,"__END__")) return KEY___END__;
5578 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5583 if (strEQ(d,"and")) return -KEY_and;
5584 if (strEQ(d,"abs")) return -KEY_abs;
5587 if (strEQ(d,"alarm")) return -KEY_alarm;
5588 if (strEQ(d,"atan2")) return -KEY_atan2;
5591 if (strEQ(d,"accept")) return -KEY_accept;
5596 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5599 if (strEQ(d,"bless")) return -KEY_bless;
5600 if (strEQ(d,"bind")) return -KEY_bind;
5601 if (strEQ(d,"binmode")) return -KEY_binmode;
5604 if (strEQ(d,"CORE")) return -KEY_CORE;
5605 if (strEQ(d,"CHECK")) return KEY_CHECK;
5610 if (strEQ(d,"cmp")) return -KEY_cmp;
5611 if (strEQ(d,"chr")) return -KEY_chr;
5612 if (strEQ(d,"cos")) return -KEY_cos;
5615 if (strEQ(d,"chop")) return -KEY_chop;
5618 if (strEQ(d,"close")) return -KEY_close;
5619 if (strEQ(d,"chdir")) return -KEY_chdir;
5620 if (strEQ(d,"chomp")) return -KEY_chomp;
5621 if (strEQ(d,"chmod")) return -KEY_chmod;
5622 if (strEQ(d,"chown")) return -KEY_chown;
5623 if (strEQ(d,"crypt")) return -KEY_crypt;
5626 if (strEQ(d,"chroot")) return -KEY_chroot;
5627 if (strEQ(d,"caller")) return -KEY_caller;
5630 if (strEQ(d,"connect")) return -KEY_connect;
5633 if (strEQ(d,"closedir")) return -KEY_closedir;
5634 if (strEQ(d,"continue")) return -KEY_continue;
5639 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5644 if (strEQ(d,"do")) return KEY_do;
5647 if (strEQ(d,"die")) return -KEY_die;
5650 if (strEQ(d,"dump")) return -KEY_dump;
5653 if (strEQ(d,"delete")) return KEY_delete;
5656 if (strEQ(d,"defined")) return KEY_defined;
5657 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5660 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5665 if (strEQ(d,"END")) return KEY_END;
5670 if (strEQ(d,"eq")) return -KEY_eq;
5673 if (strEQ(d,"eof")) return -KEY_eof;
5674 if (strEQ(d,"err")) return -KEY_err;
5675 if (strEQ(d,"exp")) return -KEY_exp;
5678 if (strEQ(d,"else")) return KEY_else;
5679 if (strEQ(d,"exit")) return -KEY_exit;
5680 if (strEQ(d,"eval")) return KEY_eval;
5681 if (strEQ(d,"exec")) return -KEY_exec;
5682 if (strEQ(d,"each")) return -KEY_each;
5685 if (strEQ(d,"elsif")) return KEY_elsif;
5688 if (strEQ(d,"exists")) return KEY_exists;
5689 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5690 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5691 "elseif should be elsif");
5694 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5695 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5698 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5701 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5702 if (strEQ(d,"endservent")) return -KEY_endservent;
5705 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5712 if (strEQ(d,"for")) return KEY_for;
5715 if (strEQ(d,"fork")) return -KEY_fork;
5718 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5719 if (strEQ(d,"flock")) return -KEY_flock;
5722 if (strEQ(d,"format")) return KEY_format;
5723 if (strEQ(d,"fileno")) return -KEY_fileno;
5726 if (strEQ(d,"foreach")) return KEY_foreach;
5729 if (strEQ(d,"formline")) return -KEY_formline;
5734 if (strnEQ(d,"get",3)) {
5739 if (strEQ(d,"ppid")) return -KEY_getppid;
5740 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5743 if (strEQ(d,"pwent")) return -KEY_getpwent;
5744 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5745 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5748 if (strEQ(d,"peername")) return -KEY_getpeername;
5749 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5750 if (strEQ(d,"priority")) return -KEY_getpriority;
5753 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5756 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5760 else if (*d == 'h') {
5761 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5762 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5763 if (strEQ(d,"hostent")) return -KEY_gethostent;
5765 else if (*d == 'n') {
5766 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5767 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5768 if (strEQ(d,"netent")) return -KEY_getnetent;
5770 else if (*d == 's') {
5771 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5772 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5773 if (strEQ(d,"servent")) return -KEY_getservent;
5774 if (strEQ(d,"sockname")) return -KEY_getsockname;
5775 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5777 else if (*d == 'g') {
5778 if (strEQ(d,"grent")) return -KEY_getgrent;
5779 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5780 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5782 else if (*d == 'l') {
5783 if (strEQ(d,"login")) return -KEY_getlogin;
5785 else if (strEQ(d,"c")) return -KEY_getc;
5790 if (strEQ(d,"gt")) return -KEY_gt;
5791 if (strEQ(d,"ge")) return -KEY_ge;
5794 if (strEQ(d,"grep")) return KEY_grep;
5795 if (strEQ(d,"goto")) return KEY_goto;
5796 if (strEQ(d,"glob")) return KEY_glob;
5799 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5804 if (strEQ(d,"hex")) return -KEY_hex;
5807 if (strEQ(d,"INIT")) return KEY_INIT;
5812 if (strEQ(d,"if")) return KEY_if;
5815 if (strEQ(d,"int")) return -KEY_int;
5818 if (strEQ(d,"index")) return -KEY_index;
5819 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5824 if (strEQ(d,"join")) return -KEY_join;
5828 if (strEQ(d,"keys")) return -KEY_keys;
5829 if (strEQ(d,"kill")) return -KEY_kill;
5835 if (strEQ(d,"lt")) return -KEY_lt;
5836 if (strEQ(d,"le")) return -KEY_le;
5837 if (strEQ(d,"lc")) return -KEY_lc;
5840 if (strEQ(d,"log")) return -KEY_log;
5843 if (strEQ(d,"last")) return KEY_last;
5844 if (strEQ(d,"link")) return -KEY_link;
5845 if (strEQ(d,"lock")) return -KEY_lock;
5848 if (strEQ(d,"local")) return KEY_local;
5849 if (strEQ(d,"lstat")) return -KEY_lstat;
5852 if (strEQ(d,"length")) return -KEY_length;
5853 if (strEQ(d,"listen")) return -KEY_listen;
5856 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5859 if (strEQ(d,"localtime")) return -KEY_localtime;
5865 case 1: return KEY_m;
5867 if (strEQ(d,"my")) return KEY_my;
5870 if (strEQ(d,"map")) return KEY_map;
5873 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5876 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5877 if (strEQ(d,"msgget")) return -KEY_msgget;
5878 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5879 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5884 if (strEQ(d,"next")) return KEY_next;
5885 if (strEQ(d,"ne")) return -KEY_ne;
5886 if (strEQ(d,"not")) return -KEY_not;
5887 if (strEQ(d,"no")) return KEY_no;
5892 if (strEQ(d,"or")) return -KEY_or;
5895 if (strEQ(d,"ord")) return -KEY_ord;
5896 if (strEQ(d,"oct")) return -KEY_oct;
5897 if (strEQ(d,"our")) return KEY_our;
5900 if (strEQ(d,"open")) return -KEY_open;
5903 if (strEQ(d,"opendir")) return -KEY_opendir;
5910 if (strEQ(d,"pop")) return -KEY_pop;
5911 if (strEQ(d,"pos")) return KEY_pos;
5914 if (strEQ(d,"push")) return -KEY_push;
5915 if (strEQ(d,"pack")) return -KEY_pack;
5916 if (strEQ(d,"pipe")) return -KEY_pipe;
5919 if (strEQ(d,"print")) return KEY_print;
5922 if (strEQ(d,"printf")) return KEY_printf;
5925 if (strEQ(d,"package")) return KEY_package;
5928 if (strEQ(d,"prototype")) return KEY_prototype;
5933 if (strEQ(d,"q")) return KEY_q;
5934 if (strEQ(d,"qr")) return KEY_qr;
5935 if (strEQ(d,"qq")) return KEY_qq;
5936 if (strEQ(d,"qw")) return KEY_qw;
5937 if (strEQ(d,"qx")) return KEY_qx;
5939 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5944 if (strEQ(d,"ref")) return -KEY_ref;
5947 if (strEQ(d,"read")) return -KEY_read;
5948 if (strEQ(d,"rand")) return -KEY_rand;
5949 if (strEQ(d,"recv")) return -KEY_recv;
5950 if (strEQ(d,"redo")) return KEY_redo;
5953 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5954 if (strEQ(d,"reset")) return -KEY_reset;
5957 if (strEQ(d,"return")) return KEY_return;
5958 if (strEQ(d,"rename")) return -KEY_rename;
5959 if (strEQ(d,"rindex")) return -KEY_rindex;
5962 if (strEQ(d,"require")) return KEY_require;
5963 if (strEQ(d,"reverse")) return -KEY_reverse;
5964 if (strEQ(d,"readdir")) return -KEY_readdir;
5967 if (strEQ(d,"readlink")) return -KEY_readlink;
5968 if (strEQ(d,"readline")) return -KEY_readline;
5969 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5972 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5978 case 0: return KEY_s;
5980 if (strEQ(d,"scalar")) return KEY_scalar;
5985 if (strEQ(d,"seek")) return -KEY_seek;
5986 if (strEQ(d,"send")) return -KEY_send;
5989 if (strEQ(d,"semop")) return -KEY_semop;
5992 if (strEQ(d,"select")) return -KEY_select;
5993 if (strEQ(d,"semctl")) return -KEY_semctl;
5994 if (strEQ(d,"semget")) return -KEY_semget;
5997 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5998 if (strEQ(d,"seekdir")) return -KEY_seekdir;
6001 if (strEQ(d,"setpwent")) return -KEY_setpwent;
6002 if (strEQ(d,"setgrent")) return -KEY_setgrent;
6005 if (strEQ(d,"setnetent")) return -KEY_setnetent;
6008 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
6009 if (strEQ(d,"sethostent")) return -KEY_sethostent;
6010 if (strEQ(d,"setservent")) return -KEY_setservent;
6013 if (strEQ(d,"setpriority")) return -KEY_setpriority;
6014 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
6021 if (strEQ(d,"shift")) return -KEY_shift;
6024 if (strEQ(d,"shmctl")) return -KEY_shmctl;
6025 if (strEQ(d,"shmget")) return -KEY_shmget;
6028 if (strEQ(d,"shmread")) return -KEY_shmread;
6031 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
6032 if (strEQ(d,"shutdown")) return -KEY_shutdown;
6037 if (strEQ(d,"sin")) return -KEY_sin;
6040 if (strEQ(d,"sleep")) return -KEY_sleep;
6043 if (strEQ(d,"sort")) return KEY_sort;
6044 if (strEQ(d,"socket")) return -KEY_socket;
6045 if (strEQ(d,"socketpair")) return -KEY_socketpair;
6048 if (strEQ(d,"split")) return KEY_split;
6049 if (strEQ(d,"sprintf")) return -KEY_sprintf;
6050 if (strEQ(d,"splice")) return -KEY_splice;
6053 if (strEQ(d,"sqrt")) return -KEY_sqrt;
6056 if (strEQ(d,"srand")) return -KEY_srand;
6059 if (strEQ(d,"stat")) return -KEY_stat;
6060 if (strEQ(d,"study")) return KEY_study;
6063 if (strEQ(d,"substr")) return -KEY_substr;
6064 if (strEQ(d,"sub")) return KEY_sub;
6069 if (strEQ(d,"system")) return -KEY_system;
6072 if (strEQ(d,"symlink")) return -KEY_symlink;
6073 if (strEQ(d,"syscall")) return -KEY_syscall;
6074 if (strEQ(d,"sysopen")) return -KEY_sysopen;
6075 if (strEQ(d,"sysread")) return -KEY_sysread;
6076 if (strEQ(d,"sysseek")) return -KEY_sysseek;
6079 if (strEQ(d,"syswrite")) return -KEY_syswrite;
6088 if (strEQ(d,"tr")) return KEY_tr;
6091 if (strEQ(d,"tie")) return KEY_tie;
6094 if (strEQ(d,"tell")) return -KEY_tell;
6095 if (strEQ(d,"tied")) return KEY_tied;
6096 if (strEQ(d,"time")) return -KEY_time;
6099 if (strEQ(d,"times")) return -KEY_times;
6102 if (strEQ(d,"telldir")) return -KEY_telldir;
6105 if (strEQ(d,"truncate")) return -KEY_truncate;
6112 if (strEQ(d,"uc")) return -KEY_uc;
6115 if (strEQ(d,"use")) return KEY_use;
6118 if (strEQ(d,"undef")) return KEY_undef;
6119 if (strEQ(d,"until")) return KEY_until;
6120 if (strEQ(d,"untie")) return KEY_untie;
6121 if (strEQ(d,"utime")) return -KEY_utime;
6122 if (strEQ(d,"umask")) return -KEY_umask;
6125 if (strEQ(d,"unless")) return KEY_unless;
6126 if (strEQ(d,"unpack")) return -KEY_unpack;
6127 if (strEQ(d,"unlink")) return -KEY_unlink;
6130 if (strEQ(d,"unshift")) return -KEY_unshift;
6131 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
6136 if (strEQ(d,"values")) return -KEY_values;
6137 if (strEQ(d,"vec")) return -KEY_vec;
6142 if (strEQ(d,"warn")) return -KEY_warn;
6143 if (strEQ(d,"wait")) return -KEY_wait;
6146 if (strEQ(d,"while")) return KEY_while;
6147 if (strEQ(d,"write")) return -KEY_write;
6150 if (strEQ(d,"waitpid")) return -KEY_waitpid;
6153 if (strEQ(d,"wantarray")) return -KEY_wantarray;
6158 if (len == 1) return -KEY_x;
6159 if (strEQ(d,"xor")) return -KEY_xor;
6162 if (len == 1) return KEY_y;
6171 S_checkcomma(pTHX_ register char *s, char *name, char *what)
6175 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
6176 if (ckWARN(WARN_SYNTAX)) {
6178 for (w = s+2; *w && level; w++) {
6185 for (; *w && isSPACE(*w); w++) ;
6186 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6187 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6188 "%s (...) interpreted as function",name);
6191 while (s < PL_bufend && isSPACE(*s))
6195 while (s < PL_bufend && isSPACE(*s))
6197 if (isIDFIRST_lazy_if(s,UTF)) {
6199 while (isALNUM_lazy_if(s,UTF))
6201 while (s < PL_bufend && isSPACE(*s))
6206 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6210 Perl_croak(aTHX_ "No comma allowed after %s", what);
6215 /* Either returns sv, or mortalizes sv and returns a new SV*.
6216 Best used as sv=new_constant(..., sv, ...).
6217 If s, pv are NULL, calls subroutine with one argument,
6218 and type is used with error messages only. */
6221 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6225 HV *table = GvHV(PL_hintgv); /* ^H */
6229 const char *why1, *why2, *why3;
6231 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6234 why2 = strEQ(key,"charnames")
6235 ? "(possibly a missing \"use charnames ...\")"
6237 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6238 (type ? type: "undef"), why2);
6240 /* This is convoluted and evil ("goto considered harmful")
6241 * but I do not understand the intricacies of all the different
6242 * failure modes of %^H in here. The goal here is to make
6243 * the most probable error message user-friendly. --jhi */
6248 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6249 (type ? type: "undef"), why1, why2, why3);
6251 yyerror(SvPVX(msg));
6255 cvp = hv_fetch(table, key, strlen(key), FALSE);
6256 if (!cvp || !SvOK(*cvp)) {
6259 why3 = "} is not defined";
6262 sv_2mortal(sv); /* Parent created it permanently */
6265 pv = sv_2mortal(newSVpvn(s, len));
6267 typesv = sv_2mortal(newSVpv(type, 0));
6269 typesv = &PL_sv_undef;
6271 PUSHSTACKi(PERLSI_OVERLOAD);
6283 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6287 /* Check the eval first */
6288 if (!PL_in_eval && SvTRUE(ERRSV)) {
6290 sv_catpv(ERRSV, "Propagated");
6291 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6293 res = SvREFCNT_inc(sv);
6297 (void)SvREFCNT_inc(res);
6306 why1 = "Call to &{$^H{";
6308 why3 = "}} did not return a defined value";
6317 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6319 register char *d = dest;
6320 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6323 Perl_croak(aTHX_ ident_too_long);
6324 if (isALNUM(*s)) /* UTF handled below */
6326 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6331 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6335 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6336 char *t = s + UTF8SKIP(s);
6337 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6339 if (d + (t - s) > e)
6340 Perl_croak(aTHX_ ident_too_long);
6341 Copy(s, d, t - s, char);
6354 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6364 e = d + destlen - 3; /* two-character token, ending NUL */
6366 while (isDIGIT(*s)) {
6368 Perl_croak(aTHX_ ident_too_long);
6375 Perl_croak(aTHX_ ident_too_long);
6376 if (isALNUM(*s)) /* UTF handled below */
6378 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6383 else if (*s == ':' && s[1] == ':') {
6387 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6388 char *t = s + UTF8SKIP(s);
6389 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6391 if (d + (t - s) > e)
6392 Perl_croak(aTHX_ ident_too_long);
6393 Copy(s, d, t - s, char);
6404 if (PL_lex_state != LEX_NORMAL)
6405 PL_lex_state = LEX_INTERPENDMAYBE;
6408 if (*s == '$' && s[1] &&
6409 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6422 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6427 if (isSPACE(s[-1])) {
6430 if (!SPACE_OR_TAB(ch)) {
6436 if (isIDFIRST_lazy_if(d,UTF)) {
6440 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6442 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6445 Copy(s, d, e - s, char);
6450 while ((isALNUM(*s) || *s == ':') && d < e)
6453 Perl_croak(aTHX_ ident_too_long);
6456 while (s < send && SPACE_OR_TAB(*s)) s++;
6457 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6458 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6459 const char *brack = *s == '[' ? "[...]" : "{...}";
6460 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6461 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6462 funny, dest, brack, funny, dest, brack);
6465 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6469 /* Handle extended ${^Foo} variables
6470 * 1999-02-27 mjd-perl-patch@plover.com */
6471 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6475 while (isALNUM(*s) && d < e) {
6479 Perl_croak(aTHX_ ident_too_long);
6484 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6485 PL_lex_state = LEX_INTERPEND;
6490 if (PL_lex_state == LEX_NORMAL) {
6491 if (ckWARN(WARN_AMBIGUOUS) &&
6492 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6494 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6495 "Ambiguous use of %c{%s} resolved to %c%s",
6496 funny, dest, funny, dest);
6501 s = bracket; /* let the parser handle it */
6505 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6506 PL_lex_state = LEX_INTERPEND;
6511 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6516 *pmfl |= PMf_GLOBAL;
6518 *pmfl |= PMf_CONTINUE;
6522 *pmfl |= PMf_MULTILINE;
6524 *pmfl |= PMf_SINGLELINE;
6526 *pmfl |= PMf_EXTENDED;
6530 S_scan_pat(pTHX_ char *start, I32 type)
6535 s = scan_str(start,FALSE,FALSE);
6537 Perl_croak(aTHX_ "Search pattern not terminated");
6539 pm = (PMOP*)newPMOP(type, 0);
6540 if (PL_multi_open == '?')
6541 pm->op_pmflags |= PMf_ONCE;
6543 while (*s && strchr("iomsx", *s))
6544 pmflag(&pm->op_pmflags,*s++);
6547 while (*s && strchr("iogcmsx", *s))
6548 pmflag(&pm->op_pmflags,*s++);
6550 /* issue a warning if /c is specified,but /g is not */
6551 if (ckWARN(WARN_REGEXP) &&
6552 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6554 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6557 pm->op_pmpermflags = pm->op_pmflags;
6559 PL_lex_op = (OP*)pm;
6560 yylval.ival = OP_MATCH;
6565 S_scan_subst(pTHX_ char *start)
6572 yylval.ival = OP_NULL;
6574 s = scan_str(start,FALSE,FALSE);
6577 Perl_croak(aTHX_ "Substitution pattern not terminated");
6579 if (s[-1] == PL_multi_open)
6582 first_start = PL_multi_start;
6583 s = scan_str(s,FALSE,FALSE);
6586 SvREFCNT_dec(PL_lex_stuff);
6587 PL_lex_stuff = Nullsv;
6589 Perl_croak(aTHX_ "Substitution replacement not terminated");
6591 PL_multi_start = first_start; /* so whole substitution is taken together */
6593 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6599 else if (strchr("iogcmsx", *s))
6600 pmflag(&pm->op_pmflags,*s++);
6605 /* /c is not meaningful with s/// */
6606 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6608 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6613 PL_sublex_info.super_bufptr = s;
6614 PL_sublex_info.super_bufend = PL_bufend;
6616 pm->op_pmflags |= PMf_EVAL;
6617 repl = newSVpvn("",0);
6619 sv_catpv(repl, es ? "eval " : "do ");
6620 sv_catpvn(repl, "{ ", 2);
6621 sv_catsv(repl, PL_lex_repl);
6622 sv_catpvn(repl, " };", 2);
6624 SvREFCNT_dec(PL_lex_repl);
6628 pm->op_pmpermflags = pm->op_pmflags;
6629 PL_lex_op = (OP*)pm;
6630 yylval.ival = OP_SUBST;
6635 S_scan_trans(pTHX_ char *start)
6644 yylval.ival = OP_NULL;
6646 s = scan_str(start,FALSE,FALSE);
6648 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6649 if (s[-1] == PL_multi_open)
6652 s = scan_str(s,FALSE,FALSE);
6655 SvREFCNT_dec(PL_lex_stuff);
6656 PL_lex_stuff = Nullsv;
6658 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6661 complement = del = squash = 0;
6662 while (strchr("cds", *s)) {
6664 complement = OPpTRANS_COMPLEMENT;
6666 del = OPpTRANS_DELETE;
6668 squash = OPpTRANS_SQUASH;
6672 New(803, tbl, complement&&!del?258:256, short);
6673 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6674 o->op_private &= ~OPpTRANS_ALL;
6675 o->op_private |= del|squash|complement|
6676 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6677 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6680 yylval.ival = OP_TRANS;
6685 S_scan_heredoc(pTHX_ register char *s)
6688 I32 op_type = OP_SCALAR;
6695 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6699 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6702 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6703 if (*peek && strchr("`'\"",*peek)) {
6706 s = delimcpy(d, e, s, PL_bufend, term, &len);
6716 if (!isALNUM_lazy_if(s,UTF))
6717 deprecate_old("bare << to mean <<\"\"");
6718 for (; isALNUM_lazy_if(s,UTF); s++) {
6723 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6724 Perl_croak(aTHX_ "Delimiter for here document is too long");
6727 len = d - PL_tokenbuf;
6728 #ifndef PERL_STRICT_CR
6729 d = strchr(s, '\r');
6733 while (s < PL_bufend) {
6739 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6748 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6753 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6754 herewas = newSVpvn(s,PL_bufend-s);
6756 s--, herewas = newSVpvn(s,d-s);
6757 s += SvCUR(herewas);
6759 tmpstr = NEWSV(87,79);
6760 sv_upgrade(tmpstr, SVt_PVIV);
6765 else if (term == '`') {
6766 op_type = OP_BACKTICK;
6767 SvIVX(tmpstr) = '\\';
6771 PL_multi_start = CopLINE(PL_curcop);
6772 PL_multi_open = PL_multi_close = '<';
6773 term = *PL_tokenbuf;
6774 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6775 char *bufptr = PL_sublex_info.super_bufptr;
6776 char *bufend = PL_sublex_info.super_bufend;
6777 char *olds = s - SvCUR(herewas);
6778 s = strchr(bufptr, '\n');
6782 while (s < bufend &&
6783 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6785 CopLINE_inc(PL_curcop);
6788 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6789 missingterm(PL_tokenbuf);
6791 sv_setpvn(herewas,bufptr,d-bufptr+1);
6792 sv_setpvn(tmpstr,d+1,s-d);
6794 sv_catpvn(herewas,s,bufend-s);
6795 Copy(SvPVX(herewas),bufptr,SvCUR(herewas) + 1,char);
6802 while (s < PL_bufend &&
6803 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6805 CopLINE_inc(PL_curcop);
6807 if (s >= PL_bufend) {
6808 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6809 missingterm(PL_tokenbuf);
6811 sv_setpvn(tmpstr,d+1,s-d);
6813 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6815 sv_catpvn(herewas,s,PL_bufend-s);
6816 sv_setsv(PL_linestr,herewas);
6817 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6818 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6819 PL_last_lop = PL_last_uni = Nullch;
6822 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6823 while (s >= PL_bufend) { /* multiple line string? */
6825 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6826 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6827 missingterm(PL_tokenbuf);
6829 CopLINE_inc(PL_curcop);
6830 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6831 PL_last_lop = PL_last_uni = Nullch;
6832 #ifndef PERL_STRICT_CR
6833 if (PL_bufend - PL_linestart >= 2) {
6834 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6835 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6837 PL_bufend[-2] = '\n';
6839 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6841 else if (PL_bufend[-1] == '\r')
6842 PL_bufend[-1] = '\n';
6844 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6845 PL_bufend[-1] = '\n';
6847 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6848 SV *sv = NEWSV(88,0);
6850 sv_upgrade(sv, SVt_PVMG);
6851 sv_setsv(sv,PL_linestr);
6854 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6856 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6857 STRLEN off = PL_bufend - 1 - SvPVX(PL_linestr);
6858 *(SvPVX(PL_linestr) + off ) = ' ';
6859 sv_catsv(PL_linestr,herewas);
6860 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6861 s = SvPVX(PL_linestr) + off; /* In case PV of PL_linestr moved. */
6865 sv_catsv(tmpstr,PL_linestr);
6870 PL_multi_end = CopLINE(PL_curcop);
6871 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6872 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6873 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6875 SvREFCNT_dec(herewas);
6877 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6879 else if (PL_encoding)
6880 sv_recode_to_utf8(tmpstr, PL_encoding);
6882 PL_lex_stuff = tmpstr;
6883 yylval.ival = op_type;
6888 takes: current position in input buffer
6889 returns: new position in input buffer
6890 side-effects: yylval and lex_op are set.
6895 <FH> read from filehandle
6896 <pkg::FH> read from package qualified filehandle
6897 <pkg'FH> read from package qualified filehandle
6898 <$fh> read from filehandle in $fh
6904 S_scan_inputsymbol(pTHX_ char *start)
6906 register char *s = start; /* current position in buffer */
6912 d = PL_tokenbuf; /* start of temp holding space */
6913 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6914 end = strchr(s, '\n');
6917 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6919 /* die if we didn't have space for the contents of the <>,
6920 or if it didn't end, or if we see a newline
6923 if (len >= sizeof PL_tokenbuf)
6924 Perl_croak(aTHX_ "Excessively long <> operator");
6926 Perl_croak(aTHX_ "Unterminated <> operator");
6931 Remember, only scalar variables are interpreted as filehandles by
6932 this code. Anything more complex (e.g., <$fh{$num}>) will be
6933 treated as a glob() call.
6934 This code makes use of the fact that except for the $ at the front,
6935 a scalar variable and a filehandle look the same.
6937 if (*d == '$' && d[1]) d++;
6939 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6940 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6943 /* If we've tried to read what we allow filehandles to look like, and
6944 there's still text left, then it must be a glob() and not a getline.
6945 Use scan_str to pull out the stuff between the <> and treat it
6946 as nothing more than a string.
6949 if (d - PL_tokenbuf != len) {
6950 yylval.ival = OP_GLOB;
6952 s = scan_str(start,FALSE,FALSE);
6954 Perl_croak(aTHX_ "Glob not terminated");
6958 bool readline_overriden = FALSE;
6959 GV *gv_readline = Nullgv;
6961 /* we're in a filehandle read situation */
6964 /* turn <> into <ARGV> */
6966 Copy("ARGV",d,5,char);
6968 /* Check whether readline() is overriden */
6969 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6970 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6972 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6973 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6974 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6975 readline_overriden = TRUE;
6977 /* if <$fh>, create the ops to turn the variable into a
6983 /* try to find it in the pad for this block, otherwise find
6984 add symbol table ops
6986 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6987 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6988 SV *sym = sv_2mortal(
6989 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6990 sv_catpvn(sym, "::", 2);
6996 OP *o = newOP(OP_PADSV, 0);
6998 PL_lex_op = readline_overriden
6999 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7000 append_elem(OP_LIST, o,
7001 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
7002 : (OP*)newUNOP(OP_READLINE, 0, o);
7011 ? (GV_ADDMULTI | GV_ADDINEVAL)
7014 PL_lex_op = readline_overriden
7015 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7016 append_elem(OP_LIST,
7017 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
7018 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
7019 : (OP*)newUNOP(OP_READLINE, 0,
7020 newUNOP(OP_RV2SV, 0,
7021 newGVOP(OP_GV, 0, gv)));
7023 if (!readline_overriden)
7024 PL_lex_op->op_flags |= OPf_SPECIAL;
7025 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
7026 yylval.ival = OP_NULL;
7029 /* If it's none of the above, it must be a literal filehandle
7030 (<Foo::BAR> or <FOO>) so build a simple readline OP */
7032 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
7033 PL_lex_op = readline_overriden
7034 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7035 append_elem(OP_LIST,
7036 newGVOP(OP_GV, 0, gv),
7037 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
7038 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
7039 yylval.ival = OP_NULL;
7048 takes: start position in buffer
7049 keep_quoted preserve \ on the embedded delimiter(s)
7050 keep_delims preserve the delimiters around the string
7051 returns: position to continue reading from buffer
7052 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
7053 updates the read buffer.
7055 This subroutine pulls a string out of the input. It is called for:
7056 q single quotes q(literal text)
7057 ' single quotes 'literal text'
7058 qq double quotes qq(interpolate $here please)
7059 " double quotes "interpolate $here please"
7060 qx backticks qx(/bin/ls -l)
7061 ` backticks `/bin/ls -l`
7062 qw quote words @EXPORT_OK = qw( func() $spam )
7063 m// regexp match m/this/
7064 s/// regexp substitute s/this/that/
7065 tr/// string transliterate tr/this/that/
7066 y/// string transliterate y/this/that/
7067 ($*@) sub prototypes sub foo ($)
7068 (stuff) sub attr parameters sub foo : attr(stuff)
7069 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
7071 In most of these cases (all but <>, patterns and transliterate)
7072 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
7073 calls scan_str(). s/// makes yylex() call scan_subst() which calls
7074 scan_str(). tr/// and y/// make yylex() call scan_trans() which
7077 It skips whitespace before the string starts, and treats the first
7078 character as the delimiter. If the delimiter is one of ([{< then
7079 the corresponding "close" character )]}> is used as the closing
7080 delimiter. It allows quoting of delimiters, and if the string has
7081 balanced delimiters ([{<>}]) it allows nesting.
7083 On success, the SV with the resulting string is put into lex_stuff or,
7084 if that is already non-NULL, into lex_repl. The second case occurs only
7085 when parsing the RHS of the special constructs s/// and tr/// (y///).
7086 For convenience, the terminating delimiter character is stuffed into
7091 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
7093 SV *sv; /* scalar value: string */
7094 char *tmps; /* temp string, used for delimiter matching */
7095 register char *s = start; /* current position in the buffer */
7096 register char term; /* terminating character */
7097 register char *to; /* current position in the sv's data */
7098 I32 brackets = 1; /* bracket nesting level */
7099 bool has_utf8 = FALSE; /* is there any utf8 content? */
7100 I32 termcode; /* terminating char. code */
7101 U8 termstr[UTF8_MAXLEN]; /* terminating string */
7102 STRLEN termlen; /* length of terminating string */
7103 char *last = NULL; /* last position for nesting bracket */
7105 /* skip space before the delimiter */
7109 /* mark where we are, in case we need to report errors */
7112 /* after skipping whitespace, the next character is the terminator */
7115 termcode = termstr[0] = term;
7119 termcode = utf8_to_uvchr((U8*)s, &termlen);
7120 Copy(s, termstr, termlen, U8);
7121 if (!UTF8_IS_INVARIANT(term))
7125 /* mark where we are */
7126 PL_multi_start = CopLINE(PL_curcop);
7127 PL_multi_open = term;
7129 /* find corresponding closing delimiter */
7130 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
7131 termcode = termstr[0] = term = tmps[5];
7133 PL_multi_close = term;
7135 /* create a new SV to hold the contents. 87 is leak category, I'm
7136 assuming. 79 is the SV's initial length. What a random number. */
7138 sv_upgrade(sv, SVt_PVIV);
7139 SvIVX(sv) = termcode;
7140 (void)SvPOK_only(sv); /* validate pointer */
7142 /* move past delimiter and try to read a complete string */
7144 sv_catpvn(sv, s, termlen);
7147 if (PL_encoding && !UTF) {
7151 int offset = s - SvPVX(PL_linestr);
7152 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
7153 &offset, (char*)termstr, termlen);
7154 char *ns = SvPVX(PL_linestr) + offset;
7155 char *svlast = SvEND(sv) - 1;
7157 for (; s < ns; s++) {
7158 if (*s == '\n' && !PL_rsfp)
7159 CopLINE_inc(PL_curcop);
7162 goto read_more_line;
7164 /* handle quoted delimiters */
7165 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
7167 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
7169 if ((svlast-1 - t) % 2) {
7173 SvCUR_set(sv, SvCUR(sv) - 1);
7178 if (PL_multi_open == PL_multi_close) {
7185 for (w = t = last; t < svlast; w++, t++) {
7186 /* At here, all closes are "was quoted" one,
7187 so we don't check PL_multi_close. */
7189 if (!keep_quoted && *(t+1) == PL_multi_open)
7194 else if (*t == PL_multi_open)
7202 SvCUR_set(sv, w - SvPVX(sv));
7205 if (--brackets <= 0)
7211 SvCUR_set(sv, SvCUR(sv) - 1);
7217 /* extend sv if need be */
7218 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7219 /* set 'to' to the next character in the sv's string */
7220 to = SvPVX(sv)+SvCUR(sv);
7222 /* if open delimiter is the close delimiter read unbridle */
7223 if (PL_multi_open == PL_multi_close) {
7224 for (; s < PL_bufend; s++,to++) {
7225 /* embedded newlines increment the current line number */
7226 if (*s == '\n' && !PL_rsfp)
7227 CopLINE_inc(PL_curcop);
7228 /* handle quoted delimiters */
7229 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7230 if (!keep_quoted && s[1] == term)
7232 /* any other quotes are simply copied straight through */
7236 /* terminate when run out of buffer (the for() condition), or
7237 have found the terminator */
7238 else if (*s == term) {
7241 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7244 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7250 /* if the terminator isn't the same as the start character (e.g.,
7251 matched brackets), we have to allow more in the quoting, and
7252 be prepared for nested brackets.
7255 /* read until we run out of string, or we find the terminator */
7256 for (; s < PL_bufend; s++,to++) {
7257 /* embedded newlines increment the line count */
7258 if (*s == '\n' && !PL_rsfp)
7259 CopLINE_inc(PL_curcop);
7260 /* backslashes can escape the open or closing characters */
7261 if (*s == '\\' && s+1 < PL_bufend) {
7263 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7268 /* allow nested opens and closes */
7269 else if (*s == PL_multi_close && --brackets <= 0)
7271 else if (*s == PL_multi_open)
7273 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7278 /* terminate the copied string and update the sv's end-of-string */
7280 SvCUR_set(sv, to - SvPVX(sv));
7283 * this next chunk reads more into the buffer if we're not done yet
7287 break; /* handle case where we are done yet :-) */
7289 #ifndef PERL_STRICT_CR
7290 if (to - SvPVX(sv) >= 2) {
7291 if ((to[-2] == '\r' && to[-1] == '\n') ||
7292 (to[-2] == '\n' && to[-1] == '\r'))
7296 SvCUR_set(sv, to - SvPVX(sv));
7298 else if (to[-1] == '\r')
7301 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7306 /* if we're out of file, or a read fails, bail and reset the current
7307 line marker so we can report where the unterminated string began
7310 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7312 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7315 /* we read a line, so increment our line counter */
7316 CopLINE_inc(PL_curcop);
7318 /* update debugger info */
7319 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7320 SV *sv = NEWSV(88,0);
7322 sv_upgrade(sv, SVt_PVMG);
7323 sv_setsv(sv,PL_linestr);
7326 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7329 /* having changed the buffer, we must update PL_bufend */
7330 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7331 PL_last_lop = PL_last_uni = Nullch;
7334 /* at this point, we have successfully read the delimited string */
7336 if (!PL_encoding || UTF) {
7338 sv_catpvn(sv, s, termlen);
7341 if (has_utf8 || PL_encoding)
7344 PL_multi_end = CopLINE(PL_curcop);
7346 /* if we allocated too much space, give some back */
7347 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7348 SvLEN_set(sv, SvCUR(sv) + 1);
7349 Renew(SvPVX(sv), SvLEN(sv), char);
7352 /* decide whether this is the first or second quoted string we've read
7365 takes: pointer to position in buffer
7366 returns: pointer to new position in buffer
7367 side-effects: builds ops for the constant in yylval.op
7369 Read a number in any of the formats that Perl accepts:
7371 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7372 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7375 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7377 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7380 If it reads a number without a decimal point or an exponent, it will
7381 try converting the number to an integer and see if it can do so
7382 without loss of precision.
7386 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7388 register char *s = start; /* current position in buffer */
7389 register char *d; /* destination in temp buffer */
7390 register char *e; /* end of temp buffer */
7391 NV nv; /* number read, as a double */
7392 SV *sv = Nullsv; /* place to put the converted number */
7393 bool floatit; /* boolean: int or float? */
7394 char *lastub = 0; /* position of last underbar */
7395 static char number_too_long[] = "Number too long";
7397 /* We use the first character to decide what type of number this is */
7401 Perl_croak(aTHX_ "panic: scan_num");
7403 /* if it starts with a 0, it could be an octal number, a decimal in
7404 0.13 disguise, or a hexadecimal number, or a binary number. */
7408 u holds the "number so far"
7409 shift the power of 2 of the base
7410 (hex == 4, octal == 3, binary == 1)
7411 overflowed was the number more than we can hold?
7413 Shift is used when we add a digit. It also serves as an "are
7414 we in octal/hex/binary?" indicator to disallow hex characters
7420 bool overflowed = FALSE;
7421 bool just_zero = TRUE; /* just plain 0 or binary number? */
7422 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7423 static char* bases[5] = { "", "binary", "", "octal",
7425 static char* Bases[5] = { "", "Binary", "", "Octal",
7427 static char *maxima[5] = { "",
7428 "0b11111111111111111111111111111111",
7432 char *base, *Base, *max;
7439 } else if (s[1] == 'b') {
7444 /* check for a decimal in disguise */
7445 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7447 /* so it must be octal */
7454 if (ckWARN(WARN_SYNTAX))
7455 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7456 "Misplaced _ in number");
7460 base = bases[shift];
7461 Base = Bases[shift];
7462 max = maxima[shift];
7464 /* read the rest of the number */
7466 /* x is used in the overflow test,
7467 b is the digit we're adding on. */
7472 /* if we don't mention it, we're done */
7476 /* _ are ignored -- but warned about if consecutive */
7478 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7479 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7480 "Misplaced _ in number");
7484 /* 8 and 9 are not octal */
7487 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7491 case '2': case '3': case '4':
7492 case '5': case '6': case '7':
7494 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7498 b = *s++ & 15; /* ASCII digit -> value of digit */
7502 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7503 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7504 /* make sure they said 0x */
7509 /* Prepare to put the digit we have onto the end
7510 of the number so far. We check for overflows.
7516 x = u << shift; /* make room for the digit */
7518 if ((x >> shift) != u
7519 && !(PL_hints & HINT_NEW_BINARY)) {
7522 if (ckWARN_d(WARN_OVERFLOW))
7523 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7524 "Integer overflow in %s number",
7527 u = x | b; /* add the digit to the end */
7530 n *= nvshift[shift];
7531 /* If an NV has not enough bits in its
7532 * mantissa to represent an UV this summing of
7533 * small low-order numbers is a waste of time
7534 * (because the NV cannot preserve the
7535 * low-order bits anyway): we could just
7536 * remember when did we overflow and in the
7537 * end just multiply n by the right
7545 /* if we get here, we had success: make a scalar value from
7550 /* final misplaced underbar check */
7552 if (ckWARN(WARN_SYNTAX))
7553 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7558 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7559 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7560 "%s number > %s non-portable",
7566 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7567 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7568 "%s number > %s non-portable",
7573 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7574 sv = new_constant(start, s - start, "integer",
7576 else if (PL_hints & HINT_NEW_BINARY)
7577 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7582 handle decimal numbers.
7583 we're also sent here when we read a 0 as the first digit
7585 case '1': case '2': case '3': case '4': case '5':
7586 case '6': case '7': case '8': case '9': case '.':
7589 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7592 /* read next group of digits and _ and copy into d */
7593 while (isDIGIT(*s) || *s == '_') {
7594 /* skip underscores, checking for misplaced ones
7598 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7599 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7600 "Misplaced _ in number");
7604 /* check for end of fixed-length buffer */
7606 Perl_croak(aTHX_ number_too_long);
7607 /* if we're ok, copy the character */
7612 /* final misplaced underbar check */
7613 if (lastub && s == lastub + 1) {
7614 if (ckWARN(WARN_SYNTAX))
7615 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7618 /* read a decimal portion if there is one. avoid
7619 3..5 being interpreted as the number 3. followed
7622 if (*s == '.' && s[1] != '.') {
7627 if (ckWARN(WARN_SYNTAX))
7628 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7629 "Misplaced _ in number");
7633 /* copy, ignoring underbars, until we run out of digits.
7635 for (; isDIGIT(*s) || *s == '_'; s++) {
7636 /* fixed length buffer check */
7638 Perl_croak(aTHX_ number_too_long);
7640 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7641 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7642 "Misplaced _ in number");
7648 /* fractional part ending in underbar? */
7650 if (ckWARN(WARN_SYNTAX))
7651 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7652 "Misplaced _ in number");
7654 if (*s == '.' && isDIGIT(s[1])) {
7655 /* oops, it's really a v-string, but without the "v" */
7661 /* read exponent part, if present */
7662 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7666 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7667 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7669 /* stray preinitial _ */
7671 if (ckWARN(WARN_SYNTAX))
7672 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7673 "Misplaced _ in number");
7677 /* allow positive or negative exponent */
7678 if (*s == '+' || *s == '-')
7681 /* stray initial _ */
7683 if (ckWARN(WARN_SYNTAX))
7684 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7685 "Misplaced _ in number");
7689 /* read digits of exponent */
7690 while (isDIGIT(*s) || *s == '_') {
7693 Perl_croak(aTHX_ number_too_long);
7697 if (ckWARN(WARN_SYNTAX) &&
7698 ((lastub && s == lastub + 1) ||
7699 (!isDIGIT(s[1]) && s[1] != '_')))
7700 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7701 "Misplaced _ in number");
7708 /* make an sv from the string */
7712 We try to do an integer conversion first if no characters
7713 indicating "float" have been found.
7718 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7720 if (flags == IS_NUMBER_IN_UV) {
7722 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7725 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7726 if (uv <= (UV) IV_MIN)
7727 sv_setiv(sv, -(IV)uv);
7734 /* terminate the string */
7736 nv = Atof(PL_tokenbuf);
7740 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7741 (PL_hints & HINT_NEW_INTEGER) )
7742 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7743 (floatit ? "float" : "integer"),
7747 /* if it starts with a v, it could be a v-string */
7750 sv = NEWSV(92,5); /* preallocate storage space */
7751 s = scan_vstring(s,sv);
7755 /* make the op for the constant and return */
7758 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7760 lvalp->opval = Nullop;
7766 S_scan_formline(pTHX_ register char *s)
7770 SV *stuff = newSVpvn("",0);
7771 bool needargs = FALSE;
7777 #ifdef PERL_STRICT_CR
7778 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7780 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7782 if (*t == '\n' || t == PL_bufend) {
7787 if (PL_in_eval && !PL_rsfp) {
7788 eol = memchr(s,'\n',PL_bufend-s);
7793 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7795 for (t = s; t < eol; t++) {
7796 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7798 goto enough; /* ~~ must be first line in formline */
7800 if (*t == '@' || *t == '^')
7804 sv_catpvn(stuff, s, eol-s);
7805 #ifndef PERL_STRICT_CR
7806 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7807 char *end = SvPVX(stuff) + SvCUR(stuff);
7819 s = filter_gets(PL_linestr, PL_rsfp, 0);
7820 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7821 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7822 PL_last_lop = PL_last_uni = Nullch;
7834 PL_lex_state = LEX_NORMAL;
7835 PL_nextval[PL_nexttoke].ival = 0;
7839 PL_lex_state = LEX_FORMLINE;
7841 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7843 else if (PL_encoding)
7844 sv_recode_to_utf8(stuff, PL_encoding);
7846 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7848 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7852 SvREFCNT_dec(stuff);
7854 PL_lex_formbrack = 0;
7865 PL_cshlen = strlen(PL_cshname);
7870 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7872 I32 oldsavestack_ix = PL_savestack_ix;
7873 CV* outsidecv = PL_compcv;
7876 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7878 SAVEI32(PL_subline);
7879 save_item(PL_subname);
7880 SAVESPTR(PL_compcv);
7882 PL_compcv = (CV*)NEWSV(1104,0);
7883 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7884 CvFLAGS(PL_compcv) |= flags;
7886 PL_subline = CopLINE(PL_curcop);
7887 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7888 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7889 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7891 return oldsavestack_ix;
7895 #pragma segment Perl_yylex
7898 Perl_yywarn(pTHX_ char *s)
7900 PL_in_eval |= EVAL_WARNONLY;
7902 PL_in_eval &= ~EVAL_WARNONLY;
7907 Perl_yyerror(pTHX_ char *s)
7910 char *context = NULL;
7914 if (!yychar || (yychar == ';' && !PL_rsfp))
7916 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7917 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7920 The code below is removed for NetWare because it abends/crashes on NetWare
7921 when the script has error such as not having the closing quotes like:
7923 Checking of white spaces is anyway done in NetWare code.
7926 while (isSPACE(*PL_oldoldbufptr))
7929 context = PL_oldoldbufptr;
7930 contlen = PL_bufptr - PL_oldoldbufptr;
7932 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7933 PL_oldbufptr != PL_bufptr) {
7936 The code below is removed for NetWare because it abends/crashes on NetWare
7937 when the script has error such as not having the closing quotes like:
7939 Checking of white spaces is anyway done in NetWare code.
7942 while (isSPACE(*PL_oldbufptr))
7945 context = PL_oldbufptr;
7946 contlen = PL_bufptr - PL_oldbufptr;
7948 else if (yychar > 255)
7949 where = "next token ???";
7950 else if (yychar == -2) { /* YYEMPTY */
7951 if (PL_lex_state == LEX_NORMAL ||
7952 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7953 where = "at end of line";
7954 else if (PL_lex_inpat)
7955 where = "within pattern";
7957 where = "within string";
7960 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7962 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7963 else if (isPRINT_LC(yychar))
7964 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7966 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7967 where = SvPVX(where_sv);
7969 msg = sv_2mortal(newSVpv(s, 0));
7970 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7971 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7973 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7975 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7976 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7977 Perl_sv_catpvf(aTHX_ msg,
7978 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7979 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7982 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7983 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7986 if (PL_error_count >= 10) {
7987 if (PL_in_eval && SvCUR(ERRSV))
7988 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7989 ERRSV, OutCopFILE(PL_curcop));
7991 Perl_croak(aTHX_ "%s has too many errors.\n",
7992 OutCopFILE(PL_curcop));
7995 PL_in_my_stash = Nullhv;
7999 #pragma segment Main
8003 S_swallow_bom(pTHX_ U8 *s)
8006 slen = SvCUR(PL_linestr);
8010 /* UTF-16 little-endian? (or UTF32-LE?) */
8011 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
8012 Perl_croak(aTHX_ "Unsupported script encoding UTF32-LE");
8013 #ifndef PERL_NO_UTF16_FILTER
8014 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF16-LE script encoding (BOM)\n");
8017 if (PL_bufend > (char*)s) {
8021 filter_add(utf16rev_textfilter, NULL);
8022 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8023 utf16_to_utf8_reversed(s, news,
8024 PL_bufend - (char*)s - 1,
8026 sv_setpvn(PL_linestr, (const char*)news, newlen);
8028 SvUTF8_on(PL_linestr);
8029 s = (U8*)SvPVX(PL_linestr);
8030 PL_bufend = SvPVX(PL_linestr) + newlen;
8033 Perl_croak(aTHX_ "Unsupported script encoding UTF16-LE");
8038 if (s[1] == 0xFF) { /* UTF-16 big-endian? */
8039 #ifndef PERL_NO_UTF16_FILTER
8040 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (BOM)\n");
8043 if (PL_bufend > (char *)s) {
8047 filter_add(utf16_textfilter, NULL);
8048 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8049 utf16_to_utf8(s, news,
8050 PL_bufend - (char*)s,
8052 sv_setpvn(PL_linestr, (const char*)news, newlen);
8054 SvUTF8_on(PL_linestr);
8055 s = (U8*)SvPVX(PL_linestr);
8056 PL_bufend = SvPVX(PL_linestr) + newlen;
8059 Perl_croak(aTHX_ "Unsupported script encoding UTF16-BE");
8064 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
8065 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
8072 if (s[2] == 0xFE && s[3] == 0xFF) {
8073 /* UTF-32 big-endian */
8074 Perl_croak(aTHX_ "Unsupported script encoding UTF32-BE");
8077 else if (s[2] == 0 && s[3] != 0) {
8080 * are a good indicator of UTF-16BE. */
8081 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (no BOM)\n");
8086 if (slen > 3 && s[1] == 0 && s[2] != 0 && s[3] == 0) {
8089 * are a good indicator of UTF-16LE. */
8090 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (no BOM)\n");
8099 * Restore a source filter.
8103 restore_rsfp(pTHX_ void *f)
8105 PerlIO *fp = (PerlIO*)f;
8107 if (PL_rsfp == PerlIO_stdin())
8108 PerlIO_clearerr(PL_rsfp);
8109 else if (PL_rsfp && (PL_rsfp != fp))
8110 PerlIO_close(PL_rsfp);
8114 #ifndef PERL_NO_UTF16_FILTER
8116 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8118 STRLEN old = SvCUR(sv);
8119 I32 count = FILTER_READ(idx+1, sv, maxlen);
8120 DEBUG_P(PerlIO_printf(Perl_debug_log,
8121 "utf16_textfilter(%p): %d %d (%d)\n",
8122 utf16_textfilter, idx, maxlen, count));
8126 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8127 Copy(SvPVX(sv), tmps, old, char);
8128 utf16_to_utf8((U8*)SvPVX(sv) + old, tmps + old,
8129 SvCUR(sv) - old, &newlen);
8130 sv_usepvn(sv, (char*)tmps, (STRLEN)newlen + old);
8132 DEBUG_P({sv_dump(sv);});
8137 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8139 STRLEN old = SvCUR(sv);
8140 I32 count = FILTER_READ(idx+1, sv, maxlen);
8141 DEBUG_P(PerlIO_printf(Perl_debug_log,
8142 "utf16rev_textfilter(%p): %d %d (%d)\n",
8143 utf16rev_textfilter, idx, maxlen, count));
8147 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8148 Copy(SvPVX(sv), tmps, old, char);
8149 utf16_to_utf8((U8*)SvPVX(sv) + old, tmps + old,
8150 SvCUR(sv) - old, &newlen);
8151 sv_usepvn(sv, (char*)tmps, (STRLEN)newlen + old);
8153 DEBUG_P({ sv_dump(sv); });
8159 Returns a pointer to the next character after the parsed
8160 vstring, as well as updating the passed in sv.
8162 Function must be called like
8165 s = scan_vstring(s,sv);
8167 The sv should already be large enough to store the vstring
8168 passed in, for performance reasons.
8173 Perl_scan_vstring(pTHX_ char *s, SV *sv)
8177 if (*pos == 'v') pos++; /* get past 'v' */
8178 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8181 /* this may not be a v-string if followed by => */
8183 while (next < PL_bufend && isSPACE(*next))
8185 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
8186 /* return string not v-string */
8187 sv_setpvn(sv,(char *)s,pos-s);
8192 if (!isALPHA(*pos)) {
8194 U8 tmpbuf[UTF8_MAXLEN+1];
8197 if (*s == 'v') s++; /* get past 'v' */
8199 sv_setpvn(sv, "", 0);
8204 /* this is atoi() that tolerates underscores */
8207 while (--end >= s) {
8212 rev += (*end - '0') * mult;
8214 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8215 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8216 "Integer overflow in decimal number");
8220 if (rev > 0x7FFFFFFF)
8221 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8223 /* Append native character for the rev point */
8224 tmpend = uvchr_to_utf8(tmpbuf, rev);
8225 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8226 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8228 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8234 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8238 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);