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(pTHX_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
39 #ifdef USE_UTF8_SCRIPTS
40 # define UTF (!IN_BYTES)
42 # ifdef EBCDIC /* For now 'use utf8' does not affect tokenizer on EBCDIC */
43 # define UTF (PL_linestr && DO_UTF8(PL_linestr))
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
49 /* In variables named $^X, these are the legal values for X.
50 * 1999-02-27 mjd-perl-patch@plover.com */
51 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
53 /* On MacOS, respect nonbreaking spaces */
54 #ifdef MACOS_TRADITIONAL
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
57 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
60 /* LEX_* are values for PL_lex_state, the state of the lexer.
61 * They are arranged oddly so that the guard on the switch statement
62 * can get by with a single comparison (if the compiler is smart enough).
65 /* #define LEX_NOTPARSING 11 is done in perl.h. */
68 #define LEX_INTERPNORMAL 9
69 #define LEX_INTERPCASEMOD 8
70 #define LEX_INTERPPUSH 7
71 #define LEX_INTERPSTART 6
72 #define LEX_INTERPEND 5
73 #define LEX_INTERPENDMAYBE 4
74 #define LEX_INTERPCONCAT 3
75 #define LEX_INTERPCONST 2
76 #define LEX_FORMLINE 1
77 #define LEX_KNOWNEXT 0
85 # define YYMAXLEVEL 100
87 YYSTYPE* yylval_pointer[YYMAXLEVEL];
88 int* yychar_pointer[YYMAXLEVEL];
92 # define yylval (*yylval_pointer[yyactlevel])
93 # define yychar (*yychar_pointer[yyactlevel])
94 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
96 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
101 /* CLINE is a macro that ensures PL_copline has a sane value */
106 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
109 * Convenience functions to return different tokens and prime the
110 * lexer for the next token. They all take an argument.
112 * TOKEN : generic token (used for '(', DOLSHARP, etc)
113 * OPERATOR : generic operator
114 * AOPERATOR : assignment operator
115 * PREBLOCK : beginning the block after an if, while, foreach, ...
116 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
117 * PREREF : *EXPR where EXPR is not a simple identifier
118 * TERM : expression term
119 * LOOPX : loop exiting command (goto, last, dump, etc)
120 * FTST : file test operator
121 * FUN0 : zero-argument function
122 * FUN1 : not used, except for not, which isn't a UNIOP
123 * BOop : bitwise or or xor
125 * SHop : shift operator
126 * PWop : power operator
127 * PMop : pattern-matching operator
128 * Aop : addition-level operator
129 * Mop : multiplication-level operator
130 * Eop : equality-testing operator
131 * Rop : relational operator <= != gt
133 * Also see LOP and lop() below.
136 /* Note that REPORT() and REPORT2() will be expressions that supply
137 * their own trailing comma, not suitable for statements as such. */
138 #ifdef DEBUGGING /* Serve -DT. */
139 # define REPORT(x,retval) tokereport(x,s,(int)retval),
140 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
142 # define REPORT(x,retval)
143 # define REPORT2(x,retval)
146 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
147 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
148 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
149 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
150 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
151 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
152 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
153 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
154 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
155 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
156 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
157 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
158 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
159 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
160 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
161 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
162 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
163 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
164 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
165 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
167 /* This bit of chicanery makes a unary function followed by
168 * a parenthesis into a function with one argument, highest precedence.
170 #define UNI(f) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
178 #define UNIBRACK(f) return(yylval.ival = f, \
181 PL_last_uni = PL_oldbufptr, \
182 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
184 /* grandfather return to old style */
185 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
190 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
193 SV* report = newSVpv(thing, 0);
194 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
197 if (s - PL_bufptr > 0)
198 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
200 if (PL_oldbufptr && *PL_oldbufptr)
201 sv_catpv(report, PL_tokenbuf);
203 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
212 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
213 * into an OP_ANDASSIGN or OP_ORASSIGN
217 S_ao(pTHX_ int toketype)
219 if (*PL_bufptr == '=') {
221 if (toketype == ANDAND)
222 yylval.ival = OP_ANDASSIGN;
223 else if (toketype == OROR)
224 yylval.ival = OP_ORASSIGN;
232 * When Perl expects an operator and finds something else, no_op
233 * prints the warning. It always prints "<something> found where
234 * operator expected. It prints "Missing semicolon on previous line?"
235 * if the surprise occurs at the start of the line. "do you need to
236 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
237 * where the compiler doesn't know if foo is a method call or a function.
238 * It prints "Missing operator before end of line" if there's nothing
239 * after the missing operator, or "... before <...>" if there is something
240 * after the missing operator.
244 S_no_op(pTHX_ char *what, char *s)
246 char *oldbp = PL_bufptr;
247 bool is_first = (PL_oldbufptr == PL_linestart);
253 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
255 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
256 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
258 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
259 if (t < PL_bufptr && isSPACE(*t))
260 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
261 t - PL_oldoldbufptr, PL_oldoldbufptr);
265 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
272 * Complain about missing quote/regexp/heredoc terminator.
273 * If it's called with (char *)NULL then it cauterizes the line buffer.
274 * If we're in a delimited string and the delimiter is a control
275 * character, it's reformatted into a two-char sequence like ^C.
280 S_missingterm(pTHX_ char *s)
285 char *nl = strrchr(s,'\n');
291 iscntrl(PL_multi_close)
293 PL_multi_close < 32 || PL_multi_close == 127
297 tmpbuf[1] = toCTRL(PL_multi_close);
303 *tmpbuf = PL_multi_close;
307 q = strchr(s,'"') ? '\'' : '"';
308 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
316 Perl_deprecate(pTHX_ char *s)
318 if (ckWARN(WARN_DEPRECATED))
319 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
324 * Deprecate a comma-less variable list.
330 deprecate("comma-less variable list");
334 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
335 * utf16-to-utf8-reversed.
338 #ifdef PERL_CR_FILTER
342 register char *s = SvPVX(sv);
343 register char *e = s + SvCUR(sv);
344 /* outer loop optimized to do nothing if there are no CR-LFs */
346 if (*s++ == '\r' && *s == '\n') {
347 /* hit a CR-LF, need to copy the rest */
348 register char *d = s - 1;
351 if (*s == '\r' && s[1] == '\n')
362 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
364 I32 count = FILTER_READ(idx+1, sv, maxlen);
365 if (count > 0 && !maxlen)
373 * Initialize variables. Uses the Perl save_stack to save its state (for
374 * recursive calls to the parser).
378 Perl_lex_start(pTHX_ SV *line)
383 SAVEI32(PL_lex_dojoin);
384 SAVEI32(PL_lex_brackets);
385 SAVEI32(PL_lex_casemods);
386 SAVEI32(PL_lex_starts);
387 SAVEI32(PL_lex_state);
388 SAVEVPTR(PL_lex_inpat);
389 SAVEI32(PL_lex_inwhat);
390 if (PL_lex_state == LEX_KNOWNEXT) {
391 I32 toke = PL_nexttoke;
392 while (--toke >= 0) {
393 SAVEI32(PL_nexttype[toke]);
394 SAVEVPTR(PL_nextval[toke]);
396 SAVEI32(PL_nexttoke);
398 SAVECOPLINE(PL_curcop);
401 SAVEPPTR(PL_oldbufptr);
402 SAVEPPTR(PL_oldoldbufptr);
403 SAVEPPTR(PL_last_lop);
404 SAVEPPTR(PL_last_uni);
405 SAVEPPTR(PL_linestart);
406 SAVESPTR(PL_linestr);
407 SAVEPPTR(PL_lex_brackstack);
408 SAVEPPTR(PL_lex_casestack);
409 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
410 SAVESPTR(PL_lex_stuff);
411 SAVEI32(PL_lex_defer);
412 SAVEI32(PL_sublex_info.sub_inwhat);
413 SAVESPTR(PL_lex_repl);
415 SAVEINT(PL_lex_expect);
417 PL_lex_state = LEX_NORMAL;
421 New(899, PL_lex_brackstack, 120, char);
422 New(899, PL_lex_casestack, 12, char);
423 SAVEFREEPV(PL_lex_brackstack);
424 SAVEFREEPV(PL_lex_casestack);
426 *PL_lex_casestack = '\0';
429 PL_lex_stuff = Nullsv;
430 PL_lex_repl = Nullsv;
434 PL_sublex_info.sub_inwhat = 0;
436 if (SvREADONLY(PL_linestr))
437 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
438 s = SvPV(PL_linestr, len);
439 if (len && s[len-1] != ';') {
440 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
441 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
442 sv_catpvn(PL_linestr, "\n;", 2);
444 SvTEMP_off(PL_linestr);
445 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
446 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
447 PL_last_lop = PL_last_uni = Nullch;
449 PL_rs = newSVpvn("\n", 1);
455 * Finalizer for lexing operations. Must be called when the parser is
456 * done with the lexer.
462 PL_doextract = FALSE;
467 * This subroutine has nothing to do with tilting, whether at windmills
468 * or pinball tables. Its name is short for "increment line". It
469 * increments the current line number in CopLINE(PL_curcop) and checks
470 * to see whether the line starts with a comment of the form
471 * # line 500 "foo.pm"
472 * If so, it sets the current line number and file to the values in the comment.
476 S_incline(pTHX_ char *s)
483 CopLINE_inc(PL_curcop);
486 while (SPACE_OR_TAB(*s)) s++;
487 if (strnEQ(s, "line", 4))
491 if (SPACE_OR_TAB(*s))
495 while (SPACE_OR_TAB(*s)) s++;
501 while (SPACE_OR_TAB(*s))
503 if (*s == '"' && (t = strchr(s+1, '"'))) {
508 for (t = s; !isSPACE(*t); t++) ;
511 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
513 if (*e != '\n' && *e != '\0')
514 return; /* false alarm */
520 Safefree(CopFILE(PL_curcop));
522 SvREFCNT_dec(CopFILEGV(PL_curcop));
524 CopFILE_set(PL_curcop, s);
527 CopLINE_set(PL_curcop, atoi(n)-1);
532 * Called to gobble the appropriate amount and type of whitespace.
533 * Skips comments as well.
537 S_skipspace(pTHX_ register char *s)
539 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
540 while (s < PL_bufend && SPACE_OR_TAB(*s))
546 SSize_t oldprevlen, oldoldprevlen;
547 SSize_t oldloplen = 0, oldunilen = 0;
548 while (s < PL_bufend && isSPACE(*s)) {
549 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
554 if (s < PL_bufend && *s == '#') {
555 while (s < PL_bufend && *s != '\n')
559 if (PL_in_eval && !PL_rsfp) {
566 /* only continue to recharge the buffer if we're at the end
567 * of the buffer, we're not reading from a source filter, and
568 * we're in normal lexing mode
570 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
571 PL_lex_state == LEX_FORMLINE)
574 /* try to recharge the buffer */
575 if ((s = filter_gets(PL_linestr, PL_rsfp,
576 (prevlen = SvCUR(PL_linestr)))) == Nullch)
578 /* end of file. Add on the -p or -n magic */
579 if (PL_minus_n || PL_minus_p) {
580 sv_setpv(PL_linestr,PL_minus_p ?
581 ";}continue{print or die qq(-p destination: $!\\n)" :
583 sv_catpv(PL_linestr,";}");
584 PL_minus_n = PL_minus_p = 0;
587 sv_setpv(PL_linestr,";");
589 /* reset variables for next time we lex */
590 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
592 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
593 PL_last_lop = PL_last_uni = Nullch;
595 /* Close the filehandle. Could be from -P preprocessor,
596 * STDIN, or a regular file. If we were reading code from
597 * STDIN (because the commandline held no -e or filename)
598 * then we don't close it, we reset it so the code can
599 * read from STDIN too.
602 if (PL_preprocess && !PL_in_eval)
603 (void)PerlProc_pclose(PL_rsfp);
604 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
605 PerlIO_clearerr(PL_rsfp);
607 (void)PerlIO_close(PL_rsfp);
612 /* not at end of file, so we only read another line */
613 /* make corresponding updates to old pointers, for yyerror() */
614 oldprevlen = PL_oldbufptr - PL_bufend;
615 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
617 oldunilen = PL_last_uni - PL_bufend;
619 oldloplen = PL_last_lop - PL_bufend;
620 PL_linestart = PL_bufptr = s + prevlen;
621 PL_bufend = s + SvCUR(PL_linestr);
623 PL_oldbufptr = s + oldprevlen;
624 PL_oldoldbufptr = s + oldoldprevlen;
626 PL_last_uni = s + oldunilen;
628 PL_last_lop = s + oldloplen;
631 /* debugger active and we're not compiling the debugger code,
632 * so store the line into the debugger's array of lines
634 if (PERLDB_LINE && PL_curstash != PL_debstash) {
635 SV *sv = NEWSV(85,0);
637 sv_upgrade(sv, SVt_PVMG);
638 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
639 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
646 * Check the unary operators to ensure there's no ambiguity in how they're
647 * used. An ambiguous piece of code would be:
649 * This doesn't mean rand() + 5. Because rand() is a unary operator,
650 * the +5 is its argument.
659 if (PL_oldoldbufptr != PL_last_uni)
661 while (isSPACE(*PL_last_uni))
663 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
664 if ((t = strchr(s, '(')) && t < PL_bufptr)
666 if (ckWARN_d(WARN_AMBIGUOUS)){
669 Perl_warner(aTHX_ WARN_AMBIGUOUS,
670 "Warning: Use of \"%s\" without parens is ambiguous",
676 /* workaround to replace the UNI() macro with a function. Only the
677 * hints/uts.sh file mentions this. Other comments elsewhere in the
678 * source indicate Microport Unix might need it too.
684 #define UNI(f) return uni(f,s)
687 S_uni(pTHX_ I32 f, char *s)
692 PL_last_uni = PL_oldbufptr;
703 #endif /* CRIPPLED_CC */
706 * LOP : macro to build a list operator. Its behaviour has been replaced
707 * with a subroutine, S_lop() for which LOP is just another name.
710 #define LOP(f,x) return lop(f,x,s)
714 * Build a list operator (or something that might be one). The rules:
715 * - if we have a next token, then it's a list operator [why?]
716 * - if the next thing is an opening paren, then it's a function
717 * - else it's a list operator
721 S_lop(pTHX_ I32 f, int x, char *s)
728 PL_last_lop = PL_oldbufptr;
743 * When the lexer realizes it knows the next token (for instance,
744 * it is reordering tokens for the parser) then it can call S_force_next
745 * to know what token to return the next time the lexer is called. Caller
746 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
747 * handles the token correctly.
751 S_force_next(pTHX_ I32 type)
753 PL_nexttype[PL_nexttoke] = type;
755 if (PL_lex_state != LEX_KNOWNEXT) {
756 PL_lex_defer = PL_lex_state;
757 PL_lex_expect = PL_expect;
758 PL_lex_state = LEX_KNOWNEXT;
764 * When the lexer knows the next thing is a word (for instance, it has
765 * just seen -> and it knows that the next char is a word char, then
766 * it calls S_force_word to stick the next word into the PL_next lookahead.
769 * char *start : buffer position (must be within PL_linestr)
770 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
771 * int check_keyword : if true, Perl checks to make sure the word isn't
772 * a keyword (do this if the word is a label, e.g. goto FOO)
773 * int allow_pack : if true, : characters will also be allowed (require,
775 * int allow_initial_tick : used by the "sub" lexer only.
779 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
784 start = skipspace(start);
786 if (isIDFIRST_lazy_if(s,UTF) ||
787 (allow_pack && *s == ':') ||
788 (allow_initial_tick && *s == '\'') )
790 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
791 if (check_keyword && keyword(PL_tokenbuf, len))
793 if (token == METHOD) {
798 PL_expect = XOPERATOR;
801 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
802 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
810 * Called when the lexer wants $foo *foo &foo etc, but the program
811 * text only contains the "foo" portion. The first argument is a pointer
812 * to the "foo", and the second argument is the type symbol to prefix.
813 * Forces the next token to be a "WORD".
814 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
818 S_force_ident(pTHX_ register char *s, int kind)
821 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
822 PL_nextval[PL_nexttoke].opval = o;
825 o->op_private = OPpCONST_ENTERED;
826 /* XXX see note in pp_entereval() for why we forgo typo
827 warnings if the symbol must be introduced in an eval.
829 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
830 kind == '$' ? SVt_PV :
831 kind == '@' ? SVt_PVAV :
832 kind == '%' ? SVt_PVHV :
840 Perl_str_to_version(pTHX_ SV *sv)
845 char *start = SvPVx(sv,len);
846 bool utf = SvUTF8(sv) ? TRUE : FALSE;
847 char *end = start + len;
848 while (start < end) {
852 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
857 retval += ((NV)n)/nshift;
866 * Forces the next token to be a version number.
867 * If the next token appears to be an invalid version number, (e.g. "v2b"),
868 * and if "guessing" is TRUE, then no new token is created (and the caller
869 * must use an alternative parsing method).
873 S_force_version(pTHX_ char *s, int guessing)
875 OP *version = Nullop;
884 while (isDIGIT(*d) || *d == '_' || *d == '.')
886 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
888 s = scan_num(s, &yylval);
889 version = yylval.opval;
890 ver = cSVOPx(version)->op_sv;
891 if (SvPOK(ver) && !SvNIOK(ver)) {
892 (void)SvUPGRADE(ver, SVt_PVNV);
893 SvNVX(ver) = str_to_version(ver);
894 SvNOK_on(ver); /* hint that it is a version */
901 /* NOTE: The parser sees the package name and the VERSION swapped */
902 PL_nextval[PL_nexttoke].opval = version;
910 * Tokenize a quoted string passed in as an SV. It finds the next
911 * chunk, up to end of string or a backslash. It may make a new
912 * SV containing that chunk (if HINT_NEW_STRING is on). It also
917 S_tokeq(pTHX_ SV *sv)
928 s = SvPV_force(sv, len);
929 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
932 while (s < send && *s != '\\')
937 if ( PL_hints & HINT_NEW_STRING ) {
938 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
944 if (s + 1 < send && (s[1] == '\\'))
945 s++; /* all that, just for this */
950 SvCUR_set(sv, d - SvPVX(sv));
952 if ( PL_hints & HINT_NEW_STRING )
953 return new_constant(NULL, 0, "q", sv, pv, "q");
958 * Now come three functions related to double-quote context,
959 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
960 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
961 * interact with PL_lex_state, and create fake ( ... ) argument lists
962 * to handle functions and concatenation.
963 * They assume that whoever calls them will be setting up a fake
964 * join call, because each subthing puts a ',' after it. This lets
967 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
969 * (I'm not sure whether the spurious commas at the end of lcfirst's
970 * arguments and join's arguments are created or not).
975 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
977 * Pattern matching will set PL_lex_op to the pattern-matching op to
978 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
980 * OP_CONST and OP_READLINE are easy--just make the new op and return.
982 * Everything else becomes a FUNC.
984 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
985 * had an OP_CONST or OP_READLINE). This just sets us up for a
986 * call to S_sublex_push().
992 register I32 op_type = yylval.ival;
994 if (op_type == OP_NULL) {
995 yylval.opval = PL_lex_op;
999 if (op_type == OP_CONST || op_type == OP_READLINE) {
1000 SV *sv = tokeq(PL_lex_stuff);
1002 if (SvTYPE(sv) == SVt_PVIV) {
1003 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1009 nsv = newSVpvn(p, len);
1015 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1016 PL_lex_stuff = Nullsv;
1020 PL_sublex_info.super_state = PL_lex_state;
1021 PL_sublex_info.sub_inwhat = op_type;
1022 PL_sublex_info.sub_op = PL_lex_op;
1023 PL_lex_state = LEX_INTERPPUSH;
1027 yylval.opval = PL_lex_op;
1037 * Create a new scope to save the lexing state. The scope will be
1038 * ended in S_sublex_done. Returns a '(', starting the function arguments
1039 * to the uc, lc, etc. found before.
1040 * Sets PL_lex_state to LEX_INTERPCONCAT.
1048 PL_lex_state = PL_sublex_info.super_state;
1049 SAVEI32(PL_lex_dojoin);
1050 SAVEI32(PL_lex_brackets);
1051 SAVEI32(PL_lex_casemods);
1052 SAVEI32(PL_lex_starts);
1053 SAVEI32(PL_lex_state);
1054 SAVEVPTR(PL_lex_inpat);
1055 SAVEI32(PL_lex_inwhat);
1056 SAVECOPLINE(PL_curcop);
1057 SAVEPPTR(PL_bufptr);
1058 SAVEPPTR(PL_bufend);
1059 SAVEPPTR(PL_oldbufptr);
1060 SAVEPPTR(PL_oldoldbufptr);
1061 SAVEPPTR(PL_last_lop);
1062 SAVEPPTR(PL_last_uni);
1063 SAVEPPTR(PL_linestart);
1064 SAVESPTR(PL_linestr);
1065 SAVEPPTR(PL_lex_brackstack);
1066 SAVEPPTR(PL_lex_casestack);
1068 PL_linestr = PL_lex_stuff;
1069 PL_lex_stuff = Nullsv;
1071 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1072 = SvPVX(PL_linestr);
1073 PL_bufend += SvCUR(PL_linestr);
1074 PL_last_lop = PL_last_uni = Nullch;
1075 SAVEFREESV(PL_linestr);
1077 PL_lex_dojoin = FALSE;
1078 PL_lex_brackets = 0;
1079 New(899, PL_lex_brackstack, 120, char);
1080 New(899, PL_lex_casestack, 12, char);
1081 SAVEFREEPV(PL_lex_brackstack);
1082 SAVEFREEPV(PL_lex_casestack);
1083 PL_lex_casemods = 0;
1084 *PL_lex_casestack = '\0';
1086 PL_lex_state = LEX_INTERPCONCAT;
1087 CopLINE_set(PL_curcop, PL_multi_start);
1089 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1090 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1091 PL_lex_inpat = PL_sublex_info.sub_op;
1093 PL_lex_inpat = Nullop;
1100 * Restores lexer state after a S_sublex_push.
1106 if (!PL_lex_starts++) {
1107 SV *sv = newSVpvn("",0);
1108 if (SvUTF8(PL_linestr))
1110 PL_expect = XOPERATOR;
1111 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1115 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1116 PL_lex_state = LEX_INTERPCASEMOD;
1120 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1121 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1122 PL_linestr = PL_lex_repl;
1124 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1125 PL_bufend += SvCUR(PL_linestr);
1126 PL_last_lop = PL_last_uni = Nullch;
1127 SAVEFREESV(PL_linestr);
1128 PL_lex_dojoin = FALSE;
1129 PL_lex_brackets = 0;
1130 PL_lex_casemods = 0;
1131 *PL_lex_casestack = '\0';
1133 if (SvEVALED(PL_lex_repl)) {
1134 PL_lex_state = LEX_INTERPNORMAL;
1136 /* we don't clear PL_lex_repl here, so that we can check later
1137 whether this is an evalled subst; that means we rely on the
1138 logic to ensure sublex_done() is called again only via the
1139 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1142 PL_lex_state = LEX_INTERPCONCAT;
1143 PL_lex_repl = Nullsv;
1149 PL_bufend = SvPVX(PL_linestr);
1150 PL_bufend += SvCUR(PL_linestr);
1151 PL_expect = XOPERATOR;
1152 PL_sublex_info.sub_inwhat = 0;
1160 Extracts a pattern, double-quoted string, or transliteration. This
1163 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1164 processing a pattern (PL_lex_inpat is true), a transliteration
1165 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1167 Returns a pointer to the character scanned up to. Iff this is
1168 advanced from the start pointer supplied (ie if anything was
1169 successfully parsed), will leave an OP for the substring scanned
1170 in yylval. Caller must intuit reason for not parsing further
1171 by looking at the next characters herself.
1175 double-quoted style: \r and \n
1176 regexp special ones: \D \s
1178 backrefs: \1 (deprecated in substitution replacements)
1179 case and quoting: \U \Q \E
1180 stops on @ and $, but not for $ as tail anchor
1182 In transliterations:
1183 characters are VERY literal, except for - not at the start or end
1184 of the string, which indicates a range. scan_const expands the
1185 range to the full set of intermediate characters.
1187 In double-quoted strings:
1189 double-quoted style: \r and \n
1191 backrefs: \1 (deprecated)
1192 case and quoting: \U \Q \E
1195 scan_const does *not* construct ops to handle interpolated strings.
1196 It stops processing as soon as it finds an embedded $ or @ variable
1197 and leaves it to the caller to work out what's going on.
1199 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1201 $ in pattern could be $foo or could be tail anchor. Assumption:
1202 it's a tail anchor if $ is the last thing in the string, or if it's
1203 followed by one of ")| \n\t"
1205 \1 (backreferences) are turned into $1
1207 The structure of the code is
1208 while (there's a character to process) {
1209 handle transliteration ranges
1210 skip regexp comments
1211 skip # initiated comments in //x patterns
1212 check for embedded @foo
1213 check for embedded scalars
1215 leave intact backslashes from leave (below)
1216 deprecate \1 in strings and sub replacements
1217 handle string-changing backslashes \l \U \Q \E, etc.
1218 switch (what was escaped) {
1219 handle - in a transliteration (becomes a literal -)
1220 handle \132 octal characters
1221 handle 0x15 hex characters
1222 handle \cV (control V)
1223 handle printf backslashes (\f, \r, \n, etc)
1225 } (end if backslash)
1226 } (end while character to read)
1231 S_scan_const(pTHX_ char *start)
1233 register char *send = PL_bufend; /* end of the constant */
1234 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1235 register char *s = start; /* start of the constant */
1236 register char *d = SvPVX(sv); /* destination for copies */
1237 bool dorange = FALSE; /* are we in a translit range? */
1238 bool didrange = FALSE; /* did we just finish a range? */
1239 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1240 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1243 const char *leaveit = /* set of acceptably-backslashed characters */
1245 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1248 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1249 /* If we are doing a trans and we know we want UTF8 set expectation */
1250 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1251 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1255 while (s < send || dorange) {
1256 /* get transliterations out of the way (they're most literal) */
1257 if (PL_lex_inwhat == OP_TRANS) {
1258 /* expand a range A-Z to the full set of characters. AIE! */
1260 I32 i; /* current expanded character */
1261 I32 min; /* first character in range */
1262 I32 max; /* last character in range */
1265 char *c = (char*)utf8_hop((U8*)d, -1);
1269 *c = (char)UTF_TO_NATIVE(0xff);
1270 /* mark the range as done, and continue */
1276 i = d - SvPVX(sv); /* remember current offset */
1277 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1278 d = SvPVX(sv) + i; /* refresh d after realloc */
1279 d -= 2; /* eat the first char and the - */
1281 min = (U8)*d; /* first char in range */
1282 max = (U8)d[1]; /* last char in range */
1286 "Invalid [] range \"%c-%c\" in transliteration operator",
1287 (char)min, (char)max);
1291 if ((isLOWER(min) && isLOWER(max)) ||
1292 (isUPPER(min) && isUPPER(max))) {
1294 for (i = min; i <= max; i++)
1296 *d++ = NATIVE_TO_NEED(has_utf8,i);
1298 for (i = min; i <= max; i++)
1300 *d++ = NATIVE_TO_NEED(has_utf8,i);
1305 for (i = min; i <= max; i++)
1308 /* mark the range as done, and continue */
1314 /* range begins (ignore - as first or last char) */
1315 else if (*s == '-' && s+1 < send && s != start) {
1317 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1320 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1332 /* if we get here, we're not doing a transliteration */
1334 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1335 except for the last char, which will be done separately. */
1336 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1338 while (s < send && *s != ')')
1339 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1341 else if (s[2] == '{' /* This should match regcomp.c */
1342 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1345 char *regparse = s + (s[2] == '{' ? 3 : 4);
1348 while (count && (c = *regparse)) {
1349 if (c == '\\' && regparse[1])
1357 if (*regparse != ')') {
1358 regparse--; /* Leave one char for continuation. */
1359 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1361 while (s < regparse)
1362 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1366 /* likewise skip #-initiated comments in //x patterns */
1367 else if (*s == '#' && PL_lex_inpat &&
1368 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1369 while (s+1 < send && *s != '\n')
1370 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1373 /* check for embedded arrays
1374 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1376 else if (*s == '@' && s[1]
1377 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1380 /* check for embedded scalars. only stop if we're sure it's a
1383 else if (*s == '$') {
1384 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1386 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1387 break; /* in regexp, $ might be tail anchor */
1390 /* End of else if chain - OP_TRANS rejoin rest */
1393 if (*s == '\\' && s+1 < send) {
1396 /* some backslashes we leave behind */
1397 if (*leaveit && *s && strchr(leaveit, *s)) {
1398 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1399 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1403 /* deprecate \1 in strings and substitution replacements */
1404 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1405 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1407 if (ckWARN(WARN_SYNTAX))
1408 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1413 /* string-change backslash escapes */
1414 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1419 /* if we get here, it's either a quoted -, or a digit */
1422 /* quoted - in transliterations */
1424 if (PL_lex_inwhat == OP_TRANS) {
1431 if (ckWARN(WARN_MISC) && isALNUM(*s))
1432 Perl_warner(aTHX_ WARN_MISC,
1433 "Unrecognized escape \\%c passed through",
1435 /* default action is to copy the quoted character */
1436 goto default_action;
1439 /* \132 indicates an octal constant */
1440 case '0': case '1': case '2': case '3':
1441 case '4': case '5': case '6': case '7':
1445 uv = grok_oct(s, &len, &flags, NULL);
1448 goto NUM_ESCAPE_INSERT;
1450 /* \x24 indicates a hex constant */
1454 char* e = strchr(s, '}');
1455 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
1460 yyerror("Missing right brace on \\x{}");
1464 uv = grok_hex(s, &len, &flags, NULL);
1471 uv = grok_hex(s, &len, &flags, NULL);
1477 /* Insert oct or hex escaped character.
1478 * There will always enough room in sv since such
1479 * escapes will be longer than any UTF-8 sequence
1480 * they can end up as. */
1482 /* We need to map to chars to ASCII before doing the tests
1485 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1486 if (!has_utf8 && uv > 255) {
1487 /* Might need to recode whatever we have
1488 * accumulated so far if it contains any
1491 * (Can't we keep track of that and avoid
1492 * this rescan? --jhi)
1496 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1497 if (!NATIVE_IS_INVARIANT(*c)) {
1502 STRLEN offset = d - SvPVX(sv);
1504 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1508 while (src >= (U8 *)SvPVX(sv)) {
1509 if (!NATIVE_IS_INVARIANT(*src)) {
1510 U8 ch = NATIVE_TO_ASCII(*src);
1511 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1512 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1522 if (has_utf8 || uv > 255) {
1523 d = (char*)uvchr_to_utf8((U8*)d, uv);
1525 if (PL_lex_inwhat == OP_TRANS &&
1526 PL_sublex_info.sub_op) {
1527 PL_sublex_info.sub_op->op_private |=
1528 (PL_lex_repl ? OPpTRANS_FROM_UTF
1541 /* \N{latin small letter a} is a named character */
1545 char* e = strchr(s, '}');
1551 yyerror("Missing right brace on \\N{}");
1555 res = newSVpvn(s + 1, e - s - 1);
1556 res = new_constant( Nullch, 0, "charnames",
1557 res, Nullsv, "\\N{...}" );
1559 sv_utf8_upgrade(res);
1560 str = SvPV(res,len);
1561 if (!has_utf8 && SvUTF8(res)) {
1562 char *ostart = SvPVX(sv);
1563 SvCUR_set(sv, d - ostart);
1566 sv_utf8_upgrade(sv);
1567 /* this just broke our allocation above... */
1568 SvGROW(sv, send - start);
1569 d = SvPVX(sv) + SvCUR(sv);
1572 if (len > e - s + 4) {
1573 char *odest = SvPVX(sv);
1575 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1576 d = SvPVX(sv) + (d - odest);
1578 Copy(str, d, len, char);
1585 yyerror("Missing braces on \\N{}");
1588 /* \c is a control character */
1597 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1601 /* printf-style backslashes, formfeeds, newlines, etc */
1603 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1606 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1609 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1612 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1615 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1618 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1621 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1627 } /* end if (backslash) */
1630 /* If we started with encoded form, or already know we want it
1631 and then encode the next character */
1632 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1634 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1635 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1638 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1639 STRLEN off = d - SvPVX(sv);
1640 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1642 d = (char*)uvchr_to_utf8((U8*)d, uv);
1646 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1648 } /* while loop to process each character */
1650 /* terminate the string and set up the sv */
1652 SvCUR_set(sv, d - SvPVX(sv));
1653 if (SvCUR(sv) >= SvLEN(sv))
1654 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1659 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1660 PL_sublex_info.sub_op->op_private |=
1661 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1665 /* shrink the sv if we allocated more than we used */
1666 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1667 SvLEN_set(sv, SvCUR(sv) + 1);
1668 Renew(SvPVX(sv), SvLEN(sv), char);
1671 /* return the substring (via yylval) only if we parsed anything */
1672 if (s > PL_bufptr) {
1673 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1674 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1676 ( PL_lex_inwhat == OP_TRANS
1678 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1681 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1688 * Returns TRUE if there's more to the expression (e.g., a subscript),
1691 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1693 * ->[ and ->{ return TRUE
1694 * { and [ outside a pattern are always subscripts, so return TRUE
1695 * if we're outside a pattern and it's not { or [, then return FALSE
1696 * if we're in a pattern and the first char is a {
1697 * {4,5} (any digits around the comma) returns FALSE
1698 * if we're in a pattern and the first char is a [
1700 * [SOMETHING] has a funky algorithm to decide whether it's a
1701 * character class or not. It has to deal with things like
1702 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1703 * anything else returns TRUE
1706 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1709 S_intuit_more(pTHX_ register char *s)
1711 if (PL_lex_brackets)
1713 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1715 if (*s != '{' && *s != '[')
1720 /* In a pattern, so maybe we have {n,m}. */
1737 /* On the other hand, maybe we have a character class */
1740 if (*s == ']' || *s == '^')
1743 /* this is terrifying, and it works */
1744 int weight = 2; /* let's weigh the evidence */
1746 unsigned char un_char = 255, last_un_char;
1747 char *send = strchr(s,']');
1748 char tmpbuf[sizeof PL_tokenbuf * 4];
1750 if (!send) /* has to be an expression */
1753 Zero(seen,256,char);
1756 else if (isDIGIT(*s)) {
1758 if (isDIGIT(s[1]) && s[2] == ']')
1764 for (; s < send; s++) {
1765 last_un_char = un_char;
1766 un_char = (unsigned char)*s;
1771 weight -= seen[un_char] * 10;
1772 if (isALNUM_lazy_if(s+1,UTF)) {
1773 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1774 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1779 else if (*s == '$' && s[1] &&
1780 strchr("[#!%*<>()-=",s[1])) {
1781 if (/*{*/ strchr("])} =",s[2]))
1790 if (strchr("wds]",s[1]))
1792 else if (seen['\''] || seen['"'])
1794 else if (strchr("rnftbxcav",s[1]))
1796 else if (isDIGIT(s[1])) {
1798 while (s[1] && isDIGIT(s[1]))
1808 if (strchr("aA01! ",last_un_char))
1810 if (strchr("zZ79~",s[1]))
1812 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1813 weight -= 5; /* cope with negative subscript */
1816 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1817 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1822 if (keyword(tmpbuf, d - tmpbuf))
1825 if (un_char == last_un_char + 1)
1827 weight -= seen[un_char];
1832 if (weight >= 0) /* probably a character class */
1842 * Does all the checking to disambiguate
1844 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1845 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1847 * First argument is the stuff after the first token, e.g. "bar".
1849 * Not a method if bar is a filehandle.
1850 * Not a method if foo is a subroutine prototyped to take a filehandle.
1851 * Not a method if it's really "Foo $bar"
1852 * Method if it's "foo $bar"
1853 * Not a method if it's really "print foo $bar"
1854 * Method if it's really "foo package::" (interpreted as package->foo)
1855 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1856 * Not a method if bar is a filehandle or package, but is quoted with
1861 S_intuit_method(pTHX_ char *start, GV *gv)
1863 char *s = start + (*start == '$');
1864 char tmpbuf[sizeof PL_tokenbuf];
1872 if ((cv = GvCVu(gv))) {
1873 char *proto = SvPVX(cv);
1883 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1884 /* start is the beginning of the possible filehandle/object,
1885 * and s is the end of it
1886 * tmpbuf is a copy of it
1889 if (*start == '$') {
1890 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1895 return *s == '(' ? FUNCMETH : METHOD;
1897 if (!keyword(tmpbuf, len)) {
1898 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1903 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1904 if (indirgv && GvCVu(indirgv))
1906 /* filehandle or package name makes it a method */
1907 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1909 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1910 return 0; /* no assumptions -- "=>" quotes bearword */
1912 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1913 newSVpvn(tmpbuf,len));
1914 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1918 return *s == '(' ? FUNCMETH : METHOD;
1926 * Return a string of Perl code to load the debugger. If PERL5DB
1927 * is set, it will return the contents of that, otherwise a
1928 * compile-time require of perl5db.pl.
1935 char *pdb = PerlEnv_getenv("PERL5DB");
1939 SETERRNO(0,SS$_NORMAL);
1940 return "BEGIN { require 'perl5db.pl' }";
1946 /* Encoded script support. filter_add() effectively inserts a
1947 * 'pre-processing' function into the current source input stream.
1948 * Note that the filter function only applies to the current source file
1949 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1951 * The datasv parameter (which may be NULL) can be used to pass
1952 * private data to this instance of the filter. The filter function
1953 * can recover the SV using the FILTER_DATA macro and use it to
1954 * store private buffers and state information.
1956 * The supplied datasv parameter is upgraded to a PVIO type
1957 * and the IoDIRP/IoANY field is used to store the function pointer,
1958 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1959 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1960 * private use must be set using malloc'd pointers.
1964 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1969 if (!PL_rsfp_filters)
1970 PL_rsfp_filters = newAV();
1972 datasv = NEWSV(255,0);
1973 if (!SvUPGRADE(datasv, SVt_PVIO))
1974 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1975 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1976 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1977 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1978 funcp, SvPV_nolen(datasv)));
1979 av_unshift(PL_rsfp_filters, 1);
1980 av_store(PL_rsfp_filters, 0, datasv) ;
1985 /* Delete most recently added instance of this filter function. */
1987 Perl_filter_del(pTHX_ filter_t funcp)
1990 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1991 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1993 /* if filter is on top of stack (usual case) just pop it off */
1994 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1995 if (IoANY(datasv) == (void *)funcp) {
1996 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1997 IoANY(datasv) = (void *)NULL;
1998 sv_free(av_pop(PL_rsfp_filters));
2002 /* we need to search for the correct entry and clear it */
2003 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2007 /* Invoke the n'th filter function for the current rsfp. */
2009 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2012 /* 0 = read one text line */
2017 if (!PL_rsfp_filters)
2019 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2020 /* Provide a default input filter to make life easy. */
2021 /* Note that we append to the line. This is handy. */
2022 DEBUG_P(PerlIO_printf(Perl_debug_log,
2023 "filter_read %d: from rsfp\n", idx));
2027 int old_len = SvCUR(buf_sv) ;
2029 /* ensure buf_sv is large enough */
2030 SvGROW(buf_sv, old_len + maxlen) ;
2031 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2032 if (PerlIO_error(PL_rsfp))
2033 return -1; /* error */
2035 return 0 ; /* end of file */
2037 SvCUR_set(buf_sv, old_len + len) ;
2040 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2041 if (PerlIO_error(PL_rsfp))
2042 return -1; /* error */
2044 return 0 ; /* end of file */
2047 return SvCUR(buf_sv);
2049 /* Skip this filter slot if filter has been deleted */
2050 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2051 DEBUG_P(PerlIO_printf(Perl_debug_log,
2052 "filter_read %d: skipped (filter deleted)\n",
2054 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2056 /* Get function pointer hidden within datasv */
2057 funcp = (filter_t)IoANY(datasv);
2058 DEBUG_P(PerlIO_printf(Perl_debug_log,
2059 "filter_read %d: via function %p (%s)\n",
2060 idx, funcp, SvPV_nolen(datasv)));
2061 /* Call function. The function is expected to */
2062 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2063 /* Return: <0:error, =0:eof, >0:not eof */
2064 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2068 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2070 #ifdef PERL_CR_FILTER
2071 if (!PL_rsfp_filters) {
2072 filter_add(S_cr_textfilter,NULL);
2075 if (PL_rsfp_filters) {
2078 SvCUR_set(sv, 0); /* start with empty line */
2079 if (FILTER_READ(0, sv, 0) > 0)
2080 return ( SvPVX(sv) ) ;
2085 return (sv_gets(sv, fp, append));
2089 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2093 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2097 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2098 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2100 return GvHV(gv); /* Foo:: */
2103 /* use constant CLASS => 'MyClass' */
2104 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2106 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2107 pkgname = SvPV_nolen(sv);
2111 return gv_stashpv(pkgname, FALSE);
2115 static char* exp_name[] =
2116 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2117 "ATTRTERM", "TERMBLOCK"
2124 Works out what to call the token just pulled out of the input
2125 stream. The yacc parser takes care of taking the ops we return and
2126 stitching them into a tree.
2132 if read an identifier
2133 if we're in a my declaration
2134 croak if they tried to say my($foo::bar)
2135 build the ops for a my() declaration
2136 if it's an access to a my() variable
2137 are we in a sort block?
2138 croak if my($a); $a <=> $b
2139 build ops for access to a my() variable
2140 if in a dq string, and they've said @foo and we can't find @foo
2142 build ops for a bareword
2143 if we already built the token before, use it.
2146 #ifdef USE_PURE_BISON
2148 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2153 yylval_pointer[yyactlevel] = lvalp;
2154 yychar_pointer[yyactlevel] = lcharp;
2155 if (yyactlevel >= YYMAXLEVEL)
2156 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2158 r = Perl_yylex(aTHX);
2168 #pragma segment Perl_yylex
2181 /* check if there's an identifier for us to look at */
2182 if (PL_pending_ident)
2183 return S_pending_ident(aTHX);
2185 /* no identifier pending identification */
2187 switch (PL_lex_state) {
2189 case LEX_NORMAL: /* Some compilers will produce faster */
2190 case LEX_INTERPNORMAL: /* code if we comment these out. */
2194 /* when we've already built the next token, just pull it out of the queue */
2197 yylval = PL_nextval[PL_nexttoke];
2199 PL_lex_state = PL_lex_defer;
2200 PL_expect = PL_lex_expect;
2201 PL_lex_defer = LEX_NORMAL;
2203 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2204 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2205 (IV)PL_nexttype[PL_nexttoke]); });
2207 return(PL_nexttype[PL_nexttoke]);
2209 /* interpolated case modifiers like \L \U, including \Q and \E.
2210 when we get here, PL_bufptr is at the \
2212 case LEX_INTERPCASEMOD:
2214 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2215 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2217 /* handle \E or end of string */
2218 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2222 if (PL_lex_casemods) {
2223 oldmod = PL_lex_casestack[--PL_lex_casemods];
2224 PL_lex_casestack[PL_lex_casemods] = '\0';
2226 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2228 PL_lex_state = LEX_INTERPCONCAT;
2232 if (PL_bufptr != PL_bufend)
2234 PL_lex_state = LEX_INTERPCONCAT;
2238 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2239 "### Saw case modifier at '%s'\n", PL_bufptr); });
2241 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2242 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2243 if (strchr("LU", *s) &&
2244 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2246 PL_lex_casestack[--PL_lex_casemods] = '\0';
2249 if (PL_lex_casemods > 10) {
2250 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2251 if (newlb != PL_lex_casestack) {
2253 PL_lex_casestack = newlb;
2256 PL_lex_casestack[PL_lex_casemods++] = *s;
2257 PL_lex_casestack[PL_lex_casemods] = '\0';
2258 PL_lex_state = LEX_INTERPCONCAT;
2259 PL_nextval[PL_nexttoke].ival = 0;
2262 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2264 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2266 PL_nextval[PL_nexttoke].ival = OP_LC;
2268 PL_nextval[PL_nexttoke].ival = OP_UC;
2270 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2272 Perl_croak(aTHX_ "panic: yylex");
2275 if (PL_lex_starts) {
2284 case LEX_INTERPPUSH:
2285 return sublex_push();
2287 case LEX_INTERPSTART:
2288 if (PL_bufptr == PL_bufend)
2289 return sublex_done();
2290 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2291 "### Interpolated variable at '%s'\n", PL_bufptr); });
2293 PL_lex_dojoin = (*PL_bufptr == '@');
2294 PL_lex_state = LEX_INTERPNORMAL;
2295 if (PL_lex_dojoin) {
2296 PL_nextval[PL_nexttoke].ival = 0;
2298 #ifdef USE_5005THREADS
2299 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2300 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2301 force_next(PRIVATEREF);
2303 force_ident("\"", '$');
2304 #endif /* USE_5005THREADS */
2305 PL_nextval[PL_nexttoke].ival = 0;
2307 PL_nextval[PL_nexttoke].ival = 0;
2309 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2312 if (PL_lex_starts++) {
2318 case LEX_INTERPENDMAYBE:
2319 if (intuit_more(PL_bufptr)) {
2320 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2326 if (PL_lex_dojoin) {
2327 PL_lex_dojoin = FALSE;
2328 PL_lex_state = LEX_INTERPCONCAT;
2331 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2332 && SvEVALED(PL_lex_repl))
2334 if (PL_bufptr != PL_bufend)
2335 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2336 PL_lex_repl = Nullsv;
2339 case LEX_INTERPCONCAT:
2341 if (PL_lex_brackets)
2342 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2344 if (PL_bufptr == PL_bufend)
2345 return sublex_done();
2347 if (SvIVX(PL_linestr) == '\'') {
2348 SV *sv = newSVsv(PL_linestr);
2351 else if ( PL_hints & HINT_NEW_RE )
2352 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2353 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2357 s = scan_const(PL_bufptr);
2359 PL_lex_state = LEX_INTERPCASEMOD;
2361 PL_lex_state = LEX_INTERPSTART;
2364 if (s != PL_bufptr) {
2365 PL_nextval[PL_nexttoke] = yylval;
2368 if (PL_lex_starts++)
2378 PL_lex_state = LEX_NORMAL;
2379 s = scan_formline(PL_bufptr);
2380 if (!PL_lex_formbrack)
2386 PL_oldoldbufptr = PL_oldbufptr;
2389 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2390 exp_name[PL_expect], s);
2396 if (isIDFIRST_lazy_if(s,UTF))
2398 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2401 goto fake_eof; /* emulate EOF on ^D or ^Z */
2406 if (PL_lex_brackets)
2407 yyerror("Missing right curly or square bracket");
2408 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2409 "### Tokener got EOF\n");
2413 if (s++ < PL_bufend)
2414 goto retry; /* ignore stray nulls */
2417 if (!PL_in_eval && !PL_preambled) {
2418 PL_preambled = TRUE;
2419 sv_setpv(PL_linestr,incl_perldb());
2420 if (SvCUR(PL_linestr))
2421 sv_catpv(PL_linestr,";");
2423 while(AvFILLp(PL_preambleav) >= 0) {
2424 SV *tmpsv = av_shift(PL_preambleav);
2425 sv_catsv(PL_linestr, tmpsv);
2426 sv_catpv(PL_linestr, ";");
2429 sv_free((SV*)PL_preambleav);
2430 PL_preambleav = NULL;
2432 if (PL_minus_n || PL_minus_p) {
2433 sv_catpv(PL_linestr, "LINE: while (<>) {");
2435 sv_catpv(PL_linestr,"chomp;");
2438 if (strchr("/'\"", *PL_splitstr)
2439 && strchr(PL_splitstr + 1, *PL_splitstr))
2440 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2443 s = "'~#\200\1'"; /* surely one char is unused...*/
2444 while (s[1] && strchr(PL_splitstr, *s)) s++;
2446 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2447 "q" + (delim == '\''), delim);
2448 for (s = PL_splitstr; *s; s++) {
2450 sv_catpvn(PL_linestr, "\\", 1);
2451 sv_catpvn(PL_linestr, s, 1);
2453 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2457 sv_catpv(PL_linestr,"our @F=split(' ');");
2460 sv_catpv(PL_linestr, "\n");
2461 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2462 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2463 PL_last_lop = PL_last_uni = Nullch;
2464 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2465 SV *sv = NEWSV(85,0);
2467 sv_upgrade(sv, SVt_PVMG);
2468 sv_setsv(sv,PL_linestr);
2469 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2474 bof = PL_rsfp ? TRUE : FALSE;
2475 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2478 if (PL_preprocess && !PL_in_eval)
2479 (void)PerlProc_pclose(PL_rsfp);
2480 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2481 PerlIO_clearerr(PL_rsfp);
2483 (void)PerlIO_close(PL_rsfp);
2485 PL_doextract = FALSE;
2487 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2488 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2489 sv_catpv(PL_linestr,";}");
2490 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2491 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2492 PL_last_lop = PL_last_uni = Nullch;
2493 PL_minus_n = PL_minus_p = 0;
2496 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2497 PL_last_lop = PL_last_uni = Nullch;
2498 sv_setpv(PL_linestr,"");
2499 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2501 /* if it looks like the start of a BOM, check if it in fact is */
2502 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2503 #ifdef PERLIO_IS_STDIO
2504 # ifdef __GNU_LIBRARY__
2505 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2506 # define FTELL_FOR_PIPE_IS_BROKEN
2510 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2511 # define FTELL_FOR_PIPE_IS_BROKEN
2516 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2517 /* This loses the possibility to detect the bof
2518 * situation on perl -P when the libc5 is being used.
2519 * Workaround? Maybe attach some extra state to PL_rsfp?
2522 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2524 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2527 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2528 s = swallow_bom((U8*)s);
2532 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2533 PL_doextract = FALSE;
2535 /* Incest with pod. */
2536 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2537 sv_setpv(PL_linestr, "");
2538 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2539 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2540 PL_last_lop = PL_last_uni = Nullch;
2541 PL_doextract = FALSE;
2545 } while (PL_doextract);
2546 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2547 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2548 SV *sv = NEWSV(85,0);
2550 sv_upgrade(sv, SVt_PVMG);
2551 sv_setsv(sv,PL_linestr);
2552 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2554 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2555 PL_last_lop = PL_last_uni = Nullch;
2556 if (CopLINE(PL_curcop) == 1) {
2557 while (s < PL_bufend && isSPACE(*s))
2559 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2563 if (*s == '#' && *(s+1) == '!')
2565 #ifdef ALTERNATE_SHEBANG
2567 static char as[] = ALTERNATE_SHEBANG;
2568 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2569 d = s + (sizeof(as) - 1);
2571 #endif /* ALTERNATE_SHEBANG */
2580 while (*d && !isSPACE(*d))
2584 #ifdef ARG_ZERO_IS_SCRIPT
2585 if (ipathend > ipath) {
2587 * HP-UX (at least) sets argv[0] to the script name,
2588 * which makes $^X incorrect. And Digital UNIX and Linux,
2589 * at least, set argv[0] to the basename of the Perl
2590 * interpreter. So, having found "#!", we'll set it right.
2592 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2593 assert(SvPOK(x) || SvGMAGICAL(x));
2594 if (sv_eq(x, CopFILESV(PL_curcop))) {
2595 sv_setpvn(x, ipath, ipathend - ipath);
2598 TAINT_NOT; /* $^X is always tainted, but that's OK */
2600 #endif /* ARG_ZERO_IS_SCRIPT */
2605 d = instr(s,"perl -");
2607 d = instr(s,"perl");
2609 /* avoid getting into infinite loops when shebang
2610 * line contains "Perl" rather than "perl" */
2612 for (d = ipathend-4; d >= ipath; --d) {
2613 if ((*d == 'p' || *d == 'P')
2614 && !ibcmp(d, "perl", 4))
2624 #ifdef ALTERNATE_SHEBANG
2626 * If the ALTERNATE_SHEBANG on this system starts with a
2627 * character that can be part of a Perl expression, then if
2628 * we see it but not "perl", we're probably looking at the
2629 * start of Perl code, not a request to hand off to some
2630 * other interpreter. Similarly, if "perl" is there, but
2631 * not in the first 'word' of the line, we assume the line
2632 * contains the start of the Perl program.
2634 if (d && *s != '#') {
2636 while (*c && !strchr("; \t\r\n\f\v#", *c))
2639 d = Nullch; /* "perl" not in first word; ignore */
2641 *s = '#'; /* Don't try to parse shebang line */
2643 #endif /* ALTERNATE_SHEBANG */
2644 #ifndef MACOS_TRADITIONAL
2649 !instr(s,"indir") &&
2650 instr(PL_origargv[0],"perl"))
2656 while (s < PL_bufend && isSPACE(*s))
2658 if (s < PL_bufend) {
2659 Newz(899,newargv,PL_origargc+3,char*);
2661 while (s < PL_bufend && !isSPACE(*s))
2664 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2667 newargv = PL_origargv;
2669 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2670 Perl_croak(aTHX_ "Can't exec %s", ipath);
2674 U32 oldpdb = PL_perldb;
2675 bool oldn = PL_minus_n;
2676 bool oldp = PL_minus_p;
2678 while (*d && !isSPACE(*d)) d++;
2679 while (SPACE_OR_TAB(*d)) d++;
2683 if (*d == 'M' || *d == 'm') {
2685 while (*d && !isSPACE(*d)) d++;
2686 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2689 d = moreswitches(d);
2691 if ((PERLDB_LINE && !oldpdb) ||
2692 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2693 /* if we have already added "LINE: while (<>) {",
2694 we must not do it again */
2696 sv_setpv(PL_linestr, "");
2697 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2698 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2699 PL_last_lop = PL_last_uni = Nullch;
2700 PL_preambled = FALSE;
2702 (void)gv_fetchfile(PL_origfilename);
2709 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2711 PL_lex_state = LEX_FORMLINE;
2716 #ifdef PERL_STRICT_CR
2717 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2719 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2721 case ' ': case '\t': case '\f': case 013:
2722 #ifdef MACOS_TRADITIONAL
2729 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2730 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2731 /* handle eval qq[#line 1 "foo"\n ...] */
2732 CopLINE_dec(PL_curcop);
2736 while (s < d && *s != '\n')
2740 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2741 Perl_croak(aTHX_ "panic: input overflow");
2743 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2745 PL_lex_state = LEX_FORMLINE;
2755 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2762 while (s < PL_bufend && SPACE_OR_TAB(*s))
2765 if (strnEQ(s,"=>",2)) {
2766 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2767 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2768 "### Saw unary minus before =>, forcing word '%s'\n", s);
2770 OPERATOR('-'); /* unary minus */
2772 PL_last_uni = PL_oldbufptr;
2774 case 'r': ftst = OP_FTEREAD; break;
2775 case 'w': ftst = OP_FTEWRITE; break;
2776 case 'x': ftst = OP_FTEEXEC; break;
2777 case 'o': ftst = OP_FTEOWNED; break;
2778 case 'R': ftst = OP_FTRREAD; break;
2779 case 'W': ftst = OP_FTRWRITE; break;
2780 case 'X': ftst = OP_FTREXEC; break;
2781 case 'O': ftst = OP_FTROWNED; break;
2782 case 'e': ftst = OP_FTIS; break;
2783 case 'z': ftst = OP_FTZERO; break;
2784 case 's': ftst = OP_FTSIZE; break;
2785 case 'f': ftst = OP_FTFILE; break;
2786 case 'd': ftst = OP_FTDIR; break;
2787 case 'l': ftst = OP_FTLINK; break;
2788 case 'p': ftst = OP_FTPIPE; break;
2789 case 'S': ftst = OP_FTSOCK; break;
2790 case 'u': ftst = OP_FTSUID; break;
2791 case 'g': ftst = OP_FTSGID; break;
2792 case 'k': ftst = OP_FTSVTX; break;
2793 case 'b': ftst = OP_FTBLK; break;
2794 case 'c': ftst = OP_FTCHR; break;
2795 case 't': ftst = OP_FTTTY; break;
2796 case 'T': ftst = OP_FTTEXT; break;
2797 case 'B': ftst = OP_FTBINARY; break;
2798 case 'M': case 'A': case 'C':
2799 gv_fetchpv("\024",TRUE, SVt_PV);
2801 case 'M': ftst = OP_FTMTIME; break;
2802 case 'A': ftst = OP_FTATIME; break;
2803 case 'C': ftst = OP_FTCTIME; break;
2811 PL_last_lop_op = ftst;
2812 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2813 "### Saw file test %c\n", (int)ftst);
2818 /* Assume it was a minus followed by a one-letter named
2819 * subroutine call (or a -bareword), then. */
2820 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2821 "### %c looked like a file test but was not\n",
2830 if (PL_expect == XOPERATOR)
2835 else if (*s == '>') {
2838 if (isIDFIRST_lazy_if(s,UTF)) {
2839 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2847 if (PL_expect == XOPERATOR)
2850 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2852 OPERATOR('-'); /* unary minus */
2859 if (PL_expect == XOPERATOR)
2864 if (PL_expect == XOPERATOR)
2867 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2873 if (PL_expect != XOPERATOR) {
2874 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2875 PL_expect = XOPERATOR;
2876 force_ident(PL_tokenbuf, '*');
2889 if (PL_expect == XOPERATOR) {
2893 PL_tokenbuf[0] = '%';
2894 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2895 if (!PL_tokenbuf[1]) {
2897 yyerror("Final % should be \\% or %name");
2900 PL_pending_ident = '%';
2919 switch (PL_expect) {
2922 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2924 PL_bufptr = s; /* update in case we back off */
2930 PL_expect = XTERMBLOCK;
2934 while (isIDFIRST_lazy_if(s,UTF)) {
2935 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2936 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2937 if (tmp < 0) tmp = -tmp;
2952 d = scan_str(d,TRUE,TRUE);
2954 /* MUST advance bufptr here to avoid bogus
2955 "at end of line" context messages from yyerror().
2957 PL_bufptr = s + len;
2958 yyerror("Unterminated attribute parameter in attribute list");
2961 return 0; /* EOF indicator */
2965 SV *sv = newSVpvn(s, len);
2966 sv_catsv(sv, PL_lex_stuff);
2967 attrs = append_elem(OP_LIST, attrs,
2968 newSVOP(OP_CONST, 0, sv));
2969 SvREFCNT_dec(PL_lex_stuff);
2970 PL_lex_stuff = Nullsv;
2973 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
2974 CvLVALUE_on(PL_compcv);
2975 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
2976 CvLOCKED_on(PL_compcv);
2977 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
2978 CvMETHOD_on(PL_compcv);
2980 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "unique", len))
2981 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
2983 /* After we've set the flags, it could be argued that
2984 we don't need to do the attributes.pm-based setting
2985 process, and shouldn't bother appending recognized
2986 flags. To experiment with that, uncomment the
2987 following "else": */
2989 attrs = append_elem(OP_LIST, attrs,
2990 newSVOP(OP_CONST, 0,
2994 if (*s == ':' && s[1] != ':')
2997 break; /* require real whitespace or :'s */
2999 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3000 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3001 char q = ((*s == '\'') ? '"' : '\'');
3002 /* If here for an expression, and parsed no attrs, back off. */
3003 if (tmp == '=' && !attrs) {
3007 /* MUST advance bufptr here to avoid bogus "at end of line"
3008 context messages from yyerror().
3012 yyerror("Unterminated attribute list");
3014 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3022 PL_nextval[PL_nexttoke].opval = attrs;
3030 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3031 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3047 if (PL_lex_brackets <= 0)
3048 yyerror("Unmatched right square bracket");
3051 if (PL_lex_state == LEX_INTERPNORMAL) {
3052 if (PL_lex_brackets == 0) {
3053 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3054 PL_lex_state = LEX_INTERPEND;
3061 if (PL_lex_brackets > 100) {
3062 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3063 if (newlb != PL_lex_brackstack) {
3065 PL_lex_brackstack = newlb;
3068 switch (PL_expect) {
3070 if (PL_lex_formbrack) {
3074 if (PL_oldoldbufptr == PL_last_lop)
3075 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3077 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3078 OPERATOR(HASHBRACK);
3080 while (s < PL_bufend && SPACE_OR_TAB(*s))
3083 PL_tokenbuf[0] = '\0';
3084 if (d < PL_bufend && *d == '-') {
3085 PL_tokenbuf[0] = '-';
3087 while (d < PL_bufend && SPACE_OR_TAB(*d))
3090 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3091 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3093 while (d < PL_bufend && SPACE_OR_TAB(*d))
3096 char minus = (PL_tokenbuf[0] == '-');
3097 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3105 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3110 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3115 if (PL_oldoldbufptr == PL_last_lop)
3116 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3118 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3121 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3123 /* This hack is to get the ${} in the message. */
3125 yyerror("syntax error");
3128 OPERATOR(HASHBRACK);
3130 /* This hack serves to disambiguate a pair of curlies
3131 * as being a block or an anon hash. Normally, expectation
3132 * determines that, but in cases where we're not in a
3133 * position to expect anything in particular (like inside
3134 * eval"") we have to resolve the ambiguity. This code
3135 * covers the case where the first term in the curlies is a
3136 * quoted string. Most other cases need to be explicitly
3137 * disambiguated by prepending a `+' before the opening
3138 * curly in order to force resolution as an anon hash.
3140 * XXX should probably propagate the outer expectation
3141 * into eval"" to rely less on this hack, but that could
3142 * potentially break current behavior of eval"".
3146 if (*s == '\'' || *s == '"' || *s == '`') {
3147 /* common case: get past first string, handling escapes */
3148 for (t++; t < PL_bufend && *t != *s;)
3149 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3153 else if (*s == 'q') {
3156 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3160 char open, close, term;
3163 while (t < PL_bufend && isSPACE(*t))
3167 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3171 for (t++; t < PL_bufend; t++) {
3172 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3174 else if (*t == open)
3178 for (t++; t < PL_bufend; t++) {
3179 if (*t == '\\' && t+1 < PL_bufend)
3181 else if (*t == close && --brackets <= 0)
3183 else if (*t == open)
3189 else if (isALNUM_lazy_if(t,UTF)) {
3191 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3194 while (t < PL_bufend && isSPACE(*t))
3196 /* if comma follows first term, call it an anon hash */
3197 /* XXX it could be a comma expression with loop modifiers */
3198 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3199 || (*t == '=' && t[1] == '>')))
3200 OPERATOR(HASHBRACK);
3201 if (PL_expect == XREF)
3204 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3210 yylval.ival = CopLINE(PL_curcop);
3211 if (isSPACE(*s) || *s == '#')
3212 PL_copline = NOLINE; /* invalidate current command line number */
3217 if (PL_lex_brackets <= 0)
3218 yyerror("Unmatched right curly bracket");
3220 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3221 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3222 PL_lex_formbrack = 0;
3223 if (PL_lex_state == LEX_INTERPNORMAL) {
3224 if (PL_lex_brackets == 0) {
3225 if (PL_expect & XFAKEBRACK) {
3226 PL_expect &= XENUMMASK;
3227 PL_lex_state = LEX_INTERPEND;
3229 return yylex(); /* ignore fake brackets */
3231 if (*s == '-' && s[1] == '>')
3232 PL_lex_state = LEX_INTERPENDMAYBE;
3233 else if (*s != '[' && *s != '{')
3234 PL_lex_state = LEX_INTERPEND;
3237 if (PL_expect & XFAKEBRACK) {
3238 PL_expect &= XENUMMASK;
3240 return yylex(); /* ignore fake brackets */
3250 if (PL_expect == XOPERATOR) {
3251 if (ckWARN(WARN_SEMICOLON)
3252 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3254 CopLINE_dec(PL_curcop);
3255 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3256 CopLINE_inc(PL_curcop);
3261 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3263 PL_expect = XOPERATOR;
3264 force_ident(PL_tokenbuf, '&');
3268 yylval.ival = (OPpENTERSUB_AMPER<<8);
3287 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3288 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3290 if (PL_expect == XSTATE && isALPHA(tmp) &&
3291 (s == PL_linestart+1 || s[-2] == '\n') )
3293 if (PL_in_eval && !PL_rsfp) {
3298 if (strnEQ(s,"=cut",4)) {
3312 PL_doextract = TRUE;
3315 if (PL_lex_brackets < PL_lex_formbrack) {
3317 #ifdef PERL_STRICT_CR
3318 for (t = s; SPACE_OR_TAB(*t); t++) ;
3320 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3322 if (*t == '\n' || *t == '#') {
3340 if (PL_expect != XOPERATOR) {
3341 if (s[1] != '<' && !strchr(s,'>'))
3344 s = scan_heredoc(s);
3346 s = scan_inputsymbol(s);
3347 TERM(sublex_start());
3352 SHop(OP_LEFT_SHIFT);
3366 SHop(OP_RIGHT_SHIFT);
3375 if (PL_expect == XOPERATOR) {
3376 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3379 return ','; /* grandfather non-comma-format format */
3383 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3384 PL_tokenbuf[0] = '@';
3385 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3386 sizeof PL_tokenbuf - 1, FALSE);
3387 if (PL_expect == XOPERATOR)
3388 no_op("Array length", s);
3389 if (!PL_tokenbuf[1])
3391 PL_expect = XOPERATOR;
3392 PL_pending_ident = '#';
3396 PL_tokenbuf[0] = '$';
3397 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3398 sizeof PL_tokenbuf - 1, FALSE);
3399 if (PL_expect == XOPERATOR)
3401 if (!PL_tokenbuf[1]) {
3403 yyerror("Final $ should be \\$ or $name");
3407 /* This kludge not intended to be bulletproof. */
3408 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3409 yylval.opval = newSVOP(OP_CONST, 0,
3410 newSViv(PL_compiling.cop_arybase));
3411 yylval.opval->op_private = OPpCONST_ARYBASE;
3417 if (PL_lex_state == LEX_NORMAL)
3420 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3423 PL_tokenbuf[0] = '@';
3424 if (ckWARN(WARN_SYNTAX)) {
3426 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3429 PL_bufptr = skipspace(PL_bufptr);
3430 while (t < PL_bufend && *t != ']')
3432 Perl_warner(aTHX_ WARN_SYNTAX,
3433 "Multidimensional syntax %.*s not supported",
3434 (t - PL_bufptr) + 1, PL_bufptr);
3438 else if (*s == '{') {
3439 PL_tokenbuf[0] = '%';
3440 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3441 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3443 char tmpbuf[sizeof PL_tokenbuf];
3445 for (t++; isSPACE(*t); t++) ;
3446 if (isIDFIRST_lazy_if(t,UTF)) {
3447 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3448 for (; isSPACE(*t); t++) ;
3449 if (*t == ';' && get_cv(tmpbuf, FALSE))
3450 Perl_warner(aTHX_ WARN_SYNTAX,
3451 "You need to quote \"%s\"", tmpbuf);
3457 PL_expect = XOPERATOR;
3458 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3459 bool islop = (PL_last_lop == PL_oldoldbufptr);
3460 if (!islop || PL_last_lop_op == OP_GREPSTART)
3461 PL_expect = XOPERATOR;
3462 else if (strchr("$@\"'`q", *s))
3463 PL_expect = XTERM; /* e.g. print $fh "foo" */
3464 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3465 PL_expect = XTERM; /* e.g. print $fh &sub */
3466 else if (isIDFIRST_lazy_if(s,UTF)) {
3467 char tmpbuf[sizeof PL_tokenbuf];
3468 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3469 if ((tmp = keyword(tmpbuf, len))) {
3470 /* binary operators exclude handle interpretations */
3482 PL_expect = XTERM; /* e.g. print $fh length() */
3487 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3488 if (gv && GvCVu(gv))
3489 PL_expect = XTERM; /* e.g. print $fh subr() */
3492 else if (isDIGIT(*s))
3493 PL_expect = XTERM; /* e.g. print $fh 3 */
3494 else if (*s == '.' && isDIGIT(s[1]))
3495 PL_expect = XTERM; /* e.g. print $fh .3 */
3496 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3497 PL_expect = XTERM; /* e.g. print $fh -1 */
3498 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3499 PL_expect = XTERM; /* print $fh <<"EOF" */
3501 PL_pending_ident = '$';
3505 if (PL_expect == XOPERATOR)
3507 PL_tokenbuf[0] = '@';
3508 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3509 if (!PL_tokenbuf[1]) {
3511 yyerror("Final @ should be \\@ or @name");
3514 if (PL_lex_state == LEX_NORMAL)
3516 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3518 PL_tokenbuf[0] = '%';
3520 /* Warn about @ where they meant $. */
3521 if (ckWARN(WARN_SYNTAX)) {
3522 if (*s == '[' || *s == '{') {
3524 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3526 if (*t == '}' || *t == ']') {
3528 PL_bufptr = skipspace(PL_bufptr);
3529 Perl_warner(aTHX_ WARN_SYNTAX,
3530 "Scalar value %.*s better written as $%.*s",
3531 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3536 PL_pending_ident = '@';
3539 case '/': /* may either be division or pattern */
3540 case '?': /* may either be conditional or pattern */
3541 if (PL_expect != XOPERATOR) {
3542 /* Disable warning on "study /blah/" */
3543 if (PL_oldoldbufptr == PL_last_uni
3544 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3545 || memNE(PL_last_uni, "study", 5)
3546 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3548 s = scan_pat(s,OP_MATCH);
3549 TERM(sublex_start());
3557 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3558 #ifdef PERL_STRICT_CR
3561 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3563 && (s == PL_linestart || s[-1] == '\n') )
3565 PL_lex_formbrack = 0;
3569 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3575 yylval.ival = OPf_SPECIAL;
3581 if (PL_expect != XOPERATOR)
3586 case '0': case '1': case '2': case '3': case '4':
3587 case '5': case '6': case '7': case '8': case '9':
3588 s = scan_num(s, &yylval);
3589 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3590 "### Saw number in '%s'\n", s);
3592 if (PL_expect == XOPERATOR)
3597 s = scan_str(s,FALSE,FALSE);
3598 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3599 "### Saw string before '%s'\n", s);
3601 if (PL_expect == XOPERATOR) {
3602 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3605 return ','; /* grandfather non-comma-format format */
3611 missingterm((char*)0);
3612 yylval.ival = OP_CONST;
3613 TERM(sublex_start());
3616 s = scan_str(s,FALSE,FALSE);
3617 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3618 "### Saw string before '%s'\n", s);
3620 if (PL_expect == XOPERATOR) {
3621 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3624 return ','; /* grandfather non-comma-format format */
3630 missingterm((char*)0);
3631 yylval.ival = OP_CONST;
3632 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3633 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3634 yylval.ival = OP_STRINGIFY;
3638 TERM(sublex_start());
3641 s = scan_str(s,FALSE,FALSE);
3642 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3643 "### Saw backtick string before '%s'\n", s);
3645 if (PL_expect == XOPERATOR)
3646 no_op("Backticks",s);
3648 missingterm((char*)0);
3649 yylval.ival = OP_BACKTICK;
3651 TERM(sublex_start());
3655 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3656 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3658 if (PL_expect == XOPERATOR)
3659 no_op("Backslash",s);
3663 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3667 while (isDIGIT(*start) || *start == '_')
3669 if (*start == '.' && isDIGIT(start[1])) {
3670 s = scan_num(s, &yylval);
3673 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3674 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3678 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3681 s = scan_num(s, &yylval);
3688 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3727 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3729 /* Some keywords can be followed by any delimiter, including ':' */
3730 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3731 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3732 (PL_tokenbuf[0] == 'q' &&
3733 strchr("qwxr", PL_tokenbuf[1])))));
3735 /* x::* is just a word, unless x is "CORE" */
3736 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3740 while (d < PL_bufend && isSPACE(*d))
3741 d++; /* no comments skipped here, or s### is misparsed */
3743 /* Is this a label? */
3744 if (!tmp && PL_expect == XSTATE
3745 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3747 yylval.pval = savepv(PL_tokenbuf);
3752 /* Check for keywords */
3753 tmp = keyword(PL_tokenbuf, len);
3755 /* Is this a word before a => operator? */
3756 if (*d == '=' && d[1] == '>') {
3758 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3759 yylval.opval->op_private = OPpCONST_BARE;
3760 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3761 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3765 if (tmp < 0) { /* second-class keyword? */
3766 GV *ogv = Nullgv; /* override (winner) */
3767 GV *hgv = Nullgv; /* hidden (loser) */
3768 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3770 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3773 if (GvIMPORTED_CV(gv))
3775 else if (! CvMETHOD(cv))
3779 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3780 (gv = *gvp) != (GV*)&PL_sv_undef &&
3781 GvCVu(gv) && GvIMPORTED_CV(gv))
3787 tmp = 0; /* overridden by import or by GLOBAL */
3790 && -tmp==KEY_lock /* XXX generalizable kludge */
3792 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3794 tmp = 0; /* any sub overrides "weak" keyword */
3796 else { /* no override */
3800 if (ckWARN(WARN_AMBIGUOUS) && hgv
3801 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3802 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3803 "Ambiguous call resolved as CORE::%s(), %s",
3804 GvENAME(hgv), "qualify as such or use &");
3811 default: /* not a keyword */
3815 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3817 /* Get the rest if it looks like a package qualifier */
3819 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3821 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3824 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3825 *s == '\'' ? "'" : "::");
3830 if (PL_expect == XOPERATOR) {
3831 if (PL_bufptr == PL_linestart) {
3832 CopLINE_dec(PL_curcop);
3833 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3834 CopLINE_inc(PL_curcop);
3837 no_op("Bareword",s);
3840 /* Look for a subroutine with this name in current package,
3841 unless name is "Foo::", in which case Foo is a bearword
3842 (and a package name). */
3845 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3847 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3848 Perl_warner(aTHX_ WARN_BAREWORD,
3849 "Bareword \"%s\" refers to nonexistent package",
3852 PL_tokenbuf[len] = '\0';
3859 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3862 /* if we saw a global override before, get the right name */
3865 sv = newSVpvn("CORE::GLOBAL::",14);
3866 sv_catpv(sv,PL_tokenbuf);
3869 sv = newSVpv(PL_tokenbuf,0);
3871 /* Presume this is going to be a bareword of some sort. */
3874 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3875 yylval.opval->op_private = OPpCONST_BARE;
3877 /* And if "Foo::", then that's what it certainly is. */
3882 /* See if it's the indirect object for a list operator. */
3884 if (PL_oldoldbufptr &&
3885 PL_oldoldbufptr < PL_bufptr &&
3886 (PL_oldoldbufptr == PL_last_lop
3887 || PL_oldoldbufptr == PL_last_uni) &&
3888 /* NO SKIPSPACE BEFORE HERE! */
3889 (PL_expect == XREF ||
3890 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3892 bool immediate_paren = *s == '(';
3894 /* (Now we can afford to cross potential line boundary.) */
3897 /* Two barewords in a row may indicate method call. */
3899 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3902 /* If not a declared subroutine, it's an indirect object. */
3903 /* (But it's an indir obj regardless for sort.) */
3905 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3906 ((!gv || !GvCVu(gv)) &&
3907 (PL_last_lop_op != OP_MAPSTART &&
3908 PL_last_lop_op != OP_GREPSTART))))
3910 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3915 PL_expect = XOPERATOR;
3918 /* Is this a word before a => operator? */
3919 if (*s == '=' && s[1] == '>' && !pkgname) {
3921 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3922 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3923 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3927 /* If followed by a paren, it's certainly a subroutine. */
3930 if (gv && GvCVu(gv)) {
3931 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3932 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3937 PL_nextval[PL_nexttoke].opval = yylval.opval;
3938 PL_expect = XOPERATOR;
3944 /* If followed by var or block, call it a method (unless sub) */
3946 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3947 PL_last_lop = PL_oldbufptr;
3948 PL_last_lop_op = OP_METHOD;
3952 /* If followed by a bareword, see if it looks like indir obj. */
3954 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3957 /* Not a method, so call it a subroutine (if defined) */
3959 if (gv && GvCVu(gv)) {
3961 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3962 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3963 "Ambiguous use of -%s resolved as -&%s()",
3964 PL_tokenbuf, PL_tokenbuf);
3965 /* Check for a constant sub */
3967 if ((sv = cv_const_sv(cv))) {
3969 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3970 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3971 yylval.opval->op_private = 0;
3975 /* Resolve to GV now. */
3976 op_free(yylval.opval);
3977 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3978 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3979 PL_last_lop = PL_oldbufptr;
3980 PL_last_lop_op = OP_ENTERSUB;
3981 /* Is there a prototype? */
3984 char *proto = SvPV((SV*)cv, len);
3987 if (strEQ(proto, "$"))
3989 if (*proto == '&' && *s == '{') {
3990 sv_setpv(PL_subname,"__ANON__");
3994 PL_nextval[PL_nexttoke].opval = yylval.opval;
4000 /* Call it a bare word */
4002 if (PL_hints & HINT_STRICT_SUBS)
4003 yylval.opval->op_private |= OPpCONST_STRICT;
4006 if (ckWARN(WARN_RESERVED)) {
4007 if (lastchar != '-') {
4008 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4009 if (!*d && strNE(PL_tokenbuf,"main"))
4010 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
4017 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4018 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4019 "Operator or semicolon missing before %c%s",
4020 lastchar, PL_tokenbuf);
4021 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4022 "Ambiguous use of %c resolved as operator %c",
4023 lastchar, lastchar);
4029 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4030 newSVpv(CopFILE(PL_curcop),0));
4034 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4035 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4038 case KEY___PACKAGE__:
4039 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4041 ? newSVsv(PL_curstname)
4050 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4051 char *pname = "main";
4052 if (PL_tokenbuf[2] == 'D')
4053 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4054 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4057 GvIOp(gv) = newIO();
4058 IoIFP(GvIOp(gv)) = PL_rsfp;
4059 #if defined(HAS_FCNTL) && defined(F_SETFD)
4061 int fd = PerlIO_fileno(PL_rsfp);
4062 fcntl(fd,F_SETFD,fd >= 3);
4065 /* Mark this internal pseudo-handle as clean */
4066 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4068 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4069 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4070 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4072 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4073 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4074 /* if the script was opened in binmode, we need to revert
4075 * it to text mode for compatibility; but only iff it has CRs
4076 * XXX this is a questionable hack at best. */
4077 if (PL_bufend-PL_bufptr > 2
4078 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4081 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4082 loc = PerlIO_tell(PL_rsfp);
4083 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4086 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4088 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4089 #endif /* NETWARE */
4090 #ifdef PERLIO_IS_STDIO /* really? */
4091 # if defined(__BORLANDC__)
4092 /* XXX see note in do_binmode() */
4093 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4097 PerlIO_seek(PL_rsfp, loc, 0);
4101 #ifdef PERLIO_LAYERS
4102 if (UTF && !IN_BYTES)
4103 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4116 if (PL_expect == XSTATE) {
4123 if (*s == ':' && s[1] == ':') {
4126 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4127 if (!(tmp = keyword(PL_tokenbuf, len)))
4128 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4142 LOP(OP_ACCEPT,XTERM);
4148 LOP(OP_ATAN2,XTERM);
4154 LOP(OP_BINMODE,XTERM);
4157 LOP(OP_BLESS,XTERM);
4166 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4183 if (!PL_cryptseen) {
4184 PL_cryptseen = TRUE;
4188 LOP(OP_CRYPT,XTERM);
4191 LOP(OP_CHMOD,XTERM);
4194 LOP(OP_CHOWN,XTERM);
4197 LOP(OP_CONNECT,XTERM);
4213 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4217 PL_hints |= HINT_BLOCK_SCOPE;
4227 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4228 LOP(OP_DBMOPEN,XTERM);
4234 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4241 yylval.ival = CopLINE(PL_curcop);
4255 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4256 UNIBRACK(OP_ENTEREVAL);
4271 case KEY_endhostent:
4277 case KEY_endservent:
4280 case KEY_endprotoent:
4291 yylval.ival = CopLINE(PL_curcop);
4293 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4295 if ((PL_bufend - p) >= 3 &&
4296 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4298 else if ((PL_bufend - p) >= 4 &&
4299 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4302 if (isIDFIRST_lazy_if(p,UTF)) {
4303 p = scan_ident(p, PL_bufend,
4304 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4308 Perl_croak(aTHX_ "Missing $ on loop variable");
4313 LOP(OP_FORMLINE,XTERM);
4319 LOP(OP_FCNTL,XTERM);
4325 LOP(OP_FLOCK,XTERM);
4334 LOP(OP_GREPSTART, XREF);
4337 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4352 case KEY_getpriority:
4353 LOP(OP_GETPRIORITY,XTERM);
4355 case KEY_getprotobyname:
4358 case KEY_getprotobynumber:
4359 LOP(OP_GPBYNUMBER,XTERM);
4361 case KEY_getprotoent:
4373 case KEY_getpeername:
4374 UNI(OP_GETPEERNAME);
4376 case KEY_gethostbyname:
4379 case KEY_gethostbyaddr:
4380 LOP(OP_GHBYADDR,XTERM);
4382 case KEY_gethostent:
4385 case KEY_getnetbyname:
4388 case KEY_getnetbyaddr:
4389 LOP(OP_GNBYADDR,XTERM);
4394 case KEY_getservbyname:
4395 LOP(OP_GSBYNAME,XTERM);
4397 case KEY_getservbyport:
4398 LOP(OP_GSBYPORT,XTERM);
4400 case KEY_getservent:
4403 case KEY_getsockname:
4404 UNI(OP_GETSOCKNAME);
4406 case KEY_getsockopt:
4407 LOP(OP_GSOCKOPT,XTERM);
4429 yylval.ival = CopLINE(PL_curcop);
4433 LOP(OP_INDEX,XTERM);
4439 LOP(OP_IOCTL,XTERM);
4451 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4483 LOP(OP_LISTEN,XTERM);
4492 s = scan_pat(s,OP_MATCH);
4493 TERM(sublex_start());
4496 LOP(OP_MAPSTART, XREF);
4499 LOP(OP_MKDIR,XTERM);
4502 LOP(OP_MSGCTL,XTERM);
4505 LOP(OP_MSGGET,XTERM);
4508 LOP(OP_MSGRCV,XTERM);
4511 LOP(OP_MSGSND,XTERM);
4517 if (isIDFIRST_lazy_if(s,UTF)) {
4518 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4519 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4521 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4522 if (!PL_in_my_stash) {
4525 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4533 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4540 if (PL_expect != XSTATE)
4541 yyerror("\"no\" not allowed in expression");
4542 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4543 s = force_version(s, FALSE);
4548 if (*s == '(' || (s = skipspace(s), *s == '('))
4555 if (isIDFIRST_lazy_if(s,UTF)) {
4557 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4559 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4560 Perl_warner(aTHX_ WARN_PRECEDENCE,
4561 "Precedence problem: open %.*s should be open(%.*s)",
4567 yylval.ival = OP_OR;
4577 LOP(OP_OPEN_DIR,XTERM);
4580 checkcomma(s,PL_tokenbuf,"filehandle");
4584 checkcomma(s,PL_tokenbuf,"filehandle");
4603 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4607 LOP(OP_PIPE_OP,XTERM);
4610 s = scan_str(s,FALSE,FALSE);
4612 missingterm((char*)0);
4613 yylval.ival = OP_CONST;
4614 TERM(sublex_start());
4620 s = scan_str(s,FALSE,FALSE);
4622 missingterm((char*)0);
4624 if (SvCUR(PL_lex_stuff)) {
4627 d = SvPV_force(PL_lex_stuff, len);
4630 for (; isSPACE(*d) && len; --len, ++d) ;
4633 if (!warned && ckWARN(WARN_QW)) {
4634 for (; !isSPACE(*d) && len; --len, ++d) {
4636 Perl_warner(aTHX_ WARN_QW,
4637 "Possible attempt to separate words with commas");
4640 else if (*d == '#') {
4641 Perl_warner(aTHX_ WARN_QW,
4642 "Possible attempt to put comments in qw() list");
4648 for (; !isSPACE(*d) && len; --len, ++d) ;
4650 sv = newSVpvn(b, d-b);
4651 if (DO_UTF8(PL_lex_stuff))
4653 words = append_elem(OP_LIST, words,
4654 newSVOP(OP_CONST, 0, tokeq(sv)));
4658 PL_nextval[PL_nexttoke].opval = words;
4663 SvREFCNT_dec(PL_lex_stuff);
4664 PL_lex_stuff = Nullsv;
4670 s = scan_str(s,FALSE,FALSE);
4672 missingterm((char*)0);
4673 yylval.ival = OP_STRINGIFY;
4674 if (SvIVX(PL_lex_stuff) == '\'')
4675 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4676 TERM(sublex_start());
4679 s = scan_pat(s,OP_QR);
4680 TERM(sublex_start());
4683 s = scan_str(s,FALSE,FALSE);
4685 missingterm((char*)0);
4686 yylval.ival = OP_BACKTICK;
4688 TERM(sublex_start());
4696 s = force_version(s, FALSE);
4698 else if (*s != 'v' || !isDIGIT(s[1])
4699 || (s = force_version(s, TRUE), *s == 'v'))
4701 *PL_tokenbuf = '\0';
4702 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4703 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4704 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4706 yyerror("<> should be quotes");
4714 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4718 LOP(OP_RENAME,XTERM);
4727 LOP(OP_RINDEX,XTERM);
4750 LOP(OP_REVERSE,XTERM);
4761 TERM(sublex_start());
4763 TOKEN(1); /* force error */
4772 LOP(OP_SELECT,XTERM);
4778 LOP(OP_SEMCTL,XTERM);
4781 LOP(OP_SEMGET,XTERM);
4784 LOP(OP_SEMOP,XTERM);
4790 LOP(OP_SETPGRP,XTERM);
4792 case KEY_setpriority:
4793 LOP(OP_SETPRIORITY,XTERM);
4795 case KEY_sethostent:
4801 case KEY_setservent:
4804 case KEY_setprotoent:
4814 LOP(OP_SEEKDIR,XTERM);
4816 case KEY_setsockopt:
4817 LOP(OP_SSOCKOPT,XTERM);
4823 LOP(OP_SHMCTL,XTERM);
4826 LOP(OP_SHMGET,XTERM);
4829 LOP(OP_SHMREAD,XTERM);
4832 LOP(OP_SHMWRITE,XTERM);
4835 LOP(OP_SHUTDOWN,XTERM);
4844 LOP(OP_SOCKET,XTERM);
4846 case KEY_socketpair:
4847 LOP(OP_SOCKPAIR,XTERM);
4850 checkcomma(s,PL_tokenbuf,"subroutine name");
4852 if (*s == ';' || *s == ')') /* probably a close */
4853 Perl_croak(aTHX_ "sort is now a reserved word");
4855 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4859 LOP(OP_SPLIT,XTERM);
4862 LOP(OP_SPRINTF,XTERM);
4865 LOP(OP_SPLICE,XTERM);
4880 LOP(OP_SUBSTR,XTERM);
4886 char tmpbuf[sizeof PL_tokenbuf];
4887 SSize_t tboffset = 0;
4888 expectation attrful;
4889 bool have_name, have_proto;
4894 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4895 (*s == ':' && s[1] == ':'))
4898 attrful = XATTRBLOCK;
4899 /* remember buffer pos'n for later force_word */
4900 tboffset = s - PL_oldbufptr;
4901 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4902 if (strchr(tmpbuf, ':'))
4903 sv_setpv(PL_subname, tmpbuf);
4905 sv_setsv(PL_subname,PL_curstname);
4906 sv_catpvn(PL_subname,"::",2);
4907 sv_catpvn(PL_subname,tmpbuf,len);
4914 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4915 PL_expect = XTERMBLOCK;
4916 attrful = XATTRTERM;
4917 sv_setpv(PL_subname,"?");
4921 if (key == KEY_format) {
4923 PL_lex_formbrack = PL_lex_brackets + 1;
4925 (void) force_word(PL_oldbufptr + tboffset, WORD,
4930 /* Look for a prototype */
4934 s = scan_str(s,FALSE,FALSE);
4936 Perl_croak(aTHX_ "Prototype not terminated");
4938 d = SvPVX(PL_lex_stuff);
4940 for (p = d; *p; ++p) {
4945 SvCUR(PL_lex_stuff) = tmp;
4953 if (*s == ':' && s[1] != ':')
4954 PL_expect = attrful;
4957 PL_nextval[PL_nexttoke].opval =
4958 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4959 PL_lex_stuff = Nullsv;
4963 sv_setpv(PL_subname,"__ANON__");
4966 (void) force_word(PL_oldbufptr + tboffset, WORD,
4975 LOP(OP_SYSTEM,XREF);
4978 LOP(OP_SYMLINK,XTERM);
4981 LOP(OP_SYSCALL,XTERM);
4984 LOP(OP_SYSOPEN,XTERM);
4987 LOP(OP_SYSSEEK,XTERM);
4990 LOP(OP_SYSREAD,XTERM);
4993 LOP(OP_SYSWRITE,XTERM);
4997 TERM(sublex_start());
5018 LOP(OP_TRUNCATE,XTERM);
5030 yylval.ival = CopLINE(PL_curcop);
5034 yylval.ival = CopLINE(PL_curcop);
5038 LOP(OP_UNLINK,XTERM);
5044 LOP(OP_UNPACK,XTERM);
5047 LOP(OP_UTIME,XTERM);
5053 LOP(OP_UNSHIFT,XTERM);
5056 if (PL_expect != XSTATE)
5057 yyerror("\"use\" not allowed in expression");
5059 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5060 s = force_version(s, TRUE);
5061 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5062 PL_nextval[PL_nexttoke].opval = Nullop;
5065 else if (*s == 'v') {
5066 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5067 s = force_version(s, FALSE);
5071 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5072 s = force_version(s, FALSE);
5084 yylval.ival = CopLINE(PL_curcop);
5088 PL_hints |= HINT_BLOCK_SCOPE;
5095 LOP(OP_WAITPID,XTERM);
5103 static char ctl_l[2];
5105 if (ctl_l[0] == '\0')
5106 ctl_l[0] = toCTRL('L');
5107 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5110 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5115 if (PL_expect == XOPERATOR)
5121 yylval.ival = OP_XOR;
5126 TERM(sublex_start());
5131 #pragma segment Main
5135 S_pending_ident(pTHX)
5139 /* pit holds the identifier we read and pending_ident is reset */
5140 char pit = PL_pending_ident;
5141 PL_pending_ident = 0;
5143 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5144 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5146 /* if we're in a my(), we can't allow dynamics here.
5147 $foo'bar has already been turned into $foo::bar, so
5148 just check for colons.
5150 if it's a legal name, the OP is a PADANY.
5153 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5154 if (strchr(PL_tokenbuf,':'))
5155 yyerror(Perl_form(aTHX_ "No package name allowed for "
5156 "variable %s in \"our\"",
5158 tmp = pad_allocmy(PL_tokenbuf);
5161 if (strchr(PL_tokenbuf,':'))
5162 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5164 yylval.opval = newOP(OP_PADANY, 0);
5165 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5171 build the ops for accesses to a my() variable.
5173 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5174 then used in a comparison. This catches most, but not
5175 all cases. For instance, it catches
5176 sort { my($a); $a <=> $b }
5178 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5179 (although why you'd do that is anyone's guess).
5182 if (!strchr(PL_tokenbuf,':')) {
5183 #ifdef USE_5005THREADS
5184 /* Check for single character per-thread SVs */
5185 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5186 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5187 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5189 yylval.opval = newOP(OP_THREADSV, 0);
5190 yylval.opval->op_targ = tmp;
5193 #endif /* USE_5005THREADS */
5194 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5195 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5196 /* might be an "our" variable" */
5197 if (SvFLAGS(namesv) & SVpad_OUR) {
5198 /* build ops for a bareword */
5199 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5200 sv_catpvn(sym, "::", 2);
5201 sv_catpv(sym, PL_tokenbuf+1);
5202 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5203 yylval.opval->op_private = OPpCONST_ENTERED;
5204 gv_fetchpv(SvPVX(sym),
5206 ? (GV_ADDMULTI | GV_ADDINEVAL)
5209 ((PL_tokenbuf[0] == '$') ? SVt_PV
5210 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5215 /* if it's a sort block and they're naming $a or $b */
5216 if (PL_last_lop_op == OP_SORT &&
5217 PL_tokenbuf[0] == '$' &&
5218 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5221 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5222 d < PL_bufend && *d != '\n';
5225 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5226 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5232 yylval.opval = newOP(OP_PADANY, 0);
5233 yylval.opval->op_targ = tmp;
5239 Whine if they've said @foo in a doublequoted string,
5240 and @foo isn't a variable we can find in the symbol
5243 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5244 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5245 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5246 && ckWARN(WARN_AMBIGUOUS))
5248 /* Downgraded from fatal to warning 20000522 mjd */
5249 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5250 "Possible unintended interpolation of %s in string",
5255 /* build ops for a bareword */
5256 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5257 yylval.opval->op_private = OPpCONST_ENTERED;
5258 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5259 ((PL_tokenbuf[0] == '$') ? SVt_PV
5260 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5266 Perl_keyword(pTHX_ register char *d, I32 len)
5271 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5272 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5273 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5274 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5275 if (strEQ(d,"__END__")) return KEY___END__;
5279 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5284 if (strEQ(d,"and")) return -KEY_and;
5285 if (strEQ(d,"abs")) return -KEY_abs;
5288 if (strEQ(d,"alarm")) return -KEY_alarm;
5289 if (strEQ(d,"atan2")) return -KEY_atan2;
5292 if (strEQ(d,"accept")) return -KEY_accept;
5297 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5300 if (strEQ(d,"bless")) return -KEY_bless;
5301 if (strEQ(d,"bind")) return -KEY_bind;
5302 if (strEQ(d,"binmode")) return -KEY_binmode;
5305 if (strEQ(d,"CORE")) return -KEY_CORE;
5306 if (strEQ(d,"CHECK")) return KEY_CHECK;
5311 if (strEQ(d,"cmp")) return -KEY_cmp;
5312 if (strEQ(d,"chr")) return -KEY_chr;
5313 if (strEQ(d,"cos")) return -KEY_cos;
5316 if (strEQ(d,"chop")) return -KEY_chop;
5319 if (strEQ(d,"close")) return -KEY_close;
5320 if (strEQ(d,"chdir")) return -KEY_chdir;
5321 if (strEQ(d,"chomp")) return -KEY_chomp;
5322 if (strEQ(d,"chmod")) return -KEY_chmod;
5323 if (strEQ(d,"chown")) return -KEY_chown;
5324 if (strEQ(d,"crypt")) return -KEY_crypt;
5327 if (strEQ(d,"chroot")) return -KEY_chroot;
5328 if (strEQ(d,"caller")) return -KEY_caller;
5331 if (strEQ(d,"connect")) return -KEY_connect;
5334 if (strEQ(d,"closedir")) return -KEY_closedir;
5335 if (strEQ(d,"continue")) return -KEY_continue;
5340 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5345 if (strEQ(d,"do")) return KEY_do;
5348 if (strEQ(d,"die")) return -KEY_die;
5351 if (strEQ(d,"dump")) return -KEY_dump;
5354 if (strEQ(d,"delete")) return KEY_delete;
5357 if (strEQ(d,"defined")) return KEY_defined;
5358 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5361 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5366 if (strEQ(d,"END")) return KEY_END;
5371 if (strEQ(d,"eq")) return -KEY_eq;
5374 if (strEQ(d,"eof")) return -KEY_eof;
5375 if (strEQ(d,"exp")) return -KEY_exp;
5378 if (strEQ(d,"else")) return KEY_else;
5379 if (strEQ(d,"exit")) return -KEY_exit;
5380 if (strEQ(d,"eval")) return KEY_eval;
5381 if (strEQ(d,"exec")) return -KEY_exec;
5382 if (strEQ(d,"each")) return -KEY_each;
5385 if (strEQ(d,"elsif")) return KEY_elsif;
5388 if (strEQ(d,"exists")) return KEY_exists;
5389 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5392 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5393 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5396 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5399 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5400 if (strEQ(d,"endservent")) return -KEY_endservent;
5403 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5410 if (strEQ(d,"for")) return KEY_for;
5413 if (strEQ(d,"fork")) return -KEY_fork;
5416 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5417 if (strEQ(d,"flock")) return -KEY_flock;
5420 if (strEQ(d,"format")) return KEY_format;
5421 if (strEQ(d,"fileno")) return -KEY_fileno;
5424 if (strEQ(d,"foreach")) return KEY_foreach;
5427 if (strEQ(d,"formline")) return -KEY_formline;
5432 if (strnEQ(d,"get",3)) {
5437 if (strEQ(d,"ppid")) return -KEY_getppid;
5438 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5441 if (strEQ(d,"pwent")) return -KEY_getpwent;
5442 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5443 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5446 if (strEQ(d,"peername")) return -KEY_getpeername;
5447 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5448 if (strEQ(d,"priority")) return -KEY_getpriority;
5451 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5454 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5458 else if (*d == 'h') {
5459 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5460 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5461 if (strEQ(d,"hostent")) return -KEY_gethostent;
5463 else if (*d == 'n') {
5464 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5465 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5466 if (strEQ(d,"netent")) return -KEY_getnetent;
5468 else if (*d == 's') {
5469 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5470 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5471 if (strEQ(d,"servent")) return -KEY_getservent;
5472 if (strEQ(d,"sockname")) return -KEY_getsockname;
5473 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5475 else if (*d == 'g') {
5476 if (strEQ(d,"grent")) return -KEY_getgrent;
5477 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5478 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5480 else if (*d == 'l') {
5481 if (strEQ(d,"login")) return -KEY_getlogin;
5483 else if (strEQ(d,"c")) return -KEY_getc;
5488 if (strEQ(d,"gt")) return -KEY_gt;
5489 if (strEQ(d,"ge")) return -KEY_ge;
5492 if (strEQ(d,"grep")) return KEY_grep;
5493 if (strEQ(d,"goto")) return KEY_goto;
5494 if (strEQ(d,"glob")) return KEY_glob;
5497 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5502 if (strEQ(d,"hex")) return -KEY_hex;
5505 if (strEQ(d,"INIT")) return KEY_INIT;
5510 if (strEQ(d,"if")) return KEY_if;
5513 if (strEQ(d,"int")) return -KEY_int;
5516 if (strEQ(d,"index")) return -KEY_index;
5517 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5522 if (strEQ(d,"join")) return -KEY_join;
5526 if (strEQ(d,"keys")) return -KEY_keys;
5527 if (strEQ(d,"kill")) return -KEY_kill;
5533 if (strEQ(d,"lt")) return -KEY_lt;
5534 if (strEQ(d,"le")) return -KEY_le;
5535 if (strEQ(d,"lc")) return -KEY_lc;
5538 if (strEQ(d,"log")) return -KEY_log;
5541 if (strEQ(d,"last")) return KEY_last;
5542 if (strEQ(d,"link")) return -KEY_link;
5543 if (strEQ(d,"lock")) return -KEY_lock;
5546 if (strEQ(d,"local")) return KEY_local;
5547 if (strEQ(d,"lstat")) return -KEY_lstat;
5550 if (strEQ(d,"length")) return -KEY_length;
5551 if (strEQ(d,"listen")) return -KEY_listen;
5554 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5557 if (strEQ(d,"localtime")) return -KEY_localtime;
5563 case 1: return KEY_m;
5565 if (strEQ(d,"my")) return KEY_my;
5568 if (strEQ(d,"map")) return KEY_map;
5571 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5574 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5575 if (strEQ(d,"msgget")) return -KEY_msgget;
5576 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5577 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5582 if (strEQ(d,"next")) return KEY_next;
5583 if (strEQ(d,"ne")) return -KEY_ne;
5584 if (strEQ(d,"not")) return -KEY_not;
5585 if (strEQ(d,"no")) return KEY_no;
5590 if (strEQ(d,"or")) return -KEY_or;
5593 if (strEQ(d,"ord")) return -KEY_ord;
5594 if (strEQ(d,"oct")) return -KEY_oct;
5595 if (strEQ(d,"our")) return KEY_our;
5598 if (strEQ(d,"open")) return -KEY_open;
5601 if (strEQ(d,"opendir")) return -KEY_opendir;
5608 if (strEQ(d,"pop")) return -KEY_pop;
5609 if (strEQ(d,"pos")) return KEY_pos;
5612 if (strEQ(d,"push")) return -KEY_push;
5613 if (strEQ(d,"pack")) return -KEY_pack;
5614 if (strEQ(d,"pipe")) return -KEY_pipe;
5617 if (strEQ(d,"print")) return KEY_print;
5620 if (strEQ(d,"printf")) return KEY_printf;
5623 if (strEQ(d,"package")) return KEY_package;
5626 if (strEQ(d,"prototype")) return KEY_prototype;
5631 if (strEQ(d,"q")) return KEY_q;
5632 if (strEQ(d,"qr")) return KEY_qr;
5633 if (strEQ(d,"qq")) return KEY_qq;
5634 if (strEQ(d,"qw")) return KEY_qw;
5635 if (strEQ(d,"qx")) return KEY_qx;
5637 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5642 if (strEQ(d,"ref")) return -KEY_ref;
5645 if (strEQ(d,"read")) return -KEY_read;
5646 if (strEQ(d,"rand")) return -KEY_rand;
5647 if (strEQ(d,"recv")) return -KEY_recv;
5648 if (strEQ(d,"redo")) return KEY_redo;
5651 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5652 if (strEQ(d,"reset")) return -KEY_reset;
5655 if (strEQ(d,"return")) return KEY_return;
5656 if (strEQ(d,"rename")) return -KEY_rename;
5657 if (strEQ(d,"rindex")) return -KEY_rindex;
5660 if (strEQ(d,"require")) return KEY_require;
5661 if (strEQ(d,"reverse")) return -KEY_reverse;
5662 if (strEQ(d,"readdir")) return -KEY_readdir;
5665 if (strEQ(d,"readlink")) return -KEY_readlink;
5666 if (strEQ(d,"readline")) return -KEY_readline;
5667 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5670 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5676 case 0: return KEY_s;
5678 if (strEQ(d,"scalar")) return KEY_scalar;
5683 if (strEQ(d,"seek")) return -KEY_seek;
5684 if (strEQ(d,"send")) return -KEY_send;
5687 if (strEQ(d,"semop")) return -KEY_semop;
5690 if (strEQ(d,"select")) return -KEY_select;
5691 if (strEQ(d,"semctl")) return -KEY_semctl;
5692 if (strEQ(d,"semget")) return -KEY_semget;
5695 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5696 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5699 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5700 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5703 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5706 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5707 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5708 if (strEQ(d,"setservent")) return -KEY_setservent;
5711 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5712 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5719 if (strEQ(d,"shift")) return -KEY_shift;
5722 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5723 if (strEQ(d,"shmget")) return -KEY_shmget;
5726 if (strEQ(d,"shmread")) return -KEY_shmread;
5729 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5730 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5735 if (strEQ(d,"sin")) return -KEY_sin;
5738 if (strEQ(d,"sleep")) return -KEY_sleep;
5741 if (strEQ(d,"sort")) return KEY_sort;
5742 if (strEQ(d,"socket")) return -KEY_socket;
5743 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5746 if (strEQ(d,"split")) return KEY_split;
5747 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5748 if (strEQ(d,"splice")) return -KEY_splice;
5751 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5754 if (strEQ(d,"srand")) return -KEY_srand;
5757 if (strEQ(d,"stat")) return -KEY_stat;
5758 if (strEQ(d,"study")) return KEY_study;
5761 if (strEQ(d,"substr")) return -KEY_substr;
5762 if (strEQ(d,"sub")) return KEY_sub;
5767 if (strEQ(d,"system")) return -KEY_system;
5770 if (strEQ(d,"symlink")) return -KEY_symlink;
5771 if (strEQ(d,"syscall")) return -KEY_syscall;
5772 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5773 if (strEQ(d,"sysread")) return -KEY_sysread;
5774 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5777 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5786 if (strEQ(d,"tr")) return KEY_tr;
5789 if (strEQ(d,"tie")) return KEY_tie;
5792 if (strEQ(d,"tell")) return -KEY_tell;
5793 if (strEQ(d,"tied")) return KEY_tied;
5794 if (strEQ(d,"time")) return -KEY_time;
5797 if (strEQ(d,"times")) return -KEY_times;
5800 if (strEQ(d,"telldir")) return -KEY_telldir;
5803 if (strEQ(d,"truncate")) return -KEY_truncate;
5810 if (strEQ(d,"uc")) return -KEY_uc;
5813 if (strEQ(d,"use")) return KEY_use;
5816 if (strEQ(d,"undef")) return KEY_undef;
5817 if (strEQ(d,"until")) return KEY_until;
5818 if (strEQ(d,"untie")) return KEY_untie;
5819 if (strEQ(d,"utime")) return -KEY_utime;
5820 if (strEQ(d,"umask")) return -KEY_umask;
5823 if (strEQ(d,"unless")) return KEY_unless;
5824 if (strEQ(d,"unpack")) return -KEY_unpack;
5825 if (strEQ(d,"unlink")) return -KEY_unlink;
5828 if (strEQ(d,"unshift")) return -KEY_unshift;
5829 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5834 if (strEQ(d,"values")) return -KEY_values;
5835 if (strEQ(d,"vec")) return -KEY_vec;
5840 if (strEQ(d,"warn")) return -KEY_warn;
5841 if (strEQ(d,"wait")) return -KEY_wait;
5844 if (strEQ(d,"while")) return KEY_while;
5845 if (strEQ(d,"write")) return -KEY_write;
5848 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5851 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5856 if (len == 1) return -KEY_x;
5857 if (strEQ(d,"xor")) return -KEY_xor;
5860 if (len == 1) return KEY_y;
5869 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5873 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5874 if (ckWARN(WARN_SYNTAX)) {
5876 for (w = s+2; *w && level; w++) {
5883 for (; *w && isSPACE(*w); w++) ;
5884 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5885 Perl_warner(aTHX_ WARN_SYNTAX,
5886 "%s (...) interpreted as function",name);
5889 while (s < PL_bufend && isSPACE(*s))
5893 while (s < PL_bufend && isSPACE(*s))
5895 if (isIDFIRST_lazy_if(s,UTF)) {
5897 while (isALNUM_lazy_if(s,UTF))
5899 while (s < PL_bufend && isSPACE(*s))
5904 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5908 Perl_croak(aTHX_ "No comma allowed after %s", what);
5913 /* Either returns sv, or mortalizes sv and returns a new SV*.
5914 Best used as sv=new_constant(..., sv, ...).
5915 If s, pv are NULL, calls subroutine with one argument,
5916 and type is used with error messages only. */
5919 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5923 HV *table = GvHV(PL_hintgv); /* ^H */
5927 const char *why1, *why2, *why3;
5929 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5932 why2 = strEQ(key,"charnames")
5933 ? "(possibly a missing \"use charnames ...\")"
5935 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5936 (type ? type: "undef"), why2);
5938 /* This is convoluted and evil ("goto considered harmful")
5939 * but I do not understand the intricacies of all the different
5940 * failure modes of %^H in here. The goal here is to make
5941 * the most probable error message user-friendly. --jhi */
5946 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5947 (type ? type: "undef"), why1, why2, why3);
5949 yyerror(SvPVX(msg));
5953 cvp = hv_fetch(table, key, strlen(key), FALSE);
5954 if (!cvp || !SvOK(*cvp)) {
5957 why3 = "} is not defined";
5960 sv_2mortal(sv); /* Parent created it permanently */
5963 pv = sv_2mortal(newSVpvn(s, len));
5965 typesv = sv_2mortal(newSVpv(type, 0));
5967 typesv = &PL_sv_undef;
5969 PUSHSTACKi(PERLSI_OVERLOAD);
5981 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5985 /* Check the eval first */
5986 if (!PL_in_eval && SvTRUE(ERRSV)) {
5988 sv_catpv(ERRSV, "Propagated");
5989 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5991 res = SvREFCNT_inc(sv);
5995 (void)SvREFCNT_inc(res);
6004 why1 = "Call to &{$^H{";
6006 why3 = "}} did not return a defined value";
6015 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6017 register char *d = dest;
6018 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6021 Perl_croak(aTHX_ ident_too_long);
6022 if (isALNUM(*s)) /* UTF handled below */
6024 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6029 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6033 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6034 char *t = s + UTF8SKIP(s);
6035 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6037 if (d + (t - s) > e)
6038 Perl_croak(aTHX_ ident_too_long);
6039 Copy(s, d, t - s, char);
6052 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6062 e = d + destlen - 3; /* two-character token, ending NUL */
6064 while (isDIGIT(*s)) {
6066 Perl_croak(aTHX_ ident_too_long);
6073 Perl_croak(aTHX_ ident_too_long);
6074 if (isALNUM(*s)) /* UTF handled below */
6076 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6081 else if (*s == ':' && s[1] == ':') {
6085 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6086 char *t = s + UTF8SKIP(s);
6087 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6089 if (d + (t - s) > e)
6090 Perl_croak(aTHX_ ident_too_long);
6091 Copy(s, d, t - s, char);
6102 if (PL_lex_state != LEX_NORMAL)
6103 PL_lex_state = LEX_INTERPENDMAYBE;
6106 if (*s == '$' && s[1] &&
6107 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6120 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6125 if (isSPACE(s[-1])) {
6128 if (!SPACE_OR_TAB(ch)) {
6134 if (isIDFIRST_lazy_if(d,UTF)) {
6138 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6140 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6143 Copy(s, d, e - s, char);
6148 while ((isALNUM(*s) || *s == ':') && d < e)
6151 Perl_croak(aTHX_ ident_too_long);
6154 while (s < send && SPACE_OR_TAB(*s)) s++;
6155 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6156 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6157 const char *brack = *s == '[' ? "[...]" : "{...}";
6158 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6159 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6160 funny, dest, brack, funny, dest, brack);
6163 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6167 /* Handle extended ${^Foo} variables
6168 * 1999-02-27 mjd-perl-patch@plover.com */
6169 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6173 while (isALNUM(*s) && d < e) {
6177 Perl_croak(aTHX_ ident_too_long);
6182 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6183 PL_lex_state = LEX_INTERPEND;
6186 if (PL_lex_state == LEX_NORMAL) {
6187 if (ckWARN(WARN_AMBIGUOUS) &&
6188 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6190 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6191 "Ambiguous use of %c{%s} resolved to %c%s",
6192 funny, dest, funny, dest);
6197 s = bracket; /* let the parser handle it */
6201 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6202 PL_lex_state = LEX_INTERPEND;
6207 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6212 *pmfl |= PMf_GLOBAL;
6214 *pmfl |= PMf_CONTINUE;
6218 *pmfl |= PMf_MULTILINE;
6220 *pmfl |= PMf_SINGLELINE;
6222 *pmfl |= PMf_EXTENDED;
6226 S_scan_pat(pTHX_ char *start, I32 type)
6231 s = scan_str(start,FALSE,FALSE);
6233 Perl_croak(aTHX_ "Search pattern not terminated");
6235 pm = (PMOP*)newPMOP(type, 0);
6236 if (PL_multi_open == '?')
6237 pm->op_pmflags |= PMf_ONCE;
6239 while (*s && strchr("iomsx", *s))
6240 pmflag(&pm->op_pmflags,*s++);
6243 while (*s && strchr("iogcmsx", *s))
6244 pmflag(&pm->op_pmflags,*s++);
6246 pm->op_pmpermflags = pm->op_pmflags;
6248 PL_lex_op = (OP*)pm;
6249 yylval.ival = OP_MATCH;
6254 S_scan_subst(pTHX_ char *start)
6261 yylval.ival = OP_NULL;
6263 s = scan_str(start,FALSE,FALSE);
6266 Perl_croak(aTHX_ "Substitution pattern not terminated");
6268 if (s[-1] == PL_multi_open)
6271 first_start = PL_multi_start;
6272 s = scan_str(s,FALSE,FALSE);
6275 SvREFCNT_dec(PL_lex_stuff);
6276 PL_lex_stuff = Nullsv;
6278 Perl_croak(aTHX_ "Substitution replacement not terminated");
6280 PL_multi_start = first_start; /* so whole substitution is taken together */
6282 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6288 else if (strchr("iogcmsx", *s))
6289 pmflag(&pm->op_pmflags,*s++);
6296 PL_sublex_info.super_bufptr = s;
6297 PL_sublex_info.super_bufend = PL_bufend;
6299 pm->op_pmflags |= PMf_EVAL;
6300 repl = newSVpvn("",0);
6302 sv_catpv(repl, es ? "eval " : "do ");
6303 sv_catpvn(repl, "{ ", 2);
6304 sv_catsv(repl, PL_lex_repl);
6305 sv_catpvn(repl, " };", 2);
6307 SvREFCNT_dec(PL_lex_repl);
6311 pm->op_pmpermflags = pm->op_pmflags;
6312 PL_lex_op = (OP*)pm;
6313 yylval.ival = OP_SUBST;
6318 S_scan_trans(pTHX_ char *start)
6327 yylval.ival = OP_NULL;
6329 s = scan_str(start,FALSE,FALSE);
6331 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6332 if (s[-1] == PL_multi_open)
6335 s = scan_str(s,FALSE,FALSE);
6338 SvREFCNT_dec(PL_lex_stuff);
6339 PL_lex_stuff = Nullsv;
6341 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6344 complement = del = squash = 0;
6345 while (strchr("cds", *s)) {
6347 complement = OPpTRANS_COMPLEMENT;
6349 del = OPpTRANS_DELETE;
6351 squash = OPpTRANS_SQUASH;
6355 New(803, tbl, complement&&!del?258:256, short);
6356 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6357 o->op_private = del|squash|complement|
6358 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6359 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6362 yylval.ival = OP_TRANS;
6367 S_scan_heredoc(pTHX_ register char *s)
6370 I32 op_type = OP_SCALAR;
6377 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6381 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6384 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6385 if (*peek && strchr("`'\"",*peek)) {
6388 s = delimcpy(d, e, s, PL_bufend, term, &len);
6398 if (!isALNUM_lazy_if(s,UTF))
6399 deprecate("bare << to mean <<\"\"");
6400 for (; isALNUM_lazy_if(s,UTF); s++) {
6405 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6406 Perl_croak(aTHX_ "Delimiter for here document is too long");
6409 len = d - PL_tokenbuf;
6410 #ifndef PERL_STRICT_CR
6411 d = strchr(s, '\r');
6415 while (s < PL_bufend) {
6421 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6430 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6435 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6436 herewas = newSVpvn(s,PL_bufend-s);
6438 s--, herewas = newSVpvn(s,d-s);
6439 s += SvCUR(herewas);
6441 tmpstr = NEWSV(87,79);
6442 sv_upgrade(tmpstr, SVt_PVIV);
6447 else if (term == '`') {
6448 op_type = OP_BACKTICK;
6449 SvIVX(tmpstr) = '\\';
6453 PL_multi_start = CopLINE(PL_curcop);
6454 PL_multi_open = PL_multi_close = '<';
6455 term = *PL_tokenbuf;
6456 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6457 char *bufptr = PL_sublex_info.super_bufptr;
6458 char *bufend = PL_sublex_info.super_bufend;
6459 char *olds = s - SvCUR(herewas);
6460 s = strchr(bufptr, '\n');
6464 while (s < bufend &&
6465 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6467 CopLINE_inc(PL_curcop);
6470 CopLINE_set(PL_curcop, PL_multi_start);
6471 missingterm(PL_tokenbuf);
6473 sv_setpvn(herewas,bufptr,d-bufptr+1);
6474 sv_setpvn(tmpstr,d+1,s-d);
6476 sv_catpvn(herewas,s,bufend-s);
6477 (void)strcpy(bufptr,SvPVX(herewas));
6484 while (s < PL_bufend &&
6485 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6487 CopLINE_inc(PL_curcop);
6489 if (s >= PL_bufend) {
6490 CopLINE_set(PL_curcop, PL_multi_start);
6491 missingterm(PL_tokenbuf);
6493 sv_setpvn(tmpstr,d+1,s-d);
6495 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6497 sv_catpvn(herewas,s,PL_bufend-s);
6498 sv_setsv(PL_linestr,herewas);
6499 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6500 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6501 PL_last_lop = PL_last_uni = Nullch;
6504 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6505 while (s >= PL_bufend) { /* multiple line string? */
6507 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6508 CopLINE_set(PL_curcop, PL_multi_start);
6509 missingterm(PL_tokenbuf);
6511 CopLINE_inc(PL_curcop);
6512 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6513 PL_last_lop = PL_last_uni = Nullch;
6514 #ifndef PERL_STRICT_CR
6515 if (PL_bufend - PL_linestart >= 2) {
6516 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6517 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6519 PL_bufend[-2] = '\n';
6521 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6523 else if (PL_bufend[-1] == '\r')
6524 PL_bufend[-1] = '\n';
6526 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6527 PL_bufend[-1] = '\n';
6529 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6530 SV *sv = NEWSV(88,0);
6532 sv_upgrade(sv, SVt_PVMG);
6533 sv_setsv(sv,PL_linestr);
6534 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6536 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6539 sv_catsv(PL_linestr,herewas);
6540 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6544 sv_catsv(tmpstr,PL_linestr);
6549 PL_multi_end = CopLINE(PL_curcop);
6550 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6551 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6552 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6554 SvREFCNT_dec(herewas);
6555 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6557 PL_lex_stuff = tmpstr;
6558 yylval.ival = op_type;
6563 takes: current position in input buffer
6564 returns: new position in input buffer
6565 side-effects: yylval and lex_op are set.
6570 <FH> read from filehandle
6571 <pkg::FH> read from package qualified filehandle
6572 <pkg'FH> read from package qualified filehandle
6573 <$fh> read from filehandle in $fh
6579 S_scan_inputsymbol(pTHX_ char *start)
6581 register char *s = start; /* current position in buffer */
6587 d = PL_tokenbuf; /* start of temp holding space */
6588 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6589 end = strchr(s, '\n');
6592 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6594 /* die if we didn't have space for the contents of the <>,
6595 or if it didn't end, or if we see a newline
6598 if (len >= sizeof PL_tokenbuf)
6599 Perl_croak(aTHX_ "Excessively long <> operator");
6601 Perl_croak(aTHX_ "Unterminated <> operator");
6606 Remember, only scalar variables are interpreted as filehandles by
6607 this code. Anything more complex (e.g., <$fh{$num}>) will be
6608 treated as a glob() call.
6609 This code makes use of the fact that except for the $ at the front,
6610 a scalar variable and a filehandle look the same.
6612 if (*d == '$' && d[1]) d++;
6614 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6615 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6618 /* If we've tried to read what we allow filehandles to look like, and
6619 there's still text left, then it must be a glob() and not a getline.
6620 Use scan_str to pull out the stuff between the <> and treat it
6621 as nothing more than a string.
6624 if (d - PL_tokenbuf != len) {
6625 yylval.ival = OP_GLOB;
6627 s = scan_str(start,FALSE,FALSE);
6629 Perl_croak(aTHX_ "Glob not terminated");
6633 /* we're in a filehandle read situation */
6636 /* turn <> into <ARGV> */
6638 (void)strcpy(d,"ARGV");
6640 /* if <$fh>, create the ops to turn the variable into a
6646 /* try to find it in the pad for this block, otherwise find
6647 add symbol table ops
6649 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6650 OP *o = newOP(OP_PADSV, 0);
6652 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6655 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6656 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6657 newUNOP(OP_RV2SV, 0,
6658 newGVOP(OP_GV, 0, gv)));
6660 PL_lex_op->op_flags |= OPf_SPECIAL;
6661 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6662 yylval.ival = OP_NULL;
6665 /* If it's none of the above, it must be a literal filehandle
6666 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6668 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6669 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6670 yylval.ival = OP_NULL;
6679 takes: start position in buffer
6680 keep_quoted preserve \ on the embedded delimiter(s)
6681 keep_delims preserve the delimiters around the string
6682 returns: position to continue reading from buffer
6683 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6684 updates the read buffer.
6686 This subroutine pulls a string out of the input. It is called for:
6687 q single quotes q(literal text)
6688 ' single quotes 'literal text'
6689 qq double quotes qq(interpolate $here please)
6690 " double quotes "interpolate $here please"
6691 qx backticks qx(/bin/ls -l)
6692 ` backticks `/bin/ls -l`
6693 qw quote words @EXPORT_OK = qw( func() $spam )
6694 m// regexp match m/this/
6695 s/// regexp substitute s/this/that/
6696 tr/// string transliterate tr/this/that/
6697 y/// string transliterate y/this/that/
6698 ($*@) sub prototypes sub foo ($)
6699 (stuff) sub attr parameters sub foo : attr(stuff)
6700 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6702 In most of these cases (all but <>, patterns and transliterate)
6703 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6704 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6705 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6708 It skips whitespace before the string starts, and treats the first
6709 character as the delimiter. If the delimiter is one of ([{< then
6710 the corresponding "close" character )]}> is used as the closing
6711 delimiter. It allows quoting of delimiters, and if the string has
6712 balanced delimiters ([{<>}]) it allows nesting.
6714 On success, the SV with the resulting string is put into lex_stuff or,
6715 if that is already non-NULL, into lex_repl. The second case occurs only
6716 when parsing the RHS of the special constructs s/// and tr/// (y///).
6717 For convenience, the terminating delimiter character is stuffed into
6722 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6724 SV *sv; /* scalar value: string */
6725 char *tmps; /* temp string, used for delimiter matching */
6726 register char *s = start; /* current position in the buffer */
6727 register char term; /* terminating character */
6728 register char *to; /* current position in the sv's data */
6729 I32 brackets = 1; /* bracket nesting level */
6730 bool has_utf8 = FALSE; /* is there any utf8 content? */
6732 /* skip space before the delimiter */
6736 /* mark where we are, in case we need to report errors */
6739 /* after skipping whitespace, the next character is the terminator */
6741 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6744 /* mark where we are */
6745 PL_multi_start = CopLINE(PL_curcop);
6746 PL_multi_open = term;
6748 /* find corresponding closing delimiter */
6749 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6751 PL_multi_close = term;
6753 /* create a new SV to hold the contents. 87 is leak category, I'm
6754 assuming. 79 is the SV's initial length. What a random number. */
6756 sv_upgrade(sv, SVt_PVIV);
6758 (void)SvPOK_only(sv); /* validate pointer */
6760 /* move past delimiter and try to read a complete string */
6762 sv_catpvn(sv, s, 1);
6765 /* extend sv if need be */
6766 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6767 /* set 'to' to the next character in the sv's string */
6768 to = SvPVX(sv)+SvCUR(sv);
6770 /* if open delimiter is the close delimiter read unbridle */
6771 if (PL_multi_open == PL_multi_close) {
6772 for (; s < PL_bufend; s++,to++) {
6773 /* embedded newlines increment the current line number */
6774 if (*s == '\n' && !PL_rsfp)
6775 CopLINE_inc(PL_curcop);
6776 /* handle quoted delimiters */
6777 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6778 if (!keep_quoted && s[1] == term)
6780 /* any other quotes are simply copied straight through */
6784 /* terminate when run out of buffer (the for() condition), or
6785 have found the terminator */
6786 else if (*s == term)
6788 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6794 /* if the terminator isn't the same as the start character (e.g.,
6795 matched brackets), we have to allow more in the quoting, and
6796 be prepared for nested brackets.
6799 /* read until we run out of string, or we find the terminator */
6800 for (; s < PL_bufend; s++,to++) {
6801 /* embedded newlines increment the line count */
6802 if (*s == '\n' && !PL_rsfp)
6803 CopLINE_inc(PL_curcop);
6804 /* backslashes can escape the open or closing characters */
6805 if (*s == '\\' && s+1 < PL_bufend) {
6807 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6812 /* allow nested opens and closes */
6813 else if (*s == PL_multi_close && --brackets <= 0)
6815 else if (*s == PL_multi_open)
6817 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6822 /* terminate the copied string and update the sv's end-of-string */
6824 SvCUR_set(sv, to - SvPVX(sv));
6827 * this next chunk reads more into the buffer if we're not done yet
6831 break; /* handle case where we are done yet :-) */
6833 #ifndef PERL_STRICT_CR
6834 if (to - SvPVX(sv) >= 2) {
6835 if ((to[-2] == '\r' && to[-1] == '\n') ||
6836 (to[-2] == '\n' && to[-1] == '\r'))
6840 SvCUR_set(sv, to - SvPVX(sv));
6842 else if (to[-1] == '\r')
6845 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6849 /* if we're out of file, or a read fails, bail and reset the current
6850 line marker so we can report where the unterminated string began
6853 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6855 CopLINE_set(PL_curcop, PL_multi_start);
6858 /* we read a line, so increment our line counter */
6859 CopLINE_inc(PL_curcop);
6861 /* update debugger info */
6862 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6863 SV *sv = NEWSV(88,0);
6865 sv_upgrade(sv, SVt_PVMG);
6866 sv_setsv(sv,PL_linestr);
6867 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6870 /* having changed the buffer, we must update PL_bufend */
6871 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6872 PL_last_lop = PL_last_uni = Nullch;
6875 /* at this point, we have successfully read the delimited string */
6878 sv_catpvn(sv, s, 1);
6881 PL_multi_end = CopLINE(PL_curcop);
6884 /* if we allocated too much space, give some back */
6885 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6886 SvLEN_set(sv, SvCUR(sv) + 1);
6887 Renew(SvPVX(sv), SvLEN(sv), char);
6890 /* decide whether this is the first or second quoted string we've read
6903 takes: pointer to position in buffer
6904 returns: pointer to new position in buffer
6905 side-effects: builds ops for the constant in yylval.op
6907 Read a number in any of the formats that Perl accepts:
6909 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
6910 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
6913 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
6915 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6918 If it reads a number without a decimal point or an exponent, it will
6919 try converting the number to an integer and see if it can do so
6920 without loss of precision.
6924 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6926 register char *s = start; /* current position in buffer */
6927 register char *d; /* destination in temp buffer */
6928 register char *e; /* end of temp buffer */
6929 NV nv; /* number read, as a double */
6930 SV *sv = Nullsv; /* place to put the converted number */
6931 bool floatit; /* boolean: int or float? */
6932 char *lastub = 0; /* position of last underbar */
6933 static char number_too_long[] = "Number too long";
6935 /* We use the first character to decide what type of number this is */
6939 Perl_croak(aTHX_ "panic: scan_num");
6941 /* if it starts with a 0, it could be an octal number, a decimal in
6942 0.13 disguise, or a hexadecimal number, or a binary number. */
6946 u holds the "number so far"
6947 shift the power of 2 of the base
6948 (hex == 4, octal == 3, binary == 1)
6949 overflowed was the number more than we can hold?
6951 Shift is used when we add a digit. It also serves as an "are
6952 we in octal/hex/binary?" indicator to disallow hex characters
6958 bool overflowed = FALSE;
6959 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6960 static char* bases[5] = { "", "binary", "", "octal",
6962 static char* Bases[5] = { "", "Binary", "", "Octal",
6964 static char *maxima[5] = { "",
6965 "0b11111111111111111111111111111111",
6969 char *base, *Base, *max;
6975 } else if (s[1] == 'b') {
6979 /* check for a decimal in disguise */
6980 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6982 /* so it must be octal */
6989 if (ckWARN(WARN_SYNTAX))
6990 Perl_warner(aTHX_ WARN_SYNTAX,
6991 "Misplaced _ in number");
6995 base = bases[shift];
6996 Base = Bases[shift];
6997 max = maxima[shift];
6999 /* read the rest of the number */
7001 /* x is used in the overflow test,
7002 b is the digit we're adding on. */
7007 /* if we don't mention it, we're done */
7011 /* _ are ignored -- but warned about if consecutive */
7013 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7014 Perl_warner(aTHX_ WARN_SYNTAX,
7015 "Misplaced _ in number");
7019 /* 8 and 9 are not octal */
7022 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7026 case '2': case '3': case '4':
7027 case '5': case '6': case '7':
7029 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7033 b = *s++ & 15; /* ASCII digit -> value of digit */
7037 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7038 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7039 /* make sure they said 0x */
7044 /* Prepare to put the digit we have onto the end
7045 of the number so far. We check for overflows.
7050 x = u << shift; /* make room for the digit */
7052 if ((x >> shift) != u
7053 && !(PL_hints & HINT_NEW_BINARY)) {
7056 if (ckWARN_d(WARN_OVERFLOW))
7057 Perl_warner(aTHX_ WARN_OVERFLOW,
7058 "Integer overflow in %s number",
7061 u = x | b; /* add the digit to the end */
7064 n *= nvshift[shift];
7065 /* If an NV has not enough bits in its
7066 * mantissa to represent an UV this summing of
7067 * small low-order numbers is a waste of time
7068 * (because the NV cannot preserve the
7069 * low-order bits anyway): we could just
7070 * remember when did we overflow and in the
7071 * end just multiply n by the right
7079 /* if we get here, we had success: make a scalar value from
7084 /* final misplaced underbar check */
7086 if (ckWARN(WARN_SYNTAX))
7087 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7092 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7093 Perl_warner(aTHX_ WARN_PORTABLE,
7094 "%s number > %s non-portable",
7100 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7101 Perl_warner(aTHX_ WARN_PORTABLE,
7102 "%s number > %s non-portable",
7107 if (PL_hints & HINT_NEW_BINARY)
7108 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7113 handle decimal numbers.
7114 we're also sent here when we read a 0 as the first digit
7116 case '1': case '2': case '3': case '4': case '5':
7117 case '6': case '7': case '8': case '9': case '.':
7120 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7123 /* read next group of digits and _ and copy into d */
7124 while (isDIGIT(*s) || *s == '_') {
7125 /* skip underscores, checking for misplaced ones
7129 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7130 Perl_warner(aTHX_ WARN_SYNTAX,
7131 "Misplaced _ in number");
7135 /* check for end of fixed-length buffer */
7137 Perl_croak(aTHX_ number_too_long);
7138 /* if we're ok, copy the character */
7143 /* final misplaced underbar check */
7144 if (lastub && s == lastub + 1) {
7145 if (ckWARN(WARN_SYNTAX))
7146 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7149 /* read a decimal portion if there is one. avoid
7150 3..5 being interpreted as the number 3. followed
7153 if (*s == '.' && s[1] != '.') {
7158 if (ckWARN(WARN_SYNTAX))
7159 Perl_warner(aTHX_ WARN_SYNTAX,
7160 "Misplaced _ in number");
7164 /* copy, ignoring underbars, until we run out of digits.
7166 for (; isDIGIT(*s) || *s == '_'; s++) {
7167 /* fixed length buffer check */
7169 Perl_croak(aTHX_ number_too_long);
7171 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7172 Perl_warner(aTHX_ WARN_SYNTAX,
7173 "Misplaced _ in number");
7179 /* fractional part ending in underbar? */
7181 if (ckWARN(WARN_SYNTAX))
7182 Perl_warner(aTHX_ WARN_SYNTAX,
7183 "Misplaced _ in number");
7185 if (*s == '.' && isDIGIT(s[1])) {
7186 /* oops, it's really a v-string, but without the "v" */
7192 /* read exponent part, if present */
7193 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7197 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7198 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7200 /* stray preinitial _ */
7202 if (ckWARN(WARN_SYNTAX))
7203 Perl_warner(aTHX_ WARN_SYNTAX,
7204 "Misplaced _ in number");
7208 /* allow positive or negative exponent */
7209 if (*s == '+' || *s == '-')
7212 /* stray initial _ */
7214 if (ckWARN(WARN_SYNTAX))
7215 Perl_warner(aTHX_ WARN_SYNTAX,
7216 "Misplaced _ in number");
7220 /* read digits of exponent */
7221 while (isDIGIT(*s) || *s == '_') {
7224 Perl_croak(aTHX_ number_too_long);
7228 if (ckWARN(WARN_SYNTAX) &&
7229 ((lastub && s == lastub + 1) ||
7230 (!isDIGIT(s[1]) && s[1] != '_')))
7231 Perl_warner(aTHX_ WARN_SYNTAX,
7232 "Misplaced _ in number");
7239 /* make an sv from the string */
7243 We try to do an integer conversion first if no characters
7244 indicating "float" have been found.
7249 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7251 if (flags == IS_NUMBER_IN_UV) {
7253 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7256 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7257 if (uv <= (UV) IV_MIN)
7258 sv_setiv(sv, -(IV)uv);
7265 /* terminate the string */
7267 nv = Atof(PL_tokenbuf);
7271 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7272 (PL_hints & HINT_NEW_INTEGER) )
7273 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7274 (floatit ? "float" : "integer"),
7278 /* if it starts with a v, it could be a v-string */
7284 while (isDIGIT(*pos) || *pos == '_')
7286 if (!isALPHA(*pos)) {
7288 U8 tmpbuf[UTF8_MAXLEN+1];
7290 s++; /* get past 'v' */
7293 sv_setpvn(sv, "", 0);
7296 if (*s == '0' && isDIGIT(s[1]))
7297 yyerror("Octal number in vector unsupported");
7300 /* this is atoi() that tolerates underscores */
7303 while (--end >= s) {
7308 rev += (*end - '0') * mult;
7310 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7311 Perl_warner(aTHX_ WARN_OVERFLOW,
7312 "Integer overflow in decimal number");
7315 /* Append native character for the rev point */
7316 tmpend = uvchr_to_utf8(tmpbuf, rev);
7317 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7318 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
7320 if (*pos == '.' && isDIGIT(pos[1]))
7326 while (isDIGIT(*pos) || *pos == '_')
7336 /* make the op for the constant and return */
7339 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7341 lvalp->opval = Nullop;
7347 S_scan_formline(pTHX_ register char *s)
7351 SV *stuff = newSVpvn("",0);
7352 bool needargs = FALSE;
7355 if (*s == '.' || *s == /*{*/'}') {
7357 #ifdef PERL_STRICT_CR
7358 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7360 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7362 if (*t == '\n' || t == PL_bufend)
7365 if (PL_in_eval && !PL_rsfp) {
7366 eol = strchr(s,'\n');
7371 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7373 for (t = s; t < eol; t++) {
7374 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7376 goto enough; /* ~~ must be first line in formline */
7378 if (*t == '@' || *t == '^')
7382 sv_catpvn(stuff, s, eol-s);
7383 #ifndef PERL_STRICT_CR
7384 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7385 char *end = SvPVX(stuff) + SvCUR(stuff);
7397 s = filter_gets(PL_linestr, PL_rsfp, 0);
7398 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7399 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7400 PL_last_lop = PL_last_uni = Nullch;
7403 yyerror("Format not terminated");
7413 PL_lex_state = LEX_NORMAL;
7414 PL_nextval[PL_nexttoke].ival = 0;
7418 PL_lex_state = LEX_FORMLINE;
7419 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7421 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7425 SvREFCNT_dec(stuff);
7426 PL_lex_formbrack = 0;
7437 PL_cshlen = strlen(PL_cshname);
7442 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7444 I32 oldsavestack_ix = PL_savestack_ix;
7445 CV* outsidecv = PL_compcv;
7449 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7451 SAVEI32(PL_subline);
7452 save_item(PL_subname);
7455 SAVESPTR(PL_comppad_name);
7456 SAVESPTR(PL_compcv);
7457 SAVEI32(PL_comppad_name_fill);
7458 SAVEI32(PL_min_intro_pending);
7459 SAVEI32(PL_max_intro_pending);
7460 SAVEI32(PL_pad_reset_pending);
7462 PL_compcv = (CV*)NEWSV(1104,0);
7463 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7464 CvFLAGS(PL_compcv) |= flags;
7466 PL_comppad = newAV();
7467 av_push(PL_comppad, Nullsv);
7468 PL_curpad = AvARRAY(PL_comppad);
7469 PL_comppad_name = newAV();
7470 PL_comppad_name_fill = 0;
7471 PL_min_intro_pending = 0;
7473 PL_subline = CopLINE(PL_curcop);
7474 #ifdef USE_5005THREADS
7475 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7476 PL_curpad[0] = (SV*)newAV();
7477 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7478 #endif /* USE_5005THREADS */
7480 comppadlist = newAV();
7481 AvREAL_off(comppadlist);
7482 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7483 av_store(comppadlist, 1, (SV*)PL_comppad);
7485 CvPADLIST(PL_compcv) = comppadlist;
7486 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7487 #ifdef USE_5005THREADS
7488 CvOWNER(PL_compcv) = 0;
7489 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7490 MUTEX_INIT(CvMUTEXP(PL_compcv));
7491 #endif /* USE_5005THREADS */
7493 return oldsavestack_ix;
7497 #pragma segment Perl_yylex
7500 Perl_yywarn(pTHX_ char *s)
7502 PL_in_eval |= EVAL_WARNONLY;
7504 PL_in_eval &= ~EVAL_WARNONLY;
7509 Perl_yyerror(pTHX_ char *s)
7512 char *context = NULL;
7516 if (!yychar || (yychar == ';' && !PL_rsfp))
7518 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7519 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7520 while (isSPACE(*PL_oldoldbufptr))
7522 context = PL_oldoldbufptr;
7523 contlen = PL_bufptr - PL_oldoldbufptr;
7525 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7526 PL_oldbufptr != PL_bufptr) {
7527 while (isSPACE(*PL_oldbufptr))
7529 context = PL_oldbufptr;
7530 contlen = PL_bufptr - PL_oldbufptr;
7532 else if (yychar > 255)
7533 where = "next token ???";
7534 #ifdef USE_PURE_BISON
7535 /* GNU Bison sets the value -2 */
7536 else if (yychar == -2) {
7538 else if ((yychar & 127) == 127) {
7540 if (PL_lex_state == LEX_NORMAL ||
7541 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7542 where = "at end of line";
7543 else if (PL_lex_inpat)
7544 where = "within pattern";
7546 where = "within string";
7549 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7551 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7552 else if (isPRINT_LC(yychar))
7553 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7555 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7556 where = SvPVX(where_sv);
7558 msg = sv_2mortal(newSVpv(s, 0));
7559 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7560 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7562 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7564 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7565 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7566 Perl_sv_catpvf(aTHX_ msg,
7567 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7568 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7571 if (PL_in_eval & EVAL_WARNONLY)
7572 Perl_warn(aTHX_ "%"SVf, msg);
7575 if (PL_error_count >= 10) {
7576 if (PL_in_eval && SvCUR(ERRSV))
7577 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7578 ERRSV, CopFILE(PL_curcop));
7580 Perl_croak(aTHX_ "%s has too many errors.\n",
7581 CopFILE(PL_curcop));
7584 PL_in_my_stash = Nullhv;
7588 #pragma segment Main
7592 S_swallow_bom(pTHX_ U8 *s)
7595 slen = SvCUR(PL_linestr);
7599 /* UTF-16 little-endian */
7600 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7601 Perl_croak(aTHX_ "Unsupported script encoding");
7602 #ifndef PERL_NO_UTF16_FILTER
7603 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7605 if (PL_bufend > (char*)s) {
7609 filter_add(utf16rev_textfilter, NULL);
7610 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7611 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7612 PL_bufend - (char*)s - 1,
7614 Copy(news, s, newlen, U8);
7615 SvCUR_set(PL_linestr, newlen);
7616 PL_bufend = SvPVX(PL_linestr) + newlen;
7617 news[newlen++] = '\0';
7621 Perl_croak(aTHX_ "Unsupported script encoding");
7626 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7627 #ifndef PERL_NO_UTF16_FILTER
7628 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7630 if (PL_bufend > (char *)s) {
7634 filter_add(utf16_textfilter, NULL);
7635 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7636 PL_bufend = (char*)utf16_to_utf8(s, news,
7637 PL_bufend - (char*)s,
7639 Copy(news, s, newlen, U8);
7640 SvCUR_set(PL_linestr, newlen);
7641 PL_bufend = SvPVX(PL_linestr) + newlen;
7642 news[newlen++] = '\0';
7646 Perl_croak(aTHX_ "Unsupported script encoding");
7651 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7652 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7657 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7658 s[2] == 0xFE && s[3] == 0xFF)
7660 Perl_croak(aTHX_ "Unsupported script encoding");
7668 * Restore a source filter.
7672 restore_rsfp(pTHX_ void *f)
7674 PerlIO *fp = (PerlIO*)f;
7676 if (PL_rsfp == PerlIO_stdin())
7677 PerlIO_clearerr(PL_rsfp);
7678 else if (PL_rsfp && (PL_rsfp != fp))
7679 PerlIO_close(PL_rsfp);
7683 #ifndef PERL_NO_UTF16_FILTER
7685 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7687 I32 count = FILTER_READ(idx+1, sv, maxlen);
7692 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7693 if (!*SvPV_nolen(sv))
7694 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7697 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7698 sv_usepvn(sv, (char*)tmps, tend - tmps);
7704 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7706 I32 count = FILTER_READ(idx+1, sv, maxlen);
7711 if (!*SvPV_nolen(sv))
7712 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7715 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7716 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7717 sv_usepvn(sv, (char*)tmps, tend - tmps);