3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
29 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
30 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
32 static void restore_rsfp(pTHX_ void *f);
33 #ifndef PERL_NO_UTF16_FILTER
34 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
35 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
38 #define XFAKEBRACK 128
41 #ifdef USE_UTF8_SCRIPTS
42 # define UTF (!IN_BYTES)
44 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
47 /* In variables named $^X, these are the legal values for X.
48 * 1999-02-27 mjd-perl-patch@plover.com */
49 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
51 /* On MacOS, respect nonbreaking spaces */
52 #ifdef MACOS_TRADITIONAL
53 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
58 /* LEX_* are values for PL_lex_state, the state of the lexer.
59 * They are arranged oddly so that the guard on the switch statement
60 * can get by with a single comparison (if the compiler is smart enough).
63 /* #define LEX_NOTPARSING 11 is done in perl.h. */
66 #define LEX_INTERPNORMAL 9
67 #define LEX_INTERPCASEMOD 8
68 #define LEX_INTERPPUSH 7
69 #define LEX_INTERPSTART 6
70 #define LEX_INTERPEND 5
71 #define LEX_INTERPENDMAYBE 4
72 #define LEX_INTERPCONCAT 3
73 #define LEX_INTERPCONST 2
74 #define LEX_FORMLINE 1
75 #define LEX_KNOWNEXT 0
83 # define YYMAXLEVEL 100
85 YYSTYPE* yylval_pointer[YYMAXLEVEL];
86 int* yychar_pointer[YYMAXLEVEL];
90 # define yylval (*yylval_pointer[yyactlevel])
91 # define yychar (*yychar_pointer[yyactlevel])
92 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
94 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
99 /* CLINE is a macro that ensures PL_copline has a sane value */
104 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
107 * Convenience functions to return different tokens and prime the
108 * lexer for the next token. They all take an argument.
110 * TOKEN : generic token (used for '(', DOLSHARP, etc)
111 * OPERATOR : generic operator
112 * AOPERATOR : assignment operator
113 * PREBLOCK : beginning the block after an if, while, foreach, ...
114 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
115 * PREREF : *EXPR where EXPR is not a simple identifier
116 * TERM : expression term
117 * LOOPX : loop exiting command (goto, last, dump, etc)
118 * FTST : file test operator
119 * FUN0 : zero-argument function
120 * FUN1 : not used, except for not, which isn't a UNIOP
121 * BOop : bitwise or or xor
123 * SHop : shift operator
124 * PWop : power operator
125 * PMop : pattern-matching operator
126 * Aop : addition-level operator
127 * Mop : multiplication-level operator
128 * Eop : equality-testing operator
129 * Rop : relational operator <= != gt
131 * Also see LOP and lop() below.
134 /* Note that REPORT() and REPORT2() will be expressions that supply
135 * their own trailing comma, not suitable for statements as such. */
136 #ifdef DEBUGGING /* Serve -DT. */
137 # define REPORT(x,retval) tokereport(x,s,(int)retval),
138 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
140 # define REPORT(x,retval)
141 # define REPORT2(x,retval)
144 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
145 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
146 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
147 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
148 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
149 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
150 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
151 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
152 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
153 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
154 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
155 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
156 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
157 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
158 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
159 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
160 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
161 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
162 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
163 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
165 /* This bit of chicanery makes a unary function followed by
166 * a parenthesis into a function with one argument, highest precedence.
167 * The UNIDOR macro is for unary functions that can be followed by the //
168 * operator (such as C<shift // 0>).
170 #define UNI2(f,x) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
177 #define UNI(f) UNI2(f,XTERM)
178 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
180 #define UNIBRACK(f) return(yylval.ival = f, \
183 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
186 /* grandfather return to old style */
187 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
195 SV* report = newSVpv(thing, 0);
196 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
199 if (s - PL_bufptr > 0)
200 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
202 if (PL_oldbufptr && *PL_oldbufptr)
203 sv_catpv(report, PL_tokenbuf);
205 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
214 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
215 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
219 S_ao(pTHX_ int toketype)
221 if (*PL_bufptr == '=') {
223 if (toketype == ANDAND)
224 yylval.ival = OP_ANDASSIGN;
225 else if (toketype == OROR)
226 yylval.ival = OP_ORASSIGN;
227 else if (toketype == DORDOR)
228 yylval.ival = OP_DORASSIGN;
236 * When Perl expects an operator and finds something else, no_op
237 * prints the warning. It always prints "<something> found where
238 * operator expected. It prints "Missing semicolon on previous line?"
239 * if the surprise occurs at the start of the line. "do you need to
240 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
241 * where the compiler doesn't know if foo is a method call or a function.
242 * It prints "Missing operator before end of line" if there's nothing
243 * after the missing operator, or "... before <...>" if there is something
244 * after the missing operator.
248 S_no_op(pTHX_ char *what, char *s)
250 char *oldbp = PL_bufptr;
251 bool is_first = (PL_oldbufptr == PL_linestart);
257 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
259 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
260 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
262 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
263 if (t < PL_bufptr && isSPACE(*t))
264 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
265 t - PL_oldoldbufptr, PL_oldoldbufptr);
269 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
276 * Complain about missing quote/regexp/heredoc terminator.
277 * If it's called with (char *)NULL then it cauterizes the line buffer.
278 * If we're in a delimited string and the delimiter is a control
279 * character, it's reformatted into a two-char sequence like ^C.
284 S_missingterm(pTHX_ char *s)
289 char *nl = strrchr(s,'\n');
295 iscntrl(PL_multi_close)
297 PL_multi_close < 32 || PL_multi_close == 127
301 tmpbuf[1] = toCTRL(PL_multi_close);
307 *tmpbuf = (char)PL_multi_close;
311 q = strchr(s,'"') ? '\'' : '"';
312 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
320 Perl_deprecate(pTHX_ char *s)
322 if (ckWARN(WARN_DEPRECATED))
323 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
327 Perl_deprecate_old(pTHX_ char *s)
329 /* This function should NOT be called for any new deprecated warnings */
330 /* Use Perl_deprecate instead */
332 /* It is here to maintain backward compatibility with the pre-5.8 */
333 /* warnings category hierarchy. The "deprecated" category used to */
334 /* live under the "syntax" category. It is now a top-level category */
335 /* in its own right. */
337 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
338 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
339 "Use of %s is deprecated", s);
344 * Deprecate a comma-less variable list.
350 deprecate_old("comma-less variable list");
354 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
355 * utf16-to-utf8-reversed.
358 #ifdef PERL_CR_FILTER
362 register char *s = SvPVX(sv);
363 register char *e = s + SvCUR(sv);
364 /* outer loop optimized to do nothing if there are no CR-LFs */
366 if (*s++ == '\r' && *s == '\n') {
367 /* hit a CR-LF, need to copy the rest */
368 register char *d = s - 1;
371 if (*s == '\r' && s[1] == '\n')
382 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
384 I32 count = FILTER_READ(idx+1, sv, maxlen);
385 if (count > 0 && !maxlen)
393 * Initialize variables. Uses the Perl save_stack to save its state (for
394 * recursive calls to the parser).
398 Perl_lex_start(pTHX_ SV *line)
403 SAVEI32(PL_lex_dojoin);
404 SAVEI32(PL_lex_brackets);
405 SAVEI32(PL_lex_casemods);
406 SAVEI32(PL_lex_starts);
407 SAVEI32(PL_lex_state);
408 SAVEVPTR(PL_lex_inpat);
409 SAVEI32(PL_lex_inwhat);
410 if (PL_lex_state == LEX_KNOWNEXT) {
411 I32 toke = PL_nexttoke;
412 while (--toke >= 0) {
413 SAVEI32(PL_nexttype[toke]);
414 SAVEVPTR(PL_nextval[toke]);
416 SAVEI32(PL_nexttoke);
418 SAVECOPLINE(PL_curcop);
421 SAVEPPTR(PL_oldbufptr);
422 SAVEPPTR(PL_oldoldbufptr);
423 SAVEPPTR(PL_last_lop);
424 SAVEPPTR(PL_last_uni);
425 SAVEPPTR(PL_linestart);
426 SAVESPTR(PL_linestr);
427 SAVEGENERICPV(PL_lex_brackstack);
428 SAVEGENERICPV(PL_lex_casestack);
429 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
430 SAVESPTR(PL_lex_stuff);
431 SAVEI32(PL_lex_defer);
432 SAVEI32(PL_sublex_info.sub_inwhat);
433 SAVESPTR(PL_lex_repl);
435 SAVEINT(PL_lex_expect);
437 PL_lex_state = LEX_NORMAL;
441 New(899, PL_lex_brackstack, 120, char);
442 New(899, PL_lex_casestack, 12, char);
444 *PL_lex_casestack = '\0';
447 PL_lex_stuff = Nullsv;
448 PL_lex_repl = Nullsv;
452 PL_sublex_info.sub_inwhat = 0;
454 if (SvREADONLY(PL_linestr))
455 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
456 s = SvPV(PL_linestr, len);
457 if (!len || s[len-1] != ';') {
458 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
459 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
460 sv_catpvn(PL_linestr, "\n;", 2);
462 SvTEMP_off(PL_linestr);
463 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
464 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
465 PL_last_lop = PL_last_uni = Nullch;
471 * Finalizer for lexing operations. Must be called when the parser is
472 * done with the lexer.
478 PL_doextract = FALSE;
483 * This subroutine has nothing to do with tilting, whether at windmills
484 * or pinball tables. Its name is short for "increment line". It
485 * increments the current line number in CopLINE(PL_curcop) and checks
486 * to see whether the line starts with a comment of the form
487 * # line 500 "foo.pm"
488 * If so, it sets the current line number and file to the values in the comment.
492 S_incline(pTHX_ char *s)
499 CopLINE_inc(PL_curcop);
502 while (SPACE_OR_TAB(*s)) s++;
503 if (strnEQ(s, "line", 4))
507 if (SPACE_OR_TAB(*s))
511 while (SPACE_OR_TAB(*s)) s++;
517 while (SPACE_OR_TAB(*s))
519 if (*s == '"' && (t = strchr(s+1, '"'))) {
524 for (t = s; !isSPACE(*t); t++) ;
527 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
529 if (*e != '\n' && *e != '\0')
530 return; /* false alarm */
535 CopFILE_free(PL_curcop);
536 CopFILE_set(PL_curcop, s);
539 CopLINE_set(PL_curcop, atoi(n)-1);
544 * Called to gobble the appropriate amount and type of whitespace.
545 * Skips comments as well.
549 S_skipspace(pTHX_ register char *s)
551 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
552 while (s < PL_bufend && SPACE_OR_TAB(*s))
558 SSize_t oldprevlen, oldoldprevlen;
559 SSize_t oldloplen = 0, oldunilen = 0;
560 while (s < PL_bufend && isSPACE(*s)) {
561 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
566 if (s < PL_bufend && *s == '#') {
567 while (s < PL_bufend && *s != '\n')
571 if (PL_in_eval && !PL_rsfp) {
578 /* only continue to recharge the buffer if we're at the end
579 * of the buffer, we're not reading from a source filter, and
580 * we're in normal lexing mode
582 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
583 PL_lex_state == LEX_FORMLINE)
586 /* try to recharge the buffer */
587 if ((s = filter_gets(PL_linestr, PL_rsfp,
588 (prevlen = SvCUR(PL_linestr)))) == Nullch)
590 /* end of file. Add on the -p or -n magic */
591 if (PL_minus_n || PL_minus_p) {
592 sv_setpv(PL_linestr,PL_minus_p ?
593 ";}continue{print or die qq(-p destination: $!\\n)" :
595 sv_catpv(PL_linestr,";}");
596 PL_minus_n = PL_minus_p = 0;
599 sv_setpv(PL_linestr,";");
601 /* reset variables for next time we lex */
602 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
604 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
605 PL_last_lop = PL_last_uni = Nullch;
607 /* Close the filehandle. Could be from -P preprocessor,
608 * STDIN, or a regular file. If we were reading code from
609 * STDIN (because the commandline held no -e or filename)
610 * then we don't close it, we reset it so the code can
611 * read from STDIN too.
614 if (PL_preprocess && !PL_in_eval)
615 (void)PerlProc_pclose(PL_rsfp);
616 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
617 PerlIO_clearerr(PL_rsfp);
619 (void)PerlIO_close(PL_rsfp);
624 /* not at end of file, so we only read another line */
625 /* make corresponding updates to old pointers, for yyerror() */
626 oldprevlen = PL_oldbufptr - PL_bufend;
627 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
629 oldunilen = PL_last_uni - PL_bufend;
631 oldloplen = PL_last_lop - PL_bufend;
632 PL_linestart = PL_bufptr = s + prevlen;
633 PL_bufend = s + SvCUR(PL_linestr);
635 PL_oldbufptr = s + oldprevlen;
636 PL_oldoldbufptr = s + oldoldprevlen;
638 PL_last_uni = s + oldunilen;
640 PL_last_lop = s + oldloplen;
643 /* debugger active and we're not compiling the debugger code,
644 * so store the line into the debugger's array of lines
646 if (PERLDB_LINE && PL_curstash != PL_debstash) {
647 SV *sv = NEWSV(85,0);
649 sv_upgrade(sv, SVt_PVMG);
650 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
653 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
660 * Check the unary operators to ensure there's no ambiguity in how they're
661 * used. An ambiguous piece of code would be:
663 * This doesn't mean rand() + 5. Because rand() is a unary operator,
664 * the +5 is its argument.
673 if (PL_oldoldbufptr != PL_last_uni)
675 while (isSPACE(*PL_last_uni))
677 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
678 if ((t = strchr(s, '(')) && t < PL_bufptr)
680 if (ckWARN_d(WARN_AMBIGUOUS)){
683 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
684 "Warning: Use of \"%s\" without parens is ambiguous",
691 * LOP : macro to build a list operator. Its behaviour has been replaced
692 * with a subroutine, S_lop() for which LOP is just another name.
695 #define LOP(f,x) return lop(f,x,s)
699 * Build a list operator (or something that might be one). The rules:
700 * - if we have a next token, then it's a list operator [why?]
701 * - if the next thing is an opening paren, then it's a function
702 * - else it's a list operator
706 S_lop(pTHX_ I32 f, int x, char *s)
713 PL_last_lop = PL_oldbufptr;
714 PL_last_lop_op = (OPCODE)f;
728 * When the lexer realizes it knows the next token (for instance,
729 * it is reordering tokens for the parser) then it can call S_force_next
730 * to know what token to return the next time the lexer is called. Caller
731 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
732 * handles the token correctly.
736 S_force_next(pTHX_ I32 type)
738 PL_nexttype[PL_nexttoke] = type;
740 if (PL_lex_state != LEX_KNOWNEXT) {
741 PL_lex_defer = PL_lex_state;
742 PL_lex_expect = PL_expect;
743 PL_lex_state = LEX_KNOWNEXT;
749 * When the lexer knows the next thing is a word (for instance, it has
750 * just seen -> and it knows that the next char is a word char, then
751 * it calls S_force_word to stick the next word into the PL_next lookahead.
754 * char *start : buffer position (must be within PL_linestr)
755 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
756 * int check_keyword : if true, Perl checks to make sure the word isn't
757 * a keyword (do this if the word is a label, e.g. goto FOO)
758 * int allow_pack : if true, : characters will also be allowed (require,
760 * int allow_initial_tick : used by the "sub" lexer only.
764 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
769 start = skipspace(start);
771 if (isIDFIRST_lazy_if(s,UTF) ||
772 (allow_pack && *s == ':') ||
773 (allow_initial_tick && *s == '\'') )
775 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
776 if (check_keyword && keyword(PL_tokenbuf, len))
778 if (token == METHOD) {
783 PL_expect = XOPERATOR;
786 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
787 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
795 * Called when the lexer wants $foo *foo &foo etc, but the program
796 * text only contains the "foo" portion. The first argument is a pointer
797 * to the "foo", and the second argument is the type symbol to prefix.
798 * Forces the next token to be a "WORD".
799 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
803 S_force_ident(pTHX_ register char *s, int kind)
806 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
807 PL_nextval[PL_nexttoke].opval = o;
810 o->op_private = OPpCONST_ENTERED;
811 /* XXX see note in pp_entereval() for why we forgo typo
812 warnings if the symbol must be introduced in an eval.
814 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
815 kind == '$' ? SVt_PV :
816 kind == '@' ? SVt_PVAV :
817 kind == '%' ? SVt_PVHV :
825 Perl_str_to_version(pTHX_ SV *sv)
830 char *start = SvPVx(sv,len);
831 bool utf = SvUTF8(sv) ? TRUE : FALSE;
832 char *end = start + len;
833 while (start < end) {
837 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
842 retval += ((NV)n)/nshift;
851 * Forces the next token to be a version number.
852 * If the next token appears to be an invalid version number, (e.g. "v2b"),
853 * and if "guessing" is TRUE, then no new token is created (and the caller
854 * must use an alternative parsing method).
858 S_force_version(pTHX_ char *s, int guessing)
860 OP *version = Nullop;
869 while (isDIGIT(*d) || *d == '_' || *d == '.')
871 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
873 s = scan_num(s, &yylval);
874 version = yylval.opval;
875 ver = cSVOPx(version)->op_sv;
876 if (SvPOK(ver) && !SvNIOK(ver)) {
877 (void)SvUPGRADE(ver, SVt_PVNV);
878 SvNVX(ver) = str_to_version(ver);
879 SvNOK_on(ver); /* hint that it is a version */
886 /* NOTE: The parser sees the package name and the VERSION swapped */
887 PL_nextval[PL_nexttoke].opval = version;
895 * Tokenize a quoted string passed in as an SV. It finds the next
896 * chunk, up to end of string or a backslash. It may make a new
897 * SV containing that chunk (if HINT_NEW_STRING is on). It also
902 S_tokeq(pTHX_ SV *sv)
913 s = SvPV_force(sv, len);
914 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
917 while (s < send && *s != '\\')
922 if ( PL_hints & HINT_NEW_STRING ) {
923 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
929 if (s + 1 < send && (s[1] == '\\'))
930 s++; /* all that, just for this */
935 SvCUR_set(sv, d - SvPVX(sv));
937 if ( PL_hints & HINT_NEW_STRING )
938 return new_constant(NULL, 0, "q", sv, pv, "q");
943 * Now come three functions related to double-quote context,
944 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
945 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
946 * interact with PL_lex_state, and create fake ( ... ) argument lists
947 * to handle functions and concatenation.
948 * They assume that whoever calls them will be setting up a fake
949 * join call, because each subthing puts a ',' after it. This lets
952 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
954 * (I'm not sure whether the spurious commas at the end of lcfirst's
955 * arguments and join's arguments are created or not).
960 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
962 * Pattern matching will set PL_lex_op to the pattern-matching op to
963 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
965 * OP_CONST and OP_READLINE are easy--just make the new op and return.
967 * Everything else becomes a FUNC.
969 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
970 * had an OP_CONST or OP_READLINE). This just sets us up for a
971 * call to S_sublex_push().
977 register I32 op_type = yylval.ival;
979 if (op_type == OP_NULL) {
980 yylval.opval = PL_lex_op;
984 if (op_type == OP_CONST || op_type == OP_READLINE) {
985 SV *sv = tokeq(PL_lex_stuff);
987 if (SvTYPE(sv) == SVt_PVIV) {
988 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
994 nsv = newSVpvn(p, len);
1000 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1001 PL_lex_stuff = Nullsv;
1002 /* Allow <FH> // "foo" */
1003 if (op_type == OP_READLINE)
1004 PL_expect = XTERMORDORDOR;
1008 PL_sublex_info.super_state = PL_lex_state;
1009 PL_sublex_info.sub_inwhat = op_type;
1010 PL_sublex_info.sub_op = PL_lex_op;
1011 PL_lex_state = LEX_INTERPPUSH;
1015 yylval.opval = PL_lex_op;
1025 * Create a new scope to save the lexing state. The scope will be
1026 * ended in S_sublex_done. Returns a '(', starting the function arguments
1027 * to the uc, lc, etc. found before.
1028 * Sets PL_lex_state to LEX_INTERPCONCAT.
1036 PL_lex_state = PL_sublex_info.super_state;
1037 SAVEI32(PL_lex_dojoin);
1038 SAVEI32(PL_lex_brackets);
1039 SAVEI32(PL_lex_casemods);
1040 SAVEI32(PL_lex_starts);
1041 SAVEI32(PL_lex_state);
1042 SAVEVPTR(PL_lex_inpat);
1043 SAVEI32(PL_lex_inwhat);
1044 SAVECOPLINE(PL_curcop);
1045 SAVEPPTR(PL_bufptr);
1046 SAVEPPTR(PL_bufend);
1047 SAVEPPTR(PL_oldbufptr);
1048 SAVEPPTR(PL_oldoldbufptr);
1049 SAVEPPTR(PL_last_lop);
1050 SAVEPPTR(PL_last_uni);
1051 SAVEPPTR(PL_linestart);
1052 SAVESPTR(PL_linestr);
1053 SAVEGENERICPV(PL_lex_brackstack);
1054 SAVEGENERICPV(PL_lex_casestack);
1056 PL_linestr = PL_lex_stuff;
1057 PL_lex_stuff = Nullsv;
1059 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1060 = SvPVX(PL_linestr);
1061 PL_bufend += SvCUR(PL_linestr);
1062 PL_last_lop = PL_last_uni = Nullch;
1063 SAVEFREESV(PL_linestr);
1065 PL_lex_dojoin = FALSE;
1066 PL_lex_brackets = 0;
1067 New(899, PL_lex_brackstack, 120, char);
1068 New(899, PL_lex_casestack, 12, char);
1069 PL_lex_casemods = 0;
1070 *PL_lex_casestack = '\0';
1072 PL_lex_state = LEX_INTERPCONCAT;
1073 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1075 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1076 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1077 PL_lex_inpat = PL_sublex_info.sub_op;
1079 PL_lex_inpat = Nullop;
1086 * Restores lexer state after a S_sublex_push.
1092 if (!PL_lex_starts++) {
1093 SV *sv = newSVpvn("",0);
1094 if (SvUTF8(PL_linestr))
1096 PL_expect = XOPERATOR;
1097 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1101 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1102 PL_lex_state = LEX_INTERPCASEMOD;
1106 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1107 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1108 PL_linestr = PL_lex_repl;
1110 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1111 PL_bufend += SvCUR(PL_linestr);
1112 PL_last_lop = PL_last_uni = Nullch;
1113 SAVEFREESV(PL_linestr);
1114 PL_lex_dojoin = FALSE;
1115 PL_lex_brackets = 0;
1116 PL_lex_casemods = 0;
1117 *PL_lex_casestack = '\0';
1119 if (SvEVALED(PL_lex_repl)) {
1120 PL_lex_state = LEX_INTERPNORMAL;
1122 /* we don't clear PL_lex_repl here, so that we can check later
1123 whether this is an evalled subst; that means we rely on the
1124 logic to ensure sublex_done() is called again only via the
1125 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1128 PL_lex_state = LEX_INTERPCONCAT;
1129 PL_lex_repl = Nullsv;
1135 PL_bufend = SvPVX(PL_linestr);
1136 PL_bufend += SvCUR(PL_linestr);
1137 PL_expect = XOPERATOR;
1138 PL_sublex_info.sub_inwhat = 0;
1146 Extracts a pattern, double-quoted string, or transliteration. This
1149 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1150 processing a pattern (PL_lex_inpat is true), a transliteration
1151 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1153 Returns a pointer to the character scanned up to. Iff this is
1154 advanced from the start pointer supplied (ie if anything was
1155 successfully parsed), will leave an OP for the substring scanned
1156 in yylval. Caller must intuit reason for not parsing further
1157 by looking at the next characters herself.
1161 double-quoted style: \r and \n
1162 regexp special ones: \D \s
1164 backrefs: \1 (deprecated in substitution replacements)
1165 case and quoting: \U \Q \E
1166 stops on @ and $, but not for $ as tail anchor
1168 In transliterations:
1169 characters are VERY literal, except for - not at the start or end
1170 of the string, which indicates a range. scan_const expands the
1171 range to the full set of intermediate characters.
1173 In double-quoted strings:
1175 double-quoted style: \r and \n
1177 backrefs: \1 (deprecated)
1178 case and quoting: \U \Q \E
1181 scan_const does *not* construct ops to handle interpolated strings.
1182 It stops processing as soon as it finds an embedded $ or @ variable
1183 and leaves it to the caller to work out what's going on.
1185 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1187 $ in pattern could be $foo or could be tail anchor. Assumption:
1188 it's a tail anchor if $ is the last thing in the string, or if it's
1189 followed by one of ")| \n\t"
1191 \1 (backreferences) are turned into $1
1193 The structure of the code is
1194 while (there's a character to process) {
1195 handle transliteration ranges
1196 skip regexp comments
1197 skip # initiated comments in //x patterns
1198 check for embedded @foo
1199 check for embedded scalars
1201 leave intact backslashes from leave (below)
1202 deprecate \1 in strings and sub replacements
1203 handle string-changing backslashes \l \U \Q \E, etc.
1204 switch (what was escaped) {
1205 handle - in a transliteration (becomes a literal -)
1206 handle \132 octal characters
1207 handle 0x15 hex characters
1208 handle \cV (control V)
1209 handle printf backslashes (\f, \r, \n, etc)
1211 } (end if backslash)
1212 } (end while character to read)
1217 S_scan_const(pTHX_ char *start)
1219 register char *send = PL_bufend; /* end of the constant */
1220 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1221 register char *s = start; /* start of the constant */
1222 register char *d = SvPVX(sv); /* destination for copies */
1223 bool dorange = FALSE; /* are we in a translit range? */
1224 bool didrange = FALSE; /* did we just finish a range? */
1225 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1226 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1229 const char *leaveit = /* set of acceptably-backslashed characters */
1231 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1234 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1235 /* If we are doing a trans and we know we want UTF8 set expectation */
1236 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1237 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1241 while (s < send || dorange) {
1242 /* get transliterations out of the way (they're most literal) */
1243 if (PL_lex_inwhat == OP_TRANS) {
1244 /* expand a range A-Z to the full set of characters. AIE! */
1246 I32 i; /* current expanded character */
1247 I32 min; /* first character in range */
1248 I32 max; /* last character in range */
1251 char *c = (char*)utf8_hop((U8*)d, -1);
1255 *c = (char)UTF_TO_NATIVE(0xff);
1256 /* mark the range as done, and continue */
1262 i = d - SvPVX(sv); /* remember current offset */
1263 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1264 d = SvPVX(sv) + i; /* refresh d after realloc */
1265 d -= 2; /* eat the first char and the - */
1267 min = (U8)*d; /* first char in range */
1268 max = (U8)d[1]; /* last char in range */
1272 "Invalid range \"%c-%c\" in transliteration operator",
1273 (char)min, (char)max);
1277 if ((isLOWER(min) && isLOWER(max)) ||
1278 (isUPPER(min) && isUPPER(max))) {
1280 for (i = min; i <= max; i++)
1282 *d++ = NATIVE_TO_NEED(has_utf8,i);
1284 for (i = min; i <= max; i++)
1286 *d++ = NATIVE_TO_NEED(has_utf8,i);
1291 for (i = min; i <= max; i++)
1294 /* mark the range as done, and continue */
1300 /* range begins (ignore - as first or last char) */
1301 else if (*s == '-' && s+1 < send && s != start) {
1303 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1306 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1318 /* if we get here, we're not doing a transliteration */
1320 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1321 except for the last char, which will be done separately. */
1322 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1324 while (s < send && *s != ')')
1325 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1327 else if (s[2] == '{' /* This should match regcomp.c */
1328 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1331 char *regparse = s + (s[2] == '{' ? 3 : 4);
1334 while (count && (c = *regparse)) {
1335 if (c == '\\' && regparse[1])
1343 if (*regparse != ')') {
1344 regparse--; /* Leave one char for continuation. */
1345 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1347 while (s < regparse)
1348 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1352 /* likewise skip #-initiated comments in //x patterns */
1353 else if (*s == '#' && PL_lex_inpat &&
1354 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1355 while (s+1 < send && *s != '\n')
1356 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1359 /* check for embedded arrays
1360 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1362 else if (*s == '@' && s[1]
1363 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1366 /* check for embedded scalars. only stop if we're sure it's a
1369 else if (*s == '$') {
1370 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1372 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1373 break; /* in regexp, $ might be tail anchor */
1376 /* End of else if chain - OP_TRANS rejoin rest */
1379 if (*s == '\\' && s+1 < send) {
1382 /* some backslashes we leave behind */
1383 if (*leaveit && *s && strchr(leaveit, *s)) {
1384 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1385 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1389 /* deprecate \1 in strings and substitution replacements */
1390 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1391 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1393 if (ckWARN(WARN_SYNTAX))
1394 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1399 /* string-change backslash escapes */
1400 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1405 /* if we get here, it's either a quoted -, or a digit */
1408 /* quoted - in transliterations */
1410 if (PL_lex_inwhat == OP_TRANS) {
1417 if (ckWARN(WARN_MISC) &&
1420 Perl_warner(aTHX_ packWARN(WARN_MISC),
1421 "Unrecognized escape \\%c passed through",
1423 /* default action is to copy the quoted character */
1424 goto default_action;
1427 /* \132 indicates an octal constant */
1428 case '0': case '1': case '2': case '3':
1429 case '4': case '5': case '6': case '7':
1433 uv = grok_oct(s, &len, &flags, NULL);
1436 goto NUM_ESCAPE_INSERT;
1438 /* \x24 indicates a hex constant */
1442 char* e = strchr(s, '}');
1443 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1444 PERL_SCAN_DISALLOW_PREFIX;
1449 yyerror("Missing right brace on \\x{}");
1453 uv = grok_hex(s, &len, &flags, NULL);
1459 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1460 uv = grok_hex(s, &len, &flags, NULL);
1466 /* Insert oct or hex escaped character.
1467 * There will always enough room in sv since such
1468 * escapes will be longer than any UTF-8 sequence
1469 * they can end up as. */
1471 /* We need to map to chars to ASCII before doing the tests
1474 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1475 if (!has_utf8 && uv > 255) {
1476 /* Might need to recode whatever we have
1477 * accumulated so far if it contains any
1480 * (Can't we keep track of that and avoid
1481 * this rescan? --jhi)
1485 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1486 if (!NATIVE_IS_INVARIANT(*c)) {
1491 STRLEN offset = d - SvPVX(sv);
1493 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1497 while (src >= (U8 *)SvPVX(sv)) {
1498 if (!NATIVE_IS_INVARIANT(*src)) {
1499 U8 ch = NATIVE_TO_ASCII(*src);
1500 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1501 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1511 if (has_utf8 || uv > 255) {
1512 d = (char*)uvchr_to_utf8((U8*)d, uv);
1514 if (PL_lex_inwhat == OP_TRANS &&
1515 PL_sublex_info.sub_op) {
1516 PL_sublex_info.sub_op->op_private |=
1517 (PL_lex_repl ? OPpTRANS_FROM_UTF
1530 /* \N{LATIN SMALL LETTER A} is a named character */
1534 char* e = strchr(s, '}');
1540 yyerror("Missing right brace on \\N{}");
1544 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1546 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1547 PERL_SCAN_DISALLOW_PREFIX;
1550 uv = grok_hex(s, &len, &flags, NULL);
1552 goto NUM_ESCAPE_INSERT;
1554 res = newSVpvn(s + 1, e - s - 1);
1555 res = new_constant( Nullch, 0, "charnames",
1556 res, Nullsv, "\\N{...}" );
1558 sv_utf8_upgrade(res);
1559 str = SvPV(res,len);
1560 #ifdef EBCDIC_NEVER_MIND
1561 /* charnames uses pack U and that has been
1562 * recently changed to do the below uni->native
1563 * mapping, so this would be redundant (and wrong,
1564 * the code point would be doubly converted).
1565 * But leave this in just in case the pack U change
1566 * gets revoked, but the semantics is still
1567 * desireable for charnames. --jhi */
1569 UV uv = utf8_to_uvchr((U8*)str, 0);
1572 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1574 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1575 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1576 str = SvPV(res, len);
1580 if (!has_utf8 && SvUTF8(res)) {
1581 char *ostart = SvPVX(sv);
1582 SvCUR_set(sv, d - ostart);
1585 sv_utf8_upgrade(sv);
1586 /* this just broke our allocation above... */
1587 SvGROW(sv, (STRLEN)(send - start));
1588 d = SvPVX(sv) + SvCUR(sv);
1591 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1592 char *odest = SvPVX(sv);
1594 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1595 d = SvPVX(sv) + (d - odest);
1597 Copy(str, d, len, char);
1604 yyerror("Missing braces on \\N{}");
1607 /* \c is a control character */
1616 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1619 yyerror("Missing control char name in \\c");
1623 /* printf-style backslashes, formfeeds, newlines, etc */
1625 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1628 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1631 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1634 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1637 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1640 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1643 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1649 } /* end if (backslash) */
1652 /* If we started with encoded form, or already know we want it
1653 and then encode the next character */
1654 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1656 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1657 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1660 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1661 STRLEN off = d - SvPVX(sv);
1662 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1664 d = (char*)uvchr_to_utf8((U8*)d, uv);
1668 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1670 } /* while loop to process each character */
1672 /* terminate the string and set up the sv */
1674 SvCUR_set(sv, d - SvPVX(sv));
1675 if (SvCUR(sv) >= SvLEN(sv))
1676 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1679 if (PL_encoding && !has_utf8) {
1680 sv_recode_to_utf8(sv, PL_encoding);
1686 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1687 PL_sublex_info.sub_op->op_private |=
1688 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1692 /* shrink the sv if we allocated more than we used */
1693 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1694 SvLEN_set(sv, SvCUR(sv) + 1);
1695 Renew(SvPVX(sv), SvLEN(sv), char);
1698 /* return the substring (via yylval) only if we parsed anything */
1699 if (s > PL_bufptr) {
1700 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1701 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1703 ( PL_lex_inwhat == OP_TRANS
1705 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1708 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1715 * Returns TRUE if there's more to the expression (e.g., a subscript),
1718 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1720 * ->[ and ->{ return TRUE
1721 * { and [ outside a pattern are always subscripts, so return TRUE
1722 * if we're outside a pattern and it's not { or [, then return FALSE
1723 * if we're in a pattern and the first char is a {
1724 * {4,5} (any digits around the comma) returns FALSE
1725 * if we're in a pattern and the first char is a [
1727 * [SOMETHING] has a funky algorithm to decide whether it's a
1728 * character class or not. It has to deal with things like
1729 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1730 * anything else returns TRUE
1733 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1736 S_intuit_more(pTHX_ register char *s)
1738 if (PL_lex_brackets)
1740 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1742 if (*s != '{' && *s != '[')
1747 /* In a pattern, so maybe we have {n,m}. */
1764 /* On the other hand, maybe we have a character class */
1767 if (*s == ']' || *s == '^')
1770 /* this is terrifying, and it works */
1771 int weight = 2; /* let's weigh the evidence */
1773 unsigned char un_char = 255, last_un_char;
1774 char *send = strchr(s,']');
1775 char tmpbuf[sizeof PL_tokenbuf * 4];
1777 if (!send) /* has to be an expression */
1780 Zero(seen,256,char);
1783 else if (isDIGIT(*s)) {
1785 if (isDIGIT(s[1]) && s[2] == ']')
1791 for (; s < send; s++) {
1792 last_un_char = un_char;
1793 un_char = (unsigned char)*s;
1798 weight -= seen[un_char] * 10;
1799 if (isALNUM_lazy_if(s+1,UTF)) {
1800 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1801 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1806 else if (*s == '$' && s[1] &&
1807 strchr("[#!%*<>()-=",s[1])) {
1808 if (/*{*/ strchr("])} =",s[2]))
1817 if (strchr("wds]",s[1]))
1819 else if (seen['\''] || seen['"'])
1821 else if (strchr("rnftbxcav",s[1]))
1823 else if (isDIGIT(s[1])) {
1825 while (s[1] && isDIGIT(s[1]))
1835 if (strchr("aA01! ",last_un_char))
1837 if (strchr("zZ79~",s[1]))
1839 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1840 weight -= 5; /* cope with negative subscript */
1843 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1844 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1849 if (keyword(tmpbuf, d - tmpbuf))
1852 if (un_char == last_un_char + 1)
1854 weight -= seen[un_char];
1859 if (weight >= 0) /* probably a character class */
1869 * Does all the checking to disambiguate
1871 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1872 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1874 * First argument is the stuff after the first token, e.g. "bar".
1876 * Not a method if bar is a filehandle.
1877 * Not a method if foo is a subroutine prototyped to take a filehandle.
1878 * Not a method if it's really "Foo $bar"
1879 * Method if it's "foo $bar"
1880 * Not a method if it's really "print foo $bar"
1881 * Method if it's really "foo package::" (interpreted as package->foo)
1882 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1883 * Not a method if bar is a filehandle or package, but is quoted with
1888 S_intuit_method(pTHX_ char *start, GV *gv)
1890 char *s = start + (*start == '$');
1891 char tmpbuf[sizeof PL_tokenbuf];
1899 if ((cv = GvCVu(gv))) {
1900 char *proto = SvPVX(cv);
1910 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1911 /* start is the beginning of the possible filehandle/object,
1912 * and s is the end of it
1913 * tmpbuf is a copy of it
1916 if (*start == '$') {
1917 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1922 return *s == '(' ? FUNCMETH : METHOD;
1924 if (!keyword(tmpbuf, len)) {
1925 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1930 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1931 if (indirgv && GvCVu(indirgv))
1933 /* filehandle or package name makes it a method */
1934 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1936 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1937 return 0; /* no assumptions -- "=>" quotes bearword */
1939 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1940 newSVpvn(tmpbuf,len));
1941 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1945 return *s == '(' ? FUNCMETH : METHOD;
1953 * Return a string of Perl code to load the debugger. If PERL5DB
1954 * is set, it will return the contents of that, otherwise a
1955 * compile-time require of perl5db.pl.
1962 char *pdb = PerlEnv_getenv("PERL5DB");
1966 SETERRNO(0,SS_NORMAL);
1967 return "BEGIN { require 'perl5db.pl' }";
1973 /* Encoded script support. filter_add() effectively inserts a
1974 * 'pre-processing' function into the current source input stream.
1975 * Note that the filter function only applies to the current source file
1976 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1978 * The datasv parameter (which may be NULL) can be used to pass
1979 * private data to this instance of the filter. The filter function
1980 * can recover the SV using the FILTER_DATA macro and use it to
1981 * store private buffers and state information.
1983 * The supplied datasv parameter is upgraded to a PVIO type
1984 * and the IoDIRP/IoANY field is used to store the function pointer,
1985 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1986 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1987 * private use must be set using malloc'd pointers.
1991 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1996 if (!PL_rsfp_filters)
1997 PL_rsfp_filters = newAV();
1999 datasv = NEWSV(255,0);
2000 if (!SvUPGRADE(datasv, SVt_PVIO))
2001 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2002 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2003 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2004 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2005 (void*)funcp, SvPV_nolen(datasv)));
2006 av_unshift(PL_rsfp_filters, 1);
2007 av_store(PL_rsfp_filters, 0, datasv) ;
2012 /* Delete most recently added instance of this filter function. */
2014 Perl_filter_del(pTHX_ filter_t funcp)
2017 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2018 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2020 /* if filter is on top of stack (usual case) just pop it off */
2021 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2022 if (IoANY(datasv) == (void *)funcp) {
2023 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2024 IoANY(datasv) = (void *)NULL;
2025 sv_free(av_pop(PL_rsfp_filters));
2029 /* we need to search for the correct entry and clear it */
2030 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2034 /* Invoke the n'th filter function for the current rsfp. */
2036 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2039 /* 0 = read one text line */
2044 if (!PL_rsfp_filters)
2046 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2047 /* Provide a default input filter to make life easy. */
2048 /* Note that we append to the line. This is handy. */
2049 DEBUG_P(PerlIO_printf(Perl_debug_log,
2050 "filter_read %d: from rsfp\n", idx));
2054 int old_len = SvCUR(buf_sv) ;
2056 /* ensure buf_sv is large enough */
2057 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2058 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2059 if (PerlIO_error(PL_rsfp))
2060 return -1; /* error */
2062 return 0 ; /* end of file */
2064 SvCUR_set(buf_sv, old_len + len) ;
2067 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2068 if (PerlIO_error(PL_rsfp))
2069 return -1; /* error */
2071 return 0 ; /* end of file */
2074 return SvCUR(buf_sv);
2076 /* Skip this filter slot if filter has been deleted */
2077 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2078 DEBUG_P(PerlIO_printf(Perl_debug_log,
2079 "filter_read %d: skipped (filter deleted)\n",
2081 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2083 /* Get function pointer hidden within datasv */
2084 funcp = (filter_t)IoANY(datasv);
2085 DEBUG_P(PerlIO_printf(Perl_debug_log,
2086 "filter_read %d: via function %p (%s)\n",
2087 idx, (void*)funcp, SvPV_nolen(datasv)));
2088 /* Call function. The function is expected to */
2089 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2090 /* Return: <0:error, =0:eof, >0:not eof */
2091 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2095 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2097 #ifdef PERL_CR_FILTER
2098 if (!PL_rsfp_filters) {
2099 filter_add(S_cr_textfilter,NULL);
2102 if (PL_rsfp_filters) {
2105 SvCUR_set(sv, 0); /* start with empty line */
2106 if (FILTER_READ(0, sv, 0) > 0)
2107 return ( SvPVX(sv) ) ;
2112 return (sv_gets(sv, fp, append));
2116 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2120 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2124 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2125 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2127 return GvHV(gv); /* Foo:: */
2130 /* use constant CLASS => 'MyClass' */
2131 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2133 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2134 pkgname = SvPV_nolen(sv);
2138 return gv_stashpv(pkgname, FALSE);
2142 static char* exp_name[] =
2143 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2144 "ATTRTERM", "TERMBLOCK"
2151 Works out what to call the token just pulled out of the input
2152 stream. The yacc parser takes care of taking the ops we return and
2153 stitching them into a tree.
2159 if read an identifier
2160 if we're in a my declaration
2161 croak if they tried to say my($foo::bar)
2162 build the ops for a my() declaration
2163 if it's an access to a my() variable
2164 are we in a sort block?
2165 croak if my($a); $a <=> $b
2166 build ops for access to a my() variable
2167 if in a dq string, and they've said @foo and we can't find @foo
2169 build ops for a bareword
2170 if we already built the token before, use it.
2173 #ifdef USE_PURE_BISON
2175 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2180 yylval_pointer[yyactlevel] = lvalp;
2181 yychar_pointer[yyactlevel] = lcharp;
2182 if (yyactlevel >= YYMAXLEVEL)
2183 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2185 r = Perl_yylex(aTHX);
2195 #pragma segment Perl_yylex
2207 I32 orig_keyword = 0;
2209 /* check if there's an identifier for us to look at */
2210 if (PL_pending_ident)
2211 return S_pending_ident(aTHX);
2213 /* no identifier pending identification */
2215 switch (PL_lex_state) {
2217 case LEX_NORMAL: /* Some compilers will produce faster */
2218 case LEX_INTERPNORMAL: /* code if we comment these out. */
2222 /* when we've already built the next token, just pull it out of the queue */
2225 yylval = PL_nextval[PL_nexttoke];
2227 PL_lex_state = PL_lex_defer;
2228 PL_expect = PL_lex_expect;
2229 PL_lex_defer = LEX_NORMAL;
2231 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2232 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2233 (IV)PL_nexttype[PL_nexttoke]); });
2235 return(PL_nexttype[PL_nexttoke]);
2237 /* interpolated case modifiers like \L \U, including \Q and \E.
2238 when we get here, PL_bufptr is at the \
2240 case LEX_INTERPCASEMOD:
2242 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2243 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2245 /* handle \E or end of string */
2246 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2250 if (PL_lex_casemods) {
2251 oldmod = PL_lex_casestack[--PL_lex_casemods];
2252 PL_lex_casestack[PL_lex_casemods] = '\0';
2254 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2256 PL_lex_state = LEX_INTERPCONCAT;
2260 if (PL_bufptr != PL_bufend)
2262 PL_lex_state = LEX_INTERPCONCAT;
2266 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2267 "### Saw case modifier at '%s'\n", PL_bufptr); });
2269 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2270 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2271 if (strchr("LU", *s) &&
2272 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2274 PL_lex_casestack[--PL_lex_casemods] = '\0';
2277 if (PL_lex_casemods > 10) {
2278 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2280 PL_lex_casestack[PL_lex_casemods++] = *s;
2281 PL_lex_casestack[PL_lex_casemods] = '\0';
2282 PL_lex_state = LEX_INTERPCONCAT;
2283 PL_nextval[PL_nexttoke].ival = 0;
2286 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2288 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2290 PL_nextval[PL_nexttoke].ival = OP_LC;
2292 PL_nextval[PL_nexttoke].ival = OP_UC;
2294 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2296 Perl_croak(aTHX_ "panic: yylex");
2299 if (PL_lex_starts) {
2308 case LEX_INTERPPUSH:
2309 return sublex_push();
2311 case LEX_INTERPSTART:
2312 if (PL_bufptr == PL_bufend)
2313 return sublex_done();
2314 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2315 "### Interpolated variable at '%s'\n", PL_bufptr); });
2317 PL_lex_dojoin = (*PL_bufptr == '@');
2318 PL_lex_state = LEX_INTERPNORMAL;
2319 if (PL_lex_dojoin) {
2320 PL_nextval[PL_nexttoke].ival = 0;
2322 force_ident("\"", '$');
2323 PL_nextval[PL_nexttoke].ival = 0;
2325 PL_nextval[PL_nexttoke].ival = 0;
2327 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2330 if (PL_lex_starts++) {
2336 case LEX_INTERPENDMAYBE:
2337 if (intuit_more(PL_bufptr)) {
2338 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2344 if (PL_lex_dojoin) {
2345 PL_lex_dojoin = FALSE;
2346 PL_lex_state = LEX_INTERPCONCAT;
2349 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2350 && SvEVALED(PL_lex_repl))
2352 if (PL_bufptr != PL_bufend)
2353 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2354 PL_lex_repl = Nullsv;
2357 case LEX_INTERPCONCAT:
2359 if (PL_lex_brackets)
2360 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2362 if (PL_bufptr == PL_bufend)
2363 return sublex_done();
2365 if (SvIVX(PL_linestr) == '\'') {
2366 SV *sv = newSVsv(PL_linestr);
2369 else if ( PL_hints & HINT_NEW_RE )
2370 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2371 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2375 s = scan_const(PL_bufptr);
2377 PL_lex_state = LEX_INTERPCASEMOD;
2379 PL_lex_state = LEX_INTERPSTART;
2382 if (s != PL_bufptr) {
2383 PL_nextval[PL_nexttoke] = yylval;
2386 if (PL_lex_starts++)
2396 PL_lex_state = LEX_NORMAL;
2397 s = scan_formline(PL_bufptr);
2398 if (!PL_lex_formbrack)
2404 PL_oldoldbufptr = PL_oldbufptr;
2407 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2408 exp_name[PL_expect], s);
2414 if (isIDFIRST_lazy_if(s,UTF))
2416 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2419 goto fake_eof; /* emulate EOF on ^D or ^Z */
2424 if (PL_lex_brackets)
2425 yyerror("Missing right curly or square bracket");
2426 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2427 "### Tokener got EOF\n");
2431 if (s++ < PL_bufend)
2432 goto retry; /* ignore stray nulls */
2435 if (!PL_in_eval && !PL_preambled) {
2436 PL_preambled = TRUE;
2437 sv_setpv(PL_linestr,incl_perldb());
2438 if (SvCUR(PL_linestr))
2439 sv_catpv(PL_linestr,";");
2441 while(AvFILLp(PL_preambleav) >= 0) {
2442 SV *tmpsv = av_shift(PL_preambleav);
2443 sv_catsv(PL_linestr, tmpsv);
2444 sv_catpv(PL_linestr, ";");
2447 sv_free((SV*)PL_preambleav);
2448 PL_preambleav = NULL;
2450 if (PL_minus_n || PL_minus_p) {
2451 sv_catpv(PL_linestr, "LINE: while (<>) {");
2453 sv_catpv(PL_linestr,"chomp;");
2456 if (strchr("/'\"", *PL_splitstr)
2457 && strchr(PL_splitstr + 1, *PL_splitstr))
2458 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2461 s = "'~#\200\1'"; /* surely one char is unused...*/
2462 while (s[1] && strchr(PL_splitstr, *s)) s++;
2464 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2465 "q" + (delim == '\''), delim);
2466 for (s = PL_splitstr; *s; s++) {
2468 sv_catpvn(PL_linestr, "\\", 1);
2469 sv_catpvn(PL_linestr, s, 1);
2471 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2475 sv_catpv(PL_linestr,"our @F=split(' ');");
2478 sv_catpv(PL_linestr, "\n");
2479 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2480 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2481 PL_last_lop = PL_last_uni = Nullch;
2482 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2483 SV *sv = NEWSV(85,0);
2485 sv_upgrade(sv, SVt_PVMG);
2486 sv_setsv(sv,PL_linestr);
2489 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2494 bof = PL_rsfp ? TRUE : FALSE;
2495 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2498 if (PL_preprocess && !PL_in_eval)
2499 (void)PerlProc_pclose(PL_rsfp);
2500 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2501 PerlIO_clearerr(PL_rsfp);
2503 (void)PerlIO_close(PL_rsfp);
2505 PL_doextract = FALSE;
2507 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2508 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2509 sv_catpv(PL_linestr,";}");
2510 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2511 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2512 PL_last_lop = PL_last_uni = Nullch;
2513 PL_minus_n = PL_minus_p = 0;
2516 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2517 PL_last_lop = PL_last_uni = Nullch;
2518 sv_setpv(PL_linestr,"");
2519 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2521 /* if it looks like the start of a BOM, check if it in fact is */
2522 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2523 #ifdef PERLIO_IS_STDIO
2524 # ifdef __GNU_LIBRARY__
2525 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2526 # define FTELL_FOR_PIPE_IS_BROKEN
2530 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2531 # define FTELL_FOR_PIPE_IS_BROKEN
2536 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2537 /* This loses the possibility to detect the bof
2538 * situation on perl -P when the libc5 is being used.
2539 * Workaround? Maybe attach some extra state to PL_rsfp?
2542 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2544 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2547 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2548 s = swallow_bom((U8*)s);
2552 /* Incest with pod. */
2553 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2554 sv_setpv(PL_linestr, "");
2555 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2556 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2557 PL_last_lop = PL_last_uni = Nullch;
2558 PL_doextract = FALSE;
2562 } while (PL_doextract);
2563 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2564 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2565 SV *sv = NEWSV(85,0);
2567 sv_upgrade(sv, SVt_PVMG);
2568 sv_setsv(sv,PL_linestr);
2571 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2573 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2574 PL_last_lop = PL_last_uni = Nullch;
2575 if (CopLINE(PL_curcop) == 1) {
2576 while (s < PL_bufend && isSPACE(*s))
2578 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2582 if (*s == '#' && *(s+1) == '!')
2584 #ifdef ALTERNATE_SHEBANG
2586 static char as[] = ALTERNATE_SHEBANG;
2587 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2588 d = s + (sizeof(as) - 1);
2590 #endif /* ALTERNATE_SHEBANG */
2599 while (*d && !isSPACE(*d))
2603 #ifdef ARG_ZERO_IS_SCRIPT
2604 if (ipathend > ipath) {
2606 * HP-UX (at least) sets argv[0] to the script name,
2607 * which makes $^X incorrect. And Digital UNIX and Linux,
2608 * at least, set argv[0] to the basename of the Perl
2609 * interpreter. So, having found "#!", we'll set it right.
2611 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2612 assert(SvPOK(x) || SvGMAGICAL(x));
2613 if (sv_eq(x, CopFILESV(PL_curcop))) {
2614 sv_setpvn(x, ipath, ipathend - ipath);
2620 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2621 char *lstart = SvPV(x,llen);
2623 bstart += blen - llen;
2624 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2625 sv_setpvn(x, ipath, ipathend - ipath);
2630 TAINT_NOT; /* $^X is always tainted, but that's OK */
2632 #endif /* ARG_ZERO_IS_SCRIPT */
2637 d = instr(s,"perl -");
2639 d = instr(s,"perl");
2641 /* avoid getting into infinite loops when shebang
2642 * line contains "Perl" rather than "perl" */
2644 for (d = ipathend-4; d >= ipath; --d) {
2645 if ((*d == 'p' || *d == 'P')
2646 && !ibcmp(d, "perl", 4))
2656 #ifdef ALTERNATE_SHEBANG
2658 * If the ALTERNATE_SHEBANG on this system starts with a
2659 * character that can be part of a Perl expression, then if
2660 * we see it but not "perl", we're probably looking at the
2661 * start of Perl code, not a request to hand off to some
2662 * other interpreter. Similarly, if "perl" is there, but
2663 * not in the first 'word' of the line, we assume the line
2664 * contains the start of the Perl program.
2666 if (d && *s != '#') {
2668 while (*c && !strchr("; \t\r\n\f\v#", *c))
2671 d = Nullch; /* "perl" not in first word; ignore */
2673 *s = '#'; /* Don't try to parse shebang line */
2675 #endif /* ALTERNATE_SHEBANG */
2676 #ifndef MACOS_TRADITIONAL
2681 !instr(s,"indir") &&
2682 instr(PL_origargv[0],"perl"))
2688 while (s < PL_bufend && isSPACE(*s))
2690 if (s < PL_bufend) {
2691 Newz(899,newargv,PL_origargc+3,char*);
2693 while (s < PL_bufend && !isSPACE(*s))
2696 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2699 newargv = PL_origargv;
2701 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2702 Perl_croak(aTHX_ "Can't exec %s", ipath);
2706 U32 oldpdb = PL_perldb;
2707 bool oldn = PL_minus_n;
2708 bool oldp = PL_minus_p;
2710 while (*d && !isSPACE(*d)) d++;
2711 while (SPACE_OR_TAB(*d)) d++;
2714 bool switches_done = PL_doswitches;
2716 if (*d == 'M' || *d == 'm') {
2718 while (*d && !isSPACE(*d)) d++;
2719 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2722 d = moreswitches(d);
2724 if ((PERLDB_LINE && !oldpdb) ||
2725 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2726 /* if we have already added "LINE: while (<>) {",
2727 we must not do it again */
2729 sv_setpv(PL_linestr, "");
2730 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2731 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2732 PL_last_lop = PL_last_uni = Nullch;
2733 PL_preambled = FALSE;
2735 (void)gv_fetchfile(PL_origfilename);
2738 if (PL_doswitches && !switches_done) {
2739 int argc = PL_origargc;
2740 char **argv = PL_origargv;
2743 } while (argc && argv[0][0] == '-' && argv[0][1]);
2744 init_argv_symbols(argc,argv);
2750 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2752 PL_lex_state = LEX_FORMLINE;
2757 #ifdef PERL_STRICT_CR
2758 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2760 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2762 case ' ': case '\t': case '\f': case 013:
2763 #ifdef MACOS_TRADITIONAL
2770 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2771 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2772 /* handle eval qq[#line 1 "foo"\n ...] */
2773 CopLINE_dec(PL_curcop);
2777 while (s < d && *s != '\n')
2781 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2782 Perl_croak(aTHX_ "panic: input overflow");
2784 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2786 PL_lex_state = LEX_FORMLINE;
2796 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2803 while (s < PL_bufend && SPACE_OR_TAB(*s))
2806 if (strnEQ(s,"=>",2)) {
2807 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2808 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2809 "### Saw unary minus before =>, forcing word '%s'\n", s);
2811 OPERATOR('-'); /* unary minus */
2813 PL_last_uni = PL_oldbufptr;
2815 case 'r': ftst = OP_FTEREAD; break;
2816 case 'w': ftst = OP_FTEWRITE; break;
2817 case 'x': ftst = OP_FTEEXEC; break;
2818 case 'o': ftst = OP_FTEOWNED; break;
2819 case 'R': ftst = OP_FTRREAD; break;
2820 case 'W': ftst = OP_FTRWRITE; break;
2821 case 'X': ftst = OP_FTREXEC; break;
2822 case 'O': ftst = OP_FTROWNED; break;
2823 case 'e': ftst = OP_FTIS; break;
2824 case 'z': ftst = OP_FTZERO; break;
2825 case 's': ftst = OP_FTSIZE; break;
2826 case 'f': ftst = OP_FTFILE; break;
2827 case 'd': ftst = OP_FTDIR; break;
2828 case 'l': ftst = OP_FTLINK; break;
2829 case 'p': ftst = OP_FTPIPE; break;
2830 case 'S': ftst = OP_FTSOCK; break;
2831 case 'u': ftst = OP_FTSUID; break;
2832 case 'g': ftst = OP_FTSGID; break;
2833 case 'k': ftst = OP_FTSVTX; break;
2834 case 'b': ftst = OP_FTBLK; break;
2835 case 'c': ftst = OP_FTCHR; break;
2836 case 't': ftst = OP_FTTTY; break;
2837 case 'T': ftst = OP_FTTEXT; break;
2838 case 'B': ftst = OP_FTBINARY; break;
2839 case 'M': case 'A': case 'C':
2840 gv_fetchpv("\024",TRUE, SVt_PV);
2842 case 'M': ftst = OP_FTMTIME; break;
2843 case 'A': ftst = OP_FTATIME; break;
2844 case 'C': ftst = OP_FTCTIME; break;
2852 PL_last_lop_op = (OPCODE)ftst;
2853 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2854 "### Saw file test %c\n", (int)ftst);
2859 /* Assume it was a minus followed by a one-letter named
2860 * subroutine call (or a -bareword), then. */
2861 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2862 "### %c looked like a file test but was not\n",
2871 if (PL_expect == XOPERATOR)
2876 else if (*s == '>') {
2879 if (isIDFIRST_lazy_if(s,UTF)) {
2880 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2888 if (PL_expect == XOPERATOR)
2891 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2893 OPERATOR('-'); /* unary minus */
2900 if (PL_expect == XOPERATOR)
2905 if (PL_expect == XOPERATOR)
2908 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2914 if (PL_expect != XOPERATOR) {
2915 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2916 PL_expect = XOPERATOR;
2917 force_ident(PL_tokenbuf, '*');
2930 if (PL_expect == XOPERATOR) {
2934 PL_tokenbuf[0] = '%';
2935 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2936 if (!PL_tokenbuf[1]) {
2938 yyerror("Final % should be \\% or %name");
2941 PL_pending_ident = '%';
2960 switch (PL_expect) {
2963 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2965 PL_bufptr = s; /* update in case we back off */
2971 PL_expect = XTERMBLOCK;
2975 while (isIDFIRST_lazy_if(s,UTF)) {
2976 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2977 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2978 if (tmp < 0) tmp = -tmp;
2994 d = scan_str(d,TRUE,TRUE);
2996 /* MUST advance bufptr here to avoid bogus
2997 "at end of line" context messages from yyerror().
2999 PL_bufptr = s + len;
3000 yyerror("Unterminated attribute parameter in attribute list");
3003 return 0; /* EOF indicator */
3007 SV *sv = newSVpvn(s, len);
3008 sv_catsv(sv, PL_lex_stuff);
3009 attrs = append_elem(OP_LIST, attrs,
3010 newSVOP(OP_CONST, 0, sv));
3011 SvREFCNT_dec(PL_lex_stuff);
3012 PL_lex_stuff = Nullsv;
3015 /* NOTE: any CV attrs applied here need to be part of
3016 the CVf_BUILTIN_ATTRS define in cv.h! */
3017 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3018 CvLVALUE_on(PL_compcv);
3019 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3020 CvLOCKED_on(PL_compcv);
3021 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3022 CvMETHOD_on(PL_compcv);
3024 else if (PL_in_my == KEY_our && len == 6 &&
3025 strnEQ(s, "unique", len))
3026 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3028 /* After we've set the flags, it could be argued that
3029 we don't need to do the attributes.pm-based setting
3030 process, and shouldn't bother appending recognized
3031 flags. To experiment with that, uncomment the
3032 following "else". (Note that's already been
3033 uncommented. That keeps the above-applied built-in
3034 attributes from being intercepted (and possibly
3035 rejected) by a package's attribute routines, but is
3036 justified by the performance win for the common case
3037 of applying only built-in attributes.) */
3039 attrs = append_elem(OP_LIST, attrs,
3040 newSVOP(OP_CONST, 0,
3044 if (*s == ':' && s[1] != ':')
3047 break; /* require real whitespace or :'s */
3049 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3050 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3051 char q = ((*s == '\'') ? '"' : '\'');
3052 /* If here for an expression, and parsed no attrs, back off. */
3053 if (tmp == '=' && !attrs) {
3057 /* MUST advance bufptr here to avoid bogus "at end of line"
3058 context messages from yyerror().
3062 yyerror("Unterminated attribute list");
3064 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3072 PL_nextval[PL_nexttoke].opval = attrs;
3080 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3081 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3097 if (PL_lex_brackets <= 0)
3098 yyerror("Unmatched right square bracket");
3101 if (PL_lex_state == LEX_INTERPNORMAL) {
3102 if (PL_lex_brackets == 0) {
3103 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3104 PL_lex_state = LEX_INTERPEND;
3111 if (PL_lex_brackets > 100) {
3112 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3114 switch (PL_expect) {
3116 if (PL_lex_formbrack) {
3120 if (PL_oldoldbufptr == PL_last_lop)
3121 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3123 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3124 OPERATOR(HASHBRACK);
3126 while (s < PL_bufend && SPACE_OR_TAB(*s))
3129 PL_tokenbuf[0] = '\0';
3130 if (d < PL_bufend && *d == '-') {
3131 PL_tokenbuf[0] = '-';
3133 while (d < PL_bufend && SPACE_OR_TAB(*d))
3136 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3137 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3139 while (d < PL_bufend && SPACE_OR_TAB(*d))
3142 char minus = (PL_tokenbuf[0] == '-');
3143 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3151 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3156 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3161 if (PL_oldoldbufptr == PL_last_lop)
3162 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3164 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3167 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3169 /* This hack is to get the ${} in the message. */
3171 yyerror("syntax error");
3174 OPERATOR(HASHBRACK);
3176 /* This hack serves to disambiguate a pair of curlies
3177 * as being a block or an anon hash. Normally, expectation
3178 * determines that, but in cases where we're not in a
3179 * position to expect anything in particular (like inside
3180 * eval"") we have to resolve the ambiguity. This code
3181 * covers the case where the first term in the curlies is a
3182 * quoted string. Most other cases need to be explicitly
3183 * disambiguated by prepending a `+' before the opening
3184 * curly in order to force resolution as an anon hash.
3186 * XXX should probably propagate the outer expectation
3187 * into eval"" to rely less on this hack, but that could
3188 * potentially break current behavior of eval"".
3192 if (*s == '\'' || *s == '"' || *s == '`') {
3193 /* common case: get past first string, handling escapes */
3194 for (t++; t < PL_bufend && *t != *s;)
3195 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3199 else if (*s == 'q') {
3202 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3206 char open, close, term;
3209 while (t < PL_bufend && isSPACE(*t))
3213 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3217 for (t++; t < PL_bufend; t++) {
3218 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3220 else if (*t == open)
3224 for (t++; t < PL_bufend; t++) {
3225 if (*t == '\\' && t+1 < PL_bufend)
3227 else if (*t == close && --brackets <= 0)
3229 else if (*t == open)
3235 else if (isALNUM_lazy_if(t,UTF)) {
3237 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3240 while (t < PL_bufend && isSPACE(*t))
3242 /* if comma follows first term, call it an anon hash */
3243 /* XXX it could be a comma expression with loop modifiers */
3244 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3245 || (*t == '=' && t[1] == '>')))
3246 OPERATOR(HASHBRACK);
3247 if (PL_expect == XREF)
3250 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3256 yylval.ival = CopLINE(PL_curcop);
3257 if (isSPACE(*s) || *s == '#')
3258 PL_copline = NOLINE; /* invalidate current command line number */
3263 if (PL_lex_brackets <= 0)
3264 yyerror("Unmatched right curly bracket");
3266 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3267 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3268 PL_lex_formbrack = 0;
3269 if (PL_lex_state == LEX_INTERPNORMAL) {
3270 if (PL_lex_brackets == 0) {
3271 if (PL_expect & XFAKEBRACK) {
3272 PL_expect &= XENUMMASK;
3273 PL_lex_state = LEX_INTERPEND;
3275 return yylex(); /* ignore fake brackets */
3277 if (*s == '-' && s[1] == '>')
3278 PL_lex_state = LEX_INTERPENDMAYBE;
3279 else if (*s != '[' && *s != '{')
3280 PL_lex_state = LEX_INTERPEND;
3283 if (PL_expect & XFAKEBRACK) {
3284 PL_expect &= XENUMMASK;
3286 return yylex(); /* ignore fake brackets */
3296 if (PL_expect == XOPERATOR) {
3297 if (ckWARN(WARN_SEMICOLON)
3298 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3300 CopLINE_dec(PL_curcop);
3301 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3302 CopLINE_inc(PL_curcop);
3307 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3309 PL_expect = XOPERATOR;
3310 force_ident(PL_tokenbuf, '&');
3314 yylval.ival = (OPpENTERSUB_AMPER<<8);
3333 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3334 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3336 if (PL_expect == XSTATE && isALPHA(tmp) &&
3337 (s == PL_linestart+1 || s[-2] == '\n') )
3339 if (PL_in_eval && !PL_rsfp) {
3344 if (strnEQ(s,"=cut",4)) {
3358 PL_doextract = TRUE;
3361 if (PL_lex_brackets < PL_lex_formbrack) {
3363 #ifdef PERL_STRICT_CR
3364 for (t = s; SPACE_OR_TAB(*t); t++) ;
3366 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3368 if (*t == '\n' || *t == '#') {
3386 if (PL_expect != XOPERATOR) {
3387 if (s[1] != '<' && !strchr(s,'>'))
3390 s = scan_heredoc(s);
3392 s = scan_inputsymbol(s);
3393 TERM(sublex_start());
3398 SHop(OP_LEFT_SHIFT);
3412 SHop(OP_RIGHT_SHIFT);
3421 if (PL_expect == XOPERATOR) {
3422 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3425 return ','; /* grandfather non-comma-format format */
3429 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3430 PL_tokenbuf[0] = '@';
3431 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3432 sizeof PL_tokenbuf - 1, FALSE);
3433 if (PL_expect == XOPERATOR)
3434 no_op("Array length", s);
3435 if (!PL_tokenbuf[1])
3437 PL_expect = XOPERATOR;
3438 PL_pending_ident = '#';
3442 PL_tokenbuf[0] = '$';
3443 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3444 sizeof PL_tokenbuf - 1, FALSE);
3445 if (PL_expect == XOPERATOR)
3447 if (!PL_tokenbuf[1]) {
3449 yyerror("Final $ should be \\$ or $name");
3453 /* This kludge not intended to be bulletproof. */
3454 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3455 yylval.opval = newSVOP(OP_CONST, 0,
3456 newSViv(PL_compiling.cop_arybase));
3457 yylval.opval->op_private = OPpCONST_ARYBASE;
3463 if (PL_lex_state == LEX_NORMAL)
3466 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3469 PL_tokenbuf[0] = '@';
3470 if (ckWARN(WARN_SYNTAX)) {
3472 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3475 PL_bufptr = skipspace(PL_bufptr);
3476 while (t < PL_bufend && *t != ']')
3478 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3479 "Multidimensional syntax %.*s not supported",
3480 (t - PL_bufptr) + 1, PL_bufptr);
3484 else if (*s == '{') {
3485 PL_tokenbuf[0] = '%';
3486 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3487 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3489 char tmpbuf[sizeof PL_tokenbuf];
3491 for (t++; isSPACE(*t); t++) ;
3492 if (isIDFIRST_lazy_if(t,UTF)) {
3493 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3494 for (; isSPACE(*t); t++) ;
3495 if (*t == ';' && get_cv(tmpbuf, FALSE))
3496 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3497 "You need to quote \"%s\"", tmpbuf);
3503 PL_expect = XOPERATOR;
3504 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3505 bool islop = (PL_last_lop == PL_oldoldbufptr);
3506 if (!islop || PL_last_lop_op == OP_GREPSTART)
3507 PL_expect = XOPERATOR;
3508 else if (strchr("$@\"'`q", *s))
3509 PL_expect = XTERM; /* e.g. print $fh "foo" */
3510 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3511 PL_expect = XTERM; /* e.g. print $fh &sub */
3512 else if (isIDFIRST_lazy_if(s,UTF)) {
3513 char tmpbuf[sizeof PL_tokenbuf];
3514 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3515 if ((tmp = keyword(tmpbuf, len))) {
3516 /* binary operators exclude handle interpretations */
3528 PL_expect = XTERM; /* e.g. print $fh length() */
3533 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3534 if (gv && GvCVu(gv))
3535 PL_expect = XTERM; /* e.g. print $fh subr() */
3538 else if (isDIGIT(*s))
3539 PL_expect = XTERM; /* e.g. print $fh 3 */
3540 else if (*s == '.' && isDIGIT(s[1]))
3541 PL_expect = XTERM; /* e.g. print $fh .3 */
3542 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3543 PL_expect = XTERM; /* e.g. print $fh -1 */
3544 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3545 PL_expect = XTERM; /* e.g. print $fh /.../
3546 XXX except DORDOR operator */
3547 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3548 PL_expect = XTERM; /* print $fh <<"EOF" */
3550 PL_pending_ident = '$';
3554 if (PL_expect == XOPERATOR)
3556 PL_tokenbuf[0] = '@';
3557 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3558 if (!PL_tokenbuf[1]) {
3560 yyerror("Final @ should be \\@ or @name");
3563 if (PL_lex_state == LEX_NORMAL)
3565 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3567 PL_tokenbuf[0] = '%';
3569 /* Warn about @ where they meant $. */
3570 if (ckWARN(WARN_SYNTAX)) {
3571 if (*s == '[' || *s == '{') {
3573 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3575 if (*t == '}' || *t == ']') {
3577 PL_bufptr = skipspace(PL_bufptr);
3578 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3579 "Scalar value %.*s better written as $%.*s",
3580 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3585 PL_pending_ident = '@';
3588 case '/': /* may be division, defined-or, or pattern */
3589 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3593 case '?': /* may either be conditional or pattern */
3594 if(PL_expect == XOPERATOR) {
3602 /* A // operator. */
3612 /* Disable warning on "study /blah/" */
3613 if (PL_oldoldbufptr == PL_last_uni
3614 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3615 || memNE(PL_last_uni, "study", 5)
3616 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3619 s = scan_pat(s,OP_MATCH);
3620 TERM(sublex_start());
3624 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3625 #ifdef PERL_STRICT_CR
3628 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3630 && (s == PL_linestart || s[-1] == '\n') )
3632 PL_lex_formbrack = 0;
3636 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3642 yylval.ival = OPf_SPECIAL;
3648 if (PL_expect != XOPERATOR)
3653 case '0': case '1': case '2': case '3': case '4':
3654 case '5': case '6': case '7': case '8': case '9':
3655 s = scan_num(s, &yylval);
3656 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3657 "### Saw number in '%s'\n", s);
3659 if (PL_expect == XOPERATOR)
3664 s = scan_str(s,FALSE,FALSE);
3665 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3666 "### Saw string before '%s'\n", s);
3668 if (PL_expect == XOPERATOR) {
3669 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3672 return ','; /* grandfather non-comma-format format */
3678 missingterm((char*)0);
3679 yylval.ival = OP_CONST;
3680 TERM(sublex_start());
3683 s = scan_str(s,FALSE,FALSE);
3684 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3685 "### Saw string before '%s'\n", s);
3687 if (PL_expect == XOPERATOR) {
3688 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3691 return ','; /* grandfather non-comma-format format */
3697 missingterm((char*)0);
3698 yylval.ival = OP_CONST;
3699 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3700 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3701 yylval.ival = OP_STRINGIFY;
3705 TERM(sublex_start());
3708 s = scan_str(s,FALSE,FALSE);
3709 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3710 "### Saw backtick string before '%s'\n", s);
3712 if (PL_expect == XOPERATOR)
3713 no_op("Backticks",s);
3715 missingterm((char*)0);
3716 yylval.ival = OP_BACKTICK;
3718 TERM(sublex_start());
3722 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3723 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3725 if (PL_expect == XOPERATOR)
3726 no_op("Backslash",s);
3730 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3734 while (isDIGIT(*start) || *start == '_')
3736 if (*start == '.' && isDIGIT(start[1])) {
3737 s = scan_num(s, &yylval);
3740 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3741 else if (!isALPHA(*start) && (PL_expect == XTERM
3742 || PL_expect == XREF || PL_expect == XSTATE
3743 || PL_expect == XTERMORDORDOR)) {
3747 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3750 s = scan_num(s, &yylval);
3757 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3797 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3799 /* Some keywords can be followed by any delimiter, including ':' */
3800 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3801 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3802 (PL_tokenbuf[0] == 'q' &&
3803 strchr("qwxr", PL_tokenbuf[1])))));
3805 /* x::* is just a word, unless x is "CORE" */
3806 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3810 while (d < PL_bufend && isSPACE(*d))
3811 d++; /* no comments skipped here, or s### is misparsed */
3813 /* Is this a label? */
3814 if (!tmp && PL_expect == XSTATE
3815 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3817 yylval.pval = savepv(PL_tokenbuf);
3822 /* Check for keywords */
3823 tmp = keyword(PL_tokenbuf, len);
3825 /* Is this a word before a => operator? */
3826 if (*d == '=' && d[1] == '>') {
3828 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3829 yylval.opval->op_private = OPpCONST_BARE;
3830 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3831 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3835 if (tmp < 0) { /* second-class keyword? */
3836 GV *ogv = Nullgv; /* override (winner) */
3837 GV *hgv = Nullgv; /* hidden (loser) */
3838 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3840 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3843 if (GvIMPORTED_CV(gv))
3845 else if (! CvMETHOD(cv))
3849 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3850 (gv = *gvp) != (GV*)&PL_sv_undef &&
3851 GvCVu(gv) && GvIMPORTED_CV(gv))
3858 tmp = 0; /* overridden by import or by GLOBAL */
3861 && -tmp==KEY_lock /* XXX generalizable kludge */
3863 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3865 tmp = 0; /* any sub overrides "weak" keyword */
3867 else { /* no override */
3869 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3870 Perl_warner(aTHX_ packWARN(WARN_MISC),
3871 "dump() better written as CORE::dump()");
3875 if (ckWARN(WARN_AMBIGUOUS) && hgv
3876 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3877 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3878 "Ambiguous call resolved as CORE::%s(), %s",
3879 GvENAME(hgv), "qualify as such or use &");
3886 default: /* not a keyword */
3890 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3892 /* Get the rest if it looks like a package qualifier */
3894 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3896 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3899 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3900 *s == '\'' ? "'" : "::");
3905 if (PL_expect == XOPERATOR) {
3906 if (PL_bufptr == PL_linestart) {
3907 CopLINE_dec(PL_curcop);
3908 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3909 CopLINE_inc(PL_curcop);
3912 no_op("Bareword",s);
3915 /* Look for a subroutine with this name in current package,
3916 unless name is "Foo::", in which case Foo is a bearword
3917 (and a package name). */
3920 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3922 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3923 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3924 "Bareword \"%s\" refers to nonexistent package",
3927 PL_tokenbuf[len] = '\0';
3934 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3937 /* if we saw a global override before, get the right name */
3940 sv = newSVpvn("CORE::GLOBAL::",14);
3941 sv_catpv(sv,PL_tokenbuf);
3944 sv = newSVpv(PL_tokenbuf,0);
3946 /* Presume this is going to be a bareword of some sort. */
3949 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3950 yylval.opval->op_private = OPpCONST_BARE;
3951 /* UTF-8 package name? */
3952 if (UTF && !IN_BYTES &&
3953 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3956 /* And if "Foo::", then that's what it certainly is. */
3961 /* See if it's the indirect object for a list operator. */
3963 if (PL_oldoldbufptr &&
3964 PL_oldoldbufptr < PL_bufptr &&
3965 (PL_oldoldbufptr == PL_last_lop
3966 || PL_oldoldbufptr == PL_last_uni) &&
3967 /* NO SKIPSPACE BEFORE HERE! */
3968 (PL_expect == XREF ||
3969 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3971 bool immediate_paren = *s == '(';
3973 /* (Now we can afford to cross potential line boundary.) */
3976 /* Two barewords in a row may indicate method call. */
3978 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3981 /* If not a declared subroutine, it's an indirect object. */
3982 /* (But it's an indir obj regardless for sort.) */
3984 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3985 ((!gv || !GvCVu(gv)) &&
3986 (PL_last_lop_op != OP_MAPSTART &&
3987 PL_last_lop_op != OP_GREPSTART))))
3989 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3994 PL_expect = XOPERATOR;
3997 /* Is this a word before a => operator? */
3998 if (*s == '=' && s[1] == '>' && !pkgname) {
4000 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4001 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4002 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4006 /* If followed by a paren, it's certainly a subroutine. */
4009 if (gv && GvCVu(gv)) {
4010 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4011 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4016 PL_nextval[PL_nexttoke].opval = yylval.opval;
4017 PL_expect = XOPERATOR;
4023 /* If followed by var or block, call it a method (unless sub) */
4025 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4026 PL_last_lop = PL_oldbufptr;
4027 PL_last_lop_op = OP_METHOD;
4031 /* If followed by a bareword, see if it looks like indir obj. */
4034 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4035 && (tmp = intuit_method(s,gv)))
4038 /* Not a method, so call it a subroutine (if defined) */
4040 if (gv && GvCVu(gv)) {
4042 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4043 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4044 "Ambiguous use of -%s resolved as -&%s()",
4045 PL_tokenbuf, PL_tokenbuf);
4046 /* Check for a constant sub */
4048 if ((sv = cv_const_sv(cv))) {
4050 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4051 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4052 yylval.opval->op_private = 0;
4056 /* Resolve to GV now. */
4057 op_free(yylval.opval);
4058 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4059 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4060 PL_last_lop = PL_oldbufptr;
4061 PL_last_lop_op = OP_ENTERSUB;
4062 /* Is there a prototype? */
4065 char *proto = SvPV((SV*)cv, len);
4068 if (strEQ(proto, "$"))
4070 if (*proto == '&' && *s == '{') {
4071 sv_setpv(PL_subname, PL_curstash ?
4072 "__ANON__" : "__ANON__::__ANON__");
4076 PL_nextval[PL_nexttoke].opval = yylval.opval;
4082 /* Call it a bare word */
4084 if (PL_hints & HINT_STRICT_SUBS)
4085 yylval.opval->op_private |= OPpCONST_STRICT;
4088 if (ckWARN(WARN_RESERVED)) {
4089 if (lastchar != '-') {
4090 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4091 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4092 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4099 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4100 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4101 "Operator or semicolon missing before %c%s",
4102 lastchar, PL_tokenbuf);
4103 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4104 "Ambiguous use of %c resolved as operator %c",
4105 lastchar, lastchar);
4111 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4112 newSVpv(CopFILE(PL_curcop),0));
4116 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4117 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4120 case KEY___PACKAGE__:
4121 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4123 ? newSVsv(PL_curstname)
4132 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4133 char *pname = "main";
4134 if (PL_tokenbuf[2] == 'D')
4135 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4136 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4139 GvIOp(gv) = newIO();
4140 IoIFP(GvIOp(gv)) = PL_rsfp;
4141 #if defined(HAS_FCNTL) && defined(F_SETFD)
4143 int fd = PerlIO_fileno(PL_rsfp);
4144 fcntl(fd,F_SETFD,fd >= 3);
4147 /* Mark this internal pseudo-handle as clean */
4148 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4150 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4151 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4152 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4154 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4155 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4156 /* if the script was opened in binmode, we need to revert
4157 * it to text mode for compatibility; but only iff it has CRs
4158 * XXX this is a questionable hack at best. */
4159 if (PL_bufend-PL_bufptr > 2
4160 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4163 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4164 loc = PerlIO_tell(PL_rsfp);
4165 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4168 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4170 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4171 #endif /* NETWARE */
4172 #ifdef PERLIO_IS_STDIO /* really? */
4173 # if defined(__BORLANDC__)
4174 /* XXX see note in do_binmode() */
4175 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4179 PerlIO_seek(PL_rsfp, loc, 0);
4183 #ifdef PERLIO_LAYERS
4184 if (UTF && !IN_BYTES)
4185 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4198 if (PL_expect == XSTATE) {
4205 if (*s == ':' && s[1] == ':') {
4208 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4209 if (!(tmp = keyword(PL_tokenbuf, len)))
4210 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4224 LOP(OP_ACCEPT,XTERM);
4230 LOP(OP_ATAN2,XTERM);
4236 LOP(OP_BINMODE,XTERM);
4239 LOP(OP_BLESS,XTERM);
4248 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4265 if (!PL_cryptseen) {
4266 PL_cryptseen = TRUE;
4270 LOP(OP_CRYPT,XTERM);
4273 LOP(OP_CHMOD,XTERM);
4276 LOP(OP_CHOWN,XTERM);
4279 LOP(OP_CONNECT,XTERM);
4295 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4299 PL_hints |= HINT_BLOCK_SCOPE;
4309 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4310 LOP(OP_DBMOPEN,XTERM);
4316 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4323 yylval.ival = CopLINE(PL_curcop);
4337 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4338 UNIBRACK(OP_ENTEREVAL);
4356 case KEY_endhostent:
4362 case KEY_endservent:
4365 case KEY_endprotoent:
4376 yylval.ival = CopLINE(PL_curcop);
4378 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4380 if ((PL_bufend - p) >= 3 &&
4381 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4383 else if ((PL_bufend - p) >= 4 &&
4384 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4387 if (isIDFIRST_lazy_if(p,UTF)) {
4388 p = scan_ident(p, PL_bufend,
4389 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4393 Perl_croak(aTHX_ "Missing $ on loop variable");
4398 LOP(OP_FORMLINE,XTERM);
4404 LOP(OP_FCNTL,XTERM);
4410 LOP(OP_FLOCK,XTERM);
4419 LOP(OP_GREPSTART, XREF);
4422 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4437 case KEY_getpriority:
4438 LOP(OP_GETPRIORITY,XTERM);
4440 case KEY_getprotobyname:
4443 case KEY_getprotobynumber:
4444 LOP(OP_GPBYNUMBER,XTERM);
4446 case KEY_getprotoent:
4458 case KEY_getpeername:
4459 UNI(OP_GETPEERNAME);
4461 case KEY_gethostbyname:
4464 case KEY_gethostbyaddr:
4465 LOP(OP_GHBYADDR,XTERM);
4467 case KEY_gethostent:
4470 case KEY_getnetbyname:
4473 case KEY_getnetbyaddr:
4474 LOP(OP_GNBYADDR,XTERM);
4479 case KEY_getservbyname:
4480 LOP(OP_GSBYNAME,XTERM);
4482 case KEY_getservbyport:
4483 LOP(OP_GSBYPORT,XTERM);
4485 case KEY_getservent:
4488 case KEY_getsockname:
4489 UNI(OP_GETSOCKNAME);
4491 case KEY_getsockopt:
4492 LOP(OP_GSOCKOPT,XTERM);
4514 yylval.ival = CopLINE(PL_curcop);
4518 LOP(OP_INDEX,XTERM);
4524 LOP(OP_IOCTL,XTERM);
4536 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4568 LOP(OP_LISTEN,XTERM);
4577 s = scan_pat(s,OP_MATCH);
4578 TERM(sublex_start());
4581 LOP(OP_MAPSTART, XREF);
4584 LOP(OP_MKDIR,XTERM);
4587 LOP(OP_MSGCTL,XTERM);
4590 LOP(OP_MSGGET,XTERM);
4593 LOP(OP_MSGRCV,XTERM);
4596 LOP(OP_MSGSND,XTERM);
4602 if (isIDFIRST_lazy_if(s,UTF)) {
4603 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4604 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4606 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4607 if (!PL_in_my_stash) {
4610 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4618 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4625 if (PL_expect != XSTATE)
4626 yyerror("\"no\" not allowed in expression");
4627 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4628 s = force_version(s, FALSE);
4633 if (*s == '(' || (s = skipspace(s), *s == '('))
4640 if (isIDFIRST_lazy_if(s,UTF)) {
4642 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4644 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4646 && !(t[0] == '=' && t[1] == '>')
4648 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4649 "Precedence problem: open %.*s should be open(%.*s)",
4650 d - s, s, d - s, s);
4656 yylval.ival = OP_OR;
4666 LOP(OP_OPEN_DIR,XTERM);
4669 checkcomma(s,PL_tokenbuf,"filehandle");
4673 checkcomma(s,PL_tokenbuf,"filehandle");
4692 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4696 LOP(OP_PIPE_OP,XTERM);
4699 s = scan_str(s,FALSE,FALSE);
4701 missingterm((char*)0);
4702 yylval.ival = OP_CONST;
4703 TERM(sublex_start());
4709 s = scan_str(s,FALSE,FALSE);
4711 missingterm((char*)0);
4713 if (SvCUR(PL_lex_stuff)) {
4716 d = SvPV_force(PL_lex_stuff, len);
4719 for (; isSPACE(*d) && len; --len, ++d) ;
4722 if (!warned && ckWARN(WARN_QW)) {
4723 for (; !isSPACE(*d) && len; --len, ++d) {
4725 Perl_warner(aTHX_ packWARN(WARN_QW),
4726 "Possible attempt to separate words with commas");
4729 else if (*d == '#') {
4730 Perl_warner(aTHX_ packWARN(WARN_QW),
4731 "Possible attempt to put comments in qw() list");
4737 for (; !isSPACE(*d) && len; --len, ++d) ;
4739 sv = newSVpvn(b, d-b);
4740 if (DO_UTF8(PL_lex_stuff))
4742 words = append_elem(OP_LIST, words,
4743 newSVOP(OP_CONST, 0, tokeq(sv)));
4747 PL_nextval[PL_nexttoke].opval = words;
4752 SvREFCNT_dec(PL_lex_stuff);
4753 PL_lex_stuff = Nullsv;
4759 s = scan_str(s,FALSE,FALSE);
4761 missingterm((char*)0);
4762 yylval.ival = OP_STRINGIFY;
4763 if (SvIVX(PL_lex_stuff) == '\'')
4764 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4765 TERM(sublex_start());
4768 s = scan_pat(s,OP_QR);
4769 TERM(sublex_start());
4772 s = scan_str(s,FALSE,FALSE);
4774 missingterm((char*)0);
4775 yylval.ival = OP_BACKTICK;
4777 TERM(sublex_start());
4785 s = force_version(s, FALSE);
4787 else if (*s != 'v' || !isDIGIT(s[1])
4788 || (s = force_version(s, TRUE), *s == 'v'))
4790 *PL_tokenbuf = '\0';
4791 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4792 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4793 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4795 yyerror("<> should be quotes");
4803 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4807 LOP(OP_RENAME,XTERM);
4816 LOP(OP_RINDEX,XTERM);
4826 UNIDOR(OP_READLINE);
4839 LOP(OP_REVERSE,XTERM);
4842 UNIDOR(OP_READLINK);
4850 TERM(sublex_start());
4852 TOKEN(1); /* force error */
4861 LOP(OP_SELECT,XTERM);
4867 LOP(OP_SEMCTL,XTERM);
4870 LOP(OP_SEMGET,XTERM);
4873 LOP(OP_SEMOP,XTERM);
4879 LOP(OP_SETPGRP,XTERM);
4881 case KEY_setpriority:
4882 LOP(OP_SETPRIORITY,XTERM);
4884 case KEY_sethostent:
4890 case KEY_setservent:
4893 case KEY_setprotoent:
4903 LOP(OP_SEEKDIR,XTERM);
4905 case KEY_setsockopt:
4906 LOP(OP_SSOCKOPT,XTERM);
4912 LOP(OP_SHMCTL,XTERM);
4915 LOP(OP_SHMGET,XTERM);
4918 LOP(OP_SHMREAD,XTERM);
4921 LOP(OP_SHMWRITE,XTERM);
4924 LOP(OP_SHUTDOWN,XTERM);
4933 LOP(OP_SOCKET,XTERM);
4935 case KEY_socketpair:
4936 LOP(OP_SOCKPAIR,XTERM);
4939 checkcomma(s,PL_tokenbuf,"subroutine name");
4941 if (*s == ';' || *s == ')') /* probably a close */
4942 Perl_croak(aTHX_ "sort is now a reserved word");
4944 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4948 LOP(OP_SPLIT,XTERM);
4951 LOP(OP_SPRINTF,XTERM);
4954 LOP(OP_SPLICE,XTERM);
4969 LOP(OP_SUBSTR,XTERM);
4975 char tmpbuf[sizeof PL_tokenbuf];
4976 SSize_t tboffset = 0;
4977 expectation attrful;
4978 bool have_name, have_proto, bad_proto;
4983 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4984 (*s == ':' && s[1] == ':'))
4987 attrful = XATTRBLOCK;
4988 /* remember buffer pos'n for later force_word */
4989 tboffset = s - PL_oldbufptr;
4990 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4991 if (strchr(tmpbuf, ':'))
4992 sv_setpv(PL_subname, tmpbuf);
4994 sv_setsv(PL_subname,PL_curstname);
4995 sv_catpvn(PL_subname,"::",2);
4996 sv_catpvn(PL_subname,tmpbuf,len);
5003 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5004 PL_expect = XTERMBLOCK;
5005 attrful = XATTRTERM;
5006 sv_setpv(PL_subname,"?");
5010 if (key == KEY_format) {
5012 PL_lex_formbrack = PL_lex_brackets + 1;
5014 (void) force_word(PL_oldbufptr + tboffset, WORD,
5019 /* Look for a prototype */
5023 s = scan_str(s,FALSE,FALSE);
5025 Perl_croak(aTHX_ "Prototype not terminated");
5026 /* strip spaces and check for bad characters */
5027 d = SvPVX(PL_lex_stuff);
5030 for (p = d; *p; ++p) {
5033 if (!strchr("$@%*;[]&\\", *p))
5038 if (bad_proto && ckWARN(WARN_SYNTAX))
5039 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5040 "Illegal character in prototype for %"SVf" : %s",
5042 SvCUR(PL_lex_stuff) = tmp;
5050 if (*s == ':' && s[1] != ':')
5051 PL_expect = attrful;
5052 else if (!have_name && *s != '{' && key == KEY_sub)
5053 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5056 PL_nextval[PL_nexttoke].opval =
5057 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5058 PL_lex_stuff = Nullsv;
5062 sv_setpv(PL_subname,
5063 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5066 (void) force_word(PL_oldbufptr + tboffset, WORD,
5075 LOP(OP_SYSTEM,XREF);
5078 LOP(OP_SYMLINK,XTERM);
5081 LOP(OP_SYSCALL,XTERM);
5084 LOP(OP_SYSOPEN,XTERM);
5087 LOP(OP_SYSSEEK,XTERM);
5090 LOP(OP_SYSREAD,XTERM);
5093 LOP(OP_SYSWRITE,XTERM);
5097 TERM(sublex_start());
5118 LOP(OP_TRUNCATE,XTERM);
5130 yylval.ival = CopLINE(PL_curcop);
5134 yylval.ival = CopLINE(PL_curcop);
5138 LOP(OP_UNLINK,XTERM);
5144 LOP(OP_UNPACK,XTERM);
5147 LOP(OP_UTIME,XTERM);
5153 LOP(OP_UNSHIFT,XTERM);
5156 if (PL_expect != XSTATE)
5157 yyerror("\"use\" not allowed in expression");
5159 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5160 s = force_version(s, TRUE);
5161 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5162 PL_nextval[PL_nexttoke].opval = Nullop;
5165 else if (*s == 'v') {
5166 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5167 s = force_version(s, FALSE);
5171 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5172 s = force_version(s, FALSE);
5184 yylval.ival = CopLINE(PL_curcop);
5188 PL_hints |= HINT_BLOCK_SCOPE;
5195 LOP(OP_WAITPID,XTERM);
5204 ctl_l[0] = toCTRL('L');
5206 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5209 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5214 if (PL_expect == XOPERATOR)
5220 yylval.ival = OP_XOR;
5225 TERM(sublex_start());
5230 #pragma segment Main
5234 S_pending_ident(pTHX)
5238 /* pit holds the identifier we read and pending_ident is reset */
5239 char pit = PL_pending_ident;
5240 PL_pending_ident = 0;
5242 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5243 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5245 /* if we're in a my(), we can't allow dynamics here.
5246 $foo'bar has already been turned into $foo::bar, so
5247 just check for colons.
5249 if it's a legal name, the OP is a PADANY.
5252 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5253 if (strchr(PL_tokenbuf,':'))
5254 yyerror(Perl_form(aTHX_ "No package name allowed for "
5255 "variable %s in \"our\"",
5257 tmp = allocmy(PL_tokenbuf);
5260 if (strchr(PL_tokenbuf,':'))
5261 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5263 yylval.opval = newOP(OP_PADANY, 0);
5264 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5270 build the ops for accesses to a my() variable.
5272 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5273 then used in a comparison. This catches most, but not
5274 all cases. For instance, it catches
5275 sort { my($a); $a <=> $b }
5277 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5278 (although why you'd do that is anyone's guess).
5281 if (!strchr(PL_tokenbuf,':')) {
5283 tmp = pad_findmy(PL_tokenbuf);
5284 if (tmp != NOT_IN_PAD) {
5285 /* might be an "our" variable" */
5286 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5287 /* build ops for a bareword */
5288 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5289 sv_catpvn(sym, "::", 2);
5290 sv_catpv(sym, PL_tokenbuf+1);
5291 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5292 yylval.opval->op_private = OPpCONST_ENTERED;
5293 gv_fetchpv(SvPVX(sym),
5295 ? (GV_ADDMULTI | GV_ADDINEVAL)
5298 ((PL_tokenbuf[0] == '$') ? SVt_PV
5299 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5304 /* if it's a sort block and they're naming $a or $b */
5305 if (PL_last_lop_op == OP_SORT &&
5306 PL_tokenbuf[0] == '$' &&
5307 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5310 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5311 d < PL_bufend && *d != '\n';
5314 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5315 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5321 yylval.opval = newOP(OP_PADANY, 0);
5322 yylval.opval->op_targ = tmp;
5328 Whine if they've said @foo in a doublequoted string,
5329 and @foo isn't a variable we can find in the symbol
5332 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5333 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5334 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5335 && ckWARN(WARN_AMBIGUOUS))
5337 /* Downgraded from fatal to warning 20000522 mjd */
5338 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5339 "Possible unintended interpolation of %s in string",
5344 /* build ops for a bareword */
5345 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5346 yylval.opval->op_private = OPpCONST_ENTERED;
5347 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5348 ((PL_tokenbuf[0] == '$') ? SVt_PV
5349 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5355 Perl_keyword(pTHX_ register char *d, I32 len)
5360 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5361 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5362 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5363 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5364 if (strEQ(d,"__END__")) return KEY___END__;
5368 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5373 if (strEQ(d,"and")) return -KEY_and;
5374 if (strEQ(d,"abs")) return -KEY_abs;
5377 if (strEQ(d,"alarm")) return -KEY_alarm;
5378 if (strEQ(d,"atan2")) return -KEY_atan2;
5381 if (strEQ(d,"accept")) return -KEY_accept;
5386 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5389 if (strEQ(d,"bless")) return -KEY_bless;
5390 if (strEQ(d,"bind")) return -KEY_bind;
5391 if (strEQ(d,"binmode")) return -KEY_binmode;
5394 if (strEQ(d,"CORE")) return -KEY_CORE;
5395 if (strEQ(d,"CHECK")) return KEY_CHECK;
5400 if (strEQ(d,"cmp")) return -KEY_cmp;
5401 if (strEQ(d,"chr")) return -KEY_chr;
5402 if (strEQ(d,"cos")) return -KEY_cos;
5405 if (strEQ(d,"chop")) return -KEY_chop;
5408 if (strEQ(d,"close")) return -KEY_close;
5409 if (strEQ(d,"chdir")) return -KEY_chdir;
5410 if (strEQ(d,"chomp")) return -KEY_chomp;
5411 if (strEQ(d,"chmod")) return -KEY_chmod;
5412 if (strEQ(d,"chown")) return -KEY_chown;
5413 if (strEQ(d,"crypt")) return -KEY_crypt;
5416 if (strEQ(d,"chroot")) return -KEY_chroot;
5417 if (strEQ(d,"caller")) return -KEY_caller;
5420 if (strEQ(d,"connect")) return -KEY_connect;
5423 if (strEQ(d,"closedir")) return -KEY_closedir;
5424 if (strEQ(d,"continue")) return -KEY_continue;
5429 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5434 if (strEQ(d,"do")) return KEY_do;
5437 if (strEQ(d,"die")) return -KEY_die;
5440 if (strEQ(d,"dump")) return -KEY_dump;
5443 if (strEQ(d,"delete")) return KEY_delete;
5446 if (strEQ(d,"defined")) return KEY_defined;
5447 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5450 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5455 if (strEQ(d,"END")) return KEY_END;
5460 if (strEQ(d,"eq")) return -KEY_eq;
5463 if (strEQ(d,"eof")) return -KEY_eof;
5464 if (strEQ(d,"err")) return -KEY_err;
5465 if (strEQ(d,"exp")) return -KEY_exp;
5468 if (strEQ(d,"else")) return KEY_else;
5469 if (strEQ(d,"exit")) return -KEY_exit;
5470 if (strEQ(d,"eval")) return KEY_eval;
5471 if (strEQ(d,"exec")) return -KEY_exec;
5472 if (strEQ(d,"each")) return -KEY_each;
5475 if (strEQ(d,"elsif")) return KEY_elsif;
5478 if (strEQ(d,"exists")) return KEY_exists;
5479 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5482 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5483 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5486 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5489 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5490 if (strEQ(d,"endservent")) return -KEY_endservent;
5493 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5500 if (strEQ(d,"for")) return KEY_for;
5503 if (strEQ(d,"fork")) return -KEY_fork;
5506 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5507 if (strEQ(d,"flock")) return -KEY_flock;
5510 if (strEQ(d,"format")) return KEY_format;
5511 if (strEQ(d,"fileno")) return -KEY_fileno;
5514 if (strEQ(d,"foreach")) return KEY_foreach;
5517 if (strEQ(d,"formline")) return -KEY_formline;
5522 if (strnEQ(d,"get",3)) {
5527 if (strEQ(d,"ppid")) return -KEY_getppid;
5528 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5531 if (strEQ(d,"pwent")) return -KEY_getpwent;
5532 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5533 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5536 if (strEQ(d,"peername")) return -KEY_getpeername;
5537 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5538 if (strEQ(d,"priority")) return -KEY_getpriority;
5541 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5544 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5548 else if (*d == 'h') {
5549 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5550 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5551 if (strEQ(d,"hostent")) return -KEY_gethostent;
5553 else if (*d == 'n') {
5554 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5555 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5556 if (strEQ(d,"netent")) return -KEY_getnetent;
5558 else if (*d == 's') {
5559 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5560 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5561 if (strEQ(d,"servent")) return -KEY_getservent;
5562 if (strEQ(d,"sockname")) return -KEY_getsockname;
5563 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5565 else if (*d == 'g') {
5566 if (strEQ(d,"grent")) return -KEY_getgrent;
5567 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5568 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5570 else if (*d == 'l') {
5571 if (strEQ(d,"login")) return -KEY_getlogin;
5573 else if (strEQ(d,"c")) return -KEY_getc;
5578 if (strEQ(d,"gt")) return -KEY_gt;
5579 if (strEQ(d,"ge")) return -KEY_ge;
5582 if (strEQ(d,"grep")) return KEY_grep;
5583 if (strEQ(d,"goto")) return KEY_goto;
5584 if (strEQ(d,"glob")) return KEY_glob;
5587 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5592 if (strEQ(d,"hex")) return -KEY_hex;
5595 if (strEQ(d,"INIT")) return KEY_INIT;
5600 if (strEQ(d,"if")) return KEY_if;
5603 if (strEQ(d,"int")) return -KEY_int;
5606 if (strEQ(d,"index")) return -KEY_index;
5607 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5612 if (strEQ(d,"join")) return -KEY_join;
5616 if (strEQ(d,"keys")) return -KEY_keys;
5617 if (strEQ(d,"kill")) return -KEY_kill;
5623 if (strEQ(d,"lt")) return -KEY_lt;
5624 if (strEQ(d,"le")) return -KEY_le;
5625 if (strEQ(d,"lc")) return -KEY_lc;
5628 if (strEQ(d,"log")) return -KEY_log;
5631 if (strEQ(d,"last")) return KEY_last;
5632 if (strEQ(d,"link")) return -KEY_link;
5633 if (strEQ(d,"lock")) return -KEY_lock;
5636 if (strEQ(d,"local")) return KEY_local;
5637 if (strEQ(d,"lstat")) return -KEY_lstat;
5640 if (strEQ(d,"length")) return -KEY_length;
5641 if (strEQ(d,"listen")) return -KEY_listen;
5644 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5647 if (strEQ(d,"localtime")) return -KEY_localtime;
5653 case 1: return KEY_m;
5655 if (strEQ(d,"my")) return KEY_my;
5658 if (strEQ(d,"map")) return KEY_map;
5661 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5664 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5665 if (strEQ(d,"msgget")) return -KEY_msgget;
5666 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5667 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5672 if (strEQ(d,"next")) return KEY_next;
5673 if (strEQ(d,"ne")) return -KEY_ne;
5674 if (strEQ(d,"not")) return -KEY_not;
5675 if (strEQ(d,"no")) return KEY_no;
5680 if (strEQ(d,"or")) return -KEY_or;
5683 if (strEQ(d,"ord")) return -KEY_ord;
5684 if (strEQ(d,"oct")) return -KEY_oct;
5685 if (strEQ(d,"our")) return KEY_our;
5688 if (strEQ(d,"open")) return -KEY_open;
5691 if (strEQ(d,"opendir")) return -KEY_opendir;
5698 if (strEQ(d,"pop")) return -KEY_pop;
5699 if (strEQ(d,"pos")) return KEY_pos;
5702 if (strEQ(d,"push")) return -KEY_push;
5703 if (strEQ(d,"pack")) return -KEY_pack;
5704 if (strEQ(d,"pipe")) return -KEY_pipe;
5707 if (strEQ(d,"print")) return KEY_print;
5710 if (strEQ(d,"printf")) return KEY_printf;
5713 if (strEQ(d,"package")) return KEY_package;
5716 if (strEQ(d,"prototype")) return KEY_prototype;
5721 if (strEQ(d,"q")) return KEY_q;
5722 if (strEQ(d,"qr")) return KEY_qr;
5723 if (strEQ(d,"qq")) return KEY_qq;
5724 if (strEQ(d,"qw")) return KEY_qw;
5725 if (strEQ(d,"qx")) return KEY_qx;
5727 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5732 if (strEQ(d,"ref")) return -KEY_ref;
5735 if (strEQ(d,"read")) return -KEY_read;
5736 if (strEQ(d,"rand")) return -KEY_rand;
5737 if (strEQ(d,"recv")) return -KEY_recv;
5738 if (strEQ(d,"redo")) return KEY_redo;
5741 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5742 if (strEQ(d,"reset")) return -KEY_reset;
5745 if (strEQ(d,"return")) return KEY_return;
5746 if (strEQ(d,"rename")) return -KEY_rename;
5747 if (strEQ(d,"rindex")) return -KEY_rindex;
5750 if (strEQ(d,"require")) return KEY_require;
5751 if (strEQ(d,"reverse")) return -KEY_reverse;
5752 if (strEQ(d,"readdir")) return -KEY_readdir;
5755 if (strEQ(d,"readlink")) return -KEY_readlink;
5756 if (strEQ(d,"readline")) return -KEY_readline;
5757 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5760 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5766 case 0: return KEY_s;
5768 if (strEQ(d,"scalar")) return KEY_scalar;
5773 if (strEQ(d,"seek")) return -KEY_seek;
5774 if (strEQ(d,"send")) return -KEY_send;
5777 if (strEQ(d,"semop")) return -KEY_semop;
5780 if (strEQ(d,"select")) return -KEY_select;
5781 if (strEQ(d,"semctl")) return -KEY_semctl;
5782 if (strEQ(d,"semget")) return -KEY_semget;
5785 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5786 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5789 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5790 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5793 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5796 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5797 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5798 if (strEQ(d,"setservent")) return -KEY_setservent;
5801 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5802 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5809 if (strEQ(d,"shift")) return -KEY_shift;
5812 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5813 if (strEQ(d,"shmget")) return -KEY_shmget;
5816 if (strEQ(d,"shmread")) return -KEY_shmread;
5819 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5820 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5825 if (strEQ(d,"sin")) return -KEY_sin;
5828 if (strEQ(d,"sleep")) return -KEY_sleep;
5831 if (strEQ(d,"sort")) return KEY_sort;
5832 if (strEQ(d,"socket")) return -KEY_socket;
5833 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5836 if (strEQ(d,"split")) return KEY_split;
5837 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5838 if (strEQ(d,"splice")) return -KEY_splice;
5841 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5844 if (strEQ(d,"srand")) return -KEY_srand;
5847 if (strEQ(d,"stat")) return -KEY_stat;
5848 if (strEQ(d,"study")) return KEY_study;
5851 if (strEQ(d,"substr")) return -KEY_substr;
5852 if (strEQ(d,"sub")) return KEY_sub;
5857 if (strEQ(d,"system")) return -KEY_system;
5860 if (strEQ(d,"symlink")) return -KEY_symlink;
5861 if (strEQ(d,"syscall")) return -KEY_syscall;
5862 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5863 if (strEQ(d,"sysread")) return -KEY_sysread;
5864 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5867 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5876 if (strEQ(d,"tr")) return KEY_tr;
5879 if (strEQ(d,"tie")) return KEY_tie;
5882 if (strEQ(d,"tell")) return -KEY_tell;
5883 if (strEQ(d,"tied")) return KEY_tied;
5884 if (strEQ(d,"time")) return -KEY_time;
5887 if (strEQ(d,"times")) return -KEY_times;
5890 if (strEQ(d,"telldir")) return -KEY_telldir;
5893 if (strEQ(d,"truncate")) return -KEY_truncate;
5900 if (strEQ(d,"uc")) return -KEY_uc;
5903 if (strEQ(d,"use")) return KEY_use;
5906 if (strEQ(d,"undef")) return KEY_undef;
5907 if (strEQ(d,"until")) return KEY_until;
5908 if (strEQ(d,"untie")) return KEY_untie;
5909 if (strEQ(d,"utime")) return -KEY_utime;
5910 if (strEQ(d,"umask")) return -KEY_umask;
5913 if (strEQ(d,"unless")) return KEY_unless;
5914 if (strEQ(d,"unpack")) return -KEY_unpack;
5915 if (strEQ(d,"unlink")) return -KEY_unlink;
5918 if (strEQ(d,"unshift")) return -KEY_unshift;
5919 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5924 if (strEQ(d,"values")) return -KEY_values;
5925 if (strEQ(d,"vec")) return -KEY_vec;
5930 if (strEQ(d,"warn")) return -KEY_warn;
5931 if (strEQ(d,"wait")) return -KEY_wait;
5934 if (strEQ(d,"while")) return KEY_while;
5935 if (strEQ(d,"write")) return -KEY_write;
5938 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5941 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5946 if (len == 1) return -KEY_x;
5947 if (strEQ(d,"xor")) return -KEY_xor;
5950 if (len == 1) return KEY_y;
5959 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5963 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5964 if (ckWARN(WARN_SYNTAX)) {
5966 for (w = s+2; *w && level; w++) {
5973 for (; *w && isSPACE(*w); w++) ;
5974 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5975 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5976 "%s (...) interpreted as function",name);
5979 while (s < PL_bufend && isSPACE(*s))
5983 while (s < PL_bufend && isSPACE(*s))
5985 if (isIDFIRST_lazy_if(s,UTF)) {
5987 while (isALNUM_lazy_if(s,UTF))
5989 while (s < PL_bufend && isSPACE(*s))
5994 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5998 Perl_croak(aTHX_ "No comma allowed after %s", what);
6003 /* Either returns sv, or mortalizes sv and returns a new SV*.
6004 Best used as sv=new_constant(..., sv, ...).
6005 If s, pv are NULL, calls subroutine with one argument,
6006 and type is used with error messages only. */
6009 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6013 HV *table = GvHV(PL_hintgv); /* ^H */
6017 const char *why1, *why2, *why3;
6019 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6022 why2 = strEQ(key,"charnames")
6023 ? "(possibly a missing \"use charnames ...\")"
6025 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6026 (type ? type: "undef"), why2);
6028 /* This is convoluted and evil ("goto considered harmful")
6029 * but I do not understand the intricacies of all the different
6030 * failure modes of %^H in here. The goal here is to make
6031 * the most probable error message user-friendly. --jhi */
6036 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6037 (type ? type: "undef"), why1, why2, why3);
6039 yyerror(SvPVX(msg));
6043 cvp = hv_fetch(table, key, strlen(key), FALSE);
6044 if (!cvp || !SvOK(*cvp)) {
6047 why3 = "} is not defined";
6050 sv_2mortal(sv); /* Parent created it permanently */
6053 pv = sv_2mortal(newSVpvn(s, len));
6055 typesv = sv_2mortal(newSVpv(type, 0));
6057 typesv = &PL_sv_undef;
6059 PUSHSTACKi(PERLSI_OVERLOAD);
6071 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6075 /* Check the eval first */
6076 if (!PL_in_eval && SvTRUE(ERRSV)) {
6078 sv_catpv(ERRSV, "Propagated");
6079 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6081 res = SvREFCNT_inc(sv);
6085 (void)SvREFCNT_inc(res);
6094 why1 = "Call to &{$^H{";
6096 why3 = "}} did not return a defined value";
6105 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6107 register char *d = dest;
6108 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6111 Perl_croak(aTHX_ ident_too_long);
6112 if (isALNUM(*s)) /* UTF handled below */
6114 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6119 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6123 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6124 char *t = s + UTF8SKIP(s);
6125 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6127 if (d + (t - s) > e)
6128 Perl_croak(aTHX_ ident_too_long);
6129 Copy(s, d, t - s, char);
6142 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6152 e = d + destlen - 3; /* two-character token, ending NUL */
6154 while (isDIGIT(*s)) {
6156 Perl_croak(aTHX_ ident_too_long);
6163 Perl_croak(aTHX_ ident_too_long);
6164 if (isALNUM(*s)) /* UTF handled below */
6166 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6171 else if (*s == ':' && s[1] == ':') {
6175 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6176 char *t = s + UTF8SKIP(s);
6177 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6179 if (d + (t - s) > e)
6180 Perl_croak(aTHX_ ident_too_long);
6181 Copy(s, d, t - s, char);
6192 if (PL_lex_state != LEX_NORMAL)
6193 PL_lex_state = LEX_INTERPENDMAYBE;
6196 if (*s == '$' && s[1] &&
6197 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6210 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6215 if (isSPACE(s[-1])) {
6218 if (!SPACE_OR_TAB(ch)) {
6224 if (isIDFIRST_lazy_if(d,UTF)) {
6228 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6230 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6233 Copy(s, d, e - s, char);
6238 while ((isALNUM(*s) || *s == ':') && d < e)
6241 Perl_croak(aTHX_ ident_too_long);
6244 while (s < send && SPACE_OR_TAB(*s)) s++;
6245 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6246 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6247 const char *brack = *s == '[' ? "[...]" : "{...}";
6248 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6249 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6250 funny, dest, brack, funny, dest, brack);
6253 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6257 /* Handle extended ${^Foo} variables
6258 * 1999-02-27 mjd-perl-patch@plover.com */
6259 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6263 while (isALNUM(*s) && d < e) {
6267 Perl_croak(aTHX_ ident_too_long);
6272 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6273 PL_lex_state = LEX_INTERPEND;
6276 if (PL_lex_state == LEX_NORMAL) {
6277 if (ckWARN(WARN_AMBIGUOUS) &&
6278 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6280 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6281 "Ambiguous use of %c{%s} resolved to %c%s",
6282 funny, dest, funny, dest);
6287 s = bracket; /* let the parser handle it */
6291 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6292 PL_lex_state = LEX_INTERPEND;
6297 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6302 *pmfl |= PMf_GLOBAL;
6304 *pmfl |= PMf_CONTINUE;
6308 *pmfl |= PMf_MULTILINE;
6310 *pmfl |= PMf_SINGLELINE;
6312 *pmfl |= PMf_EXTENDED;
6316 S_scan_pat(pTHX_ char *start, I32 type)
6321 s = scan_str(start,FALSE,FALSE);
6323 Perl_croak(aTHX_ "Search pattern not terminated");
6325 pm = (PMOP*)newPMOP(type, 0);
6326 if (PL_multi_open == '?')
6327 pm->op_pmflags |= PMf_ONCE;
6329 while (*s && strchr("iomsx", *s))
6330 pmflag(&pm->op_pmflags,*s++);
6333 while (*s && strchr("iogcmsx", *s))
6334 pmflag(&pm->op_pmflags,*s++);
6336 /* issue a warning if /c is specified,but /g is not */
6337 if (ckWARN(WARN_REGEXP) &&
6338 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6340 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6343 pm->op_pmpermflags = pm->op_pmflags;
6345 PL_lex_op = (OP*)pm;
6346 yylval.ival = OP_MATCH;
6351 S_scan_subst(pTHX_ char *start)
6358 yylval.ival = OP_NULL;
6360 s = scan_str(start,FALSE,FALSE);
6363 Perl_croak(aTHX_ "Substitution pattern not terminated");
6365 if (s[-1] == PL_multi_open)
6368 first_start = PL_multi_start;
6369 s = scan_str(s,FALSE,FALSE);
6372 SvREFCNT_dec(PL_lex_stuff);
6373 PL_lex_stuff = Nullsv;
6375 Perl_croak(aTHX_ "Substitution replacement not terminated");
6377 PL_multi_start = first_start; /* so whole substitution is taken together */
6379 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6385 else if (strchr("iogcmsx", *s))
6386 pmflag(&pm->op_pmflags,*s++);
6391 /* /c is not meaningful with s/// */
6392 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6394 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6399 PL_sublex_info.super_bufptr = s;
6400 PL_sublex_info.super_bufend = PL_bufend;
6402 pm->op_pmflags |= PMf_EVAL;
6403 repl = newSVpvn("",0);
6405 sv_catpv(repl, es ? "eval " : "do ");
6406 sv_catpvn(repl, "{ ", 2);
6407 sv_catsv(repl, PL_lex_repl);
6408 sv_catpvn(repl, " };", 2);
6410 SvREFCNT_dec(PL_lex_repl);
6414 pm->op_pmpermflags = pm->op_pmflags;
6415 PL_lex_op = (OP*)pm;
6416 yylval.ival = OP_SUBST;
6421 S_scan_trans(pTHX_ char *start)
6430 yylval.ival = OP_NULL;
6432 s = scan_str(start,FALSE,FALSE);
6434 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6435 if (s[-1] == PL_multi_open)
6438 s = scan_str(s,FALSE,FALSE);
6441 SvREFCNT_dec(PL_lex_stuff);
6442 PL_lex_stuff = Nullsv;
6444 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6447 complement = del = squash = 0;
6448 while (strchr("cds", *s)) {
6450 complement = OPpTRANS_COMPLEMENT;
6452 del = OPpTRANS_DELETE;
6454 squash = OPpTRANS_SQUASH;
6458 New(803, tbl, complement&&!del?258:256, short);
6459 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6460 o->op_private = del|squash|complement|
6461 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6462 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6465 yylval.ival = OP_TRANS;
6470 S_scan_heredoc(pTHX_ register char *s)
6473 I32 op_type = OP_SCALAR;
6480 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6484 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6487 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6488 if (*peek && strchr("`'\"",*peek)) {
6491 s = delimcpy(d, e, s, PL_bufend, term, &len);
6501 if (!isALNUM_lazy_if(s,UTF))
6502 deprecate_old("bare << to mean <<\"\"");
6503 for (; isALNUM_lazy_if(s,UTF); s++) {
6508 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6509 Perl_croak(aTHX_ "Delimiter for here document is too long");
6512 len = d - PL_tokenbuf;
6513 #ifndef PERL_STRICT_CR
6514 d = strchr(s, '\r');
6518 while (s < PL_bufend) {
6524 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6533 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6538 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6539 herewas = newSVpvn(s,PL_bufend-s);
6541 s--, herewas = newSVpvn(s,d-s);
6542 s += SvCUR(herewas);
6544 tmpstr = NEWSV(87,79);
6545 sv_upgrade(tmpstr, SVt_PVIV);
6550 else if (term == '`') {
6551 op_type = OP_BACKTICK;
6552 SvIVX(tmpstr) = '\\';
6556 PL_multi_start = CopLINE(PL_curcop);
6557 PL_multi_open = PL_multi_close = '<';
6558 term = *PL_tokenbuf;
6559 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6560 char *bufptr = PL_sublex_info.super_bufptr;
6561 char *bufend = PL_sublex_info.super_bufend;
6562 char *olds = s - SvCUR(herewas);
6563 s = strchr(bufptr, '\n');
6567 while (s < bufend &&
6568 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6570 CopLINE_inc(PL_curcop);
6573 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6574 missingterm(PL_tokenbuf);
6576 sv_setpvn(herewas,bufptr,d-bufptr+1);
6577 sv_setpvn(tmpstr,d+1,s-d);
6579 sv_catpvn(herewas,s,bufend-s);
6580 (void)strcpy(bufptr,SvPVX(herewas));
6587 while (s < PL_bufend &&
6588 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6590 CopLINE_inc(PL_curcop);
6592 if (s >= PL_bufend) {
6593 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6594 missingterm(PL_tokenbuf);
6596 sv_setpvn(tmpstr,d+1,s-d);
6598 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6600 sv_catpvn(herewas,s,PL_bufend-s);
6601 sv_setsv(PL_linestr,herewas);
6602 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6603 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6604 PL_last_lop = PL_last_uni = Nullch;
6607 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6608 while (s >= PL_bufend) { /* multiple line string? */
6610 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6611 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6612 missingterm(PL_tokenbuf);
6614 CopLINE_inc(PL_curcop);
6615 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6616 PL_last_lop = PL_last_uni = Nullch;
6617 #ifndef PERL_STRICT_CR
6618 if (PL_bufend - PL_linestart >= 2) {
6619 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6620 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6622 PL_bufend[-2] = '\n';
6624 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6626 else if (PL_bufend[-1] == '\r')
6627 PL_bufend[-1] = '\n';
6629 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6630 PL_bufend[-1] = '\n';
6632 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6633 SV *sv = NEWSV(88,0);
6635 sv_upgrade(sv, SVt_PVMG);
6636 sv_setsv(sv,PL_linestr);
6639 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6641 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6644 sv_catsv(PL_linestr,herewas);
6645 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6649 sv_catsv(tmpstr,PL_linestr);
6654 PL_multi_end = CopLINE(PL_curcop);
6655 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6656 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6657 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6659 SvREFCNT_dec(herewas);
6660 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6662 PL_lex_stuff = tmpstr;
6663 yylval.ival = op_type;
6668 takes: current position in input buffer
6669 returns: new position in input buffer
6670 side-effects: yylval and lex_op are set.
6675 <FH> read from filehandle
6676 <pkg::FH> read from package qualified filehandle
6677 <pkg'FH> read from package qualified filehandle
6678 <$fh> read from filehandle in $fh
6684 S_scan_inputsymbol(pTHX_ char *start)
6686 register char *s = start; /* current position in buffer */
6692 d = PL_tokenbuf; /* start of temp holding space */
6693 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6694 end = strchr(s, '\n');
6697 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6699 /* die if we didn't have space for the contents of the <>,
6700 or if it didn't end, or if we see a newline
6703 if (len >= sizeof PL_tokenbuf)
6704 Perl_croak(aTHX_ "Excessively long <> operator");
6706 Perl_croak(aTHX_ "Unterminated <> operator");
6711 Remember, only scalar variables are interpreted as filehandles by
6712 this code. Anything more complex (e.g., <$fh{$num}>) will be
6713 treated as a glob() call.
6714 This code makes use of the fact that except for the $ at the front,
6715 a scalar variable and a filehandle look the same.
6717 if (*d == '$' && d[1]) d++;
6719 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6720 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6723 /* If we've tried to read what we allow filehandles to look like, and
6724 there's still text left, then it must be a glob() and not a getline.
6725 Use scan_str to pull out the stuff between the <> and treat it
6726 as nothing more than a string.
6729 if (d - PL_tokenbuf != len) {
6730 yylval.ival = OP_GLOB;
6732 s = scan_str(start,FALSE,FALSE);
6734 Perl_croak(aTHX_ "Glob not terminated");
6738 bool readline_overriden = FALSE;
6739 GV *gv_readline = Nullgv;
6741 /* we're in a filehandle read situation */
6744 /* turn <> into <ARGV> */
6746 (void)strcpy(d,"ARGV");
6748 /* Check whether readline() is overriden */
6749 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6750 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6752 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6753 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6754 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6755 readline_overriden = TRUE;
6757 /* if <$fh>, create the ops to turn the variable into a
6763 /* try to find it in the pad for this block, otherwise find
6764 add symbol table ops
6766 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6767 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6768 SV *sym = sv_2mortal(
6769 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6770 sv_catpvn(sym, "::", 2);
6776 OP *o = newOP(OP_PADSV, 0);
6778 PL_lex_op = readline_overriden
6779 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6780 append_elem(OP_LIST, o,
6781 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6782 : (OP*)newUNOP(OP_READLINE, 0, o);
6791 ? (GV_ADDMULTI | GV_ADDINEVAL)
6794 PL_lex_op = readline_overriden
6795 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6796 append_elem(OP_LIST,
6797 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6798 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6799 : (OP*)newUNOP(OP_READLINE, 0,
6800 newUNOP(OP_RV2SV, 0,
6801 newGVOP(OP_GV, 0, gv)));
6803 if (!readline_overriden)
6804 PL_lex_op->op_flags |= OPf_SPECIAL;
6805 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6806 yylval.ival = OP_NULL;
6809 /* If it's none of the above, it must be a literal filehandle
6810 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6812 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6813 PL_lex_op = readline_overriden
6814 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6815 append_elem(OP_LIST,
6816 newGVOP(OP_GV, 0, gv),
6817 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6818 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6819 yylval.ival = OP_NULL;
6828 takes: start position in buffer
6829 keep_quoted preserve \ on the embedded delimiter(s)
6830 keep_delims preserve the delimiters around the string
6831 returns: position to continue reading from buffer
6832 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6833 updates the read buffer.
6835 This subroutine pulls a string out of the input. It is called for:
6836 q single quotes q(literal text)
6837 ' single quotes 'literal text'
6838 qq double quotes qq(interpolate $here please)
6839 " double quotes "interpolate $here please"
6840 qx backticks qx(/bin/ls -l)
6841 ` backticks `/bin/ls -l`
6842 qw quote words @EXPORT_OK = qw( func() $spam )
6843 m// regexp match m/this/
6844 s/// regexp substitute s/this/that/
6845 tr/// string transliterate tr/this/that/
6846 y/// string transliterate y/this/that/
6847 ($*@) sub prototypes sub foo ($)
6848 (stuff) sub attr parameters sub foo : attr(stuff)
6849 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6851 In most of these cases (all but <>, patterns and transliterate)
6852 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6853 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6854 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6857 It skips whitespace before the string starts, and treats the first
6858 character as the delimiter. If the delimiter is one of ([{< then
6859 the corresponding "close" character )]}> is used as the closing
6860 delimiter. It allows quoting of delimiters, and if the string has
6861 balanced delimiters ([{<>}]) it allows nesting.
6863 On success, the SV with the resulting string is put into lex_stuff or,
6864 if that is already non-NULL, into lex_repl. The second case occurs only
6865 when parsing the RHS of the special constructs s/// and tr/// (y///).
6866 For convenience, the terminating delimiter character is stuffed into
6871 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6873 SV *sv; /* scalar value: string */
6874 char *tmps; /* temp string, used for delimiter matching */
6875 register char *s = start; /* current position in the buffer */
6876 register char term; /* terminating character */
6877 register char *to; /* current position in the sv's data */
6878 I32 brackets = 1; /* bracket nesting level */
6879 bool has_utf8 = FALSE; /* is there any utf8 content? */
6881 /* skip space before the delimiter */
6885 /* mark where we are, in case we need to report errors */
6888 /* after skipping whitespace, the next character is the terminator */
6890 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6893 /* mark where we are */
6894 PL_multi_start = CopLINE(PL_curcop);
6895 PL_multi_open = term;
6897 /* find corresponding closing delimiter */
6898 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6900 PL_multi_close = term;
6902 /* create a new SV to hold the contents. 87 is leak category, I'm
6903 assuming. 79 is the SV's initial length. What a random number. */
6905 sv_upgrade(sv, SVt_PVIV);
6907 (void)SvPOK_only(sv); /* validate pointer */
6909 /* move past delimiter and try to read a complete string */
6911 sv_catpvn(sv, s, 1);
6914 /* extend sv if need be */
6915 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6916 /* set 'to' to the next character in the sv's string */
6917 to = SvPVX(sv)+SvCUR(sv);
6919 /* if open delimiter is the close delimiter read unbridle */
6920 if (PL_multi_open == PL_multi_close) {
6921 for (; s < PL_bufend; s++,to++) {
6922 /* embedded newlines increment the current line number */
6923 if (*s == '\n' && !PL_rsfp)
6924 CopLINE_inc(PL_curcop);
6925 /* handle quoted delimiters */
6926 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6927 if (!keep_quoted && s[1] == term)
6929 /* any other quotes are simply copied straight through */
6933 /* terminate when run out of buffer (the for() condition), or
6934 have found the terminator */
6935 else if (*s == term)
6937 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6943 /* if the terminator isn't the same as the start character (e.g.,
6944 matched brackets), we have to allow more in the quoting, and
6945 be prepared for nested brackets.
6948 /* read until we run out of string, or we find the terminator */
6949 for (; s < PL_bufend; s++,to++) {
6950 /* embedded newlines increment the line count */
6951 if (*s == '\n' && !PL_rsfp)
6952 CopLINE_inc(PL_curcop);
6953 /* backslashes can escape the open or closing characters */
6954 if (*s == '\\' && s+1 < PL_bufend) {
6956 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6961 /* allow nested opens and closes */
6962 else if (*s == PL_multi_close && --brackets <= 0)
6964 else if (*s == PL_multi_open)
6966 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6971 /* terminate the copied string and update the sv's end-of-string */
6973 SvCUR_set(sv, to - SvPVX(sv));
6976 * this next chunk reads more into the buffer if we're not done yet
6980 break; /* handle case where we are done yet :-) */
6982 #ifndef PERL_STRICT_CR
6983 if (to - SvPVX(sv) >= 2) {
6984 if ((to[-2] == '\r' && to[-1] == '\n') ||
6985 (to[-2] == '\n' && to[-1] == '\r'))
6989 SvCUR_set(sv, to - SvPVX(sv));
6991 else if (to[-1] == '\r')
6994 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6998 /* if we're out of file, or a read fails, bail and reset the current
6999 line marker so we can report where the unterminated string began
7002 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7004 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7007 /* we read a line, so increment our line counter */
7008 CopLINE_inc(PL_curcop);
7010 /* update debugger info */
7011 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7012 SV *sv = NEWSV(88,0);
7014 sv_upgrade(sv, SVt_PVMG);
7015 sv_setsv(sv,PL_linestr);
7018 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7021 /* having changed the buffer, we must update PL_bufend */
7022 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7023 PL_last_lop = PL_last_uni = Nullch;
7026 /* at this point, we have successfully read the delimited string */
7029 sv_catpvn(sv, s, 1);
7032 else if (PL_encoding)
7033 sv_recode_to_utf8(sv, PL_encoding);
7035 PL_multi_end = CopLINE(PL_curcop);
7038 /* if we allocated too much space, give some back */
7039 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7040 SvLEN_set(sv, SvCUR(sv) + 1);
7041 Renew(SvPVX(sv), SvLEN(sv), char);
7044 /* decide whether this is the first or second quoted string we've read
7057 takes: pointer to position in buffer
7058 returns: pointer to new position in buffer
7059 side-effects: builds ops for the constant in yylval.op
7061 Read a number in any of the formats that Perl accepts:
7063 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7064 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7067 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7069 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7072 If it reads a number without a decimal point or an exponent, it will
7073 try converting the number to an integer and see if it can do so
7074 without loss of precision.
7078 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7080 register char *s = start; /* current position in buffer */
7081 register char *d; /* destination in temp buffer */
7082 register char *e; /* end of temp buffer */
7083 NV nv; /* number read, as a double */
7084 SV *sv = Nullsv; /* place to put the converted number */
7085 bool floatit; /* boolean: int or float? */
7086 char *lastub = 0; /* position of last underbar */
7087 static char number_too_long[] = "Number too long";
7089 /* We use the first character to decide what type of number this is */
7093 Perl_croak(aTHX_ "panic: scan_num");
7095 /* if it starts with a 0, it could be an octal number, a decimal in
7096 0.13 disguise, or a hexadecimal number, or a binary number. */
7100 u holds the "number so far"
7101 shift the power of 2 of the base
7102 (hex == 4, octal == 3, binary == 1)
7103 overflowed was the number more than we can hold?
7105 Shift is used when we add a digit. It also serves as an "are
7106 we in octal/hex/binary?" indicator to disallow hex characters
7112 bool overflowed = FALSE;
7113 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7114 static char* bases[5] = { "", "binary", "", "octal",
7116 static char* Bases[5] = { "", "Binary", "", "Octal",
7118 static char *maxima[5] = { "",
7119 "0b11111111111111111111111111111111",
7123 char *base, *Base, *max;
7129 } else if (s[1] == 'b') {
7133 /* check for a decimal in disguise */
7134 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7136 /* so it must be octal */
7143 if (ckWARN(WARN_SYNTAX))
7144 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7145 "Misplaced _ in number");
7149 base = bases[shift];
7150 Base = Bases[shift];
7151 max = maxima[shift];
7153 /* read the rest of the number */
7155 /* x is used in the overflow test,
7156 b is the digit we're adding on. */
7161 /* if we don't mention it, we're done */
7165 /* _ are ignored -- but warned about if consecutive */
7167 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7168 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7169 "Misplaced _ in number");
7173 /* 8 and 9 are not octal */
7176 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7180 case '2': case '3': case '4':
7181 case '5': case '6': case '7':
7183 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7187 b = *s++ & 15; /* ASCII digit -> value of digit */
7191 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7192 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7193 /* make sure they said 0x */
7198 /* Prepare to put the digit we have onto the end
7199 of the number so far. We check for overflows.
7204 x = u << shift; /* make room for the digit */
7206 if ((x >> shift) != u
7207 && !(PL_hints & HINT_NEW_BINARY)) {
7210 if (ckWARN_d(WARN_OVERFLOW))
7211 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7212 "Integer overflow in %s number",
7215 u = x | b; /* add the digit to the end */
7218 n *= nvshift[shift];
7219 /* If an NV has not enough bits in its
7220 * mantissa to represent an UV this summing of
7221 * small low-order numbers is a waste of time
7222 * (because the NV cannot preserve the
7223 * low-order bits anyway): we could just
7224 * remember when did we overflow and in the
7225 * end just multiply n by the right
7233 /* if we get here, we had success: make a scalar value from
7238 /* final misplaced underbar check */
7240 if (ckWARN(WARN_SYNTAX))
7241 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7246 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7247 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7248 "%s number > %s non-portable",
7254 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7255 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7256 "%s number > %s non-portable",
7261 if (PL_hints & HINT_NEW_BINARY)
7262 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7267 handle decimal numbers.
7268 we're also sent here when we read a 0 as the first digit
7270 case '1': case '2': case '3': case '4': case '5':
7271 case '6': case '7': case '8': case '9': case '.':
7274 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7277 /* read next group of digits and _ and copy into d */
7278 while (isDIGIT(*s) || *s == '_') {
7279 /* skip underscores, checking for misplaced ones
7283 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7284 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7285 "Misplaced _ in number");
7289 /* check for end of fixed-length buffer */
7291 Perl_croak(aTHX_ number_too_long);
7292 /* if we're ok, copy the character */
7297 /* final misplaced underbar check */
7298 if (lastub && s == lastub + 1) {
7299 if (ckWARN(WARN_SYNTAX))
7300 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7303 /* read a decimal portion if there is one. avoid
7304 3..5 being interpreted as the number 3. followed
7307 if (*s == '.' && s[1] != '.') {
7312 if (ckWARN(WARN_SYNTAX))
7313 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7314 "Misplaced _ in number");
7318 /* copy, ignoring underbars, until we run out of digits.
7320 for (; isDIGIT(*s) || *s == '_'; s++) {
7321 /* fixed length buffer check */
7323 Perl_croak(aTHX_ number_too_long);
7325 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7326 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7327 "Misplaced _ in number");
7333 /* fractional part ending in underbar? */
7335 if (ckWARN(WARN_SYNTAX))
7336 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7337 "Misplaced _ in number");
7339 if (*s == '.' && isDIGIT(s[1])) {
7340 /* oops, it's really a v-string, but without the "v" */
7346 /* read exponent part, if present */
7347 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7351 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7352 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7354 /* stray preinitial _ */
7356 if (ckWARN(WARN_SYNTAX))
7357 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7358 "Misplaced _ in number");
7362 /* allow positive or negative exponent */
7363 if (*s == '+' || *s == '-')
7366 /* stray initial _ */
7368 if (ckWARN(WARN_SYNTAX))
7369 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7370 "Misplaced _ in number");
7374 /* read digits of exponent */
7375 while (isDIGIT(*s) || *s == '_') {
7378 Perl_croak(aTHX_ number_too_long);
7382 if (ckWARN(WARN_SYNTAX) &&
7383 ((lastub && s == lastub + 1) ||
7384 (!isDIGIT(s[1]) && s[1] != '_')))
7385 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7386 "Misplaced _ in number");
7393 /* make an sv from the string */
7397 We try to do an integer conversion first if no characters
7398 indicating "float" have been found.
7403 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7405 if (flags == IS_NUMBER_IN_UV) {
7407 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7410 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7411 if (uv <= (UV) IV_MIN)
7412 sv_setiv(sv, -(IV)uv);
7419 /* terminate the string */
7421 nv = Atof(PL_tokenbuf);
7425 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7426 (PL_hints & HINT_NEW_INTEGER) )
7427 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7428 (floatit ? "float" : "integer"),
7432 /* if it starts with a v, it could be a v-string */
7435 sv = NEWSV(92,5); /* preallocate storage space */
7436 s = scan_vstring(s,sv);
7440 /* make the op for the constant and return */
7443 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7445 lvalp->opval = Nullop;
7451 S_scan_formline(pTHX_ register char *s)
7455 SV *stuff = newSVpvn("",0);
7456 bool needargs = FALSE;
7459 if (*s == '.' || *s == /*{*/'}') {
7461 #ifdef PERL_STRICT_CR
7462 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7464 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7466 if (*t == '\n' || t == PL_bufend)
7469 if (PL_in_eval && !PL_rsfp) {
7470 eol = strchr(s,'\n');
7475 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7477 for (t = s; t < eol; t++) {
7478 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7480 goto enough; /* ~~ must be first line in formline */
7482 if (*t == '@' || *t == '^')
7486 sv_catpvn(stuff, s, eol-s);
7487 #ifndef PERL_STRICT_CR
7488 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7489 char *end = SvPVX(stuff) + SvCUR(stuff);
7501 s = filter_gets(PL_linestr, PL_rsfp, 0);
7502 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7503 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7504 PL_last_lop = PL_last_uni = Nullch;
7507 yyerror("Format not terminated");
7517 PL_lex_state = LEX_NORMAL;
7518 PL_nextval[PL_nexttoke].ival = 0;
7522 PL_lex_state = LEX_FORMLINE;
7523 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7525 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7529 SvREFCNT_dec(stuff);
7530 PL_lex_formbrack = 0;
7541 PL_cshlen = strlen(PL_cshname);
7546 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7548 I32 oldsavestack_ix = PL_savestack_ix;
7549 CV* outsidecv = PL_compcv;
7552 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7554 SAVEI32(PL_subline);
7555 save_item(PL_subname);
7556 SAVESPTR(PL_compcv);
7558 PL_compcv = (CV*)NEWSV(1104,0);
7559 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7560 CvFLAGS(PL_compcv) |= flags;
7562 PL_subline = CopLINE(PL_curcop);
7563 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7564 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7565 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7567 return oldsavestack_ix;
7571 #pragma segment Perl_yylex
7574 Perl_yywarn(pTHX_ char *s)
7576 PL_in_eval |= EVAL_WARNONLY;
7578 PL_in_eval &= ~EVAL_WARNONLY;
7583 Perl_yyerror(pTHX_ char *s)
7586 char *context = NULL;
7590 if (!yychar || (yychar == ';' && !PL_rsfp))
7592 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7593 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7596 The code below is removed for NetWare because it abends/crashes on NetWare
7597 when the script has error such as not having the closing quotes like:
7599 Checking of white spaces is anyway done in NetWare code.
7602 while (isSPACE(*PL_oldoldbufptr))
7605 context = PL_oldoldbufptr;
7606 contlen = PL_bufptr - PL_oldoldbufptr;
7608 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7609 PL_oldbufptr != PL_bufptr) {
7612 The code below is removed for NetWare because it abends/crashes on NetWare
7613 when the script has error such as not having the closing quotes like:
7615 Checking of white spaces is anyway done in NetWare code.
7618 while (isSPACE(*PL_oldbufptr))
7621 context = PL_oldbufptr;
7622 contlen = PL_bufptr - PL_oldbufptr;
7624 else if (yychar > 255)
7625 where = "next token ???";
7626 #ifdef USE_PURE_BISON
7627 /* GNU Bison sets the value -2 */
7628 else if (yychar == -2) {
7630 else if ((yychar & 127) == 127) {
7632 if (PL_lex_state == LEX_NORMAL ||
7633 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7634 where = "at end of line";
7635 else if (PL_lex_inpat)
7636 where = "within pattern";
7638 where = "within string";
7641 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7643 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7644 else if (isPRINT_LC(yychar))
7645 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7647 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7648 where = SvPVX(where_sv);
7650 msg = sv_2mortal(newSVpv(s, 0));
7651 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7652 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7654 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7656 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7657 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7658 Perl_sv_catpvf(aTHX_ msg,
7659 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7660 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7663 if (PL_in_eval & EVAL_WARNONLY)
7664 Perl_warn(aTHX_ "%"SVf, msg);
7667 if (PL_error_count >= 10) {
7668 if (PL_in_eval && SvCUR(ERRSV))
7669 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7670 ERRSV, OutCopFILE(PL_curcop));
7672 Perl_croak(aTHX_ "%s has too many errors.\n",
7673 OutCopFILE(PL_curcop));
7676 PL_in_my_stash = Nullhv;
7680 #pragma segment Main
7684 S_swallow_bom(pTHX_ U8 *s)
7687 slen = SvCUR(PL_linestr);
7691 /* UTF-16 little-endian */
7692 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7693 Perl_croak(aTHX_ "Unsupported script encoding");
7694 #ifndef PERL_NO_UTF16_FILTER
7695 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7697 if (PL_bufend > (char*)s) {
7701 filter_add(utf16rev_textfilter, NULL);
7702 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7703 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7704 PL_bufend - (char*)s - 1,
7706 Copy(news, s, newlen, U8);
7707 SvCUR_set(PL_linestr, newlen);
7708 PL_bufend = SvPVX(PL_linestr) + newlen;
7709 news[newlen++] = '\0';
7713 Perl_croak(aTHX_ "Unsupported script encoding");
7718 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7719 #ifndef PERL_NO_UTF16_FILTER
7720 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7722 if (PL_bufend > (char *)s) {
7726 filter_add(utf16_textfilter, NULL);
7727 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7728 PL_bufend = (char*)utf16_to_utf8(s, news,
7729 PL_bufend - (char*)s,
7731 Copy(news, s, newlen, U8);
7732 SvCUR_set(PL_linestr, newlen);
7733 PL_bufend = SvPVX(PL_linestr) + newlen;
7734 news[newlen++] = '\0';
7738 Perl_croak(aTHX_ "Unsupported script encoding");
7743 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7744 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7749 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7750 s[2] == 0xFE && s[3] == 0xFF)
7752 Perl_croak(aTHX_ "Unsupported script encoding");
7760 * Restore a source filter.
7764 restore_rsfp(pTHX_ void *f)
7766 PerlIO *fp = (PerlIO*)f;
7768 if (PL_rsfp == PerlIO_stdin())
7769 PerlIO_clearerr(PL_rsfp);
7770 else if (PL_rsfp && (PL_rsfp != fp))
7771 PerlIO_close(PL_rsfp);
7775 #ifndef PERL_NO_UTF16_FILTER
7777 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7779 I32 count = FILTER_READ(idx+1, sv, maxlen);
7784 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7785 if (!*SvPV_nolen(sv))
7786 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7789 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7790 sv_usepvn(sv, (char*)tmps, tend - tmps);
7796 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7798 I32 count = FILTER_READ(idx+1, sv, maxlen);
7803 if (!*SvPV_nolen(sv))
7804 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7807 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7808 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7809 sv_usepvn(sv, (char*)tmps, tend - tmps);