3 * Copyright (c) 1991-1999, 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";
30 static void restore_rsfp(pTHXo_ void *f);
31 static void restore_expect(pTHXo_ void *e);
32 static void restore_lex_expect(pTHXo_ void *e);
34 #define UTF (PL_hints & HINT_UTF8)
36 * Note: we try to be careful never to call the isXXX_utf8() functions
37 * unless we're pretty sure we've seen the beginning of a UTF-8 character
38 * (that is, the two high bits are set). Otherwise we risk loading in the
39 * heavy-duty SWASHINIT and SWASHGET routines unnecessarily.
41 #define isIDFIRST_lazy(p) ((!UTF || (*((U8*)p) < 0xc0)) \
43 : isIDFIRST_utf8((U8*)p))
44 #define isALNUM_lazy(p) ((!UTF || (*((U8*)p) < 0xc0)) \
46 : isALNUM_utf8((U8*)p))
48 /* In variables name $^X, these are the legal values for X.
49 * 1999-02-27 mjd-perl-patch@plover.com */
50 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
52 /* LEX_* are values for PL_lex_state, the state of the lexer.
53 * They are arranged oddly so that the guard on the switch statement
54 * can get by with a single comparison (if the compiler is smart enough).
57 /* #define LEX_NOTPARSING 11 is done in perl.h. */
60 #define LEX_INTERPNORMAL 9
61 #define LEX_INTERPCASEMOD 8
62 #define LEX_INTERPPUSH 7
63 #define LEX_INTERPSTART 6
64 #define LEX_INTERPEND 5
65 #define LEX_INTERPENDMAYBE 4
66 #define LEX_INTERPCONCAT 3
67 #define LEX_INTERPCONST 2
68 #define LEX_FORMLINE 1
69 #define LEX_KNOWNEXT 0
78 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
80 # include <unistd.h> /* Needed for execv() */
89 YYSTYPE* yylval_pointer = NULL;
90 int* yychar_pointer = NULL;
93 # define yylval (*yylval_pointer)
94 # define yychar (*yychar_pointer)
95 # define PERL_YYLEX_PARAM yylval_pointer,yychar_pointer
97 # define yylex() Perl_yylex(aTHX_ yylval_pointer, yychar_pointer)
100 #include "keywords.h"
102 /* CLINE is a macro that ensures PL_copline has a sane value */
107 #define CLINE (PL_copline = (PL_curcop->cop_line < PL_copline ? PL_curcop->cop_line : PL_copline))
110 * Convenience functions to return different tokens and prime the
111 * lexer for the next token. They all take an argument.
113 * TOKEN : generic token (used for '(', DOLSHARP, etc)
114 * OPERATOR : generic operator
115 * AOPERATOR : assignment operator
116 * PREBLOCK : beginning the block after an if, while, foreach, ...
117 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
118 * PREREF : *EXPR where EXPR is not a simple identifier
119 * TERM : expression term
120 * LOOPX : loop exiting command (goto, last, dump, etc)
121 * FTST : file test operator
122 * FUN0 : zero-argument function
124 * BOop : bitwise or or xor
126 * SHop : shift operator
127 * PWop : power operator
128 * PMop : pattern-matching operator
129 * Aop : addition-level operator
130 * Mop : multiplication-level operator
131 * Eop : equality-testing operator
132 * Rop : relational operator <= != gt
134 * Also see LOP and lop() below.
137 #define TOKEN(retval) return (PL_bufptr = s,(int)retval)
138 #define OPERATOR(retval) return (PL_expect = XTERM,PL_bufptr = s,(int)retval)
139 #define AOPERATOR(retval) return ao((PL_expect = XTERM,PL_bufptr = s,(int)retval))
140 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
141 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
142 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s,(int)retval)
143 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR,PL_bufptr = s,(int)retval)
144 #define LOOPX(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
145 #define FTST(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
146 #define FUN0(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
147 #define FUN1(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
148 #define BOop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
149 #define BAop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
150 #define SHop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
151 #define PWop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
152 #define PMop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
153 #define Aop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
154 #define Mop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
155 #define Eop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
156 #define Rop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
158 /* This bit of chicanery makes a unary function followed by
159 * a parenthesis into a function with one argument, highest precedence.
161 #define UNI(f) return(yylval.ival = f, \
164 PL_last_uni = PL_oldbufptr, \
165 PL_last_lop_op = f, \
166 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
168 #define UNIBRACK(f) return(yylval.ival = f, \
170 PL_last_uni = PL_oldbufptr, \
171 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
173 /* grandfather return to old style */
174 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
179 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
180 * into an OP_ANDASSIGN or OP_ORASSIGN
184 S_ao(pTHX_ int toketype)
186 if (*PL_bufptr == '=') {
188 if (toketype == ANDAND)
189 yylval.ival = OP_ANDASSIGN;
190 else if (toketype == OROR)
191 yylval.ival = OP_ORASSIGN;
199 * When Perl expects an operator and finds something else, no_op
200 * prints the warning. It always prints "<something> found where
201 * operator expected. It prints "Missing semicolon on previous line?"
202 * if the surprise occurs at the start of the line. "do you need to
203 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
204 * where the compiler doesn't know if foo is a method call or a function.
205 * It prints "Missing operator before end of line" if there's nothing
206 * after the missing operator, or "... before <...>" if there is something
207 * after the missing operator.
211 S_no_op(pTHX_ char *what, char *s)
213 char *oldbp = PL_bufptr;
214 bool is_first = (PL_oldbufptr == PL_linestart);
222 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
224 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
225 else if (PL_oldoldbufptr && isIDFIRST_lazy(PL_oldoldbufptr)) {
227 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy(t) || *t == ':'); t++) ;
228 if (t < PL_bufptr && isSPACE(*t))
229 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
230 t - PL_oldoldbufptr, PL_oldoldbufptr);
233 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
239 * Complain about missing quote/regexp/heredoc terminator.
240 * If it's called with (char *)NULL then it cauterizes the line buffer.
241 * If we're in a delimited string and the delimiter is a control
242 * character, it's reformatted into a two-char sequence like ^C.
247 S_missingterm(pTHX_ char *s)
252 char *nl = strrchr(s,'\n');
258 iscntrl(PL_multi_close)
260 PL_multi_close < 32 || PL_multi_close == 127
264 tmpbuf[1] = toCTRL(PL_multi_close);
270 *tmpbuf = PL_multi_close;
274 q = strchr(s,'"') ? '\'' : '"';
275 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
283 Perl_deprecate(pTHX_ char *s)
286 if (ckWARN(WARN_DEPRECATED))
287 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
292 * Deprecate a comma-less variable list.
298 deprecate("comma-less variable list");
302 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
303 * utf16-to-utf8-reversed.
309 S_win32_textfilter(pTHX_ int idx, SV *sv, int maxlen)
311 I32 count = FILTER_READ(idx+1, sv, maxlen);
312 if (count > 0 && !maxlen)
313 win32_strip_return(sv);
319 S_utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
321 I32 count = FILTER_READ(idx+1, sv, maxlen);
325 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
326 tend = utf16_to_utf8((U16*)SvPVX(sv), tmps, SvCUR(sv));
327 sv_usepvn(sv, (char*)tmps, tend - tmps);
334 S_utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
336 I32 count = FILTER_READ(idx+1, sv, maxlen);
340 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
341 tend = utf16_to_utf8_reversed((U16*)SvPVX(sv), tmps, SvCUR(sv));
342 sv_usepvn(sv, (char*)tmps, tend - tmps);
350 * Initialize variables. Uses the Perl save_stack to save its state (for
351 * recursive calls to the parser).
355 Perl_lex_start(pTHX_ SV *line)
361 SAVEI32(PL_lex_dojoin);
362 SAVEI32(PL_lex_brackets);
363 SAVEI32(PL_lex_fakebrack);
364 SAVEI32(PL_lex_casemods);
365 SAVEI32(PL_lex_starts);
366 SAVEI32(PL_lex_state);
367 SAVESPTR(PL_lex_inpat);
368 SAVEI32(PL_lex_inwhat);
369 SAVEI16(PL_curcop->cop_line);
372 SAVEPPTR(PL_oldbufptr);
373 SAVEPPTR(PL_oldoldbufptr);
374 SAVEPPTR(PL_linestart);
375 SAVESPTR(PL_linestr);
376 SAVEPPTR(PL_lex_brackstack);
377 SAVEPPTR(PL_lex_casestack);
378 SAVEDESTRUCTOR(restore_rsfp, PL_rsfp);
379 SAVESPTR(PL_lex_stuff);
380 SAVEI32(PL_lex_defer);
381 SAVEI32(PL_sublex_info.sub_inwhat);
382 SAVESPTR(PL_lex_repl);
383 SAVEDESTRUCTOR(restore_expect, PL_tokenbuf + PL_expect); /* encode as pointer */
384 SAVEDESTRUCTOR(restore_lex_expect, PL_tokenbuf + PL_expect);
386 PL_lex_state = LEX_NORMAL;
390 PL_lex_fakebrack = 0;
391 New(899, PL_lex_brackstack, 120, char);
392 New(899, PL_lex_casestack, 12, char);
393 SAVEFREEPV(PL_lex_brackstack);
394 SAVEFREEPV(PL_lex_casestack);
396 *PL_lex_casestack = '\0';
399 PL_lex_stuff = Nullsv;
400 PL_lex_repl = Nullsv;
403 PL_sublex_info.sub_inwhat = 0;
405 if (SvREADONLY(PL_linestr))
406 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
407 s = SvPV(PL_linestr, len);
408 if (len && s[len-1] != ';') {
409 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
410 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
411 sv_catpvn(PL_linestr, "\n;", 2);
413 SvTEMP_off(PL_linestr);
414 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
415 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
417 PL_rs = newSVpvn("\n", 1);
423 * Finalizer for lexing operations. Must be called when the parser is
424 * done with the lexer.
430 PL_doextract = FALSE;
435 * This subroutine has nothing to do with tilting, whether at windmills
436 * or pinball tables. Its name is short for "increment line". It
437 * increments the current line number in PL_curcop->cop_line and checks
438 * to see whether the line starts with a comment of the form
439 * # line 500 "foo.pm"
440 * If so, it sets the current line number and file to the values in the comment.
444 S_incline(pTHX_ char *s)
452 PL_curcop->cop_line++;
455 while (*s == ' ' || *s == '\t') s++;
456 if (strnEQ(s, "line ", 5)) {
465 while (*s == ' ' || *s == '\t')
467 if (*s == '"' && (t = strchr(s+1, '"')))
471 return; /* false alarm */
472 for (t = s; !isSPACE(*t); t++) ;
477 PL_curcop->cop_filegv = gv_fetchfile(s);
479 PL_curcop->cop_filegv = gv_fetchfile(PL_origfilename);
481 PL_curcop->cop_line = atoi(n)-1;
486 * Called to gobble the appropriate amount and type of whitespace.
487 * Skips comments as well.
491 S_skipspace(pTHX_ register char *s)
494 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
495 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
501 SSize_t oldprevlen, oldoldprevlen;
502 SSize_t oldloplen, oldunilen;
503 while (s < PL_bufend && isSPACE(*s)) {
504 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
509 if (s < PL_bufend && *s == '#') {
510 while (s < PL_bufend && *s != '\n')
514 if (PL_in_eval && !PL_rsfp) {
521 /* only continue to recharge the buffer if we're at the end
522 * of the buffer, we're not reading from a source filter, and
523 * we're in normal lexing mode
525 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
526 PL_lex_state == LEX_FORMLINE)
529 /* try to recharge the buffer */
530 if ((s = filter_gets(PL_linestr, PL_rsfp,
531 (prevlen = SvCUR(PL_linestr)))) == Nullch)
533 /* end of file. Add on the -p or -n magic */
534 if (PL_minus_n || PL_minus_p) {
535 sv_setpv(PL_linestr,PL_minus_p ?
536 ";}continue{print or die qq(-p destination: $!\\n)" :
538 sv_catpv(PL_linestr,";}");
539 PL_minus_n = PL_minus_p = 0;
542 sv_setpv(PL_linestr,";");
544 /* reset variables for next time we lex */
545 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
547 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
549 /* Close the filehandle. Could be from -P preprocessor,
550 * STDIN, or a regular file. If we were reading code from
551 * STDIN (because the commandline held no -e or filename)
552 * then we don't close it, we reset it so the code can
553 * read from STDIN too.
556 if (PL_preprocess && !PL_in_eval)
557 (void)PerlProc_pclose(PL_rsfp);
558 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
559 PerlIO_clearerr(PL_rsfp);
561 (void)PerlIO_close(PL_rsfp);
566 /* not at end of file, so we only read another line */
567 /* make corresponding updates to old pointers, for yyerror() */
568 oldprevlen = PL_oldbufptr - PL_bufend;
569 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
571 oldunilen = PL_last_uni - PL_bufend;
573 oldloplen = PL_last_lop - PL_bufend;
574 PL_linestart = PL_bufptr = s + prevlen;
575 PL_bufend = s + SvCUR(PL_linestr);
577 PL_oldbufptr = s + oldprevlen;
578 PL_oldoldbufptr = s + oldoldprevlen;
580 PL_last_uni = s + oldunilen;
582 PL_last_lop = s + oldloplen;
585 /* debugger active and we're not compiling the debugger code,
586 * so store the line into the debugger's array of lines
588 if (PERLDB_LINE && PL_curstash != PL_debstash) {
589 SV *sv = NEWSV(85,0);
591 sv_upgrade(sv, SVt_PVMG);
592 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
593 av_store(GvAV(PL_curcop->cop_filegv),(I32)PL_curcop->cop_line,sv);
600 * Check the unary operators to ensure there's no ambiguity in how they're
601 * used. An ambiguous piece of code would be:
603 * This doesn't mean rand() + 5. Because rand() is a unary operator,
604 * the +5 is its argument.
614 if (PL_oldoldbufptr != PL_last_uni)
616 while (isSPACE(*PL_last_uni))
618 for (s = PL_last_uni; isALNUM_lazy(s) || *s == '-'; s++) ;
619 if ((t = strchr(s, '(')) && t < PL_bufptr)
621 if (ckWARN_d(WARN_AMBIGUOUS)){
624 Perl_warner(aTHX_ WARN_AMBIGUOUS,
625 "Warning: Use of \"%s\" without parens is ambiguous",
631 /* workaround to replace the UNI() macro with a function. Only the
632 * hints/uts.sh file mentions this. Other comments elsewhere in the
633 * source indicate Microport Unix might need it too.
639 #define UNI(f) return uni(f,s)
642 S_uni(pTHX_ I32 f, char *s)
647 PL_last_uni = PL_oldbufptr;
658 #endif /* CRIPPLED_CC */
661 * LOP : macro to build a list operator. Its behaviour has been replaced
662 * with a subroutine, S_lop() for which LOP is just another name.
665 #define LOP(f,x) return lop(f,x,s)
669 * Build a list operator (or something that might be one). The rules:
670 * - if we have a next token, then it's a list operator [why?]
671 * - if the next thing is an opening paren, then it's a function
672 * - else it's a list operator
676 S_lop(pTHX_ I32 f, expectation x, char *s)
683 PL_last_lop = PL_oldbufptr;
698 * When the lexer realizes it knows the next token (for instance,
699 * it is reordering tokens for the parser) then it can call S_force_next
700 * to know what token to return the next time the lexer is called. Caller
701 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
702 * handles the token correctly.
706 S_force_next(pTHX_ I32 type)
708 PL_nexttype[PL_nexttoke] = type;
710 if (PL_lex_state != LEX_KNOWNEXT) {
711 PL_lex_defer = PL_lex_state;
712 PL_lex_expect = PL_expect;
713 PL_lex_state = LEX_KNOWNEXT;
719 * When the lexer knows the next thing is a word (for instance, it has
720 * just seen -> and it knows that the next char is a word char, then
721 * it calls S_force_word to stick the next word into the PL_next lookahead.
724 * char *start : buffer position (must be within PL_linestr)
725 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
726 * int check_keyword : if true, Perl checks to make sure the word isn't
727 * a keyword (do this if the word is a label, e.g. goto FOO)
728 * int allow_pack : if true, : characters will also be allowed (require,
730 * int allow_initial_tick : used by the "sub" lexer only.
734 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
739 start = skipspace(start);
741 if (isIDFIRST_lazy(s) ||
742 (allow_pack && *s == ':') ||
743 (allow_initial_tick && *s == '\'') )
745 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
746 if (check_keyword && keyword(PL_tokenbuf, len))
748 if (token == METHOD) {
753 PL_expect = XOPERATOR;
756 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
757 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
765 * Called when the lexer wants $foo *foo &foo etc, but the program
766 * text only contains the "foo" portion. The first argument is a pointer
767 * to the "foo", and the second argument is the type symbol to prefix.
768 * Forces the next token to be a "WORD".
769 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
773 S_force_ident(pTHX_ register char *s, int kind)
776 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
777 PL_nextval[PL_nexttoke].opval = o;
780 dTHR; /* just for in_eval */
781 o->op_private = OPpCONST_ENTERED;
782 /* XXX see note in pp_entereval() for why we forgo typo
783 warnings if the symbol must be introduced in an eval.
785 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
786 kind == '$' ? SVt_PV :
787 kind == '@' ? SVt_PVAV :
788 kind == '%' ? SVt_PVHV :
797 * Forces the next token to be a version number.
801 S_force_version(pTHX_ char *s)
803 OP *version = Nullop;
807 /* default VERSION number -- GBARR */
812 for( d=s, c = 1; isDIGIT(*d) || *d == '_' || (*d == '.' && c--); d++);
813 if((*d == ';' || isSPACE(*d)) && *(skipspace(d)) != ',') {
815 /* real VERSION number -- GBARR */
816 version = yylval.opval;
820 /* NOTE: The parser sees the package name and the VERSION swapped */
821 PL_nextval[PL_nexttoke].opval = version;
829 * Tokenize a quoted string passed in as an SV. It finds the next
830 * chunk, up to end of string or a backslash. It may make a new
831 * SV containing that chunk (if HINT_NEW_STRING is on). It also
836 S_tokeq(pTHX_ SV *sv)
847 s = SvPV_force(sv, len);
851 while (s < send && *s != '\\')
856 if ( PL_hints & HINT_NEW_STRING )
857 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
860 if (s + 1 < send && (s[1] == '\\'))
861 s++; /* all that, just for this */
866 SvCUR_set(sv, d - SvPVX(sv));
868 if ( PL_hints & HINT_NEW_STRING )
869 return new_constant(NULL, 0, "q", sv, pv, "q");
874 * Now come three functions related to double-quote context,
875 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
876 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
877 * interact with PL_lex_state, and create fake ( ... ) argument lists
878 * to handle functions and concatenation.
879 * They assume that whoever calls them will be setting up a fake
880 * join call, because each subthing puts a ',' after it. This lets
883 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
885 * (I'm not sure whether the spurious commas at the end of lcfirst's
886 * arguments and join's arguments are created or not).
891 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
893 * Pattern matching will set PL_lex_op to the pattern-matching op to
894 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
896 * OP_CONST and OP_READLINE are easy--just make the new op and return.
898 * Everything else becomes a FUNC.
900 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
901 * had an OP_CONST or OP_READLINE). This just sets us up for a
902 * call to S_sublex_push().
908 register I32 op_type = yylval.ival;
910 if (op_type == OP_NULL) {
911 yylval.opval = PL_lex_op;
915 if (op_type == OP_CONST || op_type == OP_READLINE) {
916 SV *sv = tokeq(PL_lex_stuff);
918 if (SvTYPE(sv) == SVt_PVIV) {
919 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
925 nsv = newSVpvn(p, len);
929 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
930 PL_lex_stuff = Nullsv;
934 PL_sublex_info.super_state = PL_lex_state;
935 PL_sublex_info.sub_inwhat = op_type;
936 PL_sublex_info.sub_op = PL_lex_op;
937 PL_lex_state = LEX_INTERPPUSH;
941 yylval.opval = PL_lex_op;
951 * Create a new scope to save the lexing state. The scope will be
952 * ended in S_sublex_done. Returns a '(', starting the function arguments
953 * to the uc, lc, etc. found before.
954 * Sets PL_lex_state to LEX_INTERPCONCAT.
963 PL_lex_state = PL_sublex_info.super_state;
964 SAVEI32(PL_lex_dojoin);
965 SAVEI32(PL_lex_brackets);
966 SAVEI32(PL_lex_fakebrack);
967 SAVEI32(PL_lex_casemods);
968 SAVEI32(PL_lex_starts);
969 SAVEI32(PL_lex_state);
970 SAVESPTR(PL_lex_inpat);
971 SAVEI32(PL_lex_inwhat);
972 SAVEI16(PL_curcop->cop_line);
974 SAVEPPTR(PL_oldbufptr);
975 SAVEPPTR(PL_oldoldbufptr);
976 SAVEPPTR(PL_linestart);
977 SAVESPTR(PL_linestr);
978 SAVEPPTR(PL_lex_brackstack);
979 SAVEPPTR(PL_lex_casestack);
981 PL_linestr = PL_lex_stuff;
982 PL_lex_stuff = Nullsv;
984 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
986 PL_bufend += SvCUR(PL_linestr);
987 SAVEFREESV(PL_linestr);
989 PL_lex_dojoin = FALSE;
991 PL_lex_fakebrack = 0;
992 New(899, PL_lex_brackstack, 120, char);
993 New(899, PL_lex_casestack, 12, char);
994 SAVEFREEPV(PL_lex_brackstack);
995 SAVEFREEPV(PL_lex_casestack);
997 *PL_lex_casestack = '\0';
999 PL_lex_state = LEX_INTERPCONCAT;
1000 PL_curcop->cop_line = PL_multi_start;
1002 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1003 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1004 PL_lex_inpat = PL_sublex_info.sub_op;
1006 PL_lex_inpat = Nullop;
1013 * Restores lexer state after a S_sublex_push.
1019 if (!PL_lex_starts++) {
1020 PL_expect = XOPERATOR;
1021 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn("",0));
1025 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1026 PL_lex_state = LEX_INTERPCASEMOD;
1030 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1031 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1032 PL_linestr = PL_lex_repl;
1034 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1035 PL_bufend += SvCUR(PL_linestr);
1036 SAVEFREESV(PL_linestr);
1037 PL_lex_dojoin = FALSE;
1038 PL_lex_brackets = 0;
1039 PL_lex_fakebrack = 0;
1040 PL_lex_casemods = 0;
1041 *PL_lex_casestack = '\0';
1043 if (SvEVALED(PL_lex_repl)) {
1044 PL_lex_state = LEX_INTERPNORMAL;
1046 /* we don't clear PL_lex_repl here, so that we can check later
1047 whether this is an evalled subst; that means we rely on the
1048 logic to ensure sublex_done() is called again only via the
1049 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1052 PL_lex_state = LEX_INTERPCONCAT;
1053 PL_lex_repl = Nullsv;
1059 PL_bufend = SvPVX(PL_linestr);
1060 PL_bufend += SvCUR(PL_linestr);
1061 PL_expect = XOPERATOR;
1062 PL_sublex_info.sub_inwhat = 0;
1070 Extracts a pattern, double-quoted string, or transliteration. This
1073 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1074 processing a pattern (PL_lex_inpat is true), a transliteration
1075 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1077 Returns a pointer to the character scanned up to. Iff this is
1078 advanced from the start pointer supplied (ie if anything was
1079 successfully parsed), will leave an OP for the substring scanned
1080 in yylval. Caller must intuit reason for not parsing further
1081 by looking at the next characters herself.
1085 double-quoted style: \r and \n
1086 regexp special ones: \D \s
1088 backrefs: \1 (deprecated in substitution replacements)
1089 case and quoting: \U \Q \E
1090 stops on @ and $, but not for $ as tail anchor
1092 In transliterations:
1093 characters are VERY literal, except for - not at the start or end
1094 of the string, which indicates a range. scan_const expands the
1095 range to the full set of intermediate characters.
1097 In double-quoted strings:
1099 double-quoted style: \r and \n
1101 backrefs: \1 (deprecated)
1102 case and quoting: \U \Q \E
1105 scan_const does *not* construct ops to handle interpolated strings.
1106 It stops processing as soon as it finds an embedded $ or @ variable
1107 and leaves it to the caller to work out what's going on.
1109 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1111 $ in pattern could be $foo or could be tail anchor. Assumption:
1112 it's a tail anchor if $ is the last thing in the string, or if it's
1113 followed by one of ")| \n\t"
1115 \1 (backreferences) are turned into $1
1117 The structure of the code is
1118 while (there's a character to process) {
1119 handle transliteration ranges
1120 skip regexp comments
1121 skip # initiated comments in //x patterns
1122 check for embedded @foo
1123 check for embedded scalars
1125 leave intact backslashes from leave (below)
1126 deprecate \1 in strings and sub replacements
1127 handle string-changing backslashes \l \U \Q \E, etc.
1128 switch (what was escaped) {
1129 handle - in a transliteration (becomes a literal -)
1130 handle \132 octal characters
1131 handle 0x15 hex characters
1132 handle \cV (control V)
1133 handle printf backslashes (\f, \r, \n, etc)
1135 } (end if backslash)
1136 } (end while character to read)
1141 S_scan_const(pTHX_ char *start)
1143 register char *send = PL_bufend; /* end of the constant */
1144 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1145 register char *s = start; /* start of the constant */
1146 register char *d = SvPVX(sv); /* destination for copies */
1147 bool dorange = FALSE; /* are we in a translit range? */
1149 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1150 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1152 I32 thisutf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1153 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1154 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
1156 char *leaveit = /* set of acceptably-backslashed characters */
1158 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1161 while (s < send || dorange) {
1162 /* get transliterations out of the way (they're most literal) */
1163 if (PL_lex_inwhat == OP_TRANS) {
1164 /* expand a range A-Z to the full set of characters. AIE! */
1166 I32 i; /* current expanded character */
1167 I32 min; /* first character in range */
1168 I32 max; /* last character in range */
1170 i = d - SvPVX(sv); /* remember current offset */
1171 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1172 d = SvPVX(sv) + i; /* refresh d after realloc */
1173 d -= 2; /* eat the first char and the - */
1175 min = (U8)*d; /* first char in range */
1176 max = (U8)d[1]; /* last char in range */
1179 if ((isLOWER(min) && isLOWER(max)) ||
1180 (isUPPER(min) && isUPPER(max))) {
1182 for (i = min; i <= max; i++)
1186 for (i = min; i <= max; i++)
1193 for (i = min; i <= max; i++)
1196 /* mark the range as done, and continue */
1201 /* range begins (ignore - as first or last char) */
1202 else if (*s == '-' && s+1 < send && s != start) {
1204 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
1213 /* if we get here, we're not doing a transliteration */
1215 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1216 except for the last char, which will be done separately. */
1217 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1219 while (s < send && *s != ')')
1221 } else if (s[2] == '{'
1222 || s[2] == 'p' && s[3] == '{') { /* This should march regcomp.c */
1224 char *regparse = s + (s[2] == '{' ? 3 : 4);
1227 while (count && (c = *regparse)) {
1228 if (c == '\\' && regparse[1])
1236 if (*regparse != ')') {
1237 regparse--; /* Leave one char for continuation. */
1238 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1240 while (s < regparse)
1245 /* likewise skip #-initiated comments in //x patterns */
1246 else if (*s == '#' && PL_lex_inpat &&
1247 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1248 while (s+1 < send && *s != '\n')
1252 /* check for embedded arrays (@foo, @:foo, @'foo, @{foo}, @$foo) */
1253 else if (*s == '@' && s[1] && (isALNUM_lazy(s+1) || strchr(":'{$", s[1])))
1256 /* check for embedded scalars. only stop if we're sure it's a
1259 else if (*s == '$') {
1260 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1262 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1263 break; /* in regexp, $ might be tail anchor */
1266 /* (now in tr/// code again) */
1268 if (*s & 0x80 && thisutf) {
1269 dTHR; /* only for ckWARN */
1270 if (ckWARN(WARN_UTF8)) {
1271 (void)utf8_to_uv((U8*)s, &len); /* could cvt latin-1 to utf8 here... */
1281 if (*s == '\\' && s+1 < send) {
1284 /* some backslashes we leave behind */
1285 if (*leaveit && *s && strchr(leaveit, *s)) {
1291 /* deprecate \1 in strings and substitution replacements */
1292 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1293 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1295 dTHR; /* only for ckWARN */
1296 if (ckWARN(WARN_SYNTAX))
1297 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1302 /* string-change backslash escapes */
1303 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1308 /* if we get here, it's either a quoted -, or a digit */
1311 /* quoted - in transliterations */
1313 if (PL_lex_inwhat == OP_TRANS) {
1321 if (ckWARN(WARN_UNSAFE) && isALPHA(*s))
1322 Perl_warner(aTHX_ WARN_UNSAFE,
1323 "Unrecognized escape \\%c passed through",
1325 /* default action is to copy the quoted character */
1330 /* \132 indicates an octal constant */
1331 case '0': case '1': case '2': case '3':
1332 case '4': case '5': case '6': case '7':
1333 *d++ = scan_oct(s, 3, &len);
1337 /* \x24 indicates a hex constant */
1341 char* e = strchr(s, '}');
1344 yyerror("Missing right brace on \\x{}");
1349 if (ckWARN(WARN_UTF8))
1350 Perl_warner(aTHX_ WARN_UTF8,
1351 "Use of \\x{} without utf8 declaration");
1353 /* note: utf always shorter than hex */
1354 d = (char*)uv_to_utf8((U8*)d,
1355 scan_hex(s + 1, e - s - 1, &len));
1359 UV uv = (UV)scan_hex(s, 2, &len);
1360 if (utf && PL_lex_inwhat == OP_TRANS &&
1361 utf != (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1363 d = (char*)uv_to_utf8((U8*)d, uv); /* doing a CU or UC */
1366 if (uv >= 127 && UTF) {
1368 if (ckWARN(WARN_UTF8))
1369 Perl_warner(aTHX_ WARN_UTF8,
1370 "\\x%.*s will produce malformed UTF-8 character; use \\x{%.*s} for that",
1379 /* \N{latin small letter a} is a named character */
1383 char* e = strchr(s, '}');
1392 yyerror("Missing right brace on \\N{}");
1396 res = newSVpvn(s + 1, e - s - 1);
1397 res = new_constant( Nullch, 0, "charnames",
1398 res, Nullsv, "\\N{...}" );
1399 str = SvPV(res,len);
1400 if (len > e - s + 4) {
1401 char *odest = SvPVX(sv);
1403 SvGROW(sv, (SvCUR(sv) + len - (e - s + 4)));
1404 d = SvPVX(sv) + (d - odest);
1406 Copy(str, d, len, char);
1413 yyerror("Missing braces on \\N{}");
1416 /* \c is a control character */
1430 /* printf-style backslashes, formfeeds, newlines, etc */
1448 *d++ = '\047'; /* CP 1047 */
1451 *d++ = '\057'; /* CP 1047 */
1465 } /* end if (backslash) */
1468 } /* while loop to process each character */
1470 /* terminate the string and set up the sv */
1472 SvCUR_set(sv, d - SvPVX(sv));
1475 /* shrink the sv if we allocated more than we used */
1476 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1477 SvLEN_set(sv, SvCUR(sv) + 1);
1478 Renew(SvPVX(sv), SvLEN(sv), char);
1481 /* return the substring (via yylval) only if we parsed anything */
1482 if (s > PL_bufptr) {
1483 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1484 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1486 ( PL_lex_inwhat == OP_TRANS
1488 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1491 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1498 * Returns TRUE if there's more to the expression (e.g., a subscript),
1501 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1503 * ->[ and ->{ return TRUE
1504 * { and [ outside a pattern are always subscripts, so return TRUE
1505 * if we're outside a pattern and it's not { or [, then return FALSE
1506 * if we're in a pattern and the first char is a {
1507 * {4,5} (any digits around the comma) returns FALSE
1508 * if we're in a pattern and the first char is a [
1510 * [SOMETHING] has a funky algorithm to decide whether it's a
1511 * character class or not. It has to deal with things like
1512 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1513 * anything else returns TRUE
1516 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1519 S_intuit_more(pTHX_ register char *s)
1521 if (PL_lex_brackets)
1523 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1525 if (*s != '{' && *s != '[')
1530 /* In a pattern, so maybe we have {n,m}. */
1547 /* On the other hand, maybe we have a character class */
1550 if (*s == ']' || *s == '^')
1553 /* this is terrifying, and it works */
1554 int weight = 2; /* let's weigh the evidence */
1556 unsigned char un_char = 255, last_un_char;
1557 char *send = strchr(s,']');
1558 char tmpbuf[sizeof PL_tokenbuf * 4];
1560 if (!send) /* has to be an expression */
1563 Zero(seen,256,char);
1566 else if (isDIGIT(*s)) {
1568 if (isDIGIT(s[1]) && s[2] == ']')
1574 for (; s < send; s++) {
1575 last_un_char = un_char;
1576 un_char = (unsigned char)*s;
1581 weight -= seen[un_char] * 10;
1582 if (isALNUM_lazy(s+1)) {
1583 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1584 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1589 else if (*s == '$' && s[1] &&
1590 strchr("[#!%*<>()-=",s[1])) {
1591 if (/*{*/ strchr("])} =",s[2]))
1600 if (strchr("wds]",s[1]))
1602 else if (seen['\''] || seen['"'])
1604 else if (strchr("rnftbxcav",s[1]))
1606 else if (isDIGIT(s[1])) {
1608 while (s[1] && isDIGIT(s[1]))
1618 if (strchr("aA01! ",last_un_char))
1620 if (strchr("zZ79~",s[1]))
1622 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1623 weight -= 5; /* cope with negative subscript */
1626 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1627 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1632 if (keyword(tmpbuf, d - tmpbuf))
1635 if (un_char == last_un_char + 1)
1637 weight -= seen[un_char];
1642 if (weight >= 0) /* probably a character class */
1652 * Does all the checking to disambiguate
1654 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1655 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1657 * First argument is the stuff after the first token, e.g. "bar".
1659 * Not a method if bar is a filehandle.
1660 * Not a method if foo is a subroutine prototyped to take a filehandle.
1661 * Not a method if it's really "Foo $bar"
1662 * Method if it's "foo $bar"
1663 * Not a method if it's really "print foo $bar"
1664 * Method if it's really "foo package::" (interpreted as package->foo)
1665 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1666 * Not a method if bar is a filehandle or package, but is quotd with
1671 S_intuit_method(pTHX_ char *start, GV *gv)
1673 char *s = start + (*start == '$');
1674 char tmpbuf[sizeof PL_tokenbuf];
1682 if ((cv = GvCVu(gv))) {
1683 char *proto = SvPVX(cv);
1693 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1694 /* start is the beginning of the possible filehandle/object,
1695 * and s is the end of it
1696 * tmpbuf is a copy of it
1699 if (*start == '$') {
1700 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1705 return *s == '(' ? FUNCMETH : METHOD;
1707 if (!keyword(tmpbuf, len)) {
1708 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1713 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1714 if (indirgv && GvCVu(indirgv))
1716 /* filehandle or package name makes it a method */
1717 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1719 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1720 return 0; /* no assumptions -- "=>" quotes bearword */
1722 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1723 newSVpvn(tmpbuf,len));
1724 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1728 return *s == '(' ? FUNCMETH : METHOD;
1736 * Return a string of Perl code to load the debugger. If PERL5DB
1737 * is set, it will return the contents of that, otherwise a
1738 * compile-time require of perl5db.pl.
1745 char *pdb = PerlEnv_getenv("PERL5DB");
1749 SETERRNO(0,SS$_NORMAL);
1750 return "BEGIN { require 'perl5db.pl' }";
1756 /* Encoded script support. filter_add() effectively inserts a
1757 * 'pre-processing' function into the current source input stream.
1758 * Note that the filter function only applies to the current source file
1759 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1761 * The datasv parameter (which may be NULL) can be used to pass
1762 * private data to this instance of the filter. The filter function
1763 * can recover the SV using the FILTER_DATA macro and use it to
1764 * store private buffers and state information.
1766 * The supplied datasv parameter is upgraded to a PVIO type
1767 * and the IoDIRP field is used to store the function pointer.
1768 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1769 * private use must be set using malloc'd pointers.
1773 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1775 if (!funcp){ /* temporary handy debugging hack to be deleted */
1776 PL_filter_debug = atoi((char*)datasv);
1779 if (!PL_rsfp_filters)
1780 PL_rsfp_filters = newAV();
1782 datasv = NEWSV(255,0);
1783 if (!SvUPGRADE(datasv, SVt_PVIO))
1784 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1785 IoDIRP(datasv) = (DIR*)funcp; /* stash funcp into spare field */
1787 if (PL_filter_debug) {
1789 Perl_warn(aTHX_ "filter_add func %p (%s)", funcp, SvPV(datasv, n_a));
1791 #endif /* DEBUGGING */
1792 av_unshift(PL_rsfp_filters, 1);
1793 av_store(PL_rsfp_filters, 0, datasv) ;
1798 /* Delete most recently added instance of this filter function. */
1800 Perl_filter_del(pTHX_ filter_t funcp)
1803 if (PL_filter_debug)
1804 Perl_warn(aTHX_ "filter_del func %p", funcp);
1805 #endif /* DEBUGGING */
1806 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1808 /* if filter is on top of stack (usual case) just pop it off */
1809 if (IoDIRP(FILTER_DATA(AvFILLp(PL_rsfp_filters))) == (DIR*)funcp){
1810 IoDIRP(FILTER_DATA(AvFILLp(PL_rsfp_filters))) = NULL;
1811 sv_free(av_pop(PL_rsfp_filters));
1815 /* we need to search for the correct entry and clear it */
1816 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1820 /* Invoke the n'th filter function for the current rsfp. */
1822 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1825 /* 0 = read one text line */
1830 if (!PL_rsfp_filters)
1832 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
1833 /* Provide a default input filter to make life easy. */
1834 /* Note that we append to the line. This is handy. */
1836 if (PL_filter_debug)
1837 Perl_warn(aTHX_ "filter_read %d: from rsfp\n", idx);
1838 #endif /* DEBUGGING */
1842 int old_len = SvCUR(buf_sv) ;
1844 /* ensure buf_sv is large enough */
1845 SvGROW(buf_sv, old_len + maxlen) ;
1846 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
1847 if (PerlIO_error(PL_rsfp))
1848 return -1; /* error */
1850 return 0 ; /* end of file */
1852 SvCUR_set(buf_sv, old_len + len) ;
1855 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
1856 if (PerlIO_error(PL_rsfp))
1857 return -1; /* error */
1859 return 0 ; /* end of file */
1862 return SvCUR(buf_sv);
1864 /* Skip this filter slot if filter has been deleted */
1865 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
1867 if (PL_filter_debug)
1868 Perl_warn(aTHX_ "filter_read %d: skipped (filter deleted)\n", idx);
1869 #endif /* DEBUGGING */
1870 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
1872 /* Get function pointer hidden within datasv */
1873 funcp = (filter_t)IoDIRP(datasv);
1875 if (PL_filter_debug) {
1877 Perl_warn(aTHX_ "filter_read %d: via function %p (%s)\n",
1878 idx, funcp, SvPV(datasv,n_a));
1880 #endif /* DEBUGGING */
1881 /* Call function. The function is expected to */
1882 /* call "FILTER_READ(idx+1, buf_sv)" first. */
1883 /* Return: <0:error, =0:eof, >0:not eof */
1884 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
1888 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
1891 if (!PL_rsfp_filters) {
1892 filter_add(win32_textfilter,NULL);
1895 if (PL_rsfp_filters) {
1898 SvCUR_set(sv, 0); /* start with empty line */
1899 if (FILTER_READ(0, sv, 0) > 0)
1900 return ( SvPVX(sv) ) ;
1905 return (sv_gets(sv, fp, append));
1910 static char* exp_name[] =
1911 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
1912 "ATTRTERM", "TERMBLOCK"
1919 Works out what to call the token just pulled out of the input
1920 stream. The yacc parser takes care of taking the ops we return and
1921 stitching them into a tree.
1927 if read an identifier
1928 if we're in a my declaration
1929 croak if they tried to say my($foo::bar)
1930 build the ops for a my() declaration
1931 if it's an access to a my() variable
1932 are we in a sort block?
1933 croak if my($a); $a <=> $b
1934 build ops for access to a my() variable
1935 if in a dq string, and they've said @foo and we can't find @foo
1937 build ops for a bareword
1938 if we already built the token before, use it.
1942 #ifdef USE_PURE_BISON
1943 Perl_yylex(pTHX_ YYSTYPE *lvalp, int *lcharp)
1956 #ifdef USE_PURE_BISON
1957 yylval_pointer = lvalp;
1958 yychar_pointer = lcharp;
1961 /* check if there's an identifier for us to look at */
1962 if (PL_pending_ident) {
1963 /* pit holds the identifier we read and pending_ident is reset */
1964 char pit = PL_pending_ident;
1965 PL_pending_ident = 0;
1967 /* if we're in a my(), we can't allow dynamics here.
1968 $foo'bar has already been turned into $foo::bar, so
1969 just check for colons.
1971 if it's a legal name, the OP is a PADANY.
1974 if (strchr(PL_tokenbuf,':'))
1975 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
1977 yylval.opval = newOP(OP_PADANY, 0);
1978 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
1983 build the ops for accesses to a my() variable.
1985 Deny my($a) or my($b) in a sort block, *if* $a or $b is
1986 then used in a comparison. This catches most, but not
1987 all cases. For instance, it catches
1988 sort { my($a); $a <=> $b }
1990 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
1991 (although why you'd do that is anyone's guess).
1994 if (!strchr(PL_tokenbuf,':')) {
1996 /* Check for single character per-thread SVs */
1997 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
1998 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
1999 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2001 yylval.opval = newOP(OP_THREADSV, 0);
2002 yylval.opval->op_targ = tmp;
2005 #endif /* USE_THREADS */
2006 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2007 /* if it's a sort block and they're naming $a or $b */
2008 if (PL_last_lop_op == OP_SORT &&
2009 PL_tokenbuf[0] == '$' &&
2010 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2013 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2014 d < PL_bufend && *d != '\n';
2017 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2018 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2024 yylval.opval = newOP(OP_PADANY, 0);
2025 yylval.opval->op_targ = tmp;
2031 Whine if they've said @foo in a doublequoted string,
2032 and @foo isn't a variable we can find in the symbol
2035 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2036 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2037 if (!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2038 yyerror(Perl_form(aTHX_ "In string, %s now must be written as \\%s",
2039 PL_tokenbuf, PL_tokenbuf));
2042 /* build ops for a bareword */
2043 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2044 yylval.opval->op_private = OPpCONST_ENTERED;
2045 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2046 ((PL_tokenbuf[0] == '$') ? SVt_PV
2047 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2052 /* no identifier pending identification */
2054 switch (PL_lex_state) {
2056 case LEX_NORMAL: /* Some compilers will produce faster */
2057 case LEX_INTERPNORMAL: /* code if we comment these out. */
2061 /* when we've already built the next token, just pull it out of the queue */
2064 yylval = PL_nextval[PL_nexttoke];
2066 PL_lex_state = PL_lex_defer;
2067 PL_expect = PL_lex_expect;
2068 PL_lex_defer = LEX_NORMAL;
2070 return(PL_nexttype[PL_nexttoke]);
2072 /* interpolated case modifiers like \L \U, including \Q and \E.
2073 when we get here, PL_bufptr is at the \
2075 case LEX_INTERPCASEMOD:
2077 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2078 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2080 /* handle \E or end of string */
2081 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2085 if (PL_lex_casemods) {
2086 oldmod = PL_lex_casestack[--PL_lex_casemods];
2087 PL_lex_casestack[PL_lex_casemods] = '\0';
2089 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2091 PL_lex_state = LEX_INTERPCONCAT;
2095 if (PL_bufptr != PL_bufend)
2097 PL_lex_state = LEX_INTERPCONCAT;
2102 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2103 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2104 if (strchr("LU", *s) &&
2105 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2107 PL_lex_casestack[--PL_lex_casemods] = '\0';
2110 if (PL_lex_casemods > 10) {
2111 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2112 if (newlb != PL_lex_casestack) {
2114 PL_lex_casestack = newlb;
2117 PL_lex_casestack[PL_lex_casemods++] = *s;
2118 PL_lex_casestack[PL_lex_casemods] = '\0';
2119 PL_lex_state = LEX_INTERPCONCAT;
2120 PL_nextval[PL_nexttoke].ival = 0;
2123 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2125 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2127 PL_nextval[PL_nexttoke].ival = OP_LC;
2129 PL_nextval[PL_nexttoke].ival = OP_UC;
2131 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2133 Perl_croak(aTHX_ "panic: yylex");
2136 if (PL_lex_starts) {
2145 case LEX_INTERPPUSH:
2146 return sublex_push();
2148 case LEX_INTERPSTART:
2149 if (PL_bufptr == PL_bufend)
2150 return sublex_done();
2152 PL_lex_dojoin = (*PL_bufptr == '@');
2153 PL_lex_state = LEX_INTERPNORMAL;
2154 if (PL_lex_dojoin) {
2155 PL_nextval[PL_nexttoke].ival = 0;
2158 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2159 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2160 force_next(PRIVATEREF);
2162 force_ident("\"", '$');
2163 #endif /* USE_THREADS */
2164 PL_nextval[PL_nexttoke].ival = 0;
2166 PL_nextval[PL_nexttoke].ival = 0;
2168 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2171 if (PL_lex_starts++) {
2177 case LEX_INTERPENDMAYBE:
2178 if (intuit_more(PL_bufptr)) {
2179 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2185 if (PL_lex_dojoin) {
2186 PL_lex_dojoin = FALSE;
2187 PL_lex_state = LEX_INTERPCONCAT;
2190 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2191 && SvEVALED(PL_lex_repl))
2193 if (PL_bufptr != PL_bufend)
2194 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2195 PL_lex_repl = Nullsv;
2198 case LEX_INTERPCONCAT:
2200 if (PL_lex_brackets)
2201 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2203 if (PL_bufptr == PL_bufend)
2204 return sublex_done();
2206 if (SvIVX(PL_linestr) == '\'') {
2207 SV *sv = newSVsv(PL_linestr);
2210 else if ( PL_hints & HINT_NEW_RE )
2211 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2212 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2216 s = scan_const(PL_bufptr);
2218 PL_lex_state = LEX_INTERPCASEMOD;
2220 PL_lex_state = LEX_INTERPSTART;
2223 if (s != PL_bufptr) {
2224 PL_nextval[PL_nexttoke] = yylval;
2227 if (PL_lex_starts++)
2237 PL_lex_state = LEX_NORMAL;
2238 s = scan_formline(PL_bufptr);
2239 if (!PL_lex_formbrack)
2245 PL_oldoldbufptr = PL_oldbufptr;
2248 PerlIO_printf(PerlIO_stderr(), "### Tokener expecting %s at %s\n", exp_name[PL_expect], s);
2254 if (isIDFIRST_lazy(s))
2256 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2259 goto fake_eof; /* emulate EOF on ^D or ^Z */
2264 if (PL_lex_brackets)
2265 yyerror("Missing right curly or square bracket");
2268 if (s++ < PL_bufend)
2269 goto retry; /* ignore stray nulls */
2272 if (!PL_in_eval && !PL_preambled) {
2273 PL_preambled = TRUE;
2274 sv_setpv(PL_linestr,incl_perldb());
2275 if (SvCUR(PL_linestr))
2276 sv_catpv(PL_linestr,";");
2278 while(AvFILLp(PL_preambleav) >= 0) {
2279 SV *tmpsv = av_shift(PL_preambleav);
2280 sv_catsv(PL_linestr, tmpsv);
2281 sv_catpv(PL_linestr, ";");
2284 sv_free((SV*)PL_preambleav);
2285 PL_preambleav = NULL;
2287 if (PL_minus_n || PL_minus_p) {
2288 sv_catpv(PL_linestr, "LINE: while (<>) {");
2290 sv_catpv(PL_linestr,"chomp;");
2292 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2294 GvIMPORTED_AV_on(gv);
2296 if (strchr("/'\"", *PL_splitstr)
2297 && strchr(PL_splitstr + 1, *PL_splitstr))
2298 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2301 s = "'~#\200\1'"; /* surely one char is unused...*/
2302 while (s[1] && strchr(PL_splitstr, *s)) s++;
2304 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2305 "q" + (delim == '\''), delim);
2306 for (s = PL_splitstr; *s; s++) {
2308 sv_catpvn(PL_linestr, "\\", 1);
2309 sv_catpvn(PL_linestr, s, 1);
2311 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2315 sv_catpv(PL_linestr,"@F=split(' ');");
2318 sv_catpv(PL_linestr, "\n");
2319 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2320 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2321 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2322 SV *sv = NEWSV(85,0);
2324 sv_upgrade(sv, SVt_PVMG);
2325 sv_setsv(sv,PL_linestr);
2326 av_store(GvAV(PL_curcop->cop_filegv),(I32)PL_curcop->cop_line,sv);
2331 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2334 if (PL_preprocess && !PL_in_eval)
2335 (void)PerlProc_pclose(PL_rsfp);
2336 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2337 PerlIO_clearerr(PL_rsfp);
2339 (void)PerlIO_close(PL_rsfp);
2341 PL_doextract = FALSE;
2343 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2344 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2345 sv_catpv(PL_linestr,";}");
2346 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2347 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2348 PL_minus_n = PL_minus_p = 0;
2351 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2352 sv_setpv(PL_linestr,"");
2353 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2356 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2357 PL_doextract = FALSE;
2359 /* Incest with pod. */
2360 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2361 sv_setpv(PL_linestr, "");
2362 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2363 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2364 PL_doextract = FALSE;
2368 } while (PL_doextract);
2369 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2370 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2371 SV *sv = NEWSV(85,0);
2373 sv_upgrade(sv, SVt_PVMG);
2374 sv_setsv(sv,PL_linestr);
2375 av_store(GvAV(PL_curcop->cop_filegv),(I32)PL_curcop->cop_line,sv);
2377 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2378 if (PL_curcop->cop_line == 1) {
2379 while (s < PL_bufend && isSPACE(*s))
2381 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2385 if (*s == '#' && *(s+1) == '!')
2387 #ifdef ALTERNATE_SHEBANG
2389 static char as[] = ALTERNATE_SHEBANG;
2390 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2391 d = s + (sizeof(as) - 1);
2393 #endif /* ALTERNATE_SHEBANG */
2402 while (*d && !isSPACE(*d))
2406 #ifdef ARG_ZERO_IS_SCRIPT
2407 if (ipathend > ipath) {
2409 * HP-UX (at least) sets argv[0] to the script name,
2410 * which makes $^X incorrect. And Digital UNIX and Linux,
2411 * at least, set argv[0] to the basename of the Perl
2412 * interpreter. So, having found "#!", we'll set it right.
2414 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2415 assert(SvPOK(x) || SvGMAGICAL(x));
2416 if (sv_eq(x, GvSV(PL_curcop->cop_filegv))) {
2417 sv_setpvn(x, ipath, ipathend - ipath);
2420 TAINT_NOT; /* $^X is always tainted, but that's OK */
2422 #endif /* ARG_ZERO_IS_SCRIPT */
2427 d = instr(s,"perl -");
2429 d = instr(s,"perl");
2431 /* avoid getting into infinite loops when shebang
2432 * line contains "Perl" rather than "perl" */
2434 for (d = ipathend-4; d >= ipath; --d) {
2435 if ((*d == 'p' || *d == 'P')
2436 && !ibcmp(d, "perl", 4))
2446 #ifdef ALTERNATE_SHEBANG
2448 * If the ALTERNATE_SHEBANG on this system starts with a
2449 * character that can be part of a Perl expression, then if
2450 * we see it but not "perl", we're probably looking at the
2451 * start of Perl code, not a request to hand off to some
2452 * other interpreter. Similarly, if "perl" is there, but
2453 * not in the first 'word' of the line, we assume the line
2454 * contains the start of the Perl program.
2456 if (d && *s != '#') {
2458 while (*c && !strchr("; \t\r\n\f\v#", *c))
2461 d = Nullch; /* "perl" not in first word; ignore */
2463 *s = '#'; /* Don't try to parse shebang line */
2465 #endif /* ALTERNATE_SHEBANG */
2470 !instr(s,"indir") &&
2471 instr(PL_origargv[0],"perl"))
2477 while (s < PL_bufend && isSPACE(*s))
2479 if (s < PL_bufend) {
2480 Newz(899,newargv,PL_origargc+3,char*);
2482 while (s < PL_bufend && !isSPACE(*s))
2485 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2488 newargv = PL_origargv;
2490 PerlProc_execv(ipath, newargv);
2491 Perl_croak(aTHX_ "Can't exec %s", ipath);
2494 U32 oldpdb = PL_perldb;
2495 bool oldn = PL_minus_n;
2496 bool oldp = PL_minus_p;
2498 while (*d && !isSPACE(*d)) d++;
2499 while (*d == ' ' || *d == '\t') d++;
2503 if (*d == 'M' || *d == 'm') {
2505 while (*d && !isSPACE(*d)) d++;
2506 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2509 d = moreswitches(d);
2511 if (PERLDB_LINE && !oldpdb ||
2512 ( PL_minus_n || PL_minus_p ) && !(oldn || oldp) )
2513 /* if we have already added "LINE: while (<>) {",
2514 we must not do it again */
2516 sv_setpv(PL_linestr, "");
2517 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2518 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2519 PL_preambled = FALSE;
2521 (void)gv_fetchfile(PL_origfilename);
2528 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2530 PL_lex_state = LEX_FORMLINE;
2535 #ifdef PERL_STRICT_CR
2536 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2538 "(Maybe you didn't strip carriage returns after a network transfer?)\n");
2540 case ' ': case '\t': case '\f': case 013:
2545 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2547 while (s < d && *s != '\n')
2552 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2554 PL_lex_state = LEX_FORMLINE;
2564 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2569 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
2572 if (strnEQ(s,"=>",2)) {
2573 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2574 OPERATOR('-'); /* unary minus */
2576 PL_last_uni = PL_oldbufptr;
2577 PL_last_lop_op = OP_FTEREAD; /* good enough */
2579 case 'r': FTST(OP_FTEREAD);
2580 case 'w': FTST(OP_FTEWRITE);
2581 case 'x': FTST(OP_FTEEXEC);
2582 case 'o': FTST(OP_FTEOWNED);
2583 case 'R': FTST(OP_FTRREAD);
2584 case 'W': FTST(OP_FTRWRITE);
2585 case 'X': FTST(OP_FTREXEC);
2586 case 'O': FTST(OP_FTROWNED);
2587 case 'e': FTST(OP_FTIS);
2588 case 'z': FTST(OP_FTZERO);
2589 case 's': FTST(OP_FTSIZE);
2590 case 'f': FTST(OP_FTFILE);
2591 case 'd': FTST(OP_FTDIR);
2592 case 'l': FTST(OP_FTLINK);
2593 case 'p': FTST(OP_FTPIPE);
2594 case 'S': FTST(OP_FTSOCK);
2595 case 'u': FTST(OP_FTSUID);
2596 case 'g': FTST(OP_FTSGID);
2597 case 'k': FTST(OP_FTSVTX);
2598 case 'b': FTST(OP_FTBLK);
2599 case 'c': FTST(OP_FTCHR);
2600 case 't': FTST(OP_FTTTY);
2601 case 'T': FTST(OP_FTTEXT);
2602 case 'B': FTST(OP_FTBINARY);
2603 case 'M': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTMTIME);
2604 case 'A': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTATIME);
2605 case 'C': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTCTIME);
2607 Perl_croak(aTHX_ "Unrecognized file test: -%c", (int)tmp);
2614 if (PL_expect == XOPERATOR)
2619 else if (*s == '>') {
2622 if (isIDFIRST_lazy(s)) {
2623 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2631 if (PL_expect == XOPERATOR)
2634 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2636 OPERATOR('-'); /* unary minus */
2643 if (PL_expect == XOPERATOR)
2648 if (PL_expect == XOPERATOR)
2651 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2657 if (PL_expect != XOPERATOR) {
2658 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2659 PL_expect = XOPERATOR;
2660 force_ident(PL_tokenbuf, '*');
2673 if (PL_expect == XOPERATOR) {
2677 PL_tokenbuf[0] = '%';
2678 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2679 if (!PL_tokenbuf[1]) {
2681 yyerror("Final % should be \\% or %name");
2684 PL_pending_ident = '%';
2703 switch (PL_expect) {
2706 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2708 PL_bufptr = s; /* update in case we back off */
2714 PL_expect = XTERMBLOCK;
2718 while (isIDFIRST_lazy(s)) {
2719 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2721 d = scan_str(d,TRUE,TRUE);
2724 SvREFCNT_dec(PL_lex_stuff);
2725 PL_lex_stuff = Nullsv;
2727 /* MUST advance bufptr here to avoid bogus
2728 "at end of line" context messages from yyerror().
2730 PL_bufptr = s + len;
2731 yyerror("Unterminated attribute parameter in attribute list");
2734 return 0; /* EOF indicator */
2738 SV *sv = newSVpvn(s, len);
2739 sv_catsv(sv, PL_lex_stuff);
2740 attrs = append_elem(OP_LIST, attrs,
2741 newSVOP(OP_CONST, 0, sv));
2742 SvREFCNT_dec(PL_lex_stuff);
2743 PL_lex_stuff = Nullsv;
2746 attrs = append_elem(OP_LIST, attrs,
2747 newSVOP(OP_CONST, 0,
2754 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}' for vi */
2755 if (*s != ';' && *s != tmp) {
2756 char q = ((*s == '\'') ? '"' : '\'');
2757 /* If here for an expression, and parsed no attrs, back off. */
2758 if (tmp == '=' && !attrs) {
2762 /* MUST advance bufptr here to avoid bogus "at end of line"
2763 context messages from yyerror().
2767 yyerror("Unterminated attribute list");
2769 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
2776 PL_nextval[PL_nexttoke].opval = attrs;
2784 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
2785 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
2790 if (PL_curcop->cop_line < PL_copline)
2791 PL_copline = PL_curcop->cop_line;
2802 if (PL_lex_brackets <= 0)
2803 yyerror("Unmatched right square bracket");
2806 if (PL_lex_state == LEX_INTERPNORMAL) {
2807 if (PL_lex_brackets == 0) {
2808 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
2809 PL_lex_state = LEX_INTERPEND;
2816 if (PL_lex_brackets > 100) {
2817 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
2818 if (newlb != PL_lex_brackstack) {
2820 PL_lex_brackstack = newlb;
2823 switch (PL_expect) {
2825 if (PL_lex_formbrack) {
2829 if (PL_oldoldbufptr == PL_last_lop)
2830 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
2832 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
2833 OPERATOR(HASHBRACK);
2835 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
2838 PL_tokenbuf[0] = '\0';
2839 if (d < PL_bufend && *d == '-') {
2840 PL_tokenbuf[0] = '-';
2842 while (d < PL_bufend && (*d == ' ' || *d == '\t'))
2845 if (d < PL_bufend && isIDFIRST_lazy(d)) {
2846 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
2848 while (d < PL_bufend && (*d == ' ' || *d == '\t'))
2851 char minus = (PL_tokenbuf[0] == '-');
2852 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
2860 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
2865 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
2870 if (PL_oldoldbufptr == PL_last_lop)
2871 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
2873 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
2876 OPERATOR(HASHBRACK);
2877 /* This hack serves to disambiguate a pair of curlies
2878 * as being a block or an anon hash. Normally, expectation
2879 * determines that, but in cases where we're not in a
2880 * position to expect anything in particular (like inside
2881 * eval"") we have to resolve the ambiguity. This code
2882 * covers the case where the first term in the curlies is a
2883 * quoted string. Most other cases need to be explicitly
2884 * disambiguated by prepending a `+' before the opening
2885 * curly in order to force resolution as an anon hash.
2887 * XXX should probably propagate the outer expectation
2888 * into eval"" to rely less on this hack, but that could
2889 * potentially break current behavior of eval"".
2893 if (*s == '\'' || *s == '"' || *s == '`') {
2894 /* common case: get past first string, handling escapes */
2895 for (t++; t < PL_bufend && *t != *s;)
2896 if (*t++ == '\\' && (*t == '\\' || *t == *s))
2900 else if (*s == 'q') {
2903 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
2904 && !isALNUM(*t)))) {
2906 char open, close, term;
2909 while (t < PL_bufend && isSPACE(*t))
2913 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
2917 for (t++; t < PL_bufend; t++) {
2918 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
2920 else if (*t == open)
2924 for (t++; t < PL_bufend; t++) {
2925 if (*t == '\\' && t+1 < PL_bufend)
2927 else if (*t == close && --brackets <= 0)
2929 else if (*t == open)
2935 else if (isIDFIRST_lazy(s)) {
2936 for (t++; t < PL_bufend && isALNUM_lazy(t); t++) ;
2938 while (t < PL_bufend && isSPACE(*t))
2940 /* if comma follows first term, call it an anon hash */
2941 /* XXX it could be a comma expression with loop modifiers */
2942 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
2943 || (*t == '=' && t[1] == '>')))
2944 OPERATOR(HASHBRACK);
2945 if (PL_expect == XREF)
2948 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
2954 yylval.ival = PL_curcop->cop_line;
2955 if (isSPACE(*s) || *s == '#')
2956 PL_copline = NOLINE; /* invalidate current command line number */
2961 if (PL_lex_brackets <= 0)
2962 yyerror("Unmatched right curly bracket");
2964 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
2965 if (PL_lex_brackets < PL_lex_formbrack)
2966 PL_lex_formbrack = 0;
2967 if (PL_lex_state == LEX_INTERPNORMAL) {
2968 if (PL_lex_brackets == 0) {
2969 if (PL_lex_fakebrack) {
2970 PL_lex_state = LEX_INTERPEND;
2972 return yylex(); /* ignore fake brackets */
2974 if (*s == '-' && s[1] == '>')
2975 PL_lex_state = LEX_INTERPENDMAYBE;
2976 else if (*s != '[' && *s != '{')
2977 PL_lex_state = LEX_INTERPEND;
2980 if (PL_lex_brackets < PL_lex_fakebrack) {
2982 PL_lex_fakebrack = 0;
2983 return yylex(); /* ignore fake brackets */
2993 if (PL_expect == XOPERATOR) {
2994 if (ckWARN(WARN_SEMICOLON) && isIDFIRST_lazy(s) && PL_bufptr == PL_linestart) {
2995 PL_curcop->cop_line--;
2996 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
2997 PL_curcop->cop_line++;
3002 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3004 PL_expect = XOPERATOR;
3005 force_ident(PL_tokenbuf, '&');
3009 yylval.ival = (OPpENTERSUB_AMPER<<8);
3028 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3029 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3031 if (PL_expect == XSTATE && isALPHA(tmp) &&
3032 (s == PL_linestart+1 || s[-2] == '\n') )
3034 if (PL_in_eval && !PL_rsfp) {
3039 if (strnEQ(s,"=cut",4)) {
3053 PL_doextract = TRUE;
3056 if (PL_lex_brackets < PL_lex_formbrack) {
3058 #ifdef PERL_STRICT_CR
3059 for (t = s; *t == ' ' || *t == '\t'; t++) ;
3061 for (t = s; *t == ' ' || *t == '\t' || *t == '\r'; t++) ;
3063 if (*t == '\n' || *t == '#') {
3081 if (PL_expect != XOPERATOR) {
3082 if (s[1] != '<' && !strchr(s,'>'))
3085 s = scan_heredoc(s);
3087 s = scan_inputsymbol(s);
3088 TERM(sublex_start());
3093 SHop(OP_LEFT_SHIFT);
3107 SHop(OP_RIGHT_SHIFT);
3116 if (PL_expect == XOPERATOR) {
3117 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3120 return ','; /* grandfather non-comma-format format */
3124 if (s[1] == '#' && (isIDFIRST_lazy(s+2) || strchr("{$:+-", s[2]))) {
3125 PL_tokenbuf[0] = '@';
3126 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3127 sizeof PL_tokenbuf - 1, FALSE);
3128 if (PL_expect == XOPERATOR)
3129 no_op("Array length", s);
3130 if (!PL_tokenbuf[1])
3132 PL_expect = XOPERATOR;
3133 PL_pending_ident = '#';
3137 PL_tokenbuf[0] = '$';
3138 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3139 sizeof PL_tokenbuf - 1, FALSE);
3140 if (PL_expect == XOPERATOR)
3142 if (!PL_tokenbuf[1]) {
3144 yyerror("Final $ should be \\$ or $name");
3148 /* This kludge not intended to be bulletproof. */
3149 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3150 yylval.opval = newSVOP(OP_CONST, 0,
3151 newSViv((IV)PL_compiling.cop_arybase));
3152 yylval.opval->op_private = OPpCONST_ARYBASE;
3158 if (PL_lex_state == LEX_NORMAL)
3161 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3164 PL_tokenbuf[0] = '@';
3165 if (ckWARN(WARN_SYNTAX)) {
3167 isSPACE(*t) || isALNUM_lazy(t) || *t == '$';
3170 PL_bufptr = skipspace(PL_bufptr);
3171 while (t < PL_bufend && *t != ']')
3173 Perl_warner(aTHX_ WARN_SYNTAX,
3174 "Multidimensional syntax %.*s not supported",
3175 (t - PL_bufptr) + 1, PL_bufptr);
3179 else if (*s == '{') {
3180 PL_tokenbuf[0] = '%';
3181 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3182 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3184 char tmpbuf[sizeof PL_tokenbuf];
3186 for (t++; isSPACE(*t); t++) ;
3187 if (isIDFIRST_lazy(t)) {
3188 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3189 for (; isSPACE(*t); t++) ;
3190 if (*t == ';' && get_cv(tmpbuf, FALSE))
3191 Perl_warner(aTHX_ WARN_SYNTAX,
3192 "You need to quote \"%s\"", tmpbuf);
3198 PL_expect = XOPERATOR;
3199 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3200 bool islop = (PL_last_lop == PL_oldoldbufptr);
3201 if (!islop || PL_last_lop_op == OP_GREPSTART)
3202 PL_expect = XOPERATOR;
3203 else if (strchr("$@\"'`q", *s))
3204 PL_expect = XTERM; /* e.g. print $fh "foo" */
3205 else if (strchr("&*<%", *s) && isIDFIRST_lazy(s+1))
3206 PL_expect = XTERM; /* e.g. print $fh &sub */
3207 else if (isIDFIRST_lazy(s)) {
3208 char tmpbuf[sizeof PL_tokenbuf];
3209 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3210 if (tmp = keyword(tmpbuf, len)) {
3211 /* binary operators exclude handle interpretations */
3223 PL_expect = XTERM; /* e.g. print $fh length() */
3228 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3229 if (gv && GvCVu(gv))
3230 PL_expect = XTERM; /* e.g. print $fh subr() */
3233 else if (isDIGIT(*s))
3234 PL_expect = XTERM; /* e.g. print $fh 3 */
3235 else if (*s == '.' && isDIGIT(s[1]))
3236 PL_expect = XTERM; /* e.g. print $fh .3 */
3237 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3238 PL_expect = XTERM; /* e.g. print $fh -1 */
3239 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3240 PL_expect = XTERM; /* print $fh <<"EOF" */
3242 PL_pending_ident = '$';
3246 if (PL_expect == XOPERATOR)
3248 PL_tokenbuf[0] = '@';
3249 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3250 if (!PL_tokenbuf[1]) {
3252 yyerror("Final @ should be \\@ or @name");
3255 if (PL_lex_state == LEX_NORMAL)
3257 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3259 PL_tokenbuf[0] = '%';
3261 /* Warn about @ where they meant $. */
3262 if (ckWARN(WARN_SYNTAX)) {
3263 if (*s == '[' || *s == '{') {
3265 while (*t && (isALNUM_lazy(t) || strchr(" \t$#+-'\"", *t)))
3267 if (*t == '}' || *t == ']') {
3269 PL_bufptr = skipspace(PL_bufptr);
3270 Perl_warner(aTHX_ WARN_SYNTAX,
3271 "Scalar value %.*s better written as $%.*s",
3272 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3277 PL_pending_ident = '@';
3280 case '/': /* may either be division or pattern */
3281 case '?': /* may either be conditional or pattern */
3282 if (PL_expect != XOPERATOR) {
3283 /* Disable warning on "study /blah/" */
3284 if (PL_oldoldbufptr == PL_last_uni
3285 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3286 || memNE(PL_last_uni, "study", 5) || isALNUM_lazy(PL_last_uni+5)))
3288 s = scan_pat(s,OP_MATCH);
3289 TERM(sublex_start());
3297 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3298 #ifdef PERL_STRICT_CR
3301 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3303 && (s == PL_linestart || s[-1] == '\n') )
3305 PL_lex_formbrack = 0;
3309 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3315 yylval.ival = OPf_SPECIAL;
3321 if (PL_expect != XOPERATOR)
3326 case '0': case '1': case '2': case '3': case '4':
3327 case '5': case '6': case '7': case '8': case '9':
3329 if (PL_expect == XOPERATOR)
3334 s = scan_str(s,FALSE,FALSE);
3335 if (PL_expect == XOPERATOR) {
3336 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3339 return ','; /* grandfather non-comma-format format */
3345 missingterm((char*)0);
3346 yylval.ival = OP_CONST;
3347 TERM(sublex_start());
3350 s = scan_str(s,FALSE,FALSE);
3351 if (PL_expect == XOPERATOR) {
3352 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3355 return ','; /* grandfather non-comma-format format */
3361 missingterm((char*)0);
3362 yylval.ival = OP_CONST;
3363 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3364 if (*d == '$' || *d == '@' || *d == '\\' || *d & 0x80) {
3365 yylval.ival = OP_STRINGIFY;
3369 TERM(sublex_start());
3372 s = scan_str(s,FALSE,FALSE);
3373 if (PL_expect == XOPERATOR)
3374 no_op("Backticks",s);
3376 missingterm((char*)0);
3377 yylval.ival = OP_BACKTICK;
3379 TERM(sublex_start());
3383 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3384 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3386 if (PL_expect == XOPERATOR)
3387 no_op("Backslash",s);
3391 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3431 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3433 /* Some keywords can be followed by any delimiter, including ':' */
3434 tmp = (len == 1 && strchr("msyq", PL_tokenbuf[0]) ||
3435 len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3436 (PL_tokenbuf[0] == 'q' &&
3437 strchr("qwxr", PL_tokenbuf[1]))));
3439 /* x::* is just a word, unless x is "CORE" */
3440 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3444 while (d < PL_bufend && isSPACE(*d))
3445 d++; /* no comments skipped here, or s### is misparsed */
3447 /* Is this a label? */
3448 if (!tmp && PL_expect == XSTATE
3449 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3451 yylval.pval = savepv(PL_tokenbuf);
3456 /* Check for keywords */
3457 tmp = keyword(PL_tokenbuf, len);
3459 /* Is this a word before a => operator? */
3460 if (strnEQ(d,"=>",2)) {
3462 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3463 yylval.opval->op_private = OPpCONST_BARE;
3467 if (tmp < 0) { /* second-class keyword? */
3468 GV *ogv = Nullgv; /* override (winner) */
3469 GV *hgv = Nullgv; /* hidden (loser) */
3470 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3472 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3475 if (GvIMPORTED_CV(gv))
3477 else if (! CvMETHOD(cv))
3481 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3482 (gv = *gvp) != (GV*)&PL_sv_undef &&
3483 GvCVu(gv) && GvIMPORTED_CV(gv))
3489 tmp = 0; /* overridden by import or by GLOBAL */
3492 && -tmp==KEY_lock /* XXX generalizable kludge */
3493 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3495 tmp = 0; /* any sub overrides "weak" keyword */
3497 else { /* no override */
3501 if (ckWARN(WARN_AMBIGUOUS) && hgv
3502 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3503 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3504 "Ambiguous call resolved as CORE::%s(), %s",
3505 GvENAME(hgv), "qualify as such or use &");
3512 default: /* not a keyword */
3515 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3517 /* Get the rest if it looks like a package qualifier */
3519 if (*s == '\'' || *s == ':' && s[1] == ':') {
3521 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3524 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3525 *s == '\'' ? "'" : "::");
3529 if (PL_expect == XOPERATOR) {
3530 if (PL_bufptr == PL_linestart) {
3531 PL_curcop->cop_line--;
3532 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3533 PL_curcop->cop_line++;
3536 no_op("Bareword",s);
3539 /* Look for a subroutine with this name in current package,
3540 unless name is "Foo::", in which case Foo is a bearword
3541 (and a package name). */
3544 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3546 if (ckWARN(WARN_UNSAFE) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3547 Perl_warner(aTHX_ WARN_UNSAFE,
3548 "Bareword \"%s\" refers to nonexistent package",
3551 PL_tokenbuf[len] = '\0';
3558 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3561 /* if we saw a global override before, get the right name */
3564 sv = newSVpvn("CORE::GLOBAL::",14);
3565 sv_catpv(sv,PL_tokenbuf);
3568 sv = newSVpv(PL_tokenbuf,0);
3570 /* Presume this is going to be a bareword of some sort. */
3573 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3574 yylval.opval->op_private = OPpCONST_BARE;
3576 /* And if "Foo::", then that's what it certainly is. */
3581 /* See if it's the indirect object for a list operator. */
3583 if (PL_oldoldbufptr &&
3584 PL_oldoldbufptr < PL_bufptr &&
3585 (PL_oldoldbufptr == PL_last_lop || PL_oldoldbufptr == PL_last_uni) &&
3586 /* NO SKIPSPACE BEFORE HERE! */
3587 (PL_expect == XREF ||
3588 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3590 bool immediate_paren = *s == '(';
3592 /* (Now we can afford to cross potential line boundary.) */
3595 /* Two barewords in a row may indicate method call. */
3597 if ((isIDFIRST_lazy(s) || *s == '$') && (tmp=intuit_method(s,gv)))
3600 /* If not a declared subroutine, it's an indirect object. */
3601 /* (But it's an indir obj regardless for sort.) */
3603 if ((PL_last_lop_op == OP_SORT ||
3604 (!immediate_paren && (!gv || !GvCVu(gv)))) &&
3605 (PL_last_lop_op != OP_MAPSTART &&
3606 PL_last_lop_op != OP_GREPSTART))
3608 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3613 /* If followed by a paren, it's certainly a subroutine. */
3615 PL_expect = XOPERATOR;
3619 if (gv && GvCVu(gv)) {
3620 for (d = s + 1; *d == ' ' || *d == '\t'; d++) ;
3621 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3626 PL_nextval[PL_nexttoke].opval = yylval.opval;
3627 PL_expect = XOPERATOR;
3633 /* If followed by var or block, call it a method (unless sub) */
3635 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3636 PL_last_lop = PL_oldbufptr;
3637 PL_last_lop_op = OP_METHOD;
3641 /* If followed by a bareword, see if it looks like indir obj. */
3643 if ((isIDFIRST_lazy(s) || *s == '$') && (tmp = intuit_method(s,gv)))
3646 /* Not a method, so call it a subroutine (if defined) */
3648 if (gv && GvCVu(gv)) {
3650 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3651 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3652 "Ambiguous use of -%s resolved as -&%s()",
3653 PL_tokenbuf, PL_tokenbuf);
3654 /* Check for a constant sub */
3656 if ((sv = cv_const_sv(cv))) {
3658 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3659 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3660 yylval.opval->op_private = 0;
3664 /* Resolve to GV now. */
3665 op_free(yylval.opval);
3666 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3667 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3668 PL_last_lop = PL_oldbufptr;
3669 PL_last_lop_op = OP_ENTERSUB;
3670 /* Is there a prototype? */
3673 char *proto = SvPV((SV*)cv, len);
3676 if (strEQ(proto, "$"))
3678 if (*proto == '&' && *s == '{') {
3679 sv_setpv(PL_subname,"__ANON__");
3683 PL_nextval[PL_nexttoke].opval = yylval.opval;
3689 /* Call it a bare word */
3691 if (PL_hints & HINT_STRICT_SUBS)
3692 yylval.opval->op_private |= OPpCONST_STRICT;
3695 if (ckWARN(WARN_RESERVED)) {
3696 if (lastchar != '-') {
3697 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
3699 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
3706 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
3707 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3708 "Operator or semicolon missing before %c%s",
3709 lastchar, PL_tokenbuf);
3710 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3711 "Ambiguous use of %c resolved as operator %c",
3712 lastchar, lastchar);
3718 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3719 newSVsv(GvSV(PL_curcop->cop_filegv)));
3724 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3725 Perl_newSVpvf(aTHX_ "%" PERL_PRId64, (IV)PL_curcop->cop_line));
3727 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3728 Perl_newSVpvf(aTHX_ "%ld", (long)PL_curcop->cop_line));
3732 case KEY___PACKAGE__:
3733 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3735 ? newSVsv(PL_curstname)
3744 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
3745 char *pname = "main";
3746 if (PL_tokenbuf[2] == 'D')
3747 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
3748 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
3751 GvIOp(gv) = newIO();
3752 IoIFP(GvIOp(gv)) = PL_rsfp;
3753 #if defined(HAS_FCNTL) && defined(F_SETFD)
3755 int fd = PerlIO_fileno(PL_rsfp);
3756 fcntl(fd,F_SETFD,fd >= 3);
3759 /* Mark this internal pseudo-handle as clean */
3760 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
3762 IoTYPE(GvIOp(gv)) = '|';
3763 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
3764 IoTYPE(GvIOp(gv)) = '-';
3766 IoTYPE(GvIOp(gv)) = '<';
3777 if (PL_expect == XSTATE) {
3784 if (*s == ':' && s[1] == ':') {
3787 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3788 tmp = keyword(PL_tokenbuf, len);
3802 LOP(OP_ACCEPT,XTERM);
3808 LOP(OP_ATAN2,XTERM);
3817 LOP(OP_BLESS,XTERM);
3826 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
3843 if (!PL_cryptseen++)
3846 LOP(OP_CRYPT,XTERM);
3849 if (ckWARN(WARN_OCTAL)) {
3850 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
3851 if (*d != '0' && isDIGIT(*d))
3852 Perl_warner(aTHX_ WARN_OCTAL,
3853 "chmod: mode argument is missing initial 0");
3855 LOP(OP_CHMOD,XTERM);
3858 LOP(OP_CHOWN,XTERM);
3861 LOP(OP_CONNECT,XTERM);
3877 s = force_word(s,WORD,FALSE,TRUE,FALSE);
3881 PL_hints |= HINT_BLOCK_SCOPE;
3891 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
3892 LOP(OP_DBMOPEN,XTERM);
3898 s = force_word(s,WORD,TRUE,FALSE,FALSE);
3905 yylval.ival = PL_curcop->cop_line;
3919 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
3920 UNIBRACK(OP_ENTEREVAL);
3935 case KEY_endhostent:
3941 case KEY_endservent:
3944 case KEY_endprotoent:
3955 yylval.ival = PL_curcop->cop_line;
3957 if (PL_expect == XSTATE && isIDFIRST_lazy(s)) {
3959 if ((PL_bufend - p) >= 3 &&
3960 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
3963 if (isIDFIRST_lazy(p))
3964 Perl_croak(aTHX_ "Missing $ on loop variable");
3969 LOP(OP_FORMLINE,XTERM);
3975 LOP(OP_FCNTL,XTERM);
3981 LOP(OP_FLOCK,XTERM);
3990 LOP(OP_GREPSTART, *s == '(' ? XTERM : XREF);
3993 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4008 case KEY_getpriority:
4009 LOP(OP_GETPRIORITY,XTERM);
4011 case KEY_getprotobyname:
4014 case KEY_getprotobynumber:
4015 LOP(OP_GPBYNUMBER,XTERM);
4017 case KEY_getprotoent:
4029 case KEY_getpeername:
4030 UNI(OP_GETPEERNAME);
4032 case KEY_gethostbyname:
4035 case KEY_gethostbyaddr:
4036 LOP(OP_GHBYADDR,XTERM);
4038 case KEY_gethostent:
4041 case KEY_getnetbyname:
4044 case KEY_getnetbyaddr:
4045 LOP(OP_GNBYADDR,XTERM);
4050 case KEY_getservbyname:
4051 LOP(OP_GSBYNAME,XTERM);
4053 case KEY_getservbyport:
4054 LOP(OP_GSBYPORT,XTERM);
4056 case KEY_getservent:
4059 case KEY_getsockname:
4060 UNI(OP_GETSOCKNAME);
4062 case KEY_getsockopt:
4063 LOP(OP_GSOCKOPT,XTERM);
4085 yylval.ival = PL_curcop->cop_line;
4089 LOP(OP_INDEX,XTERM);
4095 LOP(OP_IOCTL,XTERM);
4107 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4139 LOP(OP_LISTEN,XTERM);
4148 s = scan_pat(s,OP_MATCH);
4149 TERM(sublex_start());
4152 LOP(OP_MAPSTART, *s == '(' ? XTERM : XREF);
4155 LOP(OP_MKDIR,XTERM);
4158 LOP(OP_MSGCTL,XTERM);
4161 LOP(OP_MSGGET,XTERM);
4164 LOP(OP_MSGRCV,XTERM);
4167 LOP(OP_MSGSND,XTERM);
4172 if (isIDFIRST_lazy(s)) {
4173 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4174 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4176 PL_in_my_stash = gv_stashpv(PL_tokenbuf, FALSE);
4177 if (!PL_in_my_stash) {
4180 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4188 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4195 if (PL_expect != XSTATE)
4196 yyerror("\"no\" not allowed in expression");
4197 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4198 s = force_version(s);
4207 if (isIDFIRST_lazy(s)) {
4209 for (d = s; isALNUM_lazy(d); d++) ;
4211 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_AMBIGUOUS))
4212 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4213 "Precedence problem: open %.*s should be open(%.*s)",
4219 yylval.ival = OP_OR;
4229 LOP(OP_OPEN_DIR,XTERM);
4232 checkcomma(s,PL_tokenbuf,"filehandle");
4236 checkcomma(s,PL_tokenbuf,"filehandle");
4255 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4259 LOP(OP_PIPE_OP,XTERM);
4262 s = scan_str(s,FALSE,FALSE);
4264 missingterm((char*)0);
4265 yylval.ival = OP_CONST;
4266 TERM(sublex_start());
4272 s = scan_str(s,FALSE,FALSE);
4274 missingterm((char*)0);
4276 if (SvCUR(PL_lex_stuff)) {
4279 d = SvPV_force(PL_lex_stuff, len);
4281 for (; isSPACE(*d) && len; --len, ++d) ;
4284 if (!warned && ckWARN(WARN_SYNTAX)) {
4285 for (; !isSPACE(*d) && len; --len, ++d) {
4287 Perl_warner(aTHX_ WARN_SYNTAX,
4288 "Possible attempt to separate words with commas");
4291 else if (*d == '#') {
4292 Perl_warner(aTHX_ WARN_SYNTAX,
4293 "Possible attempt to put comments in qw() list");
4299 for (; !isSPACE(*d) && len; --len, ++d) ;
4301 words = append_elem(OP_LIST, words,
4302 newSVOP(OP_CONST, 0, newSVpvn(b, d-b)));
4306 PL_nextval[PL_nexttoke].opval = words;
4311 SvREFCNT_dec(PL_lex_stuff);
4312 PL_lex_stuff = Nullsv;
4317 s = scan_str(s,FALSE,FALSE);
4319 missingterm((char*)0);
4320 yylval.ival = OP_STRINGIFY;
4321 if (SvIVX(PL_lex_stuff) == '\'')
4322 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4323 TERM(sublex_start());
4326 s = scan_pat(s,OP_QR);
4327 TERM(sublex_start());
4330 s = scan_str(s,FALSE,FALSE);
4332 missingterm((char*)0);
4333 yylval.ival = OP_BACKTICK;
4335 TERM(sublex_start());
4341 *PL_tokenbuf = '\0';
4342 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4343 if (isIDFIRST_lazy(PL_tokenbuf))
4344 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4346 yyerror("<> should be quotes");
4353 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4357 LOP(OP_RENAME,XTERM);
4366 LOP(OP_RINDEX,XTERM);
4389 LOP(OP_REVERSE,XTERM);
4400 TERM(sublex_start());
4402 TOKEN(1); /* force error */
4411 LOP(OP_SELECT,XTERM);
4417 LOP(OP_SEMCTL,XTERM);
4420 LOP(OP_SEMGET,XTERM);
4423 LOP(OP_SEMOP,XTERM);
4429 LOP(OP_SETPGRP,XTERM);
4431 case KEY_setpriority:
4432 LOP(OP_SETPRIORITY,XTERM);
4434 case KEY_sethostent:
4440 case KEY_setservent:
4443 case KEY_setprotoent:
4453 LOP(OP_SEEKDIR,XTERM);
4455 case KEY_setsockopt:
4456 LOP(OP_SSOCKOPT,XTERM);
4462 LOP(OP_SHMCTL,XTERM);
4465 LOP(OP_SHMGET,XTERM);
4468 LOP(OP_SHMREAD,XTERM);
4471 LOP(OP_SHMWRITE,XTERM);
4474 LOP(OP_SHUTDOWN,XTERM);
4483 LOP(OP_SOCKET,XTERM);
4485 case KEY_socketpair:
4486 LOP(OP_SOCKPAIR,XTERM);
4489 checkcomma(s,PL_tokenbuf,"subroutine name");
4491 if (*s == ';' || *s == ')') /* probably a close */
4492 Perl_croak(aTHX_ "sort is now a reserved word");
4494 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4498 LOP(OP_SPLIT,XTERM);
4501 LOP(OP_SPRINTF,XTERM);
4504 LOP(OP_SPLICE,XTERM);
4520 LOP(OP_SUBSTR,XTERM);
4526 char tmpbuf[sizeof PL_tokenbuf];
4528 expectation attrful;
4529 bool have_name, have_proto;
4534 if (isIDFIRST_lazy(s) || *s == '\'' ||
4535 (*s == ':' && s[1] == ':'))
4538 attrful = XATTRBLOCK;
4539 /* remember buffer pos'n for later force_word */
4540 tboffset = s - PL_oldbufptr;
4541 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4542 if (strchr(tmpbuf, ':'))
4543 sv_setpv(PL_subname, tmpbuf);
4545 sv_setsv(PL_subname,PL_curstname);
4546 sv_catpvn(PL_subname,"::",2);
4547 sv_catpvn(PL_subname,tmpbuf,len);
4554 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4555 PL_expect = XTERMBLOCK;
4556 attrful = XATTRTERM;
4557 sv_setpv(PL_subname,"?");
4561 if (key == KEY_format) {
4563 PL_lex_formbrack = PL_lex_brackets + 1;
4565 (void) force_word(PL_oldbufptr + tboffset, WORD,
4570 /* Look for a prototype */
4574 s = scan_str(s,FALSE,FALSE);
4577 SvREFCNT_dec(PL_lex_stuff);
4578 PL_lex_stuff = Nullsv;
4579 Perl_croak(aTHX_ "Prototype not terminated");
4582 d = SvPVX(PL_lex_stuff);
4584 for (p = d; *p; ++p) {
4589 SvCUR(PL_lex_stuff) = tmp;
4597 if (*s == ':' && s[1] != ':')
4598 PL_expect = attrful;
4601 PL_nextval[PL_nexttoke].opval =
4602 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4603 PL_lex_stuff = Nullsv;
4607 sv_setpv(PL_subname,"__ANON__");
4610 (void) force_word(PL_oldbufptr + tboffset, WORD,
4619 LOP(OP_SYSTEM,XREF);
4622 LOP(OP_SYMLINK,XTERM);
4625 LOP(OP_SYSCALL,XTERM);
4628 LOP(OP_SYSOPEN,XTERM);
4631 LOP(OP_SYSSEEK,XTERM);
4634 LOP(OP_SYSREAD,XTERM);
4637 LOP(OP_SYSWRITE,XTERM);
4641 TERM(sublex_start());
4662 LOP(OP_TRUNCATE,XTERM);
4674 yylval.ival = PL_curcop->cop_line;
4678 yylval.ival = PL_curcop->cop_line;
4682 LOP(OP_UNLINK,XTERM);
4688 LOP(OP_UNPACK,XTERM);
4691 LOP(OP_UTIME,XTERM);
4694 if (ckWARN(WARN_OCTAL)) {
4695 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4696 if (*d != '0' && isDIGIT(*d))
4697 Perl_warner(aTHX_ WARN_OCTAL,
4698 "umask: argument is missing initial 0");
4703 LOP(OP_UNSHIFT,XTERM);
4706 if (PL_expect != XSTATE)
4707 yyerror("\"use\" not allowed in expression");
4710 s = force_version(s);
4711 if(*s == ';' || (s = skipspace(s), *s == ';')) {
4712 PL_nextval[PL_nexttoke].opval = Nullop;
4717 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4718 s = force_version(s);
4731 yylval.ival = PL_curcop->cop_line;
4735 PL_hints |= HINT_BLOCK_SCOPE;
4742 LOP(OP_WAITPID,XTERM);
4750 static char ctl_l[2];
4752 if (ctl_l[0] == '\0')
4753 ctl_l[0] = toCTRL('L');
4754 gv_fetchpv(ctl_l,TRUE, SVt_PV);
4757 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
4762 if (PL_expect == XOPERATOR)
4768 yylval.ival = OP_XOR;
4773 TERM(sublex_start());
4779 Perl_keyword(pTHX_ register char *d, I32 len)
4784 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
4785 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
4786 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
4787 if (strEQ(d,"__DATA__")) return KEY___DATA__;
4788 if (strEQ(d,"__END__")) return KEY___END__;
4792 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
4797 if (strEQ(d,"and")) return -KEY_and;
4798 if (strEQ(d,"abs")) return -KEY_abs;
4801 if (strEQ(d,"alarm")) return -KEY_alarm;
4802 if (strEQ(d,"atan2")) return -KEY_atan2;
4805 if (strEQ(d,"accept")) return -KEY_accept;
4810 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
4813 if (strEQ(d,"bless")) return -KEY_bless;
4814 if (strEQ(d,"bind")) return -KEY_bind;
4815 if (strEQ(d,"binmode")) return -KEY_binmode;
4818 if (strEQ(d,"CORE")) return -KEY_CORE;
4823 if (strEQ(d,"cmp")) return -KEY_cmp;
4824 if (strEQ(d,"chr")) return -KEY_chr;
4825 if (strEQ(d,"cos")) return -KEY_cos;
4828 if (strEQ(d,"chop")) return KEY_chop;
4831 if (strEQ(d,"close")) return -KEY_close;
4832 if (strEQ(d,"chdir")) return -KEY_chdir;
4833 if (strEQ(d,"chomp")) return KEY_chomp;
4834 if (strEQ(d,"chmod")) return -KEY_chmod;
4835 if (strEQ(d,"chown")) return -KEY_chown;
4836 if (strEQ(d,"crypt")) return -KEY_crypt;
4839 if (strEQ(d,"chroot")) return -KEY_chroot;
4840 if (strEQ(d,"caller")) return -KEY_caller;
4843 if (strEQ(d,"connect")) return -KEY_connect;
4846 if (strEQ(d,"closedir")) return -KEY_closedir;
4847 if (strEQ(d,"continue")) return -KEY_continue;
4852 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
4857 if (strEQ(d,"do")) return KEY_do;
4860 if (strEQ(d,"die")) return -KEY_die;
4863 if (strEQ(d,"dump")) return -KEY_dump;
4866 if (strEQ(d,"delete")) return KEY_delete;
4869 if (strEQ(d,"defined")) return KEY_defined;
4870 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
4873 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
4878 if (strEQ(d,"EQ")) { deprecate(d); return -KEY_eq;}
4879 if (strEQ(d,"END")) return KEY_END;
4884 if (strEQ(d,"eq")) return -KEY_eq;
4887 if (strEQ(d,"eof")) return -KEY_eof;
4888 if (strEQ(d,"exp")) return -KEY_exp;
4891 if (strEQ(d,"else")) return KEY_else;
4892 if (strEQ(d,"exit")) return -KEY_exit;
4893 if (strEQ(d,"eval")) return KEY_eval;
4894 if (strEQ(d,"exec")) return -KEY_exec;
4895 if (strEQ(d,"each")) return KEY_each;
4898 if (strEQ(d,"elsif")) return KEY_elsif;
4901 if (strEQ(d,"exists")) return KEY_exists;
4902 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
4905 if (strEQ(d,"endgrent")) return -KEY_endgrent;
4906 if (strEQ(d,"endpwent")) return -KEY_endpwent;
4909 if (strEQ(d,"endnetent")) return -KEY_endnetent;
4912 if (strEQ(d,"endhostent")) return -KEY_endhostent;
4913 if (strEQ(d,"endservent")) return -KEY_endservent;
4916 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
4923 if (strEQ(d,"for")) return KEY_for;
4926 if (strEQ(d,"fork")) return -KEY_fork;
4929 if (strEQ(d,"fcntl")) return -KEY_fcntl;
4930 if (strEQ(d,"flock")) return -KEY_flock;
4933 if (strEQ(d,"format")) return KEY_format;
4934 if (strEQ(d,"fileno")) return -KEY_fileno;
4937 if (strEQ(d,"foreach")) return KEY_foreach;
4940 if (strEQ(d,"formline")) return -KEY_formline;
4946 if (strEQ(d,"GT")) { deprecate(d); return -KEY_gt;}
4947 if (strEQ(d,"GE")) { deprecate(d); return -KEY_ge;}
4951 if (strnEQ(d,"get",3)) {
4956 if (strEQ(d,"ppid")) return -KEY_getppid;
4957 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
4960 if (strEQ(d,"pwent")) return -KEY_getpwent;
4961 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
4962 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
4965 if (strEQ(d,"peername")) return -KEY_getpeername;
4966 if (strEQ(d,"protoent")) return -KEY_getprotoent;
4967 if (strEQ(d,"priority")) return -KEY_getpriority;
4970 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
4973 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
4977 else if (*d == 'h') {
4978 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
4979 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
4980 if (strEQ(d,"hostent")) return -KEY_gethostent;
4982 else if (*d == 'n') {
4983 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
4984 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
4985 if (strEQ(d,"netent")) return -KEY_getnetent;
4987 else if (*d == 's') {
4988 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
4989 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
4990 if (strEQ(d,"servent")) return -KEY_getservent;
4991 if (strEQ(d,"sockname")) return -KEY_getsockname;
4992 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
4994 else if (*d == 'g') {
4995 if (strEQ(d,"grent")) return -KEY_getgrent;
4996 if (strEQ(d,"grnam")) return -KEY_getgrnam;
4997 if (strEQ(d,"grgid")) return -KEY_getgrgid;
4999 else if (*d == 'l') {
5000 if (strEQ(d,"login")) return -KEY_getlogin;
5002 else if (strEQ(d,"c")) return -KEY_getc;
5007 if (strEQ(d,"gt")) return -KEY_gt;
5008 if (strEQ(d,"ge")) return -KEY_ge;
5011 if (strEQ(d,"grep")) return KEY_grep;
5012 if (strEQ(d,"goto")) return KEY_goto;
5013 if (strEQ(d,"glob")) return KEY_glob;
5016 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5021 if (strEQ(d,"hex")) return -KEY_hex;
5024 if (strEQ(d,"INIT")) return KEY_INIT;
5029 if (strEQ(d,"if")) return KEY_if;
5032 if (strEQ(d,"int")) return -KEY_int;
5035 if (strEQ(d,"index")) return -KEY_index;
5036 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5041 if (strEQ(d,"join")) return -KEY_join;
5045 if (strEQ(d,"keys")) return KEY_keys;
5046 if (strEQ(d,"kill")) return -KEY_kill;
5051 if (strEQ(d,"LT")) { deprecate(d); return -KEY_lt;}
5052 if (strEQ(d,"LE")) { deprecate(d); return -KEY_le;}
5058 if (strEQ(d,"lt")) return -KEY_lt;
5059 if (strEQ(d,"le")) return -KEY_le;
5060 if (strEQ(d,"lc")) return -KEY_lc;
5063 if (strEQ(d,"log")) return -KEY_log;
5066 if (strEQ(d,"last")) return KEY_last;
5067 if (strEQ(d,"link")) return -KEY_link;
5068 if (strEQ(d,"lock")) return -KEY_lock;
5071 if (strEQ(d,"local")) return KEY_local;
5072 if (strEQ(d,"lstat")) return -KEY_lstat;
5075 if (strEQ(d,"length")) return -KEY_length;
5076 if (strEQ(d,"listen")) return -KEY_listen;
5079 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5082 if (strEQ(d,"localtime")) return -KEY_localtime;
5088 case 1: return KEY_m;
5090 if (strEQ(d,"my")) return KEY_my;
5093 if (strEQ(d,"map")) return KEY_map;
5096 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5099 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5100 if (strEQ(d,"msgget")) return -KEY_msgget;
5101 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5102 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5107 if (strEQ(d,"NE")) { deprecate(d); return -KEY_ne;}
5110 if (strEQ(d,"next")) return KEY_next;
5111 if (strEQ(d,"ne")) return -KEY_ne;
5112 if (strEQ(d,"not")) return -KEY_not;
5113 if (strEQ(d,"no")) return KEY_no;
5118 if (strEQ(d,"or")) return -KEY_or;
5121 if (strEQ(d,"ord")) return -KEY_ord;
5122 if (strEQ(d,"oct")) return -KEY_oct;
5123 if (strEQ(d,"our")) { deprecate("reserved word \"our\"");
5127 if (strEQ(d,"open")) return -KEY_open;
5130 if (strEQ(d,"opendir")) return -KEY_opendir;
5137 if (strEQ(d,"pop")) return KEY_pop;
5138 if (strEQ(d,"pos")) return KEY_pos;
5141 if (strEQ(d,"push")) return KEY_push;
5142 if (strEQ(d,"pack")) return -KEY_pack;
5143 if (strEQ(d,"pipe")) return -KEY_pipe;
5146 if (strEQ(d,"print")) return KEY_print;
5149 if (strEQ(d,"printf")) return KEY_printf;
5152 if (strEQ(d,"package")) return KEY_package;
5155 if (strEQ(d,"prototype")) return KEY_prototype;
5160 if (strEQ(d,"q")) return KEY_q;
5161 if (strEQ(d,"qr")) return KEY_qr;
5162 if (strEQ(d,"qq")) return KEY_qq;
5163 if (strEQ(d,"qw")) return KEY_qw;
5164 if (strEQ(d,"qx")) return KEY_qx;
5166 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5171 if (strEQ(d,"ref")) return -KEY_ref;
5174 if (strEQ(d,"read")) return -KEY_read;
5175 if (strEQ(d,"rand")) return -KEY_rand;
5176 if (strEQ(d,"recv")) return -KEY_recv;
5177 if (strEQ(d,"redo")) return KEY_redo;
5180 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5181 if (strEQ(d,"reset")) return -KEY_reset;
5184 if (strEQ(d,"return")) return KEY_return;
5185 if (strEQ(d,"rename")) return -KEY_rename;
5186 if (strEQ(d,"rindex")) return -KEY_rindex;
5189 if (strEQ(d,"require")) return -KEY_require;
5190 if (strEQ(d,"reverse")) return -KEY_reverse;
5191 if (strEQ(d,"readdir")) return -KEY_readdir;
5194 if (strEQ(d,"readlink")) return -KEY_readlink;
5195 if (strEQ(d,"readline")) return -KEY_readline;
5196 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5199 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5205 case 0: return KEY_s;
5207 if (strEQ(d,"scalar")) return KEY_scalar;
5212 if (strEQ(d,"seek")) return -KEY_seek;
5213 if (strEQ(d,"send")) return -KEY_send;
5216 if (strEQ(d,"semop")) return -KEY_semop;
5219 if (strEQ(d,"select")) return -KEY_select;
5220 if (strEQ(d,"semctl")) return -KEY_semctl;
5221 if (strEQ(d,"semget")) return -KEY_semget;
5224 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5225 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5228 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5229 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5232 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5235 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5236 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5237 if (strEQ(d,"setservent")) return -KEY_setservent;
5240 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5241 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5248 if (strEQ(d,"shift")) return KEY_shift;
5251 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5252 if (strEQ(d,"shmget")) return -KEY_shmget;
5255 if (strEQ(d,"shmread")) return -KEY_shmread;
5258 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5259 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5264 if (strEQ(d,"sin")) return -KEY_sin;
5267 if (strEQ(d,"sleep")) return -KEY_sleep;
5270 if (strEQ(d,"sort")) return KEY_sort;
5271 if (strEQ(d,"socket")) return -KEY_socket;
5272 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5275 if (strEQ(d,"split")) return KEY_split;
5276 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5277 if (strEQ(d,"splice")) return KEY_splice;
5280 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5283 if (strEQ(d,"srand")) return -KEY_srand;
5286 if (strEQ(d,"stat")) return -KEY_stat;
5287 if (strEQ(d,"study")) return KEY_study;
5290 if (strEQ(d,"substr")) return -KEY_substr;
5291 if (strEQ(d,"sub")) return KEY_sub;
5296 if (strEQ(d,"system")) return -KEY_system;
5299 if (strEQ(d,"symlink")) return -KEY_symlink;
5300 if (strEQ(d,"syscall")) return -KEY_syscall;
5301 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5302 if (strEQ(d,"sysread")) return -KEY_sysread;
5303 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5306 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5315 if (strEQ(d,"tr")) return KEY_tr;
5318 if (strEQ(d,"tie")) return KEY_tie;
5321 if (strEQ(d,"tell")) return -KEY_tell;
5322 if (strEQ(d,"tied")) return KEY_tied;
5323 if (strEQ(d,"time")) return -KEY_time;
5326 if (strEQ(d,"times")) return -KEY_times;
5329 if (strEQ(d,"telldir")) return -KEY_telldir;
5332 if (strEQ(d,"truncate")) return -KEY_truncate;
5339 if (strEQ(d,"uc")) return -KEY_uc;
5342 if (strEQ(d,"use")) return KEY_use;
5345 if (strEQ(d,"undef")) return KEY_undef;
5346 if (strEQ(d,"until")) return KEY_until;
5347 if (strEQ(d,"untie")) return KEY_untie;
5348 if (strEQ(d,"utime")) return -KEY_utime;
5349 if (strEQ(d,"umask")) return -KEY_umask;
5352 if (strEQ(d,"unless")) return KEY_unless;
5353 if (strEQ(d,"unpack")) return -KEY_unpack;
5354 if (strEQ(d,"unlink")) return -KEY_unlink;
5357 if (strEQ(d,"unshift")) return KEY_unshift;
5358 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5363 if (strEQ(d,"values")) return -KEY_values;
5364 if (strEQ(d,"vec")) return -KEY_vec;
5369 if (strEQ(d,"warn")) return -KEY_warn;
5370 if (strEQ(d,"wait")) return -KEY_wait;
5373 if (strEQ(d,"while")) return KEY_while;
5374 if (strEQ(d,"write")) return -KEY_write;
5377 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5380 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5385 if (len == 1) return -KEY_x;
5386 if (strEQ(d,"xor")) return -KEY_xor;
5389 if (len == 1) return KEY_y;
5398 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5402 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5403 dTHR; /* only for ckWARN */
5404 if (ckWARN(WARN_SYNTAX)) {
5406 for (w = s+2; *w && level; w++) {
5413 for (; *w && isSPACE(*w); w++) ;
5414 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5415 Perl_warner(aTHX_ WARN_SYNTAX, "%s (...) interpreted as function",name);
5418 while (s < PL_bufend && isSPACE(*s))
5422 while (s < PL_bufend && isSPACE(*s))
5424 if (isIDFIRST_lazy(s)) {
5426 while (isALNUM_lazy(s))
5428 while (s < PL_bufend && isSPACE(*s))
5433 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5437 Perl_croak(aTHX_ "No comma allowed after %s", what);
5442 /* Either returns sv, or mortalizes sv and returns a new SV*.
5443 Best used as sv=new_constant(..., sv, ...).
5444 If s, pv are NULL, calls subroutine with one argument,
5445 and type is used with error messages only. */
5448 S_new_constant(pTHX_ char *s, STRLEN len, char *key, SV *sv, SV *pv, char *type)
5451 HV *table = GvHV(PL_hintgv); /* ^H */
5455 char *why, *why1, *why2;
5457 if (!(PL_hints & HINT_LOCALIZE_HH)) {
5460 why = "%^H is not localized";
5464 msg = Perl_newSVpvf(aTHX_ "constant(%s): %s%s%s",
5465 (type ? type: "undef"), why1, why2, why);
5466 yyerror(SvPVX(msg));
5471 why = "%^H is not defined";
5474 cvp = hv_fetch(table, key, strlen(key), FALSE);
5475 if (!cvp || !SvOK(*cvp)) {
5476 why = "} is not defined";
5481 sv_2mortal(sv); /* Parent created it permanently */
5484 pv = sv_2mortal(newSVpvn(s, len));
5486 typesv = sv_2mortal(newSVpv(type, 0));
5488 typesv = &PL_sv_undef;
5490 PUSHSTACKi(PERLSI_OVERLOAD);
5503 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5507 /* Check the eval first */
5508 if (!PL_in_eval && SvTRUE(ERRSV))
5511 sv_catpv(ERRSV, "Propagated");
5512 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5514 res = SvREFCNT_inc(sv);
5527 why = "}} did not return a defined value";
5528 why1 = "Call to &{$^H{";
5538 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5540 register char *d = dest;
5541 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5544 Perl_croak(aTHX_ ident_too_long);
5545 if (isALNUM(*s)) /* UTF handled below */
5547 else if (*s == '\'' && allow_package && isIDFIRST_lazy(s+1)) {
5552 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5556 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5557 char *t = s + UTF8SKIP(s);
5558 while (*t & 0x80 && is_utf8_mark((U8*)t))
5560 if (d + (t - s) > e)
5561 Perl_croak(aTHX_ ident_too_long);
5562 Copy(s, d, t - s, char);
5575 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
5582 if (PL_lex_brackets == 0)
5583 PL_lex_fakebrack = 0;
5587 e = d + destlen - 3; /* two-character token, ending NUL */
5589 while (isDIGIT(*s)) {
5591 Perl_croak(aTHX_ ident_too_long);
5598 Perl_croak(aTHX_ ident_too_long);
5599 if (isALNUM(*s)) /* UTF handled below */
5601 else if (*s == '\'' && isIDFIRST_lazy(s+1)) {
5606 else if (*s == ':' && s[1] == ':') {
5610 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5611 char *t = s + UTF8SKIP(s);
5612 while (*t & 0x80 && is_utf8_mark((U8*)t))
5614 if (d + (t - s) > e)
5615 Perl_croak(aTHX_ ident_too_long);
5616 Copy(s, d, t - s, char);
5627 if (PL_lex_state != LEX_NORMAL)
5628 PL_lex_state = LEX_INTERPENDMAYBE;
5631 if (*s == '$' && s[1] &&
5632 (isALNUM_lazy(s+1) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
5645 if (*d == '^' && *s && isCONTROLVAR(*s)) {
5650 if (isSPACE(s[-1])) {
5653 if (ch != ' ' && ch != '\t') {
5659 if (isIDFIRST_lazy(d)) {
5663 while (e < send && isALNUM_lazy(e) || *e == ':') {
5665 while (e < send && *e & 0x80 && is_utf8_mark((U8*)e))
5668 Copy(s, d, e - s, char);
5673 while ((isALNUM(*s) || *s == ':') && d < e)
5676 Perl_croak(aTHX_ ident_too_long);
5679 while (s < send && (*s == ' ' || *s == '\t')) s++;
5680 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
5681 dTHR; /* only for ckWARN */
5682 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
5683 char *brack = *s == '[' ? "[...]" : "{...}";
5684 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5685 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
5686 funny, dest, brack, funny, dest, brack);
5688 PL_lex_fakebrack = PL_lex_brackets+1;
5690 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5694 /* Handle extended ${^Foo} variables
5695 * 1999-02-27 mjd-perl-patch@plover.com */
5696 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
5700 while (isALNUM(*s) && d < e) {
5704 Perl_croak(aTHX_ ident_too_long);
5709 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
5710 PL_lex_state = LEX_INTERPEND;
5713 if (PL_lex_state == LEX_NORMAL) {
5714 dTHR; /* only for ckWARN */
5715 if (ckWARN(WARN_AMBIGUOUS) &&
5716 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
5718 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5719 "Ambiguous use of %c{%s} resolved to %c%s",
5720 funny, dest, funny, dest);
5725 s = bracket; /* let the parser handle it */
5729 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
5730 PL_lex_state = LEX_INTERPEND;
5735 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
5740 *pmfl |= PMf_GLOBAL;
5742 *pmfl |= PMf_CONTINUE;
5746 *pmfl |= PMf_MULTILINE;
5748 *pmfl |= PMf_SINGLELINE;
5750 *pmfl |= PMf_EXTENDED;
5754 S_scan_pat(pTHX_ char *start, I32 type)
5759 s = scan_str(start,FALSE,FALSE);
5762 SvREFCNT_dec(PL_lex_stuff);
5763 PL_lex_stuff = Nullsv;
5764 Perl_croak(aTHX_ "Search pattern not terminated");
5767 pm = (PMOP*)newPMOP(type, 0);
5768 if (PL_multi_open == '?')
5769 pm->op_pmflags |= PMf_ONCE;
5771 while (*s && strchr("iomsx", *s))
5772 pmflag(&pm->op_pmflags,*s++);
5775 while (*s && strchr("iogcmsx", *s))
5776 pmflag(&pm->op_pmflags,*s++);
5778 pm->op_pmpermflags = pm->op_pmflags;
5780 PL_lex_op = (OP*)pm;
5781 yylval.ival = OP_MATCH;
5786 S_scan_subst(pTHX_ char *start)
5793 yylval.ival = OP_NULL;
5795 s = scan_str(start,FALSE,FALSE);
5799 SvREFCNT_dec(PL_lex_stuff);
5800 PL_lex_stuff = Nullsv;
5801 Perl_croak(aTHX_ "Substitution pattern not terminated");
5804 if (s[-1] == PL_multi_open)
5807 first_start = PL_multi_start;
5808 s = scan_str(s,FALSE,FALSE);
5811 SvREFCNT_dec(PL_lex_stuff);
5812 PL_lex_stuff = Nullsv;
5814 SvREFCNT_dec(PL_lex_repl);
5815 PL_lex_repl = Nullsv;
5816 Perl_croak(aTHX_ "Substitution replacement not terminated");
5818 PL_multi_start = first_start; /* so whole substitution is taken together */
5820 pm = (PMOP*)newPMOP(OP_SUBST, 0);
5826 else if (strchr("iogcmsx", *s))
5827 pmflag(&pm->op_pmflags,*s++);
5834 PL_sublex_info.super_bufptr = s;
5835 PL_sublex_info.super_bufend = PL_bufend;
5837 pm->op_pmflags |= PMf_EVAL;
5838 repl = newSVpvn("",0);
5840 sv_catpv(repl, es ? "eval " : "do ");
5841 sv_catpvn(repl, "{ ", 2);
5842 sv_catsv(repl, PL_lex_repl);
5843 sv_catpvn(repl, " };", 2);
5845 SvREFCNT_dec(PL_lex_repl);
5849 pm->op_pmpermflags = pm->op_pmflags;
5850 PL_lex_op = (OP*)pm;
5851 yylval.ival = OP_SUBST;
5856 S_scan_trans(pTHX_ char *start)
5867 yylval.ival = OP_NULL;
5869 s = scan_str(start,FALSE,FALSE);
5872 SvREFCNT_dec(PL_lex_stuff);
5873 PL_lex_stuff = Nullsv;
5874 Perl_croak(aTHX_ "Transliteration pattern not terminated");
5876 if (s[-1] == PL_multi_open)
5879 s = scan_str(s,FALSE,FALSE);
5882 SvREFCNT_dec(PL_lex_stuff);
5883 PL_lex_stuff = Nullsv;
5885 SvREFCNT_dec(PL_lex_repl);
5886 PL_lex_repl = Nullsv;
5887 Perl_croak(aTHX_ "Transliteration replacement not terminated");
5891 o = newSVOP(OP_TRANS, 0, 0);
5892 utf8 = OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF;
5895 New(803,tbl,256,short);
5896 o = newPVOP(OP_TRANS, 0, (char*)tbl);
5900 complement = del = squash = 0;
5901 while (strchr("cdsCU", *s)) {
5903 complement = OPpTRANS_COMPLEMENT;
5905 del = OPpTRANS_DELETE;
5907 squash = OPpTRANS_SQUASH;
5912 utf8 &= ~OPpTRANS_FROM_UTF;
5914 utf8 |= OPpTRANS_FROM_UTF;
5918 utf8 &= ~OPpTRANS_TO_UTF;
5920 utf8 |= OPpTRANS_TO_UTF;
5923 Perl_croak(aTHX_ "Too many /C and /U options");
5928 o->op_private = del|squash|complement|utf8;
5931 yylval.ival = OP_TRANS;
5936 S_scan_heredoc(pTHX_ register char *s)
5940 I32 op_type = OP_SCALAR;
5947 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
5951 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
5954 for (peek = s; *peek == ' ' || *peek == '\t'; peek++) ;
5955 if (*peek && strchr("`'\"",*peek)) {
5958 s = delimcpy(d, e, s, PL_bufend, term, &len);
5968 if (!isALNUM_lazy(s))
5969 deprecate("bare << to mean <<\"\"");
5970 for (; isALNUM_lazy(s); s++) {
5975 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
5976 Perl_croak(aTHX_ "Delimiter for here document is too long");
5979 len = d - PL_tokenbuf;
5980 #ifndef PERL_STRICT_CR
5981 d = strchr(s, '\r');
5985 while (s < PL_bufend) {
5991 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6000 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6005 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6006 herewas = newSVpvn(s,PL_bufend-s);
6008 s--, herewas = newSVpvn(s,d-s);
6009 s += SvCUR(herewas);
6011 tmpstr = NEWSV(87,79);
6012 sv_upgrade(tmpstr, SVt_PVIV);
6017 else if (term == '`') {
6018 op_type = OP_BACKTICK;
6019 SvIVX(tmpstr) = '\\';
6023 PL_multi_start = PL_curcop->cop_line;
6024 PL_multi_open = PL_multi_close = '<';
6025 term = *PL_tokenbuf;
6026 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6027 char *bufptr = PL_sublex_info.super_bufptr;
6028 char *bufend = PL_sublex_info.super_bufend;
6029 char *olds = s - SvCUR(herewas);
6030 s = strchr(bufptr, '\n');
6034 while (s < bufend &&
6035 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6037 PL_curcop->cop_line++;
6040 PL_curcop->cop_line = PL_multi_start;
6041 missingterm(PL_tokenbuf);
6043 sv_setpvn(herewas,bufptr,d-bufptr+1);
6044 sv_setpvn(tmpstr,d+1,s-d);
6046 sv_catpvn(herewas,s,bufend-s);
6047 (void)strcpy(bufptr,SvPVX(herewas));
6054 while (s < PL_bufend &&
6055 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6057 PL_curcop->cop_line++;
6059 if (s >= PL_bufend) {
6060 PL_curcop->cop_line = PL_multi_start;
6061 missingterm(PL_tokenbuf);
6063 sv_setpvn(tmpstr,d+1,s-d);
6065 PL_curcop->cop_line++; /* the preceding stmt passes a newline */
6067 sv_catpvn(herewas,s,PL_bufend-s);
6068 sv_setsv(PL_linestr,herewas);
6069 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6070 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6073 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6074 while (s >= PL_bufend) { /* multiple line string? */
6076 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6077 PL_curcop->cop_line = PL_multi_start;
6078 missingterm(PL_tokenbuf);
6080 PL_curcop->cop_line++;
6081 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6082 #ifndef PERL_STRICT_CR
6083 if (PL_bufend - PL_linestart >= 2) {
6084 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6085 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6087 PL_bufend[-2] = '\n';
6089 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6091 else if (PL_bufend[-1] == '\r')
6092 PL_bufend[-1] = '\n';
6094 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6095 PL_bufend[-1] = '\n';
6097 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6098 SV *sv = NEWSV(88,0);
6100 sv_upgrade(sv, SVt_PVMG);
6101 sv_setsv(sv,PL_linestr);
6102 av_store(GvAV(PL_curcop->cop_filegv),
6103 (I32)PL_curcop->cop_line,sv);
6105 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6108 sv_catsv(PL_linestr,herewas);
6109 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6113 sv_catsv(tmpstr,PL_linestr);
6118 PL_multi_end = PL_curcop->cop_line;
6119 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6120 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6121 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6123 SvREFCNT_dec(herewas);
6124 PL_lex_stuff = tmpstr;
6125 yylval.ival = op_type;
6130 takes: current position in input buffer
6131 returns: new position in input buffer
6132 side-effects: yylval and lex_op are set.
6137 <FH> read from filehandle
6138 <pkg::FH> read from package qualified filehandle
6139 <pkg'FH> read from package qualified filehandle
6140 <$fh> read from filehandle in $fh
6146 S_scan_inputsymbol(pTHX_ char *start)
6148 register char *s = start; /* current position in buffer */
6154 d = PL_tokenbuf; /* start of temp holding space */
6155 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6156 end = strchr(s, '\n');
6159 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6161 /* die if we didn't have space for the contents of the <>,
6162 or if it didn't end, or if we see a newline
6165 if (len >= sizeof PL_tokenbuf)
6166 Perl_croak(aTHX_ "Excessively long <> operator");
6168 Perl_croak(aTHX_ "Unterminated <> operator");
6173 Remember, only scalar variables are interpreted as filehandles by
6174 this code. Anything more complex (e.g., <$fh{$num}>) will be
6175 treated as a glob() call.
6176 This code makes use of the fact that except for the $ at the front,
6177 a scalar variable and a filehandle look the same.
6179 if (*d == '$' && d[1]) d++;
6181 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6182 while (*d && (isALNUM_lazy(d) || *d == '\'' || *d == ':'))
6185 /* If we've tried to read what we allow filehandles to look like, and
6186 there's still text left, then it must be a glob() and not a getline.
6187 Use scan_str to pull out the stuff between the <> and treat it
6188 as nothing more than a string.
6191 if (d - PL_tokenbuf != len) {
6192 yylval.ival = OP_GLOB;
6194 s = scan_str(start,FALSE,FALSE);
6196 Perl_croak(aTHX_ "Glob not terminated");
6200 /* we're in a filehandle read situation */
6203 /* turn <> into <ARGV> */
6205 (void)strcpy(d,"ARGV");
6207 /* if <$fh>, create the ops to turn the variable into a
6213 /* try to find it in the pad for this block, otherwise find
6214 add symbol table ops
6216 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6217 OP *o = newOP(OP_PADSV, 0);
6219 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6222 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6223 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6224 newUNOP(OP_RV2SV, 0,
6225 newGVOP(OP_GV, 0, gv)));
6227 PL_lex_op->op_flags |= OPf_SPECIAL;
6228 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6229 yylval.ival = OP_NULL;
6232 /* If it's none of the above, it must be a literal filehandle
6233 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6235 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6236 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6237 yylval.ival = OP_NULL;
6246 takes: start position in buffer
6247 keep_quoted preserve \ on the embedded delimiter(s)
6248 keep_delims preserve the delimiters around the string
6249 returns: position to continue reading from buffer
6250 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6251 updates the read buffer.
6253 This subroutine pulls a string out of the input. It is called for:
6254 q single quotes q(literal text)
6255 ' single quotes 'literal text'
6256 qq double quotes qq(interpolate $here please)
6257 " double quotes "interpolate $here please"
6258 qx backticks qx(/bin/ls -l)
6259 ` backticks `/bin/ls -l`
6260 qw quote words @EXPORT_OK = qw( func() $spam )
6261 m// regexp match m/this/
6262 s/// regexp substitute s/this/that/
6263 tr/// string transliterate tr/this/that/
6264 y/// string transliterate y/this/that/
6265 ($*@) sub prototypes sub foo ($)
6266 (stuff) sub attr parameters sub foo : attr(stuff)
6267 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6269 In most of these cases (all but <>, patterns and transliterate)
6270 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6271 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6272 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6275 It skips whitespace before the string starts, and treats the first
6276 character as the delimiter. If the delimiter is one of ([{< then
6277 the corresponding "close" character )]}> is used as the closing
6278 delimiter. It allows quoting of delimiters, and if the string has
6279 balanced delimiters ([{<>}]) it allows nesting.
6281 The lexer always reads these strings into lex_stuff, except in the
6282 case of the operators which take *two* arguments (s/// and tr///)
6283 when it checks to see if lex_stuff is full (presumably with the 1st
6284 arg to s or tr) and if so puts the string into lex_repl.
6289 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6292 SV *sv; /* scalar value: string */
6293 char *tmps; /* temp string, used for delimiter matching */
6294 register char *s = start; /* current position in the buffer */
6295 register char term; /* terminating character */
6296 register char *to; /* current position in the sv's data */
6297 I32 brackets = 1; /* bracket nesting level */
6299 /* skip space before the delimiter */
6303 /* mark where we are, in case we need to report errors */
6306 /* after skipping whitespace, the next character is the terminator */
6308 /* mark where we are */
6309 PL_multi_start = PL_curcop->cop_line;
6310 PL_multi_open = term;
6312 /* find corresponding closing delimiter */
6313 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6315 PL_multi_close = term;
6317 /* create a new SV to hold the contents. 87 is leak category, I'm
6318 assuming. 79 is the SV's initial length. What a random number. */
6320 sv_upgrade(sv, SVt_PVIV);
6322 (void)SvPOK_only(sv); /* validate pointer */
6324 /* move past delimiter and try to read a complete string */
6326 sv_catpvn(sv, s, 1);
6329 /* extend sv if need be */
6330 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6331 /* set 'to' to the next character in the sv's string */
6332 to = SvPVX(sv)+SvCUR(sv);
6334 /* if open delimiter is the close delimiter read unbridle */
6335 if (PL_multi_open == PL_multi_close) {
6336 for (; s < PL_bufend; s++,to++) {
6337 /* embedded newlines increment the current line number */
6338 if (*s == '\n' && !PL_rsfp)
6339 PL_curcop->cop_line++;
6340 /* handle quoted delimiters */
6341 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6342 if (!keep_quoted && s[1] == term)
6344 /* any other quotes are simply copied straight through */
6348 /* terminate when run out of buffer (the for() condition), or
6349 have found the terminator */
6350 else if (*s == term)
6356 /* if the terminator isn't the same as the start character (e.g.,
6357 matched brackets), we have to allow more in the quoting, and
6358 be prepared for nested brackets.
6361 /* read until we run out of string, or we find the terminator */
6362 for (; s < PL_bufend; s++,to++) {
6363 /* embedded newlines increment the line count */
6364 if (*s == '\n' && !PL_rsfp)
6365 PL_curcop->cop_line++;
6366 /* backslashes can escape the open or closing characters */
6367 if (*s == '\\' && s+1 < PL_bufend) {
6369 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6374 /* allow nested opens and closes */
6375 else if (*s == PL_multi_close && --brackets <= 0)
6377 else if (*s == PL_multi_open)
6382 /* terminate the copied string and update the sv's end-of-string */
6384 SvCUR_set(sv, to - SvPVX(sv));
6387 * this next chunk reads more into the buffer if we're not done yet
6390 if (s < PL_bufend) break; /* handle case where we are done yet :-) */
6392 #ifndef PERL_STRICT_CR
6393 if (to - SvPVX(sv) >= 2) {
6394 if ((to[-2] == '\r' && to[-1] == '\n') ||
6395 (to[-2] == '\n' && to[-1] == '\r'))
6399 SvCUR_set(sv, to - SvPVX(sv));
6401 else if (to[-1] == '\r')
6404 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6408 /* if we're out of file, or a read fails, bail and reset the current
6409 line marker so we can report where the unterminated string began
6412 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6414 PL_curcop->cop_line = PL_multi_start;
6417 /* we read a line, so increment our line counter */
6418 PL_curcop->cop_line++;
6420 /* update debugger info */
6421 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6422 SV *sv = NEWSV(88,0);
6424 sv_upgrade(sv, SVt_PVMG);
6425 sv_setsv(sv,PL_linestr);
6426 av_store(GvAV(PL_curcop->cop_filegv),
6427 (I32)PL_curcop->cop_line, sv);
6430 /* having changed the buffer, we must update PL_bufend */
6431 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6434 /* at this point, we have successfully read the delimited string */
6437 sv_catpvn(sv, s, 1);
6438 PL_multi_end = PL_curcop->cop_line;
6441 /* if we allocated too much space, give some back */
6442 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6443 SvLEN_set(sv, SvCUR(sv) + 1);
6444 Renew(SvPVX(sv), SvLEN(sv), char);
6447 /* decide whether this is the first or second quoted string we've read
6460 takes: pointer to position in buffer
6461 returns: pointer to new position in buffer
6462 side-effects: builds ops for the constant in yylval.op
6464 Read a number in any of the formats that Perl accepts:
6466 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6467 [\d_]+(\.[\d_]*)?[Ee](\d+)
6469 Underbars (_) are allowed in decimal numbers. If -w is on,
6470 underbars before a decimal point must be at three digit intervals.
6472 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6475 If it reads a number without a decimal point or an exponent, it will
6476 try converting the number to an integer and see if it can do so
6477 without loss of precision.
6481 Perl_scan_num(pTHX_ char *start)
6483 register char *s = start; /* current position in buffer */
6484 register char *d; /* destination in temp buffer */
6485 register char *e; /* end of temp buffer */
6486 IV tryiv; /* used to see if it can be an IV */
6487 NV value; /* number read, as a double */
6488 SV *sv; /* place to put the converted number */
6489 bool floatit; /* boolean: int or float? */
6490 char *lastub = 0; /* position of last underbar */
6491 static char number_too_long[] = "Number too long";
6493 /* We use the first character to decide what type of number this is */
6497 Perl_croak(aTHX_ "panic: scan_num");
6499 /* if it starts with a 0, it could be an octal number, a decimal in
6500 0.13 disguise, or a hexadecimal number, or a binary number.
6505 u holds the "number so far"
6506 shift the power of 2 of the base
6507 (hex == 4, octal == 3, binary == 1)
6508 overflowed was the number more than we can hold?
6510 Shift is used when we add a digit. It also serves as an "are
6511 we in octal/hex/binary?" indicator to disallow hex characters
6518 bool overflowed = FALSE;
6519 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6520 static char* bases[5] = { "", "binary", "", "octal",
6522 static char* Bases[5] = { "", "Binary", "", "Octal",
6524 static char *maxima[5] = { "",
6525 "0b11111111111111111111111111111111",
6529 char *base, *Base, *max;
6535 } else if (s[1] == 'b') {
6539 /* check for a decimal in disguise */
6540 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6542 /* so it must be octal */
6546 base = bases[shift];
6547 Base = Bases[shift];
6548 max = maxima[shift];
6550 /* read the rest of the number */
6552 /* x is used in the overflow test,
6553 b is the digit we're adding on. */
6558 /* if we don't mention it, we're done */
6567 /* 8 and 9 are not octal */
6570 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6574 case '2': case '3': case '4':
6575 case '5': case '6': case '7':
6577 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6581 b = *s++ & 15; /* ASCII digit -> value of digit */
6585 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6586 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6587 /* make sure they said 0x */
6592 /* Prepare to put the digit we have onto the end
6593 of the number so far. We check for overflows.
6598 x = u << shift; /* make room for the digit */
6600 if ((x >> shift) != u
6601 && !(PL_hints & HINT_NEW_BINARY)) {
6605 if (ckWARN_d(WARN_OVERFLOW))
6606 Perl_warner(aTHX_ WARN_OVERFLOW,
6607 "Integer overflow in %s number",
6610 u = x | b; /* add the digit to the end */
6613 n *= nvshift[shift];
6614 /* If an NV has not enough bits in its
6615 * mantissa to represent an UV this summing of
6616 * small low-order numbers is a waste of time
6617 * (because the NV cannot preserve the
6618 * low-order bits anyway): we could just
6619 * remember when did we overflow and in the
6620 * end just multiply n by the right
6628 /* if we get here, we had success: make a scalar value from
6635 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
6636 Perl_warner(aTHX_ WARN_PORTABLE,
6637 "%s number > %s non-portable",
6644 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
6645 Perl_warner(aTHX_ WARN_PORTABLE,
6646 "%s number > %s non-portable",
6651 if (PL_hints & HINT_NEW_BINARY)
6652 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
6657 handle decimal numbers.
6658 we're also sent here when we read a 0 as the first digit
6660 case '1': case '2': case '3': case '4': case '5':
6661 case '6': case '7': case '8': case '9': case '.':
6664 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
6667 /* read next group of digits and _ and copy into d */
6668 while (isDIGIT(*s) || *s == '_') {
6669 /* skip underscores, checking for misplaced ones
6673 dTHR; /* only for ckWARN */
6674 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
6675 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6679 /* check for end of fixed-length buffer */
6681 Perl_croak(aTHX_ number_too_long);
6682 /* if we're ok, copy the character */
6687 /* final misplaced underbar check */
6688 if (lastub && s - lastub != 3) {
6690 if (ckWARN(WARN_SYNTAX))
6691 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6694 /* read a decimal portion if there is one. avoid
6695 3..5 being interpreted as the number 3. followed
6698 if (*s == '.' && s[1] != '.') {
6702 /* copy, ignoring underbars, until we run out of
6703 digits. Note: no misplaced underbar checks!
6705 for (; isDIGIT(*s) || *s == '_'; s++) {
6706 /* fixed length buffer check */
6708 Perl_croak(aTHX_ number_too_long);
6714 /* read exponent part, if present */
6715 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
6719 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
6720 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
6722 /* allow positive or negative exponent */
6723 if (*s == '+' || *s == '-')
6726 /* read digits of exponent (no underbars :-) */
6727 while (isDIGIT(*s)) {
6729 Perl_croak(aTHX_ number_too_long);
6734 /* terminate the string */
6737 /* make an sv from the string */
6740 value = Atof(PL_tokenbuf);
6743 See if we can make do with an integer value without loss of
6744 precision. We use I_V to cast to an int, because some
6745 compilers have issues. Then we try casting it back and see
6746 if it was the same. We only do this if we know we
6747 specifically read an integer.
6749 Note: if floatit is true, then we don't need to do the
6753 if (!floatit && (NV)tryiv == value)
6754 sv_setiv(sv, tryiv);
6756 sv_setnv(sv, value);
6757 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
6758 (PL_hints & HINT_NEW_INTEGER) )
6759 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
6760 (floatit ? "float" : "integer"),
6765 /* make the op for the constant and return */
6767 yylval.opval = newSVOP(OP_CONST, 0, sv);
6773 S_scan_formline(pTHX_ register char *s)
6778 SV *stuff = newSVpvn("",0);
6779 bool needargs = FALSE;
6782 if (*s == '.' || *s == '}') {
6784 #ifdef PERL_STRICT_CR
6785 for (t = s+1;*t == ' ' || *t == '\t'; t++) ;
6787 for (t = s+1;*t == ' ' || *t == '\t' || *t == '\r'; t++) ;
6789 if (*t == '\n' || t == PL_bufend)
6792 if (PL_in_eval && !PL_rsfp) {
6793 eol = strchr(s,'\n');
6798 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6800 for (t = s; t < eol; t++) {
6801 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
6803 goto enough; /* ~~ must be first line in formline */
6805 if (*t == '@' || *t == '^')
6808 sv_catpvn(stuff, s, eol-s);
6812 s = filter_gets(PL_linestr, PL_rsfp, 0);
6813 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
6814 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
6817 yyerror("Format not terminated");
6827 PL_lex_state = LEX_NORMAL;
6828 PL_nextval[PL_nexttoke].ival = 0;
6832 PL_lex_state = LEX_FORMLINE;
6833 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
6835 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
6839 SvREFCNT_dec(stuff);
6840 PL_lex_formbrack = 0;
6851 PL_cshlen = strlen(PL_cshname);
6856 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
6859 I32 oldsavestack_ix = PL_savestack_ix;
6860 CV* outsidecv = PL_compcv;
6864 assert(SvTYPE(PL_compcv) == SVt_PVCV);
6866 save_I32(&PL_subline);
6867 save_item(PL_subname);
6869 SAVESPTR(PL_curpad);
6870 SAVESPTR(PL_comppad);
6871 SAVESPTR(PL_comppad_name);
6872 SAVESPTR(PL_compcv);
6873 SAVEI32(PL_comppad_name_fill);
6874 SAVEI32(PL_min_intro_pending);
6875 SAVEI32(PL_max_intro_pending);
6876 SAVEI32(PL_pad_reset_pending);
6878 PL_compcv = (CV*)NEWSV(1104,0);
6879 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
6880 CvFLAGS(PL_compcv) |= flags;
6882 PL_comppad = newAV();
6883 av_push(PL_comppad, Nullsv);
6884 PL_curpad = AvARRAY(PL_comppad);
6885 PL_comppad_name = newAV();
6886 PL_comppad_name_fill = 0;
6887 PL_min_intro_pending = 0;
6889 PL_subline = PL_curcop->cop_line;
6891 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
6892 PL_curpad[0] = (SV*)newAV();
6893 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
6894 #endif /* USE_THREADS */
6896 comppadlist = newAV();
6897 AvREAL_off(comppadlist);
6898 av_store(comppadlist, 0, (SV*)PL_comppad_name);
6899 av_store(comppadlist, 1, (SV*)PL_comppad);
6901 CvPADLIST(PL_compcv) = comppadlist;
6902 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
6904 CvOWNER(PL_compcv) = 0;
6905 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
6906 MUTEX_INIT(CvMUTEXP(PL_compcv));
6907 #endif /* USE_THREADS */
6909 return oldsavestack_ix;
6913 Perl_yywarn(pTHX_ char *s)
6916 PL_in_eval |= EVAL_WARNONLY;
6918 PL_in_eval &= ~EVAL_WARNONLY;
6923 Perl_yyerror(pTHX_ char *s)
6927 char *context = NULL;
6931 if (!yychar || (yychar == ';' && !PL_rsfp))
6933 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
6934 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
6935 while (isSPACE(*PL_oldoldbufptr))
6937 context = PL_oldoldbufptr;
6938 contlen = PL_bufptr - PL_oldoldbufptr;
6940 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
6941 PL_oldbufptr != PL_bufptr) {
6942 while (isSPACE(*PL_oldbufptr))
6944 context = PL_oldbufptr;
6945 contlen = PL_bufptr - PL_oldbufptr;
6947 else if (yychar > 255)
6948 where = "next token ???";
6949 else if ((yychar & 127) == 127) {
6950 if (PL_lex_state == LEX_NORMAL ||
6951 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
6952 where = "at end of line";
6953 else if (PL_lex_inpat)
6954 where = "within pattern";
6956 where = "within string";
6959 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
6961 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
6962 else if (isPRINT_LC(yychar))
6963 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
6965 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
6966 where = SvPVX(where_sv);
6968 msg = sv_2mortal(newSVpv(s, 0));
6970 Perl_sv_catpvf(aTHX_ msg, " at %_ line %" PERL_PRId64 ", ",
6971 GvSV(PL_curcop->cop_filegv), (IV)PL_curcop->cop_line);
6973 Perl_sv_catpvf(aTHX_ msg, " at %_ line %ld, ",
6974 GvSV(PL_curcop->cop_filegv), (long)PL_curcop->cop_line);
6977 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
6979 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
6980 if (PL_multi_start < PL_multi_end && (U32)(PL_curcop->cop_line - PL_multi_end) <= 1) {
6982 Perl_sv_catpvf(aTHX_ msg,
6983 " (Might be a runaway multi-line %c%c string starting on line %" PERL_\
6985 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
6987 Perl_sv_catpvf(aTHX_ msg,
6988 " (Might be a runaway multi-line %c%c string starting on line %ld)\n",
6989 (int)PL_multi_open,(int)PL_multi_close,(long)PL_multi_start);
6993 if (PL_in_eval & EVAL_WARNONLY)
6994 Perl_warn(aTHX_ "%_", msg);
6997 if (PL_error_count >= 10)
6998 Perl_croak(aTHX_ "%_ has too many errors.\n", GvSV(PL_curcop->cop_filegv));
7000 PL_in_my_stash = Nullhv;
7012 * Restore a source filter.
7016 restore_rsfp(pTHXo_ void *f)
7018 PerlIO *fp = (PerlIO*)f;
7020 if (PL_rsfp == PerlIO_stdin())
7021 PerlIO_clearerr(PL_rsfp);
7022 else if (PL_rsfp && (PL_rsfp != fp))
7023 PerlIO_close(PL_rsfp);
7029 * Restores the state of PL_expect when the lexing that begun with a
7030 * start_lex() call has ended.
7034 restore_expect(pTHXo_ void *e)
7036 /* a safe way to store a small integer in a pointer */
7037 PL_expect = (expectation)((char *)e - PL_tokenbuf);
7041 * restore_lex_expect
7042 * Restores the state of PL_lex_expect when the lexing that begun with a
7043 * start_lex() call has ended.
7047 restore_lex_expect(pTHXo_ void *e)
7049 /* a safe way to store a small integer in a pointer */
7050 PL_lex_expect = (expectation)((char *)e - PL_tokenbuf);