3 * Copyright (c) 1991-2001, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
30 static void restore_rsfp(pTHXo_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
40 /* For now 'use utf8' does not affect tokenizer on EBCDIC */
41 #define UTF (PL_linestr && DO_UTF8(PL_linestr))
43 #define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
46 /* In variables name $^X, these are the legal values for X.
47 * 1999-02-27 mjd-perl-patch@plover.com */
48 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
50 /* On MacOS, respect nonbreaking spaces */
51 #ifdef MACOS_TRADITIONAL
52 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
57 /* LEX_* are values for PL_lex_state, the state of the lexer.
58 * They are arranged oddly so that the guard on the switch statement
59 * can get by with a single comparison (if the compiler is smart enough).
62 /* #define LEX_NOTPARSING 11 is done in perl.h. */
65 #define LEX_INTERPNORMAL 9
66 #define LEX_INTERPCASEMOD 8
67 #define LEX_INTERPPUSH 7
68 #define LEX_INTERPSTART 6
69 #define LEX_INTERPEND 5
70 #define LEX_INTERPENDMAYBE 4
71 #define LEX_INTERPCONCAT 3
72 #define LEX_INTERPCONST 2
73 #define LEX_FORMLINE 1
74 #define LEX_KNOWNEXT 0
82 # define YYMAXLEVEL 100
84 YYSTYPE* yylval_pointer[YYMAXLEVEL];
85 int* yychar_pointer[YYMAXLEVEL];
89 # define yylval (*yylval_pointer[yyactlevel])
90 # define yychar (*yychar_pointer[yyactlevel])
91 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
93 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
98 /* CLINE is a macro that ensures PL_copline has a sane value */
103 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
106 * Convenience functions to return different tokens and prime the
107 * lexer for the next token. They all take an argument.
109 * TOKEN : generic token (used for '(', DOLSHARP, etc)
110 * OPERATOR : generic operator
111 * AOPERATOR : assignment operator
112 * PREBLOCK : beginning the block after an if, while, foreach, ...
113 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
114 * PREREF : *EXPR where EXPR is not a simple identifier
115 * TERM : expression term
116 * LOOPX : loop exiting command (goto, last, dump, etc)
117 * FTST : file test operator
118 * FUN0 : zero-argument function
119 * FUN1 : not used, except for not, which isn't a UNIOP
120 * BOop : bitwise or or xor
122 * SHop : shift operator
123 * PWop : power operator
124 * PMop : pattern-matching operator
125 * Aop : addition-level operator
126 * Mop : multiplication-level operator
127 * Eop : equality-testing operator
128 * Rop : relational operator <= != gt
130 * Also see LOP and lop() below.
133 /* Note that REPORT() and REPORT2() will be expressions that supply
134 * their own trailing comma, not suitable for statements as such. */
135 #ifdef DEBUGGING /* Serve -DT. */
136 # define REPORT(x,retval) tokereport(x,s,(int)retval),
137 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
139 # define REPORT(x,retval)
140 # define REPORT2(x,retval)
143 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
144 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
145 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
146 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
147 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
148 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
149 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
150 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
151 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
152 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
153 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
154 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
155 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
156 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
157 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
158 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
159 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
160 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
161 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
162 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
164 /* This bit of chicanery makes a unary function followed by
165 * a parenthesis into a function with one argument, highest precedence.
167 #define UNI(f) return(yylval.ival = f, \
171 PL_last_uni = PL_oldbufptr, \
172 PL_last_lop_op = f, \
173 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
175 #define UNIBRACK(f) return(yylval.ival = f, \
178 PL_last_uni = PL_oldbufptr, \
179 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
181 /* grandfather return to old style */
182 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
185 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
189 report = newSVpv(thing, 0);
190 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
193 if (s - PL_bufptr > 0)
194 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
196 if (PL_oldbufptr && *PL_oldbufptr)
197 sv_catpv(report, PL_tokenbuf);
199 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
206 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
207 * into an OP_ANDASSIGN or OP_ORASSIGN
211 S_ao(pTHX_ int toketype)
213 if (*PL_bufptr == '=') {
215 if (toketype == ANDAND)
216 yylval.ival = OP_ANDASSIGN;
217 else if (toketype == OROR)
218 yylval.ival = OP_ORASSIGN;
226 * When Perl expects an operator and finds something else, no_op
227 * prints the warning. It always prints "<something> found where
228 * operator expected. It prints "Missing semicolon on previous line?"
229 * if the surprise occurs at the start of the line. "do you need to
230 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
231 * where the compiler doesn't know if foo is a method call or a function.
232 * It prints "Missing operator before end of line" if there's nothing
233 * after the missing operator, or "... before <...>" if there is something
234 * after the missing operator.
238 S_no_op(pTHX_ char *what, char *s)
240 char *oldbp = PL_bufptr;
241 bool is_first = (PL_oldbufptr == PL_linestart);
247 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
249 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
250 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
252 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
253 if (t < PL_bufptr && isSPACE(*t))
254 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
255 t - PL_oldoldbufptr, PL_oldoldbufptr);
259 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
266 * Complain about missing quote/regexp/heredoc terminator.
267 * If it's called with (char *)NULL then it cauterizes the line buffer.
268 * If we're in a delimited string and the delimiter is a control
269 * character, it's reformatted into a two-char sequence like ^C.
274 S_missingterm(pTHX_ char *s)
279 char *nl = strrchr(s,'\n');
285 iscntrl(PL_multi_close)
287 PL_multi_close < 32 || PL_multi_close == 127
291 tmpbuf[1] = toCTRL(PL_multi_close);
297 *tmpbuf = PL_multi_close;
301 q = strchr(s,'"') ? '\'' : '"';
302 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
310 Perl_deprecate(pTHX_ char *s)
312 if (ckWARN(WARN_DEPRECATED))
313 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
318 * Deprecate a comma-less variable list.
324 deprecate("comma-less variable list");
328 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
329 * utf16-to-utf8-reversed.
332 #ifdef PERL_CR_FILTER
336 register char *s = SvPVX(sv);
337 register char *e = s + SvCUR(sv);
338 /* outer loop optimized to do nothing if there are no CR-LFs */
340 if (*s++ == '\r' && *s == '\n') {
341 /* hit a CR-LF, need to copy the rest */
342 register char *d = s - 1;
345 if (*s == '\r' && s[1] == '\n')
356 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
358 I32 count = FILTER_READ(idx+1, sv, maxlen);
359 if (count > 0 && !maxlen)
367 * Initialize variables. Uses the Perl save_stack to save its state (for
368 * recursive calls to the parser).
372 Perl_lex_start(pTHX_ SV *line)
377 SAVEI32(PL_lex_dojoin);
378 SAVEI32(PL_lex_brackets);
379 SAVEI32(PL_lex_casemods);
380 SAVEI32(PL_lex_starts);
381 SAVEI32(PL_lex_state);
382 SAVEVPTR(PL_lex_inpat);
383 SAVEI32(PL_lex_inwhat);
384 if (PL_lex_state == LEX_KNOWNEXT) {
385 I32 toke = PL_nexttoke;
386 while (--toke >= 0) {
387 SAVEI32(PL_nexttype[toke]);
388 SAVEVPTR(PL_nextval[toke]);
390 SAVEI32(PL_nexttoke);
392 SAVECOPLINE(PL_curcop);
395 SAVEPPTR(PL_oldbufptr);
396 SAVEPPTR(PL_oldoldbufptr);
397 SAVEPPTR(PL_last_lop);
398 SAVEPPTR(PL_last_uni);
399 SAVEPPTR(PL_linestart);
400 SAVESPTR(PL_linestr);
401 SAVEPPTR(PL_lex_brackstack);
402 SAVEPPTR(PL_lex_casestack);
403 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
404 SAVESPTR(PL_lex_stuff);
405 SAVEI32(PL_lex_defer);
406 SAVEI32(PL_sublex_info.sub_inwhat);
407 SAVESPTR(PL_lex_repl);
409 SAVEINT(PL_lex_expect);
411 PL_lex_state = LEX_NORMAL;
415 New(899, PL_lex_brackstack, 120, char);
416 New(899, PL_lex_casestack, 12, char);
417 SAVEFREEPV(PL_lex_brackstack);
418 SAVEFREEPV(PL_lex_casestack);
420 *PL_lex_casestack = '\0';
423 PL_lex_stuff = Nullsv;
424 PL_lex_repl = Nullsv;
428 PL_sublex_info.sub_inwhat = 0;
430 if (SvREADONLY(PL_linestr))
431 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
432 s = SvPV(PL_linestr, len);
433 if (len && s[len-1] != ';') {
434 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
435 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
436 sv_catpvn(PL_linestr, "\n;", 2);
438 SvTEMP_off(PL_linestr);
439 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
440 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
441 PL_last_lop = PL_last_uni = Nullch;
443 PL_rs = newSVpvn("\n", 1);
449 * Finalizer for lexing operations. Must be called when the parser is
450 * done with the lexer.
456 PL_doextract = FALSE;
461 * This subroutine has nothing to do with tilting, whether at windmills
462 * or pinball tables. Its name is short for "increment line". It
463 * increments the current line number in CopLINE(PL_curcop) and checks
464 * to see whether the line starts with a comment of the form
465 * # line 500 "foo.pm"
466 * If so, it sets the current line number and file to the values in the comment.
470 S_incline(pTHX_ char *s)
477 CopLINE_inc(PL_curcop);
480 while (SPACE_OR_TAB(*s)) s++;
481 if (strnEQ(s, "line", 4))
485 if (SPACE_OR_TAB(*s))
489 while (SPACE_OR_TAB(*s)) s++;
495 while (SPACE_OR_TAB(*s))
497 if (*s == '"' && (t = strchr(s+1, '"'))) {
502 for (t = s; !isSPACE(*t); t++) ;
505 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
507 if (*e != '\n' && *e != '\0')
508 return; /* false alarm */
514 Safefree(CopFILE(PL_curcop));
516 SvREFCNT_dec(CopFILEGV(PL_curcop));
518 CopFILE_set(PL_curcop, s);
521 CopLINE_set(PL_curcop, atoi(n)-1);
526 * Called to gobble the appropriate amount and type of whitespace.
527 * Skips comments as well.
531 S_skipspace(pTHX_ register char *s)
533 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
534 while (s < PL_bufend && SPACE_OR_TAB(*s))
540 SSize_t oldprevlen, oldoldprevlen;
541 SSize_t oldloplen, oldunilen;
542 while (s < PL_bufend && isSPACE(*s)) {
543 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
548 if (s < PL_bufend && *s == '#') {
549 while (s < PL_bufend && *s != '\n')
553 if (PL_in_eval && !PL_rsfp) {
560 /* only continue to recharge the buffer if we're at the end
561 * of the buffer, we're not reading from a source filter, and
562 * we're in normal lexing mode
564 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
565 PL_lex_state == LEX_FORMLINE)
568 /* try to recharge the buffer */
569 if ((s = filter_gets(PL_linestr, PL_rsfp,
570 (prevlen = SvCUR(PL_linestr)))) == Nullch)
572 /* end of file. Add on the -p or -n magic */
573 if (PL_minus_n || PL_minus_p) {
574 sv_setpv(PL_linestr,PL_minus_p ?
575 ";}continue{print or die qq(-p destination: $!\\n)" :
577 sv_catpv(PL_linestr,";}");
578 PL_minus_n = PL_minus_p = 0;
581 sv_setpv(PL_linestr,";");
583 /* reset variables for next time we lex */
584 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
586 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
587 PL_last_lop = PL_last_uni = Nullch;
589 /* Close the filehandle. Could be from -P preprocessor,
590 * STDIN, or a regular file. If we were reading code from
591 * STDIN (because the commandline held no -e or filename)
592 * then we don't close it, we reset it so the code can
593 * read from STDIN too.
596 if (PL_preprocess && !PL_in_eval)
597 (void)PerlProc_pclose(PL_rsfp);
598 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
599 PerlIO_clearerr(PL_rsfp);
601 (void)PerlIO_close(PL_rsfp);
606 /* not at end of file, so we only read another line */
607 /* make corresponding updates to old pointers, for yyerror() */
608 oldprevlen = PL_oldbufptr - PL_bufend;
609 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
611 oldunilen = PL_last_uni - PL_bufend;
613 oldloplen = PL_last_lop - PL_bufend;
614 PL_linestart = PL_bufptr = s + prevlen;
615 PL_bufend = s + SvCUR(PL_linestr);
617 PL_oldbufptr = s + oldprevlen;
618 PL_oldoldbufptr = s + oldoldprevlen;
620 PL_last_uni = s + oldunilen;
622 PL_last_lop = s + oldloplen;
625 /* debugger active and we're not compiling the debugger code,
626 * so store the line into the debugger's array of lines
628 if (PERLDB_LINE && PL_curstash != PL_debstash) {
629 SV *sv = NEWSV(85,0);
631 sv_upgrade(sv, SVt_PVMG);
632 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
633 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
640 * Check the unary operators to ensure there's no ambiguity in how they're
641 * used. An ambiguous piece of code would be:
643 * This doesn't mean rand() + 5. Because rand() is a unary operator,
644 * the +5 is its argument.
653 if (PL_oldoldbufptr != PL_last_uni)
655 while (isSPACE(*PL_last_uni))
657 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
658 if ((t = strchr(s, '(')) && t < PL_bufptr)
660 if (ckWARN_d(WARN_AMBIGUOUS)){
663 Perl_warner(aTHX_ WARN_AMBIGUOUS,
664 "Warning: Use of \"%s\" without parens is ambiguous",
670 /* workaround to replace the UNI() macro with a function. Only the
671 * hints/uts.sh file mentions this. Other comments elsewhere in the
672 * source indicate Microport Unix might need it too.
678 #define UNI(f) return uni(f,s)
681 S_uni(pTHX_ I32 f, char *s)
686 PL_last_uni = PL_oldbufptr;
697 #endif /* CRIPPLED_CC */
700 * LOP : macro to build a list operator. Its behaviour has been replaced
701 * with a subroutine, S_lop() for which LOP is just another name.
704 #define LOP(f,x) return lop(f,x,s)
708 * Build a list operator (or something that might be one). The rules:
709 * - if we have a next token, then it's a list operator [why?]
710 * - if the next thing is an opening paren, then it's a function
711 * - else it's a list operator
715 S_lop(pTHX_ I32 f, int x, char *s)
722 PL_last_lop = PL_oldbufptr;
737 * When the lexer realizes it knows the next token (for instance,
738 * it is reordering tokens for the parser) then it can call S_force_next
739 * to know what token to return the next time the lexer is called. Caller
740 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
741 * handles the token correctly.
745 S_force_next(pTHX_ I32 type)
747 PL_nexttype[PL_nexttoke] = type;
749 if (PL_lex_state != LEX_KNOWNEXT) {
750 PL_lex_defer = PL_lex_state;
751 PL_lex_expect = PL_expect;
752 PL_lex_state = LEX_KNOWNEXT;
758 * When the lexer knows the next thing is a word (for instance, it has
759 * just seen -> and it knows that the next char is a word char, then
760 * it calls S_force_word to stick the next word into the PL_next lookahead.
763 * char *start : buffer position (must be within PL_linestr)
764 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
765 * int check_keyword : if true, Perl checks to make sure the word isn't
766 * a keyword (do this if the word is a label, e.g. goto FOO)
767 * int allow_pack : if true, : characters will also be allowed (require,
769 * int allow_initial_tick : used by the "sub" lexer only.
773 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
778 start = skipspace(start);
780 if (isIDFIRST_lazy_if(s,UTF) ||
781 (allow_pack && *s == ':') ||
782 (allow_initial_tick && *s == '\'') )
784 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
785 if (check_keyword && keyword(PL_tokenbuf, len))
787 if (token == METHOD) {
792 PL_expect = XOPERATOR;
795 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
796 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
804 * Called when the lexer wants $foo *foo &foo etc, but the program
805 * text only contains the "foo" portion. The first argument is a pointer
806 * to the "foo", and the second argument is the type symbol to prefix.
807 * Forces the next token to be a "WORD".
808 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
812 S_force_ident(pTHX_ register char *s, int kind)
815 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
816 PL_nextval[PL_nexttoke].opval = o;
819 o->op_private = OPpCONST_ENTERED;
820 /* XXX see note in pp_entereval() for why we forgo typo
821 warnings if the symbol must be introduced in an eval.
823 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
824 kind == '$' ? SVt_PV :
825 kind == '@' ? SVt_PVAV :
826 kind == '%' ? SVt_PVHV :
834 Perl_str_to_version(pTHX_ SV *sv)
839 char *start = SvPVx(sv,len);
840 bool utf = SvUTF8(sv) ? TRUE : FALSE;
841 char *end = start + len;
842 while (start < end) {
846 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
851 retval += ((NV)n)/nshift;
860 * Forces the next token to be a version number.
864 S_force_version(pTHX_ char *s)
866 OP *version = Nullop;
875 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
876 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
878 s = scan_num(s, &yylval);
879 version = yylval.opval;
880 ver = cSVOPx(version)->op_sv;
881 if (SvPOK(ver) && !SvNIOK(ver)) {
882 (void)SvUPGRADE(ver, SVt_PVNV);
883 SvNVX(ver) = str_to_version(ver);
884 SvNOK_on(ver); /* hint that it is a version */
889 /* NOTE: The parser sees the package name and the VERSION swapped */
890 PL_nextval[PL_nexttoke].opval = version;
898 * Tokenize a quoted string passed in as an SV. It finds the next
899 * chunk, up to end of string or a backslash. It may make a new
900 * SV containing that chunk (if HINT_NEW_STRING is on). It also
905 S_tokeq(pTHX_ SV *sv)
916 s = SvPV_force(sv, len);
917 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
920 while (s < send && *s != '\\')
925 if ( PL_hints & HINT_NEW_STRING ) {
926 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
932 if (s + 1 < send && (s[1] == '\\'))
933 s++; /* all that, just for this */
938 SvCUR_set(sv, d - SvPVX(sv));
940 if ( PL_hints & HINT_NEW_STRING )
941 return new_constant(NULL, 0, "q", sv, pv, "q");
946 * Now come three functions related to double-quote context,
947 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
948 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
949 * interact with PL_lex_state, and create fake ( ... ) argument lists
950 * to handle functions and concatenation.
951 * They assume that whoever calls them will be setting up a fake
952 * join call, because each subthing puts a ',' after it. This lets
955 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
957 * (I'm not sure whether the spurious commas at the end of lcfirst's
958 * arguments and join's arguments are created or not).
963 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
965 * Pattern matching will set PL_lex_op to the pattern-matching op to
966 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
968 * OP_CONST and OP_READLINE are easy--just make the new op and return.
970 * Everything else becomes a FUNC.
972 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
973 * had an OP_CONST or OP_READLINE). This just sets us up for a
974 * call to S_sublex_push().
980 register I32 op_type = yylval.ival;
982 if (op_type == OP_NULL) {
983 yylval.opval = PL_lex_op;
987 if (op_type == OP_CONST || op_type == OP_READLINE) {
988 SV *sv = tokeq(PL_lex_stuff);
990 if (SvTYPE(sv) == SVt_PVIV) {
991 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
997 nsv = newSVpvn(p, len);
1003 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1004 PL_lex_stuff = Nullsv;
1008 PL_sublex_info.super_state = PL_lex_state;
1009 PL_sublex_info.sub_inwhat = op_type;
1010 PL_sublex_info.sub_op = PL_lex_op;
1011 PL_lex_state = LEX_INTERPPUSH;
1015 yylval.opval = PL_lex_op;
1025 * Create a new scope to save the lexing state. The scope will be
1026 * ended in S_sublex_done. Returns a '(', starting the function arguments
1027 * to the uc, lc, etc. found before.
1028 * Sets PL_lex_state to LEX_INTERPCONCAT.
1036 PL_lex_state = PL_sublex_info.super_state;
1037 SAVEI32(PL_lex_dojoin);
1038 SAVEI32(PL_lex_brackets);
1039 SAVEI32(PL_lex_casemods);
1040 SAVEI32(PL_lex_starts);
1041 SAVEI32(PL_lex_state);
1042 SAVEVPTR(PL_lex_inpat);
1043 SAVEI32(PL_lex_inwhat);
1044 SAVECOPLINE(PL_curcop);
1045 SAVEPPTR(PL_bufptr);
1046 SAVEPPTR(PL_oldbufptr);
1047 SAVEPPTR(PL_oldoldbufptr);
1048 SAVEPPTR(PL_last_lop);
1049 SAVEPPTR(PL_last_uni);
1050 SAVEPPTR(PL_linestart);
1051 SAVESPTR(PL_linestr);
1052 SAVEPPTR(PL_lex_brackstack);
1053 SAVEPPTR(PL_lex_casestack);
1055 PL_linestr = PL_lex_stuff;
1056 PL_lex_stuff = Nullsv;
1058 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1059 = SvPVX(PL_linestr);
1060 PL_bufend += SvCUR(PL_linestr);
1061 PL_last_lop = PL_last_uni = Nullch;
1062 SAVEFREESV(PL_linestr);
1064 PL_lex_dojoin = FALSE;
1065 PL_lex_brackets = 0;
1066 New(899, PL_lex_brackstack, 120, char);
1067 New(899, PL_lex_casestack, 12, char);
1068 SAVEFREEPV(PL_lex_brackstack);
1069 SAVEFREEPV(PL_lex_casestack);
1070 PL_lex_casemods = 0;
1071 *PL_lex_casestack = '\0';
1073 PL_lex_state = LEX_INTERPCONCAT;
1074 CopLINE_set(PL_curcop, PL_multi_start);
1076 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1077 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1078 PL_lex_inpat = PL_sublex_info.sub_op;
1080 PL_lex_inpat = Nullop;
1087 * Restores lexer state after a S_sublex_push.
1093 if (!PL_lex_starts++) {
1094 SV *sv = newSVpvn("",0);
1095 if (SvUTF8(PL_linestr))
1097 PL_expect = XOPERATOR;
1098 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1102 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1103 PL_lex_state = LEX_INTERPCASEMOD;
1107 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1108 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1109 PL_linestr = PL_lex_repl;
1111 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1112 PL_bufend += SvCUR(PL_linestr);
1113 PL_last_lop = PL_last_uni = Nullch;
1114 SAVEFREESV(PL_linestr);
1115 PL_lex_dojoin = FALSE;
1116 PL_lex_brackets = 0;
1117 PL_lex_casemods = 0;
1118 *PL_lex_casestack = '\0';
1120 if (SvEVALED(PL_lex_repl)) {
1121 PL_lex_state = LEX_INTERPNORMAL;
1123 /* we don't clear PL_lex_repl here, so that we can check later
1124 whether this is an evalled subst; that means we rely on the
1125 logic to ensure sublex_done() is called again only via the
1126 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1129 PL_lex_state = LEX_INTERPCONCAT;
1130 PL_lex_repl = Nullsv;
1136 PL_bufend = SvPVX(PL_linestr);
1137 PL_bufend += SvCUR(PL_linestr);
1138 PL_expect = XOPERATOR;
1139 PL_sublex_info.sub_inwhat = 0;
1147 Extracts a pattern, double-quoted string, or transliteration. This
1150 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1151 processing a pattern (PL_lex_inpat is true), a transliteration
1152 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1154 Returns a pointer to the character scanned up to. Iff this is
1155 advanced from the start pointer supplied (ie if anything was
1156 successfully parsed), will leave an OP for the substring scanned
1157 in yylval. Caller must intuit reason for not parsing further
1158 by looking at the next characters herself.
1162 double-quoted style: \r and \n
1163 regexp special ones: \D \s
1165 backrefs: \1 (deprecated in substitution replacements)
1166 case and quoting: \U \Q \E
1167 stops on @ and $, but not for $ as tail anchor
1169 In transliterations:
1170 characters are VERY literal, except for - not at the start or end
1171 of the string, which indicates a range. scan_const expands the
1172 range to the full set of intermediate characters.
1174 In double-quoted strings:
1176 double-quoted style: \r and \n
1178 backrefs: \1 (deprecated)
1179 case and quoting: \U \Q \E
1182 scan_const does *not* construct ops to handle interpolated strings.
1183 It stops processing as soon as it finds an embedded $ or @ variable
1184 and leaves it to the caller to work out what's going on.
1186 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1188 $ in pattern could be $foo or could be tail anchor. Assumption:
1189 it's a tail anchor if $ is the last thing in the string, or if it's
1190 followed by one of ")| \n\t"
1192 \1 (backreferences) are turned into $1
1194 The structure of the code is
1195 while (there's a character to process) {
1196 handle transliteration ranges
1197 skip regexp comments
1198 skip # initiated comments in //x patterns
1199 check for embedded @foo
1200 check for embedded scalars
1202 leave intact backslashes from leave (below)
1203 deprecate \1 in strings and sub replacements
1204 handle string-changing backslashes \l \U \Q \E, etc.
1205 switch (what was escaped) {
1206 handle - in a transliteration (becomes a literal -)
1207 handle \132 octal characters
1208 handle 0x15 hex characters
1209 handle \cV (control V)
1210 handle printf backslashes (\f, \r, \n, etc)
1212 } (end if backslash)
1213 } (end while character to read)
1218 S_scan_const(pTHX_ char *start)
1220 register char *send = PL_bufend; /* end of the constant */
1221 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1222 register char *s = start; /* start of the constant */
1223 register char *d = SvPVX(sv); /* destination for copies */
1224 bool dorange = FALSE; /* are we in a translit range? */
1225 bool didrange = FALSE; /* did we just finish a range? */
1226 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1227 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1230 const char *leaveit = /* set of acceptably-backslashed characters */
1232 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1235 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1236 /* If we are doing a trans and we know we want UTF8 set expectation */
1237 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1238 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1242 while (s < send || dorange) {
1243 /* get transliterations out of the way (they're most literal) */
1244 if (PL_lex_inwhat == OP_TRANS) {
1245 /* expand a range A-Z to the full set of characters. AIE! */
1247 I32 i; /* current expanded character */
1248 I32 min; /* first character in range */
1249 I32 max; /* last character in range */
1252 char *c = (char*)utf8_hop((U8*)d, -1);
1256 *c = UTF_TO_NATIVE(0xff);
1257 /* mark the range as done, and continue */
1263 i = d - SvPVX(sv); /* remember current offset */
1264 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1265 d = SvPVX(sv) + i; /* refresh d after realloc */
1266 d -= 2; /* eat the first char and the - */
1268 min = (U8)*d; /* first char in range */
1269 max = (U8)d[1]; /* last char in range */
1273 "Invalid [] range \"%c-%c\" in transliteration operator",
1274 (char)min, (char)max);
1278 if ((isLOWER(min) && isLOWER(max)) ||
1279 (isUPPER(min) && isUPPER(max))) {
1281 for (i = min; i <= max; i++)
1283 *d++ = NATIVE_TO_NEED(has_utf8,i);
1285 for (i = min; i <= max; i++)
1287 *d++ = NATIVE_TO_NEED(has_utf8,i);
1292 for (i = min; i <= max; i++)
1295 /* mark the range as done, and continue */
1301 /* range begins (ignore - as first or last char) */
1302 else if (*s == '-' && s+1 < send && s != start) {
1304 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1307 *d++ = UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1319 /* if we get here, we're not doing a transliteration */
1321 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1322 except for the last char, which will be done separately. */
1323 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1325 while (s < send && *s != ')')
1326 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1328 else if (s[2] == '{' /* This should match regcomp.c */
1329 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1332 char *regparse = s + (s[2] == '{' ? 3 : 4);
1335 while (count && (c = *regparse)) {
1336 if (c == '\\' && regparse[1])
1344 if (*regparse != ')') {
1345 regparse--; /* Leave one char for continuation. */
1346 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1348 while (s < regparse)
1349 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1353 /* likewise skip #-initiated comments in //x patterns */
1354 else if (*s == '#' && PL_lex_inpat &&
1355 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1356 while (s+1 < send && *s != '\n')
1357 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1360 /* check for embedded arrays
1361 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1363 else if (*s == '@' && s[1]
1364 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1367 /* check for embedded scalars. only stop if we're sure it's a
1370 else if (*s == '$') {
1371 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1373 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1374 break; /* in regexp, $ might be tail anchor */
1377 /* End of else if chain - OP_TRANS rejoin rest */
1380 if (*s == '\\' && s+1 < send) {
1383 /* some backslashes we leave behind */
1384 if (*leaveit && *s && strchr(leaveit, *s)) {
1385 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1386 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1390 /* deprecate \1 in strings and substitution replacements */
1391 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1392 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1394 if (ckWARN(WARN_SYNTAX))
1395 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1400 /* string-change backslash escapes */
1401 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1406 /* if we get here, it's either a quoted -, or a digit */
1409 /* quoted - in transliterations */
1411 if (PL_lex_inwhat == OP_TRANS) {
1418 if (ckWARN(WARN_MISC) && isALNUM(*s))
1419 Perl_warner(aTHX_ WARN_MISC,
1420 "Unrecognized escape \\%c passed through",
1422 /* default action is to copy the quoted character */
1423 goto default_action;
1426 /* \132 indicates an octal constant */
1427 case '0': case '1': case '2': case '3':
1428 case '4': case '5': case '6': case '7':
1430 STRLEN len = 0; /* disallow underscores */
1431 uv = (UV)scan_oct(s, 3, &len);
1434 goto NUM_ESCAPE_INSERT;
1436 /* \x24 indicates a hex constant */
1440 char* e = strchr(s, '}');
1442 yyerror("Missing right brace on \\x{}");
1446 STRLEN len = 1; /* allow underscores */
1447 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1453 STRLEN len = 0; /* disallow underscores */
1454 uv = (UV)scan_hex(s, 2, &len);
1460 /* Insert oct or hex escaped character.
1461 * There will always enough room in sv since such
1462 * escapes will be longer than any UTF-8 sequence
1463 * they can end up as. */
1465 /* We need to map to chars to ASCII before doing the tests
1468 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1469 if (!has_utf8 && uv > 255) {
1470 /* Might need to recode whatever we have
1471 * accumulated so far if it contains any
1474 * (Can't we keep track of that and avoid
1475 * this rescan? --jhi)
1479 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1480 if (!NATIVE_IS_INVARIANT(*c)) {
1485 STRLEN offset = d - SvPVX(sv);
1487 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1491 while (src >= (U8 *)SvPVX(sv)) {
1492 if (!NATIVE_IS_INVARIANT(*src)) {
1493 U8 ch = NATIVE_TO_ASCII(*src);
1494 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1495 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1505 if (has_utf8 || uv > 255) {
1506 d = (char*)uvchr_to_utf8((U8*)d, uv);
1508 if (PL_lex_inwhat == OP_TRANS &&
1509 PL_sublex_info.sub_op) {
1510 PL_sublex_info.sub_op->op_private |=
1511 (PL_lex_repl ? OPpTRANS_FROM_UTF
1524 /* \N{latin small letter a} is a named character */
1528 char* e = strchr(s, '}');
1534 yyerror("Missing right brace on \\N{}");
1538 res = newSVpvn(s + 1, e - s - 1);
1539 res = new_constant( Nullch, 0, "charnames",
1540 res, Nullsv, "\\N{...}" );
1542 sv_utf8_upgrade(res);
1543 str = SvPV(res,len);
1544 if (!has_utf8 && SvUTF8(res)) {
1545 char *ostart = SvPVX(sv);
1546 SvCUR_set(sv, d - ostart);
1549 sv_utf8_upgrade(sv);
1550 /* this just broke our allocation above... */
1551 SvGROW(sv, send - start);
1552 d = SvPVX(sv) + SvCUR(sv);
1555 if (len > e - s + 4) {
1556 char *odest = SvPVX(sv);
1558 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1559 d = SvPVX(sv) + (d - odest);
1561 Copy(str, d, len, char);
1568 yyerror("Missing braces on \\N{}");
1571 /* \c is a control character */
1580 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1584 /* printf-style backslashes, formfeeds, newlines, etc */
1586 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1589 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1592 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1595 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1598 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1601 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1604 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1610 } /* end if (backslash) */
1613 /* If we started with encoded form, or already know we want it
1614 and then encode the next character */
1615 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1617 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1618 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1621 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1622 STRLEN off = d - SvPVX(sv);
1623 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1625 d = (char*)uvchr_to_utf8((U8*)d, uv);
1629 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1631 } /* while loop to process each character */
1633 /* terminate the string and set up the sv */
1635 SvCUR_set(sv, d - SvPVX(sv));
1636 if (SvCUR(sv) >= SvLEN(sv))
1637 Perl_croak(aTHX_ "panic:constant overflowed allocated space");
1642 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1643 PL_sublex_info.sub_op->op_private |=
1644 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1648 /* shrink the sv if we allocated more than we used */
1649 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1650 SvLEN_set(sv, SvCUR(sv) + 1);
1651 Renew(SvPVX(sv), SvLEN(sv), char);
1654 /* return the substring (via yylval) only if we parsed anything */
1655 if (s > PL_bufptr) {
1656 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1657 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1659 ( PL_lex_inwhat == OP_TRANS
1661 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1664 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1671 * Returns TRUE if there's more to the expression (e.g., a subscript),
1674 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1676 * ->[ and ->{ return TRUE
1677 * { and [ outside a pattern are always subscripts, so return TRUE
1678 * if we're outside a pattern and it's not { or [, then return FALSE
1679 * if we're in a pattern and the first char is a {
1680 * {4,5} (any digits around the comma) returns FALSE
1681 * if we're in a pattern and the first char is a [
1683 * [SOMETHING] has a funky algorithm to decide whether it's a
1684 * character class or not. It has to deal with things like
1685 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1686 * anything else returns TRUE
1689 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1692 S_intuit_more(pTHX_ register char *s)
1694 if (PL_lex_brackets)
1696 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1698 if (*s != '{' && *s != '[')
1703 /* In a pattern, so maybe we have {n,m}. */
1720 /* On the other hand, maybe we have a character class */
1723 if (*s == ']' || *s == '^')
1726 /* this is terrifying, and it works */
1727 int weight = 2; /* let's weigh the evidence */
1729 unsigned char un_char = 255, last_un_char;
1730 char *send = strchr(s,']');
1731 char tmpbuf[sizeof PL_tokenbuf * 4];
1733 if (!send) /* has to be an expression */
1736 Zero(seen,256,char);
1739 else if (isDIGIT(*s)) {
1741 if (isDIGIT(s[1]) && s[2] == ']')
1747 for (; s < send; s++) {
1748 last_un_char = un_char;
1749 un_char = (unsigned char)*s;
1754 weight -= seen[un_char] * 10;
1755 if (isALNUM_lazy_if(s+1,UTF)) {
1756 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1757 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1762 else if (*s == '$' && s[1] &&
1763 strchr("[#!%*<>()-=",s[1])) {
1764 if (/*{*/ strchr("])} =",s[2]))
1773 if (strchr("wds]",s[1]))
1775 else if (seen['\''] || seen['"'])
1777 else if (strchr("rnftbxcav",s[1]))
1779 else if (isDIGIT(s[1])) {
1781 while (s[1] && isDIGIT(s[1]))
1791 if (strchr("aA01! ",last_un_char))
1793 if (strchr("zZ79~",s[1]))
1795 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1796 weight -= 5; /* cope with negative subscript */
1799 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1800 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1805 if (keyword(tmpbuf, d - tmpbuf))
1808 if (un_char == last_un_char + 1)
1810 weight -= seen[un_char];
1815 if (weight >= 0) /* probably a character class */
1825 * Does all the checking to disambiguate
1827 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1828 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1830 * First argument is the stuff after the first token, e.g. "bar".
1832 * Not a method if bar is a filehandle.
1833 * Not a method if foo is a subroutine prototyped to take a filehandle.
1834 * Not a method if it's really "Foo $bar"
1835 * Method if it's "foo $bar"
1836 * Not a method if it's really "print foo $bar"
1837 * Method if it's really "foo package::" (interpreted as package->foo)
1838 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1839 * Not a method if bar is a filehandle or package, but is quoted with
1844 S_intuit_method(pTHX_ char *start, GV *gv)
1846 char *s = start + (*start == '$');
1847 char tmpbuf[sizeof PL_tokenbuf];
1855 if ((cv = GvCVu(gv))) {
1856 char *proto = SvPVX(cv);
1866 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1867 /* start is the beginning of the possible filehandle/object,
1868 * and s is the end of it
1869 * tmpbuf is a copy of it
1872 if (*start == '$') {
1873 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1878 return *s == '(' ? FUNCMETH : METHOD;
1880 if (!keyword(tmpbuf, len)) {
1881 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1886 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1887 if (indirgv && GvCVu(indirgv))
1889 /* filehandle or package name makes it a method */
1890 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1892 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1893 return 0; /* no assumptions -- "=>" quotes bearword */
1895 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1896 newSVpvn(tmpbuf,len));
1897 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1901 return *s == '(' ? FUNCMETH : METHOD;
1909 * Return a string of Perl code to load the debugger. If PERL5DB
1910 * is set, it will return the contents of that, otherwise a
1911 * compile-time require of perl5db.pl.
1918 char *pdb = PerlEnv_getenv("PERL5DB");
1922 SETERRNO(0,SS$_NORMAL);
1923 return "BEGIN { require 'perl5db.pl' }";
1929 /* Encoded script support. filter_add() effectively inserts a
1930 * 'pre-processing' function into the current source input stream.
1931 * Note that the filter function only applies to the current source file
1932 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1934 * The datasv parameter (which may be NULL) can be used to pass
1935 * private data to this instance of the filter. The filter function
1936 * can recover the SV using the FILTER_DATA macro and use it to
1937 * store private buffers and state information.
1939 * The supplied datasv parameter is upgraded to a PVIO type
1940 * and the IoDIRP/IoANY field is used to store the function pointer,
1941 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1942 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1943 * private use must be set using malloc'd pointers.
1947 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1952 if (!PL_rsfp_filters)
1953 PL_rsfp_filters = newAV();
1955 datasv = NEWSV(255,0);
1956 if (!SvUPGRADE(datasv, SVt_PVIO))
1957 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1958 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1959 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1960 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1961 funcp, SvPV_nolen(datasv)));
1962 av_unshift(PL_rsfp_filters, 1);
1963 av_store(PL_rsfp_filters, 0, datasv) ;
1968 /* Delete most recently added instance of this filter function. */
1970 Perl_filter_del(pTHX_ filter_t funcp)
1973 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1974 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1976 /* if filter is on top of stack (usual case) just pop it off */
1977 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1978 if (IoANY(datasv) == (void *)funcp) {
1979 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1980 IoANY(datasv) = (void *)NULL;
1981 sv_free(av_pop(PL_rsfp_filters));
1985 /* we need to search for the correct entry and clear it */
1986 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1990 /* Invoke the n'th filter function for the current rsfp. */
1992 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1995 /* 0 = read one text line */
2000 if (!PL_rsfp_filters)
2002 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2003 /* Provide a default input filter to make life easy. */
2004 /* Note that we append to the line. This is handy. */
2005 DEBUG_P(PerlIO_printf(Perl_debug_log,
2006 "filter_read %d: from rsfp\n", idx));
2010 int old_len = SvCUR(buf_sv) ;
2012 /* ensure buf_sv is large enough */
2013 SvGROW(buf_sv, old_len + maxlen) ;
2014 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2015 if (PerlIO_error(PL_rsfp))
2016 return -1; /* error */
2018 return 0 ; /* end of file */
2020 SvCUR_set(buf_sv, old_len + len) ;
2023 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2024 if (PerlIO_error(PL_rsfp))
2025 return -1; /* error */
2027 return 0 ; /* end of file */
2030 return SvCUR(buf_sv);
2032 /* Skip this filter slot if filter has been deleted */
2033 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2034 DEBUG_P(PerlIO_printf(Perl_debug_log,
2035 "filter_read %d: skipped (filter deleted)\n",
2037 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2039 /* Get function pointer hidden within datasv */
2040 funcp = (filter_t)IoANY(datasv);
2041 DEBUG_P(PerlIO_printf(Perl_debug_log,
2042 "filter_read %d: via function %p (%s)\n",
2043 idx, funcp, SvPV_nolen(datasv)));
2044 /* Call function. The function is expected to */
2045 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2046 /* Return: <0:error, =0:eof, >0:not eof */
2047 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
2051 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2053 #ifdef PERL_CR_FILTER
2054 if (!PL_rsfp_filters) {
2055 filter_add(S_cr_textfilter,NULL);
2058 if (PL_rsfp_filters) {
2061 SvCUR_set(sv, 0); /* start with empty line */
2062 if (FILTER_READ(0, sv, 0) > 0)
2063 return ( SvPVX(sv) ) ;
2068 return (sv_gets(sv, fp, append));
2072 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2076 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2080 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2081 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2083 return GvHV(gv); /* Foo:: */
2086 /* use constant CLASS => 'MyClass' */
2087 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2089 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2090 pkgname = SvPV_nolen(sv);
2094 return gv_stashpv(pkgname, FALSE);
2098 static char* exp_name[] =
2099 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2100 "ATTRTERM", "TERMBLOCK"
2107 Works out what to call the token just pulled out of the input
2108 stream. The yacc parser takes care of taking the ops we return and
2109 stitching them into a tree.
2115 if read an identifier
2116 if we're in a my declaration
2117 croak if they tried to say my($foo::bar)
2118 build the ops for a my() declaration
2119 if it's an access to a my() variable
2120 are we in a sort block?
2121 croak if my($a); $a <=> $b
2122 build ops for access to a my() variable
2123 if in a dq string, and they've said @foo and we can't find @foo
2125 build ops for a bareword
2126 if we already built the token before, use it.
2129 #ifdef USE_PURE_BISON
2131 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2136 yylval_pointer[yyactlevel] = lvalp;
2137 yychar_pointer[yyactlevel] = lcharp;
2138 if (yyactlevel >= YYMAXLEVEL)
2139 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2141 r = Perl_yylex(aTHX);
2151 #pragma segment Perl_yylex
2164 /* check if there's an identifier for us to look at */
2165 if (PL_pending_ident) {
2166 /* pit holds the identifier we read and pending_ident is reset */
2167 char pit = PL_pending_ident;
2168 PL_pending_ident = 0;
2170 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2171 "### Tokener saw identifier '%s'\n", PL_tokenbuf); })
2173 /* if we're in a my(), we can't allow dynamics here.
2174 $foo'bar has already been turned into $foo::bar, so
2175 just check for colons.
2177 if it's a legal name, the OP is a PADANY.
2180 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2181 if (strchr(PL_tokenbuf,':'))
2182 yyerror(Perl_form(aTHX_ "No package name allowed for "
2183 "variable %s in \"our\"",
2185 tmp = pad_allocmy(PL_tokenbuf);
2188 if (strchr(PL_tokenbuf,':'))
2189 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2191 yylval.opval = newOP(OP_PADANY, 0);
2192 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2198 build the ops for accesses to a my() variable.
2200 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2201 then used in a comparison. This catches most, but not
2202 all cases. For instance, it catches
2203 sort { my($a); $a <=> $b }
2205 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2206 (although why you'd do that is anyone's guess).
2209 if (!strchr(PL_tokenbuf,':')) {
2211 /* Check for single character per-thread SVs */
2212 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2213 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2214 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2216 yylval.opval = newOP(OP_THREADSV, 0);
2217 yylval.opval->op_targ = tmp;
2220 #endif /* USE_THREADS */
2221 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2222 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2223 /* might be an "our" variable" */
2224 if (SvFLAGS(namesv) & SVpad_OUR) {
2225 /* build ops for a bareword */
2226 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2227 sv_catpvn(sym, "::", 2);
2228 sv_catpv(sym, PL_tokenbuf+1);
2229 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2230 yylval.opval->op_private = OPpCONST_ENTERED;
2231 gv_fetchpv(SvPVX(sym),
2233 ? (GV_ADDMULTI | GV_ADDINEVAL)
2236 ((PL_tokenbuf[0] == '$') ? SVt_PV
2237 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2242 /* if it's a sort block and they're naming $a or $b */
2243 if (PL_last_lop_op == OP_SORT &&
2244 PL_tokenbuf[0] == '$' &&
2245 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2248 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2249 d < PL_bufend && *d != '\n';
2252 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2253 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2259 yylval.opval = newOP(OP_PADANY, 0);
2260 yylval.opval->op_targ = tmp;
2266 Whine if they've said @foo in a doublequoted string,
2267 and @foo isn't a variable we can find in the symbol
2270 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2271 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2272 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2273 && ckWARN(WARN_AMBIGUOUS))
2275 /* Downgraded from fatal to warning 20000522 mjd */
2276 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2277 "Possible unintended interpolation of %s in string",
2282 /* build ops for a bareword */
2283 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2284 yylval.opval->op_private = OPpCONST_ENTERED;
2285 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2286 ((PL_tokenbuf[0] == '$') ? SVt_PV
2287 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2292 /* no identifier pending identification */
2294 switch (PL_lex_state) {
2296 case LEX_NORMAL: /* Some compilers will produce faster */
2297 case LEX_INTERPNORMAL: /* code if we comment these out. */
2301 /* when we've already built the next token, just pull it out of the queue */
2304 yylval = PL_nextval[PL_nexttoke];
2306 PL_lex_state = PL_lex_defer;
2307 PL_expect = PL_lex_expect;
2308 PL_lex_defer = LEX_NORMAL;
2310 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2311 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2312 (IV)PL_nexttype[PL_nexttoke]); })
2314 return(PL_nexttype[PL_nexttoke]);
2316 /* interpolated case modifiers like \L \U, including \Q and \E.
2317 when we get here, PL_bufptr is at the \
2319 case LEX_INTERPCASEMOD:
2321 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2322 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2324 /* handle \E or end of string */
2325 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2329 if (PL_lex_casemods) {
2330 oldmod = PL_lex_casestack[--PL_lex_casemods];
2331 PL_lex_casestack[PL_lex_casemods] = '\0';
2333 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2335 PL_lex_state = LEX_INTERPCONCAT;
2339 if (PL_bufptr != PL_bufend)
2341 PL_lex_state = LEX_INTERPCONCAT;
2345 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2346 "### Saw case modifier at '%s'\n", PL_bufptr); })
2348 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2349 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2350 if (strchr("LU", *s) &&
2351 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2353 PL_lex_casestack[--PL_lex_casemods] = '\0';
2356 if (PL_lex_casemods > 10) {
2357 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2358 if (newlb != PL_lex_casestack) {
2360 PL_lex_casestack = newlb;
2363 PL_lex_casestack[PL_lex_casemods++] = *s;
2364 PL_lex_casestack[PL_lex_casemods] = '\0';
2365 PL_lex_state = LEX_INTERPCONCAT;
2366 PL_nextval[PL_nexttoke].ival = 0;
2369 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2371 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2373 PL_nextval[PL_nexttoke].ival = OP_LC;
2375 PL_nextval[PL_nexttoke].ival = OP_UC;
2377 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2379 Perl_croak(aTHX_ "panic: yylex");
2382 if (PL_lex_starts) {
2391 case LEX_INTERPPUSH:
2392 return sublex_push();
2394 case LEX_INTERPSTART:
2395 if (PL_bufptr == PL_bufend)
2396 return sublex_done();
2397 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2398 "### Interpolated variable at '%s'\n", PL_bufptr); })
2400 PL_lex_dojoin = (*PL_bufptr == '@');
2401 PL_lex_state = LEX_INTERPNORMAL;
2402 if (PL_lex_dojoin) {
2403 PL_nextval[PL_nexttoke].ival = 0;
2406 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2407 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2408 force_next(PRIVATEREF);
2410 force_ident("\"", '$');
2411 #endif /* USE_THREADS */
2412 PL_nextval[PL_nexttoke].ival = 0;
2414 PL_nextval[PL_nexttoke].ival = 0;
2416 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2419 if (PL_lex_starts++) {
2425 case LEX_INTERPENDMAYBE:
2426 if (intuit_more(PL_bufptr)) {
2427 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2433 if (PL_lex_dojoin) {
2434 PL_lex_dojoin = FALSE;
2435 PL_lex_state = LEX_INTERPCONCAT;
2438 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2439 && SvEVALED(PL_lex_repl))
2441 if (PL_bufptr != PL_bufend)
2442 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2443 PL_lex_repl = Nullsv;
2446 case LEX_INTERPCONCAT:
2448 if (PL_lex_brackets)
2449 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2451 if (PL_bufptr == PL_bufend)
2452 return sublex_done();
2454 if (SvIVX(PL_linestr) == '\'') {
2455 SV *sv = newSVsv(PL_linestr);
2458 else if ( PL_hints & HINT_NEW_RE )
2459 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2460 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2464 s = scan_const(PL_bufptr);
2466 PL_lex_state = LEX_INTERPCASEMOD;
2468 PL_lex_state = LEX_INTERPSTART;
2471 if (s != PL_bufptr) {
2472 PL_nextval[PL_nexttoke] = yylval;
2475 if (PL_lex_starts++)
2485 PL_lex_state = LEX_NORMAL;
2486 s = scan_formline(PL_bufptr);
2487 if (!PL_lex_formbrack)
2493 PL_oldoldbufptr = PL_oldbufptr;
2496 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2497 exp_name[PL_expect], s);
2503 if (isIDFIRST_lazy_if(s,UTF))
2505 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2508 goto fake_eof; /* emulate EOF on ^D or ^Z */
2513 if (PL_lex_brackets)
2514 yyerror("Missing right curly or square bracket");
2515 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2516 "### Tokener got EOF\n");
2520 if (s++ < PL_bufend)
2521 goto retry; /* ignore stray nulls */
2524 if (!PL_in_eval && !PL_preambled) {
2525 PL_preambled = TRUE;
2526 sv_setpv(PL_linestr,incl_perldb());
2527 if (SvCUR(PL_linestr))
2528 sv_catpv(PL_linestr,";");
2530 while(AvFILLp(PL_preambleav) >= 0) {
2531 SV *tmpsv = av_shift(PL_preambleav);
2532 sv_catsv(PL_linestr, tmpsv);
2533 sv_catpv(PL_linestr, ";");
2536 sv_free((SV*)PL_preambleav);
2537 PL_preambleav = NULL;
2539 if (PL_minus_n || PL_minus_p) {
2540 sv_catpv(PL_linestr, "LINE: while (<>) {");
2542 sv_catpv(PL_linestr,"chomp;");
2544 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2546 GvIMPORTED_AV_on(gv);
2548 if (strchr("/'\"", *PL_splitstr)
2549 && strchr(PL_splitstr + 1, *PL_splitstr))
2550 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2553 s = "'~#\200\1'"; /* surely one char is unused...*/
2554 while (s[1] && strchr(PL_splitstr, *s)) s++;
2556 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2557 "q" + (delim == '\''), delim);
2558 for (s = PL_splitstr; *s; s++) {
2560 sv_catpvn(PL_linestr, "\\", 1);
2561 sv_catpvn(PL_linestr, s, 1);
2563 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2567 sv_catpv(PL_linestr,"@F=split(' ');");
2570 sv_catpv(PL_linestr, "\n");
2571 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2572 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2573 PL_last_lop = PL_last_uni = Nullch;
2574 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2575 SV *sv = NEWSV(85,0);
2577 sv_upgrade(sv, SVt_PVMG);
2578 sv_setsv(sv,PL_linestr);
2579 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2584 bof = PL_rsfp ? TRUE : FALSE;
2585 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2588 if (PL_preprocess && !PL_in_eval)
2589 (void)PerlProc_pclose(PL_rsfp);
2590 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2591 PerlIO_clearerr(PL_rsfp);
2593 (void)PerlIO_close(PL_rsfp);
2595 PL_doextract = FALSE;
2597 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2598 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2599 sv_catpv(PL_linestr,";}");
2600 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2601 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2602 PL_last_lop = PL_last_uni = Nullch;
2603 PL_minus_n = PL_minus_p = 0;
2606 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2607 PL_last_lop = PL_last_uni = Nullch;
2608 sv_setpv(PL_linestr,"");
2609 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2611 /* if it looks like the start of a BOM, check if it in fact is */
2612 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2613 #ifdef PERLIO_IS_STDIO
2614 # ifdef __GNU_LIBRARY__
2615 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2616 # define FTELL_FOR_PIPE_IS_BROKEN
2620 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2621 # define FTELL_FOR_PIPE_IS_BROKEN
2626 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2627 /* This loses the possibility to detect the bof
2628 * situation on perl -P when the libc5 is being used.
2629 * Workaround? Maybe attach some extra state to PL_rsfp?
2632 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2634 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2637 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2638 s = swallow_bom((U8*)s);
2642 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2643 PL_doextract = FALSE;
2645 /* Incest with pod. */
2646 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2647 sv_setpv(PL_linestr, "");
2648 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2649 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2650 PL_last_lop = PL_last_uni = Nullch;
2651 PL_doextract = FALSE;
2655 } while (PL_doextract);
2656 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2657 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2658 SV *sv = NEWSV(85,0);
2660 sv_upgrade(sv, SVt_PVMG);
2661 sv_setsv(sv,PL_linestr);
2662 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2664 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2665 PL_last_lop = PL_last_uni = Nullch;
2666 if (CopLINE(PL_curcop) == 1) {
2667 while (s < PL_bufend && isSPACE(*s))
2669 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2673 if (*s == '#' && *(s+1) == '!')
2675 #ifdef ALTERNATE_SHEBANG
2677 static char as[] = ALTERNATE_SHEBANG;
2678 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2679 d = s + (sizeof(as) - 1);
2681 #endif /* ALTERNATE_SHEBANG */
2690 while (*d && !isSPACE(*d))
2694 #ifdef ARG_ZERO_IS_SCRIPT
2695 if (ipathend > ipath) {
2697 * HP-UX (at least) sets argv[0] to the script name,
2698 * which makes $^X incorrect. And Digital UNIX and Linux,
2699 * at least, set argv[0] to the basename of the Perl
2700 * interpreter. So, having found "#!", we'll set it right.
2702 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2703 assert(SvPOK(x) || SvGMAGICAL(x));
2704 if (sv_eq(x, CopFILESV(PL_curcop))) {
2705 sv_setpvn(x, ipath, ipathend - ipath);
2708 TAINT_NOT; /* $^X is always tainted, but that's OK */
2710 #endif /* ARG_ZERO_IS_SCRIPT */
2715 d = instr(s,"perl -");
2717 d = instr(s,"perl");
2719 /* avoid getting into infinite loops when shebang
2720 * line contains "Perl" rather than "perl" */
2722 for (d = ipathend-4; d >= ipath; --d) {
2723 if ((*d == 'p' || *d == 'P')
2724 && !ibcmp(d, "perl", 4))
2734 #ifdef ALTERNATE_SHEBANG
2736 * If the ALTERNATE_SHEBANG on this system starts with a
2737 * character that can be part of a Perl expression, then if
2738 * we see it but not "perl", we're probably looking at the
2739 * start of Perl code, not a request to hand off to some
2740 * other interpreter. Similarly, if "perl" is there, but
2741 * not in the first 'word' of the line, we assume the line
2742 * contains the start of the Perl program.
2744 if (d && *s != '#') {
2746 while (*c && !strchr("; \t\r\n\f\v#", *c))
2749 d = Nullch; /* "perl" not in first word; ignore */
2751 *s = '#'; /* Don't try to parse shebang line */
2753 #endif /* ALTERNATE_SHEBANG */
2754 #ifndef MACOS_TRADITIONAL
2759 !instr(s,"indir") &&
2760 instr(PL_origargv[0],"perl"))
2766 while (s < PL_bufend && isSPACE(*s))
2768 if (s < PL_bufend) {
2769 Newz(899,newargv,PL_origargc+3,char*);
2771 while (s < PL_bufend && !isSPACE(*s))
2774 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2777 newargv = PL_origargv;
2779 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2780 Perl_croak(aTHX_ "Can't exec %s", ipath);
2784 U32 oldpdb = PL_perldb;
2785 bool oldn = PL_minus_n;
2786 bool oldp = PL_minus_p;
2788 while (*d && !isSPACE(*d)) d++;
2789 while (SPACE_OR_TAB(*d)) d++;
2793 if (*d == 'M' || *d == 'm') {
2795 while (*d && !isSPACE(*d)) d++;
2796 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2799 d = moreswitches(d);
2801 if ((PERLDB_LINE && !oldpdb) ||
2802 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2803 /* if we have already added "LINE: while (<>) {",
2804 we must not do it again */
2806 sv_setpv(PL_linestr, "");
2807 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2808 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2809 PL_last_lop = PL_last_uni = Nullch;
2810 PL_preambled = FALSE;
2812 (void)gv_fetchfile(PL_origfilename);
2819 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2821 PL_lex_state = LEX_FORMLINE;
2826 #ifdef PERL_STRICT_CR
2827 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2829 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2831 case ' ': case '\t': case '\f': case 013:
2832 #ifdef MACOS_TRADITIONAL
2839 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2840 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2841 /* handle eval qq[#line 1 "foo"\n ...] */
2842 CopLINE_dec(PL_curcop);
2846 while (s < d && *s != '\n')
2850 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2851 Perl_croak(aTHX_ "panic: input overflow");
2853 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2855 PL_lex_state = LEX_FORMLINE;
2865 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2872 while (s < PL_bufend && SPACE_OR_TAB(*s))
2875 if (strnEQ(s,"=>",2)) {
2876 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2877 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2878 "### Saw unary minus before =>, forcing word '%s'\n", s);
2880 OPERATOR('-'); /* unary minus */
2882 PL_last_uni = PL_oldbufptr;
2884 case 'r': ftst = OP_FTEREAD; break;
2885 case 'w': ftst = OP_FTEWRITE; break;
2886 case 'x': ftst = OP_FTEEXEC; break;
2887 case 'o': ftst = OP_FTEOWNED; break;
2888 case 'R': ftst = OP_FTRREAD; break;
2889 case 'W': ftst = OP_FTRWRITE; break;
2890 case 'X': ftst = OP_FTREXEC; break;
2891 case 'O': ftst = OP_FTROWNED; break;
2892 case 'e': ftst = OP_FTIS; break;
2893 case 'z': ftst = OP_FTZERO; break;
2894 case 's': ftst = OP_FTSIZE; break;
2895 case 'f': ftst = OP_FTFILE; break;
2896 case 'd': ftst = OP_FTDIR; break;
2897 case 'l': ftst = OP_FTLINK; break;
2898 case 'p': ftst = OP_FTPIPE; break;
2899 case 'S': ftst = OP_FTSOCK; break;
2900 case 'u': ftst = OP_FTSUID; break;
2901 case 'g': ftst = OP_FTSGID; break;
2902 case 'k': ftst = OP_FTSVTX; break;
2903 case 'b': ftst = OP_FTBLK; break;
2904 case 'c': ftst = OP_FTCHR; break;
2905 case 't': ftst = OP_FTTTY; break;
2906 case 'T': ftst = OP_FTTEXT; break;
2907 case 'B': ftst = OP_FTBINARY; break;
2908 case 'M': case 'A': case 'C':
2909 gv_fetchpv("\024",TRUE, SVt_PV);
2911 case 'M': ftst = OP_FTMTIME; break;
2912 case 'A': ftst = OP_FTATIME; break;
2913 case 'C': ftst = OP_FTCTIME; break;
2921 PL_last_lop_op = ftst;
2922 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2923 "### Saw file test %c\n", (int)ftst);
2928 /* Assume it was a minus followed by a one-letter named
2929 * subroutine call (or a -bareword), then. */
2930 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2931 "### %c looked like a file test but was not\n",
2940 if (PL_expect == XOPERATOR)
2945 else if (*s == '>') {
2948 if (isIDFIRST_lazy_if(s,UTF)) {
2949 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2957 if (PL_expect == XOPERATOR)
2960 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2962 OPERATOR('-'); /* unary minus */
2969 if (PL_expect == XOPERATOR)
2974 if (PL_expect == XOPERATOR)
2977 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2983 if (PL_expect != XOPERATOR) {
2984 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2985 PL_expect = XOPERATOR;
2986 force_ident(PL_tokenbuf, '*');
2999 if (PL_expect == XOPERATOR) {
3003 PL_tokenbuf[0] = '%';
3004 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
3005 if (!PL_tokenbuf[1]) {
3007 yyerror("Final % should be \\% or %name");
3010 PL_pending_ident = '%';
3029 switch (PL_expect) {
3032 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3034 PL_bufptr = s; /* update in case we back off */
3040 PL_expect = XTERMBLOCK;
3044 while (isIDFIRST_lazy_if(s,UTF)) {
3045 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3046 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3047 if (tmp < 0) tmp = -tmp;
3062 d = scan_str(d,TRUE,TRUE);
3064 /* MUST advance bufptr here to avoid bogus
3065 "at end of line" context messages from yyerror().
3067 PL_bufptr = s + len;
3068 yyerror("Unterminated attribute parameter in attribute list");
3071 return 0; /* EOF indicator */
3075 SV *sv = newSVpvn(s, len);
3076 sv_catsv(sv, PL_lex_stuff);
3077 attrs = append_elem(OP_LIST, attrs,
3078 newSVOP(OP_CONST, 0, sv));
3079 SvREFCNT_dec(PL_lex_stuff);
3080 PL_lex_stuff = Nullsv;
3083 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3084 CvLVALUE_on(PL_compcv);
3085 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3086 CvLOCKED_on(PL_compcv);
3087 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3088 CvMETHOD_on(PL_compcv);
3090 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "shared", len))
3091 GvSHARED_on(cGVOPx_gv(yylval.opval));
3093 /* After we've set the flags, it could be argued that
3094 we don't need to do the attributes.pm-based setting
3095 process, and shouldn't bother appending recognized
3096 flags. To experiment with that, uncomment the
3097 following "else": */
3099 attrs = append_elem(OP_LIST, attrs,
3100 newSVOP(OP_CONST, 0,
3104 if (*s == ':' && s[1] != ':')
3107 break; /* require real whitespace or :'s */
3109 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3110 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3111 char q = ((*s == '\'') ? '"' : '\'');
3112 /* If here for an expression, and parsed no attrs, back off. */
3113 if (tmp == '=' && !attrs) {
3117 /* MUST advance bufptr here to avoid bogus "at end of line"
3118 context messages from yyerror().
3122 yyerror("Unterminated attribute list");
3124 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3132 PL_nextval[PL_nexttoke].opval = attrs;
3140 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3141 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3157 if (PL_lex_brackets <= 0)
3158 yyerror("Unmatched right square bracket");
3161 if (PL_lex_state == LEX_INTERPNORMAL) {
3162 if (PL_lex_brackets == 0) {
3163 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3164 PL_lex_state = LEX_INTERPEND;
3171 if (PL_lex_brackets > 100) {
3172 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3173 if (newlb != PL_lex_brackstack) {
3175 PL_lex_brackstack = newlb;
3178 switch (PL_expect) {
3180 if (PL_lex_formbrack) {
3184 if (PL_oldoldbufptr == PL_last_lop)
3185 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3187 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3188 OPERATOR(HASHBRACK);
3190 while (s < PL_bufend && SPACE_OR_TAB(*s))
3193 PL_tokenbuf[0] = '\0';
3194 if (d < PL_bufend && *d == '-') {
3195 PL_tokenbuf[0] = '-';
3197 while (d < PL_bufend && SPACE_OR_TAB(*d))
3200 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3201 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3203 while (d < PL_bufend && SPACE_OR_TAB(*d))
3206 char minus = (PL_tokenbuf[0] == '-');
3207 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3215 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3220 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3225 if (PL_oldoldbufptr == PL_last_lop)
3226 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3228 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3231 OPERATOR(HASHBRACK);
3232 /* This hack serves to disambiguate a pair of curlies
3233 * as being a block or an anon hash. Normally, expectation
3234 * determines that, but in cases where we're not in a
3235 * position to expect anything in particular (like inside
3236 * eval"") we have to resolve the ambiguity. This code
3237 * covers the case where the first term in the curlies is a
3238 * quoted string. Most other cases need to be explicitly
3239 * disambiguated by prepending a `+' before the opening
3240 * curly in order to force resolution as an anon hash.
3242 * XXX should probably propagate the outer expectation
3243 * into eval"" to rely less on this hack, but that could
3244 * potentially break current behavior of eval"".
3248 if (*s == '\'' || *s == '"' || *s == '`') {
3249 /* common case: get past first string, handling escapes */
3250 for (t++; t < PL_bufend && *t != *s;)
3251 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3255 else if (*s == 'q') {
3258 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3262 char open, close, term;
3265 while (t < PL_bufend && isSPACE(*t))
3269 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3273 for (t++; t < PL_bufend; t++) {
3274 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3276 else if (*t == open)
3280 for (t++; t < PL_bufend; t++) {
3281 if (*t == '\\' && t+1 < PL_bufend)
3283 else if (*t == close && --brackets <= 0)
3285 else if (*t == open)
3291 else if (isALNUM_lazy_if(t,UTF)) {
3293 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3296 while (t < PL_bufend && isSPACE(*t))
3298 /* if comma follows first term, call it an anon hash */
3299 /* XXX it could be a comma expression with loop modifiers */
3300 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3301 || (*t == '=' && t[1] == '>')))
3302 OPERATOR(HASHBRACK);
3303 if (PL_expect == XREF)
3306 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3312 yylval.ival = CopLINE(PL_curcop);
3313 if (isSPACE(*s) || *s == '#')
3314 PL_copline = NOLINE; /* invalidate current command line number */
3319 if (PL_lex_brackets <= 0)
3320 yyerror("Unmatched right curly bracket");
3322 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3323 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3324 PL_lex_formbrack = 0;
3325 if (PL_lex_state == LEX_INTERPNORMAL) {
3326 if (PL_lex_brackets == 0) {
3327 if (PL_expect & XFAKEBRACK) {
3328 PL_expect &= XENUMMASK;
3329 PL_lex_state = LEX_INTERPEND;
3331 return yylex(); /* ignore fake brackets */
3333 if (*s == '-' && s[1] == '>')
3334 PL_lex_state = LEX_INTERPENDMAYBE;
3335 else if (*s != '[' && *s != '{')
3336 PL_lex_state = LEX_INTERPEND;
3339 if (PL_expect & XFAKEBRACK) {
3340 PL_expect &= XENUMMASK;
3342 return yylex(); /* ignore fake brackets */
3352 if (PL_expect == XOPERATOR) {
3353 if (ckWARN(WARN_SEMICOLON)
3354 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3356 CopLINE_dec(PL_curcop);
3357 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3358 CopLINE_inc(PL_curcop);
3363 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3365 PL_expect = XOPERATOR;
3366 force_ident(PL_tokenbuf, '&');
3370 yylval.ival = (OPpENTERSUB_AMPER<<8);
3389 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3390 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3392 if (PL_expect == XSTATE && isALPHA(tmp) &&
3393 (s == PL_linestart+1 || s[-2] == '\n') )
3395 if (PL_in_eval && !PL_rsfp) {
3400 if (strnEQ(s,"=cut",4)) {
3414 PL_doextract = TRUE;
3417 if (PL_lex_brackets < PL_lex_formbrack) {
3419 #ifdef PERL_STRICT_CR
3420 for (t = s; SPACE_OR_TAB(*t); t++) ;
3422 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3424 if (*t == '\n' || *t == '#') {
3442 if (PL_expect != XOPERATOR) {
3443 if (s[1] != '<' && !strchr(s,'>'))
3446 s = scan_heredoc(s);
3448 s = scan_inputsymbol(s);
3449 TERM(sublex_start());
3454 SHop(OP_LEFT_SHIFT);
3468 SHop(OP_RIGHT_SHIFT);
3477 if (PL_expect == XOPERATOR) {
3478 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3481 return ','; /* grandfather non-comma-format format */
3485 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3486 PL_tokenbuf[0] = '@';
3487 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3488 sizeof PL_tokenbuf - 1, FALSE);
3489 if (PL_expect == XOPERATOR)
3490 no_op("Array length", s);
3491 if (!PL_tokenbuf[1])
3493 PL_expect = XOPERATOR;
3494 PL_pending_ident = '#';
3498 PL_tokenbuf[0] = '$';
3499 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3500 sizeof PL_tokenbuf - 1, FALSE);
3501 if (PL_expect == XOPERATOR)
3503 if (!PL_tokenbuf[1]) {
3505 yyerror("Final $ should be \\$ or $name");
3509 /* This kludge not intended to be bulletproof. */
3510 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3511 yylval.opval = newSVOP(OP_CONST, 0,
3512 newSViv(PL_compiling.cop_arybase));
3513 yylval.opval->op_private = OPpCONST_ARYBASE;
3519 if (PL_lex_state == LEX_NORMAL)
3522 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3525 PL_tokenbuf[0] = '@';
3526 if (ckWARN(WARN_SYNTAX)) {
3528 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3531 PL_bufptr = skipspace(PL_bufptr);
3532 while (t < PL_bufend && *t != ']')
3534 Perl_warner(aTHX_ WARN_SYNTAX,
3535 "Multidimensional syntax %.*s not supported",
3536 (t - PL_bufptr) + 1, PL_bufptr);
3540 else if (*s == '{') {
3541 PL_tokenbuf[0] = '%';
3542 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3543 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3545 char tmpbuf[sizeof PL_tokenbuf];
3547 for (t++; isSPACE(*t); t++) ;
3548 if (isIDFIRST_lazy_if(t,UTF)) {
3549 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3550 for (; isSPACE(*t); t++) ;
3551 if (*t == ';' && get_cv(tmpbuf, FALSE))
3552 Perl_warner(aTHX_ WARN_SYNTAX,
3553 "You need to quote \"%s\"", tmpbuf);
3559 PL_expect = XOPERATOR;
3560 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3561 bool islop = (PL_last_lop == PL_oldoldbufptr);
3562 if (!islop || PL_last_lop_op == OP_GREPSTART)
3563 PL_expect = XOPERATOR;
3564 else if (strchr("$@\"'`q", *s))
3565 PL_expect = XTERM; /* e.g. print $fh "foo" */
3566 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3567 PL_expect = XTERM; /* e.g. print $fh &sub */
3568 else if (isIDFIRST_lazy_if(s,UTF)) {
3569 char tmpbuf[sizeof PL_tokenbuf];
3570 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3571 if ((tmp = keyword(tmpbuf, len))) {
3572 /* binary operators exclude handle interpretations */
3584 PL_expect = XTERM; /* e.g. print $fh length() */
3589 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3590 if (gv && GvCVu(gv))
3591 PL_expect = XTERM; /* e.g. print $fh subr() */
3594 else if (isDIGIT(*s))
3595 PL_expect = XTERM; /* e.g. print $fh 3 */
3596 else if (*s == '.' && isDIGIT(s[1]))
3597 PL_expect = XTERM; /* e.g. print $fh .3 */
3598 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3599 PL_expect = XTERM; /* e.g. print $fh -1 */
3600 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3601 PL_expect = XTERM; /* print $fh <<"EOF" */
3603 PL_pending_ident = '$';
3607 if (PL_expect == XOPERATOR)
3609 PL_tokenbuf[0] = '@';
3610 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3611 if (!PL_tokenbuf[1]) {
3613 yyerror("Final @ should be \\@ or @name");
3616 if (PL_lex_state == LEX_NORMAL)
3618 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3620 PL_tokenbuf[0] = '%';
3622 /* Warn about @ where they meant $. */
3623 if (ckWARN(WARN_SYNTAX)) {
3624 if (*s == '[' || *s == '{') {
3626 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3628 if (*t == '}' || *t == ']') {
3630 PL_bufptr = skipspace(PL_bufptr);
3631 Perl_warner(aTHX_ WARN_SYNTAX,
3632 "Scalar value %.*s better written as $%.*s",
3633 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3638 PL_pending_ident = '@';
3641 case '/': /* may either be division or pattern */
3642 case '?': /* may either be conditional or pattern */
3643 if (PL_expect != XOPERATOR) {
3644 /* Disable warning on "study /blah/" */
3645 if (PL_oldoldbufptr == PL_last_uni
3646 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3647 || memNE(PL_last_uni, "study", 5)
3648 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3650 s = scan_pat(s,OP_MATCH);
3651 TERM(sublex_start());
3659 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3660 #ifdef PERL_STRICT_CR
3663 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3665 && (s == PL_linestart || s[-1] == '\n') )
3667 PL_lex_formbrack = 0;
3671 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3677 yylval.ival = OPf_SPECIAL;
3683 if (PL_expect != XOPERATOR)
3688 case '0': case '1': case '2': case '3': case '4':
3689 case '5': case '6': case '7': case '8': case '9':
3690 s = scan_num(s, &yylval);
3691 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3692 "### Saw number in '%s'\n", s);
3694 if (PL_expect == XOPERATOR)
3699 s = scan_str(s,FALSE,FALSE);
3700 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3701 "### Saw string before '%s'\n", s);
3703 if (PL_expect == XOPERATOR) {
3704 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3707 return ','; /* grandfather non-comma-format format */
3713 missingterm((char*)0);
3714 yylval.ival = OP_CONST;
3715 TERM(sublex_start());
3718 s = scan_str(s,FALSE,FALSE);
3719 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3720 "### Saw string before '%s'\n", s);
3722 if (PL_expect == XOPERATOR) {
3723 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3726 return ','; /* grandfather non-comma-format format */
3732 missingterm((char*)0);
3733 yylval.ival = OP_CONST;
3734 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3735 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3736 yylval.ival = OP_STRINGIFY;
3740 TERM(sublex_start());
3743 s = scan_str(s,FALSE,FALSE);
3744 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3745 "### Saw backtick string before '%s'\n", s);
3747 if (PL_expect == XOPERATOR)
3748 no_op("Backticks",s);
3750 missingterm((char*)0);
3751 yylval.ival = OP_BACKTICK;
3753 TERM(sublex_start());
3757 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3758 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3760 if (PL_expect == XOPERATOR)
3761 no_op("Backslash",s);
3765 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3769 while (isDIGIT(*start) || *start == '_')
3771 if (*start == '.' && isDIGIT(start[1])) {
3772 s = scan_num(s, &yylval);
3775 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3776 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3780 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3783 s = scan_num(s, &yylval);
3790 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3829 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3831 /* Some keywords can be followed by any delimiter, including ':' */
3832 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3833 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3834 (PL_tokenbuf[0] == 'q' &&
3835 strchr("qwxr", PL_tokenbuf[1])))));
3837 /* x::* is just a word, unless x is "CORE" */
3838 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3842 while (d < PL_bufend && isSPACE(*d))
3843 d++; /* no comments skipped here, or s### is misparsed */
3845 /* Is this a label? */
3846 if (!tmp && PL_expect == XSTATE
3847 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3849 yylval.pval = savepv(PL_tokenbuf);
3854 /* Check for keywords */
3855 tmp = keyword(PL_tokenbuf, len);
3857 /* Is this a word before a => operator? */
3858 if (*d == '=' && d[1] == '>') {
3860 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3861 yylval.opval->op_private = OPpCONST_BARE;
3862 if (UTF && !IN_BYTE && is_utf8_string((U8*)PL_tokenbuf, len))
3863 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3867 if (tmp < 0) { /* second-class keyword? */
3868 GV *ogv = Nullgv; /* override (winner) */
3869 GV *hgv = Nullgv; /* hidden (loser) */
3870 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3872 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3875 if (GvIMPORTED_CV(gv))
3877 else if (! CvMETHOD(cv))
3881 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3882 (gv = *gvp) != (GV*)&PL_sv_undef &&
3883 GvCVu(gv) && GvIMPORTED_CV(gv))
3889 tmp = 0; /* overridden by import or by GLOBAL */
3892 && -tmp==KEY_lock /* XXX generalizable kludge */
3894 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3896 tmp = 0; /* any sub overrides "weak" keyword */
3898 else { /* no override */
3902 if (ckWARN(WARN_AMBIGUOUS) && hgv
3903 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3904 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3905 "Ambiguous call resolved as CORE::%s(), %s",
3906 GvENAME(hgv), "qualify as such or use &");
3913 default: /* not a keyword */
3916 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3918 /* Get the rest if it looks like a package qualifier */
3920 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3922 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3925 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3926 *s == '\'' ? "'" : "::");
3930 if (PL_expect == XOPERATOR) {
3931 if (PL_bufptr == PL_linestart) {
3932 CopLINE_dec(PL_curcop);
3933 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3934 CopLINE_inc(PL_curcop);
3937 no_op("Bareword",s);
3940 /* Look for a subroutine with this name in current package,
3941 unless name is "Foo::", in which case Foo is a bearword
3942 (and a package name). */
3945 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3947 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3948 Perl_warner(aTHX_ WARN_BAREWORD,
3949 "Bareword \"%s\" refers to nonexistent package",
3952 PL_tokenbuf[len] = '\0';
3959 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3962 /* if we saw a global override before, get the right name */
3965 sv = newSVpvn("CORE::GLOBAL::",14);
3966 sv_catpv(sv,PL_tokenbuf);
3969 sv = newSVpv(PL_tokenbuf,0);
3971 /* Presume this is going to be a bareword of some sort. */
3974 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3975 yylval.opval->op_private = OPpCONST_BARE;
3977 /* And if "Foo::", then that's what it certainly is. */
3982 /* See if it's the indirect object for a list operator. */
3984 if (PL_oldoldbufptr &&
3985 PL_oldoldbufptr < PL_bufptr &&
3986 (PL_oldoldbufptr == PL_last_lop
3987 || PL_oldoldbufptr == PL_last_uni) &&
3988 /* NO SKIPSPACE BEFORE HERE! */
3989 (PL_expect == XREF ||
3990 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3992 bool immediate_paren = *s == '(';
3994 /* (Now we can afford to cross potential line boundary.) */
3997 /* Two barewords in a row may indicate method call. */
3999 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4002 /* If not a declared subroutine, it's an indirect object. */
4003 /* (But it's an indir obj regardless for sort.) */
4005 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4006 ((!gv || !GvCVu(gv)) &&
4007 (PL_last_lop_op != OP_MAPSTART &&
4008 PL_last_lop_op != OP_GREPSTART))))
4010 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4016 PL_expect = XOPERATOR;
4019 /* Is this a word before a => operator? */
4020 if (*s == '=' && s[1] == '>') {
4022 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4023 if (UTF && !IN_BYTE && is_utf8_string((U8*)PL_tokenbuf, len))
4024 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4028 /* If followed by a paren, it's certainly a subroutine. */
4031 if (gv && GvCVu(gv)) {
4032 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4033 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4038 PL_nextval[PL_nexttoke].opval = yylval.opval;
4039 PL_expect = XOPERATOR;
4045 /* If followed by var or block, call it a method (unless sub) */
4047 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4048 PL_last_lop = PL_oldbufptr;
4049 PL_last_lop_op = OP_METHOD;
4053 /* If followed by a bareword, see if it looks like indir obj. */
4055 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4058 /* Not a method, so call it a subroutine (if defined) */
4060 if (gv && GvCVu(gv)) {
4062 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4063 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4064 "Ambiguous use of -%s resolved as -&%s()",
4065 PL_tokenbuf, PL_tokenbuf);
4066 /* Check for a constant sub */
4068 if ((sv = cv_const_sv(cv))) {
4070 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4071 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4072 yylval.opval->op_private = 0;
4076 /* Resolve to GV now. */
4077 op_free(yylval.opval);
4078 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4079 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4080 PL_last_lop = PL_oldbufptr;
4081 PL_last_lop_op = OP_ENTERSUB;
4082 /* Is there a prototype? */
4085 char *proto = SvPV((SV*)cv, len);
4088 if (strEQ(proto, "$"))
4090 if (*proto == '&' && *s == '{') {
4091 sv_setpv(PL_subname,"__ANON__");
4095 PL_nextval[PL_nexttoke].opval = yylval.opval;
4101 /* Call it a bare word */
4103 if (PL_hints & HINT_STRICT_SUBS)
4104 yylval.opval->op_private |= OPpCONST_STRICT;
4107 if (ckWARN(WARN_RESERVED)) {
4108 if (lastchar != '-') {
4109 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4111 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
4118 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4119 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4120 "Operator or semicolon missing before %c%s",
4121 lastchar, PL_tokenbuf);
4122 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4123 "Ambiguous use of %c resolved as operator %c",
4124 lastchar, lastchar);
4130 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4131 newSVpv(CopFILE(PL_curcop),0));
4135 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4136 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4139 case KEY___PACKAGE__:
4140 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4142 ? newSVsv(PL_curstname)
4151 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4152 char *pname = "main";
4153 if (PL_tokenbuf[2] == 'D')
4154 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4155 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4158 GvIOp(gv) = newIO();
4159 IoIFP(GvIOp(gv)) = PL_rsfp;
4160 #if defined(HAS_FCNTL) && defined(F_SETFD)
4162 int fd = PerlIO_fileno(PL_rsfp);
4163 fcntl(fd,F_SETFD,fd >= 3);
4166 /* Mark this internal pseudo-handle as clean */
4167 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4169 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4170 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4171 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4173 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4174 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4175 /* if the script was opened in binmode, we need to revert
4176 * it to text mode for compatibility; but only iff it has CRs
4177 * XXX this is a questionable hack at best. */
4178 if (PL_bufend-PL_bufptr > 2
4179 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4182 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4183 loc = PerlIO_tell(PL_rsfp);
4184 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4186 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4187 #ifdef PERLIO_IS_STDIO /* really? */
4188 # if defined(__BORLANDC__)
4189 /* XXX see note in do_binmode() */
4190 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4194 PerlIO_seek(PL_rsfp, loc, 0);
4198 #ifdef PERLIO_LAYERS
4199 if (UTF && !IN_BYTE)
4200 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4213 if (PL_expect == XSTATE) {
4220 if (*s == ':' && s[1] == ':') {
4223 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4224 if (!(tmp = keyword(PL_tokenbuf, len)))
4225 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4239 LOP(OP_ACCEPT,XTERM);
4245 LOP(OP_ATAN2,XTERM);
4251 LOP(OP_BINMODE,XTERM);
4254 LOP(OP_BLESS,XTERM);
4263 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4280 if (!PL_cryptseen) {
4281 PL_cryptseen = TRUE;
4285 LOP(OP_CRYPT,XTERM);
4288 if (ckWARN(WARN_CHMOD)) {
4289 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4290 if (*d != '0' && isDIGIT(*d))
4291 Perl_warner(aTHX_ WARN_CHMOD,
4292 "chmod() mode argument is missing initial 0");
4294 LOP(OP_CHMOD,XTERM);
4297 LOP(OP_CHOWN,XTERM);
4300 LOP(OP_CONNECT,XTERM);
4316 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4320 PL_hints |= HINT_BLOCK_SCOPE;
4330 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4331 LOP(OP_DBMOPEN,XTERM);
4337 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4344 yylval.ival = CopLINE(PL_curcop);
4358 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4359 UNIBRACK(OP_ENTEREVAL);
4374 case KEY_endhostent:
4380 case KEY_endservent:
4383 case KEY_endprotoent:
4394 yylval.ival = CopLINE(PL_curcop);
4396 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4398 if ((PL_bufend - p) >= 3 &&
4399 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4401 else if ((PL_bufend - p) >= 4 &&
4402 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4405 if (isIDFIRST_lazy_if(p,UTF)) {
4406 p = scan_ident(p, PL_bufend,
4407 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4411 Perl_croak(aTHX_ "Missing $ on loop variable");
4416 LOP(OP_FORMLINE,XTERM);
4422 LOP(OP_FCNTL,XTERM);
4428 LOP(OP_FLOCK,XTERM);
4437 LOP(OP_GREPSTART, XREF);
4440 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4455 case KEY_getpriority:
4456 LOP(OP_GETPRIORITY,XTERM);
4458 case KEY_getprotobyname:
4461 case KEY_getprotobynumber:
4462 LOP(OP_GPBYNUMBER,XTERM);
4464 case KEY_getprotoent:
4476 case KEY_getpeername:
4477 UNI(OP_GETPEERNAME);
4479 case KEY_gethostbyname:
4482 case KEY_gethostbyaddr:
4483 LOP(OP_GHBYADDR,XTERM);
4485 case KEY_gethostent:
4488 case KEY_getnetbyname:
4491 case KEY_getnetbyaddr:
4492 LOP(OP_GNBYADDR,XTERM);
4497 case KEY_getservbyname:
4498 LOP(OP_GSBYNAME,XTERM);
4500 case KEY_getservbyport:
4501 LOP(OP_GSBYPORT,XTERM);
4503 case KEY_getservent:
4506 case KEY_getsockname:
4507 UNI(OP_GETSOCKNAME);
4509 case KEY_getsockopt:
4510 LOP(OP_GSOCKOPT,XTERM);
4532 yylval.ival = CopLINE(PL_curcop);
4536 LOP(OP_INDEX,XTERM);
4542 LOP(OP_IOCTL,XTERM);
4554 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4586 LOP(OP_LISTEN,XTERM);
4595 s = scan_pat(s,OP_MATCH);
4596 TERM(sublex_start());
4599 LOP(OP_MAPSTART, XREF);
4602 LOP(OP_MKDIR,XTERM);
4605 LOP(OP_MSGCTL,XTERM);
4608 LOP(OP_MSGGET,XTERM);
4611 LOP(OP_MSGRCV,XTERM);
4614 LOP(OP_MSGSND,XTERM);
4620 if (isIDFIRST_lazy_if(s,UTF)) {
4621 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4622 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4624 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4625 if (!PL_in_my_stash) {
4628 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4636 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4643 if (PL_expect != XSTATE)
4644 yyerror("\"no\" not allowed in expression");
4645 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4646 s = force_version(s);
4651 if (*s == '(' || (s = skipspace(s), *s == '('))
4658 if (isIDFIRST_lazy_if(s,UTF)) {
4660 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4662 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4663 Perl_warner(aTHX_ WARN_PRECEDENCE,
4664 "Precedence problem: open %.*s should be open(%.*s)",
4670 yylval.ival = OP_OR;
4680 LOP(OP_OPEN_DIR,XTERM);
4683 checkcomma(s,PL_tokenbuf,"filehandle");
4687 checkcomma(s,PL_tokenbuf,"filehandle");
4706 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4710 LOP(OP_PIPE_OP,XTERM);
4713 s = scan_str(s,FALSE,FALSE);
4715 missingterm((char*)0);
4716 yylval.ival = OP_CONST;
4717 TERM(sublex_start());
4723 s = scan_str(s,FALSE,FALSE);
4725 missingterm((char*)0);
4727 if (SvCUR(PL_lex_stuff)) {
4730 d = SvPV_force(PL_lex_stuff, len);
4733 for (; isSPACE(*d) && len; --len, ++d) ;
4736 if (!warned && ckWARN(WARN_QW)) {
4737 for (; !isSPACE(*d) && len; --len, ++d) {
4739 Perl_warner(aTHX_ WARN_QW,
4740 "Possible attempt to separate words with commas");
4743 else if (*d == '#') {
4744 Perl_warner(aTHX_ WARN_QW,
4745 "Possible attempt to put comments in qw() list");
4751 for (; !isSPACE(*d) && len; --len, ++d) ;
4753 sv = newSVpvn(b, d-b);
4754 if (DO_UTF8(PL_lex_stuff))
4756 words = append_elem(OP_LIST, words,
4757 newSVOP(OP_CONST, 0, tokeq(sv)));
4761 PL_nextval[PL_nexttoke].opval = words;
4766 SvREFCNT_dec(PL_lex_stuff);
4767 PL_lex_stuff = Nullsv;
4773 s = scan_str(s,FALSE,FALSE);
4775 missingterm((char*)0);
4776 yylval.ival = OP_STRINGIFY;
4777 if (SvIVX(PL_lex_stuff) == '\'')
4778 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4779 TERM(sublex_start());
4782 s = scan_pat(s,OP_QR);
4783 TERM(sublex_start());
4786 s = scan_str(s,FALSE,FALSE);
4788 missingterm((char*)0);
4789 yylval.ival = OP_BACKTICK;
4791 TERM(sublex_start());
4798 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4799 s = force_version(s);
4802 *PL_tokenbuf = '\0';
4803 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4804 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4805 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4807 yyerror("<> should be quotes");
4815 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4819 LOP(OP_RENAME,XTERM);
4828 LOP(OP_RINDEX,XTERM);
4851 LOP(OP_REVERSE,XTERM);
4862 TERM(sublex_start());
4864 TOKEN(1); /* force error */
4873 LOP(OP_SELECT,XTERM);
4879 LOP(OP_SEMCTL,XTERM);
4882 LOP(OP_SEMGET,XTERM);
4885 LOP(OP_SEMOP,XTERM);
4891 LOP(OP_SETPGRP,XTERM);
4893 case KEY_setpriority:
4894 LOP(OP_SETPRIORITY,XTERM);
4896 case KEY_sethostent:
4902 case KEY_setservent:
4905 case KEY_setprotoent:
4915 LOP(OP_SEEKDIR,XTERM);
4917 case KEY_setsockopt:
4918 LOP(OP_SSOCKOPT,XTERM);
4924 LOP(OP_SHMCTL,XTERM);
4927 LOP(OP_SHMGET,XTERM);
4930 LOP(OP_SHMREAD,XTERM);
4933 LOP(OP_SHMWRITE,XTERM);
4936 LOP(OP_SHUTDOWN,XTERM);
4945 LOP(OP_SOCKET,XTERM);
4947 case KEY_socketpair:
4948 LOP(OP_SOCKPAIR,XTERM);
4951 checkcomma(s,PL_tokenbuf,"subroutine name");
4953 if (*s == ';' || *s == ')') /* probably a close */
4954 Perl_croak(aTHX_ "sort is now a reserved word");
4956 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4960 LOP(OP_SPLIT,XTERM);
4963 LOP(OP_SPRINTF,XTERM);
4966 LOP(OP_SPLICE,XTERM);
4981 LOP(OP_SUBSTR,XTERM);
4987 char tmpbuf[sizeof PL_tokenbuf];
4989 expectation attrful;
4990 bool have_name, have_proto;
4995 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4996 (*s == ':' && s[1] == ':'))
4999 attrful = XATTRBLOCK;
5000 /* remember buffer pos'n for later force_word */
5001 tboffset = s - PL_oldbufptr;
5002 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5003 if (strchr(tmpbuf, ':'))
5004 sv_setpv(PL_subname, tmpbuf);
5006 sv_setsv(PL_subname,PL_curstname);
5007 sv_catpvn(PL_subname,"::",2);
5008 sv_catpvn(PL_subname,tmpbuf,len);
5015 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5016 PL_expect = XTERMBLOCK;
5017 attrful = XATTRTERM;
5018 sv_setpv(PL_subname,"?");
5022 if (key == KEY_format) {
5024 PL_lex_formbrack = PL_lex_brackets + 1;
5026 (void) force_word(PL_oldbufptr + tboffset, WORD,
5031 /* Look for a prototype */
5035 s = scan_str(s,FALSE,FALSE);
5037 Perl_croak(aTHX_ "Prototype not terminated");
5039 d = SvPVX(PL_lex_stuff);
5041 for (p = d; *p; ++p) {
5046 SvCUR(PL_lex_stuff) = tmp;
5054 if (*s == ':' && s[1] != ':')
5055 PL_expect = attrful;
5058 PL_nextval[PL_nexttoke].opval =
5059 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5060 PL_lex_stuff = Nullsv;
5064 sv_setpv(PL_subname,"__ANON__");
5067 (void) force_word(PL_oldbufptr + tboffset, WORD,
5076 LOP(OP_SYSTEM,XREF);
5079 LOP(OP_SYMLINK,XTERM);
5082 LOP(OP_SYSCALL,XTERM);
5085 LOP(OP_SYSOPEN,XTERM);
5088 LOP(OP_SYSSEEK,XTERM);
5091 LOP(OP_SYSREAD,XTERM);
5094 LOP(OP_SYSWRITE,XTERM);
5098 TERM(sublex_start());
5119 LOP(OP_TRUNCATE,XTERM);
5131 yylval.ival = CopLINE(PL_curcop);
5135 yylval.ival = CopLINE(PL_curcop);
5139 LOP(OP_UNLINK,XTERM);
5145 LOP(OP_UNPACK,XTERM);
5148 LOP(OP_UTIME,XTERM);
5151 if (ckWARN(WARN_UMASK)) {
5152 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5153 if (*d != '0' && isDIGIT(*d))
5154 Perl_warner(aTHX_ WARN_UMASK,
5155 "umask: argument is missing initial 0");
5160 LOP(OP_UNSHIFT,XTERM);
5163 if (PL_expect != XSTATE)
5164 yyerror("\"use\" not allowed in expression");
5166 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5167 s = force_version(s);
5168 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5169 PL_nextval[PL_nexttoke].opval = Nullop;
5174 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5175 s = force_version(s);
5187 yylval.ival = CopLINE(PL_curcop);
5191 PL_hints |= HINT_BLOCK_SCOPE;
5198 LOP(OP_WAITPID,XTERM);
5206 static char ctl_l[2];
5208 if (ctl_l[0] == '\0')
5209 ctl_l[0] = toCTRL('L');
5210 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5213 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5218 if (PL_expect == XOPERATOR)
5224 yylval.ival = OP_XOR;
5229 TERM(sublex_start());
5234 #pragma segment Main
5238 Perl_keyword(pTHX_ register char *d, I32 len)
5243 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5244 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5245 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5246 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5247 if (strEQ(d,"__END__")) return KEY___END__;
5251 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5256 if (strEQ(d,"and")) return -KEY_and;
5257 if (strEQ(d,"abs")) return -KEY_abs;
5260 if (strEQ(d,"alarm")) return -KEY_alarm;
5261 if (strEQ(d,"atan2")) return -KEY_atan2;
5264 if (strEQ(d,"accept")) return -KEY_accept;
5269 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5272 if (strEQ(d,"bless")) return -KEY_bless;
5273 if (strEQ(d,"bind")) return -KEY_bind;
5274 if (strEQ(d,"binmode")) return -KEY_binmode;
5277 if (strEQ(d,"CORE")) return -KEY_CORE;
5278 if (strEQ(d,"CHECK")) return KEY_CHECK;
5283 if (strEQ(d,"cmp")) return -KEY_cmp;
5284 if (strEQ(d,"chr")) return -KEY_chr;
5285 if (strEQ(d,"cos")) return -KEY_cos;
5288 if (strEQ(d,"chop")) return -KEY_chop;
5291 if (strEQ(d,"close")) return -KEY_close;
5292 if (strEQ(d,"chdir")) return -KEY_chdir;
5293 if (strEQ(d,"chomp")) return -KEY_chomp;
5294 if (strEQ(d,"chmod")) return -KEY_chmod;
5295 if (strEQ(d,"chown")) return -KEY_chown;
5296 if (strEQ(d,"crypt")) return -KEY_crypt;
5299 if (strEQ(d,"chroot")) return -KEY_chroot;
5300 if (strEQ(d,"caller")) return -KEY_caller;
5303 if (strEQ(d,"connect")) return -KEY_connect;
5306 if (strEQ(d,"closedir")) return -KEY_closedir;
5307 if (strEQ(d,"continue")) return -KEY_continue;
5312 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5317 if (strEQ(d,"do")) return KEY_do;
5320 if (strEQ(d,"die")) return -KEY_die;
5323 if (strEQ(d,"dump")) return -KEY_dump;
5326 if (strEQ(d,"delete")) return KEY_delete;
5329 if (strEQ(d,"defined")) return KEY_defined;
5330 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5333 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5338 if (strEQ(d,"END")) return KEY_END;
5343 if (strEQ(d,"eq")) return -KEY_eq;
5346 if (strEQ(d,"eof")) return -KEY_eof;
5347 if (strEQ(d,"exp")) return -KEY_exp;
5350 if (strEQ(d,"else")) return KEY_else;
5351 if (strEQ(d,"exit")) return -KEY_exit;
5352 if (strEQ(d,"eval")) return KEY_eval;
5353 if (strEQ(d,"exec")) return -KEY_exec;
5354 if (strEQ(d,"each")) return -KEY_each;
5357 if (strEQ(d,"elsif")) return KEY_elsif;
5360 if (strEQ(d,"exists")) return KEY_exists;
5361 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5364 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5365 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5368 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5371 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5372 if (strEQ(d,"endservent")) return -KEY_endservent;
5375 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5382 if (strEQ(d,"for")) return KEY_for;
5385 if (strEQ(d,"fork")) return -KEY_fork;
5388 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5389 if (strEQ(d,"flock")) return -KEY_flock;
5392 if (strEQ(d,"format")) return KEY_format;
5393 if (strEQ(d,"fileno")) return -KEY_fileno;
5396 if (strEQ(d,"foreach")) return KEY_foreach;
5399 if (strEQ(d,"formline")) return -KEY_formline;
5404 if (strnEQ(d,"get",3)) {
5409 if (strEQ(d,"ppid")) return -KEY_getppid;
5410 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5413 if (strEQ(d,"pwent")) return -KEY_getpwent;
5414 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5415 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5418 if (strEQ(d,"peername")) return -KEY_getpeername;
5419 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5420 if (strEQ(d,"priority")) return -KEY_getpriority;
5423 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5426 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5430 else if (*d == 'h') {
5431 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5432 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5433 if (strEQ(d,"hostent")) return -KEY_gethostent;
5435 else if (*d == 'n') {
5436 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5437 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5438 if (strEQ(d,"netent")) return -KEY_getnetent;
5440 else if (*d == 's') {
5441 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5442 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5443 if (strEQ(d,"servent")) return -KEY_getservent;
5444 if (strEQ(d,"sockname")) return -KEY_getsockname;
5445 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5447 else if (*d == 'g') {
5448 if (strEQ(d,"grent")) return -KEY_getgrent;
5449 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5450 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5452 else if (*d == 'l') {
5453 if (strEQ(d,"login")) return -KEY_getlogin;
5455 else if (strEQ(d,"c")) return -KEY_getc;
5460 if (strEQ(d,"gt")) return -KEY_gt;
5461 if (strEQ(d,"ge")) return -KEY_ge;
5464 if (strEQ(d,"grep")) return KEY_grep;
5465 if (strEQ(d,"goto")) return KEY_goto;
5466 if (strEQ(d,"glob")) return KEY_glob;
5469 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5474 if (strEQ(d,"hex")) return -KEY_hex;
5477 if (strEQ(d,"INIT")) return KEY_INIT;
5482 if (strEQ(d,"if")) return KEY_if;
5485 if (strEQ(d,"int")) return -KEY_int;
5488 if (strEQ(d,"index")) return -KEY_index;
5489 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5494 if (strEQ(d,"join")) return -KEY_join;
5498 if (strEQ(d,"keys")) return -KEY_keys;
5499 if (strEQ(d,"kill")) return -KEY_kill;
5505 if (strEQ(d,"lt")) return -KEY_lt;
5506 if (strEQ(d,"le")) return -KEY_le;
5507 if (strEQ(d,"lc")) return -KEY_lc;
5510 if (strEQ(d,"log")) return -KEY_log;
5513 if (strEQ(d,"last")) return KEY_last;
5514 if (strEQ(d,"link")) return -KEY_link;
5515 if (strEQ(d,"lock")) return -KEY_lock;
5518 if (strEQ(d,"local")) return KEY_local;
5519 if (strEQ(d,"lstat")) return -KEY_lstat;
5522 if (strEQ(d,"length")) return -KEY_length;
5523 if (strEQ(d,"listen")) return -KEY_listen;
5526 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5529 if (strEQ(d,"localtime")) return -KEY_localtime;
5535 case 1: return KEY_m;
5537 if (strEQ(d,"my")) return KEY_my;
5540 if (strEQ(d,"map")) return KEY_map;
5543 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5546 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5547 if (strEQ(d,"msgget")) return -KEY_msgget;
5548 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5549 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5554 if (strEQ(d,"next")) return KEY_next;
5555 if (strEQ(d,"ne")) return -KEY_ne;
5556 if (strEQ(d,"not")) return -KEY_not;
5557 if (strEQ(d,"no")) return KEY_no;
5562 if (strEQ(d,"or")) return -KEY_or;
5565 if (strEQ(d,"ord")) return -KEY_ord;
5566 if (strEQ(d,"oct")) return -KEY_oct;
5567 if (strEQ(d,"our")) return KEY_our;
5570 if (strEQ(d,"open")) return -KEY_open;
5573 if (strEQ(d,"opendir")) return -KEY_opendir;
5580 if (strEQ(d,"pop")) return -KEY_pop;
5581 if (strEQ(d,"pos")) return KEY_pos;
5584 if (strEQ(d,"push")) return -KEY_push;
5585 if (strEQ(d,"pack")) return -KEY_pack;
5586 if (strEQ(d,"pipe")) return -KEY_pipe;
5589 if (strEQ(d,"print")) return KEY_print;
5592 if (strEQ(d,"printf")) return KEY_printf;
5595 if (strEQ(d,"package")) return KEY_package;
5598 if (strEQ(d,"prototype")) return KEY_prototype;
5603 if (strEQ(d,"q")) return KEY_q;
5604 if (strEQ(d,"qr")) return KEY_qr;
5605 if (strEQ(d,"qq")) return KEY_qq;
5606 if (strEQ(d,"qw")) return KEY_qw;
5607 if (strEQ(d,"qx")) return KEY_qx;
5609 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5614 if (strEQ(d,"ref")) return -KEY_ref;
5617 if (strEQ(d,"read")) return -KEY_read;
5618 if (strEQ(d,"rand")) return -KEY_rand;
5619 if (strEQ(d,"recv")) return -KEY_recv;
5620 if (strEQ(d,"redo")) return KEY_redo;
5623 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5624 if (strEQ(d,"reset")) return -KEY_reset;
5627 if (strEQ(d,"return")) return KEY_return;
5628 if (strEQ(d,"rename")) return -KEY_rename;
5629 if (strEQ(d,"rindex")) return -KEY_rindex;
5632 if (strEQ(d,"require")) return KEY_require;
5633 if (strEQ(d,"reverse")) return -KEY_reverse;
5634 if (strEQ(d,"readdir")) return -KEY_readdir;
5637 if (strEQ(d,"readlink")) return -KEY_readlink;
5638 if (strEQ(d,"readline")) return -KEY_readline;
5639 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5642 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5648 case 0: return KEY_s;
5650 if (strEQ(d,"scalar")) return KEY_scalar;
5655 if (strEQ(d,"seek")) return -KEY_seek;
5656 if (strEQ(d,"send")) return -KEY_send;
5659 if (strEQ(d,"semop")) return -KEY_semop;
5662 if (strEQ(d,"select")) return -KEY_select;
5663 if (strEQ(d,"semctl")) return -KEY_semctl;
5664 if (strEQ(d,"semget")) return -KEY_semget;
5667 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5668 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5671 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5672 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5675 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5678 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5679 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5680 if (strEQ(d,"setservent")) return -KEY_setservent;
5683 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5684 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5691 if (strEQ(d,"shift")) return -KEY_shift;
5694 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5695 if (strEQ(d,"shmget")) return -KEY_shmget;
5698 if (strEQ(d,"shmread")) return -KEY_shmread;
5701 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5702 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5707 if (strEQ(d,"sin")) return -KEY_sin;
5710 if (strEQ(d,"sleep")) return -KEY_sleep;
5713 if (strEQ(d,"sort")) return KEY_sort;
5714 if (strEQ(d,"socket")) return -KEY_socket;
5715 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5718 if (strEQ(d,"split")) return KEY_split;
5719 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5720 if (strEQ(d,"splice")) return -KEY_splice;
5723 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5726 if (strEQ(d,"srand")) return -KEY_srand;
5729 if (strEQ(d,"stat")) return -KEY_stat;
5730 if (strEQ(d,"study")) return KEY_study;
5733 if (strEQ(d,"substr")) return -KEY_substr;
5734 if (strEQ(d,"sub")) return KEY_sub;
5739 if (strEQ(d,"system")) return -KEY_system;
5742 if (strEQ(d,"symlink")) return -KEY_symlink;
5743 if (strEQ(d,"syscall")) return -KEY_syscall;
5744 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5745 if (strEQ(d,"sysread")) return -KEY_sysread;
5746 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5749 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5758 if (strEQ(d,"tr")) return KEY_tr;
5761 if (strEQ(d,"tie")) return KEY_tie;
5764 if (strEQ(d,"tell")) return -KEY_tell;
5765 if (strEQ(d,"tied")) return KEY_tied;
5766 if (strEQ(d,"time")) return -KEY_time;
5769 if (strEQ(d,"times")) return -KEY_times;
5772 if (strEQ(d,"telldir")) return -KEY_telldir;
5775 if (strEQ(d,"truncate")) return -KEY_truncate;
5782 if (strEQ(d,"uc")) return -KEY_uc;
5785 if (strEQ(d,"use")) return KEY_use;
5788 if (strEQ(d,"undef")) return KEY_undef;
5789 if (strEQ(d,"until")) return KEY_until;
5790 if (strEQ(d,"untie")) return KEY_untie;
5791 if (strEQ(d,"utime")) return -KEY_utime;
5792 if (strEQ(d,"umask")) return -KEY_umask;
5795 if (strEQ(d,"unless")) return KEY_unless;
5796 if (strEQ(d,"unpack")) return -KEY_unpack;
5797 if (strEQ(d,"unlink")) return -KEY_unlink;
5800 if (strEQ(d,"unshift")) return -KEY_unshift;
5801 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5806 if (strEQ(d,"values")) return -KEY_values;
5807 if (strEQ(d,"vec")) return -KEY_vec;
5812 if (strEQ(d,"warn")) return -KEY_warn;
5813 if (strEQ(d,"wait")) return -KEY_wait;
5816 if (strEQ(d,"while")) return KEY_while;
5817 if (strEQ(d,"write")) return -KEY_write;
5820 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5823 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5828 if (len == 1) return -KEY_x;
5829 if (strEQ(d,"xor")) return -KEY_xor;
5832 if (len == 1) return KEY_y;
5841 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5845 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5846 if (ckWARN(WARN_SYNTAX)) {
5848 for (w = s+2; *w && level; w++) {
5855 for (; *w && isSPACE(*w); w++) ;
5856 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5857 Perl_warner(aTHX_ WARN_SYNTAX,
5858 "%s (...) interpreted as function",name);
5861 while (s < PL_bufend && isSPACE(*s))
5865 while (s < PL_bufend && isSPACE(*s))
5867 if (isIDFIRST_lazy_if(s,UTF)) {
5869 while (isALNUM_lazy_if(s,UTF))
5871 while (s < PL_bufend && isSPACE(*s))
5876 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5880 Perl_croak(aTHX_ "No comma allowed after %s", what);
5885 /* Either returns sv, or mortalizes sv and returns a new SV*.
5886 Best used as sv=new_constant(..., sv, ...).
5887 If s, pv are NULL, calls subroutine with one argument,
5888 and type is used with error messages only. */
5891 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5895 HV *table = GvHV(PL_hintgv); /* ^H */
5899 const char *why1, *why2, *why3;
5901 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5904 why2 = strEQ(key,"charnames")
5905 ? "(possibly a missing \"use charnames ...\")"
5907 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5908 (type ? type: "undef"), why2);
5910 /* This is convoluted and evil ("goto considered harmful")
5911 * but I do not understand the intricacies of all the different
5912 * failure modes of %^H in here. The goal here is to make
5913 * the most probable error message user-friendly. --jhi */
5918 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5919 (type ? type: "undef"), why1, why2, why3);
5921 yyerror(SvPVX(msg));
5925 cvp = hv_fetch(table, key, strlen(key), FALSE);
5926 if (!cvp || !SvOK(*cvp)) {
5929 why3 = "} is not defined";
5932 sv_2mortal(sv); /* Parent created it permanently */
5935 pv = sv_2mortal(newSVpvn(s, len));
5937 typesv = sv_2mortal(newSVpv(type, 0));
5939 typesv = &PL_sv_undef;
5941 PUSHSTACKi(PERLSI_OVERLOAD);
5953 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5957 /* Check the eval first */
5958 if (!PL_in_eval && SvTRUE(ERRSV)) {
5960 sv_catpv(ERRSV, "Propagated");
5961 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5963 res = SvREFCNT_inc(sv);
5967 (void)SvREFCNT_inc(res);
5976 why1 = "Call to &{$^H{";
5978 why3 = "}} did not return a defined value";
5987 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5989 register char *d = dest;
5990 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5993 Perl_croak(aTHX_ ident_too_long);
5994 if (isALNUM(*s)) /* UTF handled below */
5996 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6001 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6005 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6006 char *t = s + UTF8SKIP(s);
6007 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6009 if (d + (t - s) > e)
6010 Perl_croak(aTHX_ ident_too_long);
6011 Copy(s, d, t - s, char);
6024 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6034 e = d + destlen - 3; /* two-character token, ending NUL */
6036 while (isDIGIT(*s)) {
6038 Perl_croak(aTHX_ ident_too_long);
6045 Perl_croak(aTHX_ ident_too_long);
6046 if (isALNUM(*s)) /* UTF handled below */
6048 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6053 else if (*s == ':' && s[1] == ':') {
6057 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6058 char *t = s + UTF8SKIP(s);
6059 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6061 if (d + (t - s) > e)
6062 Perl_croak(aTHX_ ident_too_long);
6063 Copy(s, d, t - s, char);
6074 if (PL_lex_state != LEX_NORMAL)
6075 PL_lex_state = LEX_INTERPENDMAYBE;
6078 if (*s == '$' && s[1] &&
6079 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6092 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6097 if (isSPACE(s[-1])) {
6100 if (!SPACE_OR_TAB(ch)) {
6106 if (isIDFIRST_lazy_if(d,UTF)) {
6110 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6112 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6115 Copy(s, d, e - s, char);
6120 while ((isALNUM(*s) || *s == ':') && d < e)
6123 Perl_croak(aTHX_ ident_too_long);
6126 while (s < send && SPACE_OR_TAB(*s)) s++;
6127 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6128 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6129 const char *brack = *s == '[' ? "[...]" : "{...}";
6130 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6131 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6132 funny, dest, brack, funny, dest, brack);
6135 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6139 /* Handle extended ${^Foo} variables
6140 * 1999-02-27 mjd-perl-patch@plover.com */
6141 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6145 while (isALNUM(*s) && d < e) {
6149 Perl_croak(aTHX_ ident_too_long);
6154 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6155 PL_lex_state = LEX_INTERPEND;
6158 if (PL_lex_state == LEX_NORMAL) {
6159 if (ckWARN(WARN_AMBIGUOUS) &&
6160 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6162 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6163 "Ambiguous use of %c{%s} resolved to %c%s",
6164 funny, dest, funny, dest);
6169 s = bracket; /* let the parser handle it */
6173 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6174 PL_lex_state = LEX_INTERPEND;
6179 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6184 *pmfl |= PMf_GLOBAL;
6186 *pmfl |= PMf_CONTINUE;
6190 *pmfl |= PMf_MULTILINE;
6192 *pmfl |= PMf_SINGLELINE;
6194 *pmfl |= PMf_EXTENDED;
6198 S_scan_pat(pTHX_ char *start, I32 type)
6203 s = scan_str(start,FALSE,FALSE);
6205 Perl_croak(aTHX_ "Search pattern not terminated");
6207 pm = (PMOP*)newPMOP(type, 0);
6208 if (PL_multi_open == '?')
6209 pm->op_pmflags |= PMf_ONCE;
6211 while (*s && strchr("iomsx", *s))
6212 pmflag(&pm->op_pmflags,*s++);
6215 while (*s && strchr("iogcmsx", *s))
6216 pmflag(&pm->op_pmflags,*s++);
6218 pm->op_pmpermflags = pm->op_pmflags;
6220 PL_lex_op = (OP*)pm;
6221 yylval.ival = OP_MATCH;
6226 S_scan_subst(pTHX_ char *start)
6233 yylval.ival = OP_NULL;
6235 s = scan_str(start,FALSE,FALSE);
6238 Perl_croak(aTHX_ "Substitution pattern not terminated");
6240 if (s[-1] == PL_multi_open)
6243 first_start = PL_multi_start;
6244 s = scan_str(s,FALSE,FALSE);
6247 SvREFCNT_dec(PL_lex_stuff);
6248 PL_lex_stuff = Nullsv;
6250 Perl_croak(aTHX_ "Substitution replacement not terminated");
6252 PL_multi_start = first_start; /* so whole substitution is taken together */
6254 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6260 else if (strchr("iogcmsx", *s))
6261 pmflag(&pm->op_pmflags,*s++);
6268 PL_sublex_info.super_bufptr = s;
6269 PL_sublex_info.super_bufend = PL_bufend;
6271 pm->op_pmflags |= PMf_EVAL;
6272 repl = newSVpvn("",0);
6274 sv_catpv(repl, es ? "eval " : "do ");
6275 sv_catpvn(repl, "{ ", 2);
6276 sv_catsv(repl, PL_lex_repl);
6277 sv_catpvn(repl, " };", 2);
6279 SvREFCNT_dec(PL_lex_repl);
6283 pm->op_pmpermflags = pm->op_pmflags;
6284 PL_lex_op = (OP*)pm;
6285 yylval.ival = OP_SUBST;
6290 S_scan_trans(pTHX_ char *start)
6299 yylval.ival = OP_NULL;
6301 s = scan_str(start,FALSE,FALSE);
6303 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6304 if (s[-1] == PL_multi_open)
6307 s = scan_str(s,FALSE,FALSE);
6310 SvREFCNT_dec(PL_lex_stuff);
6311 PL_lex_stuff = Nullsv;
6313 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6316 complement = del = squash = 0;
6317 while (strchr("cds", *s)) {
6319 complement = OPpTRANS_COMPLEMENT;
6321 del = OPpTRANS_DELETE;
6323 squash = OPpTRANS_SQUASH;
6327 New(803, tbl, complement&&!del?258:256, short);
6328 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6329 o->op_private = del|squash|complement|
6330 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6331 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6334 yylval.ival = OP_TRANS;
6339 S_scan_heredoc(pTHX_ register char *s)
6342 I32 op_type = OP_SCALAR;
6349 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6353 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6356 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6357 if (*peek && strchr("`'\"",*peek)) {
6360 s = delimcpy(d, e, s, PL_bufend, term, &len);
6370 if (!isALNUM_lazy_if(s,UTF))
6371 deprecate("bare << to mean <<\"\"");
6372 for (; isALNUM_lazy_if(s,UTF); s++) {
6377 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6378 Perl_croak(aTHX_ "Delimiter for here document is too long");
6381 len = d - PL_tokenbuf;
6382 #ifndef PERL_STRICT_CR
6383 d = strchr(s, '\r');
6387 while (s < PL_bufend) {
6393 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6402 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6407 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6408 herewas = newSVpvn(s,PL_bufend-s);
6410 s--, herewas = newSVpvn(s,d-s);
6411 s += SvCUR(herewas);
6413 tmpstr = NEWSV(87,79);
6414 sv_upgrade(tmpstr, SVt_PVIV);
6419 else if (term == '`') {
6420 op_type = OP_BACKTICK;
6421 SvIVX(tmpstr) = '\\';
6425 PL_multi_start = CopLINE(PL_curcop);
6426 PL_multi_open = PL_multi_close = '<';
6427 term = *PL_tokenbuf;
6428 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6429 char *bufptr = PL_sublex_info.super_bufptr;
6430 char *bufend = PL_sublex_info.super_bufend;
6431 char *olds = s - SvCUR(herewas);
6432 s = strchr(bufptr, '\n');
6436 while (s < bufend &&
6437 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6439 CopLINE_inc(PL_curcop);
6442 CopLINE_set(PL_curcop, PL_multi_start);
6443 missingterm(PL_tokenbuf);
6445 sv_setpvn(herewas,bufptr,d-bufptr+1);
6446 sv_setpvn(tmpstr,d+1,s-d);
6448 sv_catpvn(herewas,s,bufend-s);
6449 (void)strcpy(bufptr,SvPVX(herewas));
6456 while (s < PL_bufend &&
6457 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6459 CopLINE_inc(PL_curcop);
6461 if (s >= PL_bufend) {
6462 CopLINE_set(PL_curcop, PL_multi_start);
6463 missingterm(PL_tokenbuf);
6465 sv_setpvn(tmpstr,d+1,s-d);
6467 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6469 sv_catpvn(herewas,s,PL_bufend-s);
6470 sv_setsv(PL_linestr,herewas);
6471 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6472 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6473 PL_last_lop = PL_last_uni = Nullch;
6476 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6477 while (s >= PL_bufend) { /* multiple line string? */
6479 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6480 CopLINE_set(PL_curcop, PL_multi_start);
6481 missingterm(PL_tokenbuf);
6483 CopLINE_inc(PL_curcop);
6484 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6485 PL_last_lop = PL_last_uni = Nullch;
6486 #ifndef PERL_STRICT_CR
6487 if (PL_bufend - PL_linestart >= 2) {
6488 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6489 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6491 PL_bufend[-2] = '\n';
6493 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6495 else if (PL_bufend[-1] == '\r')
6496 PL_bufend[-1] = '\n';
6498 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6499 PL_bufend[-1] = '\n';
6501 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6502 SV *sv = NEWSV(88,0);
6504 sv_upgrade(sv, SVt_PVMG);
6505 sv_setsv(sv,PL_linestr);
6506 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6508 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6511 sv_catsv(PL_linestr,herewas);
6512 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6516 sv_catsv(tmpstr,PL_linestr);
6521 PL_multi_end = CopLINE(PL_curcop);
6522 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6523 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6524 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6526 SvREFCNT_dec(herewas);
6527 if (UTF && !IN_BYTE && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6529 PL_lex_stuff = tmpstr;
6530 yylval.ival = op_type;
6535 takes: current position in input buffer
6536 returns: new position in input buffer
6537 side-effects: yylval and lex_op are set.
6542 <FH> read from filehandle
6543 <pkg::FH> read from package qualified filehandle
6544 <pkg'FH> read from package qualified filehandle
6545 <$fh> read from filehandle in $fh
6551 S_scan_inputsymbol(pTHX_ char *start)
6553 register char *s = start; /* current position in buffer */
6559 d = PL_tokenbuf; /* start of temp holding space */
6560 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6561 end = strchr(s, '\n');
6564 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6566 /* die if we didn't have space for the contents of the <>,
6567 or if it didn't end, or if we see a newline
6570 if (len >= sizeof PL_tokenbuf)
6571 Perl_croak(aTHX_ "Excessively long <> operator");
6573 Perl_croak(aTHX_ "Unterminated <> operator");
6578 Remember, only scalar variables are interpreted as filehandles by
6579 this code. Anything more complex (e.g., <$fh{$num}>) will be
6580 treated as a glob() call.
6581 This code makes use of the fact that except for the $ at the front,
6582 a scalar variable and a filehandle look the same.
6584 if (*d == '$' && d[1]) d++;
6586 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6587 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6590 /* If we've tried to read what we allow filehandles to look like, and
6591 there's still text left, then it must be a glob() and not a getline.
6592 Use scan_str to pull out the stuff between the <> and treat it
6593 as nothing more than a string.
6596 if (d - PL_tokenbuf != len) {
6597 yylval.ival = OP_GLOB;
6599 s = scan_str(start,FALSE,FALSE);
6601 Perl_croak(aTHX_ "Glob not terminated");
6605 /* we're in a filehandle read situation */
6608 /* turn <> into <ARGV> */
6610 (void)strcpy(d,"ARGV");
6612 /* if <$fh>, create the ops to turn the variable into a
6618 /* try to find it in the pad for this block, otherwise find
6619 add symbol table ops
6621 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6622 OP *o = newOP(OP_PADSV, 0);
6624 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6627 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6628 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6629 newUNOP(OP_RV2SV, 0,
6630 newGVOP(OP_GV, 0, gv)));
6632 PL_lex_op->op_flags |= OPf_SPECIAL;
6633 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6634 yylval.ival = OP_NULL;
6637 /* If it's none of the above, it must be a literal filehandle
6638 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6640 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6641 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6642 yylval.ival = OP_NULL;
6651 takes: start position in buffer
6652 keep_quoted preserve \ on the embedded delimiter(s)
6653 keep_delims preserve the delimiters around the string
6654 returns: position to continue reading from buffer
6655 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6656 updates the read buffer.
6658 This subroutine pulls a string out of the input. It is called for:
6659 q single quotes q(literal text)
6660 ' single quotes 'literal text'
6661 qq double quotes qq(interpolate $here please)
6662 " double quotes "interpolate $here please"
6663 qx backticks qx(/bin/ls -l)
6664 ` backticks `/bin/ls -l`
6665 qw quote words @EXPORT_OK = qw( func() $spam )
6666 m// regexp match m/this/
6667 s/// regexp substitute s/this/that/
6668 tr/// string transliterate tr/this/that/
6669 y/// string transliterate y/this/that/
6670 ($*@) sub prototypes sub foo ($)
6671 (stuff) sub attr parameters sub foo : attr(stuff)
6672 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6674 In most of these cases (all but <>, patterns and transliterate)
6675 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6676 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6677 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6680 It skips whitespace before the string starts, and treats the first
6681 character as the delimiter. If the delimiter is one of ([{< then
6682 the corresponding "close" character )]}> is used as the closing
6683 delimiter. It allows quoting of delimiters, and if the string has
6684 balanced delimiters ([{<>}]) it allows nesting.
6686 On success, the SV with the resulting string is put into lex_stuff or,
6687 if that is already non-NULL, into lex_repl. The second case occurs only
6688 when parsing the RHS of the special constructs s/// and tr/// (y///).
6689 For convenience, the terminating delimiter character is stuffed into
6694 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6696 SV *sv; /* scalar value: string */
6697 char *tmps; /* temp string, used for delimiter matching */
6698 register char *s = start; /* current position in the buffer */
6699 register char term; /* terminating character */
6700 register char *to; /* current position in the sv's data */
6701 I32 brackets = 1; /* bracket nesting level */
6702 bool has_utf8 = FALSE; /* is there any utf8 content? */
6704 /* skip space before the delimiter */
6708 /* mark where we are, in case we need to report errors */
6711 /* after skipping whitespace, the next character is the terminator */
6713 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6716 /* mark where we are */
6717 PL_multi_start = CopLINE(PL_curcop);
6718 PL_multi_open = term;
6720 /* find corresponding closing delimiter */
6721 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6723 PL_multi_close = term;
6725 /* create a new SV to hold the contents. 87 is leak category, I'm
6726 assuming. 79 is the SV's initial length. What a random number. */
6728 sv_upgrade(sv, SVt_PVIV);
6730 (void)SvPOK_only(sv); /* validate pointer */
6732 /* move past delimiter and try to read a complete string */
6734 sv_catpvn(sv, s, 1);
6737 /* extend sv if need be */
6738 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6739 /* set 'to' to the next character in the sv's string */
6740 to = SvPVX(sv)+SvCUR(sv);
6742 /* if open delimiter is the close delimiter read unbridle */
6743 if (PL_multi_open == PL_multi_close) {
6744 for (; s < PL_bufend; s++,to++) {
6745 /* embedded newlines increment the current line number */
6746 if (*s == '\n' && !PL_rsfp)
6747 CopLINE_inc(PL_curcop);
6748 /* handle quoted delimiters */
6749 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6750 if (!keep_quoted && s[1] == term)
6752 /* any other quotes are simply copied straight through */
6756 /* terminate when run out of buffer (the for() condition), or
6757 have found the terminator */
6758 else if (*s == term)
6760 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6766 /* if the terminator isn't the same as the start character (e.g.,
6767 matched brackets), we have to allow more in the quoting, and
6768 be prepared for nested brackets.
6771 /* read until we run out of string, or we find the terminator */
6772 for (; s < PL_bufend; s++,to++) {
6773 /* embedded newlines increment the line count */
6774 if (*s == '\n' && !PL_rsfp)
6775 CopLINE_inc(PL_curcop);
6776 /* backslashes can escape the open or closing characters */
6777 if (*s == '\\' && s+1 < PL_bufend) {
6779 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6784 /* allow nested opens and closes */
6785 else if (*s == PL_multi_close && --brackets <= 0)
6787 else if (*s == PL_multi_open)
6789 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6794 /* terminate the copied string and update the sv's end-of-string */
6796 SvCUR_set(sv, to - SvPVX(sv));
6799 * this next chunk reads more into the buffer if we're not done yet
6803 break; /* handle case where we are done yet :-) */
6805 #ifndef PERL_STRICT_CR
6806 if (to - SvPVX(sv) >= 2) {
6807 if ((to[-2] == '\r' && to[-1] == '\n') ||
6808 (to[-2] == '\n' && to[-1] == '\r'))
6812 SvCUR_set(sv, to - SvPVX(sv));
6814 else if (to[-1] == '\r')
6817 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6821 /* if we're out of file, or a read fails, bail and reset the current
6822 line marker so we can report where the unterminated string began
6825 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6827 CopLINE_set(PL_curcop, PL_multi_start);
6830 /* we read a line, so increment our line counter */
6831 CopLINE_inc(PL_curcop);
6833 /* update debugger info */
6834 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6835 SV *sv = NEWSV(88,0);
6837 sv_upgrade(sv, SVt_PVMG);
6838 sv_setsv(sv,PL_linestr);
6839 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6842 /* having changed the buffer, we must update PL_bufend */
6843 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6844 PL_last_lop = PL_last_uni = Nullch;
6847 /* at this point, we have successfully read the delimited string */
6850 sv_catpvn(sv, s, 1);
6853 PL_multi_end = CopLINE(PL_curcop);
6856 /* if we allocated too much space, give some back */
6857 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6858 SvLEN_set(sv, SvCUR(sv) + 1);
6859 Renew(SvPVX(sv), SvLEN(sv), char);
6862 /* decide whether this is the first or second quoted string we've read
6875 takes: pointer to position in buffer
6876 returns: pointer to new position in buffer
6877 side-effects: builds ops for the constant in yylval.op
6879 Read a number in any of the formats that Perl accepts:
6881 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
6882 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
6885 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
6887 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6890 If it reads a number without a decimal point or an exponent, it will
6891 try converting the number to an integer and see if it can do so
6892 without loss of precision.
6896 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6898 register char *s = start; /* current position in buffer */
6899 register char *d; /* destination in temp buffer */
6900 register char *e; /* end of temp buffer */
6901 NV nv; /* number read, as a double */
6902 SV *sv = Nullsv; /* place to put the converted number */
6903 bool floatit; /* boolean: int or float? */
6904 char *lastub = 0; /* position of last underbar */
6905 static char number_too_long[] = "Number too long";
6907 /* We use the first character to decide what type of number this is */
6911 Perl_croak(aTHX_ "panic: scan_num");
6913 /* if it starts with a 0, it could be an octal number, a decimal in
6914 0.13 disguise, or a hexadecimal number, or a binary number. */
6918 u holds the "number so far"
6919 shift the power of 2 of the base
6920 (hex == 4, octal == 3, binary == 1)
6921 overflowed was the number more than we can hold?
6923 Shift is used when we add a digit. It also serves as an "are
6924 we in octal/hex/binary?" indicator to disallow hex characters
6930 bool overflowed = FALSE;
6931 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6932 static char* bases[5] = { "", "binary", "", "octal",
6934 static char* Bases[5] = { "", "Binary", "", "Octal",
6936 static char *maxima[5] = { "",
6937 "0b11111111111111111111111111111111",
6941 char *base, *Base, *max;
6947 } else if (s[1] == 'b') {
6951 /* check for a decimal in disguise */
6952 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6954 /* so it must be octal */
6961 if (ckWARN(WARN_SYNTAX))
6962 Perl_warner(aTHX_ WARN_SYNTAX,
6963 "Misplaced _ in number");
6967 base = bases[shift];
6968 Base = Bases[shift];
6969 max = maxima[shift];
6971 /* read the rest of the number */
6973 /* x is used in the overflow test,
6974 b is the digit we're adding on. */
6979 /* if we don't mention it, we're done */
6983 /* _ are ignored -- but warned about if consecutive */
6985 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
6986 Perl_warner(aTHX_ WARN_SYNTAX,
6987 "Misplaced _ in number");
6991 /* 8 and 9 are not octal */
6994 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6998 case '2': case '3': case '4':
6999 case '5': case '6': case '7':
7001 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7005 b = *s++ & 15; /* ASCII digit -> value of digit */
7009 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7010 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7011 /* make sure they said 0x */
7016 /* Prepare to put the digit we have onto the end
7017 of the number so far. We check for overflows.
7022 x = u << shift; /* make room for the digit */
7024 if ((x >> shift) != u
7025 && !(PL_hints & HINT_NEW_BINARY)) {
7028 if (ckWARN_d(WARN_OVERFLOW))
7029 Perl_warner(aTHX_ WARN_OVERFLOW,
7030 "Integer overflow in %s number",
7033 u = x | b; /* add the digit to the end */
7036 n *= nvshift[shift];
7037 /* If an NV has not enough bits in its
7038 * mantissa to represent an UV this summing of
7039 * small low-order numbers is a waste of time
7040 * (because the NV cannot preserve the
7041 * low-order bits anyway): we could just
7042 * remember when did we overflow and in the
7043 * end just multiply n by the right
7051 /* if we get here, we had success: make a scalar value from
7056 /* final misplaced underbar check */
7058 if (ckWARN(WARN_SYNTAX))
7059 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7064 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7065 Perl_warner(aTHX_ WARN_PORTABLE,
7066 "%s number > %s non-portable",
7072 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7073 Perl_warner(aTHX_ WARN_PORTABLE,
7074 "%s number > %s non-portable",
7079 if (PL_hints & HINT_NEW_BINARY)
7080 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7085 handle decimal numbers.
7086 we're also sent here when we read a 0 as the first digit
7088 case '1': case '2': case '3': case '4': case '5':
7089 case '6': case '7': case '8': case '9': case '.':
7092 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7095 /* read next group of digits and _ and copy into d */
7096 while (isDIGIT(*s) || *s == '_') {
7097 /* skip underscores, checking for misplaced ones
7101 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7102 Perl_warner(aTHX_ WARN_SYNTAX,
7103 "Misplaced _ in number");
7107 /* check for end of fixed-length buffer */
7109 Perl_croak(aTHX_ number_too_long);
7110 /* if we're ok, copy the character */
7115 /* final misplaced underbar check */
7116 if (lastub && s == lastub + 1) {
7117 if (ckWARN(WARN_SYNTAX))
7118 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7121 /* read a decimal portion if there is one. avoid
7122 3..5 being interpreted as the number 3. followed
7125 if (*s == '.' && s[1] != '.') {
7130 if (ckWARN(WARN_SYNTAX))
7131 Perl_warner(aTHX_ WARN_SYNTAX,
7132 "Misplaced _ in number");
7136 /* copy, ignoring underbars, until we run out of digits.
7138 for (; isDIGIT(*s) || *s == '_'; s++) {
7139 /* fixed length buffer check */
7141 Perl_croak(aTHX_ number_too_long);
7143 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7144 Perl_warner(aTHX_ WARN_SYNTAX,
7145 "Misplaced _ in number");
7151 /* fractional part ending in underbar? */
7153 if (ckWARN(WARN_SYNTAX))
7154 Perl_warner(aTHX_ WARN_SYNTAX,
7155 "Misplaced _ in number");
7157 if (*s == '.' && isDIGIT(s[1])) {
7158 /* oops, it's really a v-string, but without the "v" */
7164 /* read exponent part, if present */
7165 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7169 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7170 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7172 /* stray preinitial _ */
7174 if (ckWARN(WARN_SYNTAX))
7175 Perl_warner(aTHX_ WARN_SYNTAX,
7176 "Misplaced _ in number");
7180 /* allow positive or negative exponent */
7181 if (*s == '+' || *s == '-')
7184 /* stray initial _ */
7186 if (ckWARN(WARN_SYNTAX))
7187 Perl_warner(aTHX_ WARN_SYNTAX,
7188 "Misplaced _ in number");
7192 /* read digits of exponent */
7193 while (isDIGIT(*s) || *s == '_') {
7196 Perl_croak(aTHX_ number_too_long);
7200 if (ckWARN(WARN_SYNTAX) &&
7201 ((lastub && s == lastub + 1) ||
7202 (!isDIGIT(s[1]) && s[1] != '_')))
7203 Perl_warner(aTHX_ WARN_SYNTAX,
7204 "Misplaced _ in number");
7210 /* terminate the string */
7213 /* make an sv from the string */
7216 #if defined(Strtol) && defined(Strtoul)
7219 strtol/strtoll sets errno to ERANGE if the number is too big
7220 for an integer. We try to do an integer conversion first
7221 if no characters indicating "float" have been found.
7228 if (*PL_tokenbuf == '-')
7229 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7231 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7233 floatit = TRUE; /* Probably just too large. */
7234 else if (*PL_tokenbuf == '-')
7236 else if (uv <= IV_MAX)
7237 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7242 nv = Atof(PL_tokenbuf);
7247 No working strtou?ll?.
7249 Unfortunately atol() doesn't do range checks (returning
7250 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7251 everywhere [1], so we cannot use use atol() (or atoll()).
7252 If we could, they would be used, as Atol(), very much like
7253 Strtol() and Strtoul() are used above.
7255 [1] XXX Configure test needed to check for atol()
7256 (and atoll()) overflow behaviour XXX
7260 We need to do this the hard way. */
7262 nv = Atof(PL_tokenbuf);
7264 /* See if we can make do with an integer value without loss of
7265 precision. We use U_V to cast to a UV, because some
7266 compilers have issues. Then we try casting it back and see
7267 if it was the same [1]. We only do this if we know we
7268 specifically read an integer. If floatit is true, then we
7269 don't need to do the conversion at all.
7271 [1] Note that this is lossy if our NVs cannot preserve our
7272 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7273 and NV_PRESERVES_UV_BITS (a number), but in general we really
7274 do hope all such potentially lossy platforms have strtou?ll?
7275 to do a lossless IV/UV conversion.
7277 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7278 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7279 as NV_DIG and NV_MANT_DIG)?
7285 if (!floatit && (NV)uv == nv) {
7287 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7295 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7296 (PL_hints & HINT_NEW_INTEGER) )
7297 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7298 (floatit ? "float" : "integer"),
7302 /* if it starts with a v, it could be a v-string */
7308 while (isDIGIT(*pos) || *pos == '_')
7310 if (!isALPHA(*pos)) {
7312 U8 tmpbuf[UTF8_MAXLEN+1];
7314 s++; /* get past 'v' */
7317 sv_setpvn(sv, "", 0);
7320 if (*s == '0' && isDIGIT(s[1]))
7321 yyerror("Octal number in vector unsupported");
7324 /* this is atoi() that tolerates underscores */
7327 while (--end >= s) {
7332 rev += (*end - '0') * mult;
7334 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7335 Perl_warner(aTHX_ WARN_OVERFLOW,
7336 "Integer overflow in decimal number");
7339 /* Append native character for the rev point */
7340 tmpend = uvchr_to_utf8(tmpbuf, rev);
7341 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7342 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
7344 if (*pos == '.' && isDIGIT(pos[1]))
7350 while (isDIGIT(*pos) || *pos == '_')
7360 /* make the op for the constant and return */
7363 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7365 lvalp->opval = Nullop;
7371 S_scan_formline(pTHX_ register char *s)
7375 SV *stuff = newSVpvn("",0);
7376 bool needargs = FALSE;
7379 if (*s == '.' || *s == /*{*/'}') {
7381 #ifdef PERL_STRICT_CR
7382 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7384 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7386 if (*t == '\n' || t == PL_bufend)
7389 if (PL_in_eval && !PL_rsfp) {
7390 eol = strchr(s,'\n');
7395 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7397 for (t = s; t < eol; t++) {
7398 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7400 goto enough; /* ~~ must be first line in formline */
7402 if (*t == '@' || *t == '^')
7405 sv_catpvn(stuff, s, eol-s);
7406 #ifndef PERL_STRICT_CR
7407 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7408 char *end = SvPVX(stuff) + SvCUR(stuff);
7417 s = filter_gets(PL_linestr, PL_rsfp, 0);
7418 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7419 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7420 PL_last_lop = PL_last_uni = Nullch;
7423 yyerror("Format not terminated");
7433 PL_lex_state = LEX_NORMAL;
7434 PL_nextval[PL_nexttoke].ival = 0;
7438 PL_lex_state = LEX_FORMLINE;
7439 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7441 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7445 SvREFCNT_dec(stuff);
7446 PL_lex_formbrack = 0;
7457 PL_cshlen = strlen(PL_cshname);
7462 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7464 I32 oldsavestack_ix = PL_savestack_ix;
7465 CV* outsidecv = PL_compcv;
7469 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7471 SAVEI32(PL_subline);
7472 save_item(PL_subname);
7475 SAVESPTR(PL_comppad_name);
7476 SAVESPTR(PL_compcv);
7477 SAVEI32(PL_comppad_name_fill);
7478 SAVEI32(PL_min_intro_pending);
7479 SAVEI32(PL_max_intro_pending);
7480 SAVEI32(PL_pad_reset_pending);
7482 PL_compcv = (CV*)NEWSV(1104,0);
7483 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7484 CvFLAGS(PL_compcv) |= flags;
7486 PL_comppad = newAV();
7487 av_push(PL_comppad, Nullsv);
7488 PL_curpad = AvARRAY(PL_comppad);
7489 PL_comppad_name = newAV();
7490 PL_comppad_name_fill = 0;
7491 PL_min_intro_pending = 0;
7493 PL_subline = CopLINE(PL_curcop);
7495 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7496 PL_curpad[0] = (SV*)newAV();
7497 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7498 #endif /* USE_THREADS */
7500 comppadlist = newAV();
7501 AvREAL_off(comppadlist);
7502 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7503 av_store(comppadlist, 1, (SV*)PL_comppad);
7505 CvPADLIST(PL_compcv) = comppadlist;
7506 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7508 CvOWNER(PL_compcv) = 0;
7509 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7510 MUTEX_INIT(CvMUTEXP(PL_compcv));
7511 #endif /* USE_THREADS */
7513 return oldsavestack_ix;
7517 #pragma segment Perl_yylex
7520 Perl_yywarn(pTHX_ char *s)
7522 PL_in_eval |= EVAL_WARNONLY;
7524 PL_in_eval &= ~EVAL_WARNONLY;
7529 Perl_yyerror(pTHX_ char *s)
7532 char *context = NULL;
7536 if (!yychar || (yychar == ';' && !PL_rsfp))
7538 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7539 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7540 while (isSPACE(*PL_oldoldbufptr))
7542 context = PL_oldoldbufptr;
7543 contlen = PL_bufptr - PL_oldoldbufptr;
7545 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7546 PL_oldbufptr != PL_bufptr) {
7547 while (isSPACE(*PL_oldbufptr))
7549 context = PL_oldbufptr;
7550 contlen = PL_bufptr - PL_oldbufptr;
7552 else if (yychar > 255)
7553 where = "next token ???";
7554 #ifdef USE_PURE_BISON
7555 /* GNU Bison sets the value -2 */
7556 else if (yychar == -2) {
7558 else if ((yychar & 127) == 127) {
7560 if (PL_lex_state == LEX_NORMAL ||
7561 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7562 where = "at end of line";
7563 else if (PL_lex_inpat)
7564 where = "within pattern";
7566 where = "within string";
7569 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7571 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7572 else if (isPRINT_LC(yychar))
7573 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7575 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7576 where = SvPVX(where_sv);
7578 msg = sv_2mortal(newSVpv(s, 0));
7579 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7580 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7582 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7584 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7585 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7586 Perl_sv_catpvf(aTHX_ msg,
7587 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7588 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7591 if (PL_in_eval & EVAL_WARNONLY)
7592 Perl_warn(aTHX_ "%"SVf, msg);
7595 if (PL_error_count >= 10) {
7596 if (PL_in_eval && SvCUR(ERRSV))
7597 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7598 ERRSV, CopFILE(PL_curcop));
7600 Perl_croak(aTHX_ "%s has too many errors.\n",
7601 CopFILE(PL_curcop));
7604 PL_in_my_stash = Nullhv;
7608 #pragma segment Main
7612 S_swallow_bom(pTHX_ U8 *s)
7615 slen = SvCUR(PL_linestr);
7619 /* UTF-16 little-endian */
7620 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7621 Perl_croak(aTHX_ "Unsupported script encoding");
7622 #ifndef PERL_NO_UTF16_FILTER
7623 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7625 if (PL_bufend > (char*)s) {
7629 filter_add(utf16rev_textfilter, NULL);
7630 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7631 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7632 PL_bufend - (char*)s - 1,
7634 Copy(news, s, newlen, U8);
7635 SvCUR_set(PL_linestr, newlen);
7636 PL_bufend = SvPVX(PL_linestr) + newlen;
7637 news[newlen++] = '\0';
7641 Perl_croak(aTHX_ "Unsupported script encoding");
7646 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7647 #ifndef PERL_NO_UTF16_FILTER
7648 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7650 if (PL_bufend > (char *)s) {
7654 filter_add(utf16_textfilter, NULL);
7655 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7656 PL_bufend = (char*)utf16_to_utf8(s, news,
7657 PL_bufend - (char*)s,
7659 Copy(news, s, newlen, U8);
7660 SvCUR_set(PL_linestr, newlen);
7661 PL_bufend = SvPVX(PL_linestr) + newlen;
7662 news[newlen++] = '\0';
7666 Perl_croak(aTHX_ "Unsupported script encoding");
7671 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7672 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7677 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7678 s[2] == 0xFE && s[3] == 0xFF)
7680 Perl_croak(aTHX_ "Unsupported script encoding");
7692 * Restore a source filter.
7696 restore_rsfp(pTHXo_ void *f)
7698 PerlIO *fp = (PerlIO*)f;
7700 if (PL_rsfp == PerlIO_stdin())
7701 PerlIO_clearerr(PL_rsfp);
7702 else if (PL_rsfp && (PL_rsfp != fp))
7703 PerlIO_close(PL_rsfp);
7707 #ifndef PERL_NO_UTF16_FILTER
7709 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7711 I32 count = FILTER_READ(idx+1, sv, maxlen);
7716 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7717 if (!*SvPV_nolen(sv))
7718 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7721 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7722 sv_usepvn(sv, (char*)tmps, tend - tmps);
7728 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7730 I32 count = FILTER_READ(idx+1, sv, maxlen);
7735 if (!*SvPV_nolen(sv))
7736 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7739 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7740 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7741 sv_usepvn(sv, (char*)tmps, tend - tmps);