3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "It all comes from here, the stench and the peril." --Frodo
16 * This file is the lexer for Perl. It's closely linked to the
19 * The main routine is yylex(), which returns the next token.
23 #define PERL_IN_TOKE_C
26 #define yychar (*PL_yycharp)
27 #define yylval (*PL_yylvalp)
29 static char ident_too_long[] = "Identifier too long";
30 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
31 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
33 static void restore_rsfp(pTHX_ void *f);
34 #ifndef PERL_NO_UTF16_FILTER
35 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
39 #define XFAKEBRACK 128
42 #ifdef USE_UTF8_SCRIPTS
43 # define UTF (!IN_BYTES)
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
48 /* In variables named $^X, these are the legal values for X.
49 * 1999-02-27 mjd-perl-patch@plover.com */
50 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
52 /* On MacOS, respect nonbreaking spaces */
53 #ifdef MACOS_TRADITIONAL
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
56 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
59 /* LEX_* are values for PL_lex_state, the state of the lexer.
60 * They are arranged oddly so that the guard on the switch statement
61 * can get by with a single comparison (if the compiler is smart enough).
64 /* #define LEX_NOTPARSING 11 is done in perl.h. */
67 #define LEX_INTERPNORMAL 9
68 #define LEX_INTERPCASEMOD 8
69 #define LEX_INTERPPUSH 7
70 #define LEX_INTERPSTART 6
71 #define LEX_INTERPEND 5
72 #define LEX_INTERPENDMAYBE 4
73 #define LEX_INTERPCONCAT 3
74 #define LEX_INTERPCONST 2
75 #define LEX_FORMLINE 1
76 #define LEX_KNOWNEXT 0
79 static char* lex_state_names[] = {
100 /* CLINE is a macro that ensures PL_copline has a sane value */
105 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
108 * Convenience functions to return different tokens and prime the
109 * lexer for the next token. They all take an argument.
111 * TOKEN : generic token (used for '(', DOLSHARP, etc)
112 * OPERATOR : generic operator
113 * AOPERATOR : assignment operator
114 * PREBLOCK : beginning the block after an if, while, foreach, ...
115 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
116 * PREREF : *EXPR where EXPR is not a simple identifier
117 * TERM : expression term
118 * LOOPX : loop exiting command (goto, last, dump, etc)
119 * FTST : file test operator
120 * FUN0 : zero-argument function
121 * FUN1 : not used, except for not, which isn't a UNIOP
122 * BOop : bitwise or or xor
124 * SHop : shift operator
125 * PWop : power operator
126 * PMop : pattern-matching operator
127 * Aop : addition-level operator
128 * Mop : multiplication-level operator
129 * Eop : equality-testing operator
130 * Rop : relational operator <= != gt
132 * Also see LOP and lop() below.
135 #ifdef DEBUGGING /* Serve -DT. */
136 # define REPORT(retval) tokereport(s,(int)retval)
138 # define REPORT(retval) (retval)
141 #define TOKEN(retval) return ( PL_bufptr = s, REPORT(retval))
142 #define OPERATOR(retval) return (PL_expect = XTERM, PL_bufptr = s, REPORT(retval))
143 #define AOPERATOR(retval) return ao((PL_expect = XTERM, PL_bufptr = s, REPORT(retval)))
144 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s, REPORT(retval))
145 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s, REPORT(retval))
146 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s, REPORT(retval))
147 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR, PL_bufptr = s, REPORT(retval))
148 #define LOOPX(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)LOOPEX))
149 #define FTST(f) return (yylval.ival=f, PL_expect=XTERMORDORDOR, PL_bufptr=s, REPORT((int)UNIOP))
150 #define FUN0(f) return (yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC0))
151 #define FUN1(f) return (yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC1))
152 #define BOop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITOROP)))
153 #define BAop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITANDOP)))
154 #define SHop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)SHIFTOP)))
155 #define PWop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)POWOP)))
156 #define PMop(f) return(yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MATCHOP))
157 #define Aop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)ADDOP)))
158 #define Mop(f) return ao((yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MULOP)))
159 #define Eop(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)EQOP))
160 #define Rop(f) return (yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)RELOP))
162 /* This bit of chicanery makes a unary function followed by
163 * a parenthesis into a function with one argument, highest precedence.
164 * The UNIDOR macro is for unary functions that can be followed by the //
165 * operator (such as C<shift // 0>).
167 #define UNI2(f,x) return ( \
171 PL_last_uni = PL_oldbufptr, \
172 PL_last_lop_op = f, \
174 (*s == '(' || (s = skipspace(s), *s == '(') \
175 ? (int)FUNC1 : (int)UNIOP)))
176 #define UNI(f) UNI2(f,XTERM)
177 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
179 #define UNIBRACK(f) return ( \
182 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') \
185 ? (int)FUNC1 : (int)UNIOP)))
187 /* grandfather return to old style */
188 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 /* how to interpret the yylval associated with the token */
196 TOKENTYPE_OPNUM, /* yylval.ival contains an opcode number */
202 static struct debug_tokens { int token, type; char *name;} debug_tokens[] =
204 { ADDOP, TOKENTYPE_OPNUM, "ADDOP" },
205 { ANDAND, TOKENTYPE_NONE, "ANDAND" },
206 { ANDOP, TOKENTYPE_NONE, "ANDOP" },
207 { ANONSUB, TOKENTYPE_IVAL, "ANONSUB" },
208 { ARROW, TOKENTYPE_NONE, "ARROW" },
209 { ASSIGNOP, TOKENTYPE_OPNUM, "ASSIGNOP" },
210 { BITANDOP, TOKENTYPE_OPNUM, "BITANDOP" },
211 { BITOROP, TOKENTYPE_OPNUM, "BITOROP" },
212 { COLONATTR, TOKENTYPE_NONE, "COLONATTR" },
213 { CONTINUE, TOKENTYPE_NONE, "CONTINUE" },
214 { DO, TOKENTYPE_NONE, "DO" },
215 { DOLSHARP, TOKENTYPE_NONE, "DOLSHARP" },
216 { DORDOR, TOKENTYPE_NONE, "DORDOR" },
217 { DOROP, TOKENTYPE_OPNUM, "DOROP" },
218 { DOTDOT, TOKENTYPE_IVAL, "DOTDOT" },
219 { ELSE, TOKENTYPE_NONE, "ELSE" },
220 { ELSIF, TOKENTYPE_IVAL, "ELSIF" },
221 { EQOP, TOKENTYPE_OPNUM, "EQOP" },
222 { FOR, TOKENTYPE_IVAL, "FOR" },
223 { FORMAT, TOKENTYPE_NONE, "FORMAT" },
224 { FUNC, TOKENTYPE_OPNUM, "FUNC" },
225 { FUNC0, TOKENTYPE_OPNUM, "FUNC0" },
226 { FUNC0SUB, TOKENTYPE_OPVAL, "FUNC0SUB" },
227 { FUNC1, TOKENTYPE_OPNUM, "FUNC1" },
228 { FUNCMETH, TOKENTYPE_OPVAL, "FUNCMETH" },
229 { HASHBRACK, TOKENTYPE_NONE, "HASHBRACK" },
230 { IF, TOKENTYPE_IVAL, "IF" },
231 { LABEL, TOKENTYPE_PVAL, "LABEL" },
232 { LOCAL, TOKENTYPE_IVAL, "LOCAL" },
233 { LOOPEX, TOKENTYPE_OPNUM, "LOOPEX" },
234 { LSTOP, TOKENTYPE_OPNUM, "LSTOP" },
235 { LSTOPSUB, TOKENTYPE_OPVAL, "LSTOPSUB" },
236 { MATCHOP, TOKENTYPE_OPNUM, "MATCHOP" },
237 { METHOD, TOKENTYPE_OPVAL, "METHOD" },
238 { MULOP, TOKENTYPE_OPNUM, "MULOP" },
239 { MY, TOKENTYPE_IVAL, "MY" },
240 { MYSUB, TOKENTYPE_NONE, "MYSUB" },
241 { NOAMP, TOKENTYPE_NONE, "NOAMP" },
242 { NOTOP, TOKENTYPE_NONE, "NOTOP" },
243 { OROP, TOKENTYPE_IVAL, "OROP" },
244 { OROR, TOKENTYPE_NONE, "OROR" },
245 { PACKAGE, TOKENTYPE_NONE, "PACKAGE" },
246 { PMFUNC, TOKENTYPE_OPVAL, "PMFUNC" },
247 { POSTDEC, TOKENTYPE_NONE, "POSTDEC" },
248 { POSTINC, TOKENTYPE_NONE, "POSTINC" },
249 { POWOP, TOKENTYPE_OPNUM, "POWOP" },
250 { PREDEC, TOKENTYPE_NONE, "PREDEC" },
251 { PREINC, TOKENTYPE_NONE, "PREINC" },
252 { PRIVATEREF, TOKENTYPE_OPVAL, "PRIVATEREF" },
253 { REFGEN, TOKENTYPE_NONE, "REFGEN" },
254 { RELOP, TOKENTYPE_OPNUM, "RELOP" },
255 { SHIFTOP, TOKENTYPE_OPNUM, "SHIFTOP" },
256 { SUB, TOKENTYPE_NONE, "SUB" },
257 { THING, TOKENTYPE_OPVAL, "THING" },
258 { UMINUS, TOKENTYPE_NONE, "UMINUS" },
259 { UNIOP, TOKENTYPE_OPNUM, "UNIOP" },
260 { UNIOPSUB, TOKENTYPE_OPVAL, "UNIOPSUB" },
261 { UNLESS, TOKENTYPE_IVAL, "UNLESS" },
262 { UNTIL, TOKENTYPE_IVAL, "UNTIL" },
263 { USE, TOKENTYPE_IVAL, "USE" },
264 { WHILE, TOKENTYPE_IVAL, "WHILE" },
265 { WORD, TOKENTYPE_OPVAL, "WORD" },
266 { 0, TOKENTYPE_NONE, 0 }
269 /* dump the returned token in rv, plus any optional arg in yylval */
272 S_tokereport(pTHX_ char* s, I32 rv)
276 enum token_type type = TOKENTYPE_NONE;
277 struct debug_tokens *p;
278 SV* report = NEWSV(0, 60);
280 Perl_sv_catpvf(aTHX_ report, "<== ");
282 for (p = debug_tokens; p->token; p++) {
283 if (p->token == (int)rv) {
290 Perl_sv_catpvf(aTHX_ report, "%s", name);
291 else if ((char)rv > ' ' && (char)rv < '~')
292 Perl_sv_catpvf(aTHX_ report, "'%c'", (char)rv);
294 Perl_sv_catpvf(aTHX_ report, "EOF");
296 Perl_sv_catpvf(aTHX_ report, "?? %"IVdf, (IV)rv);
299 case TOKENTYPE_GVVAL: /* doesn't appear to be used */
302 Perl_sv_catpvf(aTHX_ report, "(ival=%"IVdf")", yylval.ival);
304 case TOKENTYPE_OPNUM:
305 Perl_sv_catpvf(aTHX_ report, "(ival=op_%s)",
306 PL_op_name[yylval.ival]);
309 Perl_sv_catpvf(aTHX_ report, "(pval=\"%s\")", yylval.pval);
311 case TOKENTYPE_OPVAL:
312 Perl_sv_catpvf(aTHX_ report, "(opval=op_%s)",
313 PL_op_name[yylval.opval->op_type]);
316 Perl_sv_catpvf(aTHX_ report, " at line %d [", CopLINE(PL_curcop));
317 if (s - PL_bufptr > 0)
318 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
320 if (PL_oldbufptr && *PL_oldbufptr)
321 sv_catpv(report, PL_tokenbuf);
323 PerlIO_printf(Perl_debug_log, "### %s]\n", SvPV_nolen(report));
333 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
334 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
338 S_ao(pTHX_ int toketype)
340 if (*PL_bufptr == '=') {
342 if (toketype == ANDAND)
343 yylval.ival = OP_ANDASSIGN;
344 else if (toketype == OROR)
345 yylval.ival = OP_ORASSIGN;
346 else if (toketype == DORDOR)
347 yylval.ival = OP_DORASSIGN;
355 * When Perl expects an operator and finds something else, no_op
356 * prints the warning. It always prints "<something> found where
357 * operator expected. It prints "Missing semicolon on previous line?"
358 * if the surprise occurs at the start of the line. "do you need to
359 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
360 * where the compiler doesn't know if foo is a method call or a function.
361 * It prints "Missing operator before end of line" if there's nothing
362 * after the missing operator, or "... before <...>" if there is something
363 * after the missing operator.
367 S_no_op(pTHX_ char *what, char *s)
369 char *oldbp = PL_bufptr;
370 bool is_first = (PL_oldbufptr == PL_linestart);
376 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
377 if (ckWARN_d(WARN_SYNTAX)) {
379 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
380 "\t(Missing semicolon on previous line?)\n");
381 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
383 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
384 if (t < PL_bufptr && isSPACE(*t))
385 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
386 "\t(Do you need to predeclare %.*s?)\n",
387 t - PL_oldoldbufptr, PL_oldoldbufptr);
391 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
392 "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
400 * Complain about missing quote/regexp/heredoc terminator.
401 * If it's called with (char *)NULL then it cauterizes the line buffer.
402 * If we're in a delimited string and the delimiter is a control
403 * character, it's reformatted into a two-char sequence like ^C.
408 S_missingterm(pTHX_ char *s)
413 char *nl = strrchr(s,'\n');
419 iscntrl(PL_multi_close)
421 PL_multi_close < 32 || PL_multi_close == 127
425 tmpbuf[1] = toCTRL(PL_multi_close);
431 *tmpbuf = (char)PL_multi_close;
435 q = strchr(s,'"') ? '\'' : '"';
436 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
444 Perl_deprecate(pTHX_ char *s)
446 if (ckWARN(WARN_DEPRECATED))
447 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
451 Perl_deprecate_old(pTHX_ char *s)
453 /* This function should NOT be called for any new deprecated warnings */
454 /* Use Perl_deprecate instead */
456 /* It is here to maintain backward compatibility with the pre-5.8 */
457 /* warnings category hierarchy. The "deprecated" category used to */
458 /* live under the "syntax" category. It is now a top-level category */
459 /* in its own right. */
461 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
462 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
463 "Use of %s is deprecated", s);
468 * Deprecate a comma-less variable list.
474 deprecate_old("comma-less variable list");
478 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
479 * utf16-to-utf8-reversed.
482 #ifdef PERL_CR_FILTER
486 register char *s = SvPVX(sv);
487 register char *e = s + SvCUR(sv);
488 /* outer loop optimized to do nothing if there are no CR-LFs */
490 if (*s++ == '\r' && *s == '\n') {
491 /* hit a CR-LF, need to copy the rest */
492 register char *d = s - 1;
495 if (*s == '\r' && s[1] == '\n')
506 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
508 I32 count = FILTER_READ(idx+1, sv, maxlen);
509 if (count > 0 && !maxlen)
517 * Initialize variables. Uses the Perl save_stack to save its state (for
518 * recursive calls to the parser).
522 Perl_lex_start(pTHX_ SV *line)
527 SAVEI32(PL_lex_dojoin);
528 SAVEI32(PL_lex_brackets);
529 SAVEI32(PL_lex_casemods);
530 SAVEI32(PL_lex_starts);
531 SAVEI32(PL_lex_state);
532 SAVEVPTR(PL_lex_inpat);
533 SAVEI32(PL_lex_inwhat);
534 if (PL_lex_state == LEX_KNOWNEXT) {
535 I32 toke = PL_nexttoke;
536 while (--toke >= 0) {
537 SAVEI32(PL_nexttype[toke]);
538 SAVEVPTR(PL_nextval[toke]);
540 SAVEI32(PL_nexttoke);
542 SAVECOPLINE(PL_curcop);
545 SAVEPPTR(PL_oldbufptr);
546 SAVEPPTR(PL_oldoldbufptr);
547 SAVEPPTR(PL_last_lop);
548 SAVEPPTR(PL_last_uni);
549 SAVEPPTR(PL_linestart);
550 SAVESPTR(PL_linestr);
551 SAVEGENERICPV(PL_lex_brackstack);
552 SAVEGENERICPV(PL_lex_casestack);
553 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
554 SAVESPTR(PL_lex_stuff);
555 SAVEI32(PL_lex_defer);
556 SAVEI32(PL_sublex_info.sub_inwhat);
557 SAVESPTR(PL_lex_repl);
559 SAVEINT(PL_lex_expect);
561 PL_lex_state = LEX_NORMAL;
565 New(899, PL_lex_brackstack, 120, char);
566 New(899, PL_lex_casestack, 12, char);
568 *PL_lex_casestack = '\0';
571 PL_lex_stuff = Nullsv;
572 PL_lex_repl = Nullsv;
576 PL_sublex_info.sub_inwhat = 0;
578 if (SvREADONLY(PL_linestr))
579 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
580 s = SvPV(PL_linestr, len);
581 if (!len || s[len-1] != ';') {
582 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
583 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
584 sv_catpvn(PL_linestr, "\n;", 2);
586 SvTEMP_off(PL_linestr);
587 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
588 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
589 PL_last_lop = PL_last_uni = Nullch;
595 * Finalizer for lexing operations. Must be called when the parser is
596 * done with the lexer.
602 PL_doextract = FALSE;
607 * This subroutine has nothing to do with tilting, whether at windmills
608 * or pinball tables. Its name is short for "increment line". It
609 * increments the current line number in CopLINE(PL_curcop) and checks
610 * to see whether the line starts with a comment of the form
611 * # line 500 "foo.pm"
612 * If so, it sets the current line number and file to the values in the comment.
616 S_incline(pTHX_ char *s)
623 CopLINE_inc(PL_curcop);
626 while (SPACE_OR_TAB(*s)) s++;
627 if (strnEQ(s, "line", 4))
631 if (SPACE_OR_TAB(*s))
635 while (SPACE_OR_TAB(*s)) s++;
641 while (SPACE_OR_TAB(*s))
643 if (*s == '"' && (t = strchr(s+1, '"'))) {
648 for (t = s; !isSPACE(*t); t++) ;
651 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
653 if (*e != '\n' && *e != '\0')
654 return; /* false alarm */
659 CopFILE_free(PL_curcop);
660 CopFILE_set(PL_curcop, s);
663 CopLINE_set(PL_curcop, atoi(n)-1);
668 * Called to gobble the appropriate amount and type of whitespace.
669 * Skips comments as well.
673 S_skipspace(pTHX_ register char *s)
675 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
676 while (s < PL_bufend && SPACE_OR_TAB(*s))
682 SSize_t oldprevlen, oldoldprevlen;
683 SSize_t oldloplen = 0, oldunilen = 0;
684 while (s < PL_bufend && isSPACE(*s)) {
685 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
690 if (s < PL_bufend && *s == '#') {
691 while (s < PL_bufend && *s != '\n')
695 if (PL_in_eval && !PL_rsfp) {
702 /* only continue to recharge the buffer if we're at the end
703 * of the buffer, we're not reading from a source filter, and
704 * we're in normal lexing mode
706 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
707 PL_lex_state == LEX_FORMLINE)
710 /* try to recharge the buffer */
711 if ((s = filter_gets(PL_linestr, PL_rsfp,
712 (prevlen = SvCUR(PL_linestr)))) == Nullch)
714 /* end of file. Add on the -p or -n magic */
715 if (PL_minus_n || PL_minus_p) {
716 sv_setpv(PL_linestr,PL_minus_p ?
717 ";}continue{print or die qq(-p destination: $!\\n)" :
719 sv_catpv(PL_linestr,";}");
720 PL_minus_n = PL_minus_p = 0;
723 sv_setpv(PL_linestr,";");
725 /* reset variables for next time we lex */
726 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
728 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
729 PL_last_lop = PL_last_uni = Nullch;
731 /* Close the filehandle. Could be from -P preprocessor,
732 * STDIN, or a regular file. If we were reading code from
733 * STDIN (because the commandline held no -e or filename)
734 * then we don't close it, we reset it so the code can
735 * read from STDIN too.
738 if (PL_preprocess && !PL_in_eval)
739 (void)PerlProc_pclose(PL_rsfp);
740 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
741 PerlIO_clearerr(PL_rsfp);
743 (void)PerlIO_close(PL_rsfp);
748 /* not at end of file, so we only read another line */
749 /* make corresponding updates to old pointers, for yyerror() */
750 oldprevlen = PL_oldbufptr - PL_bufend;
751 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
753 oldunilen = PL_last_uni - PL_bufend;
755 oldloplen = PL_last_lop - PL_bufend;
756 PL_linestart = PL_bufptr = s + prevlen;
757 PL_bufend = s + SvCUR(PL_linestr);
759 PL_oldbufptr = s + oldprevlen;
760 PL_oldoldbufptr = s + oldoldprevlen;
762 PL_last_uni = s + oldunilen;
764 PL_last_lop = s + oldloplen;
767 /* debugger active and we're not compiling the debugger code,
768 * so store the line into the debugger's array of lines
770 if (PERLDB_LINE && PL_curstash != PL_debstash) {
771 SV *sv = NEWSV(85,0);
773 sv_upgrade(sv, SVt_PVMG);
774 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
777 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
784 * Check the unary operators to ensure there's no ambiguity in how they're
785 * used. An ambiguous piece of code would be:
787 * This doesn't mean rand() + 5. Because rand() is a unary operator,
788 * the +5 is its argument.
797 if (PL_oldoldbufptr != PL_last_uni)
799 while (isSPACE(*PL_last_uni))
801 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
802 if ((t = strchr(s, '(')) && t < PL_bufptr)
804 if (ckWARN_d(WARN_AMBIGUOUS)){
807 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
808 "Warning: Use of \"%s\" without parentheses is ambiguous",
815 * LOP : macro to build a list operator. Its behaviour has been replaced
816 * with a subroutine, S_lop() for which LOP is just another name.
819 #define LOP(f,x) return lop(f,x,s)
823 * Build a list operator (or something that might be one). The rules:
824 * - if we have a next token, then it's a list operator [why?]
825 * - if the next thing is an opening paren, then it's a function
826 * - else it's a list operator
830 S_lop(pTHX_ I32 f, int x, char *s)
836 PL_last_lop = PL_oldbufptr;
837 PL_last_lop_op = (OPCODE)f;
839 return REPORT(LSTOP);
846 return REPORT(LSTOP);
851 * When the lexer realizes it knows the next token (for instance,
852 * it is reordering tokens for the parser) then it can call S_force_next
853 * to know what token to return the next time the lexer is called. Caller
854 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
855 * handles the token correctly.
859 S_force_next(pTHX_ I32 type)
861 PL_nexttype[PL_nexttoke] = type;
863 if (PL_lex_state != LEX_KNOWNEXT) {
864 PL_lex_defer = PL_lex_state;
865 PL_lex_expect = PL_expect;
866 PL_lex_state = LEX_KNOWNEXT;
872 * When the lexer knows the next thing is a word (for instance, it has
873 * just seen -> and it knows that the next char is a word char, then
874 * it calls S_force_word to stick the next word into the PL_next lookahead.
877 * char *start : buffer position (must be within PL_linestr)
878 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
879 * int check_keyword : if true, Perl checks to make sure the word isn't
880 * a keyword (do this if the word is a label, e.g. goto FOO)
881 * int allow_pack : if true, : characters will also be allowed (require,
883 * int allow_initial_tick : used by the "sub" lexer only.
887 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
892 start = skipspace(start);
894 if (isIDFIRST_lazy_if(s,UTF) ||
895 (allow_pack && *s == ':') ||
896 (allow_initial_tick && *s == '\'') )
898 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
899 if (check_keyword && keyword(PL_tokenbuf, len))
901 if (token == METHOD) {
906 PL_expect = XOPERATOR;
909 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
910 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
911 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
912 SvUTF8_on(((SVOP*)PL_nextval[PL_nexttoke].opval)->op_sv);
920 * Called when the lexer wants $foo *foo &foo etc, but the program
921 * text only contains the "foo" portion. The first argument is a pointer
922 * to the "foo", and the second argument is the type symbol to prefix.
923 * Forces the next token to be a "WORD".
924 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
928 S_force_ident(pTHX_ register char *s, int kind)
931 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
932 PL_nextval[PL_nexttoke].opval = o;
935 o->op_private = OPpCONST_ENTERED;
936 /* XXX see note in pp_entereval() for why we forgo typo
937 warnings if the symbol must be introduced in an eval.
939 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
940 kind == '$' ? SVt_PV :
941 kind == '@' ? SVt_PVAV :
942 kind == '%' ? SVt_PVHV :
950 Perl_str_to_version(pTHX_ SV *sv)
955 char *start = SvPVx(sv,len);
956 bool utf = SvUTF8(sv) ? TRUE : FALSE;
957 char *end = start + len;
958 while (start < end) {
962 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
967 retval += ((NV)n)/nshift;
976 * Forces the next token to be a version number.
977 * If the next token appears to be an invalid version number, (e.g. "v2b"),
978 * and if "guessing" is TRUE, then no new token is created (and the caller
979 * must use an alternative parsing method).
983 S_force_version(pTHX_ char *s, int guessing)
985 OP *version = Nullop;
994 while (isDIGIT(*d) || *d == '_' || *d == '.')
996 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
998 s = scan_num(s, &yylval);
999 version = yylval.opval;
1000 ver = cSVOPx(version)->op_sv;
1001 if (SvPOK(ver) && !SvNIOK(ver)) {
1002 (void)SvUPGRADE(ver, SVt_PVNV);
1003 SvNVX(ver) = str_to_version(ver);
1004 SvNOK_on(ver); /* hint that it is a version */
1011 /* NOTE: The parser sees the package name and the VERSION swapped */
1012 PL_nextval[PL_nexttoke].opval = version;
1020 * Tokenize a quoted string passed in as an SV. It finds the next
1021 * chunk, up to end of string or a backslash. It may make a new
1022 * SV containing that chunk (if HINT_NEW_STRING is on). It also
1027 S_tokeq(pTHX_ SV *sv)
1030 register char *send;
1038 s = SvPV_force(sv, len);
1039 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
1042 while (s < send && *s != '\\')
1047 if ( PL_hints & HINT_NEW_STRING ) {
1048 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
1054 if (s + 1 < send && (s[1] == '\\'))
1055 s++; /* all that, just for this */
1060 SvCUR_set(sv, d - SvPVX(sv));
1062 if ( PL_hints & HINT_NEW_STRING )
1063 return new_constant(NULL, 0, "q", sv, pv, "q");
1068 * Now come three functions related to double-quote context,
1069 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
1070 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
1071 * interact with PL_lex_state, and create fake ( ... ) argument lists
1072 * to handle functions and concatenation.
1073 * They assume that whoever calls them will be setting up a fake
1074 * join call, because each subthing puts a ',' after it. This lets
1077 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
1079 * (I'm not sure whether the spurious commas at the end of lcfirst's
1080 * arguments and join's arguments are created or not).
1085 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
1087 * Pattern matching will set PL_lex_op to the pattern-matching op to
1088 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
1090 * OP_CONST and OP_READLINE are easy--just make the new op and return.
1092 * Everything else becomes a FUNC.
1094 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
1095 * had an OP_CONST or OP_READLINE). This just sets us up for a
1096 * call to S_sublex_push().
1100 S_sublex_start(pTHX)
1102 register I32 op_type = yylval.ival;
1104 if (op_type == OP_NULL) {
1105 yylval.opval = PL_lex_op;
1109 if (op_type == OP_CONST || op_type == OP_READLINE) {
1110 SV *sv = tokeq(PL_lex_stuff);
1112 if (SvTYPE(sv) == SVt_PVIV) {
1113 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1119 nsv = newSVpvn(p, len);
1125 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1126 PL_lex_stuff = Nullsv;
1127 /* Allow <FH> // "foo" */
1128 if (op_type == OP_READLINE)
1129 PL_expect = XTERMORDORDOR;
1133 PL_sublex_info.super_state = PL_lex_state;
1134 PL_sublex_info.sub_inwhat = op_type;
1135 PL_sublex_info.sub_op = PL_lex_op;
1136 PL_lex_state = LEX_INTERPPUSH;
1140 yylval.opval = PL_lex_op;
1150 * Create a new scope to save the lexing state. The scope will be
1151 * ended in S_sublex_done. Returns a '(', starting the function arguments
1152 * to the uc, lc, etc. found before.
1153 * Sets PL_lex_state to LEX_INTERPCONCAT.
1161 PL_lex_state = PL_sublex_info.super_state;
1162 SAVEI32(PL_lex_dojoin);
1163 SAVEI32(PL_lex_brackets);
1164 SAVEI32(PL_lex_casemods);
1165 SAVEI32(PL_lex_starts);
1166 SAVEI32(PL_lex_state);
1167 SAVEVPTR(PL_lex_inpat);
1168 SAVEI32(PL_lex_inwhat);
1169 SAVECOPLINE(PL_curcop);
1170 SAVEPPTR(PL_bufptr);
1171 SAVEPPTR(PL_bufend);
1172 SAVEPPTR(PL_oldbufptr);
1173 SAVEPPTR(PL_oldoldbufptr);
1174 SAVEPPTR(PL_last_lop);
1175 SAVEPPTR(PL_last_uni);
1176 SAVEPPTR(PL_linestart);
1177 SAVESPTR(PL_linestr);
1178 SAVEGENERICPV(PL_lex_brackstack);
1179 SAVEGENERICPV(PL_lex_casestack);
1181 PL_linestr = PL_lex_stuff;
1182 PL_lex_stuff = Nullsv;
1184 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1185 = SvPVX(PL_linestr);
1186 PL_bufend += SvCUR(PL_linestr);
1187 PL_last_lop = PL_last_uni = Nullch;
1188 SAVEFREESV(PL_linestr);
1190 PL_lex_dojoin = FALSE;
1191 PL_lex_brackets = 0;
1192 New(899, PL_lex_brackstack, 120, char);
1193 New(899, PL_lex_casestack, 12, char);
1194 PL_lex_casemods = 0;
1195 *PL_lex_casestack = '\0';
1197 PL_lex_state = LEX_INTERPCONCAT;
1198 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1200 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1201 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1202 PL_lex_inpat = PL_sublex_info.sub_op;
1204 PL_lex_inpat = Nullop;
1211 * Restores lexer state after a S_sublex_push.
1217 if (!PL_lex_starts++) {
1218 SV *sv = newSVpvn("",0);
1219 if (SvUTF8(PL_linestr))
1221 PL_expect = XOPERATOR;
1222 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1226 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1227 PL_lex_state = LEX_INTERPCASEMOD;
1231 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1232 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1233 PL_linestr = PL_lex_repl;
1235 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1236 PL_bufend += SvCUR(PL_linestr);
1237 PL_last_lop = PL_last_uni = Nullch;
1238 SAVEFREESV(PL_linestr);
1239 PL_lex_dojoin = FALSE;
1240 PL_lex_brackets = 0;
1241 PL_lex_casemods = 0;
1242 *PL_lex_casestack = '\0';
1244 if (SvEVALED(PL_lex_repl)) {
1245 PL_lex_state = LEX_INTERPNORMAL;
1247 /* we don't clear PL_lex_repl here, so that we can check later
1248 whether this is an evalled subst; that means we rely on the
1249 logic to ensure sublex_done() is called again only via the
1250 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1253 PL_lex_state = LEX_INTERPCONCAT;
1254 PL_lex_repl = Nullsv;
1260 PL_bufend = SvPVX(PL_linestr);
1261 PL_bufend += SvCUR(PL_linestr);
1262 PL_expect = XOPERATOR;
1263 PL_sublex_info.sub_inwhat = 0;
1271 Extracts a pattern, double-quoted string, or transliteration. This
1274 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1275 processing a pattern (PL_lex_inpat is true), a transliteration
1276 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1278 Returns a pointer to the character scanned up to. Iff this is
1279 advanced from the start pointer supplied (ie if anything was
1280 successfully parsed), will leave an OP for the substring scanned
1281 in yylval. Caller must intuit reason for not parsing further
1282 by looking at the next characters herself.
1286 double-quoted style: \r and \n
1287 regexp special ones: \D \s
1289 backrefs: \1 (deprecated in substitution replacements)
1290 case and quoting: \U \Q \E
1291 stops on @ and $, but not for $ as tail anchor
1293 In transliterations:
1294 characters are VERY literal, except for - not at the start or end
1295 of the string, which indicates a range. scan_const expands the
1296 range to the full set of intermediate characters.
1298 In double-quoted strings:
1300 double-quoted style: \r and \n
1302 backrefs: \1 (deprecated)
1303 case and quoting: \U \Q \E
1306 scan_const does *not* construct ops to handle interpolated strings.
1307 It stops processing as soon as it finds an embedded $ or @ variable
1308 and leaves it to the caller to work out what's going on.
1310 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1312 $ in pattern could be $foo or could be tail anchor. Assumption:
1313 it's a tail anchor if $ is the last thing in the string, or if it's
1314 followed by one of ")| \n\t"
1316 \1 (backreferences) are turned into $1
1318 The structure of the code is
1319 while (there's a character to process) {
1320 handle transliteration ranges
1321 skip regexp comments
1322 skip # initiated comments in //x patterns
1323 check for embedded @foo
1324 check for embedded scalars
1326 leave intact backslashes from leave (below)
1327 deprecate \1 in strings and sub replacements
1328 handle string-changing backslashes \l \U \Q \E, etc.
1329 switch (what was escaped) {
1330 handle - in a transliteration (becomes a literal -)
1331 handle \132 octal characters
1332 handle 0x15 hex characters
1333 handle \cV (control V)
1334 handle printf backslashes (\f, \r, \n, etc)
1336 } (end if backslash)
1337 } (end while character to read)
1342 S_scan_const(pTHX_ char *start)
1344 register char *send = PL_bufend; /* end of the constant */
1345 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1346 register char *s = start; /* start of the constant */
1347 register char *d = SvPVX(sv); /* destination for copies */
1348 bool dorange = FALSE; /* are we in a translit range? */
1349 bool didrange = FALSE; /* did we just finish a range? */
1350 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1351 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1354 const char *leaveit = /* set of acceptably-backslashed characters */
1356 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxz0123456789[{]} \t\n\r\f\v#"
1359 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1360 /* If we are doing a trans and we know we want UTF8 set expectation */
1361 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1362 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1366 while (s < send || dorange) {
1367 /* get transliterations out of the way (they're most literal) */
1368 if (PL_lex_inwhat == OP_TRANS) {
1369 /* expand a range A-Z to the full set of characters. AIE! */
1371 I32 i; /* current expanded character */
1372 I32 min; /* first character in range */
1373 I32 max; /* last character in range */
1376 char *c = (char*)utf8_hop((U8*)d, -1);
1380 *c = (char)UTF_TO_NATIVE(0xff);
1381 /* mark the range as done, and continue */
1387 i = d - SvPVX(sv); /* remember current offset */
1388 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1389 d = SvPVX(sv) + i; /* refresh d after realloc */
1390 d -= 2; /* eat the first char and the - */
1392 min = (U8)*d; /* first char in range */
1393 max = (U8)d[1]; /* last char in range */
1397 "Invalid range \"%c-%c\" in transliteration operator",
1398 (char)min, (char)max);
1402 if ((isLOWER(min) && isLOWER(max)) ||
1403 (isUPPER(min) && isUPPER(max))) {
1405 for (i = min; i <= max; i++)
1407 *d++ = NATIVE_TO_NEED(has_utf8,i);
1409 for (i = min; i <= max; i++)
1411 *d++ = NATIVE_TO_NEED(has_utf8,i);
1416 for (i = min; i <= max; i++)
1419 /* mark the range as done, and continue */
1425 /* range begins (ignore - as first or last char) */
1426 else if (*s == '-' && s+1 < send && s != start) {
1428 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1431 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1443 /* if we get here, we're not doing a transliteration */
1445 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1446 except for the last char, which will be done separately. */
1447 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1449 while (s+1 < send && *s != ')')
1450 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1452 else if (s[2] == '{' /* This should match regcomp.c */
1453 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1456 char *regparse = s + (s[2] == '{' ? 3 : 4);
1459 while (count && (c = *regparse)) {
1460 if (c == '\\' && regparse[1])
1468 if (*regparse != ')')
1469 regparse--; /* Leave one char for continuation. */
1470 while (s < regparse)
1471 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1475 /* likewise skip #-initiated comments in //x patterns */
1476 else if (*s == '#' && PL_lex_inpat &&
1477 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1478 while (s+1 < send && *s != '\n')
1479 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1482 /* check for embedded arrays
1483 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1485 else if (*s == '@' && s[1]
1486 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1489 /* check for embedded scalars. only stop if we're sure it's a
1492 else if (*s == '$') {
1493 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1495 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1496 break; /* in regexp, $ might be tail anchor */
1499 /* End of else if chain - OP_TRANS rejoin rest */
1502 if (*s == '\\' && s+1 < send) {
1505 /* some backslashes we leave behind */
1506 if (*leaveit && *s && strchr(leaveit, *s)) {
1507 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1508 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1512 /* deprecate \1 in strings and substitution replacements */
1513 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1514 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1516 if (ckWARN(WARN_SYNTAX))
1517 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1522 /* string-change backslash escapes */
1523 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1528 /* if we get here, it's either a quoted -, or a digit */
1531 /* quoted - in transliterations */
1533 if (PL_lex_inwhat == OP_TRANS) {
1540 if (ckWARN(WARN_MISC) &&
1543 Perl_warner(aTHX_ packWARN(WARN_MISC),
1544 "Unrecognized escape \\%c passed through",
1546 /* default action is to copy the quoted character */
1547 goto default_action;
1550 /* \132 indicates an octal constant */
1551 case '0': case '1': case '2': case '3':
1552 case '4': case '5': case '6': case '7':
1556 uv = grok_oct(s, &len, &flags, NULL);
1559 goto NUM_ESCAPE_INSERT;
1561 /* \x24 indicates a hex constant */
1565 char* e = strchr(s, '}');
1566 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1567 PERL_SCAN_DISALLOW_PREFIX;
1572 yyerror("Missing right brace on \\x{}");
1576 uv = grok_hex(s, &len, &flags, NULL);
1582 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1583 uv = grok_hex(s, &len, &flags, NULL);
1589 /* Insert oct or hex escaped character.
1590 * There will always enough room in sv since such
1591 * escapes will be longer than any UTF-8 sequence
1592 * they can end up as. */
1594 /* We need to map to chars to ASCII before doing the tests
1597 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1598 if (!has_utf8 && uv > 255) {
1599 /* Might need to recode whatever we have
1600 * accumulated so far if it contains any
1603 * (Can't we keep track of that and avoid
1604 * this rescan? --jhi)
1608 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1609 if (!NATIVE_IS_INVARIANT(*c)) {
1614 STRLEN offset = d - SvPVX(sv);
1616 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1620 while (src >= (U8 *)SvPVX(sv)) {
1621 if (!NATIVE_IS_INVARIANT(*src)) {
1622 U8 ch = NATIVE_TO_ASCII(*src);
1623 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1624 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1634 if (has_utf8 || uv > 255) {
1635 d = (char*)uvchr_to_utf8((U8*)d, uv);
1637 if (PL_lex_inwhat == OP_TRANS &&
1638 PL_sublex_info.sub_op) {
1639 PL_sublex_info.sub_op->op_private |=
1640 (PL_lex_repl ? OPpTRANS_FROM_UTF
1653 /* \N{LATIN SMALL LETTER A} is a named character */
1657 char* e = strchr(s, '}');
1663 yyerror("Missing right brace on \\N{}");
1667 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1669 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1670 PERL_SCAN_DISALLOW_PREFIX;
1673 uv = grok_hex(s, &len, &flags, NULL);
1675 goto NUM_ESCAPE_INSERT;
1677 res = newSVpvn(s + 1, e - s - 1);
1678 res = new_constant( Nullch, 0, "charnames",
1679 res, Nullsv, "\\N{...}" );
1681 sv_utf8_upgrade(res);
1682 str = SvPV(res,len);
1683 #ifdef EBCDIC_NEVER_MIND
1684 /* charnames uses pack U and that has been
1685 * recently changed to do the below uni->native
1686 * mapping, so this would be redundant (and wrong,
1687 * the code point would be doubly converted).
1688 * But leave this in just in case the pack U change
1689 * gets revoked, but the semantics is still
1690 * desireable for charnames. --jhi */
1692 UV uv = utf8_to_uvchr((U8*)str, 0);
1695 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1697 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1698 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1699 str = SvPV(res, len);
1703 if (!has_utf8 && SvUTF8(res)) {
1704 char *ostart = SvPVX(sv);
1705 SvCUR_set(sv, d - ostart);
1708 sv_utf8_upgrade(sv);
1709 /* this just broke our allocation above... */
1710 SvGROW(sv, (STRLEN)(send - start));
1711 d = SvPVX(sv) + SvCUR(sv);
1714 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1715 char *odest = SvPVX(sv);
1717 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1718 d = SvPVX(sv) + (d - odest);
1720 Copy(str, d, len, char);
1727 yyerror("Missing braces on \\N{}");
1730 /* \c is a control character */
1739 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1742 yyerror("Missing control char name in \\c");
1746 /* printf-style backslashes, formfeeds, newlines, etc */
1748 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1751 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1754 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1757 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1760 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1763 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1766 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1772 } /* end if (backslash) */
1775 /* If we started with encoded form, or already know we want it
1776 and then encode the next character */
1777 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1779 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1780 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1783 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1784 STRLEN off = d - SvPVX(sv);
1785 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1787 d = (char*)uvchr_to_utf8((U8*)d, uv);
1791 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1793 } /* while loop to process each character */
1795 /* terminate the string and set up the sv */
1797 SvCUR_set(sv, d - SvPVX(sv));
1798 if (SvCUR(sv) >= SvLEN(sv))
1799 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1802 if (PL_encoding && !has_utf8) {
1803 sv_recode_to_utf8(sv, PL_encoding);
1809 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1810 PL_sublex_info.sub_op->op_private |=
1811 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1815 /* shrink the sv if we allocated more than we used */
1816 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1817 SvLEN_set(sv, SvCUR(sv) + 1);
1818 Renew(SvPVX(sv), SvLEN(sv), char);
1821 /* return the substring (via yylval) only if we parsed anything */
1822 if (s > PL_bufptr) {
1823 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1824 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1826 ( PL_lex_inwhat == OP_TRANS
1828 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1831 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1838 * Returns TRUE if there's more to the expression (e.g., a subscript),
1841 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1843 * ->[ and ->{ return TRUE
1844 * { and [ outside a pattern are always subscripts, so return TRUE
1845 * if we're outside a pattern and it's not { or [, then return FALSE
1846 * if we're in a pattern and the first char is a {
1847 * {4,5} (any digits around the comma) returns FALSE
1848 * if we're in a pattern and the first char is a [
1850 * [SOMETHING] has a funky algorithm to decide whether it's a
1851 * character class or not. It has to deal with things like
1852 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1853 * anything else returns TRUE
1856 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1859 S_intuit_more(pTHX_ register char *s)
1861 if (PL_lex_brackets)
1863 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1865 if (*s != '{' && *s != '[')
1870 /* In a pattern, so maybe we have {n,m}. */
1887 /* On the other hand, maybe we have a character class */
1890 if (*s == ']' || *s == '^')
1893 /* this is terrifying, and it works */
1894 int weight = 2; /* let's weigh the evidence */
1896 unsigned char un_char = 255, last_un_char;
1897 char *send = strchr(s,']');
1898 char tmpbuf[sizeof PL_tokenbuf * 4];
1900 if (!send) /* has to be an expression */
1903 Zero(seen,256,char);
1906 else if (isDIGIT(*s)) {
1908 if (isDIGIT(s[1]) && s[2] == ']')
1914 for (; s < send; s++) {
1915 last_un_char = un_char;
1916 un_char = (unsigned char)*s;
1921 weight -= seen[un_char] * 10;
1922 if (isALNUM_lazy_if(s+1,UTF)) {
1923 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1924 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1929 else if (*s == '$' && s[1] &&
1930 strchr("[#!%*<>()-=",s[1])) {
1931 if (/*{*/ strchr("])} =",s[2]))
1940 if (strchr("wds]",s[1]))
1942 else if (seen['\''] || seen['"'])
1944 else if (strchr("rnftbxcav",s[1]))
1946 else if (isDIGIT(s[1])) {
1948 while (s[1] && isDIGIT(s[1]))
1958 if (strchr("aA01! ",last_un_char))
1960 if (strchr("zZ79~",s[1]))
1962 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1963 weight -= 5; /* cope with negative subscript */
1966 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1967 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1972 if (keyword(tmpbuf, d - tmpbuf))
1975 if (un_char == last_un_char + 1)
1977 weight -= seen[un_char];
1982 if (weight >= 0) /* probably a character class */
1992 * Does all the checking to disambiguate
1994 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1995 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1997 * First argument is the stuff after the first token, e.g. "bar".
1999 * Not a method if bar is a filehandle.
2000 * Not a method if foo is a subroutine prototyped to take a filehandle.
2001 * Not a method if it's really "Foo $bar"
2002 * Method if it's "foo $bar"
2003 * Not a method if it's really "print foo $bar"
2004 * Method if it's really "foo package::" (interpreted as package->foo)
2005 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
2006 * Not a method if bar is a filehandle or package, but is quoted with
2011 S_intuit_method(pTHX_ char *start, GV *gv)
2013 char *s = start + (*start == '$');
2014 char tmpbuf[sizeof PL_tokenbuf];
2022 if ((cv = GvCVu(gv))) {
2023 char *proto = SvPVX(cv);
2033 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
2034 /* start is the beginning of the possible filehandle/object,
2035 * and s is the end of it
2036 * tmpbuf is a copy of it
2039 if (*start == '$') {
2040 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
2045 return *s == '(' ? FUNCMETH : METHOD;
2047 if (!keyword(tmpbuf, len)) {
2048 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
2053 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
2054 if (indirgv && GvCVu(indirgv))
2056 /* filehandle or package name makes it a method */
2057 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
2059 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
2060 return 0; /* no assumptions -- "=>" quotes bearword */
2062 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
2063 newSVpvn(tmpbuf,len));
2064 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
2068 return *s == '(' ? FUNCMETH : METHOD;
2076 * Return a string of Perl code to load the debugger. If PERL5DB
2077 * is set, it will return the contents of that, otherwise a
2078 * compile-time require of perl5db.pl.
2085 char *pdb = PerlEnv_getenv("PERL5DB");
2089 SETERRNO(0,SS_NORMAL);
2090 return "BEGIN { require 'perl5db.pl' }";
2096 /* Encoded script support. filter_add() effectively inserts a
2097 * 'pre-processing' function into the current source input stream.
2098 * Note that the filter function only applies to the current source file
2099 * (e.g., it will not affect files 'require'd or 'use'd by this one).
2101 * The datasv parameter (which may be NULL) can be used to pass
2102 * private data to this instance of the filter. The filter function
2103 * can recover the SV using the FILTER_DATA macro and use it to
2104 * store private buffers and state information.
2106 * The supplied datasv parameter is upgraded to a PVIO type
2107 * and the IoDIRP/IoANY field is used to store the function pointer,
2108 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
2109 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
2110 * private use must be set using malloc'd pointers.
2114 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2119 if (!PL_rsfp_filters)
2120 PL_rsfp_filters = newAV();
2122 datasv = NEWSV(255,0);
2123 if (!SvUPGRADE(datasv, SVt_PVIO))
2124 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2125 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2126 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2127 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2128 (void*)funcp, SvPV_nolen(datasv)));
2129 av_unshift(PL_rsfp_filters, 1);
2130 av_store(PL_rsfp_filters, 0, datasv) ;
2135 /* Delete most recently added instance of this filter function. */
2137 Perl_filter_del(pTHX_ filter_t funcp)
2140 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2141 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2143 /* if filter is on top of stack (usual case) just pop it off */
2144 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2145 if (IoANY(datasv) == (void *)funcp) {
2146 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2147 IoANY(datasv) = (void *)NULL;
2148 sv_free(av_pop(PL_rsfp_filters));
2152 /* we need to search for the correct entry and clear it */
2153 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2157 /* Invoke the n'th filter function for the current rsfp. */
2159 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2162 /* 0 = read one text line */
2167 if (!PL_rsfp_filters)
2169 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2170 /* Provide a default input filter to make life easy. */
2171 /* Note that we append to the line. This is handy. */
2172 DEBUG_P(PerlIO_printf(Perl_debug_log,
2173 "filter_read %d: from rsfp\n", idx));
2177 int old_len = SvCUR(buf_sv) ;
2179 /* ensure buf_sv is large enough */
2180 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2181 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2182 if (PerlIO_error(PL_rsfp))
2183 return -1; /* error */
2185 return 0 ; /* end of file */
2187 SvCUR_set(buf_sv, old_len + len) ;
2190 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2191 if (PerlIO_error(PL_rsfp))
2192 return -1; /* error */
2194 return 0 ; /* end of file */
2197 return SvCUR(buf_sv);
2199 /* Skip this filter slot if filter has been deleted */
2200 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2201 DEBUG_P(PerlIO_printf(Perl_debug_log,
2202 "filter_read %d: skipped (filter deleted)\n",
2204 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2206 /* Get function pointer hidden within datasv */
2207 funcp = (filter_t)IoANY(datasv);
2208 DEBUG_P(PerlIO_printf(Perl_debug_log,
2209 "filter_read %d: via function %p (%s)\n",
2210 idx, (void*)funcp, SvPV_nolen(datasv)));
2211 /* Call function. The function is expected to */
2212 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2213 /* Return: <0:error, =0:eof, >0:not eof */
2214 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2218 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2220 #ifdef PERL_CR_FILTER
2221 if (!PL_rsfp_filters) {
2222 filter_add(S_cr_textfilter,NULL);
2225 if (PL_rsfp_filters) {
2228 SvCUR_set(sv, 0); /* start with empty line */
2229 if (FILTER_READ(0, sv, 0) > 0)
2230 return ( SvPVX(sv) ) ;
2235 return (sv_gets(sv, fp, append));
2239 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2243 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2247 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2248 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2250 return GvHV(gv); /* Foo:: */
2253 /* use constant CLASS => 'MyClass' */
2254 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2256 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2257 pkgname = SvPV_nolen(sv);
2261 return gv_stashpv(pkgname, FALSE);
2265 static char* exp_name[] =
2266 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2267 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
2274 Works out what to call the token just pulled out of the input
2275 stream. The yacc parser takes care of taking the ops we return and
2276 stitching them into a tree.
2282 if read an identifier
2283 if we're in a my declaration
2284 croak if they tried to say my($foo::bar)
2285 build the ops for a my() declaration
2286 if it's an access to a my() variable
2287 are we in a sort block?
2288 croak if my($a); $a <=> $b
2289 build ops for access to a my() variable
2290 if in a dq string, and they've said @foo and we can't find @foo
2292 build ops for a bareword
2293 if we already built the token before, use it.
2298 #pragma segment Perl_yylex
2310 I32 orig_keyword = 0;
2313 PerlIO_printf(Perl_debug_log, "### LEX_%s\n",
2314 lex_state_names[PL_lex_state]);
2316 /* check if there's an identifier for us to look at */
2317 if (PL_pending_ident)
2318 return REPORT(S_pending_ident(aTHX));
2320 /* no identifier pending identification */
2322 switch (PL_lex_state) {
2324 case LEX_NORMAL: /* Some compilers will produce faster */
2325 case LEX_INTERPNORMAL: /* code if we comment these out. */
2329 /* when we've already built the next token, just pull it out of the queue */
2332 yylval = PL_nextval[PL_nexttoke];
2334 PL_lex_state = PL_lex_defer;
2335 PL_expect = PL_lex_expect;
2336 PL_lex_defer = LEX_NORMAL;
2338 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2339 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2340 (IV)PL_nexttype[PL_nexttoke]); });
2342 return REPORT(PL_nexttype[PL_nexttoke]);
2344 /* interpolated case modifiers like \L \U, including \Q and \E.
2345 when we get here, PL_bufptr is at the \
2347 case LEX_INTERPCASEMOD:
2349 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2350 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2352 /* handle \E or end of string */
2353 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2357 if (PL_lex_casemods) {
2358 oldmod = PL_lex_casestack[--PL_lex_casemods];
2359 PL_lex_casestack[PL_lex_casemods] = '\0';
2361 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2363 PL_lex_state = LEX_INTERPCONCAT;
2367 if (PL_bufptr != PL_bufend)
2369 PL_lex_state = LEX_INTERPCONCAT;
2373 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2374 "### Saw case modifier at '%s'\n", PL_bufptr); });
2376 if (s[1] == '\\' && s[2] == 'E') {
2378 PL_lex_state = LEX_INTERPCONCAT;
2382 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2383 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2384 if (strchr("LU", *s) &&
2385 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2386 PL_lex_casestack[--PL_lex_casemods] = '\0';
2389 if (PL_lex_casemods > 10)
2390 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2391 PL_lex_casestack[PL_lex_casemods++] = *s;
2392 PL_lex_casestack[PL_lex_casemods] = '\0';
2393 PL_lex_state = LEX_INTERPCONCAT;
2394 PL_nextval[PL_nexttoke].ival = 0;
2397 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2399 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2401 PL_nextval[PL_nexttoke].ival = OP_LC;
2403 PL_nextval[PL_nexttoke].ival = OP_UC;
2405 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2407 Perl_croak(aTHX_ "panic: yylex");
2411 if (PL_lex_starts) {
2420 case LEX_INTERPPUSH:
2421 return REPORT(sublex_push());
2423 case LEX_INTERPSTART:
2424 if (PL_bufptr == PL_bufend)
2425 return REPORT(sublex_done());
2426 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2427 "### Interpolated variable at '%s'\n", PL_bufptr); });
2429 PL_lex_dojoin = (*PL_bufptr == '@');
2430 PL_lex_state = LEX_INTERPNORMAL;
2431 if (PL_lex_dojoin) {
2432 PL_nextval[PL_nexttoke].ival = 0;
2434 force_ident("\"", '$');
2435 PL_nextval[PL_nexttoke].ival = 0;
2437 PL_nextval[PL_nexttoke].ival = 0;
2439 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2442 if (PL_lex_starts++) {
2448 case LEX_INTERPENDMAYBE:
2449 if (intuit_more(PL_bufptr)) {
2450 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2456 if (PL_lex_dojoin) {
2457 PL_lex_dojoin = FALSE;
2458 PL_lex_state = LEX_INTERPCONCAT;
2461 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2462 && SvEVALED(PL_lex_repl))
2464 if (PL_bufptr != PL_bufend)
2465 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2466 PL_lex_repl = Nullsv;
2469 case LEX_INTERPCONCAT:
2471 if (PL_lex_brackets)
2472 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2474 if (PL_bufptr == PL_bufend)
2475 return REPORT(sublex_done());
2477 if (SvIVX(PL_linestr) == '\'') {
2478 SV *sv = newSVsv(PL_linestr);
2481 else if ( PL_hints & HINT_NEW_RE )
2482 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2483 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2487 s = scan_const(PL_bufptr);
2489 PL_lex_state = LEX_INTERPCASEMOD;
2491 PL_lex_state = LEX_INTERPSTART;
2494 if (s != PL_bufptr) {
2495 PL_nextval[PL_nexttoke] = yylval;
2498 if (PL_lex_starts++)
2508 PL_lex_state = LEX_NORMAL;
2509 s = scan_formline(PL_bufptr);
2510 if (!PL_lex_formbrack)
2516 PL_oldoldbufptr = PL_oldbufptr;
2519 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at [%s]\n",
2520 exp_name[PL_expect], s);
2526 if (isIDFIRST_lazy_if(s,UTF))
2528 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2531 goto fake_eof; /* emulate EOF on ^D or ^Z */
2536 if (PL_lex_brackets) {
2537 if (PL_lex_formbrack)
2538 yyerror("Format not terminated");
2540 yyerror("Missing right curly or square bracket");
2542 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2543 "### Tokener got EOF\n");
2547 if (s++ < PL_bufend)
2548 goto retry; /* ignore stray nulls */
2551 if (!PL_in_eval && !PL_preambled) {
2552 PL_preambled = TRUE;
2553 sv_setpv(PL_linestr,incl_perldb());
2554 if (SvCUR(PL_linestr))
2555 sv_catpv(PL_linestr,";");
2557 while(AvFILLp(PL_preambleav) >= 0) {
2558 SV *tmpsv = av_shift(PL_preambleav);
2559 sv_catsv(PL_linestr, tmpsv);
2560 sv_catpv(PL_linestr, ";");
2563 sv_free((SV*)PL_preambleav);
2564 PL_preambleav = NULL;
2566 if (PL_minus_n || PL_minus_p) {
2567 sv_catpv(PL_linestr, "LINE: while (<>) {");
2569 sv_catpv(PL_linestr,"chomp;");
2572 if (strchr("/'\"", *PL_splitstr)
2573 && strchr(PL_splitstr + 1, *PL_splitstr))
2574 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2577 s = "'~#\200\1'"; /* surely one char is unused...*/
2578 while (s[1] && strchr(PL_splitstr, *s)) s++;
2580 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2581 "q" + (delim == '\''), delim);
2582 for (s = PL_splitstr; *s; s++) {
2584 sv_catpvn(PL_linestr, "\\", 1);
2585 sv_catpvn(PL_linestr, s, 1);
2587 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2591 sv_catpv(PL_linestr,"our @F=split(' ');");
2594 sv_catpv(PL_linestr, "\n");
2595 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2596 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2597 PL_last_lop = PL_last_uni = Nullch;
2598 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2599 SV *sv = NEWSV(85,0);
2601 sv_upgrade(sv, SVt_PVMG);
2602 sv_setsv(sv,PL_linestr);
2605 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2610 bof = PL_rsfp ? TRUE : FALSE;
2611 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2614 if (PL_preprocess && !PL_in_eval)
2615 (void)PerlProc_pclose(PL_rsfp);
2616 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2617 PerlIO_clearerr(PL_rsfp);
2619 (void)PerlIO_close(PL_rsfp);
2621 PL_doextract = FALSE;
2623 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2624 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2625 sv_catpv(PL_linestr,";}");
2626 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2627 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2628 PL_last_lop = PL_last_uni = Nullch;
2629 PL_minus_n = PL_minus_p = 0;
2632 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2633 PL_last_lop = PL_last_uni = Nullch;
2634 sv_setpv(PL_linestr,"");
2635 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2637 /* If it looks like the start of a BOM or raw UTF-16,
2638 * check if it in fact is. */
2644 #ifdef PERLIO_IS_STDIO
2645 # ifdef __GNU_LIBRARY__
2646 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2647 # define FTELL_FOR_PIPE_IS_BROKEN
2651 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2652 # define FTELL_FOR_PIPE_IS_BROKEN
2657 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2658 /* This loses the possibility to detect the bof
2659 * situation on perl -P when the libc5 is being used.
2660 * Workaround? Maybe attach some extra state to PL_rsfp?
2663 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2665 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2668 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2669 s = swallow_bom((U8*)s);
2673 /* Incest with pod. */
2674 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2675 sv_setpv(PL_linestr, "");
2676 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2677 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2678 PL_last_lop = PL_last_uni = Nullch;
2679 PL_doextract = FALSE;
2683 } while (PL_doextract);
2684 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2685 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2686 SV *sv = NEWSV(85,0);
2688 sv_upgrade(sv, SVt_PVMG);
2689 sv_setsv(sv,PL_linestr);
2692 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2694 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2695 PL_last_lop = PL_last_uni = Nullch;
2696 if (CopLINE(PL_curcop) == 1) {
2697 while (s < PL_bufend && isSPACE(*s))
2699 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2703 if (*s == '#' && *(s+1) == '!')
2705 #ifdef ALTERNATE_SHEBANG
2707 static char as[] = ALTERNATE_SHEBANG;
2708 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2709 d = s + (sizeof(as) - 1);
2711 #endif /* ALTERNATE_SHEBANG */
2720 while (*d && !isSPACE(*d))
2724 #ifdef ARG_ZERO_IS_SCRIPT
2725 if (ipathend > ipath) {
2727 * HP-UX (at least) sets argv[0] to the script name,
2728 * which makes $^X incorrect. And Digital UNIX and Linux,
2729 * at least, set argv[0] to the basename of the Perl
2730 * interpreter. So, having found "#!", we'll set it right.
2732 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2733 assert(SvPOK(x) || SvGMAGICAL(x));
2734 if (sv_eq(x, CopFILESV(PL_curcop))) {
2735 sv_setpvn(x, ipath, ipathend - ipath);
2741 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2742 char *lstart = SvPV(x,llen);
2744 bstart += blen - llen;
2745 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2746 sv_setpvn(x, ipath, ipathend - ipath);
2751 TAINT_NOT; /* $^X is always tainted, but that's OK */
2753 #endif /* ARG_ZERO_IS_SCRIPT */
2758 d = instr(s,"perl -");
2760 d = instr(s,"perl");
2762 /* avoid getting into infinite loops when shebang
2763 * line contains "Perl" rather than "perl" */
2765 for (d = ipathend-4; d >= ipath; --d) {
2766 if ((*d == 'p' || *d == 'P')
2767 && !ibcmp(d, "perl", 4))
2777 #ifdef ALTERNATE_SHEBANG
2779 * If the ALTERNATE_SHEBANG on this system starts with a
2780 * character that can be part of a Perl expression, then if
2781 * we see it but not "perl", we're probably looking at the
2782 * start of Perl code, not a request to hand off to some
2783 * other interpreter. Similarly, if "perl" is there, but
2784 * not in the first 'word' of the line, we assume the line
2785 * contains the start of the Perl program.
2787 if (d && *s != '#') {
2789 while (*c && !strchr("; \t\r\n\f\v#", *c))
2792 d = Nullch; /* "perl" not in first word; ignore */
2794 *s = '#'; /* Don't try to parse shebang line */
2796 #endif /* ALTERNATE_SHEBANG */
2797 #ifndef MACOS_TRADITIONAL
2802 !instr(s,"indir") &&
2803 instr(PL_origargv[0],"perl"))
2809 while (s < PL_bufend && isSPACE(*s))
2811 if (s < PL_bufend) {
2812 Newz(899,newargv,PL_origargc+3,char*);
2814 while (s < PL_bufend && !isSPACE(*s))
2817 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2820 newargv = PL_origargv;
2823 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2825 Perl_croak(aTHX_ "Can't exec %s", ipath);
2829 U32 oldpdb = PL_perldb;
2830 bool oldn = PL_minus_n;
2831 bool oldp = PL_minus_p;
2833 while (*d && !isSPACE(*d)) d++;
2834 while (SPACE_OR_TAB(*d)) d++;
2837 bool switches_done = PL_doswitches;
2839 if (*d == 'M' || *d == 'm') {
2841 while (*d && !isSPACE(*d)) d++;
2842 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2845 d = moreswitches(d);
2847 if (PL_doswitches && !switches_done) {
2848 int argc = PL_origargc;
2849 char **argv = PL_origargv;
2852 } while (argc && argv[0][0] == '-' && argv[0][1]);
2853 init_argv_symbols(argc,argv);
2855 if ((PERLDB_LINE && !oldpdb) ||
2856 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2857 /* if we have already added "LINE: while (<>) {",
2858 we must not do it again */
2860 sv_setpv(PL_linestr, "");
2861 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2862 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2863 PL_last_lop = PL_last_uni = Nullch;
2864 PL_preambled = FALSE;
2866 (void)gv_fetchfile(PL_origfilename);
2869 if (PL_doswitches && !switches_done) {
2870 int argc = PL_origargc;
2871 char **argv = PL_origargv;
2874 } while (argc && argv[0][0] == '-' && argv[0][1]);
2875 init_argv_symbols(argc,argv);
2881 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2883 PL_lex_state = LEX_FORMLINE;
2888 #ifdef PERL_STRICT_CR
2889 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2891 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2893 case ' ': case '\t': case '\f': case 013:
2894 #ifdef MACOS_TRADITIONAL
2901 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2902 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2903 /* handle eval qq[#line 1 "foo"\n ...] */
2904 CopLINE_dec(PL_curcop);
2908 while (s < d && *s != '\n')
2912 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2913 Perl_croak(aTHX_ "panic: input overflow");
2915 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2917 PL_lex_state = LEX_FORMLINE;
2927 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2934 while (s < PL_bufend && SPACE_OR_TAB(*s))
2937 if (strnEQ(s,"=>",2)) {
2938 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2939 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2940 "### Saw unary minus before =>, forcing word '%s'\n", s);
2942 OPERATOR('-'); /* unary minus */
2944 PL_last_uni = PL_oldbufptr;
2946 case 'r': ftst = OP_FTEREAD; break;
2947 case 'w': ftst = OP_FTEWRITE; break;
2948 case 'x': ftst = OP_FTEEXEC; break;
2949 case 'o': ftst = OP_FTEOWNED; break;
2950 case 'R': ftst = OP_FTRREAD; break;
2951 case 'W': ftst = OP_FTRWRITE; break;
2952 case 'X': ftst = OP_FTREXEC; break;
2953 case 'O': ftst = OP_FTROWNED; break;
2954 case 'e': ftst = OP_FTIS; break;
2955 case 'z': ftst = OP_FTZERO; break;
2956 case 's': ftst = OP_FTSIZE; break;
2957 case 'f': ftst = OP_FTFILE; break;
2958 case 'd': ftst = OP_FTDIR; break;
2959 case 'l': ftst = OP_FTLINK; break;
2960 case 'p': ftst = OP_FTPIPE; break;
2961 case 'S': ftst = OP_FTSOCK; break;
2962 case 'u': ftst = OP_FTSUID; break;
2963 case 'g': ftst = OP_FTSGID; break;
2964 case 'k': ftst = OP_FTSVTX; break;
2965 case 'b': ftst = OP_FTBLK; break;
2966 case 'c': ftst = OP_FTCHR; break;
2967 case 't': ftst = OP_FTTTY; break;
2968 case 'T': ftst = OP_FTTEXT; break;
2969 case 'B': ftst = OP_FTBINARY; break;
2970 case 'M': case 'A': case 'C':
2971 gv_fetchpv("\024",TRUE, SVt_PV);
2973 case 'M': ftst = OP_FTMTIME; break;
2974 case 'A': ftst = OP_FTATIME; break;
2975 case 'C': ftst = OP_FTCTIME; break;
2983 PL_last_lop_op = (OPCODE)ftst;
2984 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2985 "### Saw file test %c\n", (int)ftst);
2990 /* Assume it was a minus followed by a one-letter named
2991 * subroutine call (or a -bareword), then. */
2992 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2993 "### '-%c' looked like a file test but was not\n",
3002 if (PL_expect == XOPERATOR)
3007 else if (*s == '>') {
3010 if (isIDFIRST_lazy_if(s,UTF)) {
3011 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
3019 if (PL_expect == XOPERATOR)
3022 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3024 OPERATOR('-'); /* unary minus */
3031 if (PL_expect == XOPERATOR)
3036 if (PL_expect == XOPERATOR)
3039 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
3045 if (PL_expect != XOPERATOR) {
3046 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3047 PL_expect = XOPERATOR;
3048 force_ident(PL_tokenbuf, '*');
3061 if (PL_expect == XOPERATOR) {
3065 PL_tokenbuf[0] = '%';
3066 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
3067 if (!PL_tokenbuf[1]) {
3070 PL_pending_ident = '%';
3089 switch (PL_expect) {
3092 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3094 PL_bufptr = s; /* update in case we back off */
3100 PL_expect = XTERMBLOCK;
3104 while (isIDFIRST_lazy_if(s,UTF)) {
3105 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3106 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3107 if (tmp < 0) tmp = -tmp;
3123 d = scan_str(d,TRUE,TRUE);
3125 /* MUST advance bufptr here to avoid bogus
3126 "at end of line" context messages from yyerror().
3128 PL_bufptr = s + len;
3129 yyerror("Unterminated attribute parameter in attribute list");
3132 return REPORT(0); /* EOF indicator */
3136 SV *sv = newSVpvn(s, len);
3137 sv_catsv(sv, PL_lex_stuff);
3138 attrs = append_elem(OP_LIST, attrs,
3139 newSVOP(OP_CONST, 0, sv));
3140 SvREFCNT_dec(PL_lex_stuff);
3141 PL_lex_stuff = Nullsv;
3144 if (len == 6 && strnEQ(s, "unique", len)) {
3145 if (PL_in_my == KEY_our)
3147 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3149 ; /* skip to avoid loading attributes.pm */
3152 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3155 /* NOTE: any CV attrs applied here need to be part of
3156 the CVf_BUILTIN_ATTRS define in cv.h! */
3157 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3158 CvLVALUE_on(PL_compcv);
3159 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3160 CvLOCKED_on(PL_compcv);
3161 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3162 CvMETHOD_on(PL_compcv);
3163 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3164 CvASSERTION_on(PL_compcv);
3165 /* After we've set the flags, it could be argued that
3166 we don't need to do the attributes.pm-based setting
3167 process, and shouldn't bother appending recognized
3168 flags. To experiment with that, uncomment the
3169 following "else". (Note that's already been
3170 uncommented. That keeps the above-applied built-in
3171 attributes from being intercepted (and possibly
3172 rejected) by a package's attribute routines, but is
3173 justified by the performance win for the common case
3174 of applying only built-in attributes.) */
3176 attrs = append_elem(OP_LIST, attrs,
3177 newSVOP(OP_CONST, 0,
3181 if (*s == ':' && s[1] != ':')
3184 break; /* require real whitespace or :'s */
3186 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3187 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3188 char q = ((*s == '\'') ? '"' : '\'');
3189 /* If here for an expression, and parsed no attrs, back off. */
3190 if (tmp == '=' && !attrs) {
3194 /* MUST advance bufptr here to avoid bogus "at end of line"
3195 context messages from yyerror().
3199 yyerror("Unterminated attribute list");
3201 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3209 PL_nextval[PL_nexttoke].opval = attrs;
3217 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3218 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3235 if (PL_lex_brackets <= 0)
3236 yyerror("Unmatched right square bracket");
3239 if (PL_lex_state == LEX_INTERPNORMAL) {
3240 if (PL_lex_brackets == 0) {
3241 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3242 PL_lex_state = LEX_INTERPEND;
3249 if (PL_lex_brackets > 100) {
3250 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3252 switch (PL_expect) {
3254 if (PL_lex_formbrack) {
3258 if (PL_oldoldbufptr == PL_last_lop)
3259 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3261 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3262 OPERATOR(HASHBRACK);
3264 while (s < PL_bufend && SPACE_OR_TAB(*s))
3267 PL_tokenbuf[0] = '\0';
3268 if (d < PL_bufend && *d == '-') {
3269 PL_tokenbuf[0] = '-';
3271 while (d < PL_bufend && SPACE_OR_TAB(*d))
3274 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3275 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3277 while (d < PL_bufend && SPACE_OR_TAB(*d))
3280 char minus = (PL_tokenbuf[0] == '-');
3281 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3289 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3294 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3299 if (PL_oldoldbufptr == PL_last_lop)
3300 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3302 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3305 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3307 /* This hack is to get the ${} in the message. */
3309 yyerror("syntax error");
3312 OPERATOR(HASHBRACK);
3314 /* This hack serves to disambiguate a pair of curlies
3315 * as being a block or an anon hash. Normally, expectation
3316 * determines that, but in cases where we're not in a
3317 * position to expect anything in particular (like inside
3318 * eval"") we have to resolve the ambiguity. This code
3319 * covers the case where the first term in the curlies is a
3320 * quoted string. Most other cases need to be explicitly
3321 * disambiguated by prepending a `+' before the opening
3322 * curly in order to force resolution as an anon hash.
3324 * XXX should probably propagate the outer expectation
3325 * into eval"" to rely less on this hack, but that could
3326 * potentially break current behavior of eval"".
3330 if (*s == '\'' || *s == '"' || *s == '`') {
3331 /* common case: get past first string, handling escapes */
3332 for (t++; t < PL_bufend && *t != *s;)
3333 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3337 else if (*s == 'q') {
3340 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3343 /* skip q//-like construct */
3345 char open, close, term;
3348 while (t < PL_bufend && isSPACE(*t))
3350 /* check for q => */
3351 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3352 OPERATOR(HASHBRACK);
3356 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3360 for (t++; t < PL_bufend; t++) {
3361 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3363 else if (*t == open)
3367 for (t++; t < PL_bufend; t++) {
3368 if (*t == '\\' && t+1 < PL_bufend)
3370 else if (*t == close && --brackets <= 0)
3372 else if (*t == open)
3379 /* skip plain q word */
3380 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3383 else if (isALNUM_lazy_if(t,UTF)) {
3385 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3388 while (t < PL_bufend && isSPACE(*t))
3390 /* if comma follows first term, call it an anon hash */
3391 /* XXX it could be a comma expression with loop modifiers */
3392 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3393 || (*t == '=' && t[1] == '>')))
3394 OPERATOR(HASHBRACK);
3395 if (PL_expect == XREF)
3398 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3404 yylval.ival = CopLINE(PL_curcop);
3405 if (isSPACE(*s) || *s == '#')
3406 PL_copline = NOLINE; /* invalidate current command line number */
3411 if (PL_lex_brackets <= 0)
3412 yyerror("Unmatched right curly bracket");
3414 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3415 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3416 PL_lex_formbrack = 0;
3417 if (PL_lex_state == LEX_INTERPNORMAL) {
3418 if (PL_lex_brackets == 0) {
3419 if (PL_expect & XFAKEBRACK) {
3420 PL_expect &= XENUMMASK;
3421 PL_lex_state = LEX_INTERPEND;
3423 return yylex(); /* ignore fake brackets */
3425 if (*s == '-' && s[1] == '>')
3426 PL_lex_state = LEX_INTERPENDMAYBE;
3427 else if (*s != '[' && *s != '{')
3428 PL_lex_state = LEX_INTERPEND;
3431 if (PL_expect & XFAKEBRACK) {
3432 PL_expect &= XENUMMASK;
3434 return yylex(); /* ignore fake brackets */
3444 if (PL_expect == XOPERATOR) {
3445 if (ckWARN(WARN_SEMICOLON)
3446 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3448 CopLINE_dec(PL_curcop);
3449 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3450 CopLINE_inc(PL_curcop);
3455 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3457 PL_expect = XOPERATOR;
3458 force_ident(PL_tokenbuf, '&');
3462 yylval.ival = (OPpENTERSUB_AMPER<<8);
3481 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3482 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3484 if (PL_expect == XSTATE && isALPHA(tmp) &&
3485 (s == PL_linestart+1 || s[-2] == '\n') )
3487 if (PL_in_eval && !PL_rsfp) {
3492 if (strnEQ(s,"=cut",4)) {
3506 PL_doextract = TRUE;
3509 if (PL_lex_brackets < PL_lex_formbrack) {
3511 #ifdef PERL_STRICT_CR
3512 for (t = s; SPACE_OR_TAB(*t); t++) ;
3514 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3516 if (*t == '\n' || *t == '#') {
3528 /* was this !=~ where !~ was meant?
3529 * warn on m:!=~\s+([/?]|[msy]\W|tr\W): */
3531 if (*s == '~' && ckWARN(WARN_SYNTAX)) {
3534 while (t < PL_bufend && isSPACE(*t))
3537 if (*t == '/' || *t == '?' ||
3538 ((*t == 'm' || *t == 's' || *t == 'y') && !isALNUM(t[1])) ||
3539 (*t == 't' && t[1] == 'r' && !isALNUM(t[2])))
3540 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3541 "!=~ should be !~");
3550 if (PL_expect != XOPERATOR) {
3551 if (s[1] != '<' && !strchr(s,'>'))
3554 s = scan_heredoc(s);
3556 s = scan_inputsymbol(s);
3557 TERM(sublex_start());
3562 SHop(OP_LEFT_SHIFT);
3576 SHop(OP_RIGHT_SHIFT);
3585 if (PL_expect == XOPERATOR) {
3586 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3589 return REPORT(','); /* grandfather non-comma-format format */
3593 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3594 PL_tokenbuf[0] = '@';
3595 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3596 sizeof PL_tokenbuf - 1, FALSE);
3597 if (PL_expect == XOPERATOR)
3598 no_op("Array length", s);
3599 if (!PL_tokenbuf[1])
3601 PL_expect = XOPERATOR;
3602 PL_pending_ident = '#';
3606 PL_tokenbuf[0] = '$';
3607 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3608 sizeof PL_tokenbuf - 1, FALSE);
3609 if (PL_expect == XOPERATOR)
3611 if (!PL_tokenbuf[1]) {
3613 yyerror("Final $ should be \\$ or $name");
3617 /* This kludge not intended to be bulletproof. */
3618 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3619 yylval.opval = newSVOP(OP_CONST, 0,
3620 newSViv(PL_compiling.cop_arybase));
3621 yylval.opval->op_private = OPpCONST_ARYBASE;
3627 if (PL_lex_state == LEX_NORMAL)
3630 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3633 PL_tokenbuf[0] = '@';
3634 if (ckWARN(WARN_SYNTAX)) {
3636 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3639 PL_bufptr = skipspace(PL_bufptr);
3640 while (t < PL_bufend && *t != ']')
3642 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3643 "Multidimensional syntax %.*s not supported",
3644 (t - PL_bufptr) + 1, PL_bufptr);
3648 else if (*s == '{') {
3649 PL_tokenbuf[0] = '%';
3650 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3651 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3653 char tmpbuf[sizeof PL_tokenbuf];
3655 for (t++; isSPACE(*t); t++) ;
3656 if (isIDFIRST_lazy_if(t,UTF)) {
3657 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3658 for (; isSPACE(*t); t++) ;
3659 if (*t == ';' && get_cv(tmpbuf, FALSE))
3660 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3661 "You need to quote \"%s\"", tmpbuf);
3667 PL_expect = XOPERATOR;
3668 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3669 bool islop = (PL_last_lop == PL_oldoldbufptr);
3670 if (!islop || PL_last_lop_op == OP_GREPSTART)
3671 PL_expect = XOPERATOR;
3672 else if (strchr("$@\"'`q", *s))
3673 PL_expect = XTERM; /* e.g. print $fh "foo" */
3674 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3675 PL_expect = XTERM; /* e.g. print $fh &sub */
3676 else if (isIDFIRST_lazy_if(s,UTF)) {
3677 char tmpbuf[sizeof PL_tokenbuf];
3678 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3679 if ((tmp = keyword(tmpbuf, len))) {
3680 /* binary operators exclude handle interpretations */
3692 PL_expect = XTERM; /* e.g. print $fh length() */
3697 PL_expect = XTERM; /* e.g. print $fh subr() */
3700 else if (isDIGIT(*s))
3701 PL_expect = XTERM; /* e.g. print $fh 3 */
3702 else if (*s == '.' && isDIGIT(s[1]))
3703 PL_expect = XTERM; /* e.g. print $fh .3 */
3704 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3705 PL_expect = XTERM; /* e.g. print $fh -1 */
3706 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3707 PL_expect = XTERM; /* e.g. print $fh /.../
3708 XXX except DORDOR operator */
3709 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3710 PL_expect = XTERM; /* print $fh <<"EOF" */
3712 PL_pending_ident = '$';
3716 if (PL_expect == XOPERATOR)
3718 PL_tokenbuf[0] = '@';
3719 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3720 if (!PL_tokenbuf[1]) {
3723 if (PL_lex_state == LEX_NORMAL)
3725 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3727 PL_tokenbuf[0] = '%';
3729 /* Warn about @ where they meant $. */
3730 if (ckWARN(WARN_SYNTAX)) {
3731 if (*s == '[' || *s == '{') {
3733 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3735 if (*t == '}' || *t == ']') {
3737 PL_bufptr = skipspace(PL_bufptr);
3738 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3739 "Scalar value %.*s better written as $%.*s",
3740 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3745 PL_pending_ident = '@';
3748 case '/': /* may be division, defined-or, or pattern */
3749 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3753 case '?': /* may either be conditional or pattern */
3754 if(PL_expect == XOPERATOR) {
3762 /* A // operator. */
3772 /* Disable warning on "study /blah/" */
3773 if (PL_oldoldbufptr == PL_last_uni
3774 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3775 || memNE(PL_last_uni, "study", 5)
3776 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3779 s = scan_pat(s,OP_MATCH);
3780 TERM(sublex_start());
3784 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3785 #ifdef PERL_STRICT_CR
3788 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3790 && (s == PL_linestart || s[-1] == '\n') )
3792 PL_lex_formbrack = 0;
3796 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3802 yylval.ival = OPf_SPECIAL;
3808 if (PL_expect != XOPERATOR)
3813 case '0': case '1': case '2': case '3': case '4':
3814 case '5': case '6': case '7': case '8': case '9':
3815 s = scan_num(s, &yylval);
3816 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3817 "### Saw number in '%s'\n", s);
3819 if (PL_expect == XOPERATOR)
3824 s = scan_str(s,FALSE,FALSE);
3825 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3826 "### Saw string before '%s'\n", s);
3828 if (PL_expect == XOPERATOR) {
3829 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3832 return REPORT(','); /* grandfather non-comma-format format */
3838 missingterm((char*)0);
3839 yylval.ival = OP_CONST;
3840 TERM(sublex_start());
3843 s = scan_str(s,FALSE,FALSE);
3844 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3845 "### Saw string before '%s'\n", s);
3847 if (PL_expect == XOPERATOR) {
3848 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3851 return REPORT(','); /* grandfather non-comma-format format */
3857 missingterm((char*)0);
3858 yylval.ival = OP_CONST;
3859 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3860 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3861 yylval.ival = OP_STRINGIFY;
3865 TERM(sublex_start());
3868 s = scan_str(s,FALSE,FALSE);
3869 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3870 "### Saw backtick string before '%s'\n", s);
3872 if (PL_expect == XOPERATOR)
3873 no_op("Backticks",s);
3875 missingterm((char*)0);
3876 yylval.ival = OP_BACKTICK;
3878 TERM(sublex_start());
3882 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3883 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3885 if (PL_expect == XOPERATOR)
3886 no_op("Backslash",s);
3890 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3894 while (isDIGIT(*start) || *start == '_')
3896 if (*start == '.' && isDIGIT(start[1])) {
3897 s = scan_num(s, &yylval);
3900 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3901 else if (!isALPHA(*start) && (PL_expect == XTERM
3902 || PL_expect == XREF || PL_expect == XSTATE
3903 || PL_expect == XTERMORDORDOR)) {
3907 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3910 s = scan_num(s, &yylval);
3917 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3957 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3959 /* Some keywords can be followed by any delimiter, including ':' */
3960 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3961 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3962 (PL_tokenbuf[0] == 'q' &&
3963 strchr("qwxr", PL_tokenbuf[1])))));
3965 /* x::* is just a word, unless x is "CORE" */
3966 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3970 while (d < PL_bufend && isSPACE(*d))
3971 d++; /* no comments skipped here, or s### is misparsed */
3973 /* Is this a label? */
3974 if (!tmp && PL_expect == XSTATE
3975 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3977 yylval.pval = savepv(PL_tokenbuf);
3982 /* Check for keywords */
3983 tmp = keyword(PL_tokenbuf, len);
3985 /* Is this a word before a => operator? */
3986 if (*d == '=' && d[1] == '>') {
3988 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3989 yylval.opval->op_private = OPpCONST_BARE;
3990 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3991 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3995 if (tmp < 0) { /* second-class keyword? */
3996 GV *ogv = Nullgv; /* override (winner) */
3997 GV *hgv = Nullgv; /* hidden (loser) */
3998 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
4000 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
4003 if (GvIMPORTED_CV(gv))
4005 else if (! CvMETHOD(cv))
4009 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
4010 (gv = *gvp) != (GV*)&PL_sv_undef &&
4011 GvCVu(gv) && GvIMPORTED_CV(gv))
4018 tmp = 0; /* overridden by import or by GLOBAL */
4021 && -tmp==KEY_lock /* XXX generalizable kludge */
4023 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
4025 tmp = 0; /* any sub overrides "weak" keyword */
4027 else { /* no override */
4029 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
4030 Perl_warner(aTHX_ packWARN(WARN_MISC),
4031 "dump() better written as CORE::dump()");
4035 if (ckWARN(WARN_AMBIGUOUS) && hgv
4036 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
4037 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4038 "Ambiguous call resolved as CORE::%s(), %s",
4039 GvENAME(hgv), "qualify as such or use &");
4046 default: /* not a keyword */
4050 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
4052 /* Get the rest if it looks like a package qualifier */
4054 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
4056 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
4059 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
4060 *s == '\'' ? "'" : "::");
4065 if (PL_expect == XOPERATOR) {
4066 if (PL_bufptr == PL_linestart) {
4067 CopLINE_dec(PL_curcop);
4068 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
4069 CopLINE_inc(PL_curcop);
4072 no_op("Bareword",s);
4075 /* Look for a subroutine with this name in current package,
4076 unless name is "Foo::", in which case Foo is a bearword
4077 (and a package name). */
4080 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
4082 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
4083 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
4084 "Bareword \"%s\" refers to nonexistent package",
4087 PL_tokenbuf[len] = '\0';
4094 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
4097 /* if we saw a global override before, get the right name */
4100 sv = newSVpvn("CORE::GLOBAL::",14);
4101 sv_catpv(sv,PL_tokenbuf);
4104 sv = newSVpv(PL_tokenbuf,0);
4106 /* Presume this is going to be a bareword of some sort. */
4109 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
4110 yylval.opval->op_private = OPpCONST_BARE;
4111 /* UTF-8 package name? */
4112 if (UTF && !IN_BYTES &&
4113 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
4116 /* And if "Foo::", then that's what it certainly is. */
4121 /* See if it's the indirect object for a list operator. */
4123 if (PL_oldoldbufptr &&
4124 PL_oldoldbufptr < PL_bufptr &&
4125 (PL_oldoldbufptr == PL_last_lop
4126 || PL_oldoldbufptr == PL_last_uni) &&
4127 /* NO SKIPSPACE BEFORE HERE! */
4128 (PL_expect == XREF ||
4129 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4131 bool immediate_paren = *s == '(';
4133 /* (Now we can afford to cross potential line boundary.) */
4136 /* Two barewords in a row may indicate method call. */
4138 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4141 /* If not a declared subroutine, it's an indirect object. */
4142 /* (But it's an indir obj regardless for sort.) */
4144 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4145 ((!gv || !GvCVu(gv)) &&
4146 (PL_last_lop_op != OP_MAPSTART &&
4147 PL_last_lop_op != OP_GREPSTART))))
4149 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4154 PL_expect = XOPERATOR;
4157 /* Is this a word before a => operator? */
4158 if (*s == '=' && s[1] == '>' && !pkgname) {
4160 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4161 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4162 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4166 /* If followed by a paren, it's certainly a subroutine. */
4169 if (gv && GvCVu(gv)) {
4170 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4171 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4176 PL_nextval[PL_nexttoke].opval = yylval.opval;
4177 PL_expect = XOPERATOR;
4183 /* If followed by var or block, call it a method (unless sub) */
4185 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4186 PL_last_lop = PL_oldbufptr;
4187 PL_last_lop_op = OP_METHOD;
4191 /* If followed by a bareword, see if it looks like indir obj. */
4194 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4195 && (tmp = intuit_method(s,gv)))
4198 /* Not a method, so call it a subroutine (if defined) */
4200 if (gv && GvCVu(gv)) {
4202 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4203 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4204 "Ambiguous use of -%s resolved as -&%s()",
4205 PL_tokenbuf, PL_tokenbuf);
4206 /* Check for a constant sub */
4208 if ((sv = cv_const_sv(cv))) {
4210 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4211 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4212 yylval.opval->op_private = 0;
4216 /* Resolve to GV now. */
4217 op_free(yylval.opval);
4218 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4219 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4220 PL_last_lop = PL_oldbufptr;
4221 PL_last_lop_op = OP_ENTERSUB;
4222 /* Is there a prototype? */
4225 char *proto = SvPV((SV*)cv, len);
4228 if (strEQ(proto, "$"))
4230 while (*proto == ';')
4232 if (*proto == '&' && *s == '{') {
4233 sv_setpv(PL_subname, PL_curstash ?
4234 "__ANON__" : "__ANON__::__ANON__");
4238 PL_nextval[PL_nexttoke].opval = yylval.opval;
4244 /* Call it a bare word */
4246 if (PL_hints & HINT_STRICT_SUBS)
4247 yylval.opval->op_private |= OPpCONST_STRICT;
4250 if (ckWARN(WARN_RESERVED)) {
4251 if (lastchar != '-') {
4252 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4253 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4254 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4261 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4262 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4263 "Operator or semicolon missing before %c%s",
4264 lastchar, PL_tokenbuf);
4265 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4266 "Ambiguous use of %c resolved as operator %c",
4267 lastchar, lastchar);
4273 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4274 newSVpv(CopFILE(PL_curcop),0));
4278 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4279 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4282 case KEY___PACKAGE__:
4283 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4285 ? newSVsv(PL_curstname)
4294 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4295 char *pname = "main";
4296 if (PL_tokenbuf[2] == 'D')
4297 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4298 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4301 GvIOp(gv) = newIO();
4302 IoIFP(GvIOp(gv)) = PL_rsfp;
4303 #if defined(HAS_FCNTL) && defined(F_SETFD)
4305 int fd = PerlIO_fileno(PL_rsfp);
4306 fcntl(fd,F_SETFD,fd >= 3);
4309 /* Mark this internal pseudo-handle as clean */
4310 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4312 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4313 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4314 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4316 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4317 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4318 /* if the script was opened in binmode, we need to revert
4319 * it to text mode for compatibility; but only iff it has CRs
4320 * XXX this is a questionable hack at best. */
4321 if (PL_bufend-PL_bufptr > 2
4322 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4325 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4326 loc = PerlIO_tell(PL_rsfp);
4327 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4330 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4332 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4333 #endif /* NETWARE */
4334 #ifdef PERLIO_IS_STDIO /* really? */
4335 # if defined(__BORLANDC__)
4336 /* XXX see note in do_binmode() */
4337 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4341 PerlIO_seek(PL_rsfp, loc, 0);
4345 #ifdef PERLIO_LAYERS
4348 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4349 else if (PL_encoding) {
4356 XPUSHs(PL_encoding);
4358 call_method("name", G_SCALAR);
4362 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4363 Perl_form(aTHX_ ":encoding(%"SVf")",
4381 if (PL_expect == XSTATE) {
4388 if (*s == ':' && s[1] == ':') {
4391 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4392 if (!(tmp = keyword(PL_tokenbuf, len)))
4393 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4407 LOP(OP_ACCEPT,XTERM);
4413 LOP(OP_ATAN2,XTERM);
4419 LOP(OP_BINMODE,XTERM);
4422 LOP(OP_BLESS,XTERM);
4431 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4448 if (!PL_cryptseen) {
4449 PL_cryptseen = TRUE;
4453 LOP(OP_CRYPT,XTERM);
4456 LOP(OP_CHMOD,XTERM);
4459 LOP(OP_CHOWN,XTERM);
4462 LOP(OP_CONNECT,XTERM);
4478 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4482 PL_hints |= HINT_BLOCK_SCOPE;
4492 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4493 LOP(OP_DBMOPEN,XTERM);
4499 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4506 yylval.ival = CopLINE(PL_curcop);
4520 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4521 UNIBRACK(OP_ENTEREVAL);
4539 case KEY_endhostent:
4545 case KEY_endservent:
4548 case KEY_endprotoent:
4559 yylval.ival = CopLINE(PL_curcop);
4561 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4563 if ((PL_bufend - p) >= 3 &&
4564 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4566 else if ((PL_bufend - p) >= 4 &&
4567 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4570 if (isIDFIRST_lazy_if(p,UTF)) {
4571 p = scan_ident(p, PL_bufend,
4572 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4576 Perl_croak(aTHX_ "Missing $ on loop variable");
4581 LOP(OP_FORMLINE,XTERM);
4587 LOP(OP_FCNTL,XTERM);
4593 LOP(OP_FLOCK,XTERM);
4602 LOP(OP_GREPSTART, XREF);
4605 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4620 case KEY_getpriority:
4621 LOP(OP_GETPRIORITY,XTERM);
4623 case KEY_getprotobyname:
4626 case KEY_getprotobynumber:
4627 LOP(OP_GPBYNUMBER,XTERM);
4629 case KEY_getprotoent:
4641 case KEY_getpeername:
4642 UNI(OP_GETPEERNAME);
4644 case KEY_gethostbyname:
4647 case KEY_gethostbyaddr:
4648 LOP(OP_GHBYADDR,XTERM);
4650 case KEY_gethostent:
4653 case KEY_getnetbyname:
4656 case KEY_getnetbyaddr:
4657 LOP(OP_GNBYADDR,XTERM);
4662 case KEY_getservbyname:
4663 LOP(OP_GSBYNAME,XTERM);
4665 case KEY_getservbyport:
4666 LOP(OP_GSBYPORT,XTERM);
4668 case KEY_getservent:
4671 case KEY_getsockname:
4672 UNI(OP_GETSOCKNAME);
4674 case KEY_getsockopt:
4675 LOP(OP_GSOCKOPT,XTERM);
4697 yylval.ival = CopLINE(PL_curcop);
4701 LOP(OP_INDEX,XTERM);
4707 LOP(OP_IOCTL,XTERM);
4719 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4751 LOP(OP_LISTEN,XTERM);
4760 s = scan_pat(s,OP_MATCH);
4761 TERM(sublex_start());
4764 LOP(OP_MAPSTART, XREF);
4767 LOP(OP_MKDIR,XTERM);
4770 LOP(OP_MSGCTL,XTERM);
4773 LOP(OP_MSGGET,XTERM);
4776 LOP(OP_MSGRCV,XTERM);
4779 LOP(OP_MSGSND,XTERM);
4785 if (isIDFIRST_lazy_if(s,UTF)) {
4786 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4787 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4789 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4790 if (!PL_in_my_stash) {
4793 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4801 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4808 if (PL_expect != XSTATE)
4809 yyerror("\"no\" not allowed in expression");
4810 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4811 s = force_version(s, FALSE);
4816 if (*s == '(' || (s = skipspace(s), *s == '('))
4823 if (isIDFIRST_lazy_if(s,UTF)) {
4825 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4826 for (t=d; *t && isSPACE(*t); t++) ;
4827 if ( *t && strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4829 && !(t[0] == '=' && t[1] == '>')
4831 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4832 "Precedence problem: open %.*s should be open(%.*s)",
4833 d - s, s, d - s, s);
4839 yylval.ival = OP_OR;
4849 LOP(OP_OPEN_DIR,XTERM);
4852 checkcomma(s,PL_tokenbuf,"filehandle");
4856 checkcomma(s,PL_tokenbuf,"filehandle");
4875 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4879 LOP(OP_PIPE_OP,XTERM);
4882 s = scan_str(s,FALSE,FALSE);
4884 missingterm((char*)0);
4885 yylval.ival = OP_CONST;
4886 TERM(sublex_start());
4892 s = scan_str(s,FALSE,FALSE);
4894 missingterm((char*)0);
4896 if (SvCUR(PL_lex_stuff)) {
4899 d = SvPV_force(PL_lex_stuff, len);
4902 for (; isSPACE(*d) && len; --len, ++d) ;
4905 if (!warned && ckWARN(WARN_QW)) {
4906 for (; !isSPACE(*d) && len; --len, ++d) {
4908 Perl_warner(aTHX_ packWARN(WARN_QW),
4909 "Possible attempt to separate words with commas");
4912 else if (*d == '#') {
4913 Perl_warner(aTHX_ packWARN(WARN_QW),
4914 "Possible attempt to put comments in qw() list");
4920 for (; !isSPACE(*d) && len; --len, ++d) ;
4922 sv = newSVpvn(b, d-b);
4923 if (DO_UTF8(PL_lex_stuff))
4925 words = append_elem(OP_LIST, words,
4926 newSVOP(OP_CONST, 0, tokeq(sv)));
4930 PL_nextval[PL_nexttoke].opval = words;
4935 SvREFCNT_dec(PL_lex_stuff);
4936 PL_lex_stuff = Nullsv;
4942 s = scan_str(s,FALSE,FALSE);
4944 missingterm((char*)0);
4945 yylval.ival = OP_STRINGIFY;
4946 if (SvIVX(PL_lex_stuff) == '\'')
4947 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4948 TERM(sublex_start());
4951 s = scan_pat(s,OP_QR);
4952 TERM(sublex_start());
4955 s = scan_str(s,FALSE,FALSE);
4957 missingterm((char*)0);
4958 yylval.ival = OP_BACKTICK;
4960 TERM(sublex_start());
4968 s = force_version(s, FALSE);
4970 else if (*s != 'v' || !isDIGIT(s[1])
4971 || (s = force_version(s, TRUE), *s == 'v'))
4973 *PL_tokenbuf = '\0';
4974 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4975 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4976 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4978 yyerror("<> should be quotes");
4986 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4990 LOP(OP_RENAME,XTERM);
4999 LOP(OP_RINDEX,XTERM);
5009 UNIDOR(OP_READLINE);
5022 LOP(OP_REVERSE,XTERM);
5025 UNIDOR(OP_READLINK);
5033 TERM(sublex_start());
5035 TOKEN(1); /* force error */
5044 LOP(OP_SELECT,XTERM);
5050 LOP(OP_SEMCTL,XTERM);
5053 LOP(OP_SEMGET,XTERM);
5056 LOP(OP_SEMOP,XTERM);
5062 LOP(OP_SETPGRP,XTERM);
5064 case KEY_setpriority:
5065 LOP(OP_SETPRIORITY,XTERM);
5067 case KEY_sethostent:
5073 case KEY_setservent:
5076 case KEY_setprotoent:
5086 LOP(OP_SEEKDIR,XTERM);
5088 case KEY_setsockopt:
5089 LOP(OP_SSOCKOPT,XTERM);
5095 LOP(OP_SHMCTL,XTERM);
5098 LOP(OP_SHMGET,XTERM);
5101 LOP(OP_SHMREAD,XTERM);
5104 LOP(OP_SHMWRITE,XTERM);
5107 LOP(OP_SHUTDOWN,XTERM);
5116 LOP(OP_SOCKET,XTERM);
5118 case KEY_socketpair:
5119 LOP(OP_SOCKPAIR,XTERM);
5122 checkcomma(s,PL_tokenbuf,"subroutine name");
5124 if (*s == ';' || *s == ')') /* probably a close */
5125 Perl_croak(aTHX_ "sort is now a reserved word");
5127 s = force_word(s,WORD,TRUE,TRUE,FALSE);
5131 LOP(OP_SPLIT,XTERM);
5134 LOP(OP_SPRINTF,XTERM);
5137 LOP(OP_SPLICE,XTERM);
5152 LOP(OP_SUBSTR,XTERM);
5158 char tmpbuf[sizeof PL_tokenbuf];
5159 SSize_t tboffset = 0;
5160 expectation attrful;
5161 bool have_name, have_proto, bad_proto;
5166 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5167 (*s == ':' && s[1] == ':'))
5170 attrful = XATTRBLOCK;
5171 /* remember buffer pos'n for later force_word */
5172 tboffset = s - PL_oldbufptr;
5173 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5174 if (strchr(tmpbuf, ':'))
5175 sv_setpv(PL_subname, tmpbuf);
5177 sv_setsv(PL_subname,PL_curstname);
5178 sv_catpvn(PL_subname,"::",2);
5179 sv_catpvn(PL_subname,tmpbuf,len);
5186 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5187 PL_expect = XTERMBLOCK;
5188 attrful = XATTRTERM;
5189 sv_setpv(PL_subname,"?");
5193 if (key == KEY_format) {
5195 PL_lex_formbrack = PL_lex_brackets + 1;
5197 (void) force_word(PL_oldbufptr + tboffset, WORD,
5202 /* Look for a prototype */
5206 s = scan_str(s,FALSE,FALSE);
5208 Perl_croak(aTHX_ "Prototype not terminated");
5209 /* strip spaces and check for bad characters */
5210 d = SvPVX(PL_lex_stuff);
5213 for (p = d; *p; ++p) {
5216 if (!strchr("$@%*;[]&\\", *p))
5221 if (bad_proto && ckWARN(WARN_SYNTAX))
5222 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5223 "Illegal character in prototype for %"SVf" : %s",
5225 SvCUR(PL_lex_stuff) = tmp;
5233 if (*s == ':' && s[1] != ':')
5234 PL_expect = attrful;
5235 else if (*s != '{' && key == KEY_sub) {
5237 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5239 Perl_croak(aTHX_ "Illegal declaration of subroutine %"SVf, PL_subname);
5243 PL_nextval[PL_nexttoke].opval =
5244 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5245 PL_lex_stuff = Nullsv;
5249 sv_setpv(PL_subname,
5250 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5253 (void) force_word(PL_oldbufptr + tboffset, WORD,
5262 LOP(OP_SYSTEM,XREF);
5265 LOP(OP_SYMLINK,XTERM);
5268 LOP(OP_SYSCALL,XTERM);
5271 LOP(OP_SYSOPEN,XTERM);
5274 LOP(OP_SYSSEEK,XTERM);
5277 LOP(OP_SYSREAD,XTERM);
5280 LOP(OP_SYSWRITE,XTERM);
5284 TERM(sublex_start());
5305 LOP(OP_TRUNCATE,XTERM);
5317 yylval.ival = CopLINE(PL_curcop);
5321 yylval.ival = CopLINE(PL_curcop);
5325 LOP(OP_UNLINK,XTERM);
5331 LOP(OP_UNPACK,XTERM);
5334 LOP(OP_UTIME,XTERM);
5340 LOP(OP_UNSHIFT,XTERM);
5343 if (PL_expect != XSTATE)
5344 yyerror("\"use\" not allowed in expression");
5346 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5347 s = force_version(s, TRUE);
5348 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5349 PL_nextval[PL_nexttoke].opval = Nullop;
5352 else if (*s == 'v') {
5353 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5354 s = force_version(s, FALSE);
5358 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5359 s = force_version(s, FALSE);
5371 yylval.ival = CopLINE(PL_curcop);
5375 PL_hints |= HINT_BLOCK_SCOPE;
5382 LOP(OP_WAITPID,XTERM);
5391 ctl_l[0] = toCTRL('L');
5393 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5396 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5401 if (PL_expect == XOPERATOR)
5407 yylval.ival = OP_XOR;
5412 TERM(sublex_start());
5417 #pragma segment Main
5421 S_pending_ident(pTHX)
5424 register I32 tmp = 0;
5425 /* pit holds the identifier we read and pending_ident is reset */
5426 char pit = PL_pending_ident;
5427 PL_pending_ident = 0;
5429 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5430 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5432 /* if we're in a my(), we can't allow dynamics here.
5433 $foo'bar has already been turned into $foo::bar, so
5434 just check for colons.
5436 if it's a legal name, the OP is a PADANY.
5439 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5440 if (strchr(PL_tokenbuf,':'))
5441 yyerror(Perl_form(aTHX_ "No package name allowed for "
5442 "variable %s in \"our\"",
5444 tmp = allocmy(PL_tokenbuf);
5447 if (strchr(PL_tokenbuf,':'))
5448 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5450 yylval.opval = newOP(OP_PADANY, 0);
5451 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5457 build the ops for accesses to a my() variable.
5459 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5460 then used in a comparison. This catches most, but not
5461 all cases. For instance, it catches
5462 sort { my($a); $a <=> $b }
5464 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5465 (although why you'd do that is anyone's guess).
5468 if (!strchr(PL_tokenbuf,':')) {
5470 tmp = pad_findmy(PL_tokenbuf);
5471 if (tmp != NOT_IN_PAD) {
5472 /* might be an "our" variable" */
5473 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5474 /* build ops for a bareword */
5475 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5476 sv_catpvn(sym, "::", 2);
5477 sv_catpv(sym, PL_tokenbuf+1);
5478 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5479 yylval.opval->op_private = OPpCONST_ENTERED;
5480 gv_fetchpv(SvPVX(sym),
5482 ? (GV_ADDMULTI | GV_ADDINEVAL)
5485 ((PL_tokenbuf[0] == '$') ? SVt_PV
5486 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5491 /* if it's a sort block and they're naming $a or $b */
5492 if (PL_last_lop_op == OP_SORT &&
5493 PL_tokenbuf[0] == '$' &&
5494 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5497 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5498 d < PL_bufend && *d != '\n';
5501 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5502 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5508 yylval.opval = newOP(OP_PADANY, 0);
5509 yylval.opval->op_targ = tmp;
5515 Whine if they've said @foo in a doublequoted string,
5516 and @foo isn't a variable we can find in the symbol
5519 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5520 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5521 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5522 && ckWARN(WARN_AMBIGUOUS))
5524 /* Downgraded from fatal to warning 20000522 mjd */
5525 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5526 "Possible unintended interpolation of %s in string",
5531 /* build ops for a bareword */
5532 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5533 yylval.opval->op_private = OPpCONST_ENTERED;
5534 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5535 ((PL_tokenbuf[0] == '$') ? SVt_PV
5536 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5542 Perl_keyword(pTHX_ register char *d, I32 len)
5547 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5548 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5549 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5550 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5551 if (strEQ(d,"__END__")) return KEY___END__;
5555 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5560 if (strEQ(d,"and")) return -KEY_and;
5561 if (strEQ(d,"abs")) return -KEY_abs;
5564 if (strEQ(d,"alarm")) return -KEY_alarm;
5565 if (strEQ(d,"atan2")) return -KEY_atan2;
5568 if (strEQ(d,"accept")) return -KEY_accept;
5573 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5576 if (strEQ(d,"bless")) return -KEY_bless;
5577 if (strEQ(d,"bind")) return -KEY_bind;
5578 if (strEQ(d,"binmode")) return -KEY_binmode;
5581 if (strEQ(d,"CORE")) return -KEY_CORE;
5582 if (strEQ(d,"CHECK")) return KEY_CHECK;
5587 if (strEQ(d,"cmp")) return -KEY_cmp;
5588 if (strEQ(d,"chr")) return -KEY_chr;
5589 if (strEQ(d,"cos")) return -KEY_cos;
5592 if (strEQ(d,"chop")) return -KEY_chop;
5595 if (strEQ(d,"close")) return -KEY_close;
5596 if (strEQ(d,"chdir")) return -KEY_chdir;
5597 if (strEQ(d,"chomp")) return -KEY_chomp;
5598 if (strEQ(d,"chmod")) return -KEY_chmod;
5599 if (strEQ(d,"chown")) return -KEY_chown;
5600 if (strEQ(d,"crypt")) return -KEY_crypt;
5603 if (strEQ(d,"chroot")) return -KEY_chroot;
5604 if (strEQ(d,"caller")) return -KEY_caller;
5607 if (strEQ(d,"connect")) return -KEY_connect;
5610 if (strEQ(d,"closedir")) return -KEY_closedir;
5611 if (strEQ(d,"continue")) return -KEY_continue;
5616 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5621 if (strEQ(d,"do")) return KEY_do;
5624 if (strEQ(d,"die")) return -KEY_die;
5627 if (strEQ(d,"dump")) return -KEY_dump;
5630 if (strEQ(d,"delete")) return KEY_delete;
5633 if (strEQ(d,"defined")) return KEY_defined;
5634 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5637 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5642 if (strEQ(d,"END")) return KEY_END;
5647 if (strEQ(d,"eq")) return -KEY_eq;
5650 if (strEQ(d,"eof")) return -KEY_eof;
5651 if (strEQ(d,"err")) return -KEY_err;
5652 if (strEQ(d,"exp")) return -KEY_exp;
5655 if (strEQ(d,"else")) return KEY_else;
5656 if (strEQ(d,"exit")) return -KEY_exit;
5657 if (strEQ(d,"eval")) return KEY_eval;
5658 if (strEQ(d,"exec")) return -KEY_exec;
5659 if (strEQ(d,"each")) return -KEY_each;
5662 if (strEQ(d,"elsif")) return KEY_elsif;
5665 if (strEQ(d,"exists")) return KEY_exists;
5666 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5667 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5668 "elseif should be elsif");
5671 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5672 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5675 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5678 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5679 if (strEQ(d,"endservent")) return -KEY_endservent;
5682 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5689 if (strEQ(d,"for")) return KEY_for;
5692 if (strEQ(d,"fork")) return -KEY_fork;
5695 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5696 if (strEQ(d,"flock")) return -KEY_flock;
5699 if (strEQ(d,"format")) return KEY_format;
5700 if (strEQ(d,"fileno")) return -KEY_fileno;
5703 if (strEQ(d,"foreach")) return KEY_foreach;
5706 if (strEQ(d,"formline")) return -KEY_formline;
5711 if (strnEQ(d,"get",3)) {
5716 if (strEQ(d,"ppid")) return -KEY_getppid;
5717 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5720 if (strEQ(d,"pwent")) return -KEY_getpwent;
5721 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5722 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5725 if (strEQ(d,"peername")) return -KEY_getpeername;
5726 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5727 if (strEQ(d,"priority")) return -KEY_getpriority;
5730 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5733 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5737 else if (*d == 'h') {
5738 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5739 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5740 if (strEQ(d,"hostent")) return -KEY_gethostent;
5742 else if (*d == 'n') {
5743 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5744 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5745 if (strEQ(d,"netent")) return -KEY_getnetent;
5747 else if (*d == 's') {
5748 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5749 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5750 if (strEQ(d,"servent")) return -KEY_getservent;
5751 if (strEQ(d,"sockname")) return -KEY_getsockname;
5752 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5754 else if (*d == 'g') {
5755 if (strEQ(d,"grent")) return -KEY_getgrent;
5756 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5757 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5759 else if (*d == 'l') {
5760 if (strEQ(d,"login")) return -KEY_getlogin;
5762 else if (strEQ(d,"c")) return -KEY_getc;
5767 if (strEQ(d,"gt")) return -KEY_gt;
5768 if (strEQ(d,"ge")) return -KEY_ge;
5771 if (strEQ(d,"grep")) return KEY_grep;
5772 if (strEQ(d,"goto")) return KEY_goto;
5773 if (strEQ(d,"glob")) return KEY_glob;
5776 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5781 if (strEQ(d,"hex")) return -KEY_hex;
5784 if (strEQ(d,"INIT")) return KEY_INIT;
5789 if (strEQ(d,"if")) return KEY_if;
5792 if (strEQ(d,"int")) return -KEY_int;
5795 if (strEQ(d,"index")) return -KEY_index;
5796 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5801 if (strEQ(d,"join")) return -KEY_join;
5805 if (strEQ(d,"keys")) return -KEY_keys;
5806 if (strEQ(d,"kill")) return -KEY_kill;
5812 if (strEQ(d,"lt")) return -KEY_lt;
5813 if (strEQ(d,"le")) return -KEY_le;
5814 if (strEQ(d,"lc")) return -KEY_lc;
5817 if (strEQ(d,"log")) return -KEY_log;
5820 if (strEQ(d,"last")) return KEY_last;
5821 if (strEQ(d,"link")) return -KEY_link;
5822 if (strEQ(d,"lock")) return -KEY_lock;
5825 if (strEQ(d,"local")) return KEY_local;
5826 if (strEQ(d,"lstat")) return -KEY_lstat;
5829 if (strEQ(d,"length")) return -KEY_length;
5830 if (strEQ(d,"listen")) return -KEY_listen;
5833 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5836 if (strEQ(d,"localtime")) return -KEY_localtime;
5842 case 1: return KEY_m;
5844 if (strEQ(d,"my")) return KEY_my;
5847 if (strEQ(d,"map")) return KEY_map;
5850 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5853 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5854 if (strEQ(d,"msgget")) return -KEY_msgget;
5855 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5856 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5861 if (strEQ(d,"next")) return KEY_next;
5862 if (strEQ(d,"ne")) return -KEY_ne;
5863 if (strEQ(d,"not")) return -KEY_not;
5864 if (strEQ(d,"no")) return KEY_no;
5869 if (strEQ(d,"or")) return -KEY_or;
5872 if (strEQ(d,"ord")) return -KEY_ord;
5873 if (strEQ(d,"oct")) return -KEY_oct;
5874 if (strEQ(d,"our")) return KEY_our;
5877 if (strEQ(d,"open")) return -KEY_open;
5880 if (strEQ(d,"opendir")) return -KEY_opendir;
5887 if (strEQ(d,"pop")) return -KEY_pop;
5888 if (strEQ(d,"pos")) return KEY_pos;
5891 if (strEQ(d,"push")) return -KEY_push;
5892 if (strEQ(d,"pack")) return -KEY_pack;
5893 if (strEQ(d,"pipe")) return -KEY_pipe;
5896 if (strEQ(d,"print")) return KEY_print;
5899 if (strEQ(d,"printf")) return KEY_printf;
5902 if (strEQ(d,"package")) return KEY_package;
5905 if (strEQ(d,"prototype")) return KEY_prototype;
5910 if (strEQ(d,"q")) return KEY_q;
5911 if (strEQ(d,"qr")) return KEY_qr;
5912 if (strEQ(d,"qq")) return KEY_qq;
5913 if (strEQ(d,"qw")) return KEY_qw;
5914 if (strEQ(d,"qx")) return KEY_qx;
5916 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5921 if (strEQ(d,"ref")) return -KEY_ref;
5924 if (strEQ(d,"read")) return -KEY_read;
5925 if (strEQ(d,"rand")) return -KEY_rand;
5926 if (strEQ(d,"recv")) return -KEY_recv;
5927 if (strEQ(d,"redo")) return KEY_redo;
5930 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5931 if (strEQ(d,"reset")) return -KEY_reset;
5934 if (strEQ(d,"return")) return KEY_return;
5935 if (strEQ(d,"rename")) return -KEY_rename;
5936 if (strEQ(d,"rindex")) return -KEY_rindex;
5939 if (strEQ(d,"require")) return KEY_require;
5940 if (strEQ(d,"reverse")) return -KEY_reverse;
5941 if (strEQ(d,"readdir")) return -KEY_readdir;
5944 if (strEQ(d,"readlink")) return -KEY_readlink;
5945 if (strEQ(d,"readline")) return -KEY_readline;
5946 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5949 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5955 case 0: return KEY_s;
5957 if (strEQ(d,"scalar")) return KEY_scalar;
5962 if (strEQ(d,"seek")) return -KEY_seek;
5963 if (strEQ(d,"send")) return -KEY_send;
5966 if (strEQ(d,"semop")) return -KEY_semop;
5969 if (strEQ(d,"select")) return -KEY_select;
5970 if (strEQ(d,"semctl")) return -KEY_semctl;
5971 if (strEQ(d,"semget")) return -KEY_semget;
5974 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5975 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5978 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5979 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5982 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5985 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5986 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5987 if (strEQ(d,"setservent")) return -KEY_setservent;
5990 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5991 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5998 if (strEQ(d,"shift")) return -KEY_shift;
6001 if (strEQ(d,"shmctl")) return -KEY_shmctl;
6002 if (strEQ(d,"shmget")) return -KEY_shmget;
6005 if (strEQ(d,"shmread")) return -KEY_shmread;
6008 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
6009 if (strEQ(d,"shutdown")) return -KEY_shutdown;
6014 if (strEQ(d,"sin")) return -KEY_sin;
6017 if (strEQ(d,"sleep")) return -KEY_sleep;
6020 if (strEQ(d,"sort")) return KEY_sort;
6021 if (strEQ(d,"socket")) return -KEY_socket;
6022 if (strEQ(d,"socketpair")) return -KEY_socketpair;
6025 if (strEQ(d,"split")) return KEY_split;
6026 if (strEQ(d,"sprintf")) return -KEY_sprintf;
6027 if (strEQ(d,"splice")) return -KEY_splice;
6030 if (strEQ(d,"sqrt")) return -KEY_sqrt;
6033 if (strEQ(d,"srand")) return -KEY_srand;
6036 if (strEQ(d,"stat")) return -KEY_stat;
6037 if (strEQ(d,"study")) return KEY_study;
6040 if (strEQ(d,"substr")) return -KEY_substr;
6041 if (strEQ(d,"sub")) return KEY_sub;
6046 if (strEQ(d,"system")) return -KEY_system;
6049 if (strEQ(d,"symlink")) return -KEY_symlink;
6050 if (strEQ(d,"syscall")) return -KEY_syscall;
6051 if (strEQ(d,"sysopen")) return -KEY_sysopen;
6052 if (strEQ(d,"sysread")) return -KEY_sysread;
6053 if (strEQ(d,"sysseek")) return -KEY_sysseek;
6056 if (strEQ(d,"syswrite")) return -KEY_syswrite;
6065 if (strEQ(d,"tr")) return KEY_tr;
6068 if (strEQ(d,"tie")) return KEY_tie;
6071 if (strEQ(d,"tell")) return -KEY_tell;
6072 if (strEQ(d,"tied")) return KEY_tied;
6073 if (strEQ(d,"time")) return -KEY_time;
6076 if (strEQ(d,"times")) return -KEY_times;
6079 if (strEQ(d,"telldir")) return -KEY_telldir;
6082 if (strEQ(d,"truncate")) return -KEY_truncate;
6089 if (strEQ(d,"uc")) return -KEY_uc;
6092 if (strEQ(d,"use")) return KEY_use;
6095 if (strEQ(d,"undef")) return KEY_undef;
6096 if (strEQ(d,"until")) return KEY_until;
6097 if (strEQ(d,"untie")) return KEY_untie;
6098 if (strEQ(d,"utime")) return -KEY_utime;
6099 if (strEQ(d,"umask")) return -KEY_umask;
6102 if (strEQ(d,"unless")) return KEY_unless;
6103 if (strEQ(d,"unpack")) return -KEY_unpack;
6104 if (strEQ(d,"unlink")) return -KEY_unlink;
6107 if (strEQ(d,"unshift")) return -KEY_unshift;
6108 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
6113 if (strEQ(d,"values")) return -KEY_values;
6114 if (strEQ(d,"vec")) return -KEY_vec;
6119 if (strEQ(d,"warn")) return -KEY_warn;
6120 if (strEQ(d,"wait")) return -KEY_wait;
6123 if (strEQ(d,"while")) return KEY_while;
6124 if (strEQ(d,"write")) return -KEY_write;
6127 if (strEQ(d,"waitpid")) return -KEY_waitpid;
6130 if (strEQ(d,"wantarray")) return -KEY_wantarray;
6135 if (len == 1) return -KEY_x;
6136 if (strEQ(d,"xor")) return -KEY_xor;
6139 if (len == 1) return KEY_y;
6148 S_checkcomma(pTHX_ register char *s, char *name, char *what)
6152 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
6153 if (ckWARN(WARN_SYNTAX)) {
6155 for (w = s+2; *w && level; w++) {
6162 for (; *w && isSPACE(*w); w++) ;
6163 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6164 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6165 "%s (...) interpreted as function",name);
6168 while (s < PL_bufend && isSPACE(*s))
6172 while (s < PL_bufend && isSPACE(*s))
6174 if (isIDFIRST_lazy_if(s,UTF)) {
6176 while (isALNUM_lazy_if(s,UTF))
6178 while (s < PL_bufend && isSPACE(*s))
6183 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6187 Perl_croak(aTHX_ "No comma allowed after %s", what);
6192 /* Either returns sv, or mortalizes sv and returns a new SV*.
6193 Best used as sv=new_constant(..., sv, ...).
6194 If s, pv are NULL, calls subroutine with one argument,
6195 and type is used with error messages only. */
6198 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6202 HV *table = GvHV(PL_hintgv); /* ^H */
6206 const char *why1, *why2, *why3;
6208 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6211 why2 = strEQ(key,"charnames")
6212 ? "(possibly a missing \"use charnames ...\")"
6214 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6215 (type ? type: "undef"), why2);
6217 /* This is convoluted and evil ("goto considered harmful")
6218 * but I do not understand the intricacies of all the different
6219 * failure modes of %^H in here. The goal here is to make
6220 * the most probable error message user-friendly. --jhi */
6225 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6226 (type ? type: "undef"), why1, why2, why3);
6228 yyerror(SvPVX(msg));
6232 cvp = hv_fetch(table, key, strlen(key), FALSE);
6233 if (!cvp || !SvOK(*cvp)) {
6236 why3 = "} is not defined";
6239 sv_2mortal(sv); /* Parent created it permanently */
6242 pv = sv_2mortal(newSVpvn(s, len));
6244 typesv = sv_2mortal(newSVpv(type, 0));
6246 typesv = &PL_sv_undef;
6248 PUSHSTACKi(PERLSI_OVERLOAD);
6260 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6264 /* Check the eval first */
6265 if (!PL_in_eval && SvTRUE(ERRSV)) {
6267 sv_catpv(ERRSV, "Propagated");
6268 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6270 res = SvREFCNT_inc(sv);
6274 (void)SvREFCNT_inc(res);
6283 why1 = "Call to &{$^H{";
6285 why3 = "}} did not return a defined value";
6294 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6296 register char *d = dest;
6297 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6300 Perl_croak(aTHX_ ident_too_long);
6301 if (isALNUM(*s)) /* UTF handled below */
6303 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6308 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6312 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6313 char *t = s + UTF8SKIP(s);
6314 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6316 if (d + (t - s) > e)
6317 Perl_croak(aTHX_ ident_too_long);
6318 Copy(s, d, t - s, char);
6331 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6341 e = d + destlen - 3; /* two-character token, ending NUL */
6343 while (isDIGIT(*s)) {
6345 Perl_croak(aTHX_ ident_too_long);
6352 Perl_croak(aTHX_ ident_too_long);
6353 if (isALNUM(*s)) /* UTF handled below */
6355 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6360 else if (*s == ':' && s[1] == ':') {
6364 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6365 char *t = s + UTF8SKIP(s);
6366 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6368 if (d + (t - s) > e)
6369 Perl_croak(aTHX_ ident_too_long);
6370 Copy(s, d, t - s, char);
6381 if (PL_lex_state != LEX_NORMAL)
6382 PL_lex_state = LEX_INTERPENDMAYBE;
6385 if (*s == '$' && s[1] &&
6386 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6399 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6404 if (isSPACE(s[-1])) {
6407 if (!SPACE_OR_TAB(ch)) {
6413 if (isIDFIRST_lazy_if(d,UTF)) {
6417 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6419 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6422 Copy(s, d, e - s, char);
6427 while ((isALNUM(*s) || *s == ':') && d < e)
6430 Perl_croak(aTHX_ ident_too_long);
6433 while (s < send && SPACE_OR_TAB(*s)) s++;
6434 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6435 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6436 const char *brack = *s == '[' ? "[...]" : "{...}";
6437 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6438 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6439 funny, dest, brack, funny, dest, brack);
6442 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6446 /* Handle extended ${^Foo} variables
6447 * 1999-02-27 mjd-perl-patch@plover.com */
6448 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6452 while (isALNUM(*s) && d < e) {
6456 Perl_croak(aTHX_ ident_too_long);
6461 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6462 PL_lex_state = LEX_INTERPEND;
6467 if (PL_lex_state == LEX_NORMAL) {
6468 if (ckWARN(WARN_AMBIGUOUS) &&
6469 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6471 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6472 "Ambiguous use of %c{%s} resolved to %c%s",
6473 funny, dest, funny, dest);
6478 s = bracket; /* let the parser handle it */
6482 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6483 PL_lex_state = LEX_INTERPEND;
6488 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6493 *pmfl |= PMf_GLOBAL;
6495 *pmfl |= PMf_CONTINUE;
6499 *pmfl |= PMf_MULTILINE;
6501 *pmfl |= PMf_SINGLELINE;
6503 *pmfl |= PMf_EXTENDED;
6507 S_scan_pat(pTHX_ char *start, I32 type)
6512 s = scan_str(start,FALSE,FALSE);
6514 Perl_croak(aTHX_ "Search pattern not terminated");
6516 pm = (PMOP*)newPMOP(type, 0);
6517 if (PL_multi_open == '?')
6518 pm->op_pmflags |= PMf_ONCE;
6520 while (*s && strchr("iomsx", *s))
6521 pmflag(&pm->op_pmflags,*s++);
6524 while (*s && strchr("iogcmsx", *s))
6525 pmflag(&pm->op_pmflags,*s++);
6527 /* issue a warning if /c is specified,but /g is not */
6528 if (ckWARN(WARN_REGEXP) &&
6529 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6531 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6534 pm->op_pmpermflags = pm->op_pmflags;
6536 PL_lex_op = (OP*)pm;
6537 yylval.ival = OP_MATCH;
6542 S_scan_subst(pTHX_ char *start)
6549 yylval.ival = OP_NULL;
6551 s = scan_str(start,FALSE,FALSE);
6554 Perl_croak(aTHX_ "Substitution pattern not terminated");
6556 if (s[-1] == PL_multi_open)
6559 first_start = PL_multi_start;
6560 s = scan_str(s,FALSE,FALSE);
6563 SvREFCNT_dec(PL_lex_stuff);
6564 PL_lex_stuff = Nullsv;
6566 Perl_croak(aTHX_ "Substitution replacement not terminated");
6568 PL_multi_start = first_start; /* so whole substitution is taken together */
6570 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6576 else if (strchr("iogcmsx", *s))
6577 pmflag(&pm->op_pmflags,*s++);
6582 /* /c is not meaningful with s/// */
6583 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6585 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6590 PL_sublex_info.super_bufptr = s;
6591 PL_sublex_info.super_bufend = PL_bufend;
6593 pm->op_pmflags |= PMf_EVAL;
6594 repl = newSVpvn("",0);
6596 sv_catpv(repl, es ? "eval " : "do ");
6597 sv_catpvn(repl, "{ ", 2);
6598 sv_catsv(repl, PL_lex_repl);
6599 sv_catpvn(repl, " };", 2);
6601 SvREFCNT_dec(PL_lex_repl);
6605 pm->op_pmpermflags = pm->op_pmflags;
6606 PL_lex_op = (OP*)pm;
6607 yylval.ival = OP_SUBST;
6612 S_scan_trans(pTHX_ char *start)
6621 yylval.ival = OP_NULL;
6623 s = scan_str(start,FALSE,FALSE);
6625 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6626 if (s[-1] == PL_multi_open)
6629 s = scan_str(s,FALSE,FALSE);
6632 SvREFCNT_dec(PL_lex_stuff);
6633 PL_lex_stuff = Nullsv;
6635 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6638 complement = del = squash = 0;
6639 while (strchr("cds", *s)) {
6641 complement = OPpTRANS_COMPLEMENT;
6643 del = OPpTRANS_DELETE;
6645 squash = OPpTRANS_SQUASH;
6649 New(803, tbl, complement&&!del?258:256, short);
6650 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6651 o->op_private &= ~OPpTRANS_ALL;
6652 o->op_private |= del|squash|complement|
6653 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6654 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6657 yylval.ival = OP_TRANS;
6662 S_scan_heredoc(pTHX_ register char *s)
6665 I32 op_type = OP_SCALAR;
6672 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6676 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6679 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6680 if (*peek && strchr("`'\"",*peek)) {
6683 s = delimcpy(d, e, s, PL_bufend, term, &len);
6693 if (!isALNUM_lazy_if(s,UTF))
6694 deprecate_old("bare << to mean <<\"\"");
6695 for (; isALNUM_lazy_if(s,UTF); s++) {
6700 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6701 Perl_croak(aTHX_ "Delimiter for here document is too long");
6704 len = d - PL_tokenbuf;
6705 #ifndef PERL_STRICT_CR
6706 d = strchr(s, '\r');
6710 while (s < PL_bufend) {
6716 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6725 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6730 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6731 herewas = newSVpvn(s,PL_bufend-s);
6733 s--, herewas = newSVpvn(s,d-s);
6734 s += SvCUR(herewas);
6736 tmpstr = NEWSV(87,79);
6737 sv_upgrade(tmpstr, SVt_PVIV);
6742 else if (term == '`') {
6743 op_type = OP_BACKTICK;
6744 SvIVX(tmpstr) = '\\';
6748 PL_multi_start = CopLINE(PL_curcop);
6749 PL_multi_open = PL_multi_close = '<';
6750 term = *PL_tokenbuf;
6751 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6752 char *bufptr = PL_sublex_info.super_bufptr;
6753 char *bufend = PL_sublex_info.super_bufend;
6754 char *olds = s - SvCUR(herewas);
6755 s = strchr(bufptr, '\n');
6759 while (s < bufend &&
6760 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6762 CopLINE_inc(PL_curcop);
6765 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6766 missingterm(PL_tokenbuf);
6768 sv_setpvn(herewas,bufptr,d-bufptr+1);
6769 sv_setpvn(tmpstr,d+1,s-d);
6771 sv_catpvn(herewas,s,bufend-s);
6772 Copy(SvPVX(herewas),bufptr,SvCUR(herewas) + 1,char);
6779 while (s < PL_bufend &&
6780 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6782 CopLINE_inc(PL_curcop);
6784 if (s >= PL_bufend) {
6785 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6786 missingterm(PL_tokenbuf);
6788 sv_setpvn(tmpstr,d+1,s-d);
6790 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6792 sv_catpvn(herewas,s,PL_bufend-s);
6793 sv_setsv(PL_linestr,herewas);
6794 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6795 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6796 PL_last_lop = PL_last_uni = Nullch;
6799 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6800 while (s >= PL_bufend) { /* multiple line string? */
6802 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6803 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6804 missingterm(PL_tokenbuf);
6806 CopLINE_inc(PL_curcop);
6807 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6808 PL_last_lop = PL_last_uni = Nullch;
6809 #ifndef PERL_STRICT_CR
6810 if (PL_bufend - PL_linestart >= 2) {
6811 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6812 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6814 PL_bufend[-2] = '\n';
6816 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6818 else if (PL_bufend[-1] == '\r')
6819 PL_bufend[-1] = '\n';
6821 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6822 PL_bufend[-1] = '\n';
6824 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6825 SV *sv = NEWSV(88,0);
6827 sv_upgrade(sv, SVt_PVMG);
6828 sv_setsv(sv,PL_linestr);
6831 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6833 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6836 sv_catsv(PL_linestr,herewas);
6837 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6841 sv_catsv(tmpstr,PL_linestr);
6846 PL_multi_end = CopLINE(PL_curcop);
6847 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6848 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6849 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6851 SvREFCNT_dec(herewas);
6853 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6855 else if (PL_encoding)
6856 sv_recode_to_utf8(tmpstr, PL_encoding);
6858 PL_lex_stuff = tmpstr;
6859 yylval.ival = op_type;
6864 takes: current position in input buffer
6865 returns: new position in input buffer
6866 side-effects: yylval and lex_op are set.
6871 <FH> read from filehandle
6872 <pkg::FH> read from package qualified filehandle
6873 <pkg'FH> read from package qualified filehandle
6874 <$fh> read from filehandle in $fh
6880 S_scan_inputsymbol(pTHX_ char *start)
6882 register char *s = start; /* current position in buffer */
6888 d = PL_tokenbuf; /* start of temp holding space */
6889 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6890 end = strchr(s, '\n');
6893 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6895 /* die if we didn't have space for the contents of the <>,
6896 or if it didn't end, or if we see a newline
6899 if (len >= sizeof PL_tokenbuf)
6900 Perl_croak(aTHX_ "Excessively long <> operator");
6902 Perl_croak(aTHX_ "Unterminated <> operator");
6907 Remember, only scalar variables are interpreted as filehandles by
6908 this code. Anything more complex (e.g., <$fh{$num}>) will be
6909 treated as a glob() call.
6910 This code makes use of the fact that except for the $ at the front,
6911 a scalar variable and a filehandle look the same.
6913 if (*d == '$' && d[1]) d++;
6915 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6916 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6919 /* If we've tried to read what we allow filehandles to look like, and
6920 there's still text left, then it must be a glob() and not a getline.
6921 Use scan_str to pull out the stuff between the <> and treat it
6922 as nothing more than a string.
6925 if (d - PL_tokenbuf != len) {
6926 yylval.ival = OP_GLOB;
6928 s = scan_str(start,FALSE,FALSE);
6930 Perl_croak(aTHX_ "Glob not terminated");
6934 bool readline_overriden = FALSE;
6935 GV *gv_readline = Nullgv;
6937 /* we're in a filehandle read situation */
6940 /* turn <> into <ARGV> */
6942 Copy("ARGV",d,5,char);
6944 /* Check whether readline() is overriden */
6945 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6946 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6948 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6949 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6950 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6951 readline_overriden = TRUE;
6953 /* if <$fh>, create the ops to turn the variable into a
6959 /* try to find it in the pad for this block, otherwise find
6960 add symbol table ops
6962 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6963 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6964 SV *sym = sv_2mortal(
6965 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6966 sv_catpvn(sym, "::", 2);
6972 OP *o = newOP(OP_PADSV, 0);
6974 PL_lex_op = readline_overriden
6975 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6976 append_elem(OP_LIST, o,
6977 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6978 : (OP*)newUNOP(OP_READLINE, 0, o);
6987 ? (GV_ADDMULTI | GV_ADDINEVAL)
6990 PL_lex_op = readline_overriden
6991 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6992 append_elem(OP_LIST,
6993 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6994 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6995 : (OP*)newUNOP(OP_READLINE, 0,
6996 newUNOP(OP_RV2SV, 0,
6997 newGVOP(OP_GV, 0, gv)));
6999 if (!readline_overriden)
7000 PL_lex_op->op_flags |= OPf_SPECIAL;
7001 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
7002 yylval.ival = OP_NULL;
7005 /* If it's none of the above, it must be a literal filehandle
7006 (<Foo::BAR> or <FOO>) so build a simple readline OP */
7008 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
7009 PL_lex_op = readline_overriden
7010 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
7011 append_elem(OP_LIST,
7012 newGVOP(OP_GV, 0, gv),
7013 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
7014 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
7015 yylval.ival = OP_NULL;
7024 takes: start position in buffer
7025 keep_quoted preserve \ on the embedded delimiter(s)
7026 keep_delims preserve the delimiters around the string
7027 returns: position to continue reading from buffer
7028 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
7029 updates the read buffer.
7031 This subroutine pulls a string out of the input. It is called for:
7032 q single quotes q(literal text)
7033 ' single quotes 'literal text'
7034 qq double quotes qq(interpolate $here please)
7035 " double quotes "interpolate $here please"
7036 qx backticks qx(/bin/ls -l)
7037 ` backticks `/bin/ls -l`
7038 qw quote words @EXPORT_OK = qw( func() $spam )
7039 m// regexp match m/this/
7040 s/// regexp substitute s/this/that/
7041 tr/// string transliterate tr/this/that/
7042 y/// string transliterate y/this/that/
7043 ($*@) sub prototypes sub foo ($)
7044 (stuff) sub attr parameters sub foo : attr(stuff)
7045 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
7047 In most of these cases (all but <>, patterns and transliterate)
7048 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
7049 calls scan_str(). s/// makes yylex() call scan_subst() which calls
7050 scan_str(). tr/// and y/// make yylex() call scan_trans() which
7053 It skips whitespace before the string starts, and treats the first
7054 character as the delimiter. If the delimiter is one of ([{< then
7055 the corresponding "close" character )]}> is used as the closing
7056 delimiter. It allows quoting of delimiters, and if the string has
7057 balanced delimiters ([{<>}]) it allows nesting.
7059 On success, the SV with the resulting string is put into lex_stuff or,
7060 if that is already non-NULL, into lex_repl. The second case occurs only
7061 when parsing the RHS of the special constructs s/// and tr/// (y///).
7062 For convenience, the terminating delimiter character is stuffed into
7067 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
7069 SV *sv; /* scalar value: string */
7070 char *tmps; /* temp string, used for delimiter matching */
7071 register char *s = start; /* current position in the buffer */
7072 register char term; /* terminating character */
7073 register char *to; /* current position in the sv's data */
7074 I32 brackets = 1; /* bracket nesting level */
7075 bool has_utf8 = FALSE; /* is there any utf8 content? */
7076 I32 termcode; /* terminating char. code */
7077 U8 termstr[UTF8_MAXLEN]; /* terminating string */
7078 STRLEN termlen; /* length of terminating string */
7079 char *last = NULL; /* last position for nesting bracket */
7081 /* skip space before the delimiter */
7085 /* mark where we are, in case we need to report errors */
7088 /* after skipping whitespace, the next character is the terminator */
7091 termcode = termstr[0] = term;
7095 termcode = utf8_to_uvchr((U8*)s, &termlen);
7096 Copy(s, termstr, termlen, U8);
7097 if (!UTF8_IS_INVARIANT(term))
7101 /* mark where we are */
7102 PL_multi_start = CopLINE(PL_curcop);
7103 PL_multi_open = term;
7105 /* find corresponding closing delimiter */
7106 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
7107 termcode = termstr[0] = term = tmps[5];
7109 PL_multi_close = term;
7111 /* create a new SV to hold the contents. 87 is leak category, I'm
7112 assuming. 79 is the SV's initial length. What a random number. */
7114 sv_upgrade(sv, SVt_PVIV);
7115 SvIVX(sv) = termcode;
7116 (void)SvPOK_only(sv); /* validate pointer */
7118 /* move past delimiter and try to read a complete string */
7120 sv_catpvn(sv, s, termlen);
7123 if (PL_encoding && !UTF) {
7127 int offset = s - SvPVX(PL_linestr);
7128 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
7129 &offset, (char*)termstr, termlen);
7130 char *ns = SvPVX(PL_linestr) + offset;
7131 char *svlast = SvEND(sv) - 1;
7133 for (; s < ns; s++) {
7134 if (*s == '\n' && !PL_rsfp)
7135 CopLINE_inc(PL_curcop);
7138 goto read_more_line;
7140 /* handle quoted delimiters */
7141 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
7143 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
7145 if ((svlast-1 - t) % 2) {
7149 SvCUR_set(sv, SvCUR(sv) - 1);
7154 if (PL_multi_open == PL_multi_close) {
7161 for (w = t = last; t < svlast; w++, t++) {
7162 /* At here, all closes are "was quoted" one,
7163 so we don't check PL_multi_close. */
7165 if (!keep_quoted && *(t+1) == PL_multi_open)
7170 else if (*t == PL_multi_open)
7178 SvCUR_set(sv, w - SvPVX(sv));
7181 if (--brackets <= 0)
7187 SvCUR_set(sv, SvCUR(sv) - 1);
7193 /* extend sv if need be */
7194 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7195 /* set 'to' to the next character in the sv's string */
7196 to = SvPVX(sv)+SvCUR(sv);
7198 /* if open delimiter is the close delimiter read unbridle */
7199 if (PL_multi_open == PL_multi_close) {
7200 for (; s < PL_bufend; s++,to++) {
7201 /* embedded newlines increment the current line number */
7202 if (*s == '\n' && !PL_rsfp)
7203 CopLINE_inc(PL_curcop);
7204 /* handle quoted delimiters */
7205 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7206 if (!keep_quoted && s[1] == term)
7208 /* any other quotes are simply copied straight through */
7212 /* terminate when run out of buffer (the for() condition), or
7213 have found the terminator */
7214 else if (*s == term) {
7217 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7220 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7226 /* if the terminator isn't the same as the start character (e.g.,
7227 matched brackets), we have to allow more in the quoting, and
7228 be prepared for nested brackets.
7231 /* read until we run out of string, or we find the terminator */
7232 for (; s < PL_bufend; s++,to++) {
7233 /* embedded newlines increment the line count */
7234 if (*s == '\n' && !PL_rsfp)
7235 CopLINE_inc(PL_curcop);
7236 /* backslashes can escape the open or closing characters */
7237 if (*s == '\\' && s+1 < PL_bufend) {
7239 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7244 /* allow nested opens and closes */
7245 else if (*s == PL_multi_close && --brackets <= 0)
7247 else if (*s == PL_multi_open)
7249 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7254 /* terminate the copied string and update the sv's end-of-string */
7256 SvCUR_set(sv, to - SvPVX(sv));
7259 * this next chunk reads more into the buffer if we're not done yet
7263 break; /* handle case where we are done yet :-) */
7265 #ifndef PERL_STRICT_CR
7266 if (to - SvPVX(sv) >= 2) {
7267 if ((to[-2] == '\r' && to[-1] == '\n') ||
7268 (to[-2] == '\n' && to[-1] == '\r'))
7272 SvCUR_set(sv, to - SvPVX(sv));
7274 else if (to[-1] == '\r')
7277 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7282 /* if we're out of file, or a read fails, bail and reset the current
7283 line marker so we can report where the unterminated string began
7286 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7288 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7291 /* we read a line, so increment our line counter */
7292 CopLINE_inc(PL_curcop);
7294 /* update debugger info */
7295 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7296 SV *sv = NEWSV(88,0);
7298 sv_upgrade(sv, SVt_PVMG);
7299 sv_setsv(sv,PL_linestr);
7302 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7305 /* having changed the buffer, we must update PL_bufend */
7306 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7307 PL_last_lop = PL_last_uni = Nullch;
7310 /* at this point, we have successfully read the delimited string */
7312 if (!PL_encoding || UTF) {
7314 sv_catpvn(sv, s, termlen);
7317 if (has_utf8 || PL_encoding)
7320 PL_multi_end = CopLINE(PL_curcop);
7322 /* if we allocated too much space, give some back */
7323 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7324 SvLEN_set(sv, SvCUR(sv) + 1);
7325 Renew(SvPVX(sv), SvLEN(sv), char);
7328 /* decide whether this is the first or second quoted string we've read
7341 takes: pointer to position in buffer
7342 returns: pointer to new position in buffer
7343 side-effects: builds ops for the constant in yylval.op
7345 Read a number in any of the formats that Perl accepts:
7347 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7348 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7351 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7353 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7356 If it reads a number without a decimal point or an exponent, it will
7357 try converting the number to an integer and see if it can do so
7358 without loss of precision.
7362 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7364 register char *s = start; /* current position in buffer */
7365 register char *d; /* destination in temp buffer */
7366 register char *e; /* end of temp buffer */
7367 NV nv; /* number read, as a double */
7368 SV *sv = Nullsv; /* place to put the converted number */
7369 bool floatit; /* boolean: int or float? */
7370 char *lastub = 0; /* position of last underbar */
7371 static char number_too_long[] = "Number too long";
7373 /* We use the first character to decide what type of number this is */
7377 Perl_croak(aTHX_ "panic: scan_num");
7379 /* if it starts with a 0, it could be an octal number, a decimal in
7380 0.13 disguise, or a hexadecimal number, or a binary number. */
7384 u holds the "number so far"
7385 shift the power of 2 of the base
7386 (hex == 4, octal == 3, binary == 1)
7387 overflowed was the number more than we can hold?
7389 Shift is used when we add a digit. It also serves as an "are
7390 we in octal/hex/binary?" indicator to disallow hex characters
7396 bool overflowed = FALSE;
7397 bool just_zero = TRUE; /* just plain 0 or binary number? */
7398 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7399 static char* bases[5] = { "", "binary", "", "octal",
7401 static char* Bases[5] = { "", "Binary", "", "Octal",
7403 static char *maxima[5] = { "",
7404 "0b11111111111111111111111111111111",
7408 char *base, *Base, *max;
7415 } else if (s[1] == 'b') {
7420 /* check for a decimal in disguise */
7421 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7423 /* so it must be octal */
7430 if (ckWARN(WARN_SYNTAX))
7431 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7432 "Misplaced _ in number");
7436 base = bases[shift];
7437 Base = Bases[shift];
7438 max = maxima[shift];
7440 /* read the rest of the number */
7442 /* x is used in the overflow test,
7443 b is the digit we're adding on. */
7448 /* if we don't mention it, we're done */
7452 /* _ are ignored -- but warned about if consecutive */
7454 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7455 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7456 "Misplaced _ in number");
7460 /* 8 and 9 are not octal */
7463 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7467 case '2': case '3': case '4':
7468 case '5': case '6': case '7':
7470 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7474 b = *s++ & 15; /* ASCII digit -> value of digit */
7478 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7479 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7480 /* make sure they said 0x */
7485 /* Prepare to put the digit we have onto the end
7486 of the number so far. We check for overflows.
7492 x = u << shift; /* make room for the digit */
7494 if ((x >> shift) != u
7495 && !(PL_hints & HINT_NEW_BINARY)) {
7498 if (ckWARN_d(WARN_OVERFLOW))
7499 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7500 "Integer overflow in %s number",
7503 u = x | b; /* add the digit to the end */
7506 n *= nvshift[shift];
7507 /* If an NV has not enough bits in its
7508 * mantissa to represent an UV this summing of
7509 * small low-order numbers is a waste of time
7510 * (because the NV cannot preserve the
7511 * low-order bits anyway): we could just
7512 * remember when did we overflow and in the
7513 * end just multiply n by the right
7521 /* if we get here, we had success: make a scalar value from
7526 /* final misplaced underbar check */
7528 if (ckWARN(WARN_SYNTAX))
7529 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7534 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7535 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7536 "%s number > %s non-portable",
7542 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7543 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7544 "%s number > %s non-portable",
7549 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7550 sv = new_constant(start, s - start, "integer",
7552 else if (PL_hints & HINT_NEW_BINARY)
7553 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7558 handle decimal numbers.
7559 we're also sent here when we read a 0 as the first digit
7561 case '1': case '2': case '3': case '4': case '5':
7562 case '6': case '7': case '8': case '9': case '.':
7565 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7568 /* read next group of digits and _ and copy into d */
7569 while (isDIGIT(*s) || *s == '_') {
7570 /* skip underscores, checking for misplaced ones
7574 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7575 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7576 "Misplaced _ in number");
7580 /* check for end of fixed-length buffer */
7582 Perl_croak(aTHX_ number_too_long);
7583 /* if we're ok, copy the character */
7588 /* final misplaced underbar check */
7589 if (lastub && s == lastub + 1) {
7590 if (ckWARN(WARN_SYNTAX))
7591 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7594 /* read a decimal portion if there is one. avoid
7595 3..5 being interpreted as the number 3. followed
7598 if (*s == '.' && s[1] != '.') {
7603 if (ckWARN(WARN_SYNTAX))
7604 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7605 "Misplaced _ in number");
7609 /* copy, ignoring underbars, until we run out of digits.
7611 for (; isDIGIT(*s) || *s == '_'; s++) {
7612 /* fixed length buffer check */
7614 Perl_croak(aTHX_ number_too_long);
7616 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7617 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7618 "Misplaced _ in number");
7624 /* fractional part ending in underbar? */
7626 if (ckWARN(WARN_SYNTAX))
7627 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7628 "Misplaced _ in number");
7630 if (*s == '.' && isDIGIT(s[1])) {
7631 /* oops, it's really a v-string, but without the "v" */
7637 /* read exponent part, if present */
7638 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7642 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7643 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7645 /* stray preinitial _ */
7647 if (ckWARN(WARN_SYNTAX))
7648 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7649 "Misplaced _ in number");
7653 /* allow positive or negative exponent */
7654 if (*s == '+' || *s == '-')
7657 /* stray initial _ */
7659 if (ckWARN(WARN_SYNTAX))
7660 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7661 "Misplaced _ in number");
7665 /* read digits of exponent */
7666 while (isDIGIT(*s) || *s == '_') {
7669 Perl_croak(aTHX_ number_too_long);
7673 if (ckWARN(WARN_SYNTAX) &&
7674 ((lastub && s == lastub + 1) ||
7675 (!isDIGIT(s[1]) && s[1] != '_')))
7676 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7677 "Misplaced _ in number");
7684 /* make an sv from the string */
7688 We try to do an integer conversion first if no characters
7689 indicating "float" have been found.
7694 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7696 if (flags == IS_NUMBER_IN_UV) {
7698 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7701 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7702 if (uv <= (UV) IV_MIN)
7703 sv_setiv(sv, -(IV)uv);
7710 /* terminate the string */
7712 nv = Atof(PL_tokenbuf);
7716 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7717 (PL_hints & HINT_NEW_INTEGER) )
7718 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7719 (floatit ? "float" : "integer"),
7723 /* if it starts with a v, it could be a v-string */
7726 sv = NEWSV(92,5); /* preallocate storage space */
7727 s = scan_vstring(s,sv);
7731 /* make the op for the constant and return */
7734 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7736 lvalp->opval = Nullop;
7742 S_scan_formline(pTHX_ register char *s)
7746 SV *stuff = newSVpvn("",0);
7747 bool needargs = FALSE;
7753 #ifdef PERL_STRICT_CR
7754 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7756 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7758 if (*t == '\n' || t == PL_bufend) {
7763 if (PL_in_eval && !PL_rsfp) {
7764 eol = memchr(s,'\n',PL_bufend-s);
7769 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7771 for (t = s; t < eol; t++) {
7772 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7774 goto enough; /* ~~ must be first line in formline */
7776 if (*t == '@' || *t == '^')
7780 sv_catpvn(stuff, s, eol-s);
7781 #ifndef PERL_STRICT_CR
7782 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7783 char *end = SvPVX(stuff) + SvCUR(stuff);
7795 s = filter_gets(PL_linestr, PL_rsfp, 0);
7796 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7797 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7798 PL_last_lop = PL_last_uni = Nullch;
7810 PL_lex_state = LEX_NORMAL;
7811 PL_nextval[PL_nexttoke].ival = 0;
7815 PL_lex_state = LEX_FORMLINE;
7817 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7819 else if (PL_encoding)
7820 sv_recode_to_utf8(stuff, PL_encoding);
7822 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7824 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7828 SvREFCNT_dec(stuff);
7830 PL_lex_formbrack = 0;
7841 PL_cshlen = strlen(PL_cshname);
7846 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7848 I32 oldsavestack_ix = PL_savestack_ix;
7849 CV* outsidecv = PL_compcv;
7852 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7854 SAVEI32(PL_subline);
7855 save_item(PL_subname);
7856 SAVESPTR(PL_compcv);
7858 PL_compcv = (CV*)NEWSV(1104,0);
7859 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7860 CvFLAGS(PL_compcv) |= flags;
7862 PL_subline = CopLINE(PL_curcop);
7863 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7864 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7865 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7867 return oldsavestack_ix;
7871 #pragma segment Perl_yylex
7874 Perl_yywarn(pTHX_ char *s)
7876 PL_in_eval |= EVAL_WARNONLY;
7878 PL_in_eval &= ~EVAL_WARNONLY;
7883 Perl_yyerror(pTHX_ char *s)
7886 char *context = NULL;
7890 if (!yychar || (yychar == ';' && !PL_rsfp))
7892 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7893 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7896 The code below is removed for NetWare because it abends/crashes on NetWare
7897 when the script has error such as not having the closing quotes like:
7899 Checking of white spaces is anyway done in NetWare code.
7902 while (isSPACE(*PL_oldoldbufptr))
7905 context = PL_oldoldbufptr;
7906 contlen = PL_bufptr - PL_oldoldbufptr;
7908 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7909 PL_oldbufptr != PL_bufptr) {
7912 The code below is removed for NetWare because it abends/crashes on NetWare
7913 when the script has error such as not having the closing quotes like:
7915 Checking of white spaces is anyway done in NetWare code.
7918 while (isSPACE(*PL_oldbufptr))
7921 context = PL_oldbufptr;
7922 contlen = PL_bufptr - PL_oldbufptr;
7924 else if (yychar > 255)
7925 where = "next token ???";
7926 else if (yychar == -2) { /* YYEMPTY */
7927 if (PL_lex_state == LEX_NORMAL ||
7928 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7929 where = "at end of line";
7930 else if (PL_lex_inpat)
7931 where = "within pattern";
7933 where = "within string";
7936 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7938 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7939 else if (isPRINT_LC(yychar))
7940 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7942 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7943 where = SvPVX(where_sv);
7945 msg = sv_2mortal(newSVpv(s, 0));
7946 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7947 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7949 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7951 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7952 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7953 Perl_sv_catpvf(aTHX_ msg,
7954 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7955 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7958 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7959 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7962 if (PL_error_count >= 10) {
7963 if (PL_in_eval && SvCUR(ERRSV))
7964 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7965 ERRSV, OutCopFILE(PL_curcop));
7967 Perl_croak(aTHX_ "%s has too many errors.\n",
7968 OutCopFILE(PL_curcop));
7971 PL_in_my_stash = Nullhv;
7975 #pragma segment Main
7979 S_swallow_bom(pTHX_ U8 *s)
7982 slen = SvCUR(PL_linestr);
7986 /* UTF-16 little-endian? (or UTF32-LE?) */
7987 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7988 Perl_croak(aTHX_ "Unsupported script encoding UTF32-LE");
7989 #ifndef PERL_NO_UTF16_FILTER
7990 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF16-LE script encoding (BOM)\n");
7993 if (PL_bufend > (char*)s) {
7997 filter_add(utf16rev_textfilter, NULL);
7998 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8000 (char*)utf16_to_utf8_reversed(s, news,
8001 PL_bufend - (char*)s - 1,
8003 sv_setpvn(PL_linestr, (const char*)news, newlen);
8005 SvUTF8_on(PL_linestr);
8006 s = (U8*)SvPVX(PL_linestr);
8007 PL_bufend = SvPVX(PL_linestr) + newlen;
8010 Perl_croak(aTHX_ "Unsupported script encoding UTF16-LE");
8015 if (s[1] == 0xFF) { /* UTF-16 big-endian? */
8016 #ifndef PERL_NO_UTF16_FILTER
8017 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (BOM)\n");
8020 if (PL_bufend > (char *)s) {
8024 filter_add(utf16_textfilter, NULL);
8025 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
8027 (char*)utf16_to_utf8(s, news,
8028 PL_bufend - (char*)s,
8030 sv_setpvn(PL_linestr, (const char*)news, newlen);
8032 SvUTF8_on(PL_linestr);
8033 s = (U8*)SvPVX(PL_linestr);
8034 PL_bufend = SvPVX(PL_linestr) + newlen;
8037 Perl_croak(aTHX_ "Unsupported script encoding UTF16-BE");
8042 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
8043 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
8050 if (s[2] == 0xFE && s[3] == 0xFF) {
8051 /* UTF-32 big-endian */
8052 Perl_croak(aTHX_ "Unsupported script encoding UTF32-BE");
8055 else if (s[2] == 0 && s[3] != 0) {
8058 * are a good indicator of UTF-16BE. */
8059 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (no BOM)\n");
8064 if (slen > 3 && s[1] == 0 && s[2] != 0 && s[3] == 0) {
8067 * are a good indicator of UTF-16LE. */
8068 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (no BOM)\n");
8077 * Restore a source filter.
8081 restore_rsfp(pTHX_ void *f)
8083 PerlIO *fp = (PerlIO*)f;
8085 if (PL_rsfp == PerlIO_stdin())
8086 PerlIO_clearerr(PL_rsfp);
8087 else if (PL_rsfp && (PL_rsfp != fp))
8088 PerlIO_close(PL_rsfp);
8092 #ifndef PERL_NO_UTF16_FILTER
8094 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8096 I32 count = FILTER_READ(idx+1, sv, maxlen);
8101 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8102 if (!*SvPV_nolen(sv))
8103 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
8106 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
8107 sv_usepvn(sv, (char*)tmps, tend - tmps);
8113 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
8115 I32 count = FILTER_READ(idx+1, sv, maxlen);
8120 if (!*SvPV_nolen(sv))
8121 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
8124 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
8125 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
8126 sv_usepvn(sv, (char*)tmps, tend - tmps);
8133 Returns a pointer to the next character after the parsed
8134 vstring, as well as updating the passed in sv.
8136 Function must be called like
8139 s = scan_vstring(s,sv);
8141 The sv should already be large enough to store the vstring
8142 passed in, for performance reasons.
8147 Perl_scan_vstring(pTHX_ char *s, SV *sv)
8151 if (*pos == 'v') pos++; /* get past 'v' */
8152 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8155 /* this may not be a v-string if followed by => */
8157 while (next < PL_bufend && isSPACE(*next))
8159 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
8160 /* return string not v-string */
8161 sv_setpvn(sv,(char *)s,pos-s);
8166 if (!isALPHA(*pos)) {
8168 U8 tmpbuf[UTF8_MAXLEN+1];
8171 if (*s == 'v') s++; /* get past 'v' */
8173 sv_setpvn(sv, "", 0);
8178 /* this is atoi() that tolerates underscores */
8181 while (--end >= s) {
8186 rev += (*end - '0') * mult;
8188 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8189 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8190 "Integer overflow in decimal number");
8194 if (rev > 0x7FFFFFFF)
8195 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8197 /* Append native character for the rev point */
8198 tmpend = uvchr_to_utf8(tmpbuf, rev);
8199 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8200 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8202 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8208 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8212 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);