3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
30 static void restore_rsfp(pTHX_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
39 #ifdef USE_UTF8_SCRIPTS
40 # define UTF (!IN_BYTES)
42 # ifdef EBCDIC /* For now 'use utf8' does not affect tokenizer on EBCDIC */
43 # define UTF (PL_linestr && DO_UTF8(PL_linestr))
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
49 /* In variables named $^X, these are the legal values for X.
50 * 1999-02-27 mjd-perl-patch@plover.com */
51 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
53 /* On MacOS, respect nonbreaking spaces */
54 #ifdef MACOS_TRADITIONAL
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
57 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
60 /* LEX_* are values for PL_lex_state, the state of the lexer.
61 * They are arranged oddly so that the guard on the switch statement
62 * can get by with a single comparison (if the compiler is smart enough).
65 /* #define LEX_NOTPARSING 11 is done in perl.h. */
68 #define LEX_INTERPNORMAL 9
69 #define LEX_INTERPCASEMOD 8
70 #define LEX_INTERPPUSH 7
71 #define LEX_INTERPSTART 6
72 #define LEX_INTERPEND 5
73 #define LEX_INTERPENDMAYBE 4
74 #define LEX_INTERPCONCAT 3
75 #define LEX_INTERPCONST 2
76 #define LEX_FORMLINE 1
77 #define LEX_KNOWNEXT 0
85 # define YYMAXLEVEL 100
87 YYSTYPE* yylval_pointer[YYMAXLEVEL];
88 int* yychar_pointer[YYMAXLEVEL];
92 # define yylval (*yylval_pointer[yyactlevel])
93 # define yychar (*yychar_pointer[yyactlevel])
94 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
96 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
101 /* CLINE is a macro that ensures PL_copline has a sane value */
106 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
109 * Convenience functions to return different tokens and prime the
110 * lexer for the next token. They all take an argument.
112 * TOKEN : generic token (used for '(', DOLSHARP, etc)
113 * OPERATOR : generic operator
114 * AOPERATOR : assignment operator
115 * PREBLOCK : beginning the block after an if, while, foreach, ...
116 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
117 * PREREF : *EXPR where EXPR is not a simple identifier
118 * TERM : expression term
119 * LOOPX : loop exiting command (goto, last, dump, etc)
120 * FTST : file test operator
121 * FUN0 : zero-argument function
122 * FUN1 : not used, except for not, which isn't a UNIOP
123 * BOop : bitwise or or xor
125 * SHop : shift operator
126 * PWop : power operator
127 * PMop : pattern-matching operator
128 * Aop : addition-level operator
129 * Mop : multiplication-level operator
130 * Eop : equality-testing operator
131 * Rop : relational operator <= != gt
133 * Also see LOP and lop() below.
136 /* Note that REPORT() and REPORT2() will be expressions that supply
137 * their own trailing comma, not suitable for statements as such. */
138 #ifdef DEBUGGING /* Serve -DT. */
139 # define REPORT(x,retval) tokereport(x,s,(int)retval),
140 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
142 # define REPORT(x,retval)
143 # define REPORT2(x,retval)
146 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
147 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
148 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
149 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
150 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
151 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
152 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
153 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
154 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
155 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
156 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
157 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
158 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
159 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
160 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
161 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
162 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
163 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
164 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
165 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
167 /* This bit of chicanery makes a unary function followed by
168 * a parenthesis into a function with one argument, highest precedence.
170 #define UNI(f) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
178 #define UNIBRACK(f) return(yylval.ival = f, \
181 PL_last_uni = PL_oldbufptr, \
182 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
184 /* grandfather return to old style */
185 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
190 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
193 SV* report = newSVpv(thing, 0);
194 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
197 if (s - PL_bufptr > 0)
198 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
200 if (PL_oldbufptr && *PL_oldbufptr)
201 sv_catpv(report, PL_tokenbuf);
203 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
212 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
213 * into an OP_ANDASSIGN or OP_ORASSIGN
217 S_ao(pTHX_ int toketype)
219 if (*PL_bufptr == '=') {
221 if (toketype == ANDAND)
222 yylval.ival = OP_ANDASSIGN;
223 else if (toketype == OROR)
224 yylval.ival = OP_ORASSIGN;
232 * When Perl expects an operator and finds something else, no_op
233 * prints the warning. It always prints "<something> found where
234 * operator expected. It prints "Missing semicolon on previous line?"
235 * if the surprise occurs at the start of the line. "do you need to
236 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
237 * where the compiler doesn't know if foo is a method call or a function.
238 * It prints "Missing operator before end of line" if there's nothing
239 * after the missing operator, or "... before <...>" if there is something
240 * after the missing operator.
244 S_no_op(pTHX_ char *what, char *s)
246 char *oldbp = PL_bufptr;
247 bool is_first = (PL_oldbufptr == PL_linestart);
253 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
255 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
256 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
258 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
259 if (t < PL_bufptr && isSPACE(*t))
260 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
261 t - PL_oldoldbufptr, PL_oldoldbufptr);
265 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
272 * Complain about missing quote/regexp/heredoc terminator.
273 * If it's called with (char *)NULL then it cauterizes the line buffer.
274 * If we're in a delimited string and the delimiter is a control
275 * character, it's reformatted into a two-char sequence like ^C.
280 S_missingterm(pTHX_ char *s)
285 char *nl = strrchr(s,'\n');
291 iscntrl(PL_multi_close)
293 PL_multi_close < 32 || PL_multi_close == 127
297 tmpbuf[1] = toCTRL(PL_multi_close);
303 *tmpbuf = PL_multi_close;
307 q = strchr(s,'"') ? '\'' : '"';
308 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
316 Perl_deprecate(pTHX_ char *s)
318 if (ckWARN(WARN_DEPRECATED))
319 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
323 Perl_deprecate_old(pTHX_ char *s)
325 /* This function should NOT be called for any new deprecated warnings */
326 /* Use Perl_deprecate instead */
328 /* It is here to maintain backward compatibility with the pre-5.8 */
329 /* warnings category hierarchy. The "deprecated" category used to */
330 /* live under the "syntax" category. It is now a top-level category */
331 /* in its own right. */
333 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
334 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
335 "Use of %s is deprecated", s);
340 * Deprecate a comma-less variable list.
346 deprecate_old("comma-less variable list");
350 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
351 * utf16-to-utf8-reversed.
354 #ifdef PERL_CR_FILTER
358 register char *s = SvPVX(sv);
359 register char *e = s + SvCUR(sv);
360 /* outer loop optimized to do nothing if there are no CR-LFs */
362 if (*s++ == '\r' && *s == '\n') {
363 /* hit a CR-LF, need to copy the rest */
364 register char *d = s - 1;
367 if (*s == '\r' && s[1] == '\n')
378 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
380 I32 count = FILTER_READ(idx+1, sv, maxlen);
381 if (count > 0 && !maxlen)
389 * Initialize variables. Uses the Perl save_stack to save its state (for
390 * recursive calls to the parser).
394 Perl_lex_start(pTHX_ SV *line)
399 SAVEI32(PL_lex_dojoin);
400 SAVEI32(PL_lex_brackets);
401 SAVEI32(PL_lex_casemods);
402 SAVEI32(PL_lex_starts);
403 SAVEI32(PL_lex_state);
404 SAVEVPTR(PL_lex_inpat);
405 SAVEI32(PL_lex_inwhat);
406 if (PL_lex_state == LEX_KNOWNEXT) {
407 I32 toke = PL_nexttoke;
408 while (--toke >= 0) {
409 SAVEI32(PL_nexttype[toke]);
410 SAVEVPTR(PL_nextval[toke]);
412 SAVEI32(PL_nexttoke);
414 SAVECOPLINE(PL_curcop);
417 SAVEPPTR(PL_oldbufptr);
418 SAVEPPTR(PL_oldoldbufptr);
419 SAVEPPTR(PL_last_lop);
420 SAVEPPTR(PL_last_uni);
421 SAVEPPTR(PL_linestart);
422 SAVESPTR(PL_linestr);
423 SAVEPPTR(PL_lex_brackstack);
424 SAVEPPTR(PL_lex_casestack);
425 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
426 SAVESPTR(PL_lex_stuff);
427 SAVEI32(PL_lex_defer);
428 SAVEI32(PL_sublex_info.sub_inwhat);
429 SAVESPTR(PL_lex_repl);
431 SAVEINT(PL_lex_expect);
433 PL_lex_state = LEX_NORMAL;
437 New(899, PL_lex_brackstack, 120, char);
438 New(899, PL_lex_casestack, 12, char);
439 SAVEFREEPV(PL_lex_brackstack);
440 SAVEFREEPV(PL_lex_casestack);
442 *PL_lex_casestack = '\0';
445 PL_lex_stuff = Nullsv;
446 PL_lex_repl = Nullsv;
450 PL_sublex_info.sub_inwhat = 0;
452 if (SvREADONLY(PL_linestr))
453 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
454 s = SvPV(PL_linestr, len);
455 if (len && s[len-1] != ';') {
456 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
457 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
458 sv_catpvn(PL_linestr, "\n;", 2);
460 SvTEMP_off(PL_linestr);
461 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
462 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
463 PL_last_lop = PL_last_uni = Nullch;
469 * Finalizer for lexing operations. Must be called when the parser is
470 * done with the lexer.
476 PL_doextract = FALSE;
481 * This subroutine has nothing to do with tilting, whether at windmills
482 * or pinball tables. Its name is short for "increment line". It
483 * increments the current line number in CopLINE(PL_curcop) and checks
484 * to see whether the line starts with a comment of the form
485 * # line 500 "foo.pm"
486 * If so, it sets the current line number and file to the values in the comment.
490 S_incline(pTHX_ char *s)
497 CopLINE_inc(PL_curcop);
500 while (SPACE_OR_TAB(*s)) s++;
501 if (strnEQ(s, "line", 4))
505 if (SPACE_OR_TAB(*s))
509 while (SPACE_OR_TAB(*s)) s++;
515 while (SPACE_OR_TAB(*s))
517 if (*s == '"' && (t = strchr(s+1, '"'))) {
522 for (t = s; !isSPACE(*t); t++) ;
525 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
527 if (*e != '\n' && *e != '\0')
528 return; /* false alarm */
533 CopFILE_free(PL_curcop);
534 CopFILE_set(PL_curcop, s);
537 CopLINE_set(PL_curcop, atoi(n)-1);
542 * Called to gobble the appropriate amount and type of whitespace.
543 * Skips comments as well.
547 S_skipspace(pTHX_ register char *s)
549 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
550 while (s < PL_bufend && SPACE_OR_TAB(*s))
556 SSize_t oldprevlen, oldoldprevlen;
557 SSize_t oldloplen = 0, oldunilen = 0;
558 while (s < PL_bufend && isSPACE(*s)) {
559 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
564 if (s < PL_bufend && *s == '#') {
565 while (s < PL_bufend && *s != '\n')
569 if (PL_in_eval && !PL_rsfp) {
576 /* only continue to recharge the buffer if we're at the end
577 * of the buffer, we're not reading from a source filter, and
578 * we're in normal lexing mode
580 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
581 PL_lex_state == LEX_FORMLINE)
584 /* try to recharge the buffer */
585 if ((s = filter_gets(PL_linestr, PL_rsfp,
586 (prevlen = SvCUR(PL_linestr)))) == Nullch)
588 /* end of file. Add on the -p or -n magic */
589 if (PL_minus_n || PL_minus_p) {
590 sv_setpv(PL_linestr,PL_minus_p ?
591 ";}continue{print or die qq(-p destination: $!\\n)" :
593 sv_catpv(PL_linestr,";}");
594 PL_minus_n = PL_minus_p = 0;
597 sv_setpv(PL_linestr,";");
599 /* reset variables for next time we lex */
600 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
602 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
603 PL_last_lop = PL_last_uni = Nullch;
605 /* Close the filehandle. Could be from -P preprocessor,
606 * STDIN, or a regular file. If we were reading code from
607 * STDIN (because the commandline held no -e or filename)
608 * then we don't close it, we reset it so the code can
609 * read from STDIN too.
612 if (PL_preprocess && !PL_in_eval)
613 (void)PerlProc_pclose(PL_rsfp);
614 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
615 PerlIO_clearerr(PL_rsfp);
617 (void)PerlIO_close(PL_rsfp);
622 /* not at end of file, so we only read another line */
623 /* make corresponding updates to old pointers, for yyerror() */
624 oldprevlen = PL_oldbufptr - PL_bufend;
625 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
627 oldunilen = PL_last_uni - PL_bufend;
629 oldloplen = PL_last_lop - PL_bufend;
630 PL_linestart = PL_bufptr = s + prevlen;
631 PL_bufend = s + SvCUR(PL_linestr);
633 PL_oldbufptr = s + oldprevlen;
634 PL_oldoldbufptr = s + oldoldprevlen;
636 PL_last_uni = s + oldunilen;
638 PL_last_lop = s + oldloplen;
641 /* debugger active and we're not compiling the debugger code,
642 * so store the line into the debugger's array of lines
644 if (PERLDB_LINE && PL_curstash != PL_debstash) {
645 SV *sv = NEWSV(85,0);
647 sv_upgrade(sv, SVt_PVMG);
648 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
651 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
658 * Check the unary operators to ensure there's no ambiguity in how they're
659 * used. An ambiguous piece of code would be:
661 * This doesn't mean rand() + 5. Because rand() is a unary operator,
662 * the +5 is its argument.
671 if (PL_oldoldbufptr != PL_last_uni)
673 while (isSPACE(*PL_last_uni))
675 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
676 if ((t = strchr(s, '(')) && t < PL_bufptr)
678 if (ckWARN_d(WARN_AMBIGUOUS)){
681 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
682 "Warning: Use of \"%s\" without parens is ambiguous",
688 /* workaround to replace the UNI() macro with a function. Only the
689 * hints/uts.sh file mentions this. Other comments elsewhere in the
690 * source indicate Microport Unix might need it too.
696 #define UNI(f) return uni(f,s)
699 S_uni(pTHX_ I32 f, char *s)
704 PL_last_uni = PL_oldbufptr;
715 #endif /* CRIPPLED_CC */
718 * LOP : macro to build a list operator. Its behaviour has been replaced
719 * with a subroutine, S_lop() for which LOP is just another name.
722 #define LOP(f,x) return lop(f,x,s)
726 * Build a list operator (or something that might be one). The rules:
727 * - if we have a next token, then it's a list operator [why?]
728 * - if the next thing is an opening paren, then it's a function
729 * - else it's a list operator
733 S_lop(pTHX_ I32 f, int x, char *s)
740 PL_last_lop = PL_oldbufptr;
755 * When the lexer realizes it knows the next token (for instance,
756 * it is reordering tokens for the parser) then it can call S_force_next
757 * to know what token to return the next time the lexer is called. Caller
758 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
759 * handles the token correctly.
763 S_force_next(pTHX_ I32 type)
765 PL_nexttype[PL_nexttoke] = type;
767 if (PL_lex_state != LEX_KNOWNEXT) {
768 PL_lex_defer = PL_lex_state;
769 PL_lex_expect = PL_expect;
770 PL_lex_state = LEX_KNOWNEXT;
776 * When the lexer knows the next thing is a word (for instance, it has
777 * just seen -> and it knows that the next char is a word char, then
778 * it calls S_force_word to stick the next word into the PL_next lookahead.
781 * char *start : buffer position (must be within PL_linestr)
782 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
783 * int check_keyword : if true, Perl checks to make sure the word isn't
784 * a keyword (do this if the word is a label, e.g. goto FOO)
785 * int allow_pack : if true, : characters will also be allowed (require,
787 * int allow_initial_tick : used by the "sub" lexer only.
791 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
796 start = skipspace(start);
798 if (isIDFIRST_lazy_if(s,UTF) ||
799 (allow_pack && *s == ':') ||
800 (allow_initial_tick && *s == '\'') )
802 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
803 if (check_keyword && keyword(PL_tokenbuf, len))
805 if (token == METHOD) {
810 PL_expect = XOPERATOR;
813 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
814 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
822 * Called when the lexer wants $foo *foo &foo etc, but the program
823 * text only contains the "foo" portion. The first argument is a pointer
824 * to the "foo", and the second argument is the type symbol to prefix.
825 * Forces the next token to be a "WORD".
826 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
830 S_force_ident(pTHX_ register char *s, int kind)
833 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
834 PL_nextval[PL_nexttoke].opval = o;
837 o->op_private = OPpCONST_ENTERED;
838 /* XXX see note in pp_entereval() for why we forgo typo
839 warnings if the symbol must be introduced in an eval.
841 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
842 kind == '$' ? SVt_PV :
843 kind == '@' ? SVt_PVAV :
844 kind == '%' ? SVt_PVHV :
852 Perl_str_to_version(pTHX_ SV *sv)
857 char *start = SvPVx(sv,len);
858 bool utf = SvUTF8(sv) ? TRUE : FALSE;
859 char *end = start + len;
860 while (start < end) {
864 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
869 retval += ((NV)n)/nshift;
878 * Forces the next token to be a version number.
879 * If the next token appears to be an invalid version number, (e.g. "v2b"),
880 * and if "guessing" is TRUE, then no new token is created (and the caller
881 * must use an alternative parsing method).
885 S_force_version(pTHX_ char *s, int guessing)
887 OP *version = Nullop;
896 while (isDIGIT(*d) || *d == '_' || *d == '.')
898 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
900 s = scan_num(s, &yylval);
901 version = yylval.opval;
902 ver = cSVOPx(version)->op_sv;
903 if (SvPOK(ver) && !SvNIOK(ver)) {
904 (void)SvUPGRADE(ver, SVt_PVNV);
905 SvNVX(ver) = str_to_version(ver);
906 SvNOK_on(ver); /* hint that it is a version */
913 /* NOTE: The parser sees the package name and the VERSION swapped */
914 PL_nextval[PL_nexttoke].opval = version;
922 * Tokenize a quoted string passed in as an SV. It finds the next
923 * chunk, up to end of string or a backslash. It may make a new
924 * SV containing that chunk (if HINT_NEW_STRING is on). It also
929 S_tokeq(pTHX_ SV *sv)
940 s = SvPV_force(sv, len);
941 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
944 while (s < send && *s != '\\')
949 if ( PL_hints & HINT_NEW_STRING ) {
950 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
956 if (s + 1 < send && (s[1] == '\\'))
957 s++; /* all that, just for this */
962 SvCUR_set(sv, d - SvPVX(sv));
964 if ( PL_hints & HINT_NEW_STRING )
965 return new_constant(NULL, 0, "q", sv, pv, "q");
970 * Now come three functions related to double-quote context,
971 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
972 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
973 * interact with PL_lex_state, and create fake ( ... ) argument lists
974 * to handle functions and concatenation.
975 * They assume that whoever calls them will be setting up a fake
976 * join call, because each subthing puts a ',' after it. This lets
979 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
981 * (I'm not sure whether the spurious commas at the end of lcfirst's
982 * arguments and join's arguments are created or not).
987 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
989 * Pattern matching will set PL_lex_op to the pattern-matching op to
990 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
992 * OP_CONST and OP_READLINE are easy--just make the new op and return.
994 * Everything else becomes a FUNC.
996 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
997 * had an OP_CONST or OP_READLINE). This just sets us up for a
998 * call to S_sublex_push().
1002 S_sublex_start(pTHX)
1004 register I32 op_type = yylval.ival;
1006 if (op_type == OP_NULL) {
1007 yylval.opval = PL_lex_op;
1011 if (op_type == OP_CONST || op_type == OP_READLINE) {
1012 SV *sv = tokeq(PL_lex_stuff);
1014 if (SvTYPE(sv) == SVt_PVIV) {
1015 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1021 nsv = newSVpvn(p, len);
1027 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1028 PL_lex_stuff = Nullsv;
1032 PL_sublex_info.super_state = PL_lex_state;
1033 PL_sublex_info.sub_inwhat = op_type;
1034 PL_sublex_info.sub_op = PL_lex_op;
1035 PL_lex_state = LEX_INTERPPUSH;
1039 yylval.opval = PL_lex_op;
1049 * Create a new scope to save the lexing state. The scope will be
1050 * ended in S_sublex_done. Returns a '(', starting the function arguments
1051 * to the uc, lc, etc. found before.
1052 * Sets PL_lex_state to LEX_INTERPCONCAT.
1060 PL_lex_state = PL_sublex_info.super_state;
1061 SAVEI32(PL_lex_dojoin);
1062 SAVEI32(PL_lex_brackets);
1063 SAVEI32(PL_lex_casemods);
1064 SAVEI32(PL_lex_starts);
1065 SAVEI32(PL_lex_state);
1066 SAVEVPTR(PL_lex_inpat);
1067 SAVEI32(PL_lex_inwhat);
1068 SAVECOPLINE(PL_curcop);
1069 SAVEPPTR(PL_bufptr);
1070 SAVEPPTR(PL_bufend);
1071 SAVEPPTR(PL_oldbufptr);
1072 SAVEPPTR(PL_oldoldbufptr);
1073 SAVEPPTR(PL_last_lop);
1074 SAVEPPTR(PL_last_uni);
1075 SAVEPPTR(PL_linestart);
1076 SAVESPTR(PL_linestr);
1077 SAVEPPTR(PL_lex_brackstack);
1078 SAVEPPTR(PL_lex_casestack);
1080 PL_linestr = PL_lex_stuff;
1081 PL_lex_stuff = Nullsv;
1083 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1084 = SvPVX(PL_linestr);
1085 PL_bufend += SvCUR(PL_linestr);
1086 PL_last_lop = PL_last_uni = Nullch;
1087 SAVEFREESV(PL_linestr);
1089 PL_lex_dojoin = FALSE;
1090 PL_lex_brackets = 0;
1091 New(899, PL_lex_brackstack, 120, char);
1092 New(899, PL_lex_casestack, 12, char);
1093 SAVEFREEPV(PL_lex_brackstack);
1094 SAVEFREEPV(PL_lex_casestack);
1095 PL_lex_casemods = 0;
1096 *PL_lex_casestack = '\0';
1098 PL_lex_state = LEX_INTERPCONCAT;
1099 CopLINE_set(PL_curcop, PL_multi_start);
1101 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1102 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1103 PL_lex_inpat = PL_sublex_info.sub_op;
1105 PL_lex_inpat = Nullop;
1112 * Restores lexer state after a S_sublex_push.
1118 if (!PL_lex_starts++) {
1119 SV *sv = newSVpvn("",0);
1120 if (SvUTF8(PL_linestr))
1122 PL_expect = XOPERATOR;
1123 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1127 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1128 PL_lex_state = LEX_INTERPCASEMOD;
1132 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1133 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1134 PL_linestr = PL_lex_repl;
1136 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1137 PL_bufend += SvCUR(PL_linestr);
1138 PL_last_lop = PL_last_uni = Nullch;
1139 SAVEFREESV(PL_linestr);
1140 PL_lex_dojoin = FALSE;
1141 PL_lex_brackets = 0;
1142 PL_lex_casemods = 0;
1143 *PL_lex_casestack = '\0';
1145 if (SvEVALED(PL_lex_repl)) {
1146 PL_lex_state = LEX_INTERPNORMAL;
1148 /* we don't clear PL_lex_repl here, so that we can check later
1149 whether this is an evalled subst; that means we rely on the
1150 logic to ensure sublex_done() is called again only via the
1151 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1154 PL_lex_state = LEX_INTERPCONCAT;
1155 PL_lex_repl = Nullsv;
1161 PL_bufend = SvPVX(PL_linestr);
1162 PL_bufend += SvCUR(PL_linestr);
1163 PL_expect = XOPERATOR;
1164 PL_sublex_info.sub_inwhat = 0;
1172 Extracts a pattern, double-quoted string, or transliteration. This
1175 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1176 processing a pattern (PL_lex_inpat is true), a transliteration
1177 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1179 Returns a pointer to the character scanned up to. Iff this is
1180 advanced from the start pointer supplied (ie if anything was
1181 successfully parsed), will leave an OP for the substring scanned
1182 in yylval. Caller must intuit reason for not parsing further
1183 by looking at the next characters herself.
1187 double-quoted style: \r and \n
1188 regexp special ones: \D \s
1190 backrefs: \1 (deprecated in substitution replacements)
1191 case and quoting: \U \Q \E
1192 stops on @ and $, but not for $ as tail anchor
1194 In transliterations:
1195 characters are VERY literal, except for - not at the start or end
1196 of the string, which indicates a range. scan_const expands the
1197 range to the full set of intermediate characters.
1199 In double-quoted strings:
1201 double-quoted style: \r and \n
1203 backrefs: \1 (deprecated)
1204 case and quoting: \U \Q \E
1207 scan_const does *not* construct ops to handle interpolated strings.
1208 It stops processing as soon as it finds an embedded $ or @ variable
1209 and leaves it to the caller to work out what's going on.
1211 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1213 $ in pattern could be $foo or could be tail anchor. Assumption:
1214 it's a tail anchor if $ is the last thing in the string, or if it's
1215 followed by one of ")| \n\t"
1217 \1 (backreferences) are turned into $1
1219 The structure of the code is
1220 while (there's a character to process) {
1221 handle transliteration ranges
1222 skip regexp comments
1223 skip # initiated comments in //x patterns
1224 check for embedded @foo
1225 check for embedded scalars
1227 leave intact backslashes from leave (below)
1228 deprecate \1 in strings and sub replacements
1229 handle string-changing backslashes \l \U \Q \E, etc.
1230 switch (what was escaped) {
1231 handle - in a transliteration (becomes a literal -)
1232 handle \132 octal characters
1233 handle 0x15 hex characters
1234 handle \cV (control V)
1235 handle printf backslashes (\f, \r, \n, etc)
1237 } (end if backslash)
1238 } (end while character to read)
1243 S_scan_const(pTHX_ char *start)
1245 register char *send = PL_bufend; /* end of the constant */
1246 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1247 register char *s = start; /* start of the constant */
1248 register char *d = SvPVX(sv); /* destination for copies */
1249 bool dorange = FALSE; /* are we in a translit range? */
1250 bool didrange = FALSE; /* did we just finish a range? */
1251 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1252 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1255 const char *leaveit = /* set of acceptably-backslashed characters */
1257 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1260 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1261 /* If we are doing a trans and we know we want UTF8 set expectation */
1262 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1263 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1267 while (s < send || dorange) {
1268 /* get transliterations out of the way (they're most literal) */
1269 if (PL_lex_inwhat == OP_TRANS) {
1270 /* expand a range A-Z to the full set of characters. AIE! */
1272 I32 i; /* current expanded character */
1273 I32 min; /* first character in range */
1274 I32 max; /* last character in range */
1277 char *c = (char*)utf8_hop((U8*)d, -1);
1281 *c = (char)UTF_TO_NATIVE(0xff);
1282 /* mark the range as done, and continue */
1288 i = d - SvPVX(sv); /* remember current offset */
1289 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1290 d = SvPVX(sv) + i; /* refresh d after realloc */
1291 d -= 2; /* eat the first char and the - */
1293 min = (U8)*d; /* first char in range */
1294 max = (U8)d[1]; /* last char in range */
1298 "Invalid [] range \"%c-%c\" in transliteration operator",
1299 (char)min, (char)max);
1303 if ((isLOWER(min) && isLOWER(max)) ||
1304 (isUPPER(min) && isUPPER(max))) {
1306 for (i = min; i <= max; i++)
1308 *d++ = NATIVE_TO_NEED(has_utf8,i);
1310 for (i = min; i <= max; i++)
1312 *d++ = NATIVE_TO_NEED(has_utf8,i);
1317 for (i = min; i <= max; i++)
1320 /* mark the range as done, and continue */
1326 /* range begins (ignore - as first or last char) */
1327 else if (*s == '-' && s+1 < send && s != start) {
1329 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1332 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1344 /* if we get here, we're not doing a transliteration */
1346 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1347 except for the last char, which will be done separately. */
1348 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1350 while (s < send && *s != ')')
1351 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1353 else if (s[2] == '{' /* This should match regcomp.c */
1354 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1357 char *regparse = s + (s[2] == '{' ? 3 : 4);
1360 while (count && (c = *regparse)) {
1361 if (c == '\\' && regparse[1])
1369 if (*regparse != ')') {
1370 regparse--; /* Leave one char for continuation. */
1371 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1373 while (s < regparse)
1374 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1378 /* likewise skip #-initiated comments in //x patterns */
1379 else if (*s == '#' && PL_lex_inpat &&
1380 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1381 while (s+1 < send && *s != '\n')
1382 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1385 /* check for embedded arrays
1386 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1388 else if (*s == '@' && s[1]
1389 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1392 /* check for embedded scalars. only stop if we're sure it's a
1395 else if (*s == '$') {
1396 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1398 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1399 break; /* in regexp, $ might be tail anchor */
1402 /* End of else if chain - OP_TRANS rejoin rest */
1405 if (*s == '\\' && s+1 < send) {
1408 /* some backslashes we leave behind */
1409 if (*leaveit && *s && strchr(leaveit, *s)) {
1410 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1411 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1415 /* deprecate \1 in strings and substitution replacements */
1416 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1417 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1419 if (ckWARN(WARN_SYNTAX))
1420 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1425 /* string-change backslash escapes */
1426 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1431 /* if we get here, it's either a quoted -, or a digit */
1434 /* quoted - in transliterations */
1436 if (PL_lex_inwhat == OP_TRANS) {
1443 if (ckWARN(WARN_MISC) &&
1446 Perl_warner(aTHX_ packWARN(WARN_MISC),
1447 "Unrecognized escape \\%c passed through",
1449 /* default action is to copy the quoted character */
1450 goto default_action;
1453 /* \132 indicates an octal constant */
1454 case '0': case '1': case '2': case '3':
1455 case '4': case '5': case '6': case '7':
1459 uv = grok_oct(s, &len, &flags, NULL);
1462 goto NUM_ESCAPE_INSERT;
1464 /* \x24 indicates a hex constant */
1468 char* e = strchr(s, '}');
1469 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1470 PERL_SCAN_DISALLOW_PREFIX;
1475 yyerror("Missing right brace on \\x{}");
1479 uv = grok_hex(s, &len, &flags, NULL);
1485 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1486 uv = grok_hex(s, &len, &flags, NULL);
1492 /* Insert oct or hex escaped character.
1493 * There will always enough room in sv since such
1494 * escapes will be longer than any UTF-8 sequence
1495 * they can end up as. */
1497 /* We need to map to chars to ASCII before doing the tests
1500 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1501 if (!has_utf8 && uv > 255) {
1502 /* Might need to recode whatever we have
1503 * accumulated so far if it contains any
1506 * (Can't we keep track of that and avoid
1507 * this rescan? --jhi)
1511 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1512 if (!NATIVE_IS_INVARIANT(*c)) {
1517 STRLEN offset = d - SvPVX(sv);
1519 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1523 while (src >= (U8 *)SvPVX(sv)) {
1524 if (!NATIVE_IS_INVARIANT(*src)) {
1525 U8 ch = NATIVE_TO_ASCII(*src);
1526 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1527 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1537 if (has_utf8 || uv > 255) {
1538 d = (char*)uvchr_to_utf8((U8*)d, uv);
1540 if (PL_lex_inwhat == OP_TRANS &&
1541 PL_sublex_info.sub_op) {
1542 PL_sublex_info.sub_op->op_private |=
1543 (PL_lex_repl ? OPpTRANS_FROM_UTF
1556 /* \N{LATIN SMALL LETTER A} is a named character */
1560 char* e = strchr(s, '}');
1566 yyerror("Missing right brace on \\N{}");
1570 res = newSVpvn(s + 1, e - s - 1);
1571 res = new_constant( Nullch, 0, "charnames",
1572 res, Nullsv, "\\N{...}" );
1574 sv_utf8_upgrade(res);
1575 str = SvPV(res,len);
1576 #ifdef EBCDIC_NEVER_MIND
1577 /* charnames uses pack U and that has been
1578 * recently changed to do the below uni->native
1579 * mapping, so this would be redundant (and wrong,
1580 * the code point would be doubly converted).
1581 * But leave this in just in case the pack U change
1582 * gets revoked, but the semantics is still
1583 * desireable for charnames. --jhi */
1585 UV uv = utf8_to_uvchr((U8*)str, 0);
1588 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1590 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1591 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1592 str = SvPV(res, len);
1596 if (!has_utf8 && SvUTF8(res)) {
1597 char *ostart = SvPVX(sv);
1598 SvCUR_set(sv, d - ostart);
1601 sv_utf8_upgrade(sv);
1602 /* this just broke our allocation above... */
1603 SvGROW(sv, send - start);
1604 d = SvPVX(sv) + SvCUR(sv);
1607 if (len > e - s + 4) { /* I _guess_ 4 is \N{} --jhi */
1608 char *odest = SvPVX(sv);
1610 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1611 d = SvPVX(sv) + (d - odest);
1613 Copy(str, d, len, char);
1620 yyerror("Missing braces on \\N{}");
1623 /* \c is a control character */
1632 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1636 /* printf-style backslashes, formfeeds, newlines, etc */
1638 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1641 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1644 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1647 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1650 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1653 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1656 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1662 } /* end if (backslash) */
1665 /* If we started with encoded form, or already know we want it
1666 and then encode the next character */
1667 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1669 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1670 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1673 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1674 STRLEN off = d - SvPVX(sv);
1675 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1677 d = (char*)uvchr_to_utf8((U8*)d, uv);
1681 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1683 } /* while loop to process each character */
1685 /* terminate the string and set up the sv */
1687 SvCUR_set(sv, d - SvPVX(sv));
1688 if (SvCUR(sv) >= SvLEN(sv))
1689 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1692 if (PL_encoding && !has_utf8) {
1693 sv_recode_to_utf8(sv, PL_encoding);
1698 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1699 PL_sublex_info.sub_op->op_private |=
1700 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1704 /* shrink the sv if we allocated more than we used */
1705 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1706 SvLEN_set(sv, SvCUR(sv) + 1);
1707 Renew(SvPVX(sv), SvLEN(sv), char);
1710 /* return the substring (via yylval) only if we parsed anything */
1711 if (s > PL_bufptr) {
1712 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1713 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1715 ( PL_lex_inwhat == OP_TRANS
1717 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1720 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1727 * Returns TRUE if there's more to the expression (e.g., a subscript),
1730 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1732 * ->[ and ->{ return TRUE
1733 * { and [ outside a pattern are always subscripts, so return TRUE
1734 * if we're outside a pattern and it's not { or [, then return FALSE
1735 * if we're in a pattern and the first char is a {
1736 * {4,5} (any digits around the comma) returns FALSE
1737 * if we're in a pattern and the first char is a [
1739 * [SOMETHING] has a funky algorithm to decide whether it's a
1740 * character class or not. It has to deal with things like
1741 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1742 * anything else returns TRUE
1745 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1748 S_intuit_more(pTHX_ register char *s)
1750 if (PL_lex_brackets)
1752 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1754 if (*s != '{' && *s != '[')
1759 /* In a pattern, so maybe we have {n,m}. */
1776 /* On the other hand, maybe we have a character class */
1779 if (*s == ']' || *s == '^')
1782 /* this is terrifying, and it works */
1783 int weight = 2; /* let's weigh the evidence */
1785 unsigned char un_char = 255, last_un_char;
1786 char *send = strchr(s,']');
1787 char tmpbuf[sizeof PL_tokenbuf * 4];
1789 if (!send) /* has to be an expression */
1792 Zero(seen,256,char);
1795 else if (isDIGIT(*s)) {
1797 if (isDIGIT(s[1]) && s[2] == ']')
1803 for (; s < send; s++) {
1804 last_un_char = un_char;
1805 un_char = (unsigned char)*s;
1810 weight -= seen[un_char] * 10;
1811 if (isALNUM_lazy_if(s+1,UTF)) {
1812 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1813 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1818 else if (*s == '$' && s[1] &&
1819 strchr("[#!%*<>()-=",s[1])) {
1820 if (/*{*/ strchr("])} =",s[2]))
1829 if (strchr("wds]",s[1]))
1831 else if (seen['\''] || seen['"'])
1833 else if (strchr("rnftbxcav",s[1]))
1835 else if (isDIGIT(s[1])) {
1837 while (s[1] && isDIGIT(s[1]))
1847 if (strchr("aA01! ",last_un_char))
1849 if (strchr("zZ79~",s[1]))
1851 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1852 weight -= 5; /* cope with negative subscript */
1855 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1856 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1861 if (keyword(tmpbuf, d - tmpbuf))
1864 if (un_char == last_un_char + 1)
1866 weight -= seen[un_char];
1871 if (weight >= 0) /* probably a character class */
1881 * Does all the checking to disambiguate
1883 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1884 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1886 * First argument is the stuff after the first token, e.g. "bar".
1888 * Not a method if bar is a filehandle.
1889 * Not a method if foo is a subroutine prototyped to take a filehandle.
1890 * Not a method if it's really "Foo $bar"
1891 * Method if it's "foo $bar"
1892 * Not a method if it's really "print foo $bar"
1893 * Method if it's really "foo package::" (interpreted as package->foo)
1894 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1895 * Not a method if bar is a filehandle or package, but is quoted with
1900 S_intuit_method(pTHX_ char *start, GV *gv)
1902 char *s = start + (*start == '$');
1903 char tmpbuf[sizeof PL_tokenbuf];
1911 if ((cv = GvCVu(gv))) {
1912 char *proto = SvPVX(cv);
1922 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1923 /* start is the beginning of the possible filehandle/object,
1924 * and s is the end of it
1925 * tmpbuf is a copy of it
1928 if (*start == '$') {
1929 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1934 return *s == '(' ? FUNCMETH : METHOD;
1936 if (!keyword(tmpbuf, len)) {
1937 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1942 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1943 if (indirgv && GvCVu(indirgv))
1945 /* filehandle or package name makes it a method */
1946 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1948 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1949 return 0; /* no assumptions -- "=>" quotes bearword */
1951 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1952 newSVpvn(tmpbuf,len));
1953 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1957 return *s == '(' ? FUNCMETH : METHOD;
1965 * Return a string of Perl code to load the debugger. If PERL5DB
1966 * is set, it will return the contents of that, otherwise a
1967 * compile-time require of perl5db.pl.
1974 char *pdb = PerlEnv_getenv("PERL5DB");
1978 SETERRNO(0,SS$_NORMAL);
1979 return "BEGIN { require 'perl5db.pl' }";
1985 /* Encoded script support. filter_add() effectively inserts a
1986 * 'pre-processing' function into the current source input stream.
1987 * Note that the filter function only applies to the current source file
1988 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1990 * The datasv parameter (which may be NULL) can be used to pass
1991 * private data to this instance of the filter. The filter function
1992 * can recover the SV using the FILTER_DATA macro and use it to
1993 * store private buffers and state information.
1995 * The supplied datasv parameter is upgraded to a PVIO type
1996 * and the IoDIRP/IoANY field is used to store the function pointer,
1997 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1998 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1999 * private use must be set using malloc'd pointers.
2003 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2008 if (!PL_rsfp_filters)
2009 PL_rsfp_filters = newAV();
2011 datasv = NEWSV(255,0);
2012 if (!SvUPGRADE(datasv, SVt_PVIO))
2013 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2014 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2015 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2016 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2017 (void*)funcp, SvPV_nolen(datasv)));
2018 av_unshift(PL_rsfp_filters, 1);
2019 av_store(PL_rsfp_filters, 0, datasv) ;
2024 /* Delete most recently added instance of this filter function. */
2026 Perl_filter_del(pTHX_ filter_t funcp)
2029 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2030 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2032 /* if filter is on top of stack (usual case) just pop it off */
2033 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2034 if (IoANY(datasv) == (void *)funcp) {
2035 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2036 IoANY(datasv) = (void *)NULL;
2037 sv_free(av_pop(PL_rsfp_filters));
2041 /* we need to search for the correct entry and clear it */
2042 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2046 /* Invoke the n'th filter function for the current rsfp. */
2048 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2051 /* 0 = read one text line */
2056 if (!PL_rsfp_filters)
2058 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2059 /* Provide a default input filter to make life easy. */
2060 /* Note that we append to the line. This is handy. */
2061 DEBUG_P(PerlIO_printf(Perl_debug_log,
2062 "filter_read %d: from rsfp\n", idx));
2066 int old_len = SvCUR(buf_sv) ;
2068 /* ensure buf_sv is large enough */
2069 SvGROW(buf_sv, old_len + maxlen) ;
2070 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2071 if (PerlIO_error(PL_rsfp))
2072 return -1; /* error */
2074 return 0 ; /* end of file */
2076 SvCUR_set(buf_sv, old_len + len) ;
2079 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2080 if (PerlIO_error(PL_rsfp))
2081 return -1; /* error */
2083 return 0 ; /* end of file */
2086 return SvCUR(buf_sv);
2088 /* Skip this filter slot if filter has been deleted */
2089 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2090 DEBUG_P(PerlIO_printf(Perl_debug_log,
2091 "filter_read %d: skipped (filter deleted)\n",
2093 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2095 /* Get function pointer hidden within datasv */
2096 funcp = (filter_t)IoANY(datasv);
2097 DEBUG_P(PerlIO_printf(Perl_debug_log,
2098 "filter_read %d: via function %p (%s)\n",
2099 idx, (void*)funcp, SvPV_nolen(datasv)));
2100 /* Call function. The function is expected to */
2101 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2102 /* Return: <0:error, =0:eof, >0:not eof */
2103 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2107 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2109 #ifdef PERL_CR_FILTER
2110 if (!PL_rsfp_filters) {
2111 filter_add(S_cr_textfilter,NULL);
2114 if (PL_rsfp_filters) {
2117 SvCUR_set(sv, 0); /* start with empty line */
2118 if (FILTER_READ(0, sv, 0) > 0)
2119 return ( SvPVX(sv) ) ;
2124 return (sv_gets(sv, fp, append));
2128 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2132 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2136 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2137 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2139 return GvHV(gv); /* Foo:: */
2142 /* use constant CLASS => 'MyClass' */
2143 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2145 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2146 pkgname = SvPV_nolen(sv);
2150 return gv_stashpv(pkgname, FALSE);
2154 static char* exp_name[] =
2155 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2156 "ATTRTERM", "TERMBLOCK"
2163 Works out what to call the token just pulled out of the input
2164 stream. The yacc parser takes care of taking the ops we return and
2165 stitching them into a tree.
2171 if read an identifier
2172 if we're in a my declaration
2173 croak if they tried to say my($foo::bar)
2174 build the ops for a my() declaration
2175 if it's an access to a my() variable
2176 are we in a sort block?
2177 croak if my($a); $a <=> $b
2178 build ops for access to a my() variable
2179 if in a dq string, and they've said @foo and we can't find @foo
2181 build ops for a bareword
2182 if we already built the token before, use it.
2185 #ifdef USE_PURE_BISON
2187 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2192 yylval_pointer[yyactlevel] = lvalp;
2193 yychar_pointer[yyactlevel] = lcharp;
2194 if (yyactlevel >= YYMAXLEVEL)
2195 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2197 r = Perl_yylex(aTHX);
2207 #pragma segment Perl_yylex
2220 /* check if there's an identifier for us to look at */
2221 if (PL_pending_ident)
2222 return S_pending_ident(aTHX);
2224 /* no identifier pending identification */
2226 switch (PL_lex_state) {
2228 case LEX_NORMAL: /* Some compilers will produce faster */
2229 case LEX_INTERPNORMAL: /* code if we comment these out. */
2233 /* when we've already built the next token, just pull it out of the queue */
2236 yylval = PL_nextval[PL_nexttoke];
2238 PL_lex_state = PL_lex_defer;
2239 PL_expect = PL_lex_expect;
2240 PL_lex_defer = LEX_NORMAL;
2242 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2243 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2244 (IV)PL_nexttype[PL_nexttoke]); });
2246 return(PL_nexttype[PL_nexttoke]);
2248 /* interpolated case modifiers like \L \U, including \Q and \E.
2249 when we get here, PL_bufptr is at the \
2251 case LEX_INTERPCASEMOD:
2253 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2254 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2256 /* handle \E or end of string */
2257 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2261 if (PL_lex_casemods) {
2262 oldmod = PL_lex_casestack[--PL_lex_casemods];
2263 PL_lex_casestack[PL_lex_casemods] = '\0';
2265 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2267 PL_lex_state = LEX_INTERPCONCAT;
2271 if (PL_bufptr != PL_bufend)
2273 PL_lex_state = LEX_INTERPCONCAT;
2277 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2278 "### Saw case modifier at '%s'\n", PL_bufptr); });
2280 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2281 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2282 if (strchr("LU", *s) &&
2283 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2285 PL_lex_casestack[--PL_lex_casemods] = '\0';
2288 if (PL_lex_casemods > 10) {
2289 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2290 if (newlb != PL_lex_casestack) {
2292 PL_lex_casestack = newlb;
2295 PL_lex_casestack[PL_lex_casemods++] = *s;
2296 PL_lex_casestack[PL_lex_casemods] = '\0';
2297 PL_lex_state = LEX_INTERPCONCAT;
2298 PL_nextval[PL_nexttoke].ival = 0;
2301 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2303 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2305 PL_nextval[PL_nexttoke].ival = OP_LC;
2307 PL_nextval[PL_nexttoke].ival = OP_UC;
2309 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2311 Perl_croak(aTHX_ "panic: yylex");
2314 if (PL_lex_starts) {
2323 case LEX_INTERPPUSH:
2324 return sublex_push();
2326 case LEX_INTERPSTART:
2327 if (PL_bufptr == PL_bufend)
2328 return sublex_done();
2329 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2330 "### Interpolated variable at '%s'\n", PL_bufptr); });
2332 PL_lex_dojoin = (*PL_bufptr == '@');
2333 PL_lex_state = LEX_INTERPNORMAL;
2334 if (PL_lex_dojoin) {
2335 PL_nextval[PL_nexttoke].ival = 0;
2337 #ifdef USE_5005THREADS
2338 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2339 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2340 force_next(PRIVATEREF);
2342 force_ident("\"", '$');
2343 #endif /* USE_5005THREADS */
2344 PL_nextval[PL_nexttoke].ival = 0;
2346 PL_nextval[PL_nexttoke].ival = 0;
2348 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2351 if (PL_lex_starts++) {
2357 case LEX_INTERPENDMAYBE:
2358 if (intuit_more(PL_bufptr)) {
2359 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2365 if (PL_lex_dojoin) {
2366 PL_lex_dojoin = FALSE;
2367 PL_lex_state = LEX_INTERPCONCAT;
2370 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2371 && SvEVALED(PL_lex_repl))
2373 if (PL_bufptr != PL_bufend)
2374 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2375 PL_lex_repl = Nullsv;
2378 case LEX_INTERPCONCAT:
2380 if (PL_lex_brackets)
2381 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2383 if (PL_bufptr == PL_bufend)
2384 return sublex_done();
2386 if (SvIVX(PL_linestr) == '\'') {
2387 SV *sv = newSVsv(PL_linestr);
2390 else if ( PL_hints & HINT_NEW_RE )
2391 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2392 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2396 s = scan_const(PL_bufptr);
2398 PL_lex_state = LEX_INTERPCASEMOD;
2400 PL_lex_state = LEX_INTERPSTART;
2403 if (s != PL_bufptr) {
2404 PL_nextval[PL_nexttoke] = yylval;
2407 if (PL_lex_starts++)
2417 PL_lex_state = LEX_NORMAL;
2418 s = scan_formline(PL_bufptr);
2419 if (!PL_lex_formbrack)
2425 PL_oldoldbufptr = PL_oldbufptr;
2428 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2429 exp_name[PL_expect], s);
2435 if (isIDFIRST_lazy_if(s,UTF))
2437 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2440 goto fake_eof; /* emulate EOF on ^D or ^Z */
2445 if (PL_lex_brackets)
2446 yyerror("Missing right curly or square bracket");
2447 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2448 "### Tokener got EOF\n");
2452 if (s++ < PL_bufend)
2453 goto retry; /* ignore stray nulls */
2456 if (!PL_in_eval && !PL_preambled) {
2457 PL_preambled = TRUE;
2458 sv_setpv(PL_linestr,incl_perldb());
2459 if (SvCUR(PL_linestr))
2460 sv_catpv(PL_linestr,";");
2462 while(AvFILLp(PL_preambleav) >= 0) {
2463 SV *tmpsv = av_shift(PL_preambleav);
2464 sv_catsv(PL_linestr, tmpsv);
2465 sv_catpv(PL_linestr, ";");
2468 sv_free((SV*)PL_preambleav);
2469 PL_preambleav = NULL;
2471 if (PL_minus_n || PL_minus_p) {
2472 sv_catpv(PL_linestr, "LINE: while (<>) {");
2474 sv_catpv(PL_linestr,"chomp;");
2477 if (strchr("/'\"", *PL_splitstr)
2478 && strchr(PL_splitstr + 1, *PL_splitstr))
2479 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2482 s = "'~#\200\1'"; /* surely one char is unused...*/
2483 while (s[1] && strchr(PL_splitstr, *s)) s++;
2485 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2486 "q" + (delim == '\''), delim);
2487 for (s = PL_splitstr; *s; s++) {
2489 sv_catpvn(PL_linestr, "\\", 1);
2490 sv_catpvn(PL_linestr, s, 1);
2492 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2496 sv_catpv(PL_linestr,"our @F=split(' ');");
2499 sv_catpv(PL_linestr, "\n");
2500 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2501 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2502 PL_last_lop = PL_last_uni = Nullch;
2503 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2504 SV *sv = NEWSV(85,0);
2506 sv_upgrade(sv, SVt_PVMG);
2507 sv_setsv(sv,PL_linestr);
2510 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2515 bof = PL_rsfp ? TRUE : FALSE;
2516 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2519 if (PL_preprocess && !PL_in_eval)
2520 (void)PerlProc_pclose(PL_rsfp);
2521 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2522 PerlIO_clearerr(PL_rsfp);
2524 (void)PerlIO_close(PL_rsfp);
2526 PL_doextract = FALSE;
2528 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2529 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2530 sv_catpv(PL_linestr,";}");
2531 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2532 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2533 PL_last_lop = PL_last_uni = Nullch;
2534 PL_minus_n = PL_minus_p = 0;
2537 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2538 PL_last_lop = PL_last_uni = Nullch;
2539 sv_setpv(PL_linestr,"");
2540 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2542 /* if it looks like the start of a BOM, check if it in fact is */
2543 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2544 #ifdef PERLIO_IS_STDIO
2545 # ifdef __GNU_LIBRARY__
2546 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2547 # define FTELL_FOR_PIPE_IS_BROKEN
2551 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2552 # define FTELL_FOR_PIPE_IS_BROKEN
2557 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2558 /* This loses the possibility to detect the bof
2559 * situation on perl -P when the libc5 is being used.
2560 * Workaround? Maybe attach some extra state to PL_rsfp?
2563 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2565 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2568 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2569 s = swallow_bom((U8*)s);
2573 /* Incest with pod. */
2574 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2575 sv_setpv(PL_linestr, "");
2576 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2577 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2578 PL_last_lop = PL_last_uni = Nullch;
2579 PL_doextract = FALSE;
2583 } while (PL_doextract);
2584 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2585 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2586 SV *sv = NEWSV(85,0);
2588 sv_upgrade(sv, SVt_PVMG);
2589 sv_setsv(sv,PL_linestr);
2592 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2594 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2595 PL_last_lop = PL_last_uni = Nullch;
2596 if (CopLINE(PL_curcop) == 1) {
2597 while (s < PL_bufend && isSPACE(*s))
2599 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2603 if (*s == '#' && *(s+1) == '!')
2605 #ifdef ALTERNATE_SHEBANG
2607 static char as[] = ALTERNATE_SHEBANG;
2608 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2609 d = s + (sizeof(as) - 1);
2611 #endif /* ALTERNATE_SHEBANG */
2620 while (*d && !isSPACE(*d))
2624 #ifdef ARG_ZERO_IS_SCRIPT
2625 if (ipathend > ipath) {
2627 * HP-UX (at least) sets argv[0] to the script name,
2628 * which makes $^X incorrect. And Digital UNIX and Linux,
2629 * at least, set argv[0] to the basename of the Perl
2630 * interpreter. So, having found "#!", we'll set it right.
2632 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2633 assert(SvPOK(x) || SvGMAGICAL(x));
2634 if (sv_eq(x, CopFILESV(PL_curcop))) {
2635 sv_setpvn(x, ipath, ipathend - ipath);
2638 TAINT_NOT; /* $^X is always tainted, but that's OK */
2640 #endif /* ARG_ZERO_IS_SCRIPT */
2645 d = instr(s,"perl -");
2647 d = instr(s,"perl");
2649 /* avoid getting into infinite loops when shebang
2650 * line contains "Perl" rather than "perl" */
2652 for (d = ipathend-4; d >= ipath; --d) {
2653 if ((*d == 'p' || *d == 'P')
2654 && !ibcmp(d, "perl", 4))
2664 #ifdef ALTERNATE_SHEBANG
2666 * If the ALTERNATE_SHEBANG on this system starts with a
2667 * character that can be part of a Perl expression, then if
2668 * we see it but not "perl", we're probably looking at the
2669 * start of Perl code, not a request to hand off to some
2670 * other interpreter. Similarly, if "perl" is there, but
2671 * not in the first 'word' of the line, we assume the line
2672 * contains the start of the Perl program.
2674 if (d && *s != '#') {
2676 while (*c && !strchr("; \t\r\n\f\v#", *c))
2679 d = Nullch; /* "perl" not in first word; ignore */
2681 *s = '#'; /* Don't try to parse shebang line */
2683 #endif /* ALTERNATE_SHEBANG */
2684 #ifndef MACOS_TRADITIONAL
2689 !instr(s,"indir") &&
2690 instr(PL_origargv[0],"perl"))
2696 while (s < PL_bufend && isSPACE(*s))
2698 if (s < PL_bufend) {
2699 Newz(899,newargv,PL_origargc+3,char*);
2701 while (s < PL_bufend && !isSPACE(*s))
2704 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2707 newargv = PL_origargv;
2709 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2710 Perl_croak(aTHX_ "Can't exec %s", ipath);
2714 U32 oldpdb = PL_perldb;
2715 bool oldn = PL_minus_n;
2716 bool oldp = PL_minus_p;
2718 while (*d && !isSPACE(*d)) d++;
2719 while (SPACE_OR_TAB(*d)) d++;
2722 bool switches_done = PL_doswitches;
2724 if (*d == 'M' || *d == 'm') {
2726 while (*d && !isSPACE(*d)) d++;
2727 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2730 d = moreswitches(d);
2732 if ((PERLDB_LINE && !oldpdb) ||
2733 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2734 /* if we have already added "LINE: while (<>) {",
2735 we must not do it again */
2737 sv_setpv(PL_linestr, "");
2738 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2739 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2740 PL_last_lop = PL_last_uni = Nullch;
2741 PL_preambled = FALSE;
2743 (void)gv_fetchfile(PL_origfilename);
2746 if (PL_doswitches && !switches_done) {
2747 int argc = PL_origargc;
2748 char **argv = PL_origargv;
2751 } while (argc && argv[0][0] == '-' && argv[0][1]);
2752 init_argv_symbols(argc,argv);
2758 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2760 PL_lex_state = LEX_FORMLINE;
2765 #ifdef PERL_STRICT_CR
2766 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2768 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2770 case ' ': case '\t': case '\f': case 013:
2771 #ifdef MACOS_TRADITIONAL
2778 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2779 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2780 /* handle eval qq[#line 1 "foo"\n ...] */
2781 CopLINE_dec(PL_curcop);
2785 while (s < d && *s != '\n')
2789 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2790 Perl_croak(aTHX_ "panic: input overflow");
2792 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2794 PL_lex_state = LEX_FORMLINE;
2804 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2811 while (s < PL_bufend && SPACE_OR_TAB(*s))
2814 if (strnEQ(s,"=>",2)) {
2815 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2816 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2817 "### Saw unary minus before =>, forcing word '%s'\n", s);
2819 OPERATOR('-'); /* unary minus */
2821 PL_last_uni = PL_oldbufptr;
2823 case 'r': ftst = OP_FTEREAD; break;
2824 case 'w': ftst = OP_FTEWRITE; break;
2825 case 'x': ftst = OP_FTEEXEC; break;
2826 case 'o': ftst = OP_FTEOWNED; break;
2827 case 'R': ftst = OP_FTRREAD; break;
2828 case 'W': ftst = OP_FTRWRITE; break;
2829 case 'X': ftst = OP_FTREXEC; break;
2830 case 'O': ftst = OP_FTROWNED; break;
2831 case 'e': ftst = OP_FTIS; break;
2832 case 'z': ftst = OP_FTZERO; break;
2833 case 's': ftst = OP_FTSIZE; break;
2834 case 'f': ftst = OP_FTFILE; break;
2835 case 'd': ftst = OP_FTDIR; break;
2836 case 'l': ftst = OP_FTLINK; break;
2837 case 'p': ftst = OP_FTPIPE; break;
2838 case 'S': ftst = OP_FTSOCK; break;
2839 case 'u': ftst = OP_FTSUID; break;
2840 case 'g': ftst = OP_FTSGID; break;
2841 case 'k': ftst = OP_FTSVTX; break;
2842 case 'b': ftst = OP_FTBLK; break;
2843 case 'c': ftst = OP_FTCHR; break;
2844 case 't': ftst = OP_FTTTY; break;
2845 case 'T': ftst = OP_FTTEXT; break;
2846 case 'B': ftst = OP_FTBINARY; break;
2847 case 'M': case 'A': case 'C':
2848 gv_fetchpv("\024",TRUE, SVt_PV);
2850 case 'M': ftst = OP_FTMTIME; break;
2851 case 'A': ftst = OP_FTATIME; break;
2852 case 'C': ftst = OP_FTCTIME; break;
2860 PL_last_lop_op = ftst;
2861 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2862 "### Saw file test %c\n", (int)ftst);
2867 /* Assume it was a minus followed by a one-letter named
2868 * subroutine call (or a -bareword), then. */
2869 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2870 "### %c looked like a file test but was not\n",
2879 if (PL_expect == XOPERATOR)
2884 else if (*s == '>') {
2887 if (isIDFIRST_lazy_if(s,UTF)) {
2888 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2896 if (PL_expect == XOPERATOR)
2899 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2901 OPERATOR('-'); /* unary minus */
2908 if (PL_expect == XOPERATOR)
2913 if (PL_expect == XOPERATOR)
2916 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2922 if (PL_expect != XOPERATOR) {
2923 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2924 PL_expect = XOPERATOR;
2925 force_ident(PL_tokenbuf, '*');
2938 if (PL_expect == XOPERATOR) {
2942 PL_tokenbuf[0] = '%';
2943 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2944 if (!PL_tokenbuf[1]) {
2946 yyerror("Final % should be \\% or %name");
2949 PL_pending_ident = '%';
2968 switch (PL_expect) {
2971 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2973 PL_bufptr = s; /* update in case we back off */
2979 PL_expect = XTERMBLOCK;
2983 while (isIDFIRST_lazy_if(s,UTF)) {
2984 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2985 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2986 if (tmp < 0) tmp = -tmp;
3001 d = scan_str(d,TRUE,TRUE);
3003 /* MUST advance bufptr here to avoid bogus
3004 "at end of line" context messages from yyerror().
3006 PL_bufptr = s + len;
3007 yyerror("Unterminated attribute parameter in attribute list");
3010 return 0; /* EOF indicator */
3014 SV *sv = newSVpvn(s, len);
3015 sv_catsv(sv, PL_lex_stuff);
3016 attrs = append_elem(OP_LIST, attrs,
3017 newSVOP(OP_CONST, 0, sv));
3018 SvREFCNT_dec(PL_lex_stuff);
3019 PL_lex_stuff = Nullsv;
3022 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3023 CvLVALUE_on(PL_compcv);
3024 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3025 CvLOCKED_on(PL_compcv);
3026 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3027 CvMETHOD_on(PL_compcv);
3029 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "unique", len))
3030 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3032 /* After we've set the flags, it could be argued that
3033 we don't need to do the attributes.pm-based setting
3034 process, and shouldn't bother appending recognized
3035 flags. To experiment with that, uncomment the
3036 following "else": */
3038 attrs = append_elem(OP_LIST, attrs,
3039 newSVOP(OP_CONST, 0,
3043 if (*s == ':' && s[1] != ':')
3046 break; /* require real whitespace or :'s */
3048 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3049 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3050 char q = ((*s == '\'') ? '"' : '\'');
3051 /* If here for an expression, and parsed no attrs, back off. */
3052 if (tmp == '=' && !attrs) {
3056 /* MUST advance bufptr here to avoid bogus "at end of line"
3057 context messages from yyerror().
3061 yyerror("Unterminated attribute list");
3063 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3071 PL_nextval[PL_nexttoke].opval = attrs;
3079 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3080 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3096 if (PL_lex_brackets <= 0)
3097 yyerror("Unmatched right square bracket");
3100 if (PL_lex_state == LEX_INTERPNORMAL) {
3101 if (PL_lex_brackets == 0) {
3102 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3103 PL_lex_state = LEX_INTERPEND;
3110 if (PL_lex_brackets > 100) {
3111 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3112 if (newlb != PL_lex_brackstack) {
3114 PL_lex_brackstack = newlb;
3117 switch (PL_expect) {
3119 if (PL_lex_formbrack) {
3123 if (PL_oldoldbufptr == PL_last_lop)
3124 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3126 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3127 OPERATOR(HASHBRACK);
3129 while (s < PL_bufend && SPACE_OR_TAB(*s))
3132 PL_tokenbuf[0] = '\0';
3133 if (d < PL_bufend && *d == '-') {
3134 PL_tokenbuf[0] = '-';
3136 while (d < PL_bufend && SPACE_OR_TAB(*d))
3139 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3140 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3142 while (d < PL_bufend && SPACE_OR_TAB(*d))
3145 char minus = (PL_tokenbuf[0] == '-');
3146 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3154 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3159 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3164 if (PL_oldoldbufptr == PL_last_lop)
3165 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3167 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3170 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3172 /* This hack is to get the ${} in the message. */
3174 yyerror("syntax error");
3177 OPERATOR(HASHBRACK);
3179 /* This hack serves to disambiguate a pair of curlies
3180 * as being a block or an anon hash. Normally, expectation
3181 * determines that, but in cases where we're not in a
3182 * position to expect anything in particular (like inside
3183 * eval"") we have to resolve the ambiguity. This code
3184 * covers the case where the first term in the curlies is a
3185 * quoted string. Most other cases need to be explicitly
3186 * disambiguated by prepending a `+' before the opening
3187 * curly in order to force resolution as an anon hash.
3189 * XXX should probably propagate the outer expectation
3190 * into eval"" to rely less on this hack, but that could
3191 * potentially break current behavior of eval"".
3195 if (*s == '\'' || *s == '"' || *s == '`') {
3196 /* common case: get past first string, handling escapes */
3197 for (t++; t < PL_bufend && *t != *s;)
3198 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3202 else if (*s == 'q') {
3205 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3209 char open, close, term;
3212 while (t < PL_bufend && isSPACE(*t))
3216 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3220 for (t++; t < PL_bufend; t++) {
3221 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3223 else if (*t == open)
3227 for (t++; t < PL_bufend; t++) {
3228 if (*t == '\\' && t+1 < PL_bufend)
3230 else if (*t == close && --brackets <= 0)
3232 else if (*t == open)
3238 else if (isALNUM_lazy_if(t,UTF)) {
3240 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3243 while (t < PL_bufend && isSPACE(*t))
3245 /* if comma follows first term, call it an anon hash */
3246 /* XXX it could be a comma expression with loop modifiers */
3247 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3248 || (*t == '=' && t[1] == '>')))
3249 OPERATOR(HASHBRACK);
3250 if (PL_expect == XREF)
3253 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3259 yylval.ival = CopLINE(PL_curcop);
3260 if (isSPACE(*s) || *s == '#')
3261 PL_copline = NOLINE; /* invalidate current command line number */
3266 if (PL_lex_brackets <= 0)
3267 yyerror("Unmatched right curly bracket");
3269 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3270 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3271 PL_lex_formbrack = 0;
3272 if (PL_lex_state == LEX_INTERPNORMAL) {
3273 if (PL_lex_brackets == 0) {
3274 if (PL_expect & XFAKEBRACK) {
3275 PL_expect &= XENUMMASK;
3276 PL_lex_state = LEX_INTERPEND;
3278 return yylex(); /* ignore fake brackets */
3280 if (*s == '-' && s[1] == '>')
3281 PL_lex_state = LEX_INTERPENDMAYBE;
3282 else if (*s != '[' && *s != '{')
3283 PL_lex_state = LEX_INTERPEND;
3286 if (PL_expect & XFAKEBRACK) {
3287 PL_expect &= XENUMMASK;
3289 return yylex(); /* ignore fake brackets */
3299 if (PL_expect == XOPERATOR) {
3300 if (ckWARN(WARN_SEMICOLON)
3301 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3303 CopLINE_dec(PL_curcop);
3304 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3305 CopLINE_inc(PL_curcop);
3310 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3312 PL_expect = XOPERATOR;
3313 force_ident(PL_tokenbuf, '&');
3317 yylval.ival = (OPpENTERSUB_AMPER<<8);
3336 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3337 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3339 if (PL_expect == XSTATE && isALPHA(tmp) &&
3340 (s == PL_linestart+1 || s[-2] == '\n') )
3342 if (PL_in_eval && !PL_rsfp) {
3347 if (strnEQ(s,"=cut",4)) {
3361 PL_doextract = TRUE;
3364 if (PL_lex_brackets < PL_lex_formbrack) {
3366 #ifdef PERL_STRICT_CR
3367 for (t = s; SPACE_OR_TAB(*t); t++) ;
3369 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3371 if (*t == '\n' || *t == '#') {
3389 if (PL_expect != XOPERATOR) {
3390 if (s[1] != '<' && !strchr(s,'>'))
3393 s = scan_heredoc(s);
3395 s = scan_inputsymbol(s);
3396 TERM(sublex_start());
3401 SHop(OP_LEFT_SHIFT);
3415 SHop(OP_RIGHT_SHIFT);
3424 if (PL_expect == XOPERATOR) {
3425 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3428 return ','; /* grandfather non-comma-format format */
3432 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3433 PL_tokenbuf[0] = '@';
3434 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3435 sizeof PL_tokenbuf - 1, FALSE);
3436 if (PL_expect == XOPERATOR)
3437 no_op("Array length", s);
3438 if (!PL_tokenbuf[1])
3440 PL_expect = XOPERATOR;
3441 PL_pending_ident = '#';
3445 PL_tokenbuf[0] = '$';
3446 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3447 sizeof PL_tokenbuf - 1, FALSE);
3448 if (PL_expect == XOPERATOR)
3450 if (!PL_tokenbuf[1]) {
3452 yyerror("Final $ should be \\$ or $name");
3456 /* This kludge not intended to be bulletproof. */
3457 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3458 yylval.opval = newSVOP(OP_CONST, 0,
3459 newSViv(PL_compiling.cop_arybase));
3460 yylval.opval->op_private = OPpCONST_ARYBASE;
3466 if (PL_lex_state == LEX_NORMAL)
3469 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3472 PL_tokenbuf[0] = '@';
3473 if (ckWARN(WARN_SYNTAX)) {
3475 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3478 PL_bufptr = skipspace(PL_bufptr);
3479 while (t < PL_bufend && *t != ']')
3481 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3482 "Multidimensional syntax %.*s not supported",
3483 (t - PL_bufptr) + 1, PL_bufptr);
3487 else if (*s == '{') {
3488 PL_tokenbuf[0] = '%';
3489 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3490 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3492 char tmpbuf[sizeof PL_tokenbuf];
3494 for (t++; isSPACE(*t); t++) ;
3495 if (isIDFIRST_lazy_if(t,UTF)) {
3496 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3497 for (; isSPACE(*t); t++) ;
3498 if (*t == ';' && get_cv(tmpbuf, FALSE))
3499 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3500 "You need to quote \"%s\"", tmpbuf);
3506 PL_expect = XOPERATOR;
3507 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3508 bool islop = (PL_last_lop == PL_oldoldbufptr);
3509 if (!islop || PL_last_lop_op == OP_GREPSTART)
3510 PL_expect = XOPERATOR;
3511 else if (strchr("$@\"'`q", *s))
3512 PL_expect = XTERM; /* e.g. print $fh "foo" */
3513 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3514 PL_expect = XTERM; /* e.g. print $fh &sub */
3515 else if (isIDFIRST_lazy_if(s,UTF)) {
3516 char tmpbuf[sizeof PL_tokenbuf];
3517 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3518 if ((tmp = keyword(tmpbuf, len))) {
3519 /* binary operators exclude handle interpretations */
3531 PL_expect = XTERM; /* e.g. print $fh length() */
3536 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3537 if (gv && GvCVu(gv))
3538 PL_expect = XTERM; /* e.g. print $fh subr() */
3541 else if (isDIGIT(*s))
3542 PL_expect = XTERM; /* e.g. print $fh 3 */
3543 else if (*s == '.' && isDIGIT(s[1]))
3544 PL_expect = XTERM; /* e.g. print $fh .3 */
3545 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3546 PL_expect = XTERM; /* e.g. print $fh -1 */
3547 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3548 PL_expect = XTERM; /* print $fh <<"EOF" */
3550 PL_pending_ident = '$';
3554 if (PL_expect == XOPERATOR)
3556 PL_tokenbuf[0] = '@';
3557 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3558 if (!PL_tokenbuf[1]) {
3560 yyerror("Final @ should be \\@ or @name");
3563 if (PL_lex_state == LEX_NORMAL)
3565 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3567 PL_tokenbuf[0] = '%';
3569 /* Warn about @ where they meant $. */
3570 if (ckWARN(WARN_SYNTAX)) {
3571 if (*s == '[' || *s == '{') {
3573 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3575 if (*t == '}' || *t == ']') {
3577 PL_bufptr = skipspace(PL_bufptr);
3578 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3579 "Scalar value %.*s better written as $%.*s",
3580 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3585 PL_pending_ident = '@';
3588 case '/': /* may either be division or pattern */
3589 case '?': /* may either be conditional or pattern */
3590 if (PL_expect != XOPERATOR) {
3591 /* Disable warning on "study /blah/" */
3592 if (PL_oldoldbufptr == PL_last_uni
3593 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3594 || memNE(PL_last_uni, "study", 5)
3595 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3597 s = scan_pat(s,OP_MATCH);
3598 TERM(sublex_start());
3606 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3607 #ifdef PERL_STRICT_CR
3610 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3612 && (s == PL_linestart || s[-1] == '\n') )
3614 PL_lex_formbrack = 0;
3618 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3624 yylval.ival = OPf_SPECIAL;
3630 if (PL_expect != XOPERATOR)
3635 case '0': case '1': case '2': case '3': case '4':
3636 case '5': case '6': case '7': case '8': case '9':
3637 s = scan_num(s, &yylval);
3638 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3639 "### Saw number in '%s'\n", s);
3641 if (PL_expect == XOPERATOR)
3646 s = scan_str(s,FALSE,FALSE);
3647 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3648 "### Saw string before '%s'\n", s);
3650 if (PL_expect == XOPERATOR) {
3651 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3654 return ','; /* grandfather non-comma-format format */
3660 missingterm((char*)0);
3661 yylval.ival = OP_CONST;
3662 TERM(sublex_start());
3665 s = scan_str(s,FALSE,FALSE);
3666 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3667 "### Saw string before '%s'\n", s);
3669 if (PL_expect == XOPERATOR) {
3670 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3673 return ','; /* grandfather non-comma-format format */
3679 missingterm((char*)0);
3680 yylval.ival = OP_CONST;
3681 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3682 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3683 yylval.ival = OP_STRINGIFY;
3687 TERM(sublex_start());
3690 s = scan_str(s,FALSE,FALSE);
3691 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3692 "### Saw backtick string before '%s'\n", s);
3694 if (PL_expect == XOPERATOR)
3695 no_op("Backticks",s);
3697 missingterm((char*)0);
3698 yylval.ival = OP_BACKTICK;
3700 TERM(sublex_start());
3704 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3705 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3707 if (PL_expect == XOPERATOR)
3708 no_op("Backslash",s);
3712 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3716 while (isDIGIT(*start) || *start == '_')
3718 if (*start == '.' && isDIGIT(start[1])) {
3719 s = scan_num(s, &yylval);
3722 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3723 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3727 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3730 s = scan_num(s, &yylval);
3737 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3776 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3778 /* Some keywords can be followed by any delimiter, including ':' */
3779 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3780 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3781 (PL_tokenbuf[0] == 'q' &&
3782 strchr("qwxr", PL_tokenbuf[1])))));
3784 /* x::* is just a word, unless x is "CORE" */
3785 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3789 while (d < PL_bufend && isSPACE(*d))
3790 d++; /* no comments skipped here, or s### is misparsed */
3792 /* Is this a label? */
3793 if (!tmp && PL_expect == XSTATE
3794 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3796 yylval.pval = savepv(PL_tokenbuf);
3801 /* Check for keywords */
3802 tmp = keyword(PL_tokenbuf, len);
3804 /* Is this a word before a => operator? */
3805 if (*d == '=' && d[1] == '>') {
3807 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3808 yylval.opval->op_private = OPpCONST_BARE;
3809 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3810 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3814 if (tmp < 0) { /* second-class keyword? */
3815 GV *ogv = Nullgv; /* override (winner) */
3816 GV *hgv = Nullgv; /* hidden (loser) */
3817 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3819 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3822 if (GvIMPORTED_CV(gv))
3824 else if (! CvMETHOD(cv))
3828 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3829 (gv = *gvp) != (GV*)&PL_sv_undef &&
3830 GvCVu(gv) && GvIMPORTED_CV(gv))
3836 tmp = 0; /* overridden by import or by GLOBAL */
3839 && -tmp==KEY_lock /* XXX generalizable kludge */
3841 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3843 tmp = 0; /* any sub overrides "weak" keyword */
3845 else { /* no override */
3847 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3848 Perl_warner(aTHX_ packWARN(WARN_MISC),
3849 "dump() better written as CORE::dump()");
3853 if (ckWARN(WARN_AMBIGUOUS) && hgv
3854 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3855 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3856 "Ambiguous call resolved as CORE::%s(), %s",
3857 GvENAME(hgv), "qualify as such or use &");
3864 default: /* not a keyword */
3868 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3870 /* Get the rest if it looks like a package qualifier */
3872 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3874 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3877 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3878 *s == '\'' ? "'" : "::");
3883 if (PL_expect == XOPERATOR) {
3884 if (PL_bufptr == PL_linestart) {
3885 CopLINE_dec(PL_curcop);
3886 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3887 CopLINE_inc(PL_curcop);
3890 no_op("Bareword",s);
3893 /* Look for a subroutine with this name in current package,
3894 unless name is "Foo::", in which case Foo is a bearword
3895 (and a package name). */
3898 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3900 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3901 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3902 "Bareword \"%s\" refers to nonexistent package",
3905 PL_tokenbuf[len] = '\0';
3912 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3915 /* if we saw a global override before, get the right name */
3918 sv = newSVpvn("CORE::GLOBAL::",14);
3919 sv_catpv(sv,PL_tokenbuf);
3922 sv = newSVpv(PL_tokenbuf,0);
3924 /* Presume this is going to be a bareword of some sort. */
3927 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3928 yylval.opval->op_private = OPpCONST_BARE;
3930 /* And if "Foo::", then that's what it certainly is. */
3935 /* See if it's the indirect object for a list operator. */
3937 if (PL_oldoldbufptr &&
3938 PL_oldoldbufptr < PL_bufptr &&
3939 (PL_oldoldbufptr == PL_last_lop
3940 || PL_oldoldbufptr == PL_last_uni) &&
3941 /* NO SKIPSPACE BEFORE HERE! */
3942 (PL_expect == XREF ||
3943 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3945 bool immediate_paren = *s == '(';
3947 /* (Now we can afford to cross potential line boundary.) */
3950 /* Two barewords in a row may indicate method call. */
3952 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3955 /* If not a declared subroutine, it's an indirect object. */
3956 /* (But it's an indir obj regardless for sort.) */
3958 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3959 ((!gv || !GvCVu(gv)) &&
3960 (PL_last_lop_op != OP_MAPSTART &&
3961 PL_last_lop_op != OP_GREPSTART))))
3963 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3968 PL_expect = XOPERATOR;
3971 /* Is this a word before a => operator? */
3972 if (*s == '=' && s[1] == '>' && !pkgname) {
3974 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3975 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3976 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3980 /* If followed by a paren, it's certainly a subroutine. */
3983 if (gv && GvCVu(gv)) {
3984 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3985 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3990 PL_nextval[PL_nexttoke].opval = yylval.opval;
3991 PL_expect = XOPERATOR;
3997 /* If followed by var or block, call it a method (unless sub) */
3999 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4000 PL_last_lop = PL_oldbufptr;
4001 PL_last_lop_op = OP_METHOD;
4005 /* If followed by a bareword, see if it looks like indir obj. */
4007 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4010 /* Not a method, so call it a subroutine (if defined) */
4012 if (gv && GvCVu(gv)) {
4014 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4015 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4016 "Ambiguous use of -%s resolved as -&%s()",
4017 PL_tokenbuf, PL_tokenbuf);
4018 /* Check for a constant sub */
4020 if ((sv = cv_const_sv(cv))) {
4022 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4023 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4024 yylval.opval->op_private = 0;
4028 /* Resolve to GV now. */
4029 op_free(yylval.opval);
4030 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4031 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4032 PL_last_lop = PL_oldbufptr;
4033 PL_last_lop_op = OP_ENTERSUB;
4034 /* Is there a prototype? */
4037 char *proto = SvPV((SV*)cv, len);
4040 if (strEQ(proto, "$"))
4042 if (*proto == '&' && *s == '{') {
4043 sv_setpv(PL_subname, PL_curstash ?
4044 "__ANON__" : "__ANON__::__ANON__");
4048 PL_nextval[PL_nexttoke].opval = yylval.opval;
4054 /* Call it a bare word */
4056 if (PL_hints & HINT_STRICT_SUBS)
4057 yylval.opval->op_private |= OPpCONST_STRICT;
4060 if (ckWARN(WARN_RESERVED)) {
4061 if (lastchar != '-') {
4062 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4063 if (!*d && strNE(PL_tokenbuf,"main"))
4064 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4071 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4072 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4073 "Operator or semicolon missing before %c%s",
4074 lastchar, PL_tokenbuf);
4075 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4076 "Ambiguous use of %c resolved as operator %c",
4077 lastchar, lastchar);
4083 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4084 newSVpv(CopFILE(PL_curcop),0));
4088 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4089 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4092 case KEY___PACKAGE__:
4093 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4095 ? newSVsv(PL_curstname)
4104 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4105 char *pname = "main";
4106 if (PL_tokenbuf[2] == 'D')
4107 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4108 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4111 GvIOp(gv) = newIO();
4112 IoIFP(GvIOp(gv)) = PL_rsfp;
4113 #if defined(HAS_FCNTL) && defined(F_SETFD)
4115 int fd = PerlIO_fileno(PL_rsfp);
4116 fcntl(fd,F_SETFD,fd >= 3);
4119 /* Mark this internal pseudo-handle as clean */
4120 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4122 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4123 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4124 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4126 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4127 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4128 /* if the script was opened in binmode, we need to revert
4129 * it to text mode for compatibility; but only iff it has CRs
4130 * XXX this is a questionable hack at best. */
4131 if (PL_bufend-PL_bufptr > 2
4132 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4135 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4136 loc = PerlIO_tell(PL_rsfp);
4137 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4140 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4142 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4143 #endif /* NETWARE */
4144 #ifdef PERLIO_IS_STDIO /* really? */
4145 # if defined(__BORLANDC__)
4146 /* XXX see note in do_binmode() */
4147 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4151 PerlIO_seek(PL_rsfp, loc, 0);
4155 #ifdef PERLIO_LAYERS
4156 if (UTF && !IN_BYTES)
4157 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4170 if (PL_expect == XSTATE) {
4177 if (*s == ':' && s[1] == ':') {
4180 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4181 if (!(tmp = keyword(PL_tokenbuf, len)))
4182 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4196 LOP(OP_ACCEPT,XTERM);
4202 LOP(OP_ATAN2,XTERM);
4208 LOP(OP_BINMODE,XTERM);
4211 LOP(OP_BLESS,XTERM);
4220 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4237 if (!PL_cryptseen) {
4238 PL_cryptseen = TRUE;
4242 LOP(OP_CRYPT,XTERM);
4245 LOP(OP_CHMOD,XTERM);
4248 LOP(OP_CHOWN,XTERM);
4251 LOP(OP_CONNECT,XTERM);
4267 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4271 PL_hints |= HINT_BLOCK_SCOPE;
4281 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4282 LOP(OP_DBMOPEN,XTERM);
4288 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4295 yylval.ival = CopLINE(PL_curcop);
4309 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4310 UNIBRACK(OP_ENTEREVAL);
4325 case KEY_endhostent:
4331 case KEY_endservent:
4334 case KEY_endprotoent:
4345 yylval.ival = CopLINE(PL_curcop);
4347 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4349 if ((PL_bufend - p) >= 3 &&
4350 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4352 else if ((PL_bufend - p) >= 4 &&
4353 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4356 if (isIDFIRST_lazy_if(p,UTF)) {
4357 p = scan_ident(p, PL_bufend,
4358 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4362 Perl_croak(aTHX_ "Missing $ on loop variable");
4367 LOP(OP_FORMLINE,XTERM);
4373 LOP(OP_FCNTL,XTERM);
4379 LOP(OP_FLOCK,XTERM);
4388 LOP(OP_GREPSTART, XREF);
4391 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4406 case KEY_getpriority:
4407 LOP(OP_GETPRIORITY,XTERM);
4409 case KEY_getprotobyname:
4412 case KEY_getprotobynumber:
4413 LOP(OP_GPBYNUMBER,XTERM);
4415 case KEY_getprotoent:
4427 case KEY_getpeername:
4428 UNI(OP_GETPEERNAME);
4430 case KEY_gethostbyname:
4433 case KEY_gethostbyaddr:
4434 LOP(OP_GHBYADDR,XTERM);
4436 case KEY_gethostent:
4439 case KEY_getnetbyname:
4442 case KEY_getnetbyaddr:
4443 LOP(OP_GNBYADDR,XTERM);
4448 case KEY_getservbyname:
4449 LOP(OP_GSBYNAME,XTERM);
4451 case KEY_getservbyport:
4452 LOP(OP_GSBYPORT,XTERM);
4454 case KEY_getservent:
4457 case KEY_getsockname:
4458 UNI(OP_GETSOCKNAME);
4460 case KEY_getsockopt:
4461 LOP(OP_GSOCKOPT,XTERM);
4483 yylval.ival = CopLINE(PL_curcop);
4487 LOP(OP_INDEX,XTERM);
4493 LOP(OP_IOCTL,XTERM);
4505 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4537 LOP(OP_LISTEN,XTERM);
4546 s = scan_pat(s,OP_MATCH);
4547 TERM(sublex_start());
4550 LOP(OP_MAPSTART, XREF);
4553 LOP(OP_MKDIR,XTERM);
4556 LOP(OP_MSGCTL,XTERM);
4559 LOP(OP_MSGGET,XTERM);
4562 LOP(OP_MSGRCV,XTERM);
4565 LOP(OP_MSGSND,XTERM);
4571 if (isIDFIRST_lazy_if(s,UTF)) {
4572 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4573 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4575 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4576 if (!PL_in_my_stash) {
4579 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4587 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4594 if (PL_expect != XSTATE)
4595 yyerror("\"no\" not allowed in expression");
4596 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4597 s = force_version(s, FALSE);
4602 if (*s == '(' || (s = skipspace(s), *s == '('))
4609 if (isIDFIRST_lazy_if(s,UTF)) {
4611 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4613 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4614 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4615 "Precedence problem: open %.*s should be open(%.*s)",
4621 yylval.ival = OP_OR;
4631 LOP(OP_OPEN_DIR,XTERM);
4634 checkcomma(s,PL_tokenbuf,"filehandle");
4638 checkcomma(s,PL_tokenbuf,"filehandle");
4657 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4661 LOP(OP_PIPE_OP,XTERM);
4664 s = scan_str(s,FALSE,FALSE);
4666 missingterm((char*)0);
4667 yylval.ival = OP_CONST;
4668 TERM(sublex_start());
4674 s = scan_str(s,FALSE,FALSE);
4676 missingterm((char*)0);
4678 if (SvCUR(PL_lex_stuff)) {
4681 d = SvPV_force(PL_lex_stuff, len);
4684 for (; isSPACE(*d) && len; --len, ++d) ;
4687 if (!warned && ckWARN(WARN_QW)) {
4688 for (; !isSPACE(*d) && len; --len, ++d) {
4690 Perl_warner(aTHX_ packWARN(WARN_QW),
4691 "Possible attempt to separate words with commas");
4694 else if (*d == '#') {
4695 Perl_warner(aTHX_ packWARN(WARN_QW),
4696 "Possible attempt to put comments in qw() list");
4702 for (; !isSPACE(*d) && len; --len, ++d) ;
4704 sv = newSVpvn(b, d-b);
4705 if (DO_UTF8(PL_lex_stuff))
4707 words = append_elem(OP_LIST, words,
4708 newSVOP(OP_CONST, 0, tokeq(sv)));
4712 PL_nextval[PL_nexttoke].opval = words;
4717 SvREFCNT_dec(PL_lex_stuff);
4718 PL_lex_stuff = Nullsv;
4724 s = scan_str(s,FALSE,FALSE);
4726 missingterm((char*)0);
4727 yylval.ival = OP_STRINGIFY;
4728 if (SvIVX(PL_lex_stuff) == '\'')
4729 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4730 TERM(sublex_start());
4733 s = scan_pat(s,OP_QR);
4734 TERM(sublex_start());
4737 s = scan_str(s,FALSE,FALSE);
4739 missingterm((char*)0);
4740 yylval.ival = OP_BACKTICK;
4742 TERM(sublex_start());
4750 s = force_version(s, FALSE);
4752 else if (*s != 'v' || !isDIGIT(s[1])
4753 || (s = force_version(s, TRUE), *s == 'v'))
4755 *PL_tokenbuf = '\0';
4756 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4757 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4758 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4760 yyerror("<> should be quotes");
4768 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4772 LOP(OP_RENAME,XTERM);
4781 LOP(OP_RINDEX,XTERM);
4804 LOP(OP_REVERSE,XTERM);
4815 TERM(sublex_start());
4817 TOKEN(1); /* force error */
4826 LOP(OP_SELECT,XTERM);
4832 LOP(OP_SEMCTL,XTERM);
4835 LOP(OP_SEMGET,XTERM);
4838 LOP(OP_SEMOP,XTERM);
4844 LOP(OP_SETPGRP,XTERM);
4846 case KEY_setpriority:
4847 LOP(OP_SETPRIORITY,XTERM);
4849 case KEY_sethostent:
4855 case KEY_setservent:
4858 case KEY_setprotoent:
4868 LOP(OP_SEEKDIR,XTERM);
4870 case KEY_setsockopt:
4871 LOP(OP_SSOCKOPT,XTERM);
4877 LOP(OP_SHMCTL,XTERM);
4880 LOP(OP_SHMGET,XTERM);
4883 LOP(OP_SHMREAD,XTERM);
4886 LOP(OP_SHMWRITE,XTERM);
4889 LOP(OP_SHUTDOWN,XTERM);
4898 LOP(OP_SOCKET,XTERM);
4900 case KEY_socketpair:
4901 LOP(OP_SOCKPAIR,XTERM);
4904 checkcomma(s,PL_tokenbuf,"subroutine name");
4906 if (*s == ';' || *s == ')') /* probably a close */
4907 Perl_croak(aTHX_ "sort is now a reserved word");
4909 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4913 LOP(OP_SPLIT,XTERM);
4916 LOP(OP_SPRINTF,XTERM);
4919 LOP(OP_SPLICE,XTERM);
4934 LOP(OP_SUBSTR,XTERM);
4940 char tmpbuf[sizeof PL_tokenbuf];
4941 SSize_t tboffset = 0;
4942 expectation attrful;
4943 bool have_name, have_proto, bad_proto;
4948 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4949 (*s == ':' && s[1] == ':'))
4952 attrful = XATTRBLOCK;
4953 /* remember buffer pos'n for later force_word */
4954 tboffset = s - PL_oldbufptr;
4955 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4956 if (strchr(tmpbuf, ':'))
4957 sv_setpv(PL_subname, tmpbuf);
4959 sv_setsv(PL_subname,PL_curstname);
4960 sv_catpvn(PL_subname,"::",2);
4961 sv_catpvn(PL_subname,tmpbuf,len);
4968 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4969 PL_expect = XTERMBLOCK;
4970 attrful = XATTRTERM;
4971 sv_setpv(PL_subname,"?");
4975 if (key == KEY_format) {
4977 PL_lex_formbrack = PL_lex_brackets + 1;
4979 (void) force_word(PL_oldbufptr + tboffset, WORD,
4984 /* Look for a prototype */
4988 s = scan_str(s,FALSE,FALSE);
4990 Perl_croak(aTHX_ "Prototype not terminated");
4991 /* strip spaces and check for bad characters */
4992 d = SvPVX(PL_lex_stuff);
4995 for (p = d; *p; ++p) {
4998 if (!strchr("$@%*;[]&\\", *p))
5003 if (bad_proto && ckWARN(WARN_SYNTAX))
5004 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5005 "Illegal character in prototype for %s : %s",
5006 SvPVX(PL_subname), d);
5007 SvCUR(PL_lex_stuff) = tmp;
5015 if (*s == ':' && s[1] != ':')
5016 PL_expect = attrful;
5019 PL_nextval[PL_nexttoke].opval =
5020 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5021 PL_lex_stuff = Nullsv;
5025 sv_setpv(PL_subname,
5026 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5029 (void) force_word(PL_oldbufptr + tboffset, WORD,
5038 LOP(OP_SYSTEM,XREF);
5041 LOP(OP_SYMLINK,XTERM);
5044 LOP(OP_SYSCALL,XTERM);
5047 LOP(OP_SYSOPEN,XTERM);
5050 LOP(OP_SYSSEEK,XTERM);
5053 LOP(OP_SYSREAD,XTERM);
5056 LOP(OP_SYSWRITE,XTERM);
5060 TERM(sublex_start());
5081 LOP(OP_TRUNCATE,XTERM);
5093 yylval.ival = CopLINE(PL_curcop);
5097 yylval.ival = CopLINE(PL_curcop);
5101 LOP(OP_UNLINK,XTERM);
5107 LOP(OP_UNPACK,XTERM);
5110 LOP(OP_UTIME,XTERM);
5116 LOP(OP_UNSHIFT,XTERM);
5119 if (PL_expect != XSTATE)
5120 yyerror("\"use\" not allowed in expression");
5122 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5123 s = force_version(s, TRUE);
5124 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5125 PL_nextval[PL_nexttoke].opval = Nullop;
5128 else if (*s == 'v') {
5129 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5130 s = force_version(s, FALSE);
5134 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5135 s = force_version(s, FALSE);
5147 yylval.ival = CopLINE(PL_curcop);
5151 PL_hints |= HINT_BLOCK_SCOPE;
5158 LOP(OP_WAITPID,XTERM);
5167 ctl_l[0] = toCTRL('L');
5169 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5172 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5177 if (PL_expect == XOPERATOR)
5183 yylval.ival = OP_XOR;
5188 TERM(sublex_start());
5193 #pragma segment Main
5197 S_pending_ident(pTHX)
5201 /* pit holds the identifier we read and pending_ident is reset */
5202 char pit = PL_pending_ident;
5203 PL_pending_ident = 0;
5205 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5206 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5208 /* if we're in a my(), we can't allow dynamics here.
5209 $foo'bar has already been turned into $foo::bar, so
5210 just check for colons.
5212 if it's a legal name, the OP is a PADANY.
5215 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5216 if (strchr(PL_tokenbuf,':'))
5217 yyerror(Perl_form(aTHX_ "No package name allowed for "
5218 "variable %s in \"our\"",
5220 tmp = pad_allocmy(PL_tokenbuf);
5223 if (strchr(PL_tokenbuf,':'))
5224 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5226 yylval.opval = newOP(OP_PADANY, 0);
5227 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5233 build the ops for accesses to a my() variable.
5235 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5236 then used in a comparison. This catches most, but not
5237 all cases. For instance, it catches
5238 sort { my($a); $a <=> $b }
5240 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5241 (although why you'd do that is anyone's guess).
5244 if (!strchr(PL_tokenbuf,':')) {
5245 #ifdef USE_5005THREADS
5246 /* Check for single character per-thread SVs */
5247 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5248 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5249 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5251 yylval.opval = newOP(OP_THREADSV, 0);
5252 yylval.opval->op_targ = tmp;
5255 #endif /* USE_5005THREADS */
5256 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5257 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5258 /* might be an "our" variable" */
5259 if (SvFLAGS(namesv) & SVpad_OUR) {
5260 /* build ops for a bareword */
5261 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5262 sv_catpvn(sym, "::", 2);
5263 sv_catpv(sym, PL_tokenbuf+1);
5264 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5265 yylval.opval->op_private = OPpCONST_ENTERED;
5266 gv_fetchpv(SvPVX(sym),
5268 ? (GV_ADDMULTI | GV_ADDINEVAL)
5271 ((PL_tokenbuf[0] == '$') ? SVt_PV
5272 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5277 /* if it's a sort block and they're naming $a or $b */
5278 if (PL_last_lop_op == OP_SORT &&
5279 PL_tokenbuf[0] == '$' &&
5280 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5283 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5284 d < PL_bufend && *d != '\n';
5287 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5288 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5294 yylval.opval = newOP(OP_PADANY, 0);
5295 yylval.opval->op_targ = tmp;
5301 Whine if they've said @foo in a doublequoted string,
5302 and @foo isn't a variable we can find in the symbol
5305 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5306 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5307 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5308 && ckWARN(WARN_AMBIGUOUS))
5310 /* Downgraded from fatal to warning 20000522 mjd */
5311 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5312 "Possible unintended interpolation of %s in string",
5317 /* build ops for a bareword */
5318 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5319 yylval.opval->op_private = OPpCONST_ENTERED;
5320 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5321 ((PL_tokenbuf[0] == '$') ? SVt_PV
5322 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5328 Perl_keyword(pTHX_ register char *d, I32 len)
5333 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5334 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5335 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5336 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5337 if (strEQ(d,"__END__")) return KEY___END__;
5341 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5346 if (strEQ(d,"and")) return -KEY_and;
5347 if (strEQ(d,"abs")) return -KEY_abs;
5350 if (strEQ(d,"alarm")) return -KEY_alarm;
5351 if (strEQ(d,"atan2")) return -KEY_atan2;
5354 if (strEQ(d,"accept")) return -KEY_accept;
5359 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5362 if (strEQ(d,"bless")) return -KEY_bless;
5363 if (strEQ(d,"bind")) return -KEY_bind;
5364 if (strEQ(d,"binmode")) return -KEY_binmode;
5367 if (strEQ(d,"CORE")) return -KEY_CORE;
5368 if (strEQ(d,"CHECK")) return KEY_CHECK;
5373 if (strEQ(d,"cmp")) return -KEY_cmp;
5374 if (strEQ(d,"chr")) return -KEY_chr;
5375 if (strEQ(d,"cos")) return -KEY_cos;
5378 if (strEQ(d,"chop")) return -KEY_chop;
5381 if (strEQ(d,"close")) return -KEY_close;
5382 if (strEQ(d,"chdir")) return -KEY_chdir;
5383 if (strEQ(d,"chomp")) return -KEY_chomp;
5384 if (strEQ(d,"chmod")) return -KEY_chmod;
5385 if (strEQ(d,"chown")) return -KEY_chown;
5386 if (strEQ(d,"crypt")) return -KEY_crypt;
5389 if (strEQ(d,"chroot")) return -KEY_chroot;
5390 if (strEQ(d,"caller")) return -KEY_caller;
5393 if (strEQ(d,"connect")) return -KEY_connect;
5396 if (strEQ(d,"closedir")) return -KEY_closedir;
5397 if (strEQ(d,"continue")) return -KEY_continue;
5402 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5407 if (strEQ(d,"do")) return KEY_do;
5410 if (strEQ(d,"die")) return -KEY_die;
5413 if (strEQ(d,"dump")) return -KEY_dump;
5416 if (strEQ(d,"delete")) return KEY_delete;
5419 if (strEQ(d,"defined")) return KEY_defined;
5420 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5423 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5428 if (strEQ(d,"END")) return KEY_END;
5433 if (strEQ(d,"eq")) return -KEY_eq;
5436 if (strEQ(d,"eof")) return -KEY_eof;
5437 if (strEQ(d,"exp")) return -KEY_exp;
5440 if (strEQ(d,"else")) return KEY_else;
5441 if (strEQ(d,"exit")) return -KEY_exit;
5442 if (strEQ(d,"eval")) return KEY_eval;
5443 if (strEQ(d,"exec")) return -KEY_exec;
5444 if (strEQ(d,"each")) return -KEY_each;
5447 if (strEQ(d,"elsif")) return KEY_elsif;
5450 if (strEQ(d,"exists")) return KEY_exists;
5451 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5454 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5455 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5458 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5461 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5462 if (strEQ(d,"endservent")) return -KEY_endservent;
5465 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5472 if (strEQ(d,"for")) return KEY_for;
5475 if (strEQ(d,"fork")) return -KEY_fork;
5478 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5479 if (strEQ(d,"flock")) return -KEY_flock;
5482 if (strEQ(d,"format")) return KEY_format;
5483 if (strEQ(d,"fileno")) return -KEY_fileno;
5486 if (strEQ(d,"foreach")) return KEY_foreach;
5489 if (strEQ(d,"formline")) return -KEY_formline;
5494 if (strnEQ(d,"get",3)) {
5499 if (strEQ(d,"ppid")) return -KEY_getppid;
5500 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5503 if (strEQ(d,"pwent")) return -KEY_getpwent;
5504 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5505 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5508 if (strEQ(d,"peername")) return -KEY_getpeername;
5509 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5510 if (strEQ(d,"priority")) return -KEY_getpriority;
5513 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5516 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5520 else if (*d == 'h') {
5521 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5522 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5523 if (strEQ(d,"hostent")) return -KEY_gethostent;
5525 else if (*d == 'n') {
5526 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5527 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5528 if (strEQ(d,"netent")) return -KEY_getnetent;
5530 else if (*d == 's') {
5531 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5532 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5533 if (strEQ(d,"servent")) return -KEY_getservent;
5534 if (strEQ(d,"sockname")) return -KEY_getsockname;
5535 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5537 else if (*d == 'g') {
5538 if (strEQ(d,"grent")) return -KEY_getgrent;
5539 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5540 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5542 else if (*d == 'l') {
5543 if (strEQ(d,"login")) return -KEY_getlogin;
5545 else if (strEQ(d,"c")) return -KEY_getc;
5550 if (strEQ(d,"gt")) return -KEY_gt;
5551 if (strEQ(d,"ge")) return -KEY_ge;
5554 if (strEQ(d,"grep")) return KEY_grep;
5555 if (strEQ(d,"goto")) return KEY_goto;
5556 if (strEQ(d,"glob")) return KEY_glob;
5559 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5564 if (strEQ(d,"hex")) return -KEY_hex;
5567 if (strEQ(d,"INIT")) return KEY_INIT;
5572 if (strEQ(d,"if")) return KEY_if;
5575 if (strEQ(d,"int")) return -KEY_int;
5578 if (strEQ(d,"index")) return -KEY_index;
5579 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5584 if (strEQ(d,"join")) return -KEY_join;
5588 if (strEQ(d,"keys")) return -KEY_keys;
5589 if (strEQ(d,"kill")) return -KEY_kill;
5595 if (strEQ(d,"lt")) return -KEY_lt;
5596 if (strEQ(d,"le")) return -KEY_le;
5597 if (strEQ(d,"lc")) return -KEY_lc;
5600 if (strEQ(d,"log")) return -KEY_log;
5603 if (strEQ(d,"last")) return KEY_last;
5604 if (strEQ(d,"link")) return -KEY_link;
5605 if (strEQ(d,"lock")) return -KEY_lock;
5608 if (strEQ(d,"local")) return KEY_local;
5609 if (strEQ(d,"lstat")) return -KEY_lstat;
5612 if (strEQ(d,"length")) return -KEY_length;
5613 if (strEQ(d,"listen")) return -KEY_listen;
5616 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5619 if (strEQ(d,"localtime")) return -KEY_localtime;
5625 case 1: return KEY_m;
5627 if (strEQ(d,"my")) return KEY_my;
5630 if (strEQ(d,"map")) return KEY_map;
5633 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5636 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5637 if (strEQ(d,"msgget")) return -KEY_msgget;
5638 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5639 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5644 if (strEQ(d,"next")) return KEY_next;
5645 if (strEQ(d,"ne")) return -KEY_ne;
5646 if (strEQ(d,"not")) return -KEY_not;
5647 if (strEQ(d,"no")) return KEY_no;
5652 if (strEQ(d,"or")) return -KEY_or;
5655 if (strEQ(d,"ord")) return -KEY_ord;
5656 if (strEQ(d,"oct")) return -KEY_oct;
5657 if (strEQ(d,"our")) return KEY_our;
5660 if (strEQ(d,"open")) return -KEY_open;
5663 if (strEQ(d,"opendir")) return -KEY_opendir;
5670 if (strEQ(d,"pop")) return -KEY_pop;
5671 if (strEQ(d,"pos")) return KEY_pos;
5674 if (strEQ(d,"push")) return -KEY_push;
5675 if (strEQ(d,"pack")) return -KEY_pack;
5676 if (strEQ(d,"pipe")) return -KEY_pipe;
5679 if (strEQ(d,"print")) return KEY_print;
5682 if (strEQ(d,"printf")) return KEY_printf;
5685 if (strEQ(d,"package")) return KEY_package;
5688 if (strEQ(d,"prototype")) return KEY_prototype;
5693 if (strEQ(d,"q")) return KEY_q;
5694 if (strEQ(d,"qr")) return KEY_qr;
5695 if (strEQ(d,"qq")) return KEY_qq;
5696 if (strEQ(d,"qw")) return KEY_qw;
5697 if (strEQ(d,"qx")) return KEY_qx;
5699 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5704 if (strEQ(d,"ref")) return -KEY_ref;
5707 if (strEQ(d,"read")) return -KEY_read;
5708 if (strEQ(d,"rand")) return -KEY_rand;
5709 if (strEQ(d,"recv")) return -KEY_recv;
5710 if (strEQ(d,"redo")) return KEY_redo;
5713 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5714 if (strEQ(d,"reset")) return -KEY_reset;
5717 if (strEQ(d,"return")) return KEY_return;
5718 if (strEQ(d,"rename")) return -KEY_rename;
5719 if (strEQ(d,"rindex")) return -KEY_rindex;
5722 if (strEQ(d,"require")) return KEY_require;
5723 if (strEQ(d,"reverse")) return -KEY_reverse;
5724 if (strEQ(d,"readdir")) return -KEY_readdir;
5727 if (strEQ(d,"readlink")) return -KEY_readlink;
5728 if (strEQ(d,"readline")) return -KEY_readline;
5729 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5732 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5738 case 0: return KEY_s;
5740 if (strEQ(d,"scalar")) return KEY_scalar;
5745 if (strEQ(d,"seek")) return -KEY_seek;
5746 if (strEQ(d,"send")) return -KEY_send;
5749 if (strEQ(d,"semop")) return -KEY_semop;
5752 if (strEQ(d,"select")) return -KEY_select;
5753 if (strEQ(d,"semctl")) return -KEY_semctl;
5754 if (strEQ(d,"semget")) return -KEY_semget;
5757 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5758 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5761 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5762 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5765 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5768 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5769 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5770 if (strEQ(d,"setservent")) return -KEY_setservent;
5773 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5774 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5781 if (strEQ(d,"shift")) return -KEY_shift;
5784 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5785 if (strEQ(d,"shmget")) return -KEY_shmget;
5788 if (strEQ(d,"shmread")) return -KEY_shmread;
5791 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5792 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5797 if (strEQ(d,"sin")) return -KEY_sin;
5800 if (strEQ(d,"sleep")) return -KEY_sleep;
5803 if (strEQ(d,"sort")) return KEY_sort;
5804 if (strEQ(d,"socket")) return -KEY_socket;
5805 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5808 if (strEQ(d,"split")) return KEY_split;
5809 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5810 if (strEQ(d,"splice")) return -KEY_splice;
5813 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5816 if (strEQ(d,"srand")) return -KEY_srand;
5819 if (strEQ(d,"stat")) return -KEY_stat;
5820 if (strEQ(d,"study")) return KEY_study;
5823 if (strEQ(d,"substr")) return -KEY_substr;
5824 if (strEQ(d,"sub")) return KEY_sub;
5829 if (strEQ(d,"system")) return -KEY_system;
5832 if (strEQ(d,"symlink")) return -KEY_symlink;
5833 if (strEQ(d,"syscall")) return -KEY_syscall;
5834 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5835 if (strEQ(d,"sysread")) return -KEY_sysread;
5836 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5839 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5848 if (strEQ(d,"tr")) return KEY_tr;
5851 if (strEQ(d,"tie")) return KEY_tie;
5854 if (strEQ(d,"tell")) return -KEY_tell;
5855 if (strEQ(d,"tied")) return KEY_tied;
5856 if (strEQ(d,"time")) return -KEY_time;
5859 if (strEQ(d,"times")) return -KEY_times;
5862 if (strEQ(d,"telldir")) return -KEY_telldir;
5865 if (strEQ(d,"truncate")) return -KEY_truncate;
5872 if (strEQ(d,"uc")) return -KEY_uc;
5875 if (strEQ(d,"use")) return KEY_use;
5878 if (strEQ(d,"undef")) return KEY_undef;
5879 if (strEQ(d,"until")) return KEY_until;
5880 if (strEQ(d,"untie")) return KEY_untie;
5881 if (strEQ(d,"utime")) return -KEY_utime;
5882 if (strEQ(d,"umask")) return -KEY_umask;
5885 if (strEQ(d,"unless")) return KEY_unless;
5886 if (strEQ(d,"unpack")) return -KEY_unpack;
5887 if (strEQ(d,"unlink")) return -KEY_unlink;
5890 if (strEQ(d,"unshift")) return -KEY_unshift;
5891 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5896 if (strEQ(d,"values")) return -KEY_values;
5897 if (strEQ(d,"vec")) return -KEY_vec;
5902 if (strEQ(d,"warn")) return -KEY_warn;
5903 if (strEQ(d,"wait")) return -KEY_wait;
5906 if (strEQ(d,"while")) return KEY_while;
5907 if (strEQ(d,"write")) return -KEY_write;
5910 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5913 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5918 if (len == 1) return -KEY_x;
5919 if (strEQ(d,"xor")) return -KEY_xor;
5922 if (len == 1) return KEY_y;
5931 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5935 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5936 if (ckWARN(WARN_SYNTAX)) {
5938 for (w = s+2; *w && level; w++) {
5945 for (; *w && isSPACE(*w); w++) ;
5946 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5947 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5948 "%s (...) interpreted as function",name);
5951 while (s < PL_bufend && isSPACE(*s))
5955 while (s < PL_bufend && isSPACE(*s))
5957 if (isIDFIRST_lazy_if(s,UTF)) {
5959 while (isALNUM_lazy_if(s,UTF))
5961 while (s < PL_bufend && isSPACE(*s))
5966 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5970 Perl_croak(aTHX_ "No comma allowed after %s", what);
5975 /* Either returns sv, or mortalizes sv and returns a new SV*.
5976 Best used as sv=new_constant(..., sv, ...).
5977 If s, pv are NULL, calls subroutine with one argument,
5978 and type is used with error messages only. */
5981 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5985 HV *table = GvHV(PL_hintgv); /* ^H */
5989 const char *why1, *why2, *why3;
5991 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5994 why2 = strEQ(key,"charnames")
5995 ? "(possibly a missing \"use charnames ...\")"
5997 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5998 (type ? type: "undef"), why2);
6000 /* This is convoluted and evil ("goto considered harmful")
6001 * but I do not understand the intricacies of all the different
6002 * failure modes of %^H in here. The goal here is to make
6003 * the most probable error message user-friendly. --jhi */
6008 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6009 (type ? type: "undef"), why1, why2, why3);
6011 yyerror(SvPVX(msg));
6015 cvp = hv_fetch(table, key, strlen(key), FALSE);
6016 if (!cvp || !SvOK(*cvp)) {
6019 why3 = "} is not defined";
6022 sv_2mortal(sv); /* Parent created it permanently */
6025 pv = sv_2mortal(newSVpvn(s, len));
6027 typesv = sv_2mortal(newSVpv(type, 0));
6029 typesv = &PL_sv_undef;
6031 PUSHSTACKi(PERLSI_OVERLOAD);
6043 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6047 /* Check the eval first */
6048 if (!PL_in_eval && SvTRUE(ERRSV)) {
6050 sv_catpv(ERRSV, "Propagated");
6051 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6053 res = SvREFCNT_inc(sv);
6057 (void)SvREFCNT_inc(res);
6066 why1 = "Call to &{$^H{";
6068 why3 = "}} did not return a defined value";
6077 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6079 register char *d = dest;
6080 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6083 Perl_croak(aTHX_ ident_too_long);
6084 if (isALNUM(*s)) /* UTF handled below */
6086 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6091 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6095 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6096 char *t = s + UTF8SKIP(s);
6097 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6099 if (d + (t - s) > e)
6100 Perl_croak(aTHX_ ident_too_long);
6101 Copy(s, d, t - s, char);
6114 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6124 e = d + destlen - 3; /* two-character token, ending NUL */
6126 while (isDIGIT(*s)) {
6128 Perl_croak(aTHX_ ident_too_long);
6135 Perl_croak(aTHX_ ident_too_long);
6136 if (isALNUM(*s)) /* UTF handled below */
6138 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6143 else if (*s == ':' && s[1] == ':') {
6147 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6148 char *t = s + UTF8SKIP(s);
6149 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6151 if (d + (t - s) > e)
6152 Perl_croak(aTHX_ ident_too_long);
6153 Copy(s, d, t - s, char);
6164 if (PL_lex_state != LEX_NORMAL)
6165 PL_lex_state = LEX_INTERPENDMAYBE;
6168 if (*s == '$' && s[1] &&
6169 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6182 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6187 if (isSPACE(s[-1])) {
6190 if (!SPACE_OR_TAB(ch)) {
6196 if (isIDFIRST_lazy_if(d,UTF)) {
6200 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6202 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6205 Copy(s, d, e - s, char);
6210 while ((isALNUM(*s) || *s == ':') && d < e)
6213 Perl_croak(aTHX_ ident_too_long);
6216 while (s < send && SPACE_OR_TAB(*s)) s++;
6217 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6218 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6219 const char *brack = *s == '[' ? "[...]" : "{...}";
6220 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6221 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6222 funny, dest, brack, funny, dest, brack);
6225 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6229 /* Handle extended ${^Foo} variables
6230 * 1999-02-27 mjd-perl-patch@plover.com */
6231 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6235 while (isALNUM(*s) && d < e) {
6239 Perl_croak(aTHX_ ident_too_long);
6244 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6245 PL_lex_state = LEX_INTERPEND;
6248 if (PL_lex_state == LEX_NORMAL) {
6249 if (ckWARN(WARN_AMBIGUOUS) &&
6250 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6252 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6253 "Ambiguous use of %c{%s} resolved to %c%s",
6254 funny, dest, funny, dest);
6259 s = bracket; /* let the parser handle it */
6263 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6264 PL_lex_state = LEX_INTERPEND;
6269 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6274 *pmfl |= PMf_GLOBAL;
6276 *pmfl |= PMf_CONTINUE;
6280 *pmfl |= PMf_MULTILINE;
6282 *pmfl |= PMf_SINGLELINE;
6284 *pmfl |= PMf_EXTENDED;
6288 S_scan_pat(pTHX_ char *start, I32 type)
6293 s = scan_str(start,FALSE,FALSE);
6295 Perl_croak(aTHX_ "Search pattern not terminated");
6297 pm = (PMOP*)newPMOP(type, 0);
6298 if (PL_multi_open == '?')
6299 pm->op_pmflags |= PMf_ONCE;
6301 while (*s && strchr("iomsx", *s))
6302 pmflag(&pm->op_pmflags,*s++);
6305 while (*s && strchr("iogcmsx", *s))
6306 pmflag(&pm->op_pmflags,*s++);
6308 pm->op_pmpermflags = pm->op_pmflags;
6310 PL_lex_op = (OP*)pm;
6311 yylval.ival = OP_MATCH;
6316 S_scan_subst(pTHX_ char *start)
6323 yylval.ival = OP_NULL;
6325 s = scan_str(start,FALSE,FALSE);
6328 Perl_croak(aTHX_ "Substitution pattern not terminated");
6330 if (s[-1] == PL_multi_open)
6333 first_start = PL_multi_start;
6334 s = scan_str(s,FALSE,FALSE);
6337 SvREFCNT_dec(PL_lex_stuff);
6338 PL_lex_stuff = Nullsv;
6340 Perl_croak(aTHX_ "Substitution replacement not terminated");
6342 PL_multi_start = first_start; /* so whole substitution is taken together */
6344 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6350 else if (strchr("iogcmsx", *s))
6351 pmflag(&pm->op_pmflags,*s++);
6358 PL_sublex_info.super_bufptr = s;
6359 PL_sublex_info.super_bufend = PL_bufend;
6361 pm->op_pmflags |= PMf_EVAL;
6362 repl = newSVpvn("",0);
6364 sv_catpv(repl, es ? "eval " : "do ");
6365 sv_catpvn(repl, "{ ", 2);
6366 sv_catsv(repl, PL_lex_repl);
6367 sv_catpvn(repl, " };", 2);
6369 SvREFCNT_dec(PL_lex_repl);
6373 pm->op_pmpermflags = pm->op_pmflags;
6374 PL_lex_op = (OP*)pm;
6375 yylval.ival = OP_SUBST;
6380 S_scan_trans(pTHX_ char *start)
6389 yylval.ival = OP_NULL;
6391 s = scan_str(start,FALSE,FALSE);
6393 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6394 if (s[-1] == PL_multi_open)
6397 s = scan_str(s,FALSE,FALSE);
6400 SvREFCNT_dec(PL_lex_stuff);
6401 PL_lex_stuff = Nullsv;
6403 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6406 complement = del = squash = 0;
6407 while (strchr("cds", *s)) {
6409 complement = OPpTRANS_COMPLEMENT;
6411 del = OPpTRANS_DELETE;
6413 squash = OPpTRANS_SQUASH;
6417 New(803, tbl, complement&&!del?258:256, short);
6418 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6419 o->op_private = del|squash|complement|
6420 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6421 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6424 yylval.ival = OP_TRANS;
6429 S_scan_heredoc(pTHX_ register char *s)
6432 I32 op_type = OP_SCALAR;
6439 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6443 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6446 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6447 if (*peek && strchr("`'\"",*peek)) {
6450 s = delimcpy(d, e, s, PL_bufend, term, &len);
6460 if (!isALNUM_lazy_if(s,UTF))
6461 deprecate_old("bare << to mean <<\"\"");
6462 for (; isALNUM_lazy_if(s,UTF); s++) {
6467 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6468 Perl_croak(aTHX_ "Delimiter for here document is too long");
6471 len = d - PL_tokenbuf;
6472 #ifndef PERL_STRICT_CR
6473 d = strchr(s, '\r');
6477 while (s < PL_bufend) {
6483 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6492 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6497 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6498 herewas = newSVpvn(s,PL_bufend-s);
6500 s--, herewas = newSVpvn(s,d-s);
6501 s += SvCUR(herewas);
6503 tmpstr = NEWSV(87,79);
6504 sv_upgrade(tmpstr, SVt_PVIV);
6509 else if (term == '`') {
6510 op_type = OP_BACKTICK;
6511 SvIVX(tmpstr) = '\\';
6515 PL_multi_start = CopLINE(PL_curcop);
6516 PL_multi_open = PL_multi_close = '<';
6517 term = *PL_tokenbuf;
6518 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6519 char *bufptr = PL_sublex_info.super_bufptr;
6520 char *bufend = PL_sublex_info.super_bufend;
6521 char *olds = s - SvCUR(herewas);
6522 s = strchr(bufptr, '\n');
6526 while (s < bufend &&
6527 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6529 CopLINE_inc(PL_curcop);
6532 CopLINE_set(PL_curcop, PL_multi_start);
6533 missingterm(PL_tokenbuf);
6535 sv_setpvn(herewas,bufptr,d-bufptr+1);
6536 sv_setpvn(tmpstr,d+1,s-d);
6538 sv_catpvn(herewas,s,bufend-s);
6539 (void)strcpy(bufptr,SvPVX(herewas));
6546 while (s < PL_bufend &&
6547 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6549 CopLINE_inc(PL_curcop);
6551 if (s >= PL_bufend) {
6552 CopLINE_set(PL_curcop, PL_multi_start);
6553 missingterm(PL_tokenbuf);
6555 sv_setpvn(tmpstr,d+1,s-d);
6557 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6559 sv_catpvn(herewas,s,PL_bufend-s);
6560 sv_setsv(PL_linestr,herewas);
6561 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6562 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6563 PL_last_lop = PL_last_uni = Nullch;
6566 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6567 while (s >= PL_bufend) { /* multiple line string? */
6569 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6570 CopLINE_set(PL_curcop, PL_multi_start);
6571 missingterm(PL_tokenbuf);
6573 CopLINE_inc(PL_curcop);
6574 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6575 PL_last_lop = PL_last_uni = Nullch;
6576 #ifndef PERL_STRICT_CR
6577 if (PL_bufend - PL_linestart >= 2) {
6578 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6579 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6581 PL_bufend[-2] = '\n';
6583 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6585 else if (PL_bufend[-1] == '\r')
6586 PL_bufend[-1] = '\n';
6588 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6589 PL_bufend[-1] = '\n';
6591 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6592 SV *sv = NEWSV(88,0);
6594 sv_upgrade(sv, SVt_PVMG);
6595 sv_setsv(sv,PL_linestr);
6598 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6600 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6603 sv_catsv(PL_linestr,herewas);
6604 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6608 sv_catsv(tmpstr,PL_linestr);
6613 PL_multi_end = CopLINE(PL_curcop);
6614 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6615 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6616 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6618 SvREFCNT_dec(herewas);
6619 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6621 PL_lex_stuff = tmpstr;
6622 yylval.ival = op_type;
6627 takes: current position in input buffer
6628 returns: new position in input buffer
6629 side-effects: yylval and lex_op are set.
6634 <FH> read from filehandle
6635 <pkg::FH> read from package qualified filehandle
6636 <pkg'FH> read from package qualified filehandle
6637 <$fh> read from filehandle in $fh
6643 S_scan_inputsymbol(pTHX_ char *start)
6645 register char *s = start; /* current position in buffer */
6651 d = PL_tokenbuf; /* start of temp holding space */
6652 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6653 end = strchr(s, '\n');
6656 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6658 /* die if we didn't have space for the contents of the <>,
6659 or if it didn't end, or if we see a newline
6662 if (len >= sizeof PL_tokenbuf)
6663 Perl_croak(aTHX_ "Excessively long <> operator");
6665 Perl_croak(aTHX_ "Unterminated <> operator");
6670 Remember, only scalar variables are interpreted as filehandles by
6671 this code. Anything more complex (e.g., <$fh{$num}>) will be
6672 treated as a glob() call.
6673 This code makes use of the fact that except for the $ at the front,
6674 a scalar variable and a filehandle look the same.
6676 if (*d == '$' && d[1]) d++;
6678 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6679 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6682 /* If we've tried to read what we allow filehandles to look like, and
6683 there's still text left, then it must be a glob() and not a getline.
6684 Use scan_str to pull out the stuff between the <> and treat it
6685 as nothing more than a string.
6688 if (d - PL_tokenbuf != len) {
6689 yylval.ival = OP_GLOB;
6691 s = scan_str(start,FALSE,FALSE);
6693 Perl_croak(aTHX_ "Glob not terminated");
6697 bool readline_overriden = FALSE;
6698 GV *gv_readline = Nullgv;
6700 /* we're in a filehandle read situation */
6703 /* turn <> into <ARGV> */
6705 (void)strcpy(d,"ARGV");
6707 /* Check whether readline() is overriden */
6708 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6709 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6711 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6712 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6713 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6714 readline_overriden = TRUE;
6716 /* if <$fh>, create the ops to turn the variable into a
6722 /* try to find it in the pad for this block, otherwise find
6723 add symbol table ops
6725 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6726 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
6727 if (SvFLAGS(namesv) & SVpad_OUR) {
6728 SV *sym = sv_2mortal(newSVpv(HvNAME(GvSTASH(namesv)),0));
6729 sv_catpvn(sym, "::", 2);
6735 OP *o = newOP(OP_PADSV, 0);
6737 PL_lex_op = readline_overriden
6738 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6739 append_elem(OP_LIST, o,
6740 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6741 : (OP*)newUNOP(OP_READLINE, 0, o);
6750 ? (GV_ADDMULTI | GV_ADDINEVAL)
6753 PL_lex_op = readline_overriden
6754 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6755 append_elem(OP_LIST,
6756 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6757 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6758 : (OP*)newUNOP(OP_READLINE, 0,
6759 newUNOP(OP_RV2SV, 0,
6760 newGVOP(OP_GV, 0, gv)));
6762 if (!readline_overriden)
6763 PL_lex_op->op_flags |= OPf_SPECIAL;
6764 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6765 yylval.ival = OP_NULL;
6768 /* If it's none of the above, it must be a literal filehandle
6769 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6771 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6772 PL_lex_op = readline_overriden
6773 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6774 append_elem(OP_LIST,
6775 newGVOP(OP_GV, 0, gv),
6776 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6777 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6778 yylval.ival = OP_NULL;
6787 takes: start position in buffer
6788 keep_quoted preserve \ on the embedded delimiter(s)
6789 keep_delims preserve the delimiters around the string
6790 returns: position to continue reading from buffer
6791 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6792 updates the read buffer.
6794 This subroutine pulls a string out of the input. It is called for:
6795 q single quotes q(literal text)
6796 ' single quotes 'literal text'
6797 qq double quotes qq(interpolate $here please)
6798 " double quotes "interpolate $here please"
6799 qx backticks qx(/bin/ls -l)
6800 ` backticks `/bin/ls -l`
6801 qw quote words @EXPORT_OK = qw( func() $spam )
6802 m// regexp match m/this/
6803 s/// regexp substitute s/this/that/
6804 tr/// string transliterate tr/this/that/
6805 y/// string transliterate y/this/that/
6806 ($*@) sub prototypes sub foo ($)
6807 (stuff) sub attr parameters sub foo : attr(stuff)
6808 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6810 In most of these cases (all but <>, patterns and transliterate)
6811 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6812 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6813 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6816 It skips whitespace before the string starts, and treats the first
6817 character as the delimiter. If the delimiter is one of ([{< then
6818 the corresponding "close" character )]}> is used as the closing
6819 delimiter. It allows quoting of delimiters, and if the string has
6820 balanced delimiters ([{<>}]) it allows nesting.
6822 On success, the SV with the resulting string is put into lex_stuff or,
6823 if that is already non-NULL, into lex_repl. The second case occurs only
6824 when parsing the RHS of the special constructs s/// and tr/// (y///).
6825 For convenience, the terminating delimiter character is stuffed into
6830 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6832 SV *sv; /* scalar value: string */
6833 char *tmps; /* temp string, used for delimiter matching */
6834 register char *s = start; /* current position in the buffer */
6835 register char term; /* terminating character */
6836 register char *to; /* current position in the sv's data */
6837 I32 brackets = 1; /* bracket nesting level */
6838 bool has_utf8 = FALSE; /* is there any utf8 content? */
6840 /* skip space before the delimiter */
6844 /* mark where we are, in case we need to report errors */
6847 /* after skipping whitespace, the next character is the terminator */
6849 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6852 /* mark where we are */
6853 PL_multi_start = CopLINE(PL_curcop);
6854 PL_multi_open = term;
6856 /* find corresponding closing delimiter */
6857 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6859 PL_multi_close = term;
6861 /* create a new SV to hold the contents. 87 is leak category, I'm
6862 assuming. 79 is the SV's initial length. What a random number. */
6864 sv_upgrade(sv, SVt_PVIV);
6866 (void)SvPOK_only(sv); /* validate pointer */
6868 /* move past delimiter and try to read a complete string */
6870 sv_catpvn(sv, s, 1);
6873 /* extend sv if need be */
6874 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6875 /* set 'to' to the next character in the sv's string */
6876 to = SvPVX(sv)+SvCUR(sv);
6878 /* if open delimiter is the close delimiter read unbridle */
6879 if (PL_multi_open == PL_multi_close) {
6880 for (; s < PL_bufend; s++,to++) {
6881 /* embedded newlines increment the current line number */
6882 if (*s == '\n' && !PL_rsfp)
6883 CopLINE_inc(PL_curcop);
6884 /* handle quoted delimiters */
6885 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6886 if (!keep_quoted && s[1] == term)
6888 /* any other quotes are simply copied straight through */
6892 /* terminate when run out of buffer (the for() condition), or
6893 have found the terminator */
6894 else if (*s == term)
6896 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6902 /* if the terminator isn't the same as the start character (e.g.,
6903 matched brackets), we have to allow more in the quoting, and
6904 be prepared for nested brackets.
6907 /* read until we run out of string, or we find the terminator */
6908 for (; s < PL_bufend; s++,to++) {
6909 /* embedded newlines increment the line count */
6910 if (*s == '\n' && !PL_rsfp)
6911 CopLINE_inc(PL_curcop);
6912 /* backslashes can escape the open or closing characters */
6913 if (*s == '\\' && s+1 < PL_bufend) {
6915 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6920 /* allow nested opens and closes */
6921 else if (*s == PL_multi_close && --brackets <= 0)
6923 else if (*s == PL_multi_open)
6925 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6930 /* terminate the copied string and update the sv's end-of-string */
6932 SvCUR_set(sv, to - SvPVX(sv));
6935 * this next chunk reads more into the buffer if we're not done yet
6939 break; /* handle case where we are done yet :-) */
6941 #ifndef PERL_STRICT_CR
6942 if (to - SvPVX(sv) >= 2) {
6943 if ((to[-2] == '\r' && to[-1] == '\n') ||
6944 (to[-2] == '\n' && to[-1] == '\r'))
6948 SvCUR_set(sv, to - SvPVX(sv));
6950 else if (to[-1] == '\r')
6953 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6957 /* if we're out of file, or a read fails, bail and reset the current
6958 line marker so we can report where the unterminated string began
6961 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6963 CopLINE_set(PL_curcop, PL_multi_start);
6966 /* we read a line, so increment our line counter */
6967 CopLINE_inc(PL_curcop);
6969 /* update debugger info */
6970 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6971 SV *sv = NEWSV(88,0);
6973 sv_upgrade(sv, SVt_PVMG);
6974 sv_setsv(sv,PL_linestr);
6977 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6980 /* having changed the buffer, we must update PL_bufend */
6981 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6982 PL_last_lop = PL_last_uni = Nullch;
6985 /* at this point, we have successfully read the delimited string */
6988 sv_catpvn(sv, s, 1);
6991 PL_multi_end = CopLINE(PL_curcop);
6994 /* if we allocated too much space, give some back */
6995 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6996 SvLEN_set(sv, SvCUR(sv) + 1);
6997 Renew(SvPVX(sv), SvLEN(sv), char);
7000 /* decide whether this is the first or second quoted string we've read
7013 takes: pointer to position in buffer
7014 returns: pointer to new position in buffer
7015 side-effects: builds ops for the constant in yylval.op
7017 Read a number in any of the formats that Perl accepts:
7019 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7020 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7023 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7025 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7028 If it reads a number without a decimal point or an exponent, it will
7029 try converting the number to an integer and see if it can do so
7030 without loss of precision.
7034 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7036 register char *s = start; /* current position in buffer */
7037 register char *d; /* destination in temp buffer */
7038 register char *e; /* end of temp buffer */
7039 NV nv; /* number read, as a double */
7040 SV *sv = Nullsv; /* place to put the converted number */
7041 bool floatit; /* boolean: int or float? */
7042 char *lastub = 0; /* position of last underbar */
7043 static char number_too_long[] = "Number too long";
7045 /* We use the first character to decide what type of number this is */
7049 Perl_croak(aTHX_ "panic: scan_num");
7051 /* if it starts with a 0, it could be an octal number, a decimal in
7052 0.13 disguise, or a hexadecimal number, or a binary number. */
7056 u holds the "number so far"
7057 shift the power of 2 of the base
7058 (hex == 4, octal == 3, binary == 1)
7059 overflowed was the number more than we can hold?
7061 Shift is used when we add a digit. It also serves as an "are
7062 we in octal/hex/binary?" indicator to disallow hex characters
7068 bool overflowed = FALSE;
7069 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7070 static char* bases[5] = { "", "binary", "", "octal",
7072 static char* Bases[5] = { "", "Binary", "", "Octal",
7074 static char *maxima[5] = { "",
7075 "0b11111111111111111111111111111111",
7079 char *base, *Base, *max;
7085 } else if (s[1] == 'b') {
7089 /* check for a decimal in disguise */
7090 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7092 /* so it must be octal */
7099 if (ckWARN(WARN_SYNTAX))
7100 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7101 "Misplaced _ in number");
7105 base = bases[shift];
7106 Base = Bases[shift];
7107 max = maxima[shift];
7109 /* read the rest of the number */
7111 /* x is used in the overflow test,
7112 b is the digit we're adding on. */
7117 /* if we don't mention it, we're done */
7121 /* _ are ignored -- but warned about if consecutive */
7123 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7124 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7125 "Misplaced _ in number");
7129 /* 8 and 9 are not octal */
7132 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7136 case '2': case '3': case '4':
7137 case '5': case '6': case '7':
7139 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7143 b = *s++ & 15; /* ASCII digit -> value of digit */
7147 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7148 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7149 /* make sure they said 0x */
7154 /* Prepare to put the digit we have onto the end
7155 of the number so far. We check for overflows.
7160 x = u << shift; /* make room for the digit */
7162 if ((x >> shift) != u
7163 && !(PL_hints & HINT_NEW_BINARY)) {
7166 if (ckWARN_d(WARN_OVERFLOW))
7167 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7168 "Integer overflow in %s number",
7171 u = x | b; /* add the digit to the end */
7174 n *= nvshift[shift];
7175 /* If an NV has not enough bits in its
7176 * mantissa to represent an UV this summing of
7177 * small low-order numbers is a waste of time
7178 * (because the NV cannot preserve the
7179 * low-order bits anyway): we could just
7180 * remember when did we overflow and in the
7181 * end just multiply n by the right
7189 /* if we get here, we had success: make a scalar value from
7194 /* final misplaced underbar check */
7196 if (ckWARN(WARN_SYNTAX))
7197 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7202 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7203 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7204 "%s number > %s non-portable",
7210 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7211 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7212 "%s number > %s non-portable",
7217 if (PL_hints & HINT_NEW_BINARY)
7218 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7223 handle decimal numbers.
7224 we're also sent here when we read a 0 as the first digit
7226 case '1': case '2': case '3': case '4': case '5':
7227 case '6': case '7': case '8': case '9': case '.':
7230 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7233 /* read next group of digits and _ and copy into d */
7234 while (isDIGIT(*s) || *s == '_') {
7235 /* skip underscores, checking for misplaced ones
7239 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7240 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7241 "Misplaced _ in number");
7245 /* check for end of fixed-length buffer */
7247 Perl_croak(aTHX_ number_too_long);
7248 /* if we're ok, copy the character */
7253 /* final misplaced underbar check */
7254 if (lastub && s == lastub + 1) {
7255 if (ckWARN(WARN_SYNTAX))
7256 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7259 /* read a decimal portion if there is one. avoid
7260 3..5 being interpreted as the number 3. followed
7263 if (*s == '.' && s[1] != '.') {
7268 if (ckWARN(WARN_SYNTAX))
7269 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7270 "Misplaced _ in number");
7274 /* copy, ignoring underbars, until we run out of digits.
7276 for (; isDIGIT(*s) || *s == '_'; s++) {
7277 /* fixed length buffer check */
7279 Perl_croak(aTHX_ number_too_long);
7281 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7282 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7283 "Misplaced _ in number");
7289 /* fractional part ending in underbar? */
7291 if (ckWARN(WARN_SYNTAX))
7292 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7293 "Misplaced _ in number");
7295 if (*s == '.' && isDIGIT(s[1])) {
7296 /* oops, it's really a v-string, but without the "v" */
7302 /* read exponent part, if present */
7303 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7307 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7308 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7310 /* stray preinitial _ */
7312 if (ckWARN(WARN_SYNTAX))
7313 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7314 "Misplaced _ in number");
7318 /* allow positive or negative exponent */
7319 if (*s == '+' || *s == '-')
7322 /* stray initial _ */
7324 if (ckWARN(WARN_SYNTAX))
7325 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7326 "Misplaced _ in number");
7330 /* read digits of exponent */
7331 while (isDIGIT(*s) || *s == '_') {
7334 Perl_croak(aTHX_ number_too_long);
7338 if (ckWARN(WARN_SYNTAX) &&
7339 ((lastub && s == lastub + 1) ||
7340 (!isDIGIT(s[1]) && s[1] != '_')))
7341 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7342 "Misplaced _ in number");
7349 /* make an sv from the string */
7353 We try to do an integer conversion first if no characters
7354 indicating "float" have been found.
7359 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7361 if (flags == IS_NUMBER_IN_UV) {
7363 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7366 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7367 if (uv <= (UV) IV_MIN)
7368 sv_setiv(sv, -(IV)uv);
7375 /* terminate the string */
7377 nv = Atof(PL_tokenbuf);
7381 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7382 (PL_hints & HINT_NEW_INTEGER) )
7383 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7384 (floatit ? "float" : "integer"),
7388 /* if it starts with a v, it could be a v-string */
7391 sv = NEWSV(92,5); /* preallocate storage space */
7392 s = new_vstring(s,sv);
7396 /* make the op for the constant and return */
7399 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7401 lvalp->opval = Nullop;
7407 S_scan_formline(pTHX_ register char *s)
7411 SV *stuff = newSVpvn("",0);
7412 bool needargs = FALSE;
7415 if (*s == '.' || *s == /*{*/'}') {
7417 #ifdef PERL_STRICT_CR
7418 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7420 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7422 if (*t == '\n' || t == PL_bufend)
7425 if (PL_in_eval && !PL_rsfp) {
7426 eol = strchr(s,'\n');
7431 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7433 for (t = s; t < eol; t++) {
7434 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7436 goto enough; /* ~~ must be first line in formline */
7438 if (*t == '@' || *t == '^')
7442 sv_catpvn(stuff, s, eol-s);
7443 #ifndef PERL_STRICT_CR
7444 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7445 char *end = SvPVX(stuff) + SvCUR(stuff);
7457 s = filter_gets(PL_linestr, PL_rsfp, 0);
7458 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7459 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7460 PL_last_lop = PL_last_uni = Nullch;
7463 yyerror("Format not terminated");
7473 PL_lex_state = LEX_NORMAL;
7474 PL_nextval[PL_nexttoke].ival = 0;
7478 PL_lex_state = LEX_FORMLINE;
7479 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7481 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7485 SvREFCNT_dec(stuff);
7486 PL_lex_formbrack = 0;
7497 PL_cshlen = strlen(PL_cshname);
7502 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7504 I32 oldsavestack_ix = PL_savestack_ix;
7505 CV* outsidecv = PL_compcv;
7509 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7511 SAVEI32(PL_subline);
7512 save_item(PL_subname);
7515 SAVESPTR(PL_comppad_name);
7516 SAVESPTR(PL_compcv);
7517 SAVEI32(PL_comppad_name_fill);
7518 SAVEI32(PL_min_intro_pending);
7519 SAVEI32(PL_max_intro_pending);
7520 SAVEI32(PL_pad_reset_pending);
7522 PL_compcv = (CV*)NEWSV(1104,0);
7523 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7524 CvFLAGS(PL_compcv) |= flags;
7526 PL_comppad = newAV();
7527 av_push(PL_comppad, Nullsv);
7528 PL_curpad = AvARRAY(PL_comppad);
7529 PL_comppad_name = newAV();
7530 PL_comppad_name_fill = 0;
7531 PL_min_intro_pending = 0;
7533 PL_subline = CopLINE(PL_curcop);
7534 #ifdef USE_5005THREADS
7535 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7536 PL_curpad[0] = (SV*)newAV();
7537 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7538 #endif /* USE_5005THREADS */
7540 comppadlist = newAV();
7541 AvREAL_off(comppadlist);
7542 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7543 av_store(comppadlist, 1, (SV*)PL_comppad);
7545 CvPADLIST(PL_compcv) = comppadlist;
7546 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7547 #ifdef USE_5005THREADS
7548 CvOWNER(PL_compcv) = 0;
7549 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7550 MUTEX_INIT(CvMUTEXP(PL_compcv));
7551 #endif /* USE_5005THREADS */
7553 return oldsavestack_ix;
7557 #pragma segment Perl_yylex
7560 Perl_yywarn(pTHX_ char *s)
7562 PL_in_eval |= EVAL_WARNONLY;
7564 PL_in_eval &= ~EVAL_WARNONLY;
7569 Perl_yyerror(pTHX_ char *s)
7572 char *context = NULL;
7576 if (!yychar || (yychar == ';' && !PL_rsfp))
7578 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7579 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7580 while (isSPACE(*PL_oldoldbufptr))
7582 context = PL_oldoldbufptr;
7583 contlen = PL_bufptr - PL_oldoldbufptr;
7585 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7586 PL_oldbufptr != PL_bufptr) {
7587 while (isSPACE(*PL_oldbufptr))
7589 context = PL_oldbufptr;
7590 contlen = PL_bufptr - PL_oldbufptr;
7592 else if (yychar > 255)
7593 where = "next token ???";
7594 #ifdef USE_PURE_BISON
7595 /* GNU Bison sets the value -2 */
7596 else if (yychar == -2) {
7598 else if ((yychar & 127) == 127) {
7600 if (PL_lex_state == LEX_NORMAL ||
7601 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7602 where = "at end of line";
7603 else if (PL_lex_inpat)
7604 where = "within pattern";
7606 where = "within string";
7609 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7611 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7612 else if (isPRINT_LC(yychar))
7613 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7615 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7616 where = SvPVX(where_sv);
7618 msg = sv_2mortal(newSVpv(s, 0));
7619 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7620 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7622 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7624 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7625 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7626 Perl_sv_catpvf(aTHX_ msg,
7627 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7628 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7631 if (PL_in_eval & EVAL_WARNONLY)
7632 Perl_warn(aTHX_ "%"SVf, msg);
7635 if (PL_error_count >= 10) {
7636 if (PL_in_eval && SvCUR(ERRSV))
7637 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7638 ERRSV, OutCopFILE(PL_curcop));
7640 Perl_croak(aTHX_ "%s has too many errors.\n",
7641 OutCopFILE(PL_curcop));
7644 PL_in_my_stash = Nullhv;
7648 #pragma segment Main
7652 S_swallow_bom(pTHX_ U8 *s)
7655 slen = SvCUR(PL_linestr);
7659 /* UTF-16 little-endian */
7660 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7661 Perl_croak(aTHX_ "Unsupported script encoding");
7662 #ifndef PERL_NO_UTF16_FILTER
7663 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7665 if (PL_bufend > (char*)s) {
7669 filter_add(utf16rev_textfilter, NULL);
7670 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7671 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7672 PL_bufend - (char*)s - 1,
7674 Copy(news, s, newlen, U8);
7675 SvCUR_set(PL_linestr, newlen);
7676 PL_bufend = SvPVX(PL_linestr) + newlen;
7677 news[newlen++] = '\0';
7681 Perl_croak(aTHX_ "Unsupported script encoding");
7686 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7687 #ifndef PERL_NO_UTF16_FILTER
7688 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7690 if (PL_bufend > (char *)s) {
7694 filter_add(utf16_textfilter, NULL);
7695 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7696 PL_bufend = (char*)utf16_to_utf8(s, news,
7697 PL_bufend - (char*)s,
7699 Copy(news, s, newlen, U8);
7700 SvCUR_set(PL_linestr, newlen);
7701 PL_bufend = SvPVX(PL_linestr) + newlen;
7702 news[newlen++] = '\0';
7706 Perl_croak(aTHX_ "Unsupported script encoding");
7711 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7712 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7717 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7718 s[2] == 0xFE && s[3] == 0xFF)
7720 Perl_croak(aTHX_ "Unsupported script encoding");
7728 * Restore a source filter.
7732 restore_rsfp(pTHX_ void *f)
7734 PerlIO *fp = (PerlIO*)f;
7736 if (PL_rsfp == PerlIO_stdin())
7737 PerlIO_clearerr(PL_rsfp);
7738 else if (PL_rsfp && (PL_rsfp != fp))
7739 PerlIO_close(PL_rsfp);
7743 #ifndef PERL_NO_UTF16_FILTER
7745 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7747 I32 count = FILTER_READ(idx+1, sv, maxlen);
7752 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7753 if (!*SvPV_nolen(sv))
7754 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7757 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7758 sv_usepvn(sv, (char*)tmps, tend - tmps);
7764 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7766 I32 count = FILTER_READ(idx+1, sv, maxlen);
7771 if (!*SvPV_nolen(sv))
7772 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7775 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7776 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7777 sv_usepvn(sv, (char*)tmps, tend - tmps);