3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 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_setpvn(PL_linestr,";", 1);
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)
1970 && !(last_un_char == '$' || last_un_char == '@'
1971 || last_un_char == '&')
1972 && isALPHA(*s) && s[1] && isALPHA(s[1])) {
1977 if (keyword(tmpbuf, d - tmpbuf))
1980 if (un_char == last_un_char + 1)
1982 weight -= seen[un_char];
1987 if (weight >= 0) /* probably a character class */
1997 * Does all the checking to disambiguate
1999 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
2000 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
2002 * First argument is the stuff after the first token, e.g. "bar".
2004 * Not a method if bar is a filehandle.
2005 * Not a method if foo is a subroutine prototyped to take a filehandle.
2006 * Not a method if it's really "Foo $bar"
2007 * Method if it's "foo $bar"
2008 * Not a method if it's really "print foo $bar"
2009 * Method if it's really "foo package::" (interpreted as package->foo)
2010 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
2011 * Not a method if bar is a filehandle or package, but is quoted with
2016 S_intuit_method(pTHX_ char *start, GV *gv)
2018 char *s = start + (*start == '$');
2019 char tmpbuf[sizeof PL_tokenbuf];
2027 if ((cv = GvCVu(gv))) {
2028 char *proto = SvPVX(cv);
2038 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
2039 /* start is the beginning of the possible filehandle/object,
2040 * and s is the end of it
2041 * tmpbuf is a copy of it
2044 if (*start == '$') {
2045 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
2050 return *s == '(' ? FUNCMETH : METHOD;
2052 if (!keyword(tmpbuf, len)) {
2053 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
2058 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
2059 if (indirgv && GvCVu(indirgv))
2061 /* filehandle or package name makes it a method */
2062 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
2064 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
2065 return 0; /* no assumptions -- "=>" quotes bearword */
2067 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
2068 newSVpvn(tmpbuf,len));
2069 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
2073 return *s == '(' ? FUNCMETH : METHOD;
2081 * Return a string of Perl code to load the debugger. If PERL5DB
2082 * is set, it will return the contents of that, otherwise a
2083 * compile-time require of perl5db.pl.
2090 char *pdb = PerlEnv_getenv("PERL5DB");
2094 SETERRNO(0,SS_NORMAL);
2095 return "BEGIN { require 'perl5db.pl' }";
2101 /* Encoded script support. filter_add() effectively inserts a
2102 * 'pre-processing' function into the current source input stream.
2103 * Note that the filter function only applies to the current source file
2104 * (e.g., it will not affect files 'require'd or 'use'd by this one).
2106 * The datasv parameter (which may be NULL) can be used to pass
2107 * private data to this instance of the filter. The filter function
2108 * can recover the SV using the FILTER_DATA macro and use it to
2109 * store private buffers and state information.
2111 * The supplied datasv parameter is upgraded to a PVIO type
2112 * and the IoDIRP/IoANY field is used to store the function pointer,
2113 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
2114 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
2115 * private use must be set using malloc'd pointers.
2119 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2124 if (!PL_rsfp_filters)
2125 PL_rsfp_filters = newAV();
2127 datasv = NEWSV(255,0);
2128 if (!SvUPGRADE(datasv, SVt_PVIO))
2129 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2130 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2131 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2132 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2133 (void*)funcp, SvPV_nolen(datasv)));
2134 av_unshift(PL_rsfp_filters, 1);
2135 av_store(PL_rsfp_filters, 0, datasv) ;
2140 /* Delete most recently added instance of this filter function. */
2142 Perl_filter_del(pTHX_ filter_t funcp)
2145 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2146 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2148 /* if filter is on top of stack (usual case) just pop it off */
2149 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2150 if (IoANY(datasv) == (void *)funcp) {
2151 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2152 IoANY(datasv) = (void *)NULL;
2153 sv_free(av_pop(PL_rsfp_filters));
2157 /* we need to search for the correct entry and clear it */
2158 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2162 /* Invoke the idxth filter function for the current rsfp. */
2163 /* maxlen 0 = read one text line */
2165 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2170 if (!PL_rsfp_filters)
2172 if (idx > AvFILLp(PL_rsfp_filters)) { /* Any more filters? */
2173 /* Provide a default input filter to make life easy. */
2174 /* Note that we append to the line. This is handy. */
2175 DEBUG_P(PerlIO_printf(Perl_debug_log,
2176 "filter_read %d: from rsfp\n", idx));
2180 int old_len = SvCUR(buf_sv) ;
2182 /* ensure buf_sv is large enough */
2183 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2184 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2185 if (PerlIO_error(PL_rsfp))
2186 return -1; /* error */
2188 return 0 ; /* end of file */
2190 SvCUR_set(buf_sv, old_len + len) ;
2193 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2194 if (PerlIO_error(PL_rsfp))
2195 return -1; /* error */
2197 return 0 ; /* end of file */
2200 return SvCUR(buf_sv);
2202 /* Skip this filter slot if filter has been deleted */
2203 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef) {
2204 DEBUG_P(PerlIO_printf(Perl_debug_log,
2205 "filter_read %d: skipped (filter deleted)\n",
2207 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2209 /* Get function pointer hidden within datasv */
2210 funcp = (filter_t)IoANY(datasv);
2211 DEBUG_P(PerlIO_printf(Perl_debug_log,
2212 "filter_read %d: via function %p (%s)\n",
2213 idx, (void*)funcp, SvPV_nolen(datasv)));
2214 /* Call function. The function is expected to */
2215 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2216 /* Return: <0:error, =0:eof, >0:not eof */
2217 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2221 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2223 #ifdef PERL_CR_FILTER
2224 if (!PL_rsfp_filters) {
2225 filter_add(S_cr_textfilter,NULL);
2228 if (PL_rsfp_filters) {
2230 SvCUR_set(sv, 0); /* start with empty line */
2231 if (FILTER_READ(0, sv, 0) > 0)
2232 return ( SvPVX(sv) ) ;
2237 return (sv_gets(sv, fp, append));
2241 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2245 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2249 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2250 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2252 return GvHV(gv); /* Foo:: */
2255 /* use constant CLASS => 'MyClass' */
2256 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2258 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2259 pkgname = SvPV_nolen(sv);
2263 return gv_stashpv(pkgname, FALSE);
2267 static char* exp_name[] =
2268 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2269 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
2276 Works out what to call the token just pulled out of the input
2277 stream. The yacc parser takes care of taking the ops we return and
2278 stitching them into a tree.
2284 if read an identifier
2285 if we're in a my declaration
2286 croak if they tried to say my($foo::bar)
2287 build the ops for a my() declaration
2288 if it's an access to a my() variable
2289 are we in a sort block?
2290 croak if my($a); $a <=> $b
2291 build ops for access to a my() variable
2292 if in a dq string, and they've said @foo and we can't find @foo
2294 build ops for a bareword
2295 if we already built the token before, use it.
2300 #pragma segment Perl_yylex
2305 register char *s = PL_bufptr;
2312 I32 orig_keyword = 0;
2315 PerlIO_printf(Perl_debug_log, "### LEX_%s\n",
2316 lex_state_names[PL_lex_state]);
2318 /* check if there's an identifier for us to look at */
2319 if (PL_pending_ident)
2320 return REPORT(S_pending_ident(aTHX));
2322 /* no identifier pending identification */
2324 switch (PL_lex_state) {
2326 case LEX_NORMAL: /* Some compilers will produce faster */
2327 case LEX_INTERPNORMAL: /* code if we comment these out. */
2331 /* when we've already built the next token, just pull it out of the queue */
2334 yylval = PL_nextval[PL_nexttoke];
2336 PL_lex_state = PL_lex_defer;
2337 PL_expect = PL_lex_expect;
2338 PL_lex_defer = LEX_NORMAL;
2340 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2341 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2342 (IV)PL_nexttype[PL_nexttoke]); });
2344 return REPORT(PL_nexttype[PL_nexttoke]);
2346 /* interpolated case modifiers like \L \U, including \Q and \E.
2347 when we get here, PL_bufptr is at the \
2349 case LEX_INTERPCASEMOD:
2351 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2352 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2354 /* handle \E or end of string */
2355 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2359 if (PL_lex_casemods) {
2360 oldmod = PL_lex_casestack[--PL_lex_casemods];
2361 PL_lex_casestack[PL_lex_casemods] = '\0';
2363 if (PL_bufptr != PL_bufend
2364 && (oldmod == 'L' || oldmod == 'U' || oldmod == 'Q')) {
2366 PL_lex_state = LEX_INTERPCONCAT;
2370 if (PL_bufptr != PL_bufend)
2372 PL_lex_state = LEX_INTERPCONCAT;
2376 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2377 "### Saw case modifier at '%s'\n", PL_bufptr); });
2379 if (s[1] == '\\' && s[2] == 'E') {
2381 PL_lex_state = LEX_INTERPCONCAT;
2385 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2386 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2387 if ((*s == 'L' || *s == 'U') &&
2388 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2389 PL_lex_casestack[--PL_lex_casemods] = '\0';
2392 if (PL_lex_casemods > 10)
2393 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2394 PL_lex_casestack[PL_lex_casemods++] = *s;
2395 PL_lex_casestack[PL_lex_casemods] = '\0';
2396 PL_lex_state = LEX_INTERPCONCAT;
2397 PL_nextval[PL_nexttoke].ival = 0;
2400 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2402 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2404 PL_nextval[PL_nexttoke].ival = OP_LC;
2406 PL_nextval[PL_nexttoke].ival = OP_UC;
2408 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2410 Perl_croak(aTHX_ "panic: yylex");
2414 if (PL_lex_starts) {
2417 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2418 if (PL_lex_casemods == 1 && PL_lex_inpat)
2427 case LEX_INTERPPUSH:
2428 return REPORT(sublex_push());
2430 case LEX_INTERPSTART:
2431 if (PL_bufptr == PL_bufend)
2432 return REPORT(sublex_done());
2433 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2434 "### Interpolated variable at '%s'\n", PL_bufptr); });
2436 PL_lex_dojoin = (*PL_bufptr == '@');
2437 PL_lex_state = LEX_INTERPNORMAL;
2438 if (PL_lex_dojoin) {
2439 PL_nextval[PL_nexttoke].ival = 0;
2441 force_ident("\"", '$');
2442 PL_nextval[PL_nexttoke].ival = 0;
2444 PL_nextval[PL_nexttoke].ival = 0;
2446 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2449 if (PL_lex_starts++) {
2451 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2452 if (!PL_lex_casemods && PL_lex_inpat)
2459 case LEX_INTERPENDMAYBE:
2460 if (intuit_more(PL_bufptr)) {
2461 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2467 if (PL_lex_dojoin) {
2468 PL_lex_dojoin = FALSE;
2469 PL_lex_state = LEX_INTERPCONCAT;
2472 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2473 && SvEVALED(PL_lex_repl))
2475 if (PL_bufptr != PL_bufend)
2476 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2477 PL_lex_repl = Nullsv;
2480 case LEX_INTERPCONCAT:
2482 if (PL_lex_brackets)
2483 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2485 if (PL_bufptr == PL_bufend)
2486 return REPORT(sublex_done());
2488 if (SvIVX(PL_linestr) == '\'') {
2489 SV *sv = newSVsv(PL_linestr);
2492 else if ( PL_hints & HINT_NEW_RE )
2493 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2494 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2498 s = scan_const(PL_bufptr);
2500 PL_lex_state = LEX_INTERPCASEMOD;
2502 PL_lex_state = LEX_INTERPSTART;
2505 if (s != PL_bufptr) {
2506 PL_nextval[PL_nexttoke] = yylval;
2509 if (PL_lex_starts++) {
2510 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
2511 if (!PL_lex_casemods && PL_lex_inpat)
2524 PL_lex_state = LEX_NORMAL;
2525 s = scan_formline(PL_bufptr);
2526 if (!PL_lex_formbrack)
2532 PL_oldoldbufptr = PL_oldbufptr;
2535 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at [%s]\n",
2536 exp_name[PL_expect], s);
2542 if (isIDFIRST_lazy_if(s,UTF))
2544 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2547 goto fake_eof; /* emulate EOF on ^D or ^Z */
2552 if (PL_lex_brackets) {
2553 if (PL_lex_formbrack)
2554 yyerror("Format not terminated");
2556 yyerror("Missing right curly or square bracket");
2558 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2559 "### Tokener got EOF\n");
2563 if (s++ < PL_bufend)
2564 goto retry; /* ignore stray nulls */
2567 if (!PL_in_eval && !PL_preambled) {
2568 PL_preambled = TRUE;
2569 sv_setpv(PL_linestr,incl_perldb());
2570 if (SvCUR(PL_linestr))
2571 sv_catpvn(PL_linestr,";", 1);
2573 while(AvFILLp(PL_preambleav) >= 0) {
2574 SV *tmpsv = av_shift(PL_preambleav);
2575 sv_catsv(PL_linestr, tmpsv);
2576 sv_catpvn(PL_linestr, ";", 1);
2579 sv_free((SV*)PL_preambleav);
2580 PL_preambleav = NULL;
2582 if (PL_minus_n || PL_minus_p) {
2583 sv_catpv(PL_linestr, "LINE: while (<>) {");
2585 sv_catpv(PL_linestr,"chomp;");
2588 if ((*PL_splitstr == '/' || *PL_splitstr == '\''
2589 || *PL_splitstr == '"')
2590 && strchr(PL_splitstr + 1, *PL_splitstr))
2591 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2593 /* "q\0${splitstr}\0" is legal perl. Yes, even NUL
2594 bytes can be used as quoting characters. :-) */
2595 Perl_sv_catpvf(aTHX_ PL_linestr,
2596 "our @F=split(q%c%s%c);",
2601 sv_catpv(PL_linestr,"our @F=split(' ');");
2604 sv_catpvn(PL_linestr, "\n", 1);
2605 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2606 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2607 PL_last_lop = PL_last_uni = Nullch;
2608 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2609 SV *sv = NEWSV(85,0);
2611 sv_upgrade(sv, SVt_PVMG);
2612 sv_setsv(sv,PL_linestr);
2615 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2620 bof = PL_rsfp ? TRUE : FALSE;
2621 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2624 if (PL_preprocess && !PL_in_eval)
2625 (void)PerlProc_pclose(PL_rsfp);
2626 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2627 PerlIO_clearerr(PL_rsfp);
2629 (void)PerlIO_close(PL_rsfp);
2631 PL_doextract = FALSE;
2633 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2634 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2635 sv_catpv(PL_linestr,";}");
2636 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2637 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2638 PL_last_lop = PL_last_uni = Nullch;
2639 PL_minus_n = PL_minus_p = 0;
2642 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2643 PL_last_lop = PL_last_uni = Nullch;
2644 sv_setpv(PL_linestr,"");
2645 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2647 /* If it looks like the start of a BOM or raw UTF-16,
2648 * check if it in fact is. */
2654 #ifdef PERLIO_IS_STDIO
2655 # ifdef __GNU_LIBRARY__
2656 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2657 # define FTELL_FOR_PIPE_IS_BROKEN
2661 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2662 # define FTELL_FOR_PIPE_IS_BROKEN
2667 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2668 /* This loses the possibility to detect the bof
2669 * situation on perl -P when the libc5 is being used.
2670 * Workaround? Maybe attach some extra state to PL_rsfp?
2673 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2675 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2678 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2679 s = swallow_bom((U8*)s);
2683 /* Incest with pod. */
2684 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2685 sv_setpv(PL_linestr, "");
2686 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2687 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2688 PL_last_lop = PL_last_uni = Nullch;
2689 PL_doextract = FALSE;
2693 } while (PL_doextract);
2694 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2695 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2696 SV *sv = NEWSV(85,0);
2698 sv_upgrade(sv, SVt_PVMG);
2699 sv_setsv(sv,PL_linestr);
2702 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2704 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2705 PL_last_lop = PL_last_uni = Nullch;
2706 if (CopLINE(PL_curcop) == 1) {
2707 while (s < PL_bufend && isSPACE(*s))
2709 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2713 if (*s == '#' && *(s+1) == '!')
2715 #ifdef ALTERNATE_SHEBANG
2717 static char as[] = ALTERNATE_SHEBANG;
2718 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2719 d = s + (sizeof(as) - 1);
2721 #endif /* ALTERNATE_SHEBANG */
2730 while (*d && !isSPACE(*d))
2734 #ifdef ARG_ZERO_IS_SCRIPT
2735 if (ipathend > ipath) {
2737 * HP-UX (at least) sets argv[0] to the script name,
2738 * which makes $^X incorrect. And Digital UNIX and Linux,
2739 * at least, set argv[0] to the basename of the Perl
2740 * interpreter. So, having found "#!", we'll set it right.
2742 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2743 assert(SvPOK(x) || SvGMAGICAL(x));
2744 if (sv_eq(x, CopFILESV(PL_curcop))) {
2745 sv_setpvn(x, ipath, ipathend - ipath);
2751 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2752 char *lstart = SvPV(x,llen);
2754 bstart += blen - llen;
2755 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2756 sv_setpvn(x, ipath, ipathend - ipath);
2761 TAINT_NOT; /* $^X is always tainted, but that's OK */
2763 #endif /* ARG_ZERO_IS_SCRIPT */
2768 d = instr(s,"perl -");
2770 d = instr(s,"perl");
2772 /* avoid getting into infinite loops when shebang
2773 * line contains "Perl" rather than "perl" */
2775 for (d = ipathend-4; d >= ipath; --d) {
2776 if ((*d == 'p' || *d == 'P')
2777 && !ibcmp(d, "perl", 4))
2787 #ifdef ALTERNATE_SHEBANG
2789 * If the ALTERNATE_SHEBANG on this system starts with a
2790 * character that can be part of a Perl expression, then if
2791 * we see it but not "perl", we're probably looking at the
2792 * start of Perl code, not a request to hand off to some
2793 * other interpreter. Similarly, if "perl" is there, but
2794 * not in the first 'word' of the line, we assume the line
2795 * contains the start of the Perl program.
2797 if (d && *s != '#') {
2799 while (*c && !strchr("; \t\r\n\f\v#", *c))
2802 d = Nullch; /* "perl" not in first word; ignore */
2804 *s = '#'; /* Don't try to parse shebang line */
2806 #endif /* ALTERNATE_SHEBANG */
2807 #ifndef MACOS_TRADITIONAL
2812 !instr(s,"indir") &&
2813 instr(PL_origargv[0],"perl"))
2819 while (s < PL_bufend && isSPACE(*s))
2821 if (s < PL_bufend) {
2822 Newz(899,newargv,PL_origargc+3,char*);
2824 while (s < PL_bufend && !isSPACE(*s))
2827 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2830 newargv = PL_origargv;
2833 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2835 Perl_croak(aTHX_ "Can't exec %s", ipath);
2839 U32 oldpdb = PL_perldb;
2840 bool oldn = PL_minus_n;
2841 bool oldp = PL_minus_p;
2843 while (*d && !isSPACE(*d)) d++;
2844 while (SPACE_OR_TAB(*d)) d++;
2847 bool switches_done = PL_doswitches;
2849 if (*d == 'M' || *d == 'm') {
2851 while (*d && !isSPACE(*d)) d++;
2852 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2855 d = moreswitches(d);
2857 if (PL_doswitches && !switches_done) {
2858 int argc = PL_origargc;
2859 char **argv = PL_origargv;
2862 } while (argc && argv[0][0] == '-' && argv[0][1]);
2863 init_argv_symbols(argc,argv);
2865 if ((PERLDB_LINE && !oldpdb) ||
2866 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2867 /* if we have already added "LINE: while (<>) {",
2868 we must not do it again */
2870 sv_setpv(PL_linestr, "");
2871 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2872 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2873 PL_last_lop = PL_last_uni = Nullch;
2874 PL_preambled = FALSE;
2876 (void)gv_fetchfile(PL_origfilename);
2879 if (PL_doswitches && !switches_done) {
2880 int argc = PL_origargc;
2881 char **argv = PL_origargv;
2884 } while (argc && argv[0][0] == '-' && argv[0][1]);
2885 init_argv_symbols(argc,argv);
2891 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2893 PL_lex_state = LEX_FORMLINE;
2898 #ifdef PERL_STRICT_CR
2899 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2901 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2903 case ' ': case '\t': case '\f': case 013:
2904 #ifdef MACOS_TRADITIONAL
2911 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2912 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2913 /* handle eval qq[#line 1 "foo"\n ...] */
2914 CopLINE_dec(PL_curcop);
2918 while (s < d && *s != '\n')
2922 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2923 Perl_croak(aTHX_ "panic: input overflow");
2925 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2927 PL_lex_state = LEX_FORMLINE;
2937 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2944 while (s < PL_bufend && SPACE_OR_TAB(*s))
2947 if (strnEQ(s,"=>",2)) {
2948 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2949 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2950 "### Saw unary minus before =>, forcing word '%s'\n", s);
2952 OPERATOR('-'); /* unary minus */
2954 PL_last_uni = PL_oldbufptr;
2956 case 'r': ftst = OP_FTEREAD; break;
2957 case 'w': ftst = OP_FTEWRITE; break;
2958 case 'x': ftst = OP_FTEEXEC; break;
2959 case 'o': ftst = OP_FTEOWNED; break;
2960 case 'R': ftst = OP_FTRREAD; break;
2961 case 'W': ftst = OP_FTRWRITE; break;
2962 case 'X': ftst = OP_FTREXEC; break;
2963 case 'O': ftst = OP_FTROWNED; break;
2964 case 'e': ftst = OP_FTIS; break;
2965 case 'z': ftst = OP_FTZERO; break;
2966 case 's': ftst = OP_FTSIZE; break;
2967 case 'f': ftst = OP_FTFILE; break;
2968 case 'd': ftst = OP_FTDIR; break;
2969 case 'l': ftst = OP_FTLINK; break;
2970 case 'p': ftst = OP_FTPIPE; break;
2971 case 'S': ftst = OP_FTSOCK; break;
2972 case 'u': ftst = OP_FTSUID; break;
2973 case 'g': ftst = OP_FTSGID; break;
2974 case 'k': ftst = OP_FTSVTX; break;
2975 case 'b': ftst = OP_FTBLK; break;
2976 case 'c': ftst = OP_FTCHR; break;
2977 case 't': ftst = OP_FTTTY; break;
2978 case 'T': ftst = OP_FTTEXT; break;
2979 case 'B': ftst = OP_FTBINARY; break;
2980 case 'M': case 'A': case 'C':
2981 gv_fetchpv("\024",TRUE, SVt_PV);
2983 case 'M': ftst = OP_FTMTIME; break;
2984 case 'A': ftst = OP_FTATIME; break;
2985 case 'C': ftst = OP_FTCTIME; break;
2993 PL_last_lop_op = (OPCODE)ftst;
2994 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2995 "### Saw file test %c\n", (int)ftst);
3000 /* Assume it was a minus followed by a one-letter named
3001 * subroutine call (or a -bareword), then. */
3002 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3003 "### '-%c' looked like a file test but was not\n",
3012 if (PL_expect == XOPERATOR)
3017 else if (*s == '>') {
3020 if (isIDFIRST_lazy_if(s,UTF)) {
3021 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
3029 if (PL_expect == XOPERATOR)
3032 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3034 OPERATOR('-'); /* unary minus */
3041 if (PL_expect == XOPERATOR)
3046 if (PL_expect == XOPERATOR)
3049 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3055 if (PL_expect != XOPERATOR) {
3056 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3057 PL_expect = XOPERATOR;
3058 force_ident(PL_tokenbuf, '*');
3071 if (PL_expect == XOPERATOR) {
3075 PL_tokenbuf[0] = '%';
3076 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
3077 if (!PL_tokenbuf[1]) {
3080 PL_pending_ident = '%';
3099 switch (PL_expect) {
3102 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3104 PL_bufptr = s; /* update in case we back off */
3110 PL_expect = XTERMBLOCK;
3114 while (isIDFIRST_lazy_if(s,UTF)) {
3115 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3116 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3117 if (tmp < 0) tmp = -tmp;
3133 d = scan_str(d,TRUE,TRUE);
3135 /* MUST advance bufptr here to avoid bogus
3136 "at end of line" context messages from yyerror().
3138 PL_bufptr = s + len;
3139 yyerror("Unterminated attribute parameter in attribute list");
3142 return REPORT(0); /* EOF indicator */
3146 SV *sv = newSVpvn(s, len);
3147 sv_catsv(sv, PL_lex_stuff);
3148 attrs = append_elem(OP_LIST, attrs,
3149 newSVOP(OP_CONST, 0, sv));
3150 SvREFCNT_dec(PL_lex_stuff);
3151 PL_lex_stuff = Nullsv;
3154 if (len == 6 && strnEQ(s, "unique", len)) {
3155 if (PL_in_my == KEY_our)
3157 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3159 ; /* skip to avoid loading attributes.pm */
3162 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3165 /* NOTE: any CV attrs applied here need to be part of
3166 the CVf_BUILTIN_ATTRS define in cv.h! */
3167 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3168 CvLVALUE_on(PL_compcv);
3169 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3170 CvLOCKED_on(PL_compcv);
3171 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3172 CvMETHOD_on(PL_compcv);
3173 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3174 CvASSERTION_on(PL_compcv);
3175 /* After we've set the flags, it could be argued that
3176 we don't need to do the attributes.pm-based setting
3177 process, and shouldn't bother appending recognized
3178 flags. To experiment with that, uncomment the
3179 following "else". (Note that's already been
3180 uncommented. That keeps the above-applied built-in
3181 attributes from being intercepted (and possibly
3182 rejected) by a package's attribute routines, but is
3183 justified by the performance win for the common case
3184 of applying only built-in attributes.) */
3186 attrs = append_elem(OP_LIST, attrs,
3187 newSVOP(OP_CONST, 0,
3191 if (*s == ':' && s[1] != ':')
3194 break; /* require real whitespace or :'s */
3196 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3197 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3198 char q = ((*s == '\'') ? '"' : '\'');
3199 /* If here for an expression, and parsed no attrs, back off. */
3200 if (tmp == '=' && !attrs) {
3204 /* MUST advance bufptr here to avoid bogus "at end of line"
3205 context messages from yyerror().
3209 yyerror("Unterminated attribute list");
3211 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3219 PL_nextval[PL_nexttoke].opval = attrs;
3227 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3228 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3245 if (PL_lex_brackets <= 0)
3246 yyerror("Unmatched right square bracket");
3249 if (PL_lex_state == LEX_INTERPNORMAL) {
3250 if (PL_lex_brackets == 0) {
3251 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3252 PL_lex_state = LEX_INTERPEND;
3259 if (PL_lex_brackets > 100) {
3260 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3262 switch (PL_expect) {
3264 if (PL_lex_formbrack) {
3268 if (PL_oldoldbufptr == PL_last_lop)
3269 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3271 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3272 OPERATOR(HASHBRACK);
3274 while (s < PL_bufend && SPACE_OR_TAB(*s))
3277 PL_tokenbuf[0] = '\0';
3278 if (d < PL_bufend && *d == '-') {
3279 PL_tokenbuf[0] = '-';
3281 while (d < PL_bufend && SPACE_OR_TAB(*d))
3284 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3285 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3287 while (d < PL_bufend && SPACE_OR_TAB(*d))
3290 char minus = (PL_tokenbuf[0] == '-');
3291 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3299 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3304 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3309 if (PL_oldoldbufptr == PL_last_lop)
3310 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3312 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3315 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3317 /* This hack is to get the ${} in the message. */
3319 yyerror("syntax error");
3322 OPERATOR(HASHBRACK);
3324 /* This hack serves to disambiguate a pair of curlies
3325 * as being a block or an anon hash. Normally, expectation
3326 * determines that, but in cases where we're not in a
3327 * position to expect anything in particular (like inside
3328 * eval"") we have to resolve the ambiguity. This code
3329 * covers the case where the first term in the curlies is a
3330 * quoted string. Most other cases need to be explicitly
3331 * disambiguated by prepending a `+' before the opening
3332 * curly in order to force resolution as an anon hash.
3334 * XXX should probably propagate the outer expectation
3335 * into eval"" to rely less on this hack, but that could
3336 * potentially break current behavior of eval"".
3340 if (*s == '\'' || *s == '"' || *s == '`') {
3341 /* common case: get past first string, handling escapes */
3342 for (t++; t < PL_bufend && *t != *s;)
3343 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3347 else if (*s == 'q') {
3350 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3353 /* skip q//-like construct */
3355 char open, close, term;
3358 while (t < PL_bufend && isSPACE(*t))
3360 /* check for q => */
3361 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3362 OPERATOR(HASHBRACK);
3366 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3370 for (t++; t < PL_bufend; t++) {
3371 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3373 else if (*t == open)
3377 for (t++; t < PL_bufend; t++) {
3378 if (*t == '\\' && t+1 < PL_bufend)
3380 else if (*t == close && --brackets <= 0)
3382 else if (*t == open)
3389 /* skip plain q word */
3390 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3393 else if (isALNUM_lazy_if(t,UTF)) {
3395 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3398 while (t < PL_bufend && isSPACE(*t))
3400 /* if comma follows first term, call it an anon hash */
3401 /* XXX it could be a comma expression with loop modifiers */
3402 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3403 || (*t == '=' && t[1] == '>')))
3404 OPERATOR(HASHBRACK);
3405 if (PL_expect == XREF)
3408 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3414 yylval.ival = CopLINE(PL_curcop);
3415 if (isSPACE(*s) || *s == '#')
3416 PL_copline = NOLINE; /* invalidate current command line number */
3421 if (PL_lex_brackets <= 0)
3422 yyerror("Unmatched right curly bracket");
3424 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3425 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3426 PL_lex_formbrack = 0;
3427 if (PL_lex_state == LEX_INTERPNORMAL) {
3428 if (PL_lex_brackets == 0) {
3429 if (PL_expect & XFAKEBRACK) {
3430 PL_expect &= XENUMMASK;
3431 PL_lex_state = LEX_INTERPEND;
3433 return yylex(); /* ignore fake brackets */
3435 if (*s == '-' && s[1] == '>')
3436 PL_lex_state = LEX_INTERPENDMAYBE;
3437 else if (*s != '[' && *s != '{')
3438 PL_lex_state = LEX_INTERPEND;
3441 if (PL_expect & XFAKEBRACK) {
3442 PL_expect &= XENUMMASK;
3444 return yylex(); /* ignore fake brackets */
3454 if (PL_expect == XOPERATOR) {
3455 if (ckWARN(WARN_SEMICOLON)
3456 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3458 CopLINE_dec(PL_curcop);
3459 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3460 CopLINE_inc(PL_curcop);
3465 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3467 PL_expect = XOPERATOR;
3468 force_ident(PL_tokenbuf, '&');
3472 yylval.ival = (OPpENTERSUB_AMPER<<8);
3491 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3492 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3494 if (PL_expect == XSTATE && isALPHA(tmp) &&
3495 (s == PL_linestart+1 || s[-2] == '\n') )
3497 if (PL_in_eval && !PL_rsfp) {
3502 if (strnEQ(s,"=cut",4)) {
3516 PL_doextract = TRUE;
3519 if (PL_lex_brackets < PL_lex_formbrack) {
3521 #ifdef PERL_STRICT_CR
3522 for (t = s; SPACE_OR_TAB(*t); t++) ;
3524 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3526 if (*t == '\n' || *t == '#') {
3538 /* was this !=~ where !~ was meant?
3539 * warn on m:!=~\s+([/?]|[msy]\W|tr\W): */
3541 if (*s == '~' && ckWARN(WARN_SYNTAX)) {
3544 while (t < PL_bufend && isSPACE(*t))
3547 if (*t == '/' || *t == '?' ||
3548 ((*t == 'm' || *t == 's' || *t == 'y') && !isALNUM(t[1])) ||
3549 (*t == 't' && t[1] == 'r' && !isALNUM(t[2])))
3550 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3551 "!=~ should be !~");
3560 if (PL_expect != XOPERATOR) {
3561 if (s[1] != '<' && !strchr(s,'>'))
3564 s = scan_heredoc(s);
3566 s = scan_inputsymbol(s);
3567 TERM(sublex_start());
3572 SHop(OP_LEFT_SHIFT);
3586 SHop(OP_RIGHT_SHIFT);
3595 if (PL_expect == XOPERATOR) {
3596 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3599 return REPORT(','); /* grandfather non-comma-format format */
3603 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3604 PL_tokenbuf[0] = '@';
3605 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3606 sizeof PL_tokenbuf - 1, FALSE);
3607 if (PL_expect == XOPERATOR)
3608 no_op("Array length", s);
3609 if (!PL_tokenbuf[1])
3611 PL_expect = XOPERATOR;
3612 PL_pending_ident = '#';
3616 PL_tokenbuf[0] = '$';
3617 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3618 sizeof PL_tokenbuf - 1, FALSE);
3619 if (PL_expect == XOPERATOR)
3621 if (!PL_tokenbuf[1]) {
3623 yyerror("Final $ should be \\$ or $name");
3627 /* This kludge not intended to be bulletproof. */
3628 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3629 yylval.opval = newSVOP(OP_CONST, 0,
3630 newSViv(PL_compiling.cop_arybase));
3631 yylval.opval->op_private = OPpCONST_ARYBASE;
3637 if (PL_lex_state == LEX_NORMAL)
3640 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3643 PL_tokenbuf[0] = '@';
3644 if (ckWARN(WARN_SYNTAX)) {
3646 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3649 PL_bufptr = skipspace(PL_bufptr);
3650 while (t < PL_bufend && *t != ']')
3652 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3653 "Multidimensional syntax %.*s not supported",
3654 (t - PL_bufptr) + 1, PL_bufptr);
3658 else if (*s == '{') {
3659 PL_tokenbuf[0] = '%';
3660 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3661 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3663 char tmpbuf[sizeof PL_tokenbuf];
3665 for (t++; isSPACE(*t); t++) ;
3666 if (isIDFIRST_lazy_if(t,UTF)) {
3667 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3668 for (; isSPACE(*t); t++) ;
3669 if (*t == ';' && get_cv(tmpbuf, FALSE))
3670 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3671 "You need to quote \"%s\"", tmpbuf);
3677 PL_expect = XOPERATOR;
3678 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3679 bool islop = (PL_last_lop == PL_oldoldbufptr);
3680 if (!islop || PL_last_lop_op == OP_GREPSTART)
3681 PL_expect = XOPERATOR;
3682 else if (strchr("$@\"'`q", *s))
3683 PL_expect = XTERM; /* e.g. print $fh "foo" */
3684 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3685 PL_expect = XTERM; /* e.g. print $fh &sub */
3686 else if (isIDFIRST_lazy_if(s,UTF)) {
3687 char tmpbuf[sizeof PL_tokenbuf];
3688 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3689 if ((tmp = keyword(tmpbuf, len))) {
3690 /* binary operators exclude handle interpretations */
3702 PL_expect = XTERM; /* e.g. print $fh length() */
3707 PL_expect = XTERM; /* e.g. print $fh subr() */
3710 else if (isDIGIT(*s))
3711 PL_expect = XTERM; /* e.g. print $fh 3 */
3712 else if (*s == '.' && isDIGIT(s[1]))
3713 PL_expect = XTERM; /* e.g. print $fh .3 */
3714 else if ((*s == '?' || *s == '-' || *s == '+')
3715 && !isSPACE(s[1]) && s[1] != '=')
3716 PL_expect = XTERM; /* e.g. print $fh -1 */
3717 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3718 PL_expect = XTERM; /* e.g. print $fh /.../
3719 XXX except DORDOR operator */
3720 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3721 PL_expect = XTERM; /* print $fh <<"EOF" */
3723 PL_pending_ident = '$';
3727 if (PL_expect == XOPERATOR)
3729 PL_tokenbuf[0] = '@';
3730 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3731 if (!PL_tokenbuf[1]) {
3734 if (PL_lex_state == LEX_NORMAL)
3736 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3738 PL_tokenbuf[0] = '%';
3740 /* Warn about @ where they meant $. */
3741 if (ckWARN(WARN_SYNTAX)) {
3742 if (*s == '[' || *s == '{') {
3744 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3746 if (*t == '}' || *t == ']') {
3748 PL_bufptr = skipspace(PL_bufptr);
3749 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3750 "Scalar value %.*s better written as $%.*s",
3751 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3756 PL_pending_ident = '@';
3759 case '/': /* may be division, defined-or, or pattern */
3760 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3764 case '?': /* may either be conditional or pattern */
3765 if(PL_expect == XOPERATOR) {
3773 /* A // operator. */
3783 /* Disable warning on "study /blah/" */
3784 if (PL_oldoldbufptr == PL_last_uni
3785 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3786 || memNE(PL_last_uni, "study", 5)
3787 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3790 s = scan_pat(s,OP_MATCH);
3791 TERM(sublex_start());
3795 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3796 #ifdef PERL_STRICT_CR
3799 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3801 && (s == PL_linestart || s[-1] == '\n') )
3803 PL_lex_formbrack = 0;
3807 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3813 yylval.ival = OPf_SPECIAL;
3819 if (PL_expect != XOPERATOR)
3824 case '0': case '1': case '2': case '3': case '4':
3825 case '5': case '6': case '7': case '8': case '9':
3826 s = scan_num(s, &yylval);
3827 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3828 "### Saw number in '%s'\n", s);
3830 if (PL_expect == XOPERATOR)
3835 s = scan_str(s,FALSE,FALSE);
3836 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3837 "### Saw string before '%s'\n", s);
3839 if (PL_expect == XOPERATOR) {
3840 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3843 return REPORT(','); /* grandfather non-comma-format format */
3849 missingterm((char*)0);
3850 yylval.ival = OP_CONST;
3851 TERM(sublex_start());
3854 s = scan_str(s,FALSE,FALSE);
3855 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3856 "### Saw string before '%s'\n", s);
3858 if (PL_expect == XOPERATOR) {
3859 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3862 return REPORT(','); /* grandfather non-comma-format format */
3868 missingterm((char*)0);
3869 yylval.ival = OP_CONST;
3870 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3871 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3872 yylval.ival = OP_STRINGIFY;
3876 TERM(sublex_start());
3879 s = scan_str(s,FALSE,FALSE);
3880 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3881 "### Saw backtick string before '%s'\n", s);
3883 if (PL_expect == XOPERATOR)
3884 no_op("Backticks",s);
3886 missingterm((char*)0);
3887 yylval.ival = OP_BACKTICK;
3889 TERM(sublex_start());
3893 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3894 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3896 if (PL_expect == XOPERATOR)
3897 no_op("Backslash",s);
3901 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3905 while (isDIGIT(*start) || *start == '_')
3907 if (*start == '.' && isDIGIT(start[1])) {
3908 s = scan_num(s, &yylval);
3911 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3912 else if (!isALPHA(*start) && (PL_expect == XTERM
3913 || PL_expect == XREF || PL_expect == XSTATE
3914 || PL_expect == XTERMORDORDOR)) {
3918 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3921 s = scan_num(s, &yylval);
3928 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3968 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3970 /* Some keywords can be followed by any delimiter, including ':' */
3971 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3972 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3973 (PL_tokenbuf[0] == 'q' &&
3974 strchr("qwxr", PL_tokenbuf[1])))));
3976 /* x::* is just a word, unless x is "CORE" */
3977 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3981 while (d < PL_bufend && isSPACE(*d))
3982 d++; /* no comments skipped here, or s### is misparsed */
3984 /* Is this a label? */
3985 if (!tmp && PL_expect == XSTATE
3986 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3988 yylval.pval = savepv(PL_tokenbuf);
3993 /* Check for keywords */
3994 tmp = keyword(PL_tokenbuf, len);
3996 /* Is this a word before a => operator? */
3997 if (*d == '=' && d[1] == '>') {
3999 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
4000 yylval.opval->op_private = OPpCONST_BARE;
4001 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4002 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4006 if (tmp < 0) { /* second-class keyword? */
4007 GV *ogv = Nullgv; /* override (winner) */
4008 GV *hgv = Nullgv; /* hidden (loser) */
4009 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
4011 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
4014 if (GvIMPORTED_CV(gv))
4016 else if (! CvMETHOD(cv))
4020 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
4021 (gv = *gvp) != (GV*)&PL_sv_undef &&
4022 GvCVu(gv) && GvIMPORTED_CV(gv))
4029 tmp = 0; /* overridden by import or by GLOBAL */
4032 && -tmp==KEY_lock /* XXX generalizable kludge */
4034 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
4036 tmp = 0; /* any sub overrides "weak" keyword */
4041 && PL_expect != XOPERATOR
4042 && PL_expect != XTERMORDORDOR)
4044 /* any sub overrides the "err" keyword, except when really an
4045 * operator is expected */
4048 else { /* no override */
4050 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
4051 Perl_warner(aTHX_ packWARN(WARN_MISC),
4052 "dump() better written as CORE::dump()");
4056 if (ckWARN(WARN_AMBIGUOUS) && hgv
4057 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
4058 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4059 "Ambiguous call resolved as CORE::%s(), %s",
4060 GvENAME(hgv), "qualify as such or use &");
4067 default: /* not a keyword */
4071 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
4073 /* Get the rest if it looks like a package qualifier */
4075 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
4077 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
4080 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
4081 *s == '\'' ? "'" : "::");
4086 if (PL_expect == XOPERATOR) {
4087 if (PL_bufptr == PL_linestart) {
4088 CopLINE_dec(PL_curcop);
4089 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
4090 CopLINE_inc(PL_curcop);
4093 no_op("Bareword",s);
4096 /* Look for a subroutine with this name in current package,
4097 unless name is "Foo::", in which case Foo is a bearword
4098 (and a package name). */
4101 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
4103 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
4104 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
4105 "Bareword \"%s\" refers to nonexistent package",
4108 PL_tokenbuf[len] = '\0';
4115 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
4118 /* if we saw a global override before, get the right name */
4121 sv = newSVpvn("CORE::GLOBAL::",14);
4122 sv_catpv(sv,PL_tokenbuf);
4125 sv = newSVpv(PL_tokenbuf,0);
4127 /* Presume this is going to be a bareword of some sort. */
4130 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
4131 yylval.opval->op_private = OPpCONST_BARE;
4132 /* UTF-8 package name? */
4133 if (UTF && !IN_BYTES &&
4134 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
4137 /* And if "Foo::", then that's what it certainly is. */
4142 /* See if it's the indirect object for a list operator. */
4144 if (PL_oldoldbufptr &&
4145 PL_oldoldbufptr < PL_bufptr &&
4146 (PL_oldoldbufptr == PL_last_lop
4147 || PL_oldoldbufptr == PL_last_uni) &&
4148 /* NO SKIPSPACE BEFORE HERE! */
4149 (PL_expect == XREF ||
4150 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4152 bool immediate_paren = *s == '(';
4154 /* (Now we can afford to cross potential line boundary.) */
4157 /* Two barewords in a row may indicate method call. */
4159 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4162 /* If not a declared subroutine, it's an indirect object. */
4163 /* (But it's an indir obj regardless for sort.) */
4165 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4166 ((!gv || !GvCVu(gv)) &&
4167 (PL_last_lop_op != OP_MAPSTART &&
4168 PL_last_lop_op != OP_GREPSTART))))
4170 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4175 PL_expect = XOPERATOR;
4178 /* Is this a word before a => operator? */
4179 if (*s == '=' && s[1] == '>' && !pkgname) {
4181 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4182 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4183 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4187 /* If followed by a paren, it's certainly a subroutine. */
4190 if (gv && GvCVu(gv)) {
4191 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4192 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4197 PL_nextval[PL_nexttoke].opval = yylval.opval;
4198 PL_expect = XOPERATOR;
4204 /* If followed by var or block, call it a method (unless sub) */
4206 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4207 PL_last_lop = PL_oldbufptr;
4208 PL_last_lop_op = OP_METHOD;
4212 /* If followed by a bareword, see if it looks like indir obj. */
4215 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4216 && (tmp = intuit_method(s,gv)))
4219 /* Not a method, so call it a subroutine (if defined) */
4221 if (gv && GvCVu(gv)) {
4223 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4224 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4225 "Ambiguous use of -%s resolved as -&%s()",
4226 PL_tokenbuf, PL_tokenbuf);
4227 /* Check for a constant sub */
4229 if ((sv = cv_const_sv(cv))) {
4231 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4232 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4233 yylval.opval->op_private = 0;
4237 /* Resolve to GV now. */
4238 op_free(yylval.opval);
4239 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4240 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4241 PL_last_lop = PL_oldbufptr;
4242 PL_last_lop_op = OP_ENTERSUB;
4243 /* Is there a prototype? */
4246 char *proto = SvPV((SV*)cv, len);
4249 if (*proto == '$' && proto[1] == '\0')
4251 while (*proto == ';')
4253 if (*proto == '&' && *s == '{') {
4254 sv_setpv(PL_subname, PL_curstash ?
4255 "__ANON__" : "__ANON__::__ANON__");
4259 PL_nextval[PL_nexttoke].opval = yylval.opval;
4265 /* Call it a bare word */
4267 if (PL_hints & HINT_STRICT_SUBS)
4268 yylval.opval->op_private |= OPpCONST_STRICT;
4271 if (ckWARN(WARN_RESERVED)) {
4272 if (lastchar != '-') {
4273 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4274 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4275 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4282 if ((lastchar == '*' || lastchar == '%' || lastchar == '&')
4283 && ckWARN_d(WARN_AMBIGUOUS)) {
4284 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4285 "Operator or semicolon missing before %c%s",
4286 lastchar, PL_tokenbuf);
4287 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4288 "Ambiguous use of %c resolved as operator %c",
4289 lastchar, lastchar);
4295 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4296 newSVpv(CopFILE(PL_curcop),0));
4300 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4301 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4304 case KEY___PACKAGE__:
4305 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4307 ? newSVpv(HvNAME(PL_curstash), 0)
4316 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4317 char *pname = "main";
4318 if (PL_tokenbuf[2] == 'D')
4319 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4320 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4323 GvIOp(gv) = newIO();
4324 IoIFP(GvIOp(gv)) = PL_rsfp;
4325 #if defined(HAS_FCNTL) && defined(F_SETFD)
4327 int fd = PerlIO_fileno(PL_rsfp);
4328 fcntl(fd,F_SETFD,fd >= 3);
4331 /* Mark this internal pseudo-handle as clean */
4332 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4334 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4335 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4336 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4338 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4339 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4340 /* if the script was opened in binmode, we need to revert
4341 * it to text mode for compatibility; but only iff it has CRs
4342 * XXX this is a questionable hack at best. */
4343 if (PL_bufend-PL_bufptr > 2
4344 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4347 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4348 loc = PerlIO_tell(PL_rsfp);
4349 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4352 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4354 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4355 #endif /* NETWARE */
4356 #ifdef PERLIO_IS_STDIO /* really? */
4357 # if defined(__BORLANDC__)
4358 /* XXX see note in do_binmode() */
4359 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4363 PerlIO_seek(PL_rsfp, loc, 0);
4367 #ifdef PERLIO_LAYERS
4370 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4371 else if (PL_encoding) {
4378 XPUSHs(PL_encoding);
4380 call_method("name", G_SCALAR);
4384 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4385 Perl_form(aTHX_ ":encoding(%"SVf")",
4403 if (PL_expect == XSTATE) {
4410 if (*s == ':' && s[1] == ':') {
4413 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4414 if (!(tmp = keyword(PL_tokenbuf, len)))
4415 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4429 LOP(OP_ACCEPT,XTERM);
4435 LOP(OP_ATAN2,XTERM);
4441 LOP(OP_BINMODE,XTERM);
4444 LOP(OP_BLESS,XTERM);
4453 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4470 if (!PL_cryptseen) {
4471 PL_cryptseen = TRUE;
4475 LOP(OP_CRYPT,XTERM);
4478 LOP(OP_CHMOD,XTERM);
4481 LOP(OP_CHOWN,XTERM);
4484 LOP(OP_CONNECT,XTERM);
4500 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4504 PL_hints |= HINT_BLOCK_SCOPE;
4514 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4515 LOP(OP_DBMOPEN,XTERM);
4521 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4528 yylval.ival = CopLINE(PL_curcop);
4542 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4543 UNIBRACK(OP_ENTEREVAL);
4561 case KEY_endhostent:
4567 case KEY_endservent:
4570 case KEY_endprotoent:
4581 yylval.ival = CopLINE(PL_curcop);
4583 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4585 if ((PL_bufend - p) >= 3 &&
4586 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4588 else if ((PL_bufend - p) >= 4 &&
4589 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4592 if (isIDFIRST_lazy_if(p,UTF)) {
4593 p = scan_ident(p, PL_bufend,
4594 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4598 Perl_croak(aTHX_ "Missing $ on loop variable");
4603 LOP(OP_FORMLINE,XTERM);
4609 LOP(OP_FCNTL,XTERM);
4615 LOP(OP_FLOCK,XTERM);
4624 LOP(OP_GREPSTART, XREF);
4627 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4642 case KEY_getpriority:
4643 LOP(OP_GETPRIORITY,XTERM);
4645 case KEY_getprotobyname:
4648 case KEY_getprotobynumber:
4649 LOP(OP_GPBYNUMBER,XTERM);
4651 case KEY_getprotoent:
4663 case KEY_getpeername:
4664 UNI(OP_GETPEERNAME);
4666 case KEY_gethostbyname:
4669 case KEY_gethostbyaddr:
4670 LOP(OP_GHBYADDR,XTERM);
4672 case KEY_gethostent:
4675 case KEY_getnetbyname:
4678 case KEY_getnetbyaddr:
4679 LOP(OP_GNBYADDR,XTERM);
4684 case KEY_getservbyname:
4685 LOP(OP_GSBYNAME,XTERM);
4687 case KEY_getservbyport:
4688 LOP(OP_GSBYPORT,XTERM);
4690 case KEY_getservent:
4693 case KEY_getsockname:
4694 UNI(OP_GETSOCKNAME);
4696 case KEY_getsockopt:
4697 LOP(OP_GSOCKOPT,XTERM);
4719 yylval.ival = CopLINE(PL_curcop);
4723 LOP(OP_INDEX,XTERM);
4729 LOP(OP_IOCTL,XTERM);
4741 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4773 LOP(OP_LISTEN,XTERM);
4782 s = scan_pat(s,OP_MATCH);
4783 TERM(sublex_start());
4786 LOP(OP_MAPSTART, XREF);
4789 LOP(OP_MKDIR,XTERM);
4792 LOP(OP_MSGCTL,XTERM);
4795 LOP(OP_MSGGET,XTERM);
4798 LOP(OP_MSGRCV,XTERM);
4801 LOP(OP_MSGSND,XTERM);
4807 if (isIDFIRST_lazy_if(s,UTF)) {
4808 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4809 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4811 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4812 if (!PL_in_my_stash) {
4815 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4823 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4830 if (PL_expect != XSTATE)
4831 yyerror("\"no\" not allowed in expression");
4832 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4833 s = force_version(s, FALSE);
4838 if (*s == '(' || (s = skipspace(s), *s == '('))
4845 if (isIDFIRST_lazy_if(s,UTF)) {
4847 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4848 for (t=d; *t && isSPACE(*t); t++) ;
4849 if ( *t && strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4851 && !(t[0] == '=' && t[1] == '>')
4853 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4854 "Precedence problem: open %.*s should be open(%.*s)",
4855 d - s, s, d - s, s);
4861 yylval.ival = OP_OR;
4871 LOP(OP_OPEN_DIR,XTERM);
4874 checkcomma(s,PL_tokenbuf,"filehandle");
4878 checkcomma(s,PL_tokenbuf,"filehandle");
4897 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4901 LOP(OP_PIPE_OP,XTERM);
4904 s = scan_str(s,FALSE,FALSE);
4906 missingterm((char*)0);
4907 yylval.ival = OP_CONST;
4908 TERM(sublex_start());
4914 s = scan_str(s,FALSE,FALSE);
4916 missingterm((char*)0);
4918 if (SvCUR(PL_lex_stuff)) {
4921 d = SvPV_force(PL_lex_stuff, len);
4924 for (; isSPACE(*d) && len; --len, ++d) ;
4927 if (!warned && ckWARN(WARN_QW)) {
4928 for (; !isSPACE(*d) && len; --len, ++d) {
4930 Perl_warner(aTHX_ packWARN(WARN_QW),
4931 "Possible attempt to separate words with commas");
4934 else if (*d == '#') {
4935 Perl_warner(aTHX_ packWARN(WARN_QW),
4936 "Possible attempt to put comments in qw() list");
4942 for (; !isSPACE(*d) && len; --len, ++d) ;
4944 sv = newSVpvn(b, d-b);
4945 if (DO_UTF8(PL_lex_stuff))
4947 words = append_elem(OP_LIST, words,
4948 newSVOP(OP_CONST, 0, tokeq(sv)));
4952 PL_nextval[PL_nexttoke].opval = words;
4957 SvREFCNT_dec(PL_lex_stuff);
4958 PL_lex_stuff = Nullsv;
4964 s = scan_str(s,FALSE,FALSE);
4966 missingterm((char*)0);
4967 yylval.ival = OP_STRINGIFY;
4968 if (SvIVX(PL_lex_stuff) == '\'')
4969 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4970 TERM(sublex_start());
4973 s = scan_pat(s,OP_QR);
4974 TERM(sublex_start());
4977 s = scan_str(s,FALSE,FALSE);
4979 missingterm((char*)0);
4980 yylval.ival = OP_BACKTICK;
4982 TERM(sublex_start());
4990 s = force_version(s, FALSE);
4992 else if (*s != 'v' || !isDIGIT(s[1])
4993 || (s = force_version(s, TRUE), *s == 'v'))
4995 *PL_tokenbuf = '\0';
4996 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4997 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4998 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
5000 yyerror("<> should be quotes");
5008 s = force_word(s,WORD,TRUE,FALSE,FALSE);
5012 LOP(OP_RENAME,XTERM);
5021 LOP(OP_RINDEX,XTERM);
5031 UNIDOR(OP_READLINE);
5044 LOP(OP_REVERSE,XTERM);
5047 UNIDOR(OP_READLINK);
5055 TERM(sublex_start());
5057 TOKEN(1); /* force error */
5066 LOP(OP_SELECT,XTERM);
5072 LOP(OP_SEMCTL,XTERM);
5075 LOP(OP_SEMGET,XTERM);
5078 LOP(OP_SEMOP,XTERM);
5084 LOP(OP_SETPGRP,XTERM);
5086 case KEY_setpriority:
5087 LOP(OP_SETPRIORITY,XTERM);
5089 case KEY_sethostent:
5095 case KEY_setservent:
5098 case KEY_setprotoent:
5108 LOP(OP_SEEKDIR,XTERM);
5110 case KEY_setsockopt:
5111 LOP(OP_SSOCKOPT,XTERM);
5117 LOP(OP_SHMCTL,XTERM);
5120 LOP(OP_SHMGET,XTERM);
5123 LOP(OP_SHMREAD,XTERM);
5126 LOP(OP_SHMWRITE,XTERM);
5129 LOP(OP_SHUTDOWN,XTERM);
5138 LOP(OP_SOCKET,XTERM);
5140 case KEY_socketpair:
5141 LOP(OP_SOCKPAIR,XTERM);
5144 checkcomma(s,PL_tokenbuf,"subroutine name");
5146 if (*s == ';' || *s == ')') /* probably a close */
5147 Perl_croak(aTHX_ "sort is now a reserved word");
5149 s = force_word(s,WORD,TRUE,TRUE,FALSE);
5153 LOP(OP_SPLIT,XTERM);
5156 LOP(OP_SPRINTF,XTERM);
5159 LOP(OP_SPLICE,XTERM);
5174 LOP(OP_SUBSTR,XTERM);
5180 char tmpbuf[sizeof PL_tokenbuf];
5181 SSize_t tboffset = 0;
5182 expectation attrful;
5183 bool have_name, have_proto, bad_proto;
5188 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5189 (*s == ':' && s[1] == ':'))
5192 attrful = XATTRBLOCK;
5193 /* remember buffer pos'n for later force_word */
5194 tboffset = s - PL_oldbufptr;
5195 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5196 if (strchr(tmpbuf, ':'))
5197 sv_setpv(PL_subname, tmpbuf);
5199 sv_setsv(PL_subname,PL_curstname);
5200 sv_catpvn(PL_subname,"::",2);
5201 sv_catpvn(PL_subname,tmpbuf,len);
5208 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5209 PL_expect = XTERMBLOCK;
5210 attrful = XATTRTERM;
5211 sv_setpv(PL_subname,"?");
5215 if (key == KEY_format) {
5217 PL_lex_formbrack = PL_lex_brackets + 1;
5219 (void) force_word(PL_oldbufptr + tboffset, WORD,
5224 /* Look for a prototype */
5228 s = scan_str(s,FALSE,FALSE);
5230 Perl_croak(aTHX_ "Prototype not terminated");
5231 /* strip spaces and check for bad characters */
5232 d = SvPVX(PL_lex_stuff);
5235 for (p = d; *p; ++p) {
5238 if (!strchr("$@%*;[]&\\", *p))
5243 if (bad_proto && ckWARN(WARN_SYNTAX))
5244 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5245 "Illegal character in prototype for %"SVf" : %s",
5247 SvCUR(PL_lex_stuff) = tmp;
5255 if (*s == ':' && s[1] != ':')
5256 PL_expect = attrful;
5257 else if (*s != '{' && key == KEY_sub) {
5259 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5261 Perl_croak(aTHX_ "Illegal declaration of subroutine %"SVf, PL_subname);
5265 PL_nextval[PL_nexttoke].opval =
5266 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5267 PL_lex_stuff = Nullsv;
5271 sv_setpv(PL_subname,
5272 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5275 (void) force_word(PL_oldbufptr + tboffset, WORD,
5284 LOP(OP_SYSTEM,XREF);
5287 LOP(OP_SYMLINK,XTERM);
5290 LOP(OP_SYSCALL,XTERM);
5293 LOP(OP_SYSOPEN,XTERM);
5296 LOP(OP_SYSSEEK,XTERM);
5299 LOP(OP_SYSREAD,XTERM);
5302 LOP(OP_SYSWRITE,XTERM);
5306 TERM(sublex_start());
5327 LOP(OP_TRUNCATE,XTERM);
5339 yylval.ival = CopLINE(PL_curcop);
5343 yylval.ival = CopLINE(PL_curcop);
5347 LOP(OP_UNLINK,XTERM);
5353 LOP(OP_UNPACK,XTERM);
5356 LOP(OP_UTIME,XTERM);
5362 LOP(OP_UNSHIFT,XTERM);
5365 if (PL_expect != XSTATE)
5366 yyerror("\"use\" not allowed in expression");
5368 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5369 s = force_version(s, TRUE);
5370 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5371 PL_nextval[PL_nexttoke].opval = Nullop;
5374 else if (*s == 'v') {
5375 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5376 s = force_version(s, FALSE);
5380 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5381 s = force_version(s, FALSE);
5393 yylval.ival = CopLINE(PL_curcop);
5397 PL_hints |= HINT_BLOCK_SCOPE;
5404 LOP(OP_WAITPID,XTERM);
5413 ctl_l[0] = toCTRL('L');
5415 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5418 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5423 if (PL_expect == XOPERATOR)
5429 yylval.ival = OP_XOR;
5434 TERM(sublex_start());
5439 #pragma segment Main
5443 S_pending_ident(pTHX)
5446 register I32 tmp = 0;
5447 /* pit holds the identifier we read and pending_ident is reset */
5448 char pit = PL_pending_ident;
5449 PL_pending_ident = 0;
5451 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5452 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5454 /* if we're in a my(), we can't allow dynamics here.
5455 $foo'bar has already been turned into $foo::bar, so
5456 just check for colons.
5458 if it's a legal name, the OP is a PADANY.
5461 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5462 if (strchr(PL_tokenbuf,':'))
5463 yyerror(Perl_form(aTHX_ "No package name allowed for "
5464 "variable %s in \"our\"",
5466 tmp = allocmy(PL_tokenbuf);
5469 if (strchr(PL_tokenbuf,':'))
5470 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5472 yylval.opval = newOP(OP_PADANY, 0);
5473 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5479 build the ops for accesses to a my() variable.
5481 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5482 then used in a comparison. This catches most, but not
5483 all cases. For instance, it catches
5484 sort { my($a); $a <=> $b }
5486 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5487 (although why you'd do that is anyone's guess).
5490 if (!strchr(PL_tokenbuf,':')) {
5492 tmp = pad_findmy(PL_tokenbuf);
5493 if (tmp != NOT_IN_PAD) {
5494 /* might be an "our" variable" */
5495 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5496 /* build ops for a bareword */
5497 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5498 sv_catpvn(sym, "::", 2);
5499 sv_catpv(sym, PL_tokenbuf+1);
5500 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5501 yylval.opval->op_private = OPpCONST_ENTERED;
5502 gv_fetchpv(SvPVX(sym),
5504 ? (GV_ADDMULTI | GV_ADDINEVAL)
5507 ((PL_tokenbuf[0] == '$') ? SVt_PV
5508 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5513 /* if it's a sort block and they're naming $a or $b */
5514 if (PL_last_lop_op == OP_SORT &&
5515 PL_tokenbuf[0] == '$' &&
5516 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5519 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5520 d < PL_bufend && *d != '\n';
5523 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5524 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5530 yylval.opval = newOP(OP_PADANY, 0);
5531 yylval.opval->op_targ = tmp;
5537 Whine if they've said @foo in a doublequoted string,
5538 and @foo isn't a variable we can find in the symbol
5541 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5542 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5543 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5544 && ckWARN(WARN_AMBIGUOUS))
5546 /* Downgraded from fatal to warning 20000522 mjd */
5547 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5548 "Possible unintended interpolation of %s in string",
5553 /* build ops for a bareword */
5554 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5555 yylval.opval->op_private = OPpCONST_ENTERED;
5556 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5557 ((PL_tokenbuf[0] == '$') ? SVt_PV
5558 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5564 Perl_keyword(pTHX_ register char *d, I32 len)
5569 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5570 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5571 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5572 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5573 if (strEQ(d,"__END__")) return KEY___END__;
5577 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5582 if (strEQ(d,"and")) return -KEY_and;
5583 if (strEQ(d,"abs")) return -KEY_abs;
5586 if (strEQ(d,"alarm")) return -KEY_alarm;
5587 if (strEQ(d,"atan2")) return -KEY_atan2;
5590 if (strEQ(d,"accept")) return -KEY_accept;
5595 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5598 if (strEQ(d,"bless")) return -KEY_bless;
5599 if (strEQ(d,"bind")) return -KEY_bind;
5600 if (strEQ(d,"binmode")) return -KEY_binmode;
5603 if (strEQ(d,"CORE")) return -KEY_CORE;
5604 if (strEQ(d,"CHECK")) return KEY_CHECK;
5609 if (strEQ(d,"cmp")) return -KEY_cmp;
5610 if (strEQ(d,"chr")) return -KEY_chr;
5611 if (strEQ(d,"cos")) return -KEY_cos;
5614 if (strEQ(d,"chop")) return -KEY_chop;
5617 if (strEQ(d,"close")) return -KEY_close;
5618 if (strEQ(d,"chdir")) return -KEY_chdir;
5619 if (strEQ(d,"chomp")) return -KEY_chomp;
5620 if (strEQ(d,"chmod")) return -KEY_chmod;
5621 if (strEQ(d,"chown")) return -KEY_chown;
5622 if (strEQ(d,"crypt")) return -KEY_crypt;
5625 if (strEQ(d,"chroot")) return -KEY_chroot;
5626 if (strEQ(d,"caller")) return -KEY_caller;
5629 if (strEQ(d,"connect")) return -KEY_connect;
5632 if (strEQ(d,"closedir")) return -KEY_closedir;
5633 if (strEQ(d,"continue")) return -KEY_continue;
5638 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5643 if (strEQ(d,"do")) return KEY_do;
5646 if (strEQ(d,"die")) return -KEY_die;
5649 if (strEQ(d,"dump")) return -KEY_dump;
5652 if (strEQ(d,"delete")) return KEY_delete;
5655 if (strEQ(d,"defined")) return KEY_defined;
5656 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5659 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5664 if (strEQ(d,"END")) return KEY_END;
5669 if (strEQ(d,"eq")) return -KEY_eq;
5672 if (strEQ(d,"eof")) return -KEY_eof;
5673 if (strEQ(d,"err")) return -KEY_err;
5674 if (strEQ(d,"exp")) return -KEY_exp;
5677 if (strEQ(d,"else")) return KEY_else;
5678 if (strEQ(d,"exit")) return -KEY_exit;
5679 if (strEQ(d,"eval")) return KEY_eval;
5680 if (strEQ(d,"exec")) return -KEY_exec;
5681 if (strEQ(d,"each")) return -KEY_each;
5684 if (strEQ(d,"elsif")) return KEY_elsif;
5687 if (strEQ(d,"exists")) return KEY_exists;
5688 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5689 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5690 "elseif should be elsif");
5693 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5694 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5697 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5700 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5701 if (strEQ(d,"endservent")) return -KEY_endservent;
5704 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5711 if (strEQ(d,"for")) return KEY_for;
5714 if (strEQ(d,"fork")) return -KEY_fork;
5717 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5718 if (strEQ(d,"flock")) return -KEY_flock;
5721 if (strEQ(d,"format")) return KEY_format;
5722 if (strEQ(d,"fileno")) return -KEY_fileno;
5725 if (strEQ(d,"foreach")) return KEY_foreach;
5728 if (strEQ(d,"formline")) return -KEY_formline;
5733 if (strnEQ(d,"get",3)) {
5738 if (strEQ(d,"ppid")) return -KEY_getppid;
5739 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5742 if (strEQ(d,"pwent")) return -KEY_getpwent;
5743 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5744 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5747 if (strEQ(d,"peername")) return -KEY_getpeername;
5748 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5749 if (strEQ(d,"priority")) return -KEY_getpriority;
5752 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5755 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5759 else if (*d == 'h') {
5760 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5761 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5762 if (strEQ(d,"hostent")) return -KEY_gethostent;
5764 else if (*d == 'n') {
5765 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5766 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5767 if (strEQ(d,"netent")) return -KEY_getnetent;
5769 else if (*d == 's') {
5770 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5771 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5772 if (strEQ(d,"servent")) return -KEY_getservent;
5773 if (strEQ(d,"sockname")) return -KEY_getsockname;
5774 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5776 else if (*d == 'g') {
5777 if (strEQ(d,"grent")) return -KEY_getgrent;
5778 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5779 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5781 else if (*d == 'l') {
5782 if (strEQ(d,"login")) return -KEY_getlogin;
5784 else if (*d == 'c' && d[1] == '\0') return -KEY_getc;
5789 if (strEQ(d,"gt")) return -KEY_gt;
5790 if (strEQ(d,"ge")) return -KEY_ge;
5793 if (strEQ(d,"grep")) return KEY_grep;
5794 if (strEQ(d,"goto")) return KEY_goto;
5795 if (strEQ(d,"glob")) return KEY_glob;
5798 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5803 if (strEQ(d,"hex")) return -KEY_hex;
5806 if (strEQ(d,"INIT")) return KEY_INIT;
5811 if (strEQ(d,"if")) return KEY_if;
5814 if (strEQ(d,"int")) return -KEY_int;
5817 if (strEQ(d,"index")) return -KEY_index;
5818 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5823 if (strEQ(d,"join")) return -KEY_join;
5827 if (strEQ(d,"keys")) return -KEY_keys;
5828 if (strEQ(d,"kill")) return -KEY_kill;
5834 if (strEQ(d,"lt")) return -KEY_lt;
5835 if (strEQ(d,"le")) return -KEY_le;
5836 if (strEQ(d,"lc")) return -KEY_lc;
5839 if (strEQ(d,"log")) return -KEY_log;
5842 if (strEQ(d,"last")) return KEY_last;
5843 if (strEQ(d,"link")) return -KEY_link;
5844 if (strEQ(d,"lock")) return -KEY_lock;
5847 if (strEQ(d,"local")) return KEY_local;
5848 if (strEQ(d,"lstat")) return -KEY_lstat;
5851 if (strEQ(d,"length")) return -KEY_length;
5852 if (strEQ(d,"listen")) return -KEY_listen;
5855 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5858 if (strEQ(d,"localtime")) return -KEY_localtime;
5864 case 1: return KEY_m;
5866 if (strEQ(d,"my")) return KEY_my;
5869 if (strEQ(d,"map")) return KEY_map;
5872 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5875 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5876 if (strEQ(d,"msgget")) return -KEY_msgget;
5877 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5878 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5883 if (strEQ(d,"next")) return KEY_next;
5884 if (strEQ(d,"ne")) return -KEY_ne;
5885 if (strEQ(d,"not")) return -KEY_not;
5886 if (strEQ(d,"no")) return KEY_no;
5891 if (strEQ(d,"or")) return -KEY_or;
5894 if (strEQ(d,"ord")) return -KEY_ord;
5895 if (strEQ(d,"oct")) return -KEY_oct;
5896 if (strEQ(d,"our")) return KEY_our;
5899 if (strEQ(d,"open")) return -KEY_open;
5902 if (strEQ(d,"opendir")) return -KEY_opendir;
5909 if (strEQ(d,"pop")) return -KEY_pop;
5910 if (strEQ(d,"pos")) return KEY_pos;
5913 if (strEQ(d,"push")) return -KEY_push;
5914 if (strEQ(d,"pack")) return -KEY_pack;
5915 if (strEQ(d,"pipe")) return -KEY_pipe;
5918 if (strEQ(d,"print")) return KEY_print;
5921 if (strEQ(d,"printf")) return KEY_printf;
5924 if (strEQ(d,"package")) return KEY_package;
5927 if (strEQ(d,"prototype")) return KEY_prototype;
5934 else if (len == 2) {
5936 case 'r': return KEY_qr;
5937 case 'q': return KEY_qq;
5938 case 'w': return KEY_qw;
5939 case 'x': return KEY_qx;
5942 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5947 if (strEQ(d,"ref")) return -KEY_ref;
5950 if (strEQ(d,"read")) return -KEY_read;
5951 if (strEQ(d,"rand")) return -KEY_rand;
5952 if (strEQ(d,"recv")) return -KEY_recv;
5953 if (strEQ(d,"redo")) return KEY_redo;
5956 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5957 if (strEQ(d,"reset")) return -KEY_reset;
5960 if (strEQ(d,"return")) return KEY_return;
5961 if (strEQ(d,"rename")) return -KEY_rename;
5962 if (strEQ(d,"rindex")) return -KEY_rindex;
5965 if (strEQ(d,"require")) return KEY_require;
5966 if (strEQ(d,"reverse")) return -KEY_reverse;
5967 if (strEQ(d,"readdir")) return -KEY_readdir;
5970 if (strEQ(d,"readlink")) return -KEY_readlink;
5971 if (strEQ(d,"readline")) return -KEY_readline;
5972 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5975 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5981 case 0: return KEY_s;
5983 if (strEQ(d,"scalar")) return KEY_scalar;
5988 if (strEQ(d,"seek")) return -KEY_seek;
5989 if (strEQ(d,"send")) return -KEY_send;
5992 if (strEQ(d,"semop")) return -KEY_semop;
5995 if (strEQ(d,"select")) return -KEY_select;
5996 if (strEQ(d,"semctl")) return -KEY_semctl;
5997 if (strEQ(d,"semget")) return -KEY_semget;
6000 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
6001 if (strEQ(d,"seekdir")) return -KEY_seekdir;
6004 if (strEQ(d,"setpwent")) return -KEY_setpwent;
6005 if (strEQ(d,"setgrent")) return -KEY_setgrent;
6008 if (strEQ(d,"setnetent")) return -KEY_setnetent;
6011 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
6012 if (strEQ(d,"sethostent")) return -KEY_sethostent;
6013 if (strEQ(d,"setservent")) return -KEY_setservent;
6016 if (strEQ(d,"setpriority")) return -KEY_setpriority;
6017 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
6024 if (strEQ(d,"shift")) return -KEY_shift;
6027 if (strEQ(d,"shmctl")) return -KEY_shmctl;
6028 if (strEQ(d,"shmget")) return -KEY_shmget;
6031 if (strEQ(d,"shmread")) return -KEY_shmread;
6034 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
6035 if (strEQ(d,"shutdown")) return -KEY_shutdown;
6040 if (strEQ(d,"sin")) return -KEY_sin;
6043 if (strEQ(d,"sleep")) return -KEY_sleep;
6046 if (strEQ(d,"sort")) return KEY_sort;
6047 if (strEQ(d,"socket")) return -KEY_socket;
6048 if (strEQ(d,"socketpair")) return -KEY_socketpair;
6051 if (strEQ(d,"split")) return KEY_split;
6052 if (strEQ(d,"sprintf")) return -KEY_sprintf;
6053 if (strEQ(d,"splice")) return -KEY_splice;
6056 if (strEQ(d,"sqrt")) return -KEY_sqrt;
6059 if (strEQ(d,"srand")) return -KEY_srand;
6062 if (strEQ(d,"stat")) return -KEY_stat;
6063 if (strEQ(d,"study")) return KEY_study;
6066 if (strEQ(d,"substr")) return -KEY_substr;
6067 if (strEQ(d,"sub")) return KEY_sub;
6072 if (strEQ(d,"system")) return -KEY_system;
6075 if (strEQ(d,"symlink")) return -KEY_symlink;
6076 if (strEQ(d,"syscall")) return -KEY_syscall;
6077 if (strEQ(d,"sysopen")) return -KEY_sysopen;
6078 if (strEQ(d,"sysread")) return -KEY_sysread;
6079 if (strEQ(d,"sysseek")) return -KEY_sysseek;
6082 if (strEQ(d,"syswrite")) return -KEY_syswrite;
6091 if (strEQ(d,"tr")) return KEY_tr;
6094 if (strEQ(d,"tie")) return KEY_tie;
6097 if (strEQ(d,"tell")) return -KEY_tell;
6098 if (strEQ(d,"tied")) return KEY_tied;
6099 if (strEQ(d,"time")) return -KEY_time;
6102 if (strEQ(d,"times")) return -KEY_times;
6105 if (strEQ(d,"telldir")) return -KEY_telldir;
6108 if (strEQ(d,"truncate")) return -KEY_truncate;
6115 if (strEQ(d,"uc")) return -KEY_uc;
6118 if (strEQ(d,"use")) return KEY_use;
6121 if (strEQ(d,"undef")) return KEY_undef;
6122 if (strEQ(d,"until")) return KEY_until;
6123 if (strEQ(d,"untie")) return KEY_untie;
6124 if (strEQ(d,"utime")) return -KEY_utime;
6125 if (strEQ(d,"umask")) return -KEY_umask;
6128 if (strEQ(d,"unless")) return KEY_unless;
6129 if (strEQ(d,"unpack")) return -KEY_unpack;
6130 if (strEQ(d,"unlink")) return -KEY_unlink;
6133 if (strEQ(d,"unshift")) return -KEY_unshift;
6134 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
6139 if (strEQ(d,"values")) return -KEY_values;
6140 if (strEQ(d,"vec")) return -KEY_vec;
6145 if (strEQ(d,"warn")) return -KEY_warn;
6146 if (strEQ(d,"wait")) return -KEY_wait;
6149 if (strEQ(d,"while")) return KEY_while;
6150 if (strEQ(d,"write")) return -KEY_write;
6153 if (strEQ(d,"waitpid")) return -KEY_waitpid;
6156 if (strEQ(d,"wantarray")) return -KEY_wantarray;
6161 if (len == 1) return -KEY_x;
6162 if (strEQ(d,"xor")) return -KEY_xor;
6165 if (len == 1) return KEY_y;
6174 S_checkcomma(pTHX_ register char *s, char *name, char *what)
6178 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
6179 if (ckWARN(WARN_SYNTAX)) {
6181 for (w = s+2; *w && level; w++) {
6188 for (; *w && isSPACE(*w); w++) ;
6189 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6190 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6191 "%s (...) interpreted as function",name);
6194 while (s < PL_bufend && isSPACE(*s))
6198 while (s < PL_bufend && isSPACE(*s))
6200 if (isIDFIRST_lazy_if(s,UTF)) {
6202 while (isALNUM_lazy_if(s,UTF))
6204 while (s < PL_bufend && isSPACE(*s))
6209 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6213 Perl_croak(aTHX_ "No comma allowed after %s", what);
6218 /* Either returns sv, or mortalizes sv and returns a new SV*.
6219 Best used as sv=new_constant(..., sv, ...).
6220 If s, pv are NULL, calls subroutine with one argument,
6221 and type is used with error messages only. */
6224 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6228 HV *table = GvHV(PL_hintgv); /* ^H */
6232 const char *why1, *why2, *why3;
6234 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6237 why2 = strEQ(key,"charnames")
6238 ? "(possibly a missing \"use charnames ...\")"
6240 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6241 (type ? type: "undef"), why2);
6243 /* This is convoluted and evil ("goto considered harmful")
6244 * but I do not understand the intricacies of all the different
6245 * failure modes of %^H in here. The goal here is to make
6246 * the most probable error message user-friendly. --jhi */
6251 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6252 (type ? type: "undef"), why1, why2, why3);
6254 yyerror(SvPVX(msg));
6258 cvp = hv_fetch(table, key, strlen(key), FALSE);
6259 if (!cvp || !SvOK(*cvp)) {
6262 why3 = "} is not defined";
6265 sv_2mortal(sv); /* Parent created it permanently */
6268 pv = sv_2mortal(newSVpvn(s, len));
6270 typesv = sv_2mortal(newSVpv(type, 0));
6272 typesv = &PL_sv_undef;
6274 PUSHSTACKi(PERLSI_OVERLOAD);
6286 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6290 /* Check the eval first */
6291 if (!PL_in_eval && SvTRUE(ERRSV)) {
6293 sv_catpv(ERRSV, "Propagated");
6294 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6296 res = SvREFCNT_inc(sv);
6300 (void)SvREFCNT_inc(res);
6309 why1 = "Call to &{$^H{";
6311 why3 = "}} did not return a defined value";
6320 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6322 register char *d = dest;
6323 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6326 Perl_croak(aTHX_ ident_too_long);
6327 if (isALNUM(*s)) /* UTF handled below */
6329 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6334 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6338 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6339 char *t = s + UTF8SKIP(s);
6340 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6342 if (d + (t - s) > e)
6343 Perl_croak(aTHX_ ident_too_long);
6344 Copy(s, d, t - s, char);
6357 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6367 e = d + destlen - 3; /* two-character token, ending NUL */
6369 while (isDIGIT(*s)) {
6371 Perl_croak(aTHX_ ident_too_long);
6378 Perl_croak(aTHX_ ident_too_long);
6379 if (isALNUM(*s)) /* UTF handled below */
6381 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6386 else if (*s == ':' && s[1] == ':') {
6390 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6391 char *t = s + UTF8SKIP(s);
6392 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6394 if (d + (t - s) > e)
6395 Perl_croak(aTHX_ ident_too_long);
6396 Copy(s, d, t - s, char);
6407 if (PL_lex_state != LEX_NORMAL)
6408 PL_lex_state = LEX_INTERPENDMAYBE;
6411 if (*s == '$' && s[1] &&
6412 (isALNUM_lazy_if(s+1,UTF) || s[1] == '$' || s[1] == '{' || strnEQ(s+1,"::",2)) )
6425 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6430 if (isSPACE(s[-1])) {
6433 if (!SPACE_OR_TAB(ch)) {
6439 if (isIDFIRST_lazy_if(d,UTF)) {
6443 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6445 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6448 Copy(s, d, e - s, char);
6453 while ((isALNUM(*s) || *s == ':') && d < e)
6456 Perl_croak(aTHX_ ident_too_long);
6459 while (s < send && SPACE_OR_TAB(*s)) s++;
6460 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6461 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6462 const char *brack = *s == '[' ? "[...]" : "{...}";
6463 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6464 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6465 funny, dest, brack, funny, dest, brack);
6468 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6472 /* Handle extended ${^Foo} variables
6473 * 1999-02-27 mjd-perl-patch@plover.com */
6474 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6478 while (isALNUM(*s) && d < e) {
6482 Perl_croak(aTHX_ ident_too_long);
6487 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6488 PL_lex_state = LEX_INTERPEND;
6493 if (PL_lex_state == LEX_NORMAL) {
6494 if (ckWARN(WARN_AMBIGUOUS) &&
6495 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6497 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6498 "Ambiguous use of %c{%s} resolved to %c%s",
6499 funny, dest, funny, dest);
6504 s = bracket; /* let the parser handle it */
6508 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6509 PL_lex_state = LEX_INTERPEND;
6514 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6519 *pmfl |= PMf_GLOBAL;
6521 *pmfl |= PMf_CONTINUE;
6525 *pmfl |= PMf_MULTILINE;
6527 *pmfl |= PMf_SINGLELINE;
6529 *pmfl |= PMf_EXTENDED;
6533 S_scan_pat(pTHX_ char *start, I32 type)
6538 s = scan_str(start,FALSE,FALSE);
6540 Perl_croak(aTHX_ "Search pattern not terminated");
6542 pm = (PMOP*)newPMOP(type, 0);
6543 if (PL_multi_open == '?')
6544 pm->op_pmflags |= PMf_ONCE;
6546 while (*s && strchr("iomsx", *s))
6547 pmflag(&pm->op_pmflags,*s++);
6550 while (*s && strchr("iogcmsx", *s))
6551 pmflag(&pm->op_pmflags,*s++);
6553 /* issue a warning if /c is specified,but /g is not */
6554 if (ckWARN(WARN_REGEXP) &&
6555 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6557 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6560 pm->op_pmpermflags = pm->op_pmflags;
6562 PL_lex_op = (OP*)pm;
6563 yylval.ival = OP_MATCH;
6568 S_scan_subst(pTHX_ char *start)
6575 yylval.ival = OP_NULL;
6577 s = scan_str(start,FALSE,FALSE);
6580 Perl_croak(aTHX_ "Substitution pattern not terminated");
6582 if (s[-1] == PL_multi_open)
6585 first_start = PL_multi_start;
6586 s = scan_str(s,FALSE,FALSE);
6589 SvREFCNT_dec(PL_lex_stuff);
6590 PL_lex_stuff = Nullsv;
6592 Perl_croak(aTHX_ "Substitution replacement not terminated");
6594 PL_multi_start = first_start; /* so whole substitution is taken together */
6596 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6602 else if (strchr("iogcmsx", *s))
6603 pmflag(&pm->op_pmflags,*s++);
6608 /* /c is not meaningful with s/// */
6609 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6611 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6616 PL_sublex_info.super_bufptr = s;
6617 PL_sublex_info.super_bufend = PL_bufend;
6619 pm->op_pmflags |= PMf_EVAL;
6620 repl = newSVpvn("",0);
6622 sv_catpv(repl, es ? "eval " : "do ");
6623 sv_catpvn(repl, "{ ", 2);
6624 sv_catsv(repl, PL_lex_repl);
6625 sv_catpvn(repl, " };", 2);
6627 SvREFCNT_dec(PL_lex_repl);
6631 pm->op_pmpermflags = pm->op_pmflags;
6632 PL_lex_op = (OP*)pm;
6633 yylval.ival = OP_SUBST;
6638 S_scan_trans(pTHX_ char *start)
6647 yylval.ival = OP_NULL;
6649 s = scan_str(start,FALSE,FALSE);
6651 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6652 if (s[-1] == PL_multi_open)
6655 s = scan_str(s,FALSE,FALSE);
6658 SvREFCNT_dec(PL_lex_stuff);
6659 PL_lex_stuff = Nullsv;
6661 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6664 complement = del = squash = 0;
6668 complement = OPpTRANS_COMPLEMENT;
6671 del = OPpTRANS_DELETE;
6674 squash = OPpTRANS_SQUASH;
6683 New(803, tbl, complement&&!del?258:256, short);
6684 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6685 o->op_private &= ~OPpTRANS_ALL;
6686 o->op_private |= del|squash|complement|
6687 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6688 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6691 yylval.ival = OP_TRANS;
6696 S_scan_heredoc(pTHX_ register char *s)
6699 I32 op_type = OP_SCALAR;
6706 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6710 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6713 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6714 if (*peek == '`' || *peek == '\'' || *peek =='"') {
6717 s = delimcpy(d, e, s, PL_bufend, term, &len);
6727 if (!isALNUM_lazy_if(s,UTF))
6728 deprecate_old("bare << to mean <<\"\"");
6729 for (; isALNUM_lazy_if(s,UTF); s++) {
6734 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6735 Perl_croak(aTHX_ "Delimiter for here document is too long");
6738 len = d - PL_tokenbuf;
6739 #ifndef PERL_STRICT_CR
6740 d = strchr(s, '\r');
6744 while (s < PL_bufend) {
6750 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6759 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6764 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6765 herewas = newSVpvn(s,PL_bufend-s);
6767 s--, herewas = newSVpvn(s,d-s);
6768 s += SvCUR(herewas);
6770 tmpstr = NEWSV(87,79);
6771 sv_upgrade(tmpstr, SVt_PVIV);
6776 else if (term == '`') {
6777 op_type = OP_BACKTICK;
6778 SvIVX(tmpstr) = '\\';
6782 PL_multi_start = CopLINE(PL_curcop);
6783 PL_multi_open = PL_multi_close = '<';
6784 term = *PL_tokenbuf;
6785 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6786 char *bufptr = PL_sublex_info.super_bufptr;
6787 char *bufend = PL_sublex_info.super_bufend;
6788 char *olds = s - SvCUR(herewas);
6789 s = strchr(bufptr, '\n');
6793 while (s < bufend &&
6794 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6796 CopLINE_inc(PL_curcop);
6799 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6800 missingterm(PL_tokenbuf);
6802 sv_setpvn(herewas,bufptr,d-bufptr+1);
6803 sv_setpvn(tmpstr,d+1,s-d);
6805 sv_catpvn(herewas,s,bufend-s);
6806 Copy(SvPVX(herewas),bufptr,SvCUR(herewas) + 1,char);
6813 while (s < PL_bufend &&
6814 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6816 CopLINE_inc(PL_curcop);
6818 if (s >= PL_bufend) {
6819 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6820 missingterm(PL_tokenbuf);
6822 sv_setpvn(tmpstr,d+1,s-d);
6824 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6826 sv_catpvn(herewas,s,PL_bufend-s);
6827 sv_setsv(PL_linestr,herewas);
6828 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6829 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6830 PL_last_lop = PL_last_uni = Nullch;
6833 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6834 while (s >= PL_bufend) { /* multiple line string? */
6836 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6837 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6838 missingterm(PL_tokenbuf);
6840 CopLINE_inc(PL_curcop);
6841 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6842 PL_last_lop = PL_last_uni = Nullch;
6843 #ifndef PERL_STRICT_CR
6844 if (PL_bufend - PL_linestart >= 2) {
6845 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6846 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6848 PL_bufend[-2] = '\n';
6850 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6852 else if (PL_bufend[-1] == '\r')
6853 PL_bufend[-1] = '\n';
6855 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6856 PL_bufend[-1] = '\n';
6858 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6859 SV *sv = NEWSV(88,0);
6861 sv_upgrade(sv, SVt_PVMG);
6862 sv_setsv(sv,PL_linestr);
6865 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6867 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6868 STRLEN off = PL_bufend - 1 - SvPVX(PL_linestr);
6869 *(SvPVX(PL_linestr) + off ) = ' ';
6870 sv_catsv(PL_linestr,herewas);
6871 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6872 s = SvPVX(PL_linestr) + off; /* In case PV of PL_linestr moved. */
6876 sv_catsv(tmpstr,PL_linestr);
6881 PL_multi_end = CopLINE(PL_curcop);
6882 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6883 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6884 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6886 SvREFCNT_dec(herewas);
6888 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6890 else if (PL_encoding)
6891 sv_recode_to_utf8(tmpstr, PL_encoding);
6893 PL_lex_stuff = tmpstr;
6894 yylval.ival = op_type;
6899 takes: current position in input buffer
6900 returns: new position in input buffer
6901 side-effects: yylval and lex_op are set.
6906 <FH> read from filehandle
6907 <pkg::FH> read from package qualified filehandle
6908 <pkg'FH> read from package qualified filehandle
6909 <$fh> read from filehandle in $fh
6915 S_scan_inputsymbol(pTHX_ char *start)
6917 register char *s = start; /* current position in buffer */
6923 d = PL_tokenbuf; /* start of temp holding space */
6924 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6925 end = strchr(s, '\n');
6928 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6930 /* die if we didn't have space for the contents of the <>,
6931 or if it didn't end, or if we see a newline
6934 if (len >= sizeof PL_tokenbuf)
6935 Perl_croak(aTHX_ "Excessively long <> operator");
6937 Perl_croak(aTHX_ "Unterminated <> operator");
6942 Remember, only scalar variables are interpreted as filehandles by
6943 this code. Anything more complex (e.g., <$fh{$num}>) will be
6944 treated as a glob() call.
6945 This code makes use of the fact that except for the $ at the front,
6946 a scalar variable and a filehandle look the same.
6948 if (*d == '$' && d[1]) d++;
6950 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6951 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6954 /* If we've tried to read what we allow filehandles to look like, and
6955 there's still text left, then it must be a glob() and not a getline.
6956 Use scan_str to pull out the stuff between the <> and treat it
6957 as nothing more than a string.
6960 if (d - PL_tokenbuf != len) {
6961 yylval.ival = OP_GLOB;
6963 s = scan_str(start,FALSE,FALSE);
6965 Perl_croak(aTHX_ "Glob not terminated");
6969 bool readline_overriden = FALSE;
6970 GV *gv_readline = Nullgv;
6972 /* we're in a filehandle read situation */
6975 /* turn <> into <ARGV> */
6977 Copy("ARGV",d,5,char);
6979 /* Check whether readline() is overriden */
6980 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6981 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6983 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6984 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6985 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6986 readline_overriden = TRUE;
6988 /* if <$fh>, create the ops to turn the variable into a
6994 /* try to find it in the pad for this block, otherwise find
6995 add symbol table ops
6997 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6998 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6999 SV *sym = sv_2mortal(
7000 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
7001 sv_catpvn(sym, "::", 2);
7007 OP *o = newOP(OP_PADSV, 0);
7009 PL_lex_op = readline_overriden
7010 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7011 append_elem(OP_LIST, o,
7012 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
7013 : (OP*)newUNOP(OP_READLINE, 0, o);
7022 ? (GV_ADDMULTI | GV_ADDINEVAL)
7025 PL_lex_op = readline_overriden
7026 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7027 append_elem(OP_LIST,
7028 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
7029 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
7030 : (OP*)newUNOP(OP_READLINE, 0,
7031 newUNOP(OP_RV2SV, 0,
7032 newGVOP(OP_GV, 0, gv)));
7034 if (!readline_overriden)
7035 PL_lex_op->op_flags |= OPf_SPECIAL;
7036 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
7037 yylval.ival = OP_NULL;
7040 /* If it's none of the above, it must be a literal filehandle
7041 (<Foo::BAR> or <FOO>) so build a simple readline OP */
7043 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
7044 PL_lex_op = readline_overriden
7045 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7046 append_elem(OP_LIST,
7047 newGVOP(OP_GV, 0, gv),
7048 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
7049 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
7050 yylval.ival = OP_NULL;
7059 takes: start position in buffer
7060 keep_quoted preserve \ on the embedded delimiter(s)
7061 keep_delims preserve the delimiters around the string
7062 returns: position to continue reading from buffer
7063 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
7064 updates the read buffer.
7066 This subroutine pulls a string out of the input. It is called for:
7067 q single quotes q(literal text)
7068 ' single quotes 'literal text'
7069 qq double quotes qq(interpolate $here please)
7070 " double quotes "interpolate $here please"
7071 qx backticks qx(/bin/ls -l)
7072 ` backticks `/bin/ls -l`
7073 qw quote words @EXPORT_OK = qw( func() $spam )
7074 m// regexp match m/this/
7075 s/// regexp substitute s/this/that/
7076 tr/// string transliterate tr/this/that/
7077 y/// string transliterate y/this/that/
7078 ($*@) sub prototypes sub foo ($)
7079 (stuff) sub attr parameters sub foo : attr(stuff)
7080 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
7082 In most of these cases (all but <>, patterns and transliterate)
7083 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
7084 calls scan_str(). s/// makes yylex() call scan_subst() which calls
7085 scan_str(). tr/// and y/// make yylex() call scan_trans() which
7088 It skips whitespace before the string starts, and treats the first
7089 character as the delimiter. If the delimiter is one of ([{< then
7090 the corresponding "close" character )]}> is used as the closing
7091 delimiter. It allows quoting of delimiters, and if the string has
7092 balanced delimiters ([{<>}]) it allows nesting.
7094 On success, the SV with the resulting string is put into lex_stuff or,
7095 if that is already non-NULL, into lex_repl. The second case occurs only
7096 when parsing the RHS of the special constructs s/// and tr/// (y///).
7097 For convenience, the terminating delimiter character is stuffed into
7102 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
7104 SV *sv; /* scalar value: string */
7105 char *tmps; /* temp string, used for delimiter matching */
7106 register char *s = start; /* current position in the buffer */
7107 register char term; /* terminating character */
7108 register char *to; /* current position in the sv's data */
7109 I32 brackets = 1; /* bracket nesting level */
7110 bool has_utf8 = FALSE; /* is there any utf8 content? */
7111 I32 termcode; /* terminating char. code */
7112 U8 termstr[UTF8_MAXLEN]; /* terminating string */
7113 STRLEN termlen; /* length of terminating string */
7114 char *last = NULL; /* last position for nesting bracket */
7116 /* skip space before the delimiter */
7120 /* mark where we are, in case we need to report errors */
7123 /* after skipping whitespace, the next character is the terminator */
7126 termcode = termstr[0] = term;
7130 termcode = utf8_to_uvchr((U8*)s, &termlen);
7131 Copy(s, termstr, termlen, U8);
7132 if (!UTF8_IS_INVARIANT(term))
7136 /* mark where we are */
7137 PL_multi_start = CopLINE(PL_curcop);
7138 PL_multi_open = term;
7140 /* find corresponding closing delimiter */
7141 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
7142 termcode = termstr[0] = term = tmps[5];
7144 PL_multi_close = term;
7146 /* create a new SV to hold the contents. 87 is leak category, I'm
7147 assuming. 79 is the SV's initial length. What a random number. */
7149 sv_upgrade(sv, SVt_PVIV);
7150 SvIVX(sv) = termcode;
7151 (void)SvPOK_only(sv); /* validate pointer */
7153 /* move past delimiter and try to read a complete string */
7155 sv_catpvn(sv, s, termlen);
7158 if (PL_encoding && !UTF) {
7162 int offset = s - SvPVX(PL_linestr);
7163 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
7164 &offset, (char*)termstr, termlen);
7165 char *ns = SvPVX(PL_linestr) + offset;
7166 char *svlast = SvEND(sv) - 1;
7168 for (; s < ns; s++) {
7169 if (*s == '\n' && !PL_rsfp)
7170 CopLINE_inc(PL_curcop);
7173 goto read_more_line;
7175 /* handle quoted delimiters */
7176 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
7178 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
7180 if ((svlast-1 - t) % 2) {
7184 SvCUR_set(sv, SvCUR(sv) - 1);
7189 if (PL_multi_open == PL_multi_close) {
7196 for (w = t = last; t < svlast; w++, t++) {
7197 /* At here, all closes are "was quoted" one,
7198 so we don't check PL_multi_close. */
7200 if (!keep_quoted && *(t+1) == PL_multi_open)
7205 else if (*t == PL_multi_open)
7213 SvCUR_set(sv, w - SvPVX(sv));
7216 if (--brackets <= 0)
7222 SvCUR_set(sv, SvCUR(sv) - 1);
7228 /* extend sv if need be */
7229 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7230 /* set 'to' to the next character in the sv's string */
7231 to = SvPVX(sv)+SvCUR(sv);
7233 /* if open delimiter is the close delimiter read unbridle */
7234 if (PL_multi_open == PL_multi_close) {
7235 for (; s < PL_bufend; s++,to++) {
7236 /* embedded newlines increment the current line number */
7237 if (*s == '\n' && !PL_rsfp)
7238 CopLINE_inc(PL_curcop);
7239 /* handle quoted delimiters */
7240 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7241 if (!keep_quoted && s[1] == term)
7243 /* any other quotes are simply copied straight through */
7247 /* terminate when run out of buffer (the for() condition), or
7248 have found the terminator */
7249 else if (*s == term) {
7252 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7255 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7261 /* if the terminator isn't the same as the start character (e.g.,
7262 matched brackets), we have to allow more in the quoting, and
7263 be prepared for nested brackets.
7266 /* read until we run out of string, or we find the terminator */
7267 for (; s < PL_bufend; s++,to++) {
7268 /* embedded newlines increment the line count */
7269 if (*s == '\n' && !PL_rsfp)
7270 CopLINE_inc(PL_curcop);
7271 /* backslashes can escape the open or closing characters */
7272 if (*s == '\\' && s+1 < PL_bufend) {
7274 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7279 /* allow nested opens and closes */
7280 else if (*s == PL_multi_close && --brackets <= 0)
7282 else if (*s == PL_multi_open)
7284 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7289 /* terminate the copied string and update the sv's end-of-string */
7291 SvCUR_set(sv, to - SvPVX(sv));
7294 * this next chunk reads more into the buffer if we're not done yet
7298 break; /* handle case where we are done yet :-) */
7300 #ifndef PERL_STRICT_CR
7301 if (to - SvPVX(sv) >= 2) {
7302 if ((to[-2] == '\r' && to[-1] == '\n') ||
7303 (to[-2] == '\n' && to[-1] == '\r'))
7307 SvCUR_set(sv, to - SvPVX(sv));
7309 else if (to[-1] == '\r')
7312 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7317 /* if we're out of file, or a read fails, bail and reset the current
7318 line marker so we can report where the unterminated string began
7321 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7323 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7326 /* we read a line, so increment our line counter */
7327 CopLINE_inc(PL_curcop);
7329 /* update debugger info */
7330 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7331 SV *sv = NEWSV(88,0);
7333 sv_upgrade(sv, SVt_PVMG);
7334 sv_setsv(sv,PL_linestr);
7337 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7340 /* having changed the buffer, we must update PL_bufend */
7341 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7342 PL_last_lop = PL_last_uni = Nullch;
7345 /* at this point, we have successfully read the delimited string */
7347 if (!PL_encoding || UTF) {
7349 sv_catpvn(sv, s, termlen);
7352 if (has_utf8 || PL_encoding)
7355 PL_multi_end = CopLINE(PL_curcop);
7357 /* if we allocated too much space, give some back */
7358 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7359 SvLEN_set(sv, SvCUR(sv) + 1);
7360 Renew(SvPVX(sv), SvLEN(sv), char);
7363 /* decide whether this is the first or second quoted string we've read
7376 takes: pointer to position in buffer
7377 returns: pointer to new position in buffer
7378 side-effects: builds ops for the constant in yylval.op
7380 Read a number in any of the formats that Perl accepts:
7382 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7383 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7386 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7388 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7391 If it reads a number without a decimal point or an exponent, it will
7392 try converting the number to an integer and see if it can do so
7393 without loss of precision.
7397 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7399 register char *s = start; /* current position in buffer */
7400 register char *d; /* destination in temp buffer */
7401 register char *e; /* end of temp buffer */
7402 NV nv; /* number read, as a double */
7403 SV *sv = Nullsv; /* place to put the converted number */
7404 bool floatit; /* boolean: int or float? */
7405 char *lastub = 0; /* position of last underbar */
7406 static char number_too_long[] = "Number too long";
7408 /* We use the first character to decide what type of number this is */
7412 Perl_croak(aTHX_ "panic: scan_num");
7414 /* if it starts with a 0, it could be an octal number, a decimal in
7415 0.13 disguise, or a hexadecimal number, or a binary number. */
7419 u holds the "number so far"
7420 shift the power of 2 of the base
7421 (hex == 4, octal == 3, binary == 1)
7422 overflowed was the number more than we can hold?
7424 Shift is used when we add a digit. It also serves as an "are
7425 we in octal/hex/binary?" indicator to disallow hex characters
7431 bool overflowed = FALSE;
7432 bool just_zero = TRUE; /* just plain 0 or binary number? */
7433 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7434 static char* bases[5] = { "", "binary", "", "octal",
7436 static char* Bases[5] = { "", "Binary", "", "Octal",
7438 static char *maxima[5] = { "",
7439 "0b11111111111111111111111111111111",
7443 char *base, *Base, *max;
7450 } else if (s[1] == 'b') {
7455 /* check for a decimal in disguise */
7456 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7458 /* so it must be octal */
7465 if (ckWARN(WARN_SYNTAX))
7466 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7467 "Misplaced _ in number");
7471 base = bases[shift];
7472 Base = Bases[shift];
7473 max = maxima[shift];
7475 /* read the rest of the number */
7477 /* x is used in the overflow test,
7478 b is the digit we're adding on. */
7483 /* if we don't mention it, we're done */
7487 /* _ are ignored -- but warned about if consecutive */
7489 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7490 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7491 "Misplaced _ in number");
7495 /* 8 and 9 are not octal */
7498 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7502 case '2': case '3': case '4':
7503 case '5': case '6': case '7':
7505 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7509 b = *s++ & 15; /* ASCII digit -> value of digit */
7513 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7514 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7515 /* make sure they said 0x */
7520 /* Prepare to put the digit we have onto the end
7521 of the number so far. We check for overflows.
7527 x = u << shift; /* make room for the digit */
7529 if ((x >> shift) != u
7530 && !(PL_hints & HINT_NEW_BINARY)) {
7533 if (ckWARN_d(WARN_OVERFLOW))
7534 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7535 "Integer overflow in %s number",
7538 u = x | b; /* add the digit to the end */
7541 n *= nvshift[shift];
7542 /* If an NV has not enough bits in its
7543 * mantissa to represent an UV this summing of
7544 * small low-order numbers is a waste of time
7545 * (because the NV cannot preserve the
7546 * low-order bits anyway): we could just
7547 * remember when did we overflow and in the
7548 * end just multiply n by the right
7556 /* if we get here, we had success: make a scalar value from
7561 /* final misplaced underbar check */
7563 if (ckWARN(WARN_SYNTAX))
7564 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7569 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7570 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7571 "%s number > %s non-portable",
7577 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7578 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7579 "%s number > %s non-portable",
7584 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7585 sv = new_constant(start, s - start, "integer",
7587 else if (PL_hints & HINT_NEW_BINARY)
7588 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7593 handle decimal numbers.
7594 we're also sent here when we read a 0 as the first digit
7596 case '1': case '2': case '3': case '4': case '5':
7597 case '6': case '7': case '8': case '9': case '.':
7600 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7603 /* read next group of digits and _ and copy into d */
7604 while (isDIGIT(*s) || *s == '_') {
7605 /* skip underscores, checking for misplaced ones
7609 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7610 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7611 "Misplaced _ in number");
7615 /* check for end of fixed-length buffer */
7617 Perl_croak(aTHX_ number_too_long);
7618 /* if we're ok, copy the character */
7623 /* final misplaced underbar check */
7624 if (lastub && s == lastub + 1) {
7625 if (ckWARN(WARN_SYNTAX))
7626 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7629 /* read a decimal portion if there is one. avoid
7630 3..5 being interpreted as the number 3. followed
7633 if (*s == '.' && s[1] != '.') {
7638 if (ckWARN(WARN_SYNTAX))
7639 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7640 "Misplaced _ in number");
7644 /* copy, ignoring underbars, until we run out of digits.
7646 for (; isDIGIT(*s) || *s == '_'; s++) {
7647 /* fixed length buffer check */
7649 Perl_croak(aTHX_ number_too_long);
7651 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7652 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7653 "Misplaced _ in number");
7659 /* fractional part ending in underbar? */
7661 if (ckWARN(WARN_SYNTAX))
7662 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7663 "Misplaced _ in number");
7665 if (*s == '.' && isDIGIT(s[1])) {
7666 /* oops, it's really a v-string, but without the "v" */
7672 /* read exponent part, if present */
7673 if ((*s == 'e' || *s == 'E') && strchr("+-0123456789_", s[1])) {
7677 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7678 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7680 /* stray preinitial _ */
7682 if (ckWARN(WARN_SYNTAX))
7683 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7684 "Misplaced _ in number");
7688 /* allow positive or negative exponent */
7689 if (*s == '+' || *s == '-')
7692 /* stray initial _ */
7694 if (ckWARN(WARN_SYNTAX))
7695 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7696 "Misplaced _ in number");
7700 /* read digits of exponent */
7701 while (isDIGIT(*s) || *s == '_') {
7704 Perl_croak(aTHX_ number_too_long);
7708 if (ckWARN(WARN_SYNTAX) &&
7709 ((lastub && s == lastub + 1) ||
7710 (!isDIGIT(s[1]) && s[1] != '_')))
7711 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7712 "Misplaced _ in number");
7719 /* make an sv from the string */
7723 We try to do an integer conversion first if no characters
7724 indicating "float" have been found.
7729 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7731 if (flags == IS_NUMBER_IN_UV) {
7733 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7736 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7737 if (uv <= (UV) IV_MIN)
7738 sv_setiv(sv, -(IV)uv);
7745 /* terminate the string */
7747 nv = Atof(PL_tokenbuf);
7751 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7752 (PL_hints & HINT_NEW_INTEGER) )
7753 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7754 (floatit ? "float" : "integer"),
7758 /* if it starts with a v, it could be a v-string */
7761 sv = NEWSV(92,5); /* preallocate storage space */
7762 s = scan_vstring(s,sv);
7766 /* make the op for the constant and return */
7769 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7771 lvalp->opval = Nullop;
7777 S_scan_formline(pTHX_ register char *s)
7781 SV *stuff = newSVpvn("",0);
7782 bool needargs = FALSE;
7788 #ifdef PERL_STRICT_CR
7789 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7791 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7793 if (*t == '\n' || t == PL_bufend) {
7798 if (PL_in_eval && !PL_rsfp) {
7799 eol = memchr(s,'\n',PL_bufend-s);
7804 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7806 for (t = s; t < eol; t++) {
7807 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7809 goto enough; /* ~~ must be first line in formline */
7811 if (*t == '@' || *t == '^')
7815 sv_catpvn(stuff, s, eol-s);
7816 #ifndef PERL_STRICT_CR
7817 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7818 char *end = SvPVX(stuff) + SvCUR(stuff);
7830 s = filter_gets(PL_linestr, PL_rsfp, 0);
7831 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7832 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7833 PL_last_lop = PL_last_uni = Nullch;
7845 PL_lex_state = LEX_NORMAL;
7846 PL_nextval[PL_nexttoke].ival = 0;
7850 PL_lex_state = LEX_FORMLINE;
7852 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7854 else if (PL_encoding)
7855 sv_recode_to_utf8(stuff, PL_encoding);
7857 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7859 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7863 SvREFCNT_dec(stuff);
7865 PL_lex_formbrack = 0;
7876 PL_cshlen = strlen(PL_cshname);
7881 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7883 I32 oldsavestack_ix = PL_savestack_ix;
7884 CV* outsidecv = PL_compcv;
7887 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7889 SAVEI32(PL_subline);
7890 save_item(PL_subname);
7891 SAVESPTR(PL_compcv);
7893 PL_compcv = (CV*)NEWSV(1104,0);
7894 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7895 CvFLAGS(PL_compcv) |= flags;
7897 PL_subline = CopLINE(PL_curcop);
7898 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7899 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7900 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7902 return oldsavestack_ix;
7906 #pragma segment Perl_yylex
7909 Perl_yywarn(pTHX_ char *s)
7911 PL_in_eval |= EVAL_WARNONLY;
7913 PL_in_eval &= ~EVAL_WARNONLY;
7918 Perl_yyerror(pTHX_ char *s)
7921 char *context = NULL;
7925 if (!yychar || (yychar == ';' && !PL_rsfp))
7927 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7928 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7931 The code below is removed for NetWare because it abends/crashes on NetWare
7932 when the script has error such as not having the closing quotes like:
7934 Checking of white spaces is anyway done in NetWare code.
7937 while (isSPACE(*PL_oldoldbufptr))
7940 context = PL_oldoldbufptr;
7941 contlen = PL_bufptr - PL_oldoldbufptr;
7943 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7944 PL_oldbufptr != PL_bufptr) {
7947 The code below is removed for NetWare because it abends/crashes on NetWare
7948 when the script has error such as not having the closing quotes like:
7950 Checking of white spaces is anyway done in NetWare code.
7953 while (isSPACE(*PL_oldbufptr))
7956 context = PL_oldbufptr;
7957 contlen = PL_bufptr - PL_oldbufptr;
7959 else if (yychar > 255)
7960 where = "next token ???";
7961 else if (yychar == -2) { /* YYEMPTY */
7962 if (PL_lex_state == LEX_NORMAL ||
7963 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7964 where = "at end of line";
7965 else if (PL_lex_inpat)
7966 where = "within pattern";
7968 where = "within string";
7971 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7973 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7974 else if (isPRINT_LC(yychar))
7975 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7977 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7978 where = SvPVX(where_sv);
7980 msg = sv_2mortal(newSVpv(s, 0));
7981 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7982 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7984 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7986 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7987 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7988 Perl_sv_catpvf(aTHX_ msg,
7989 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7990 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7993 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7994 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7997 if (PL_error_count >= 10) {
7998 if (PL_in_eval && SvCUR(ERRSV))
7999 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
8000 ERRSV, OutCopFILE(PL_curcop));
8002 Perl_croak(aTHX_ "%s has too many errors.\n",
8003 OutCopFILE(PL_curcop));
8006 PL_in_my_stash = Nullhv;
8010 #pragma segment Main
8014 S_swallow_bom(pTHX_ U8 *s)
8017 slen = SvCUR(PL_linestr);
8021 /* UTF-16 little-endian? (or UTF32-LE?) */
8022 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
8023 Perl_croak(aTHX_ "Unsupported script encoding UTF32-LE");
8024 #ifndef PERL_NO_UTF16_FILTER
8025 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF16-LE script encoding (BOM)\n");
8028 if (PL_bufend > (char*)s) {
8032 filter_add(utf16rev_textfilter, NULL);
8033 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8034 utf16_to_utf8_reversed(s, news,
8035 PL_bufend - (char*)s - 1,
8037 sv_setpvn(PL_linestr, (const char*)news, newlen);
8039 SvUTF8_on(PL_linestr);
8040 s = (U8*)SvPVX(PL_linestr);
8041 PL_bufend = SvPVX(PL_linestr) + newlen;
8044 Perl_croak(aTHX_ "Unsupported script encoding UTF16-LE");
8049 if (s[1] == 0xFF) { /* UTF-16 big-endian? */
8050 #ifndef PERL_NO_UTF16_FILTER
8051 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (BOM)\n");
8054 if (PL_bufend > (char *)s) {
8058 filter_add(utf16_textfilter, NULL);
8059 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8060 utf16_to_utf8(s, news,
8061 PL_bufend - (char*)s,
8063 sv_setpvn(PL_linestr, (const char*)news, newlen);
8065 SvUTF8_on(PL_linestr);
8066 s = (U8*)SvPVX(PL_linestr);
8067 PL_bufend = SvPVX(PL_linestr) + newlen;
8070 Perl_croak(aTHX_ "Unsupported script encoding UTF16-BE");
8075 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
8076 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
8083 if (s[2] == 0xFE && s[3] == 0xFF) {
8084 /* UTF-32 big-endian */
8085 Perl_croak(aTHX_ "Unsupported script encoding UTF32-BE");
8088 else if (s[2] == 0 && s[3] != 0) {
8091 * are a good indicator of UTF-16BE. */
8092 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (no BOM)\n");
8097 if (slen > 3 && s[1] == 0 && s[2] != 0 && s[3] == 0) {
8100 * are a good indicator of UTF-16LE. */
8101 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (no BOM)\n");
8110 * Restore a source filter.
8114 restore_rsfp(pTHX_ void *f)
8116 PerlIO *fp = (PerlIO*)f;
8118 if (PL_rsfp == PerlIO_stdin())
8119 PerlIO_clearerr(PL_rsfp);
8120 else if (PL_rsfp && (PL_rsfp != fp))
8121 PerlIO_close(PL_rsfp);
8125 #ifndef PERL_NO_UTF16_FILTER
8127 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8129 STRLEN old = SvCUR(sv);
8130 I32 count = FILTER_READ(idx+1, sv, maxlen);
8131 DEBUG_P(PerlIO_printf(Perl_debug_log,
8132 "utf16_textfilter(%p): %d %d (%d)\n",
8133 utf16_textfilter, idx, maxlen, count));
8137 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8138 Copy(SvPVX(sv), tmps, old, char);
8139 utf16_to_utf8((U8*)SvPVX(sv) + old, tmps + old,
8140 SvCUR(sv) - old, &newlen);
8141 sv_usepvn(sv, (char*)tmps, (STRLEN)newlen + old);
8143 DEBUG_P({sv_dump(sv);});
8148 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8150 STRLEN old = SvCUR(sv);
8151 I32 count = FILTER_READ(idx+1, sv, maxlen);
8152 DEBUG_P(PerlIO_printf(Perl_debug_log,
8153 "utf16rev_textfilter(%p): %d %d (%d)\n",
8154 utf16rev_textfilter, idx, maxlen, count));
8158 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8159 Copy(SvPVX(sv), tmps, old, char);
8160 utf16_to_utf8((U8*)SvPVX(sv) + old, tmps + old,
8161 SvCUR(sv) - old, &newlen);
8162 sv_usepvn(sv, (char*)tmps, (STRLEN)newlen + old);
8164 DEBUG_P({ sv_dump(sv); });
8170 Returns a pointer to the next character after the parsed
8171 vstring, as well as updating the passed in sv.
8173 Function must be called like
8176 s = scan_vstring(s,sv);
8178 The sv should already be large enough to store the vstring
8179 passed in, for performance reasons.
8184 Perl_scan_vstring(pTHX_ char *s, SV *sv)
8188 if (*pos == 'v') pos++; /* get past 'v' */
8189 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8192 /* this may not be a v-string if followed by => */
8194 while (next < PL_bufend && isSPACE(*next))
8196 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
8197 /* return string not v-string */
8198 sv_setpvn(sv,(char *)s,pos-s);
8203 if (!isALPHA(*pos)) {
8205 U8 tmpbuf[UTF8_MAXLEN+1];
8208 if (*s == 'v') s++; /* get past 'v' */
8210 sv_setpvn(sv, "", 0);
8215 /* this is atoi() that tolerates underscores */
8218 while (--end >= s) {
8223 rev += (*end - '0') * mult;
8225 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8226 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8227 "Integer overflow in decimal number");
8231 if (rev > 0x7FFFFFFF)
8232 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8234 /* Append native character for the rev point */
8235 tmpend = uvchr_to_utf8(tmpbuf, rev);
8236 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8237 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8239 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8245 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8249 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);