3 * Copyright (c) 1991-2001, 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 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
40 /* For now 'use utf8' does not affect tokenizer on EBCDIC */
41 #define UTF (PL_linestr && DO_UTF8(PL_linestr))
43 #define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
46 /* In variables name $^X, these are the legal values for X.
47 * 1999-02-27 mjd-perl-patch@plover.com */
48 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
50 /* On MacOS, respect nonbreaking spaces */
51 #ifdef MACOS_TRADITIONAL
52 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
57 /* LEX_* are values for PL_lex_state, the state of the lexer.
58 * They are arranged oddly so that the guard on the switch statement
59 * can get by with a single comparison (if the compiler is smart enough).
62 /* #define LEX_NOTPARSING 11 is done in perl.h. */
65 #define LEX_INTERPNORMAL 9
66 #define LEX_INTERPCASEMOD 8
67 #define LEX_INTERPPUSH 7
68 #define LEX_INTERPSTART 6
69 #define LEX_INTERPEND 5
70 #define LEX_INTERPENDMAYBE 4
71 #define LEX_INTERPCONCAT 3
72 #define LEX_INTERPCONST 2
73 #define LEX_FORMLINE 1
74 #define LEX_KNOWNEXT 0
82 # define YYMAXLEVEL 100
84 YYSTYPE* yylval_pointer[YYMAXLEVEL];
85 int* yychar_pointer[YYMAXLEVEL];
89 # define yylval (*yylval_pointer[yyactlevel])
90 # define yychar (*yychar_pointer[yyactlevel])
91 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
93 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
98 /* CLINE is a macro that ensures PL_copline has a sane value */
103 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
106 * Convenience functions to return different tokens and prime the
107 * lexer for the next token. They all take an argument.
109 * TOKEN : generic token (used for '(', DOLSHARP, etc)
110 * OPERATOR : generic operator
111 * AOPERATOR : assignment operator
112 * PREBLOCK : beginning the block after an if, while, foreach, ...
113 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
114 * PREREF : *EXPR where EXPR is not a simple identifier
115 * TERM : expression term
116 * LOOPX : loop exiting command (goto, last, dump, etc)
117 * FTST : file test operator
118 * FUN0 : zero-argument function
119 * FUN1 : not used, except for not, which isn't a UNIOP
120 * BOop : bitwise or or xor
122 * SHop : shift operator
123 * PWop : power operator
124 * PMop : pattern-matching operator
125 * Aop : addition-level operator
126 * Mop : multiplication-level operator
127 * Eop : equality-testing operator
128 * Rop : relational operator <= != gt
130 * Also see LOP and lop() below.
133 /* Note that REPORT() and REPORT2() will be expressions that supply
134 * their own trailing comma, not suitable for statements as such. */
135 #ifdef DEBUGGING /* Serve -DT. */
136 # define REPORT(x,retval) tokereport(x,s,(int)retval),
137 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
139 # define REPORT(x,retval)
140 # define REPORT2(x,retval)
143 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
144 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
145 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
146 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
147 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
148 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
149 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
150 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
151 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
152 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
153 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
154 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
155 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
156 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
157 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
158 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
159 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
160 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
161 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
162 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
164 /* This bit of chicanery makes a unary function followed by
165 * a parenthesis into a function with one argument, highest precedence.
167 #define UNI(f) return(yylval.ival = f, \
171 PL_last_uni = PL_oldbufptr, \
172 PL_last_lop_op = f, \
173 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
175 #define UNIBRACK(f) return(yylval.ival = f, \
178 PL_last_uni = PL_oldbufptr, \
179 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
181 /* grandfather return to old style */
182 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
185 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
188 SV* report = newSVpv(thing, 0);
189 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
192 if (s - PL_bufptr > 0)
193 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
195 if (PL_oldbufptr && *PL_oldbufptr)
196 sv_catpv(report, PL_tokenbuf);
198 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
205 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
206 * into an OP_ANDASSIGN or OP_ORASSIGN
210 S_ao(pTHX_ int toketype)
212 if (*PL_bufptr == '=') {
214 if (toketype == ANDAND)
215 yylval.ival = OP_ANDASSIGN;
216 else if (toketype == OROR)
217 yylval.ival = OP_ORASSIGN;
225 * When Perl expects an operator and finds something else, no_op
226 * prints the warning. It always prints "<something> found where
227 * operator expected. It prints "Missing semicolon on previous line?"
228 * if the surprise occurs at the start of the line. "do you need to
229 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
230 * where the compiler doesn't know if foo is a method call or a function.
231 * It prints "Missing operator before end of line" if there's nothing
232 * after the missing operator, or "... before <...>" if there is something
233 * after the missing operator.
237 S_no_op(pTHX_ char *what, char *s)
239 char *oldbp = PL_bufptr;
240 bool is_first = (PL_oldbufptr == PL_linestart);
246 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
248 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
249 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
251 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
252 if (t < PL_bufptr && isSPACE(*t))
253 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
254 t - PL_oldoldbufptr, PL_oldoldbufptr);
258 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
265 * Complain about missing quote/regexp/heredoc terminator.
266 * If it's called with (char *)NULL then it cauterizes the line buffer.
267 * If we're in a delimited string and the delimiter is a control
268 * character, it's reformatted into a two-char sequence like ^C.
273 S_missingterm(pTHX_ char *s)
278 char *nl = strrchr(s,'\n');
284 iscntrl(PL_multi_close)
286 PL_multi_close < 32 || PL_multi_close == 127
290 tmpbuf[1] = toCTRL(PL_multi_close);
296 *tmpbuf = PL_multi_close;
300 q = strchr(s,'"') ? '\'' : '"';
301 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
309 Perl_deprecate(pTHX_ char *s)
311 if (ckWARN(WARN_DEPRECATED))
312 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
317 * Deprecate a comma-less variable list.
323 deprecate("comma-less variable list");
327 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
328 * utf16-to-utf8-reversed.
331 #ifdef PERL_CR_FILTER
335 register char *s = SvPVX(sv);
336 register char *e = s + SvCUR(sv);
337 /* outer loop optimized to do nothing if there are no CR-LFs */
339 if (*s++ == '\r' && *s == '\n') {
340 /* hit a CR-LF, need to copy the rest */
341 register char *d = s - 1;
344 if (*s == '\r' && s[1] == '\n')
355 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
357 I32 count = FILTER_READ(idx+1, sv, maxlen);
358 if (count > 0 && !maxlen)
366 * Initialize variables. Uses the Perl save_stack to save its state (for
367 * recursive calls to the parser).
371 Perl_lex_start(pTHX_ SV *line)
376 SAVEI32(PL_lex_dojoin);
377 SAVEI32(PL_lex_brackets);
378 SAVEI32(PL_lex_casemods);
379 SAVEI32(PL_lex_starts);
380 SAVEI32(PL_lex_state);
381 SAVEVPTR(PL_lex_inpat);
382 SAVEI32(PL_lex_inwhat);
383 if (PL_lex_state == LEX_KNOWNEXT) {
384 I32 toke = PL_nexttoke;
385 while (--toke >= 0) {
386 SAVEI32(PL_nexttype[toke]);
387 SAVEVPTR(PL_nextval[toke]);
389 SAVEI32(PL_nexttoke);
391 SAVECOPLINE(PL_curcop);
394 SAVEPPTR(PL_oldbufptr);
395 SAVEPPTR(PL_oldoldbufptr);
396 SAVEPPTR(PL_last_lop);
397 SAVEPPTR(PL_last_uni);
398 SAVEPPTR(PL_linestart);
399 SAVESPTR(PL_linestr);
400 SAVEPPTR(PL_lex_brackstack);
401 SAVEPPTR(PL_lex_casestack);
402 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
403 SAVESPTR(PL_lex_stuff);
404 SAVEI32(PL_lex_defer);
405 SAVEI32(PL_sublex_info.sub_inwhat);
406 SAVESPTR(PL_lex_repl);
408 SAVEINT(PL_lex_expect);
410 PL_lex_state = LEX_NORMAL;
414 New(899, PL_lex_brackstack, 120, char);
415 New(899, PL_lex_casestack, 12, char);
416 SAVEFREEPV(PL_lex_brackstack);
417 SAVEFREEPV(PL_lex_casestack);
419 *PL_lex_casestack = '\0';
422 PL_lex_stuff = Nullsv;
423 PL_lex_repl = Nullsv;
427 PL_sublex_info.sub_inwhat = 0;
429 if (SvREADONLY(PL_linestr))
430 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
431 s = SvPV(PL_linestr, len);
432 if (len && s[len-1] != ';') {
433 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
434 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
435 sv_catpvn(PL_linestr, "\n;", 2);
437 SvTEMP_off(PL_linestr);
438 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
439 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
440 PL_last_lop = PL_last_uni = Nullch;
442 PL_rs = newSVpvn("\n", 1);
448 * Finalizer for lexing operations. Must be called when the parser is
449 * done with the lexer.
455 PL_doextract = FALSE;
460 * This subroutine has nothing to do with tilting, whether at windmills
461 * or pinball tables. Its name is short for "increment line". It
462 * increments the current line number in CopLINE(PL_curcop) and checks
463 * to see whether the line starts with a comment of the form
464 * # line 500 "foo.pm"
465 * If so, it sets the current line number and file to the values in the comment.
469 S_incline(pTHX_ char *s)
476 CopLINE_inc(PL_curcop);
479 while (SPACE_OR_TAB(*s)) s++;
480 if (strnEQ(s, "line", 4))
484 if (SPACE_OR_TAB(*s))
488 while (SPACE_OR_TAB(*s)) s++;
494 while (SPACE_OR_TAB(*s))
496 if (*s == '"' && (t = strchr(s+1, '"'))) {
501 for (t = s; !isSPACE(*t); t++) ;
504 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
506 if (*e != '\n' && *e != '\0')
507 return; /* false alarm */
513 Safefree(CopFILE(PL_curcop));
515 SvREFCNT_dec(CopFILEGV(PL_curcop));
517 CopFILE_set(PL_curcop, s);
520 CopLINE_set(PL_curcop, atoi(n)-1);
525 * Called to gobble the appropriate amount and type of whitespace.
526 * Skips comments as well.
530 S_skipspace(pTHX_ register char *s)
532 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
533 while (s < PL_bufend && SPACE_OR_TAB(*s))
539 SSize_t oldprevlen, oldoldprevlen;
540 SSize_t oldloplen = 0, oldunilen = 0;
541 while (s < PL_bufend && isSPACE(*s)) {
542 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
547 if (s < PL_bufend && *s == '#') {
548 while (s < PL_bufend && *s != '\n')
552 if (PL_in_eval && !PL_rsfp) {
559 /* only continue to recharge the buffer if we're at the end
560 * of the buffer, we're not reading from a source filter, and
561 * we're in normal lexing mode
563 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
564 PL_lex_state == LEX_FORMLINE)
567 /* try to recharge the buffer */
568 if ((s = filter_gets(PL_linestr, PL_rsfp,
569 (prevlen = SvCUR(PL_linestr)))) == Nullch)
571 /* end of file. Add on the -p or -n magic */
572 if (PL_minus_n || PL_minus_p) {
573 sv_setpv(PL_linestr,PL_minus_p ?
574 ";}continue{print or die qq(-p destination: $!\\n)" :
576 sv_catpv(PL_linestr,";}");
577 PL_minus_n = PL_minus_p = 0;
580 sv_setpv(PL_linestr,";");
582 /* reset variables for next time we lex */
583 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
585 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
586 PL_last_lop = PL_last_uni = Nullch;
588 /* Close the filehandle. Could be from -P preprocessor,
589 * STDIN, or a regular file. If we were reading code from
590 * STDIN (because the commandline held no -e or filename)
591 * then we don't close it, we reset it so the code can
592 * read from STDIN too.
595 if (PL_preprocess && !PL_in_eval)
596 (void)PerlProc_pclose(PL_rsfp);
597 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
598 PerlIO_clearerr(PL_rsfp);
600 (void)PerlIO_close(PL_rsfp);
605 /* not at end of file, so we only read another line */
606 /* make corresponding updates to old pointers, for yyerror() */
607 oldprevlen = PL_oldbufptr - PL_bufend;
608 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
610 oldunilen = PL_last_uni - PL_bufend;
612 oldloplen = PL_last_lop - PL_bufend;
613 PL_linestart = PL_bufptr = s + prevlen;
614 PL_bufend = s + SvCUR(PL_linestr);
616 PL_oldbufptr = s + oldprevlen;
617 PL_oldoldbufptr = s + oldoldprevlen;
619 PL_last_uni = s + oldunilen;
621 PL_last_lop = s + oldloplen;
624 /* debugger active and we're not compiling the debugger code,
625 * so store the line into the debugger's array of lines
627 if (PERLDB_LINE && PL_curstash != PL_debstash) {
628 SV *sv = NEWSV(85,0);
630 sv_upgrade(sv, SVt_PVMG);
631 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
632 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
639 * Check the unary operators to ensure there's no ambiguity in how they're
640 * used. An ambiguous piece of code would be:
642 * This doesn't mean rand() + 5. Because rand() is a unary operator,
643 * the +5 is its argument.
652 if (PL_oldoldbufptr != PL_last_uni)
654 while (isSPACE(*PL_last_uni))
656 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
657 if ((t = strchr(s, '(')) && t < PL_bufptr)
659 if (ckWARN_d(WARN_AMBIGUOUS)){
662 Perl_warner(aTHX_ WARN_AMBIGUOUS,
663 "Warning: Use of \"%s\" without parens is ambiguous",
669 /* workaround to replace the UNI() macro with a function. Only the
670 * hints/uts.sh file mentions this. Other comments elsewhere in the
671 * source indicate Microport Unix might need it too.
677 #define UNI(f) return uni(f,s)
680 S_uni(pTHX_ I32 f, char *s)
685 PL_last_uni = PL_oldbufptr;
696 #endif /* CRIPPLED_CC */
699 * LOP : macro to build a list operator. Its behaviour has been replaced
700 * with a subroutine, S_lop() for which LOP is just another name.
703 #define LOP(f,x) return lop(f,x,s)
707 * Build a list operator (or something that might be one). The rules:
708 * - if we have a next token, then it's a list operator [why?]
709 * - if the next thing is an opening paren, then it's a function
710 * - else it's a list operator
714 S_lop(pTHX_ I32 f, int x, char *s)
721 PL_last_lop = PL_oldbufptr;
736 * When the lexer realizes it knows the next token (for instance,
737 * it is reordering tokens for the parser) then it can call S_force_next
738 * to know what token to return the next time the lexer is called. Caller
739 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
740 * handles the token correctly.
744 S_force_next(pTHX_ I32 type)
746 PL_nexttype[PL_nexttoke] = type;
748 if (PL_lex_state != LEX_KNOWNEXT) {
749 PL_lex_defer = PL_lex_state;
750 PL_lex_expect = PL_expect;
751 PL_lex_state = LEX_KNOWNEXT;
757 * When the lexer knows the next thing is a word (for instance, it has
758 * just seen -> and it knows that the next char is a word char, then
759 * it calls S_force_word to stick the next word into the PL_next lookahead.
762 * char *start : buffer position (must be within PL_linestr)
763 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
764 * int check_keyword : if true, Perl checks to make sure the word isn't
765 * a keyword (do this if the word is a label, e.g. goto FOO)
766 * int allow_pack : if true, : characters will also be allowed (require,
768 * int allow_initial_tick : used by the "sub" lexer only.
772 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
777 start = skipspace(start);
779 if (isIDFIRST_lazy_if(s,UTF) ||
780 (allow_pack && *s == ':') ||
781 (allow_initial_tick && *s == '\'') )
783 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
784 if (check_keyword && keyword(PL_tokenbuf, len))
786 if (token == METHOD) {
791 PL_expect = XOPERATOR;
794 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
795 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
803 * Called when the lexer wants $foo *foo &foo etc, but the program
804 * text only contains the "foo" portion. The first argument is a pointer
805 * to the "foo", and the second argument is the type symbol to prefix.
806 * Forces the next token to be a "WORD".
807 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
811 S_force_ident(pTHX_ register char *s, int kind)
814 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
815 PL_nextval[PL_nexttoke].opval = o;
818 o->op_private = OPpCONST_ENTERED;
819 /* XXX see note in pp_entereval() for why we forgo typo
820 warnings if the symbol must be introduced in an eval.
822 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
823 kind == '$' ? SVt_PV :
824 kind == '@' ? SVt_PVAV :
825 kind == '%' ? SVt_PVHV :
833 Perl_str_to_version(pTHX_ SV *sv)
838 char *start = SvPVx(sv,len);
839 bool utf = SvUTF8(sv) ? TRUE : FALSE;
840 char *end = start + len;
841 while (start < end) {
845 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
850 retval += ((NV)n)/nshift;
859 * Forces the next token to be a version number.
863 S_force_version(pTHX_ char *s)
865 OP *version = Nullop;
874 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
875 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
877 s = scan_num(s, &yylval);
878 version = yylval.opval;
879 ver = cSVOPx(version)->op_sv;
880 if (SvPOK(ver) && !SvNIOK(ver)) {
881 (void)SvUPGRADE(ver, SVt_PVNV);
882 SvNVX(ver) = str_to_version(ver);
883 SvNOK_on(ver); /* hint that it is a version */
888 /* NOTE: The parser sees the package name and the VERSION swapped */
889 PL_nextval[PL_nexttoke].opval = version;
897 * Tokenize a quoted string passed in as an SV. It finds the next
898 * chunk, up to end of string or a backslash. It may make a new
899 * SV containing that chunk (if HINT_NEW_STRING is on). It also
904 S_tokeq(pTHX_ SV *sv)
915 s = SvPV_force(sv, len);
916 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
919 while (s < send && *s != '\\')
924 if ( PL_hints & HINT_NEW_STRING ) {
925 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
931 if (s + 1 < send && (s[1] == '\\'))
932 s++; /* all that, just for this */
937 SvCUR_set(sv, d - SvPVX(sv));
939 if ( PL_hints & HINT_NEW_STRING )
940 return new_constant(NULL, 0, "q", sv, pv, "q");
945 * Now come three functions related to double-quote context,
946 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
947 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
948 * interact with PL_lex_state, and create fake ( ... ) argument lists
949 * to handle functions and concatenation.
950 * They assume that whoever calls them will be setting up a fake
951 * join call, because each subthing puts a ',' after it. This lets
954 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
956 * (I'm not sure whether the spurious commas at the end of lcfirst's
957 * arguments and join's arguments are created or not).
962 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
964 * Pattern matching will set PL_lex_op to the pattern-matching op to
965 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
967 * OP_CONST and OP_READLINE are easy--just make the new op and return.
969 * Everything else becomes a FUNC.
971 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
972 * had an OP_CONST or OP_READLINE). This just sets us up for a
973 * call to S_sublex_push().
979 register I32 op_type = yylval.ival;
981 if (op_type == OP_NULL) {
982 yylval.opval = PL_lex_op;
986 if (op_type == OP_CONST || op_type == OP_READLINE) {
987 SV *sv = tokeq(PL_lex_stuff);
989 if (SvTYPE(sv) == SVt_PVIV) {
990 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
996 nsv = newSVpvn(p, len);
1002 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1003 PL_lex_stuff = Nullsv;
1007 PL_sublex_info.super_state = PL_lex_state;
1008 PL_sublex_info.sub_inwhat = op_type;
1009 PL_sublex_info.sub_op = PL_lex_op;
1010 PL_lex_state = LEX_INTERPPUSH;
1014 yylval.opval = PL_lex_op;
1024 * Create a new scope to save the lexing state. The scope will be
1025 * ended in S_sublex_done. Returns a '(', starting the function arguments
1026 * to the uc, lc, etc. found before.
1027 * Sets PL_lex_state to LEX_INTERPCONCAT.
1035 PL_lex_state = PL_sublex_info.super_state;
1036 SAVEI32(PL_lex_dojoin);
1037 SAVEI32(PL_lex_brackets);
1038 SAVEI32(PL_lex_casemods);
1039 SAVEI32(PL_lex_starts);
1040 SAVEI32(PL_lex_state);
1041 SAVEVPTR(PL_lex_inpat);
1042 SAVEI32(PL_lex_inwhat);
1043 SAVECOPLINE(PL_curcop);
1044 SAVEPPTR(PL_bufptr);
1045 SAVEPPTR(PL_bufend);
1046 SAVEPPTR(PL_oldbufptr);
1047 SAVEPPTR(PL_oldoldbufptr);
1048 SAVEPPTR(PL_last_lop);
1049 SAVEPPTR(PL_last_uni);
1050 SAVEPPTR(PL_linestart);
1051 SAVESPTR(PL_linestr);
1052 SAVEPPTR(PL_lex_brackstack);
1053 SAVEPPTR(PL_lex_casestack);
1055 PL_linestr = PL_lex_stuff;
1056 PL_lex_stuff = Nullsv;
1058 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1059 = SvPVX(PL_linestr);
1060 PL_bufend += SvCUR(PL_linestr);
1061 PL_last_lop = PL_last_uni = Nullch;
1062 SAVEFREESV(PL_linestr);
1064 PL_lex_dojoin = FALSE;
1065 PL_lex_brackets = 0;
1066 New(899, PL_lex_brackstack, 120, char);
1067 New(899, PL_lex_casestack, 12, char);
1068 SAVEFREEPV(PL_lex_brackstack);
1069 SAVEFREEPV(PL_lex_casestack);
1070 PL_lex_casemods = 0;
1071 *PL_lex_casestack = '\0';
1073 PL_lex_state = LEX_INTERPCONCAT;
1074 CopLINE_set(PL_curcop, PL_multi_start);
1076 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1077 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1078 PL_lex_inpat = PL_sublex_info.sub_op;
1080 PL_lex_inpat = Nullop;
1087 * Restores lexer state after a S_sublex_push.
1093 if (!PL_lex_starts++) {
1094 SV *sv = newSVpvn("",0);
1095 if (SvUTF8(PL_linestr))
1097 PL_expect = XOPERATOR;
1098 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1102 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1103 PL_lex_state = LEX_INTERPCASEMOD;
1107 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1108 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1109 PL_linestr = PL_lex_repl;
1111 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1112 PL_bufend += SvCUR(PL_linestr);
1113 PL_last_lop = PL_last_uni = Nullch;
1114 SAVEFREESV(PL_linestr);
1115 PL_lex_dojoin = FALSE;
1116 PL_lex_brackets = 0;
1117 PL_lex_casemods = 0;
1118 *PL_lex_casestack = '\0';
1120 if (SvEVALED(PL_lex_repl)) {
1121 PL_lex_state = LEX_INTERPNORMAL;
1123 /* we don't clear PL_lex_repl here, so that we can check later
1124 whether this is an evalled subst; that means we rely on the
1125 logic to ensure sublex_done() is called again only via the
1126 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1129 PL_lex_state = LEX_INTERPCONCAT;
1130 PL_lex_repl = Nullsv;
1136 PL_bufend = SvPVX(PL_linestr);
1137 PL_bufend += SvCUR(PL_linestr);
1138 PL_expect = XOPERATOR;
1139 PL_sublex_info.sub_inwhat = 0;
1147 Extracts a pattern, double-quoted string, or transliteration. This
1150 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1151 processing a pattern (PL_lex_inpat is true), a transliteration
1152 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1154 Returns a pointer to the character scanned up to. Iff this is
1155 advanced from the start pointer supplied (ie if anything was
1156 successfully parsed), will leave an OP for the substring scanned
1157 in yylval. Caller must intuit reason for not parsing further
1158 by looking at the next characters herself.
1162 double-quoted style: \r and \n
1163 regexp special ones: \D \s
1165 backrefs: \1 (deprecated in substitution replacements)
1166 case and quoting: \U \Q \E
1167 stops on @ and $, but not for $ as tail anchor
1169 In transliterations:
1170 characters are VERY literal, except for - not at the start or end
1171 of the string, which indicates a range. scan_const expands the
1172 range to the full set of intermediate characters.
1174 In double-quoted strings:
1176 double-quoted style: \r and \n
1178 backrefs: \1 (deprecated)
1179 case and quoting: \U \Q \E
1182 scan_const does *not* construct ops to handle interpolated strings.
1183 It stops processing as soon as it finds an embedded $ or @ variable
1184 and leaves it to the caller to work out what's going on.
1186 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1188 $ in pattern could be $foo or could be tail anchor. Assumption:
1189 it's a tail anchor if $ is the last thing in the string, or if it's
1190 followed by one of ")| \n\t"
1192 \1 (backreferences) are turned into $1
1194 The structure of the code is
1195 while (there's a character to process) {
1196 handle transliteration ranges
1197 skip regexp comments
1198 skip # initiated comments in //x patterns
1199 check for embedded @foo
1200 check for embedded scalars
1202 leave intact backslashes from leave (below)
1203 deprecate \1 in strings and sub replacements
1204 handle string-changing backslashes \l \U \Q \E, etc.
1205 switch (what was escaped) {
1206 handle - in a transliteration (becomes a literal -)
1207 handle \132 octal characters
1208 handle 0x15 hex characters
1209 handle \cV (control V)
1210 handle printf backslashes (\f, \r, \n, etc)
1212 } (end if backslash)
1213 } (end while character to read)
1218 S_scan_const(pTHX_ char *start)
1220 register char *send = PL_bufend; /* end of the constant */
1221 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1222 register char *s = start; /* start of the constant */
1223 register char *d = SvPVX(sv); /* destination for copies */
1224 bool dorange = FALSE; /* are we in a translit range? */
1225 bool didrange = FALSE; /* did we just finish a range? */
1226 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1227 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1230 const char *leaveit = /* set of acceptably-backslashed characters */
1232 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1235 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1236 /* If we are doing a trans and we know we want UTF8 set expectation */
1237 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1238 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1242 while (s < send || dorange) {
1243 /* get transliterations out of the way (they're most literal) */
1244 if (PL_lex_inwhat == OP_TRANS) {
1245 /* expand a range A-Z to the full set of characters. AIE! */
1247 I32 i; /* current expanded character */
1248 I32 min; /* first character in range */
1249 I32 max; /* last character in range */
1252 char *c = (char*)utf8_hop((U8*)d, -1);
1256 *c = UTF_TO_NATIVE(0xff);
1257 /* mark the range as done, and continue */
1263 i = d - SvPVX(sv); /* remember current offset */
1264 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1265 d = SvPVX(sv) + i; /* refresh d after realloc */
1266 d -= 2; /* eat the first char and the - */
1268 min = (U8)*d; /* first char in range */
1269 max = (U8)d[1]; /* last char in range */
1273 "Invalid [] range \"%c-%c\" in transliteration operator",
1274 (char)min, (char)max);
1278 if ((isLOWER(min) && isLOWER(max)) ||
1279 (isUPPER(min) && isUPPER(max))) {
1281 for (i = min; i <= max; i++)
1283 *d++ = NATIVE_TO_NEED(has_utf8,i);
1285 for (i = min; i <= max; i++)
1287 *d++ = NATIVE_TO_NEED(has_utf8,i);
1292 for (i = min; i <= max; i++)
1295 /* mark the range as done, and continue */
1301 /* range begins (ignore - as first or last char) */
1302 else if (*s == '-' && s+1 < send && s != start) {
1304 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1307 *d++ = UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1319 /* if we get here, we're not doing a transliteration */
1321 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1322 except for the last char, which will be done separately. */
1323 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1325 while (s < send && *s != ')')
1326 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1328 else if (s[2] == '{' /* This should match regcomp.c */
1329 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1332 char *regparse = s + (s[2] == '{' ? 3 : 4);
1335 while (count && (c = *regparse)) {
1336 if (c == '\\' && regparse[1])
1344 if (*regparse != ')') {
1345 regparse--; /* Leave one char for continuation. */
1346 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1348 while (s < regparse)
1349 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1353 /* likewise skip #-initiated comments in //x patterns */
1354 else if (*s == '#' && PL_lex_inpat &&
1355 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1356 while (s+1 < send && *s != '\n')
1357 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1360 /* check for embedded arrays
1361 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1363 else if (*s == '@' && s[1]
1364 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1367 /* check for embedded scalars. only stop if we're sure it's a
1370 else if (*s == '$') {
1371 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1373 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1374 break; /* in regexp, $ might be tail anchor */
1377 /* End of else if chain - OP_TRANS rejoin rest */
1380 if (*s == '\\' && s+1 < send) {
1383 /* some backslashes we leave behind */
1384 if (*leaveit && *s && strchr(leaveit, *s)) {
1385 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1386 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1390 /* deprecate \1 in strings and substitution replacements */
1391 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1392 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1394 if (ckWARN(WARN_SYNTAX))
1395 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1400 /* string-change backslash escapes */
1401 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1406 /* if we get here, it's either a quoted -, or a digit */
1409 /* quoted - in transliterations */
1411 if (PL_lex_inwhat == OP_TRANS) {
1418 if (ckWARN(WARN_MISC) && isALNUM(*s))
1419 Perl_warner(aTHX_ WARN_MISC,
1420 "Unrecognized escape \\%c passed through",
1422 /* default action is to copy the quoted character */
1423 goto default_action;
1426 /* \132 indicates an octal constant */
1427 case '0': case '1': case '2': case '3':
1428 case '4': case '5': case '6': case '7':
1430 STRLEN len = 0; /* disallow underscores */
1431 uv = (UV)scan_oct(s, 3, &len);
1434 goto NUM_ESCAPE_INSERT;
1436 /* \x24 indicates a hex constant */
1440 char* e = strchr(s, '}');
1441 STRLEN len = 1; /* allow underscores */
1444 yyerror("Missing right brace on \\x{}");
1448 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1453 STRLEN len = 0; /* disallow underscores */
1454 uv = (UV)scan_hex(s, 2, &len);
1460 /* Insert oct or hex escaped character.
1461 * There will always enough room in sv since such
1462 * escapes will be longer than any UTF-8 sequence
1463 * they can end up as. */
1465 /* We need to map to chars to ASCII before doing the tests
1468 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1469 if (!has_utf8 && uv > 255) {
1470 /* Might need to recode whatever we have
1471 * accumulated so far if it contains any
1474 * (Can't we keep track of that and avoid
1475 * this rescan? --jhi)
1479 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1480 if (!NATIVE_IS_INVARIANT(*c)) {
1485 STRLEN offset = d - SvPVX(sv);
1487 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1491 while (src >= (U8 *)SvPVX(sv)) {
1492 if (!NATIVE_IS_INVARIANT(*src)) {
1493 U8 ch = NATIVE_TO_ASCII(*src);
1494 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1495 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1505 if (has_utf8 || uv > 255) {
1506 d = (char*)uvchr_to_utf8((U8*)d, uv);
1508 if (PL_lex_inwhat == OP_TRANS &&
1509 PL_sublex_info.sub_op) {
1510 PL_sublex_info.sub_op->op_private |=
1511 (PL_lex_repl ? OPpTRANS_FROM_UTF
1524 /* \N{latin small letter a} is a named character */
1528 char* e = strchr(s, '}');
1534 yyerror("Missing right brace on \\N{}");
1538 res = newSVpvn(s + 1, e - s - 1);
1539 res = new_constant( Nullch, 0, "charnames",
1540 res, Nullsv, "\\N{...}" );
1542 sv_utf8_upgrade(res);
1543 str = SvPV(res,len);
1544 if (!has_utf8 && SvUTF8(res)) {
1545 char *ostart = SvPVX(sv);
1546 SvCUR_set(sv, d - ostart);
1549 sv_utf8_upgrade(sv);
1550 /* this just broke our allocation above... */
1551 SvGROW(sv, send - start);
1552 d = SvPVX(sv) + SvCUR(sv);
1555 if (len > e - s + 4) {
1556 char *odest = SvPVX(sv);
1558 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1559 d = SvPVX(sv) + (d - odest);
1561 Copy(str, d, len, char);
1568 yyerror("Missing braces on \\N{}");
1571 /* \c is a control character */
1580 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1584 /* printf-style backslashes, formfeeds, newlines, etc */
1586 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1589 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1592 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1595 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1598 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1601 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1604 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1610 } /* end if (backslash) */
1613 /* If we started with encoded form, or already know we want it
1614 and then encode the next character */
1615 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1617 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1618 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1621 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1622 STRLEN off = d - SvPVX(sv);
1623 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1625 d = (char*)uvchr_to_utf8((U8*)d, uv);
1629 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1631 } /* while loop to process each character */
1633 /* terminate the string and set up the sv */
1635 SvCUR_set(sv, d - SvPVX(sv));
1636 if (SvCUR(sv) >= SvLEN(sv))
1637 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1642 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1643 PL_sublex_info.sub_op->op_private |=
1644 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1648 /* shrink the sv if we allocated more than we used */
1649 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1650 SvLEN_set(sv, SvCUR(sv) + 1);
1651 Renew(SvPVX(sv), SvLEN(sv), char);
1654 /* return the substring (via yylval) only if we parsed anything */
1655 if (s > PL_bufptr) {
1656 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1657 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1659 ( PL_lex_inwhat == OP_TRANS
1661 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1664 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1671 * Returns TRUE if there's more to the expression (e.g., a subscript),
1674 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1676 * ->[ and ->{ return TRUE
1677 * { and [ outside a pattern are always subscripts, so return TRUE
1678 * if we're outside a pattern and it's not { or [, then return FALSE
1679 * if we're in a pattern and the first char is a {
1680 * {4,5} (any digits around the comma) returns FALSE
1681 * if we're in a pattern and the first char is a [
1683 * [SOMETHING] has a funky algorithm to decide whether it's a
1684 * character class or not. It has to deal with things like
1685 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1686 * anything else returns TRUE
1689 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1692 S_intuit_more(pTHX_ register char *s)
1694 if (PL_lex_brackets)
1696 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1698 if (*s != '{' && *s != '[')
1703 /* In a pattern, so maybe we have {n,m}. */
1720 /* On the other hand, maybe we have a character class */
1723 if (*s == ']' || *s == '^')
1726 /* this is terrifying, and it works */
1727 int weight = 2; /* let's weigh the evidence */
1729 unsigned char un_char = 255, last_un_char;
1730 char *send = strchr(s,']');
1731 char tmpbuf[sizeof PL_tokenbuf * 4];
1733 if (!send) /* has to be an expression */
1736 Zero(seen,256,char);
1739 else if (isDIGIT(*s)) {
1741 if (isDIGIT(s[1]) && s[2] == ']')
1747 for (; s < send; s++) {
1748 last_un_char = un_char;
1749 un_char = (unsigned char)*s;
1754 weight -= seen[un_char] * 10;
1755 if (isALNUM_lazy_if(s+1,UTF)) {
1756 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1757 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1762 else if (*s == '$' && s[1] &&
1763 strchr("[#!%*<>()-=",s[1])) {
1764 if (/*{*/ strchr("])} =",s[2]))
1773 if (strchr("wds]",s[1]))
1775 else if (seen['\''] || seen['"'])
1777 else if (strchr("rnftbxcav",s[1]))
1779 else if (isDIGIT(s[1])) {
1781 while (s[1] && isDIGIT(s[1]))
1791 if (strchr("aA01! ",last_un_char))
1793 if (strchr("zZ79~",s[1]))
1795 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1796 weight -= 5; /* cope with negative subscript */
1799 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1800 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1805 if (keyword(tmpbuf, d - tmpbuf))
1808 if (un_char == last_un_char + 1)
1810 weight -= seen[un_char];
1815 if (weight >= 0) /* probably a character class */
1825 * Does all the checking to disambiguate
1827 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1828 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1830 * First argument is the stuff after the first token, e.g. "bar".
1832 * Not a method if bar is a filehandle.
1833 * Not a method if foo is a subroutine prototyped to take a filehandle.
1834 * Not a method if it's really "Foo $bar"
1835 * Method if it's "foo $bar"
1836 * Not a method if it's really "print foo $bar"
1837 * Method if it's really "foo package::" (interpreted as package->foo)
1838 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1839 * Not a method if bar is a filehandle or package, but is quoted with
1844 S_intuit_method(pTHX_ char *start, GV *gv)
1846 char *s = start + (*start == '$');
1847 char tmpbuf[sizeof PL_tokenbuf];
1855 if ((cv = GvCVu(gv))) {
1856 char *proto = SvPVX(cv);
1866 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1867 /* start is the beginning of the possible filehandle/object,
1868 * and s is the end of it
1869 * tmpbuf is a copy of it
1872 if (*start == '$') {
1873 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1878 return *s == '(' ? FUNCMETH : METHOD;
1880 if (!keyword(tmpbuf, len)) {
1881 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1886 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1887 if (indirgv && GvCVu(indirgv))
1889 /* filehandle or package name makes it a method */
1890 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1892 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1893 return 0; /* no assumptions -- "=>" quotes bearword */
1895 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1896 newSVpvn(tmpbuf,len));
1897 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1901 return *s == '(' ? FUNCMETH : METHOD;
1909 * Return a string of Perl code to load the debugger. If PERL5DB
1910 * is set, it will return the contents of that, otherwise a
1911 * compile-time require of perl5db.pl.
1918 char *pdb = PerlEnv_getenv("PERL5DB");
1922 SETERRNO(0,SS$_NORMAL);
1923 return "BEGIN { require 'perl5db.pl' }";
1929 /* Encoded script support. filter_add() effectively inserts a
1930 * 'pre-processing' function into the current source input stream.
1931 * Note that the filter function only applies to the current source file
1932 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1934 * The datasv parameter (which may be NULL) can be used to pass
1935 * private data to this instance of the filter. The filter function
1936 * can recover the SV using the FILTER_DATA macro and use it to
1937 * store private buffers and state information.
1939 * The supplied datasv parameter is upgraded to a PVIO type
1940 * and the IoDIRP/IoANY field is used to store the function pointer,
1941 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1942 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1943 * private use must be set using malloc'd pointers.
1947 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1952 if (!PL_rsfp_filters)
1953 PL_rsfp_filters = newAV();
1955 datasv = NEWSV(255,0);
1956 if (!SvUPGRADE(datasv, SVt_PVIO))
1957 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1958 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1959 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1960 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1961 funcp, SvPV_nolen(datasv)));
1962 av_unshift(PL_rsfp_filters, 1);
1963 av_store(PL_rsfp_filters, 0, datasv) ;
1968 /* Delete most recently added instance of this filter function. */
1970 Perl_filter_del(pTHX_ filter_t funcp)
1973 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1974 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1976 /* if filter is on top of stack (usual case) just pop it off */
1977 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1978 if (IoANY(datasv) == (void *)funcp) {
1979 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1980 IoANY(datasv) = (void *)NULL;
1981 sv_free(av_pop(PL_rsfp_filters));
1985 /* we need to search for the correct entry and clear it */
1986 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1990 /* Invoke the n'th filter function for the current rsfp. */
1992 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1995 /* 0 = read one text line */
2000 if (!PL_rsfp_filters)
2002 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2003 /* Provide a default input filter to make life easy. */
2004 /* Note that we append to the line. This is handy. */
2005 DEBUG_P(PerlIO_printf(Perl_debug_log,
2006 "filter_read %d: from rsfp\n", idx));
2010 int old_len = SvCUR(buf_sv) ;
2012 /* ensure buf_sv is large enough */
2013 SvGROW(buf_sv, old_len + maxlen) ;
2014 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2015 if (PerlIO_error(PL_rsfp))
2016 return -1; /* error */
2018 return 0 ; /* end of file */
2020 SvCUR_set(buf_sv, old_len + len) ;
2023 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2024 if (PerlIO_error(PL_rsfp))
2025 return -1; /* error */
2027 return 0 ; /* end of file */
2030 return SvCUR(buf_sv);
2032 /* Skip this filter slot if filter has been deleted */
2033 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2034 DEBUG_P(PerlIO_printf(Perl_debug_log,
2035 "filter_read %d: skipped (filter deleted)\n",
2037 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2039 /* Get function pointer hidden within datasv */
2040 funcp = (filter_t)IoANY(datasv);
2041 DEBUG_P(PerlIO_printf(Perl_debug_log,
2042 "filter_read %d: via function %p (%s)\n",
2043 idx, funcp, SvPV_nolen(datasv)));
2044 /* Call function. The function is expected to */
2045 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2046 /* Return: <0:error, =0:eof, >0:not eof */
2047 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
2051 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2053 #ifdef PERL_CR_FILTER
2054 if (!PL_rsfp_filters) {
2055 filter_add(S_cr_textfilter,NULL);
2058 if (PL_rsfp_filters) {
2061 SvCUR_set(sv, 0); /* start with empty line */
2062 if (FILTER_READ(0, sv, 0) > 0)
2063 return ( SvPVX(sv) ) ;
2068 return (sv_gets(sv, fp, append));
2072 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2076 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2080 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2081 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2083 return GvHV(gv); /* Foo:: */
2086 /* use constant CLASS => 'MyClass' */
2087 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2089 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2090 pkgname = SvPV_nolen(sv);
2094 return gv_stashpv(pkgname, FALSE);
2098 static char* exp_name[] =
2099 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2100 "ATTRTERM", "TERMBLOCK"
2107 Works out what to call the token just pulled out of the input
2108 stream. The yacc parser takes care of taking the ops we return and
2109 stitching them into a tree.
2115 if read an identifier
2116 if we're in a my declaration
2117 croak if they tried to say my($foo::bar)
2118 build the ops for a my() declaration
2119 if it's an access to a my() variable
2120 are we in a sort block?
2121 croak if my($a); $a <=> $b
2122 build ops for access to a my() variable
2123 if in a dq string, and they've said @foo and we can't find @foo
2125 build ops for a bareword
2126 if we already built the token before, use it.
2129 #ifdef USE_PURE_BISON
2131 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2136 yylval_pointer[yyactlevel] = lvalp;
2137 yychar_pointer[yyactlevel] = lcharp;
2138 if (yyactlevel >= YYMAXLEVEL)
2139 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2141 r = Perl_yylex(aTHX);
2151 #pragma segment Perl_yylex
2164 /* check if there's an identifier for us to look at */
2165 if (PL_pending_ident) {
2166 /* pit holds the identifier we read and pending_ident is reset */
2167 char pit = PL_pending_ident;
2168 PL_pending_ident = 0;
2170 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2171 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
2173 /* if we're in a my(), we can't allow dynamics here.
2174 $foo'bar has already been turned into $foo::bar, so
2175 just check for colons.
2177 if it's a legal name, the OP is a PADANY.
2180 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2181 if (strchr(PL_tokenbuf,':'))
2182 yyerror(Perl_form(aTHX_ "No package name allowed for "
2183 "variable %s in \"our\"",
2185 tmp = pad_allocmy(PL_tokenbuf);
2188 if (strchr(PL_tokenbuf,':'))
2189 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2191 yylval.opval = newOP(OP_PADANY, 0);
2192 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2198 build the ops for accesses to a my() variable.
2200 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2201 then used in a comparison. This catches most, but not
2202 all cases. For instance, it catches
2203 sort { my($a); $a <=> $b }
2205 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2206 (although why you'd do that is anyone's guess).
2209 if (!strchr(PL_tokenbuf,':')) {
2211 /* Check for single character per-thread SVs */
2212 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2213 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2214 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2216 yylval.opval = newOP(OP_THREADSV, 0);
2217 yylval.opval->op_targ = tmp;
2220 #endif /* USE_THREADS */
2221 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2222 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2223 /* might be an "our" variable" */
2224 if (SvFLAGS(namesv) & SVpad_OUR) {
2225 /* build ops for a bareword */
2226 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2227 sv_catpvn(sym, "::", 2);
2228 sv_catpv(sym, PL_tokenbuf+1);
2229 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2230 yylval.opval->op_private = OPpCONST_ENTERED;
2231 gv_fetchpv(SvPVX(sym),
2233 ? (GV_ADDMULTI | GV_ADDINEVAL)
2236 ((PL_tokenbuf[0] == '$') ? SVt_PV
2237 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2242 /* if it's a sort block and they're naming $a or $b */
2243 if (PL_last_lop_op == OP_SORT &&
2244 PL_tokenbuf[0] == '$' &&
2245 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2248 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2249 d < PL_bufend && *d != '\n';
2252 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2253 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2259 yylval.opval = newOP(OP_PADANY, 0);
2260 yylval.opval->op_targ = tmp;
2266 Whine if they've said @foo in a doublequoted string,
2267 and @foo isn't a variable we can find in the symbol
2270 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2271 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2272 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2273 && ckWARN(WARN_AMBIGUOUS))
2275 /* Downgraded from fatal to warning 20000522 mjd */
2276 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2277 "Possible unintended interpolation of %s in string",
2282 /* build ops for a bareword */
2283 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2284 yylval.opval->op_private = OPpCONST_ENTERED;
2285 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2286 ((PL_tokenbuf[0] == '$') ? SVt_PV
2287 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2292 /* no identifier pending identification */
2294 switch (PL_lex_state) {
2296 case LEX_NORMAL: /* Some compilers will produce faster */
2297 case LEX_INTERPNORMAL: /* code if we comment these out. */
2301 /* when we've already built the next token, just pull it out of the queue */
2304 yylval = PL_nextval[PL_nexttoke];
2306 PL_lex_state = PL_lex_defer;
2307 PL_expect = PL_lex_expect;
2308 PL_lex_defer = LEX_NORMAL;
2310 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2311 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2312 (IV)PL_nexttype[PL_nexttoke]); });
2314 return(PL_nexttype[PL_nexttoke]);
2316 /* interpolated case modifiers like \L \U, including \Q and \E.
2317 when we get here, PL_bufptr is at the \
2319 case LEX_INTERPCASEMOD:
2321 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2322 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2324 /* handle \E or end of string */
2325 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2329 if (PL_lex_casemods) {
2330 oldmod = PL_lex_casestack[--PL_lex_casemods];
2331 PL_lex_casestack[PL_lex_casemods] = '\0';
2333 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2335 PL_lex_state = LEX_INTERPCONCAT;
2339 if (PL_bufptr != PL_bufend)
2341 PL_lex_state = LEX_INTERPCONCAT;
2345 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2346 "### Saw case modifier at '%s'\n", PL_bufptr); });
2348 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2349 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2350 if (strchr("LU", *s) &&
2351 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2353 PL_lex_casestack[--PL_lex_casemods] = '\0';
2356 if (PL_lex_casemods > 10) {
2357 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2358 if (newlb != PL_lex_casestack) {
2360 PL_lex_casestack = newlb;
2363 PL_lex_casestack[PL_lex_casemods++] = *s;
2364 PL_lex_casestack[PL_lex_casemods] = '\0';
2365 PL_lex_state = LEX_INTERPCONCAT;
2366 PL_nextval[PL_nexttoke].ival = 0;
2369 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2371 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2373 PL_nextval[PL_nexttoke].ival = OP_LC;
2375 PL_nextval[PL_nexttoke].ival = OP_UC;
2377 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2379 Perl_croak(aTHX_ "panic: yylex");
2382 if (PL_lex_starts) {
2391 case LEX_INTERPPUSH:
2392 return sublex_push();
2394 case LEX_INTERPSTART:
2395 if (PL_bufptr == PL_bufend)
2396 return sublex_done();
2397 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2398 "### Interpolated variable at '%s'\n", PL_bufptr); });
2400 PL_lex_dojoin = (*PL_bufptr == '@');
2401 PL_lex_state = LEX_INTERPNORMAL;
2402 if (PL_lex_dojoin) {
2403 PL_nextval[PL_nexttoke].ival = 0;
2406 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2407 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2408 force_next(PRIVATEREF);
2410 force_ident("\"", '$');
2411 #endif /* USE_THREADS */
2412 PL_nextval[PL_nexttoke].ival = 0;
2414 PL_nextval[PL_nexttoke].ival = 0;
2416 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2419 if (PL_lex_starts++) {
2425 case LEX_INTERPENDMAYBE:
2426 if (intuit_more(PL_bufptr)) {
2427 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2433 if (PL_lex_dojoin) {
2434 PL_lex_dojoin = FALSE;
2435 PL_lex_state = LEX_INTERPCONCAT;
2438 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2439 && SvEVALED(PL_lex_repl))
2441 if (PL_bufptr != PL_bufend)
2442 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2443 PL_lex_repl = Nullsv;
2446 case LEX_INTERPCONCAT:
2448 if (PL_lex_brackets)
2449 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2451 if (PL_bufptr == PL_bufend)
2452 return sublex_done();
2454 if (SvIVX(PL_linestr) == '\'') {
2455 SV *sv = newSVsv(PL_linestr);
2458 else if ( PL_hints & HINT_NEW_RE )
2459 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2460 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2464 s = scan_const(PL_bufptr);
2466 PL_lex_state = LEX_INTERPCASEMOD;
2468 PL_lex_state = LEX_INTERPSTART;
2471 if (s != PL_bufptr) {
2472 PL_nextval[PL_nexttoke] = yylval;
2475 if (PL_lex_starts++)
2485 PL_lex_state = LEX_NORMAL;
2486 s = scan_formline(PL_bufptr);
2487 if (!PL_lex_formbrack)
2493 PL_oldoldbufptr = PL_oldbufptr;
2496 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2497 exp_name[PL_expect], s);
2503 if (isIDFIRST_lazy_if(s,UTF))
2505 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2508 goto fake_eof; /* emulate EOF on ^D or ^Z */
2513 if (PL_lex_brackets)
2514 yyerror("Missing right curly or square bracket");
2515 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2516 "### Tokener got EOF\n");
2520 if (s++ < PL_bufend)
2521 goto retry; /* ignore stray nulls */
2524 if (!PL_in_eval && !PL_preambled) {
2525 PL_preambled = TRUE;
2526 sv_setpv(PL_linestr,incl_perldb());
2527 if (SvCUR(PL_linestr))
2528 sv_catpv(PL_linestr,";");
2530 while(AvFILLp(PL_preambleav) >= 0) {
2531 SV *tmpsv = av_shift(PL_preambleav);
2532 sv_catsv(PL_linestr, tmpsv);
2533 sv_catpv(PL_linestr, ";");
2536 sv_free((SV*)PL_preambleav);
2537 PL_preambleav = NULL;
2539 if (PL_minus_n || PL_minus_p) {
2540 sv_catpv(PL_linestr, "LINE: while (<>) {");
2542 sv_catpv(PL_linestr,"chomp;");
2544 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2546 GvIMPORTED_AV_on(gv);
2548 if (strchr("/'\"", *PL_splitstr)
2549 && strchr(PL_splitstr + 1, *PL_splitstr))
2550 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2553 s = "'~#\200\1'"; /* surely one char is unused...*/
2554 while (s[1] && strchr(PL_splitstr, *s)) s++;
2556 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2557 "q" + (delim == '\''), delim);
2558 for (s = PL_splitstr; *s; s++) {
2560 sv_catpvn(PL_linestr, "\\", 1);
2561 sv_catpvn(PL_linestr, s, 1);
2563 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2567 sv_catpv(PL_linestr,"@F=split(' ');");
2570 sv_catpv(PL_linestr, "\n");
2571 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2572 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2573 PL_last_lop = PL_last_uni = Nullch;
2574 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2575 SV *sv = NEWSV(85,0);
2577 sv_upgrade(sv, SVt_PVMG);
2578 sv_setsv(sv,PL_linestr);
2579 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2584 bof = PL_rsfp ? TRUE : FALSE;
2585 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2588 if (PL_preprocess && !PL_in_eval)
2589 (void)PerlProc_pclose(PL_rsfp);
2590 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2591 PerlIO_clearerr(PL_rsfp);
2593 (void)PerlIO_close(PL_rsfp);
2595 PL_doextract = FALSE;
2597 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2598 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2599 sv_catpv(PL_linestr,";}");
2600 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2601 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2602 PL_last_lop = PL_last_uni = Nullch;
2603 PL_minus_n = PL_minus_p = 0;
2606 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2607 PL_last_lop = PL_last_uni = Nullch;
2608 sv_setpv(PL_linestr,"");
2609 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2611 /* if it looks like the start of a BOM, check if it in fact is */
2612 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2613 #ifdef PERLIO_IS_STDIO
2614 # ifdef __GNU_LIBRARY__
2615 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2616 # define FTELL_FOR_PIPE_IS_BROKEN
2620 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2621 # define FTELL_FOR_PIPE_IS_BROKEN
2626 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2627 /* This loses the possibility to detect the bof
2628 * situation on perl -P when the libc5 is being used.
2629 * Workaround? Maybe attach some extra state to PL_rsfp?
2632 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2634 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2637 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2638 s = swallow_bom((U8*)s);
2642 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2643 PL_doextract = FALSE;
2645 /* Incest with pod. */
2646 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2647 sv_setpv(PL_linestr, "");
2648 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2649 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2650 PL_last_lop = PL_last_uni = Nullch;
2651 PL_doextract = FALSE;
2655 } while (PL_doextract);
2656 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2657 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2658 SV *sv = NEWSV(85,0);
2660 sv_upgrade(sv, SVt_PVMG);
2661 sv_setsv(sv,PL_linestr);
2662 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2664 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2665 PL_last_lop = PL_last_uni = Nullch;
2666 if (CopLINE(PL_curcop) == 1) {
2667 while (s < PL_bufend && isSPACE(*s))
2669 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2673 if (*s == '#' && *(s+1) == '!')
2675 #ifdef ALTERNATE_SHEBANG
2677 static char as[] = ALTERNATE_SHEBANG;
2678 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2679 d = s + (sizeof(as) - 1);
2681 #endif /* ALTERNATE_SHEBANG */
2690 while (*d && !isSPACE(*d))
2694 #ifdef ARG_ZERO_IS_SCRIPT
2695 if (ipathend > ipath) {
2697 * HP-UX (at least) sets argv[0] to the script name,
2698 * which makes $^X incorrect. And Digital UNIX and Linux,
2699 * at least, set argv[0] to the basename of the Perl
2700 * interpreter. So, having found "#!", we'll set it right.
2702 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2703 assert(SvPOK(x) || SvGMAGICAL(x));
2704 if (sv_eq(x, CopFILESV(PL_curcop))) {
2705 sv_setpvn(x, ipath, ipathend - ipath);
2708 TAINT_NOT; /* $^X is always tainted, but that's OK */
2710 #endif /* ARG_ZERO_IS_SCRIPT */
2715 d = instr(s,"perl -");
2717 d = instr(s,"perl");
2719 /* avoid getting into infinite loops when shebang
2720 * line contains "Perl" rather than "perl" */
2722 for (d = ipathend-4; d >= ipath; --d) {
2723 if ((*d == 'p' || *d == 'P')
2724 && !ibcmp(d, "perl", 4))
2734 #ifdef ALTERNATE_SHEBANG
2736 * If the ALTERNATE_SHEBANG on this system starts with a
2737 * character that can be part of a Perl expression, then if
2738 * we see it but not "perl", we're probably looking at the
2739 * start of Perl code, not a request to hand off to some
2740 * other interpreter. Similarly, if "perl" is there, but
2741 * not in the first 'word' of the line, we assume the line
2742 * contains the start of the Perl program.
2744 if (d && *s != '#') {
2746 while (*c && !strchr("; \t\r\n\f\v#", *c))
2749 d = Nullch; /* "perl" not in first word; ignore */
2751 *s = '#'; /* Don't try to parse shebang line */
2753 #endif /* ALTERNATE_SHEBANG */
2754 #ifndef MACOS_TRADITIONAL
2759 !instr(s,"indir") &&
2760 instr(PL_origargv[0],"perl"))
2766 while (s < PL_bufend && isSPACE(*s))
2768 if (s < PL_bufend) {
2769 Newz(899,newargv,PL_origargc+3,char*);
2771 while (s < PL_bufend && !isSPACE(*s))
2774 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2777 newargv = PL_origargv;
2779 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2780 Perl_croak(aTHX_ "Can't exec %s", ipath);
2784 U32 oldpdb = PL_perldb;
2785 bool oldn = PL_minus_n;
2786 bool oldp = PL_minus_p;
2788 while (*d && !isSPACE(*d)) d++;
2789 while (SPACE_OR_TAB(*d)) d++;
2793 if (*d == 'M' || *d == 'm') {
2795 while (*d && !isSPACE(*d)) d++;
2796 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2799 d = moreswitches(d);
2801 if ((PERLDB_LINE && !oldpdb) ||
2802 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2803 /* if we have already added "LINE: while (<>) {",
2804 we must not do it again */
2806 sv_setpv(PL_linestr, "");
2807 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2808 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2809 PL_last_lop = PL_last_uni = Nullch;
2810 PL_preambled = FALSE;
2812 (void)gv_fetchfile(PL_origfilename);
2819 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2821 PL_lex_state = LEX_FORMLINE;
2826 #ifdef PERL_STRICT_CR
2827 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2829 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2831 case ' ': case '\t': case '\f': case 013:
2832 #ifdef MACOS_TRADITIONAL
2839 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2840 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2841 /* handle eval qq[#line 1 "foo"\n ...] */
2842 CopLINE_dec(PL_curcop);
2846 while (s < d && *s != '\n')
2850 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2851 Perl_croak(aTHX_ "panic: input overflow");
2853 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2855 PL_lex_state = LEX_FORMLINE;
2865 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2872 while (s < PL_bufend && SPACE_OR_TAB(*s))
2875 if (strnEQ(s,"=>",2)) {
2876 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2877 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2878 "### Saw unary minus before =>, forcing word '%s'\n", s);
2880 OPERATOR('-'); /* unary minus */
2882 PL_last_uni = PL_oldbufptr;
2884 case 'r': ftst = OP_FTEREAD; break;
2885 case 'w': ftst = OP_FTEWRITE; break;
2886 case 'x': ftst = OP_FTEEXEC; break;
2887 case 'o': ftst = OP_FTEOWNED; break;
2888 case 'R': ftst = OP_FTRREAD; break;
2889 case 'W': ftst = OP_FTRWRITE; break;
2890 case 'X': ftst = OP_FTREXEC; break;
2891 case 'O': ftst = OP_FTROWNED; break;
2892 case 'e': ftst = OP_FTIS; break;
2893 case 'z': ftst = OP_FTZERO; break;
2894 case 's': ftst = OP_FTSIZE; break;
2895 case 'f': ftst = OP_FTFILE; break;
2896 case 'd': ftst = OP_FTDIR; break;
2897 case 'l': ftst = OP_FTLINK; break;
2898 case 'p': ftst = OP_FTPIPE; break;
2899 case 'S': ftst = OP_FTSOCK; break;
2900 case 'u': ftst = OP_FTSUID; break;
2901 case 'g': ftst = OP_FTSGID; break;
2902 case 'k': ftst = OP_FTSVTX; break;
2903 case 'b': ftst = OP_FTBLK; break;
2904 case 'c': ftst = OP_FTCHR; break;
2905 case 't': ftst = OP_FTTTY; break;
2906 case 'T': ftst = OP_FTTEXT; break;
2907 case 'B': ftst = OP_FTBINARY; break;
2908 case 'M': case 'A': case 'C':
2909 gv_fetchpv("\024",TRUE, SVt_PV);
2911 case 'M': ftst = OP_FTMTIME; break;
2912 case 'A': ftst = OP_FTATIME; break;
2913 case 'C': ftst = OP_FTCTIME; break;
2921 PL_last_lop_op = ftst;
2922 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2923 "### Saw file test %c\n", (int)ftst);
2928 /* Assume it was a minus followed by a one-letter named
2929 * subroutine call (or a -bareword), then. */
2930 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2931 "### %c looked like a file test but was not\n",
2940 if (PL_expect == XOPERATOR)
2945 else if (*s == '>') {
2948 if (isIDFIRST_lazy_if(s,UTF)) {
2949 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2957 if (PL_expect == XOPERATOR)
2960 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2962 OPERATOR('-'); /* unary minus */
2969 if (PL_expect == XOPERATOR)
2974 if (PL_expect == XOPERATOR)
2977 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2983 if (PL_expect != XOPERATOR) {
2984 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2985 PL_expect = XOPERATOR;
2986 force_ident(PL_tokenbuf, '*');
2999 if (PL_expect == XOPERATOR) {
3003 PL_tokenbuf[0] = '%';
3004 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
3005 if (!PL_tokenbuf[1]) {
3007 yyerror("Final % should be \\% or %name");
3010 PL_pending_ident = '%';
3029 switch (PL_expect) {
3032 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3034 PL_bufptr = s; /* update in case we back off */
3040 PL_expect = XTERMBLOCK;
3044 while (isIDFIRST_lazy_if(s,UTF)) {
3045 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3046 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3047 if (tmp < 0) tmp = -tmp;
3062 d = scan_str(d,TRUE,TRUE);
3064 /* MUST advance bufptr here to avoid bogus
3065 "at end of line" context messages from yyerror().
3067 PL_bufptr = s + len;
3068 yyerror("Unterminated attribute parameter in attribute list");
3071 return 0; /* EOF indicator */
3075 SV *sv = newSVpvn(s, len);
3076 sv_catsv(sv, PL_lex_stuff);
3077 attrs = append_elem(OP_LIST, attrs,
3078 newSVOP(OP_CONST, 0, sv));
3079 SvREFCNT_dec(PL_lex_stuff);
3080 PL_lex_stuff = Nullsv;
3083 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3084 CvLVALUE_on(PL_compcv);
3085 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3086 CvLOCKED_on(PL_compcv);
3087 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3088 CvMETHOD_on(PL_compcv);
3090 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "shared", len))
3091 GvSHARED_on(cGVOPx_gv(yylval.opval));
3093 /* After we've set the flags, it could be argued that
3094 we don't need to do the attributes.pm-based setting
3095 process, and shouldn't bother appending recognized
3096 flags. To experiment with that, uncomment the
3097 following "else": */
3099 attrs = append_elem(OP_LIST, attrs,
3100 newSVOP(OP_CONST, 0,
3104 if (*s == ':' && s[1] != ':')
3107 break; /* require real whitespace or :'s */
3109 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3110 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3111 char q = ((*s == '\'') ? '"' : '\'');
3112 /* If here for an expression, and parsed no attrs, back off. */
3113 if (tmp == '=' && !attrs) {
3117 /* MUST advance bufptr here to avoid bogus "at end of line"
3118 context messages from yyerror().
3122 yyerror("Unterminated attribute list");
3124 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3132 PL_nextval[PL_nexttoke].opval = attrs;
3140 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3141 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3157 if (PL_lex_brackets <= 0)
3158 yyerror("Unmatched right square bracket");
3161 if (PL_lex_state == LEX_INTERPNORMAL) {
3162 if (PL_lex_brackets == 0) {
3163 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3164 PL_lex_state = LEX_INTERPEND;
3171 if (PL_lex_brackets > 100) {
3172 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3173 if (newlb != PL_lex_brackstack) {
3175 PL_lex_brackstack = newlb;
3178 switch (PL_expect) {
3180 if (PL_lex_formbrack) {
3184 if (PL_oldoldbufptr == PL_last_lop)
3185 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3187 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3188 OPERATOR(HASHBRACK);
3190 while (s < PL_bufend && SPACE_OR_TAB(*s))
3193 PL_tokenbuf[0] = '\0';
3194 if (d < PL_bufend && *d == '-') {
3195 PL_tokenbuf[0] = '-';
3197 while (d < PL_bufend && SPACE_OR_TAB(*d))
3200 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3201 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3203 while (d < PL_bufend && SPACE_OR_TAB(*d))
3206 char minus = (PL_tokenbuf[0] == '-');
3207 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3215 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3220 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3225 if (PL_oldoldbufptr == PL_last_lop)
3226 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3228 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3231 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3233 /* This hack is to get the ${} in the message. */
3235 yyerror("syntax error");
3238 OPERATOR(HASHBRACK);
3240 /* This hack serves to disambiguate a pair of curlies
3241 * as being a block or an anon hash. Normally, expectation
3242 * determines that, but in cases where we're not in a
3243 * position to expect anything in particular (like inside
3244 * eval"") we have to resolve the ambiguity. This code
3245 * covers the case where the first term in the curlies is a
3246 * quoted string. Most other cases need to be explicitly
3247 * disambiguated by prepending a `+' before the opening
3248 * curly in order to force resolution as an anon hash.
3250 * XXX should probably propagate the outer expectation
3251 * into eval"" to rely less on this hack, but that could
3252 * potentially break current behavior of eval"".
3256 if (*s == '\'' || *s == '"' || *s == '`') {
3257 /* common case: get past first string, handling escapes */
3258 for (t++; t < PL_bufend && *t != *s;)
3259 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3263 else if (*s == 'q') {
3266 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3270 char open, close, term;
3273 while (t < PL_bufend && isSPACE(*t))
3277 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3281 for (t++; t < PL_bufend; t++) {
3282 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3284 else if (*t == open)
3288 for (t++; t < PL_bufend; t++) {
3289 if (*t == '\\' && t+1 < PL_bufend)
3291 else if (*t == close && --brackets <= 0)
3293 else if (*t == open)
3299 else if (isALNUM_lazy_if(t,UTF)) {
3301 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3304 while (t < PL_bufend && isSPACE(*t))
3306 /* if comma follows first term, call it an anon hash */
3307 /* XXX it could be a comma expression with loop modifiers */
3308 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3309 || (*t == '=' && t[1] == '>')))
3310 OPERATOR(HASHBRACK);
3311 if (PL_expect == XREF)
3314 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3320 yylval.ival = CopLINE(PL_curcop);
3321 if (isSPACE(*s) || *s == '#')
3322 PL_copline = NOLINE; /* invalidate current command line number */
3327 if (PL_lex_brackets <= 0)
3328 yyerror("Unmatched right curly bracket");
3330 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3331 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3332 PL_lex_formbrack = 0;
3333 if (PL_lex_state == LEX_INTERPNORMAL) {
3334 if (PL_lex_brackets == 0) {
3335 if (PL_expect & XFAKEBRACK) {
3336 PL_expect &= XENUMMASK;
3337 PL_lex_state = LEX_INTERPEND;
3339 return yylex(); /* ignore fake brackets */
3341 if (*s == '-' && s[1] == '>')
3342 PL_lex_state = LEX_INTERPENDMAYBE;
3343 else if (*s != '[' && *s != '{')
3344 PL_lex_state = LEX_INTERPEND;
3347 if (PL_expect & XFAKEBRACK) {
3348 PL_expect &= XENUMMASK;
3350 return yylex(); /* ignore fake brackets */
3360 if (PL_expect == XOPERATOR) {
3361 if (ckWARN(WARN_SEMICOLON)
3362 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3364 CopLINE_dec(PL_curcop);
3365 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3366 CopLINE_inc(PL_curcop);
3371 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3373 PL_expect = XOPERATOR;
3374 force_ident(PL_tokenbuf, '&');
3378 yylval.ival = (OPpENTERSUB_AMPER<<8);
3397 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3398 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3400 if (PL_expect == XSTATE && isALPHA(tmp) &&
3401 (s == PL_linestart+1 || s[-2] == '\n') )
3403 if (PL_in_eval && !PL_rsfp) {
3408 if (strnEQ(s,"=cut",4)) {
3422 PL_doextract = TRUE;
3425 if (PL_lex_brackets < PL_lex_formbrack) {
3427 #ifdef PERL_STRICT_CR
3428 for (t = s; SPACE_OR_TAB(*t); t++) ;
3430 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3432 if (*t == '\n' || *t == '#') {
3450 if (PL_expect != XOPERATOR) {
3451 if (s[1] != '<' && !strchr(s,'>'))
3454 s = scan_heredoc(s);
3456 s = scan_inputsymbol(s);
3457 TERM(sublex_start());
3462 SHop(OP_LEFT_SHIFT);
3476 SHop(OP_RIGHT_SHIFT);
3485 if (PL_expect == XOPERATOR) {
3486 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3489 return ','; /* grandfather non-comma-format format */
3493 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3494 PL_tokenbuf[0] = '@';
3495 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3496 sizeof PL_tokenbuf - 1, FALSE);
3497 if (PL_expect == XOPERATOR)
3498 no_op("Array length", s);
3499 if (!PL_tokenbuf[1])
3501 PL_expect = XOPERATOR;
3502 PL_pending_ident = '#';
3506 PL_tokenbuf[0] = '$';
3507 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3508 sizeof PL_tokenbuf - 1, FALSE);
3509 if (PL_expect == XOPERATOR)
3511 if (!PL_tokenbuf[1]) {
3513 yyerror("Final $ should be \\$ or $name");
3517 /* This kludge not intended to be bulletproof. */
3518 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3519 yylval.opval = newSVOP(OP_CONST, 0,
3520 newSViv(PL_compiling.cop_arybase));
3521 yylval.opval->op_private = OPpCONST_ARYBASE;
3527 if (PL_lex_state == LEX_NORMAL)
3530 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3533 PL_tokenbuf[0] = '@';
3534 if (ckWARN(WARN_SYNTAX)) {
3536 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3539 PL_bufptr = skipspace(PL_bufptr);
3540 while (t < PL_bufend && *t != ']')
3542 Perl_warner(aTHX_ WARN_SYNTAX,
3543 "Multidimensional syntax %.*s not supported",
3544 (t - PL_bufptr) + 1, PL_bufptr);
3548 else if (*s == '{') {
3549 PL_tokenbuf[0] = '%';
3550 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3551 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3553 char tmpbuf[sizeof PL_tokenbuf];
3555 for (t++; isSPACE(*t); t++) ;
3556 if (isIDFIRST_lazy_if(t,UTF)) {
3557 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3558 for (; isSPACE(*t); t++) ;
3559 if (*t == ';' && get_cv(tmpbuf, FALSE))
3560 Perl_warner(aTHX_ WARN_SYNTAX,
3561 "You need to quote \"%s\"", tmpbuf);
3567 PL_expect = XOPERATOR;
3568 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3569 bool islop = (PL_last_lop == PL_oldoldbufptr);
3570 if (!islop || PL_last_lop_op == OP_GREPSTART)
3571 PL_expect = XOPERATOR;
3572 else if (strchr("$@\"'`q", *s))
3573 PL_expect = XTERM; /* e.g. print $fh "foo" */
3574 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3575 PL_expect = XTERM; /* e.g. print $fh &sub */
3576 else if (isIDFIRST_lazy_if(s,UTF)) {
3577 char tmpbuf[sizeof PL_tokenbuf];
3578 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3579 if ((tmp = keyword(tmpbuf, len))) {
3580 /* binary operators exclude handle interpretations */
3592 PL_expect = XTERM; /* e.g. print $fh length() */
3597 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3598 if (gv && GvCVu(gv))
3599 PL_expect = XTERM; /* e.g. print $fh subr() */
3602 else if (isDIGIT(*s))
3603 PL_expect = XTERM; /* e.g. print $fh 3 */
3604 else if (*s == '.' && isDIGIT(s[1]))
3605 PL_expect = XTERM; /* e.g. print $fh .3 */
3606 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3607 PL_expect = XTERM; /* e.g. print $fh -1 */
3608 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3609 PL_expect = XTERM; /* print $fh <<"EOF" */
3611 PL_pending_ident = '$';
3615 if (PL_expect == XOPERATOR)
3617 PL_tokenbuf[0] = '@';
3618 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3619 if (!PL_tokenbuf[1]) {
3621 yyerror("Final @ should be \\@ or @name");
3624 if (PL_lex_state == LEX_NORMAL)
3626 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3628 PL_tokenbuf[0] = '%';
3630 /* Warn about @ where they meant $. */
3631 if (ckWARN(WARN_SYNTAX)) {
3632 if (*s == '[' || *s == '{') {
3634 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3636 if (*t == '}' || *t == ']') {
3638 PL_bufptr = skipspace(PL_bufptr);
3639 Perl_warner(aTHX_ WARN_SYNTAX,
3640 "Scalar value %.*s better written as $%.*s",
3641 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3646 PL_pending_ident = '@';
3649 case '/': /* may either be division or pattern */
3650 case '?': /* may either be conditional or pattern */
3651 if (PL_expect != XOPERATOR) {
3652 /* Disable warning on "study /blah/" */
3653 if (PL_oldoldbufptr == PL_last_uni
3654 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3655 || memNE(PL_last_uni, "study", 5)
3656 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3658 s = scan_pat(s,OP_MATCH);
3659 TERM(sublex_start());
3667 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3668 #ifdef PERL_STRICT_CR
3671 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3673 && (s == PL_linestart || s[-1] == '\n') )
3675 PL_lex_formbrack = 0;
3679 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3685 yylval.ival = OPf_SPECIAL;
3691 if (PL_expect != XOPERATOR)
3696 case '0': case '1': case '2': case '3': case '4':
3697 case '5': case '6': case '7': case '8': case '9':
3698 s = scan_num(s, &yylval);
3699 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3700 "### Saw number in '%s'\n", s);
3702 if (PL_expect == XOPERATOR)
3707 s = scan_str(s,FALSE,FALSE);
3708 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3709 "### Saw string before '%s'\n", s);
3711 if (PL_expect == XOPERATOR) {
3712 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3715 return ','; /* grandfather non-comma-format format */
3721 missingterm((char*)0);
3722 yylval.ival = OP_CONST;
3723 TERM(sublex_start());
3726 s = scan_str(s,FALSE,FALSE);
3727 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3728 "### Saw string before '%s'\n", s);
3730 if (PL_expect == XOPERATOR) {
3731 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3734 return ','; /* grandfather non-comma-format format */
3740 missingterm((char*)0);
3741 yylval.ival = OP_CONST;
3742 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3743 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3744 yylval.ival = OP_STRINGIFY;
3748 TERM(sublex_start());
3751 s = scan_str(s,FALSE,FALSE);
3752 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3753 "### Saw backtick string before '%s'\n", s);
3755 if (PL_expect == XOPERATOR)
3756 no_op("Backticks",s);
3758 missingterm((char*)0);
3759 yylval.ival = OP_BACKTICK;
3761 TERM(sublex_start());
3765 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3766 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3768 if (PL_expect == XOPERATOR)
3769 no_op("Backslash",s);
3773 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3777 while (isDIGIT(*start) || *start == '_')
3779 if (*start == '.' && isDIGIT(start[1])) {
3780 s = scan_num(s, &yylval);
3783 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3784 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3788 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3791 s = scan_num(s, &yylval);
3798 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3837 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3839 /* Some keywords can be followed by any delimiter, including ':' */
3840 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3841 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3842 (PL_tokenbuf[0] == 'q' &&
3843 strchr("qwxr", PL_tokenbuf[1])))));
3845 /* x::* is just a word, unless x is "CORE" */
3846 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3850 while (d < PL_bufend && isSPACE(*d))
3851 d++; /* no comments skipped here, or s### is misparsed */
3853 /* Is this a label? */
3854 if (!tmp && PL_expect == XSTATE
3855 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3857 yylval.pval = savepv(PL_tokenbuf);
3862 /* Check for keywords */
3863 tmp = keyword(PL_tokenbuf, len);
3865 /* Is this a word before a => operator? */
3866 if (*d == '=' && d[1] == '>') {
3868 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3869 yylval.opval->op_private = OPpCONST_BARE;
3870 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3871 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3875 if (tmp < 0) { /* second-class keyword? */
3876 GV *ogv = Nullgv; /* override (winner) */
3877 GV *hgv = Nullgv; /* hidden (loser) */
3878 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3880 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3883 if (GvIMPORTED_CV(gv))
3885 else if (! CvMETHOD(cv))
3889 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3890 (gv = *gvp) != (GV*)&PL_sv_undef &&
3891 GvCVu(gv) && GvIMPORTED_CV(gv))
3897 tmp = 0; /* overridden by import or by GLOBAL */
3900 && -tmp==KEY_lock /* XXX generalizable kludge */
3902 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3904 tmp = 0; /* any sub overrides "weak" keyword */
3906 else { /* no override */
3910 if (ckWARN(WARN_AMBIGUOUS) && hgv
3911 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3912 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3913 "Ambiguous call resolved as CORE::%s(), %s",
3914 GvENAME(hgv), "qualify as such or use &");
3921 default: /* not a keyword */
3924 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3926 /* Get the rest if it looks like a package qualifier */
3928 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3930 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3933 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3934 *s == '\'' ? "'" : "::");
3938 if (PL_expect == XOPERATOR) {
3939 if (PL_bufptr == PL_linestart) {
3940 CopLINE_dec(PL_curcop);
3941 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3942 CopLINE_inc(PL_curcop);
3945 no_op("Bareword",s);
3948 /* Look for a subroutine with this name in current package,
3949 unless name is "Foo::", in which case Foo is a bearword
3950 (and a package name). */
3953 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3955 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3956 Perl_warner(aTHX_ WARN_BAREWORD,
3957 "Bareword \"%s\" refers to nonexistent package",
3960 PL_tokenbuf[len] = '\0';
3967 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3970 /* if we saw a global override before, get the right name */
3973 sv = newSVpvn("CORE::GLOBAL::",14);
3974 sv_catpv(sv,PL_tokenbuf);
3977 sv = newSVpv(PL_tokenbuf,0);
3979 /* Presume this is going to be a bareword of some sort. */
3982 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3983 yylval.opval->op_private = OPpCONST_BARE;
3985 /* And if "Foo::", then that's what it certainly is. */
3990 /* See if it's the indirect object for a list operator. */
3992 if (PL_oldoldbufptr &&
3993 PL_oldoldbufptr < PL_bufptr &&
3994 (PL_oldoldbufptr == PL_last_lop
3995 || PL_oldoldbufptr == PL_last_uni) &&
3996 /* NO SKIPSPACE BEFORE HERE! */
3997 (PL_expect == XREF ||
3998 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4000 bool immediate_paren = *s == '(';
4002 /* (Now we can afford to cross potential line boundary.) */
4005 /* Two barewords in a row may indicate method call. */
4007 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4010 /* If not a declared subroutine, it's an indirect object. */
4011 /* (But it's an indir obj regardless for sort.) */
4013 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4014 ((!gv || !GvCVu(gv)) &&
4015 (PL_last_lop_op != OP_MAPSTART &&
4016 PL_last_lop_op != OP_GREPSTART))))
4018 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4024 PL_expect = XOPERATOR;
4027 /* Is this a word before a => operator? */
4028 if (*s == '=' && s[1] == '>') {
4030 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4031 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4032 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4036 /* If followed by a paren, it's certainly a subroutine. */
4039 if (gv && GvCVu(gv)) {
4040 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4041 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4046 PL_nextval[PL_nexttoke].opval = yylval.opval;
4047 PL_expect = XOPERATOR;
4053 /* If followed by var or block, call it a method (unless sub) */
4055 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4056 PL_last_lop = PL_oldbufptr;
4057 PL_last_lop_op = OP_METHOD;
4061 /* If followed by a bareword, see if it looks like indir obj. */
4063 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4066 /* Not a method, so call it a subroutine (if defined) */
4068 if (gv && GvCVu(gv)) {
4070 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4071 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4072 "Ambiguous use of -%s resolved as -&%s()",
4073 PL_tokenbuf, PL_tokenbuf);
4074 /* Check for a constant sub */
4076 if ((sv = cv_const_sv(cv))) {
4078 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4079 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4080 yylval.opval->op_private = 0;
4084 /* Resolve to GV now. */
4085 op_free(yylval.opval);
4086 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4087 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4088 PL_last_lop = PL_oldbufptr;
4089 PL_last_lop_op = OP_ENTERSUB;
4090 /* Is there a prototype? */
4093 char *proto = SvPV((SV*)cv, len);
4096 if (strEQ(proto, "$"))
4098 if (*proto == '&' && *s == '{') {
4099 sv_setpv(PL_subname,"__ANON__");
4103 PL_nextval[PL_nexttoke].opval = yylval.opval;
4109 /* Call it a bare word */
4111 if (PL_hints & HINT_STRICT_SUBS)
4112 yylval.opval->op_private |= OPpCONST_STRICT;
4115 if (ckWARN(WARN_RESERVED)) {
4116 if (lastchar != '-') {
4117 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4119 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
4126 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4127 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4128 "Operator or semicolon missing before %c%s",
4129 lastchar, PL_tokenbuf);
4130 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4131 "Ambiguous use of %c resolved as operator %c",
4132 lastchar, lastchar);
4138 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4139 newSVpv(CopFILE(PL_curcop),0));
4143 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4144 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4147 case KEY___PACKAGE__:
4148 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4150 ? newSVsv(PL_curstname)
4159 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4160 char *pname = "main";
4161 if (PL_tokenbuf[2] == 'D')
4162 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4163 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4166 GvIOp(gv) = newIO();
4167 IoIFP(GvIOp(gv)) = PL_rsfp;
4168 #if defined(HAS_FCNTL) && defined(F_SETFD)
4170 int fd = PerlIO_fileno(PL_rsfp);
4171 fcntl(fd,F_SETFD,fd >= 3);
4174 /* Mark this internal pseudo-handle as clean */
4175 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4177 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4178 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4179 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4181 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4182 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4183 /* if the script was opened in binmode, we need to revert
4184 * it to text mode for compatibility; but only iff it has CRs
4185 * XXX this is a questionable hack at best. */
4186 if (PL_bufend-PL_bufptr > 2
4187 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4190 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4191 loc = PerlIO_tell(PL_rsfp);
4192 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4194 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4195 #ifdef PERLIO_IS_STDIO /* really? */
4196 # if defined(__BORLANDC__)
4197 /* XXX see note in do_binmode() */
4198 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4202 PerlIO_seek(PL_rsfp, loc, 0);
4206 #ifdef PERLIO_LAYERS
4207 if (UTF && !IN_BYTES)
4208 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4221 if (PL_expect == XSTATE) {
4228 if (*s == ':' && s[1] == ':') {
4231 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4232 if (!(tmp = keyword(PL_tokenbuf, len)))
4233 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4247 LOP(OP_ACCEPT,XTERM);
4253 LOP(OP_ATAN2,XTERM);
4259 LOP(OP_BINMODE,XTERM);
4262 LOP(OP_BLESS,XTERM);
4271 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4288 if (!PL_cryptseen) {
4289 PL_cryptseen = TRUE;
4293 LOP(OP_CRYPT,XTERM);
4296 if (ckWARN(WARN_CHMOD)) {
4297 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4298 if (*d != '0' && isDIGIT(*d))
4299 Perl_warner(aTHX_ WARN_CHMOD,
4300 "chmod() mode argument is missing initial 0");
4302 LOP(OP_CHMOD,XTERM);
4305 LOP(OP_CHOWN,XTERM);
4308 LOP(OP_CONNECT,XTERM);
4324 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4328 PL_hints |= HINT_BLOCK_SCOPE;
4338 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4339 LOP(OP_DBMOPEN,XTERM);
4345 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4352 yylval.ival = CopLINE(PL_curcop);
4366 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4367 UNIBRACK(OP_ENTEREVAL);
4382 case KEY_endhostent:
4388 case KEY_endservent:
4391 case KEY_endprotoent:
4402 yylval.ival = CopLINE(PL_curcop);
4404 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4406 if ((PL_bufend - p) >= 3 &&
4407 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4409 else if ((PL_bufend - p) >= 4 &&
4410 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4413 if (isIDFIRST_lazy_if(p,UTF)) {
4414 p = scan_ident(p, PL_bufend,
4415 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4419 Perl_croak(aTHX_ "Missing $ on loop variable");
4424 LOP(OP_FORMLINE,XTERM);
4430 LOP(OP_FCNTL,XTERM);
4436 LOP(OP_FLOCK,XTERM);
4445 LOP(OP_GREPSTART, XREF);
4448 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4463 case KEY_getpriority:
4464 LOP(OP_GETPRIORITY,XTERM);
4466 case KEY_getprotobyname:
4469 case KEY_getprotobynumber:
4470 LOP(OP_GPBYNUMBER,XTERM);
4472 case KEY_getprotoent:
4484 case KEY_getpeername:
4485 UNI(OP_GETPEERNAME);
4487 case KEY_gethostbyname:
4490 case KEY_gethostbyaddr:
4491 LOP(OP_GHBYADDR,XTERM);
4493 case KEY_gethostent:
4496 case KEY_getnetbyname:
4499 case KEY_getnetbyaddr:
4500 LOP(OP_GNBYADDR,XTERM);
4505 case KEY_getservbyname:
4506 LOP(OP_GSBYNAME,XTERM);
4508 case KEY_getservbyport:
4509 LOP(OP_GSBYPORT,XTERM);
4511 case KEY_getservent:
4514 case KEY_getsockname:
4515 UNI(OP_GETSOCKNAME);
4517 case KEY_getsockopt:
4518 LOP(OP_GSOCKOPT,XTERM);
4540 yylval.ival = CopLINE(PL_curcop);
4544 LOP(OP_INDEX,XTERM);
4550 LOP(OP_IOCTL,XTERM);
4562 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4594 LOP(OP_LISTEN,XTERM);
4603 s = scan_pat(s,OP_MATCH);
4604 TERM(sublex_start());
4607 LOP(OP_MAPSTART, XREF);
4610 LOP(OP_MKDIR,XTERM);
4613 LOP(OP_MSGCTL,XTERM);
4616 LOP(OP_MSGGET,XTERM);
4619 LOP(OP_MSGRCV,XTERM);
4622 LOP(OP_MSGSND,XTERM);
4628 if (isIDFIRST_lazy_if(s,UTF)) {
4629 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4630 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4632 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4633 if (!PL_in_my_stash) {
4636 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4644 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4651 if (PL_expect != XSTATE)
4652 yyerror("\"no\" not allowed in expression");
4653 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4654 s = force_version(s);
4659 if (*s == '(' || (s = skipspace(s), *s == '('))
4666 if (isIDFIRST_lazy_if(s,UTF)) {
4668 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4670 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4671 Perl_warner(aTHX_ WARN_PRECEDENCE,
4672 "Precedence problem: open %.*s should be open(%.*s)",
4678 yylval.ival = OP_OR;
4688 LOP(OP_OPEN_DIR,XTERM);
4691 checkcomma(s,PL_tokenbuf,"filehandle");
4695 checkcomma(s,PL_tokenbuf,"filehandle");
4714 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4718 LOP(OP_PIPE_OP,XTERM);
4721 s = scan_str(s,FALSE,FALSE);
4723 missingterm((char*)0);
4724 yylval.ival = OP_CONST;
4725 TERM(sublex_start());
4731 s = scan_str(s,FALSE,FALSE);
4733 missingterm((char*)0);
4735 if (SvCUR(PL_lex_stuff)) {
4738 d = SvPV_force(PL_lex_stuff, len);
4741 for (; isSPACE(*d) && len; --len, ++d) ;
4744 if (!warned && ckWARN(WARN_QW)) {
4745 for (; !isSPACE(*d) && len; --len, ++d) {
4747 Perl_warner(aTHX_ WARN_QW,
4748 "Possible attempt to separate words with commas");
4751 else if (*d == '#') {
4752 Perl_warner(aTHX_ WARN_QW,
4753 "Possible attempt to put comments in qw() list");
4759 for (; !isSPACE(*d) && len; --len, ++d) ;
4761 sv = newSVpvn(b, d-b);
4762 if (DO_UTF8(PL_lex_stuff))
4764 words = append_elem(OP_LIST, words,
4765 newSVOP(OP_CONST, 0, tokeq(sv)));
4769 PL_nextval[PL_nexttoke].opval = words;
4774 SvREFCNT_dec(PL_lex_stuff);
4775 PL_lex_stuff = Nullsv;
4781 s = scan_str(s,FALSE,FALSE);
4783 missingterm((char*)0);
4784 yylval.ival = OP_STRINGIFY;
4785 if (SvIVX(PL_lex_stuff) == '\'')
4786 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4787 TERM(sublex_start());
4790 s = scan_pat(s,OP_QR);
4791 TERM(sublex_start());
4794 s = scan_str(s,FALSE,FALSE);
4796 missingterm((char*)0);
4797 yylval.ival = OP_BACKTICK;
4799 TERM(sublex_start());
4806 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4807 s = force_version(s);
4810 *PL_tokenbuf = '\0';
4811 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4812 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4813 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4815 yyerror("<> should be quotes");
4823 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4827 LOP(OP_RENAME,XTERM);
4836 LOP(OP_RINDEX,XTERM);
4859 LOP(OP_REVERSE,XTERM);
4870 TERM(sublex_start());
4872 TOKEN(1); /* force error */
4881 LOP(OP_SELECT,XTERM);
4887 LOP(OP_SEMCTL,XTERM);
4890 LOP(OP_SEMGET,XTERM);
4893 LOP(OP_SEMOP,XTERM);
4899 LOP(OP_SETPGRP,XTERM);
4901 case KEY_setpriority:
4902 LOP(OP_SETPRIORITY,XTERM);
4904 case KEY_sethostent:
4910 case KEY_setservent:
4913 case KEY_setprotoent:
4923 LOP(OP_SEEKDIR,XTERM);
4925 case KEY_setsockopt:
4926 LOP(OP_SSOCKOPT,XTERM);
4932 LOP(OP_SHMCTL,XTERM);
4935 LOP(OP_SHMGET,XTERM);
4938 LOP(OP_SHMREAD,XTERM);
4941 LOP(OP_SHMWRITE,XTERM);
4944 LOP(OP_SHUTDOWN,XTERM);
4953 LOP(OP_SOCKET,XTERM);
4955 case KEY_socketpair:
4956 LOP(OP_SOCKPAIR,XTERM);
4959 checkcomma(s,PL_tokenbuf,"subroutine name");
4961 if (*s == ';' || *s == ')') /* probably a close */
4962 Perl_croak(aTHX_ "sort is now a reserved word");
4964 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4968 LOP(OP_SPLIT,XTERM);
4971 LOP(OP_SPRINTF,XTERM);
4974 LOP(OP_SPLICE,XTERM);
4989 LOP(OP_SUBSTR,XTERM);
4995 char tmpbuf[sizeof PL_tokenbuf];
4996 SSize_t tboffset = 0;
4997 expectation attrful;
4998 bool have_name, have_proto;
5003 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5004 (*s == ':' && s[1] == ':'))
5007 attrful = XATTRBLOCK;
5008 /* remember buffer pos'n for later force_word */
5009 tboffset = s - PL_oldbufptr;
5010 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5011 if (strchr(tmpbuf, ':'))
5012 sv_setpv(PL_subname, tmpbuf);
5014 sv_setsv(PL_subname,PL_curstname);
5015 sv_catpvn(PL_subname,"::",2);
5016 sv_catpvn(PL_subname,tmpbuf,len);
5023 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5024 PL_expect = XTERMBLOCK;
5025 attrful = XATTRTERM;
5026 sv_setpv(PL_subname,"?");
5030 if (key == KEY_format) {
5032 PL_lex_formbrack = PL_lex_brackets + 1;
5034 (void) force_word(PL_oldbufptr + tboffset, WORD,
5039 /* Look for a prototype */
5043 s = scan_str(s,FALSE,FALSE);
5045 Perl_croak(aTHX_ "Prototype not terminated");
5047 d = SvPVX(PL_lex_stuff);
5049 for (p = d; *p; ++p) {
5054 SvCUR(PL_lex_stuff) = tmp;
5062 if (*s == ':' && s[1] != ':')
5063 PL_expect = attrful;
5066 PL_nextval[PL_nexttoke].opval =
5067 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5068 PL_lex_stuff = Nullsv;
5072 sv_setpv(PL_subname,"__ANON__");
5075 (void) force_word(PL_oldbufptr + tboffset, WORD,
5084 LOP(OP_SYSTEM,XREF);
5087 LOP(OP_SYMLINK,XTERM);
5090 LOP(OP_SYSCALL,XTERM);
5093 LOP(OP_SYSOPEN,XTERM);
5096 LOP(OP_SYSSEEK,XTERM);
5099 LOP(OP_SYSREAD,XTERM);
5102 LOP(OP_SYSWRITE,XTERM);
5106 TERM(sublex_start());
5127 LOP(OP_TRUNCATE,XTERM);
5139 yylval.ival = CopLINE(PL_curcop);
5143 yylval.ival = CopLINE(PL_curcop);
5147 LOP(OP_UNLINK,XTERM);
5153 LOP(OP_UNPACK,XTERM);
5156 LOP(OP_UTIME,XTERM);
5159 if (ckWARN(WARN_UMASK)) {
5160 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5161 if (*d != '0' && isDIGIT(*d))
5162 Perl_warner(aTHX_ WARN_UMASK,
5163 "umask: argument is missing initial 0");
5168 LOP(OP_UNSHIFT,XTERM);
5171 if (PL_expect != XSTATE)
5172 yyerror("\"use\" not allowed in expression");
5174 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5175 s = force_version(s);
5176 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5177 PL_nextval[PL_nexttoke].opval = Nullop;
5182 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5183 s = force_version(s);
5195 yylval.ival = CopLINE(PL_curcop);
5199 PL_hints |= HINT_BLOCK_SCOPE;
5206 LOP(OP_WAITPID,XTERM);
5214 static char ctl_l[2];
5216 if (ctl_l[0] == '\0')
5217 ctl_l[0] = toCTRL('L');
5218 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5221 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5226 if (PL_expect == XOPERATOR)
5232 yylval.ival = OP_XOR;
5237 TERM(sublex_start());
5242 #pragma segment Main
5246 Perl_keyword(pTHX_ register char *d, I32 len)
5251 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5252 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5253 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5254 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5255 if (strEQ(d,"__END__")) return KEY___END__;
5259 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5264 if (strEQ(d,"and")) return -KEY_and;
5265 if (strEQ(d,"abs")) return -KEY_abs;
5268 if (strEQ(d,"alarm")) return -KEY_alarm;
5269 if (strEQ(d,"atan2")) return -KEY_atan2;
5272 if (strEQ(d,"accept")) return -KEY_accept;
5277 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5280 if (strEQ(d,"bless")) return -KEY_bless;
5281 if (strEQ(d,"bind")) return -KEY_bind;
5282 if (strEQ(d,"binmode")) return -KEY_binmode;
5285 if (strEQ(d,"CORE")) return -KEY_CORE;
5286 if (strEQ(d,"CHECK")) return KEY_CHECK;
5291 if (strEQ(d,"cmp")) return -KEY_cmp;
5292 if (strEQ(d,"chr")) return -KEY_chr;
5293 if (strEQ(d,"cos")) return -KEY_cos;
5296 if (strEQ(d,"chop")) return -KEY_chop;
5299 if (strEQ(d,"close")) return -KEY_close;
5300 if (strEQ(d,"chdir")) return -KEY_chdir;
5301 if (strEQ(d,"chomp")) return -KEY_chomp;
5302 if (strEQ(d,"chmod")) return -KEY_chmod;
5303 if (strEQ(d,"chown")) return -KEY_chown;
5304 if (strEQ(d,"crypt")) return -KEY_crypt;
5307 if (strEQ(d,"chroot")) return -KEY_chroot;
5308 if (strEQ(d,"caller")) return -KEY_caller;
5311 if (strEQ(d,"connect")) return -KEY_connect;
5314 if (strEQ(d,"closedir")) return -KEY_closedir;
5315 if (strEQ(d,"continue")) return -KEY_continue;
5320 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5325 if (strEQ(d,"do")) return KEY_do;
5328 if (strEQ(d,"die")) return -KEY_die;
5331 if (strEQ(d,"dump")) return -KEY_dump;
5334 if (strEQ(d,"delete")) return KEY_delete;
5337 if (strEQ(d,"defined")) return KEY_defined;
5338 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5341 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5346 if (strEQ(d,"END")) return KEY_END;
5351 if (strEQ(d,"eq")) return -KEY_eq;
5354 if (strEQ(d,"eof")) return -KEY_eof;
5355 if (strEQ(d,"exp")) return -KEY_exp;
5358 if (strEQ(d,"else")) return KEY_else;
5359 if (strEQ(d,"exit")) return -KEY_exit;
5360 if (strEQ(d,"eval")) return KEY_eval;
5361 if (strEQ(d,"exec")) return -KEY_exec;
5362 if (strEQ(d,"each")) return -KEY_each;
5365 if (strEQ(d,"elsif")) return KEY_elsif;
5368 if (strEQ(d,"exists")) return KEY_exists;
5369 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5372 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5373 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5376 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5379 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5380 if (strEQ(d,"endservent")) return -KEY_endservent;
5383 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5390 if (strEQ(d,"for")) return KEY_for;
5393 if (strEQ(d,"fork")) return -KEY_fork;
5396 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5397 if (strEQ(d,"flock")) return -KEY_flock;
5400 if (strEQ(d,"format")) return KEY_format;
5401 if (strEQ(d,"fileno")) return -KEY_fileno;
5404 if (strEQ(d,"foreach")) return KEY_foreach;
5407 if (strEQ(d,"formline")) return -KEY_formline;
5412 if (strnEQ(d,"get",3)) {
5417 if (strEQ(d,"ppid")) return -KEY_getppid;
5418 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5421 if (strEQ(d,"pwent")) return -KEY_getpwent;
5422 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5423 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5426 if (strEQ(d,"peername")) return -KEY_getpeername;
5427 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5428 if (strEQ(d,"priority")) return -KEY_getpriority;
5431 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5434 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5438 else if (*d == 'h') {
5439 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5440 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5441 if (strEQ(d,"hostent")) return -KEY_gethostent;
5443 else if (*d == 'n') {
5444 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5445 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5446 if (strEQ(d,"netent")) return -KEY_getnetent;
5448 else if (*d == 's') {
5449 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5450 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5451 if (strEQ(d,"servent")) return -KEY_getservent;
5452 if (strEQ(d,"sockname")) return -KEY_getsockname;
5453 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5455 else if (*d == 'g') {
5456 if (strEQ(d,"grent")) return -KEY_getgrent;
5457 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5458 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5460 else if (*d == 'l') {
5461 if (strEQ(d,"login")) return -KEY_getlogin;
5463 else if (strEQ(d,"c")) return -KEY_getc;
5468 if (strEQ(d,"gt")) return -KEY_gt;
5469 if (strEQ(d,"ge")) return -KEY_ge;
5472 if (strEQ(d,"grep")) return KEY_grep;
5473 if (strEQ(d,"goto")) return KEY_goto;
5474 if (strEQ(d,"glob")) return KEY_glob;
5477 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5482 if (strEQ(d,"hex")) return -KEY_hex;
5485 if (strEQ(d,"INIT")) return KEY_INIT;
5490 if (strEQ(d,"if")) return KEY_if;
5493 if (strEQ(d,"int")) return -KEY_int;
5496 if (strEQ(d,"index")) return -KEY_index;
5497 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5502 if (strEQ(d,"join")) return -KEY_join;
5506 if (strEQ(d,"keys")) return -KEY_keys;
5507 if (strEQ(d,"kill")) return -KEY_kill;
5513 if (strEQ(d,"lt")) return -KEY_lt;
5514 if (strEQ(d,"le")) return -KEY_le;
5515 if (strEQ(d,"lc")) return -KEY_lc;
5518 if (strEQ(d,"log")) return -KEY_log;
5521 if (strEQ(d,"last")) return KEY_last;
5522 if (strEQ(d,"link")) return -KEY_link;
5523 if (strEQ(d,"lock")) return -KEY_lock;
5526 if (strEQ(d,"local")) return KEY_local;
5527 if (strEQ(d,"lstat")) return -KEY_lstat;
5530 if (strEQ(d,"length")) return -KEY_length;
5531 if (strEQ(d,"listen")) return -KEY_listen;
5534 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5537 if (strEQ(d,"localtime")) return -KEY_localtime;
5543 case 1: return KEY_m;
5545 if (strEQ(d,"my")) return KEY_my;
5548 if (strEQ(d,"map")) return KEY_map;
5551 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5554 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5555 if (strEQ(d,"msgget")) return -KEY_msgget;
5556 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5557 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5562 if (strEQ(d,"next")) return KEY_next;
5563 if (strEQ(d,"ne")) return -KEY_ne;
5564 if (strEQ(d,"not")) return -KEY_not;
5565 if (strEQ(d,"no")) return KEY_no;
5570 if (strEQ(d,"or")) return -KEY_or;
5573 if (strEQ(d,"ord")) return -KEY_ord;
5574 if (strEQ(d,"oct")) return -KEY_oct;
5575 if (strEQ(d,"our")) return KEY_our;
5578 if (strEQ(d,"open")) return -KEY_open;
5581 if (strEQ(d,"opendir")) return -KEY_opendir;
5588 if (strEQ(d,"pop")) return -KEY_pop;
5589 if (strEQ(d,"pos")) return KEY_pos;
5592 if (strEQ(d,"push")) return -KEY_push;
5593 if (strEQ(d,"pack")) return -KEY_pack;
5594 if (strEQ(d,"pipe")) return -KEY_pipe;
5597 if (strEQ(d,"print")) return KEY_print;
5600 if (strEQ(d,"printf")) return KEY_printf;
5603 if (strEQ(d,"package")) return KEY_package;
5606 if (strEQ(d,"prototype")) return KEY_prototype;
5611 if (strEQ(d,"q")) return KEY_q;
5612 if (strEQ(d,"qr")) return KEY_qr;
5613 if (strEQ(d,"qq")) return KEY_qq;
5614 if (strEQ(d,"qw")) return KEY_qw;
5615 if (strEQ(d,"qx")) return KEY_qx;
5617 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5622 if (strEQ(d,"ref")) return -KEY_ref;
5625 if (strEQ(d,"read")) return -KEY_read;
5626 if (strEQ(d,"rand")) return -KEY_rand;
5627 if (strEQ(d,"recv")) return -KEY_recv;
5628 if (strEQ(d,"redo")) return KEY_redo;
5631 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5632 if (strEQ(d,"reset")) return -KEY_reset;
5635 if (strEQ(d,"return")) return KEY_return;
5636 if (strEQ(d,"rename")) return -KEY_rename;
5637 if (strEQ(d,"rindex")) return -KEY_rindex;
5640 if (strEQ(d,"require")) return KEY_require;
5641 if (strEQ(d,"reverse")) return -KEY_reverse;
5642 if (strEQ(d,"readdir")) return -KEY_readdir;
5645 if (strEQ(d,"readlink")) return -KEY_readlink;
5646 if (strEQ(d,"readline")) return -KEY_readline;
5647 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5650 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5656 case 0: return KEY_s;
5658 if (strEQ(d,"scalar")) return KEY_scalar;
5663 if (strEQ(d,"seek")) return -KEY_seek;
5664 if (strEQ(d,"send")) return -KEY_send;
5667 if (strEQ(d,"semop")) return -KEY_semop;
5670 if (strEQ(d,"select")) return -KEY_select;
5671 if (strEQ(d,"semctl")) return -KEY_semctl;
5672 if (strEQ(d,"semget")) return -KEY_semget;
5675 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5676 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5679 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5680 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5683 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5686 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5687 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5688 if (strEQ(d,"setservent")) return -KEY_setservent;
5691 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5692 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5699 if (strEQ(d,"shift")) return -KEY_shift;
5702 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5703 if (strEQ(d,"shmget")) return -KEY_shmget;
5706 if (strEQ(d,"shmread")) return -KEY_shmread;
5709 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5710 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5715 if (strEQ(d,"sin")) return -KEY_sin;
5718 if (strEQ(d,"sleep")) return -KEY_sleep;
5721 if (strEQ(d,"sort")) return KEY_sort;
5722 if (strEQ(d,"socket")) return -KEY_socket;
5723 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5726 if (strEQ(d,"split")) return KEY_split;
5727 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5728 if (strEQ(d,"splice")) return -KEY_splice;
5731 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5734 if (strEQ(d,"srand")) return -KEY_srand;
5737 if (strEQ(d,"stat")) return -KEY_stat;
5738 if (strEQ(d,"study")) return KEY_study;
5741 if (strEQ(d,"substr")) return -KEY_substr;
5742 if (strEQ(d,"sub")) return KEY_sub;
5747 if (strEQ(d,"system")) return -KEY_system;
5750 if (strEQ(d,"symlink")) return -KEY_symlink;
5751 if (strEQ(d,"syscall")) return -KEY_syscall;
5752 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5753 if (strEQ(d,"sysread")) return -KEY_sysread;
5754 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5757 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5766 if (strEQ(d,"tr")) return KEY_tr;
5769 if (strEQ(d,"tie")) return KEY_tie;
5772 if (strEQ(d,"tell")) return -KEY_tell;
5773 if (strEQ(d,"tied")) return KEY_tied;
5774 if (strEQ(d,"time")) return -KEY_time;
5777 if (strEQ(d,"times")) return -KEY_times;
5780 if (strEQ(d,"telldir")) return -KEY_telldir;
5783 if (strEQ(d,"truncate")) return -KEY_truncate;
5790 if (strEQ(d,"uc")) return -KEY_uc;
5793 if (strEQ(d,"use")) return KEY_use;
5796 if (strEQ(d,"undef")) return KEY_undef;
5797 if (strEQ(d,"until")) return KEY_until;
5798 if (strEQ(d,"untie")) return KEY_untie;
5799 if (strEQ(d,"utime")) return -KEY_utime;
5800 if (strEQ(d,"umask")) return -KEY_umask;
5803 if (strEQ(d,"unless")) return KEY_unless;
5804 if (strEQ(d,"unpack")) return -KEY_unpack;
5805 if (strEQ(d,"unlink")) return -KEY_unlink;
5808 if (strEQ(d,"unshift")) return -KEY_unshift;
5809 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5814 if (strEQ(d,"values")) return -KEY_values;
5815 if (strEQ(d,"vec")) return -KEY_vec;
5820 if (strEQ(d,"warn")) return -KEY_warn;
5821 if (strEQ(d,"wait")) return -KEY_wait;
5824 if (strEQ(d,"while")) return KEY_while;
5825 if (strEQ(d,"write")) return -KEY_write;
5828 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5831 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5836 if (len == 1) return -KEY_x;
5837 if (strEQ(d,"xor")) return -KEY_xor;
5840 if (len == 1) return KEY_y;
5849 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5853 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5854 if (ckWARN(WARN_SYNTAX)) {
5856 for (w = s+2; *w && level; w++) {
5863 for (; *w && isSPACE(*w); w++) ;
5864 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5865 Perl_warner(aTHX_ WARN_SYNTAX,
5866 "%s (...) interpreted as function",name);
5869 while (s < PL_bufend && isSPACE(*s))
5873 while (s < PL_bufend && isSPACE(*s))
5875 if (isIDFIRST_lazy_if(s,UTF)) {
5877 while (isALNUM_lazy_if(s,UTF))
5879 while (s < PL_bufend && isSPACE(*s))
5884 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5888 Perl_croak(aTHX_ "No comma allowed after %s", what);
5893 /* Either returns sv, or mortalizes sv and returns a new SV*.
5894 Best used as sv=new_constant(..., sv, ...).
5895 If s, pv are NULL, calls subroutine with one argument,
5896 and type is used with error messages only. */
5899 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5903 HV *table = GvHV(PL_hintgv); /* ^H */
5907 const char *why1, *why2, *why3;
5909 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5912 why2 = strEQ(key,"charnames")
5913 ? "(possibly a missing \"use charnames ...\")"
5915 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5916 (type ? type: "undef"), why2);
5918 /* This is convoluted and evil ("goto considered harmful")
5919 * but I do not understand the intricacies of all the different
5920 * failure modes of %^H in here. The goal here is to make
5921 * the most probable error message user-friendly. --jhi */
5926 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5927 (type ? type: "undef"), why1, why2, why3);
5929 yyerror(SvPVX(msg));
5933 cvp = hv_fetch(table, key, strlen(key), FALSE);
5934 if (!cvp || !SvOK(*cvp)) {
5937 why3 = "} is not defined";
5940 sv_2mortal(sv); /* Parent created it permanently */
5943 pv = sv_2mortal(newSVpvn(s, len));
5945 typesv = sv_2mortal(newSVpv(type, 0));
5947 typesv = &PL_sv_undef;
5949 PUSHSTACKi(PERLSI_OVERLOAD);
5961 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5965 /* Check the eval first */
5966 if (!PL_in_eval && SvTRUE(ERRSV)) {
5968 sv_catpv(ERRSV, "Propagated");
5969 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5971 res = SvREFCNT_inc(sv);
5975 (void)SvREFCNT_inc(res);
5984 why1 = "Call to &{$^H{";
5986 why3 = "}} did not return a defined value";
5995 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5997 register char *d = dest;
5998 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6001 Perl_croak(aTHX_ ident_too_long);
6002 if (isALNUM(*s)) /* UTF handled below */
6004 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6009 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6013 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6014 char *t = s + UTF8SKIP(s);
6015 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6017 if (d + (t - s) > e)
6018 Perl_croak(aTHX_ ident_too_long);
6019 Copy(s, d, t - s, char);
6032 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6042 e = d + destlen - 3; /* two-character token, ending NUL */
6044 while (isDIGIT(*s)) {
6046 Perl_croak(aTHX_ ident_too_long);
6053 Perl_croak(aTHX_ ident_too_long);
6054 if (isALNUM(*s)) /* UTF handled below */
6056 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6061 else if (*s == ':' && s[1] == ':') {
6065 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6066 char *t = s + UTF8SKIP(s);
6067 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6069 if (d + (t - s) > e)
6070 Perl_croak(aTHX_ ident_too_long);
6071 Copy(s, d, t - s, char);
6082 if (PL_lex_state != LEX_NORMAL)
6083 PL_lex_state = LEX_INTERPENDMAYBE;
6086 if (*s == '$' && s[1] &&
6087 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6100 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6105 if (isSPACE(s[-1])) {
6108 if (!SPACE_OR_TAB(ch)) {
6114 if (isIDFIRST_lazy_if(d,UTF)) {
6118 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6120 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6123 Copy(s, d, e - s, char);
6128 while ((isALNUM(*s) || *s == ':') && d < e)
6131 Perl_croak(aTHX_ ident_too_long);
6134 while (s < send && SPACE_OR_TAB(*s)) s++;
6135 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6136 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6137 const char *brack = *s == '[' ? "[...]" : "{...}";
6138 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6139 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6140 funny, dest, brack, funny, dest, brack);
6143 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6147 /* Handle extended ${^Foo} variables
6148 * 1999-02-27 mjd-perl-patch@plover.com */
6149 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6153 while (isALNUM(*s) && d < e) {
6157 Perl_croak(aTHX_ ident_too_long);
6162 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6163 PL_lex_state = LEX_INTERPEND;
6166 if (PL_lex_state == LEX_NORMAL) {
6167 if (ckWARN(WARN_AMBIGUOUS) &&
6168 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6170 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6171 "Ambiguous use of %c{%s} resolved to %c%s",
6172 funny, dest, funny, dest);
6177 s = bracket; /* let the parser handle it */
6181 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6182 PL_lex_state = LEX_INTERPEND;
6187 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6192 *pmfl |= PMf_GLOBAL;
6194 *pmfl |= PMf_CONTINUE;
6198 *pmfl |= PMf_MULTILINE;
6200 *pmfl |= PMf_SINGLELINE;
6202 *pmfl |= PMf_EXTENDED;
6206 S_scan_pat(pTHX_ char *start, I32 type)
6211 s = scan_str(start,FALSE,FALSE);
6213 Perl_croak(aTHX_ "Search pattern not terminated");
6215 pm = (PMOP*)newPMOP(type, 0);
6216 if (PL_multi_open == '?')
6217 pm->op_pmflags |= PMf_ONCE;
6219 while (*s && strchr("iomsx", *s))
6220 pmflag(&pm->op_pmflags,*s++);
6223 while (*s && strchr("iogcmsx", *s))
6224 pmflag(&pm->op_pmflags,*s++);
6226 pm->op_pmpermflags = pm->op_pmflags;
6228 PL_lex_op = (OP*)pm;
6229 yylval.ival = OP_MATCH;
6234 S_scan_subst(pTHX_ char *start)
6241 yylval.ival = OP_NULL;
6243 s = scan_str(start,FALSE,FALSE);
6246 Perl_croak(aTHX_ "Substitution pattern not terminated");
6248 if (s[-1] == PL_multi_open)
6251 first_start = PL_multi_start;
6252 s = scan_str(s,FALSE,FALSE);
6255 SvREFCNT_dec(PL_lex_stuff);
6256 PL_lex_stuff = Nullsv;
6258 Perl_croak(aTHX_ "Substitution replacement not terminated");
6260 PL_multi_start = first_start; /* so whole substitution is taken together */
6262 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6268 else if (strchr("iogcmsx", *s))
6269 pmflag(&pm->op_pmflags,*s++);
6276 PL_sublex_info.super_bufptr = s;
6277 PL_sublex_info.super_bufend = PL_bufend;
6279 pm->op_pmflags |= PMf_EVAL;
6280 repl = newSVpvn("",0);
6282 sv_catpv(repl, es ? "eval " : "do ");
6283 sv_catpvn(repl, "{ ", 2);
6284 sv_catsv(repl, PL_lex_repl);
6285 sv_catpvn(repl, " };", 2);
6287 SvREFCNT_dec(PL_lex_repl);
6291 pm->op_pmpermflags = pm->op_pmflags;
6292 PL_lex_op = (OP*)pm;
6293 yylval.ival = OP_SUBST;
6298 S_scan_trans(pTHX_ char *start)
6307 yylval.ival = OP_NULL;
6309 s = scan_str(start,FALSE,FALSE);
6311 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6312 if (s[-1] == PL_multi_open)
6315 s = scan_str(s,FALSE,FALSE);
6318 SvREFCNT_dec(PL_lex_stuff);
6319 PL_lex_stuff = Nullsv;
6321 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6324 complement = del = squash = 0;
6325 while (strchr("cds", *s)) {
6327 complement = OPpTRANS_COMPLEMENT;
6329 del = OPpTRANS_DELETE;
6331 squash = OPpTRANS_SQUASH;
6335 New(803, tbl, complement&&!del?258:256, short);
6336 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6337 o->op_private = del|squash|complement|
6338 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6339 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6342 yylval.ival = OP_TRANS;
6347 S_scan_heredoc(pTHX_ register char *s)
6350 I32 op_type = OP_SCALAR;
6357 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6361 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6364 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6365 if (*peek && strchr("`'\"",*peek)) {
6368 s = delimcpy(d, e, s, PL_bufend, term, &len);
6378 if (!isALNUM_lazy_if(s,UTF))
6379 deprecate("bare << to mean <<\"\"");
6380 for (; isALNUM_lazy_if(s,UTF); s++) {
6385 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6386 Perl_croak(aTHX_ "Delimiter for here document is too long");
6389 len = d - PL_tokenbuf;
6390 #ifndef PERL_STRICT_CR
6391 d = strchr(s, '\r');
6395 while (s < PL_bufend) {
6401 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6410 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6415 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6416 herewas = newSVpvn(s,PL_bufend-s);
6418 s--, herewas = newSVpvn(s,d-s);
6419 s += SvCUR(herewas);
6421 tmpstr = NEWSV(87,79);
6422 sv_upgrade(tmpstr, SVt_PVIV);
6427 else if (term == '`') {
6428 op_type = OP_BACKTICK;
6429 SvIVX(tmpstr) = '\\';
6433 PL_multi_start = CopLINE(PL_curcop);
6434 PL_multi_open = PL_multi_close = '<';
6435 term = *PL_tokenbuf;
6436 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6437 char *bufptr = PL_sublex_info.super_bufptr;
6438 char *bufend = PL_sublex_info.super_bufend;
6439 char *olds = s - SvCUR(herewas);
6440 s = strchr(bufptr, '\n');
6444 while (s < bufend &&
6445 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6447 CopLINE_inc(PL_curcop);
6450 CopLINE_set(PL_curcop, PL_multi_start);
6451 missingterm(PL_tokenbuf);
6453 sv_setpvn(herewas,bufptr,d-bufptr+1);
6454 sv_setpvn(tmpstr,d+1,s-d);
6456 sv_catpvn(herewas,s,bufend-s);
6457 (void)strcpy(bufptr,SvPVX(herewas));
6464 while (s < PL_bufend &&
6465 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6467 CopLINE_inc(PL_curcop);
6469 if (s >= PL_bufend) {
6470 CopLINE_set(PL_curcop, PL_multi_start);
6471 missingterm(PL_tokenbuf);
6473 sv_setpvn(tmpstr,d+1,s-d);
6475 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6477 sv_catpvn(herewas,s,PL_bufend-s);
6478 sv_setsv(PL_linestr,herewas);
6479 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6480 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6481 PL_last_lop = PL_last_uni = Nullch;
6484 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6485 while (s >= PL_bufend) { /* multiple line string? */
6487 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6488 CopLINE_set(PL_curcop, PL_multi_start);
6489 missingterm(PL_tokenbuf);
6491 CopLINE_inc(PL_curcop);
6492 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6493 PL_last_lop = PL_last_uni = Nullch;
6494 #ifndef PERL_STRICT_CR
6495 if (PL_bufend - PL_linestart >= 2) {
6496 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6497 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6499 PL_bufend[-2] = '\n';
6501 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6503 else if (PL_bufend[-1] == '\r')
6504 PL_bufend[-1] = '\n';
6506 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6507 PL_bufend[-1] = '\n';
6509 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6510 SV *sv = NEWSV(88,0);
6512 sv_upgrade(sv, SVt_PVMG);
6513 sv_setsv(sv,PL_linestr);
6514 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6516 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6519 sv_catsv(PL_linestr,herewas);
6520 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6524 sv_catsv(tmpstr,PL_linestr);
6529 PL_multi_end = CopLINE(PL_curcop);
6530 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6531 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6532 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6534 SvREFCNT_dec(herewas);
6535 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6537 PL_lex_stuff = tmpstr;
6538 yylval.ival = op_type;
6543 takes: current position in input buffer
6544 returns: new position in input buffer
6545 side-effects: yylval and lex_op are set.
6550 <FH> read from filehandle
6551 <pkg::FH> read from package qualified filehandle
6552 <pkg'FH> read from package qualified filehandle
6553 <$fh> read from filehandle in $fh
6559 S_scan_inputsymbol(pTHX_ char *start)
6561 register char *s = start; /* current position in buffer */
6567 d = PL_tokenbuf; /* start of temp holding space */
6568 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6569 end = strchr(s, '\n');
6572 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6574 /* die if we didn't have space for the contents of the <>,
6575 or if it didn't end, or if we see a newline
6578 if (len >= sizeof PL_tokenbuf)
6579 Perl_croak(aTHX_ "Excessively long <> operator");
6581 Perl_croak(aTHX_ "Unterminated <> operator");
6586 Remember, only scalar variables are interpreted as filehandles by
6587 this code. Anything more complex (e.g., <$fh{$num}>) will be
6588 treated as a glob() call.
6589 This code makes use of the fact that except for the $ at the front,
6590 a scalar variable and a filehandle look the same.
6592 if (*d == '$' && d[1]) d++;
6594 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6595 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6598 /* If we've tried to read what we allow filehandles to look like, and
6599 there's still text left, then it must be a glob() and not a getline.
6600 Use scan_str to pull out the stuff between the <> and treat it
6601 as nothing more than a string.
6604 if (d - PL_tokenbuf != len) {
6605 yylval.ival = OP_GLOB;
6607 s = scan_str(start,FALSE,FALSE);
6609 Perl_croak(aTHX_ "Glob not terminated");
6613 /* we're in a filehandle read situation */
6616 /* turn <> into <ARGV> */
6618 (void)strcpy(d,"ARGV");
6620 /* if <$fh>, create the ops to turn the variable into a
6626 /* try to find it in the pad for this block, otherwise find
6627 add symbol table ops
6629 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6630 OP *o = newOP(OP_PADSV, 0);
6632 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6635 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6636 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6637 newUNOP(OP_RV2SV, 0,
6638 newGVOP(OP_GV, 0, gv)));
6640 PL_lex_op->op_flags |= OPf_SPECIAL;
6641 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6642 yylval.ival = OP_NULL;
6645 /* If it's none of the above, it must be a literal filehandle
6646 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6648 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6649 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6650 yylval.ival = OP_NULL;
6659 takes: start position in buffer
6660 keep_quoted preserve \ on the embedded delimiter(s)
6661 keep_delims preserve the delimiters around the string
6662 returns: position to continue reading from buffer
6663 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6664 updates the read buffer.
6666 This subroutine pulls a string out of the input. It is called for:
6667 q single quotes q(literal text)
6668 ' single quotes 'literal text'
6669 qq double quotes qq(interpolate $here please)
6670 " double quotes "interpolate $here please"
6671 qx backticks qx(/bin/ls -l)
6672 ` backticks `/bin/ls -l`
6673 qw quote words @EXPORT_OK = qw( func() $spam )
6674 m// regexp match m/this/
6675 s/// regexp substitute s/this/that/
6676 tr/// string transliterate tr/this/that/
6677 y/// string transliterate y/this/that/
6678 ($*@) sub prototypes sub foo ($)
6679 (stuff) sub attr parameters sub foo : attr(stuff)
6680 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6682 In most of these cases (all but <>, patterns and transliterate)
6683 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6684 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6685 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6688 It skips whitespace before the string starts, and treats the first
6689 character as the delimiter. If the delimiter is one of ([{< then
6690 the corresponding "close" character )]}> is used as the closing
6691 delimiter. It allows quoting of delimiters, and if the string has
6692 balanced delimiters ([{<>}]) it allows nesting.
6694 On success, the SV with the resulting string is put into lex_stuff or,
6695 if that is already non-NULL, into lex_repl. The second case occurs only
6696 when parsing the RHS of the special constructs s/// and tr/// (y///).
6697 For convenience, the terminating delimiter character is stuffed into
6702 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6704 SV *sv; /* scalar value: string */
6705 char *tmps; /* temp string, used for delimiter matching */
6706 register char *s = start; /* current position in the buffer */
6707 register char term; /* terminating character */
6708 register char *to; /* current position in the sv's data */
6709 I32 brackets = 1; /* bracket nesting level */
6710 bool has_utf8 = FALSE; /* is there any utf8 content? */
6712 /* skip space before the delimiter */
6716 /* mark where we are, in case we need to report errors */
6719 /* after skipping whitespace, the next character is the terminator */
6721 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6724 /* mark where we are */
6725 PL_multi_start = CopLINE(PL_curcop);
6726 PL_multi_open = term;
6728 /* find corresponding closing delimiter */
6729 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6731 PL_multi_close = term;
6733 /* create a new SV to hold the contents. 87 is leak category, I'm
6734 assuming. 79 is the SV's initial length. What a random number. */
6736 sv_upgrade(sv, SVt_PVIV);
6738 (void)SvPOK_only(sv); /* validate pointer */
6740 /* move past delimiter and try to read a complete string */
6742 sv_catpvn(sv, s, 1);
6745 /* extend sv if need be */
6746 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6747 /* set 'to' to the next character in the sv's string */
6748 to = SvPVX(sv)+SvCUR(sv);
6750 /* if open delimiter is the close delimiter read unbridle */
6751 if (PL_multi_open == PL_multi_close) {
6752 for (; s < PL_bufend; s++,to++) {
6753 /* embedded newlines increment the current line number */
6754 if (*s == '\n' && !PL_rsfp)
6755 CopLINE_inc(PL_curcop);
6756 /* handle quoted delimiters */
6757 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6758 if (!keep_quoted && s[1] == term)
6760 /* any other quotes are simply copied straight through */
6764 /* terminate when run out of buffer (the for() condition), or
6765 have found the terminator */
6766 else if (*s == term)
6768 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6774 /* if the terminator isn't the same as the start character (e.g.,
6775 matched brackets), we have to allow more in the quoting, and
6776 be prepared for nested brackets.
6779 /* read until we run out of string, or we find the terminator */
6780 for (; s < PL_bufend; s++,to++) {
6781 /* embedded newlines increment the line count */
6782 if (*s == '\n' && !PL_rsfp)
6783 CopLINE_inc(PL_curcop);
6784 /* backslashes can escape the open or closing characters */
6785 if (*s == '\\' && s+1 < PL_bufend) {
6787 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6792 /* allow nested opens and closes */
6793 else if (*s == PL_multi_close && --brackets <= 0)
6795 else if (*s == PL_multi_open)
6797 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6802 /* terminate the copied string and update the sv's end-of-string */
6804 SvCUR_set(sv, to - SvPVX(sv));
6807 * this next chunk reads more into the buffer if we're not done yet
6811 break; /* handle case where we are done yet :-) */
6813 #ifndef PERL_STRICT_CR
6814 if (to - SvPVX(sv) >= 2) {
6815 if ((to[-2] == '\r' && to[-1] == '\n') ||
6816 (to[-2] == '\n' && to[-1] == '\r'))
6820 SvCUR_set(sv, to - SvPVX(sv));
6822 else if (to[-1] == '\r')
6825 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6829 /* if we're out of file, or a read fails, bail and reset the current
6830 line marker so we can report where the unterminated string began
6833 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6835 CopLINE_set(PL_curcop, PL_multi_start);
6838 /* we read a line, so increment our line counter */
6839 CopLINE_inc(PL_curcop);
6841 /* update debugger info */
6842 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6843 SV *sv = NEWSV(88,0);
6845 sv_upgrade(sv, SVt_PVMG);
6846 sv_setsv(sv,PL_linestr);
6847 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6850 /* having changed the buffer, we must update PL_bufend */
6851 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6852 PL_last_lop = PL_last_uni = Nullch;
6855 /* at this point, we have successfully read the delimited string */
6858 sv_catpvn(sv, s, 1);
6861 PL_multi_end = CopLINE(PL_curcop);
6864 /* if we allocated too much space, give some back */
6865 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6866 SvLEN_set(sv, SvCUR(sv) + 1);
6867 Renew(SvPVX(sv), SvLEN(sv), char);
6870 /* decide whether this is the first or second quoted string we've read
6883 takes: pointer to position in buffer
6884 returns: pointer to new position in buffer
6885 side-effects: builds ops for the constant in yylval.op
6887 Read a number in any of the formats that Perl accepts:
6889 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
6890 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
6893 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
6895 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6898 If it reads a number without a decimal point or an exponent, it will
6899 try converting the number to an integer and see if it can do so
6900 without loss of precision.
6904 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6906 register char *s = start; /* current position in buffer */
6907 register char *d; /* destination in temp buffer */
6908 register char *e; /* end of temp buffer */
6909 NV nv; /* number read, as a double */
6910 SV *sv = Nullsv; /* place to put the converted number */
6911 bool floatit; /* boolean: int or float? */
6912 char *lastub = 0; /* position of last underbar */
6913 static char number_too_long[] = "Number too long";
6915 /* We use the first character to decide what type of number this is */
6919 Perl_croak(aTHX_ "panic: scan_num");
6921 /* if it starts with a 0, it could be an octal number, a decimal in
6922 0.13 disguise, or a hexadecimal number, or a binary number. */
6926 u holds the "number so far"
6927 shift the power of 2 of the base
6928 (hex == 4, octal == 3, binary == 1)
6929 overflowed was the number more than we can hold?
6931 Shift is used when we add a digit. It also serves as an "are
6932 we in octal/hex/binary?" indicator to disallow hex characters
6938 bool overflowed = FALSE;
6939 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6940 static char* bases[5] = { "", "binary", "", "octal",
6942 static char* Bases[5] = { "", "Binary", "", "Octal",
6944 static char *maxima[5] = { "",
6945 "0b11111111111111111111111111111111",
6949 char *base, *Base, *max;
6955 } else if (s[1] == 'b') {
6959 /* check for a decimal in disguise */
6960 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6962 /* so it must be octal */
6969 if (ckWARN(WARN_SYNTAX))
6970 Perl_warner(aTHX_ WARN_SYNTAX,
6971 "Misplaced _ in number");
6975 base = bases[shift];
6976 Base = Bases[shift];
6977 max = maxima[shift];
6979 /* read the rest of the number */
6981 /* x is used in the overflow test,
6982 b is the digit we're adding on. */
6987 /* if we don't mention it, we're done */
6991 /* _ are ignored -- but warned about if consecutive */
6993 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
6994 Perl_warner(aTHX_ WARN_SYNTAX,
6995 "Misplaced _ in number");
6999 /* 8 and 9 are not octal */
7002 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7006 case '2': case '3': case '4':
7007 case '5': case '6': case '7':
7009 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7013 b = *s++ & 15; /* ASCII digit -> value of digit */
7017 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7018 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7019 /* make sure they said 0x */
7024 /* Prepare to put the digit we have onto the end
7025 of the number so far. We check for overflows.
7030 x = u << shift; /* make room for the digit */
7032 if ((x >> shift) != u
7033 && !(PL_hints & HINT_NEW_BINARY)) {
7036 if (ckWARN_d(WARN_OVERFLOW))
7037 Perl_warner(aTHX_ WARN_OVERFLOW,
7038 "Integer overflow in %s number",
7041 u = x | b; /* add the digit to the end */
7044 n *= nvshift[shift];
7045 /* If an NV has not enough bits in its
7046 * mantissa to represent an UV this summing of
7047 * small low-order numbers is a waste of time
7048 * (because the NV cannot preserve the
7049 * low-order bits anyway): we could just
7050 * remember when did we overflow and in the
7051 * end just multiply n by the right
7059 /* if we get here, we had success: make a scalar value from
7064 /* final misplaced underbar check */
7066 if (ckWARN(WARN_SYNTAX))
7067 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7072 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7073 Perl_warner(aTHX_ WARN_PORTABLE,
7074 "%s number > %s non-portable",
7080 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7081 Perl_warner(aTHX_ WARN_PORTABLE,
7082 "%s number > %s non-portable",
7087 if (PL_hints & HINT_NEW_BINARY)
7088 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7093 handle decimal numbers.
7094 we're also sent here when we read a 0 as the first digit
7096 case '1': case '2': case '3': case '4': case '5':
7097 case '6': case '7': case '8': case '9': case '.':
7100 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7103 /* read next group of digits and _ and copy into d */
7104 while (isDIGIT(*s) || *s == '_') {
7105 /* skip underscores, checking for misplaced ones
7109 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7110 Perl_warner(aTHX_ WARN_SYNTAX,
7111 "Misplaced _ in number");
7115 /* check for end of fixed-length buffer */
7117 Perl_croak(aTHX_ number_too_long);
7118 /* if we're ok, copy the character */
7123 /* final misplaced underbar check */
7124 if (lastub && s == lastub + 1) {
7125 if (ckWARN(WARN_SYNTAX))
7126 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7129 /* read a decimal portion if there is one. avoid
7130 3..5 being interpreted as the number 3. followed
7133 if (*s == '.' && s[1] != '.') {
7138 if (ckWARN(WARN_SYNTAX))
7139 Perl_warner(aTHX_ WARN_SYNTAX,
7140 "Misplaced _ in number");
7144 /* copy, ignoring underbars, until we run out of digits.
7146 for (; isDIGIT(*s) || *s == '_'; s++) {
7147 /* fixed length buffer check */
7149 Perl_croak(aTHX_ number_too_long);
7151 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7152 Perl_warner(aTHX_ WARN_SYNTAX,
7153 "Misplaced _ in number");
7159 /* fractional part ending in underbar? */
7161 if (ckWARN(WARN_SYNTAX))
7162 Perl_warner(aTHX_ WARN_SYNTAX,
7163 "Misplaced _ in number");
7165 if (*s == '.' && isDIGIT(s[1])) {
7166 /* oops, it's really a v-string, but without the "v" */
7172 /* read exponent part, if present */
7173 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7177 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7178 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7180 /* stray preinitial _ */
7182 if (ckWARN(WARN_SYNTAX))
7183 Perl_warner(aTHX_ WARN_SYNTAX,
7184 "Misplaced _ in number");
7188 /* allow positive or negative exponent */
7189 if (*s == '+' || *s == '-')
7192 /* stray initial _ */
7194 if (ckWARN(WARN_SYNTAX))
7195 Perl_warner(aTHX_ WARN_SYNTAX,
7196 "Misplaced _ in number");
7200 /* read digits of exponent */
7201 while (isDIGIT(*s) || *s == '_') {
7204 Perl_croak(aTHX_ number_too_long);
7208 if (ckWARN(WARN_SYNTAX) &&
7209 ((lastub && s == lastub + 1) ||
7210 (!isDIGIT(s[1]) && s[1] != '_')))
7211 Perl_warner(aTHX_ WARN_SYNTAX,
7212 "Misplaced _ in number");
7218 /* terminate the string */
7221 /* make an sv from the string */
7224 #if defined(Strtol) && defined(Strtoul)
7227 strtol/strtoll sets errno to ERANGE if the number is too big
7228 for an integer. We try to do an integer conversion first
7229 if no characters indicating "float" have been found.
7236 if (*PL_tokenbuf == '-')
7237 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7239 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7241 floatit = TRUE; /* Probably just too large. */
7242 else if (*PL_tokenbuf == '-')
7244 else if (uv <= IV_MAX)
7245 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7250 nv = Atof(PL_tokenbuf);
7255 No working strtou?ll?.
7257 Unfortunately atol() doesn't do range checks (returning
7258 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7259 everywhere [1], so we cannot use use atol() (or atoll()).
7260 If we could, they would be used, as Atol(), very much like
7261 Strtol() and Strtoul() are used above.
7263 [1] XXX Configure test needed to check for atol()
7264 (and atoll()) overflow behaviour XXX
7268 We need to do this the hard way. */
7270 nv = Atof(PL_tokenbuf);
7272 /* See if we can make do with an integer value without loss of
7273 precision. We use U_V to cast to a UV, because some
7274 compilers have issues. Then we try casting it back and see
7275 if it was the same [1]. We only do this if we know we
7276 specifically read an integer. If floatit is true, then we
7277 don't need to do the conversion at all.
7279 [1] Note that this is lossy if our NVs cannot preserve our
7280 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7281 and NV_PRESERVES_UV_BITS (a number), but in general we really
7282 do hope all such potentially lossy platforms have strtou?ll?
7283 to do a lossless IV/UV conversion.
7285 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7286 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7287 as NV_DIG and NV_MANT_DIG)?
7293 if (!floatit && (NV)uv == nv) {
7295 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7303 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7304 (PL_hints & HINT_NEW_INTEGER) )
7305 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7306 (floatit ? "float" : "integer"),
7310 /* if it starts with a v, it could be a v-string */
7316 while (isDIGIT(*pos) || *pos == '_')
7318 if (!isALPHA(*pos)) {
7320 U8 tmpbuf[UTF8_MAXLEN+1];
7322 s++; /* get past 'v' */
7325 sv_setpvn(sv, "", 0);
7328 if (*s == '0' && isDIGIT(s[1]))
7329 yyerror("Octal number in vector unsupported");
7332 /* this is atoi() that tolerates underscores */
7335 while (--end >= s) {
7340 rev += (*end - '0') * mult;
7342 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7343 Perl_warner(aTHX_ WARN_OVERFLOW,
7344 "Integer overflow in decimal number");
7347 /* Append native character for the rev point */
7348 tmpend = uvchr_to_utf8(tmpbuf, rev);
7349 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7350 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
7352 if (*pos == '.' && isDIGIT(pos[1]))
7358 while (isDIGIT(*pos) || *pos == '_')
7368 /* make the op for the constant and return */
7371 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7373 lvalp->opval = Nullop;
7379 S_scan_formline(pTHX_ register char *s)
7383 SV *stuff = newSVpvn("",0);
7384 bool needargs = FALSE;
7387 if (*s == '.' || *s == /*{*/'}') {
7389 #ifdef PERL_STRICT_CR
7390 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7392 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7394 if (*t == '\n' || t == PL_bufend)
7397 if (PL_in_eval && !PL_rsfp) {
7398 eol = strchr(s,'\n');
7403 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7405 for (t = s; t < eol; t++) {
7406 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7408 goto enough; /* ~~ must be first line in formline */
7410 if (*t == '@' || *t == '^')
7413 sv_catpvn(stuff, s, eol-s);
7414 #ifndef PERL_STRICT_CR
7415 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7416 char *end = SvPVX(stuff) + SvCUR(stuff);
7425 s = filter_gets(PL_linestr, PL_rsfp, 0);
7426 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7427 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7428 PL_last_lop = PL_last_uni = Nullch;
7431 yyerror("Format not terminated");
7441 PL_lex_state = LEX_NORMAL;
7442 PL_nextval[PL_nexttoke].ival = 0;
7446 PL_lex_state = LEX_FORMLINE;
7447 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7449 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7453 SvREFCNT_dec(stuff);
7454 PL_lex_formbrack = 0;
7465 PL_cshlen = strlen(PL_cshname);
7470 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7472 I32 oldsavestack_ix = PL_savestack_ix;
7473 CV* outsidecv = PL_compcv;
7477 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7479 SAVEI32(PL_subline);
7480 save_item(PL_subname);
7483 SAVESPTR(PL_comppad_name);
7484 SAVESPTR(PL_compcv);
7485 SAVEI32(PL_comppad_name_fill);
7486 SAVEI32(PL_min_intro_pending);
7487 SAVEI32(PL_max_intro_pending);
7488 SAVEI32(PL_pad_reset_pending);
7490 PL_compcv = (CV*)NEWSV(1104,0);
7491 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7492 CvFLAGS(PL_compcv) |= flags;
7494 PL_comppad = newAV();
7495 av_push(PL_comppad, Nullsv);
7496 PL_curpad = AvARRAY(PL_comppad);
7497 PL_comppad_name = newAV();
7498 PL_comppad_name_fill = 0;
7499 PL_min_intro_pending = 0;
7501 PL_subline = CopLINE(PL_curcop);
7503 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7504 PL_curpad[0] = (SV*)newAV();
7505 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7506 #endif /* USE_THREADS */
7508 comppadlist = newAV();
7509 AvREAL_off(comppadlist);
7510 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7511 av_store(comppadlist, 1, (SV*)PL_comppad);
7513 CvPADLIST(PL_compcv) = comppadlist;
7514 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7516 CvOWNER(PL_compcv) = 0;
7517 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7518 MUTEX_INIT(CvMUTEXP(PL_compcv));
7519 #endif /* USE_THREADS */
7521 return oldsavestack_ix;
7525 #pragma segment Perl_yylex
7528 Perl_yywarn(pTHX_ char *s)
7530 PL_in_eval |= EVAL_WARNONLY;
7532 PL_in_eval &= ~EVAL_WARNONLY;
7537 Perl_yyerror(pTHX_ char *s)
7540 char *context = NULL;
7544 if (!yychar || (yychar == ';' && !PL_rsfp))
7546 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7547 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7548 while (isSPACE(*PL_oldoldbufptr))
7550 context = PL_oldoldbufptr;
7551 contlen = PL_bufptr - PL_oldoldbufptr;
7553 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7554 PL_oldbufptr != PL_bufptr) {
7555 while (isSPACE(*PL_oldbufptr))
7557 context = PL_oldbufptr;
7558 contlen = PL_bufptr - PL_oldbufptr;
7560 else if (yychar > 255)
7561 where = "next token ???";
7562 #ifdef USE_PURE_BISON
7563 /* GNU Bison sets the value -2 */
7564 else if (yychar == -2) {
7566 else if ((yychar & 127) == 127) {
7568 if (PL_lex_state == LEX_NORMAL ||
7569 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7570 where = "at end of line";
7571 else if (PL_lex_inpat)
7572 where = "within pattern";
7574 where = "within string";
7577 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7579 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7580 else if (isPRINT_LC(yychar))
7581 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7583 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7584 where = SvPVX(where_sv);
7586 msg = sv_2mortal(newSVpv(s, 0));
7587 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7588 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7590 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7592 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7593 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7594 Perl_sv_catpvf(aTHX_ msg,
7595 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7596 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7599 if (PL_in_eval & EVAL_WARNONLY)
7600 Perl_warn(aTHX_ "%"SVf, msg);
7603 if (PL_error_count >= 10) {
7604 if (PL_in_eval && SvCUR(ERRSV))
7605 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7606 ERRSV, CopFILE(PL_curcop));
7608 Perl_croak(aTHX_ "%s has too many errors.\n",
7609 CopFILE(PL_curcop));
7612 PL_in_my_stash = Nullhv;
7616 #pragma segment Main
7620 S_swallow_bom(pTHX_ U8 *s)
7623 slen = SvCUR(PL_linestr);
7627 /* UTF-16 little-endian */
7628 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7629 Perl_croak(aTHX_ "Unsupported script encoding");
7630 #ifndef PERL_NO_UTF16_FILTER
7631 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7633 if (PL_bufend > (char*)s) {
7637 filter_add(utf16rev_textfilter, NULL);
7638 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7639 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7640 PL_bufend - (char*)s - 1,
7642 Copy(news, s, newlen, U8);
7643 SvCUR_set(PL_linestr, newlen);
7644 PL_bufend = SvPVX(PL_linestr) + newlen;
7645 news[newlen++] = '\0';
7649 Perl_croak(aTHX_ "Unsupported script encoding");
7654 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7655 #ifndef PERL_NO_UTF16_FILTER
7656 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7658 if (PL_bufend > (char *)s) {
7662 filter_add(utf16_textfilter, NULL);
7663 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7664 PL_bufend = (char*)utf16_to_utf8(s, news,
7665 PL_bufend - (char*)s,
7667 Copy(news, s, newlen, U8);
7668 SvCUR_set(PL_linestr, newlen);
7669 PL_bufend = SvPVX(PL_linestr) + newlen;
7670 news[newlen++] = '\0';
7674 Perl_croak(aTHX_ "Unsupported script encoding");
7679 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7680 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7685 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7686 s[2] == 0xFE && s[3] == 0xFF)
7688 Perl_croak(aTHX_ "Unsupported script encoding");
7700 * Restore a source filter.
7704 restore_rsfp(pTHXo_ void *f)
7706 PerlIO *fp = (PerlIO*)f;
7708 if (PL_rsfp == PerlIO_stdin())
7709 PerlIO_clearerr(PL_rsfp);
7710 else if (PL_rsfp && (PL_rsfp != fp))
7711 PerlIO_close(PL_rsfp);
7715 #ifndef PERL_NO_UTF16_FILTER
7717 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7719 I32 count = FILTER_READ(idx+1, sv, maxlen);
7724 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7725 if (!*SvPV_nolen(sv))
7726 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7729 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7730 sv_usepvn(sv, (char*)tmps, tend - tmps);
7736 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7738 I32 count = FILTER_READ(idx+1, sv, maxlen);
7743 if (!*SvPV_nolen(sv))
7744 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7747 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7748 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7749 sv_usepvn(sv, (char*)tmps, tend - tmps);