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";
29 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
30 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
32 static void restore_rsfp(pTHX_ void *f);
33 #ifndef PERL_NO_UTF16_FILTER
34 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
35 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
38 #define XFAKEBRACK 128
41 #ifdef USE_UTF8_SCRIPTS
42 # define UTF (!IN_BYTES)
44 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
47 /* In variables named $^X, these are the legal values for X.
48 * 1999-02-27 mjd-perl-patch@plover.com */
49 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
51 /* On MacOS, respect nonbreaking spaces */
52 #ifdef MACOS_TRADITIONAL
53 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
58 /* LEX_* are values for PL_lex_state, the state of the lexer.
59 * They are arranged oddly so that the guard on the switch statement
60 * can get by with a single comparison (if the compiler is smart enough).
63 /* #define LEX_NOTPARSING 11 is done in perl.h. */
66 #define LEX_INTERPNORMAL 9
67 #define LEX_INTERPCASEMOD 8
68 #define LEX_INTERPPUSH 7
69 #define LEX_INTERPSTART 6
70 #define LEX_INTERPEND 5
71 #define LEX_INTERPENDMAYBE 4
72 #define LEX_INTERPCONCAT 3
73 #define LEX_INTERPCONST 2
74 #define LEX_FORMLINE 1
75 #define LEX_KNOWNEXT 0
83 # define YYMAXLEVEL 100
85 YYSTYPE* yylval_pointer[YYMAXLEVEL];
86 int* yychar_pointer[YYMAXLEVEL];
90 # define yylval (*yylval_pointer[yyactlevel])
91 # define yychar (*yychar_pointer[yyactlevel])
92 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
94 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
99 /* CLINE is a macro that ensures PL_copline has a sane value */
104 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
107 * Convenience functions to return different tokens and prime the
108 * lexer for the next token. They all take an argument.
110 * TOKEN : generic token (used for '(', DOLSHARP, etc)
111 * OPERATOR : generic operator
112 * AOPERATOR : assignment operator
113 * PREBLOCK : beginning the block after an if, while, foreach, ...
114 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
115 * PREREF : *EXPR where EXPR is not a simple identifier
116 * TERM : expression term
117 * LOOPX : loop exiting command (goto, last, dump, etc)
118 * FTST : file test operator
119 * FUN0 : zero-argument function
120 * FUN1 : not used, except for not, which isn't a UNIOP
121 * BOop : bitwise or or xor
123 * SHop : shift operator
124 * PWop : power operator
125 * PMop : pattern-matching operator
126 * Aop : addition-level operator
127 * Mop : multiplication-level operator
128 * Eop : equality-testing operator
129 * Rop : relational operator <= != gt
131 * Also see LOP and lop() below.
134 /* Note that REPORT() and REPORT2() will be expressions that supply
135 * their own trailing comma, not suitable for statements as such. */
136 #ifdef DEBUGGING /* Serve -DT. */
137 # define REPORT(x,retval) tokereport(x,s,(int)retval),
138 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
140 # define REPORT(x,retval)
141 # define REPORT2(x,retval)
144 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
145 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
146 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
147 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
148 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
149 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
150 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
151 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
152 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
153 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
154 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
155 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
156 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
157 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
158 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
159 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
160 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
161 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
162 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
163 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
165 /* This bit of chicanery makes a unary function followed by
166 * a parenthesis into a function with one argument, highest precedence.
167 * The UNIDOR macro is for unary functions that can be followed by the //
168 * operator (such as C<shift // 0>).
170 #define UNI2(f,x) 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) )
177 #define UNI(f) UNI2(f,XTERM)
178 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
180 #define UNIBRACK(f) return(yylval.ival = f, \
183 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
186 /* grandfather return to old style */
187 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
195 SV* report = newSVpv(thing, 0);
196 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
199 if (s - PL_bufptr > 0)
200 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
202 if (PL_oldbufptr && *PL_oldbufptr)
203 sv_catpv(report, PL_tokenbuf);
205 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
214 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
215 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
219 S_ao(pTHX_ int toketype)
221 if (*PL_bufptr == '=') {
223 if (toketype == ANDAND)
224 yylval.ival = OP_ANDASSIGN;
225 else if (toketype == OROR)
226 yylval.ival = OP_ORASSIGN;
227 else if (toketype == DORDOR)
228 yylval.ival = OP_DORASSIGN;
236 * When Perl expects an operator and finds something else, no_op
237 * prints the warning. It always prints "<something> found where
238 * operator expected. It prints "Missing semicolon on previous line?"
239 * if the surprise occurs at the start of the line. "do you need to
240 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
241 * where the compiler doesn't know if foo is a method call or a function.
242 * It prints "Missing operator before end of line" if there's nothing
243 * after the missing operator, or "... before <...>" if there is something
244 * after the missing operator.
248 S_no_op(pTHX_ char *what, char *s)
250 char *oldbp = PL_bufptr;
251 bool is_first = (PL_oldbufptr == PL_linestart);
257 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
259 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
260 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
262 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
263 if (t < PL_bufptr && isSPACE(*t))
264 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
265 t - PL_oldoldbufptr, PL_oldoldbufptr);
269 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
276 * Complain about missing quote/regexp/heredoc terminator.
277 * If it's called with (char *)NULL then it cauterizes the line buffer.
278 * If we're in a delimited string and the delimiter is a control
279 * character, it's reformatted into a two-char sequence like ^C.
284 S_missingterm(pTHX_ char *s)
289 char *nl = strrchr(s,'\n');
295 iscntrl(PL_multi_close)
297 PL_multi_close < 32 || PL_multi_close == 127
301 tmpbuf[1] = toCTRL(PL_multi_close);
307 *tmpbuf = (char)PL_multi_close;
311 q = strchr(s,'"') ? '\'' : '"';
312 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
320 Perl_deprecate(pTHX_ char *s)
322 if (ckWARN(WARN_DEPRECATED))
323 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
327 Perl_deprecate_old(pTHX_ char *s)
329 /* This function should NOT be called for any new deprecated warnings */
330 /* Use Perl_deprecate instead */
332 /* It is here to maintain backward compatibility with the pre-5.8 */
333 /* warnings category hierarchy. The "deprecated" category used to */
334 /* live under the "syntax" category. It is now a top-level category */
335 /* in its own right. */
337 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
338 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
339 "Use of %s is deprecated", s);
344 * Deprecate a comma-less variable list.
350 deprecate_old("comma-less variable list");
354 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
355 * utf16-to-utf8-reversed.
358 #ifdef PERL_CR_FILTER
362 register char *s = SvPVX(sv);
363 register char *e = s + SvCUR(sv);
364 /* outer loop optimized to do nothing if there are no CR-LFs */
366 if (*s++ == '\r' && *s == '\n') {
367 /* hit a CR-LF, need to copy the rest */
368 register char *d = s - 1;
371 if (*s == '\r' && s[1] == '\n')
382 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
384 I32 count = FILTER_READ(idx+1, sv, maxlen);
385 if (count > 0 && !maxlen)
393 * Initialize variables. Uses the Perl save_stack to save its state (for
394 * recursive calls to the parser).
398 Perl_lex_start(pTHX_ SV *line)
403 SAVEI32(PL_lex_dojoin);
404 SAVEI32(PL_lex_brackets);
405 SAVEI32(PL_lex_casemods);
406 SAVEI32(PL_lex_starts);
407 SAVEI32(PL_lex_state);
408 SAVEVPTR(PL_lex_inpat);
409 SAVEI32(PL_lex_inwhat);
410 if (PL_lex_state == LEX_KNOWNEXT) {
411 I32 toke = PL_nexttoke;
412 while (--toke >= 0) {
413 SAVEI32(PL_nexttype[toke]);
414 SAVEVPTR(PL_nextval[toke]);
416 SAVEI32(PL_nexttoke);
418 SAVECOPLINE(PL_curcop);
421 SAVEPPTR(PL_oldbufptr);
422 SAVEPPTR(PL_oldoldbufptr);
423 SAVEPPTR(PL_last_lop);
424 SAVEPPTR(PL_last_uni);
425 SAVEPPTR(PL_linestart);
426 SAVESPTR(PL_linestr);
427 SAVEPPTR(PL_lex_brackstack);
428 SAVEPPTR(PL_lex_casestack);
429 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
430 SAVESPTR(PL_lex_stuff);
431 SAVEI32(PL_lex_defer);
432 SAVEI32(PL_sublex_info.sub_inwhat);
433 SAVESPTR(PL_lex_repl);
435 SAVEINT(PL_lex_expect);
437 PL_lex_state = LEX_NORMAL;
441 New(899, PL_lex_brackstack, 120, char);
442 New(899, PL_lex_casestack, 12, char);
443 SAVEFREEPV(PL_lex_brackstack);
444 SAVEFREEPV(PL_lex_casestack);
446 *PL_lex_casestack = '\0';
449 PL_lex_stuff = Nullsv;
450 PL_lex_repl = Nullsv;
454 PL_sublex_info.sub_inwhat = 0;
456 if (SvREADONLY(PL_linestr))
457 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
458 s = SvPV(PL_linestr, len);
459 if (!len || s[len-1] != ';') {
460 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
461 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
462 sv_catpvn(PL_linestr, "\n;", 2);
464 SvTEMP_off(PL_linestr);
465 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
466 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
467 PL_last_lop = PL_last_uni = Nullch;
473 * Finalizer for lexing operations. Must be called when the parser is
474 * done with the lexer.
480 PL_doextract = FALSE;
485 * This subroutine has nothing to do with tilting, whether at windmills
486 * or pinball tables. Its name is short for "increment line". It
487 * increments the current line number in CopLINE(PL_curcop) and checks
488 * to see whether the line starts with a comment of the form
489 * # line 500 "foo.pm"
490 * If so, it sets the current line number and file to the values in the comment.
494 S_incline(pTHX_ char *s)
501 CopLINE_inc(PL_curcop);
504 while (SPACE_OR_TAB(*s)) s++;
505 if (strnEQ(s, "line", 4))
509 if (SPACE_OR_TAB(*s))
513 while (SPACE_OR_TAB(*s)) s++;
519 while (SPACE_OR_TAB(*s))
521 if (*s == '"' && (t = strchr(s+1, '"'))) {
526 for (t = s; !isSPACE(*t); t++) ;
529 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
531 if (*e != '\n' && *e != '\0')
532 return; /* false alarm */
537 CopFILE_free(PL_curcop);
538 CopFILE_set(PL_curcop, s);
541 CopLINE_set(PL_curcop, atoi(n)-1);
546 * Called to gobble the appropriate amount and type of whitespace.
547 * Skips comments as well.
551 S_skipspace(pTHX_ register char *s)
553 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
554 while (s < PL_bufend && SPACE_OR_TAB(*s))
560 SSize_t oldprevlen, oldoldprevlen;
561 SSize_t oldloplen = 0, oldunilen = 0;
562 while (s < PL_bufend && isSPACE(*s)) {
563 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
568 if (s < PL_bufend && *s == '#') {
569 while (s < PL_bufend && *s != '\n')
573 if (PL_in_eval && !PL_rsfp) {
580 /* only continue to recharge the buffer if we're at the end
581 * of the buffer, we're not reading from a source filter, and
582 * we're in normal lexing mode
584 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
585 PL_lex_state == LEX_FORMLINE)
588 /* try to recharge the buffer */
589 if ((s = filter_gets(PL_linestr, PL_rsfp,
590 (prevlen = SvCUR(PL_linestr)))) == Nullch)
592 /* end of file. Add on the -p or -n magic */
593 if (PL_minus_n || PL_minus_p) {
594 sv_setpv(PL_linestr,PL_minus_p ?
595 ";}continue{print or die qq(-p destination: $!\\n)" :
597 sv_catpv(PL_linestr,";}");
598 PL_minus_n = PL_minus_p = 0;
601 sv_setpv(PL_linestr,";");
603 /* reset variables for next time we lex */
604 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
606 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
607 PL_last_lop = PL_last_uni = Nullch;
609 /* Close the filehandle. Could be from -P preprocessor,
610 * STDIN, or a regular file. If we were reading code from
611 * STDIN (because the commandline held no -e or filename)
612 * then we don't close it, we reset it so the code can
613 * read from STDIN too.
616 if (PL_preprocess && !PL_in_eval)
617 (void)PerlProc_pclose(PL_rsfp);
618 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
619 PerlIO_clearerr(PL_rsfp);
621 (void)PerlIO_close(PL_rsfp);
626 /* not at end of file, so we only read another line */
627 /* make corresponding updates to old pointers, for yyerror() */
628 oldprevlen = PL_oldbufptr - PL_bufend;
629 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
631 oldunilen = PL_last_uni - PL_bufend;
633 oldloplen = PL_last_lop - PL_bufend;
634 PL_linestart = PL_bufptr = s + prevlen;
635 PL_bufend = s + SvCUR(PL_linestr);
637 PL_oldbufptr = s + oldprevlen;
638 PL_oldoldbufptr = s + oldoldprevlen;
640 PL_last_uni = s + oldunilen;
642 PL_last_lop = s + oldloplen;
645 /* debugger active and we're not compiling the debugger code,
646 * so store the line into the debugger's array of lines
648 if (PERLDB_LINE && PL_curstash != PL_debstash) {
649 SV *sv = NEWSV(85,0);
651 sv_upgrade(sv, SVt_PVMG);
652 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
655 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
662 * Check the unary operators to ensure there's no ambiguity in how they're
663 * used. An ambiguous piece of code would be:
665 * This doesn't mean rand() + 5. Because rand() is a unary operator,
666 * the +5 is its argument.
675 if (PL_oldoldbufptr != PL_last_uni)
677 while (isSPACE(*PL_last_uni))
679 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
680 if ((t = strchr(s, '(')) && t < PL_bufptr)
682 if (ckWARN_d(WARN_AMBIGUOUS)){
685 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
686 "Warning: Use of \"%s\" without parens is ambiguous",
693 * LOP : macro to build a list operator. Its behaviour has been replaced
694 * with a subroutine, S_lop() for which LOP is just another name.
697 #define LOP(f,x) return lop(f,x,s)
701 * Build a list operator (or something that might be one). The rules:
702 * - if we have a next token, then it's a list operator [why?]
703 * - if the next thing is an opening paren, then it's a function
704 * - else it's a list operator
708 S_lop(pTHX_ I32 f, int x, char *s)
715 PL_last_lop = PL_oldbufptr;
716 PL_last_lop_op = (OPCODE)f;
730 * When the lexer realizes it knows the next token (for instance,
731 * it is reordering tokens for the parser) then it can call S_force_next
732 * to know what token to return the next time the lexer is called. Caller
733 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
734 * handles the token correctly.
738 S_force_next(pTHX_ I32 type)
740 PL_nexttype[PL_nexttoke] = type;
742 if (PL_lex_state != LEX_KNOWNEXT) {
743 PL_lex_defer = PL_lex_state;
744 PL_lex_expect = PL_expect;
745 PL_lex_state = LEX_KNOWNEXT;
751 * When the lexer knows the next thing is a word (for instance, it has
752 * just seen -> and it knows that the next char is a word char, then
753 * it calls S_force_word to stick the next word into the PL_next lookahead.
756 * char *start : buffer position (must be within PL_linestr)
757 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
758 * int check_keyword : if true, Perl checks to make sure the word isn't
759 * a keyword (do this if the word is a label, e.g. goto FOO)
760 * int allow_pack : if true, : characters will also be allowed (require,
762 * int allow_initial_tick : used by the "sub" lexer only.
766 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
771 start = skipspace(start);
773 if (isIDFIRST_lazy_if(s,UTF) ||
774 (allow_pack && *s == ':') ||
775 (allow_initial_tick && *s == '\'') )
777 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
778 if (check_keyword && keyword(PL_tokenbuf, len))
780 if (token == METHOD) {
785 PL_expect = XOPERATOR;
788 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
789 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
797 * Called when the lexer wants $foo *foo &foo etc, but the program
798 * text only contains the "foo" portion. The first argument is a pointer
799 * to the "foo", and the second argument is the type symbol to prefix.
800 * Forces the next token to be a "WORD".
801 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
805 S_force_ident(pTHX_ register char *s, int kind)
808 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
809 PL_nextval[PL_nexttoke].opval = o;
812 o->op_private = OPpCONST_ENTERED;
813 /* XXX see note in pp_entereval() for why we forgo typo
814 warnings if the symbol must be introduced in an eval.
816 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
817 kind == '$' ? SVt_PV :
818 kind == '@' ? SVt_PVAV :
819 kind == '%' ? SVt_PVHV :
827 Perl_str_to_version(pTHX_ SV *sv)
832 char *start = SvPVx(sv,len);
833 bool utf = SvUTF8(sv) ? TRUE : FALSE;
834 char *end = start + len;
835 while (start < end) {
839 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
844 retval += ((NV)n)/nshift;
853 * Forces the next token to be a version number.
854 * If the next token appears to be an invalid version number, (e.g. "v2b"),
855 * and if "guessing" is TRUE, then no new token is created (and the caller
856 * must use an alternative parsing method).
860 S_force_version(pTHX_ char *s, int guessing)
862 OP *version = Nullop;
871 while (isDIGIT(*d) || *d == '_' || *d == '.')
873 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
875 s = scan_num(s, &yylval);
876 version = yylval.opval;
877 ver = cSVOPx(version)->op_sv;
878 if (SvPOK(ver) && !SvNIOK(ver)) {
879 (void)SvUPGRADE(ver, SVt_PVNV);
880 SvNVX(ver) = str_to_version(ver);
881 SvNOK_on(ver); /* hint that it is a version */
888 /* NOTE: The parser sees the package name and the VERSION swapped */
889 PL_nextval[PL_nexttoke].opval = version;
897 * Tokenize a quoted string passed in as an SV. It finds the next
898 * chunk, up to end of string or a backslash. It may make a new
899 * SV containing that chunk (if HINT_NEW_STRING is on). It also
904 S_tokeq(pTHX_ SV *sv)
915 s = SvPV_force(sv, len);
916 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
919 while (s < send && *s != '\\')
924 if ( PL_hints & HINT_NEW_STRING ) {
925 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
931 if (s + 1 < send && (s[1] == '\\'))
932 s++; /* all that, just for this */
937 SvCUR_set(sv, d - SvPVX(sv));
939 if ( PL_hints & HINT_NEW_STRING )
940 return new_constant(NULL, 0, "q", sv, pv, "q");
945 * Now come three functions related to double-quote context,
946 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
947 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
948 * interact with PL_lex_state, and create fake ( ... ) argument lists
949 * to handle functions and concatenation.
950 * They assume that whoever calls them will be setting up a fake
951 * join call, because each subthing puts a ',' after it. This lets
954 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
956 * (I'm not sure whether the spurious commas at the end of lcfirst's
957 * arguments and join's arguments are created or not).
962 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
964 * Pattern matching will set PL_lex_op to the pattern-matching op to
965 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
967 * OP_CONST and OP_READLINE are easy--just make the new op and return.
969 * Everything else becomes a FUNC.
971 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
972 * had an OP_CONST or OP_READLINE). This just sets us up for a
973 * call to S_sublex_push().
979 register I32 op_type = yylval.ival;
981 if (op_type == OP_NULL) {
982 yylval.opval = PL_lex_op;
986 if (op_type == OP_CONST || op_type == OP_READLINE) {
987 SV *sv = tokeq(PL_lex_stuff);
989 if (SvTYPE(sv) == SVt_PVIV) {
990 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
996 nsv = newSVpvn(p, len);
1002 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1003 PL_lex_stuff = Nullsv;
1004 /* Allow <FH> // "foo" */
1005 if (op_type == OP_READLINE)
1006 PL_expect = XTERMORDORDOR;
1010 PL_sublex_info.super_state = PL_lex_state;
1011 PL_sublex_info.sub_inwhat = op_type;
1012 PL_sublex_info.sub_op = PL_lex_op;
1013 PL_lex_state = LEX_INTERPPUSH;
1017 yylval.opval = PL_lex_op;
1027 * Create a new scope to save the lexing state. The scope will be
1028 * ended in S_sublex_done. Returns a '(', starting the function arguments
1029 * to the uc, lc, etc. found before.
1030 * Sets PL_lex_state to LEX_INTERPCONCAT.
1038 PL_lex_state = PL_sublex_info.super_state;
1039 SAVEI32(PL_lex_dojoin);
1040 SAVEI32(PL_lex_brackets);
1041 SAVEI32(PL_lex_casemods);
1042 SAVEI32(PL_lex_starts);
1043 SAVEI32(PL_lex_state);
1044 SAVEVPTR(PL_lex_inpat);
1045 SAVEI32(PL_lex_inwhat);
1046 SAVECOPLINE(PL_curcop);
1047 SAVEPPTR(PL_bufptr);
1048 SAVEPPTR(PL_bufend);
1049 SAVEPPTR(PL_oldbufptr);
1050 SAVEPPTR(PL_oldoldbufptr);
1051 SAVEPPTR(PL_last_lop);
1052 SAVEPPTR(PL_last_uni);
1053 SAVEPPTR(PL_linestart);
1054 SAVESPTR(PL_linestr);
1055 SAVEPPTR(PL_lex_brackstack);
1056 SAVEPPTR(PL_lex_casestack);
1058 PL_linestr = PL_lex_stuff;
1059 PL_lex_stuff = Nullsv;
1061 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1062 = SvPVX(PL_linestr);
1063 PL_bufend += SvCUR(PL_linestr);
1064 PL_last_lop = PL_last_uni = Nullch;
1065 SAVEFREESV(PL_linestr);
1067 PL_lex_dojoin = FALSE;
1068 PL_lex_brackets = 0;
1069 New(899, PL_lex_brackstack, 120, char);
1070 New(899, PL_lex_casestack, 12, char);
1071 SAVEFREEPV(PL_lex_brackstack);
1072 SAVEFREEPV(PL_lex_casestack);
1073 PL_lex_casemods = 0;
1074 *PL_lex_casestack = '\0';
1076 PL_lex_state = LEX_INTERPCONCAT;
1077 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1079 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1080 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1081 PL_lex_inpat = PL_sublex_info.sub_op;
1083 PL_lex_inpat = Nullop;
1090 * Restores lexer state after a S_sublex_push.
1096 if (!PL_lex_starts++) {
1097 SV *sv = newSVpvn("",0);
1098 if (SvUTF8(PL_linestr))
1100 PL_expect = XOPERATOR;
1101 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1105 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1106 PL_lex_state = LEX_INTERPCASEMOD;
1110 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1111 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1112 PL_linestr = PL_lex_repl;
1114 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1115 PL_bufend += SvCUR(PL_linestr);
1116 PL_last_lop = PL_last_uni = Nullch;
1117 SAVEFREESV(PL_linestr);
1118 PL_lex_dojoin = FALSE;
1119 PL_lex_brackets = 0;
1120 PL_lex_casemods = 0;
1121 *PL_lex_casestack = '\0';
1123 if (SvEVALED(PL_lex_repl)) {
1124 PL_lex_state = LEX_INTERPNORMAL;
1126 /* we don't clear PL_lex_repl here, so that we can check later
1127 whether this is an evalled subst; that means we rely on the
1128 logic to ensure sublex_done() is called again only via the
1129 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1132 PL_lex_state = LEX_INTERPCONCAT;
1133 PL_lex_repl = Nullsv;
1139 PL_bufend = SvPVX(PL_linestr);
1140 PL_bufend += SvCUR(PL_linestr);
1141 PL_expect = XOPERATOR;
1142 PL_sublex_info.sub_inwhat = 0;
1150 Extracts a pattern, double-quoted string, or transliteration. This
1153 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1154 processing a pattern (PL_lex_inpat is true), a transliteration
1155 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1157 Returns a pointer to the character scanned up to. Iff this is
1158 advanced from the start pointer supplied (ie if anything was
1159 successfully parsed), will leave an OP for the substring scanned
1160 in yylval. Caller must intuit reason for not parsing further
1161 by looking at the next characters herself.
1165 double-quoted style: \r and \n
1166 regexp special ones: \D \s
1168 backrefs: \1 (deprecated in substitution replacements)
1169 case and quoting: \U \Q \E
1170 stops on @ and $, but not for $ as tail anchor
1172 In transliterations:
1173 characters are VERY literal, except for - not at the start or end
1174 of the string, which indicates a range. scan_const expands the
1175 range to the full set of intermediate characters.
1177 In double-quoted strings:
1179 double-quoted style: \r and \n
1181 backrefs: \1 (deprecated)
1182 case and quoting: \U \Q \E
1185 scan_const does *not* construct ops to handle interpolated strings.
1186 It stops processing as soon as it finds an embedded $ or @ variable
1187 and leaves it to the caller to work out what's going on.
1189 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1191 $ in pattern could be $foo or could be tail anchor. Assumption:
1192 it's a tail anchor if $ is the last thing in the string, or if it's
1193 followed by one of ")| \n\t"
1195 \1 (backreferences) are turned into $1
1197 The structure of the code is
1198 while (there's a character to process) {
1199 handle transliteration ranges
1200 skip regexp comments
1201 skip # initiated comments in //x patterns
1202 check for embedded @foo
1203 check for embedded scalars
1205 leave intact backslashes from leave (below)
1206 deprecate \1 in strings and sub replacements
1207 handle string-changing backslashes \l \U \Q \E, etc.
1208 switch (what was escaped) {
1209 handle - in a transliteration (becomes a literal -)
1210 handle \132 octal characters
1211 handle 0x15 hex characters
1212 handle \cV (control V)
1213 handle printf backslashes (\f, \r, \n, etc)
1215 } (end if backslash)
1216 } (end while character to read)
1221 S_scan_const(pTHX_ char *start)
1223 register char *send = PL_bufend; /* end of the constant */
1224 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1225 register char *s = start; /* start of the constant */
1226 register char *d = SvPVX(sv); /* destination for copies */
1227 bool dorange = FALSE; /* are we in a translit range? */
1228 bool didrange = FALSE; /* did we just finish a range? */
1229 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1230 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1233 const char *leaveit = /* set of acceptably-backslashed characters */
1235 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1238 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1239 /* If we are doing a trans and we know we want UTF8 set expectation */
1240 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1241 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1245 while (s < send || dorange) {
1246 /* get transliterations out of the way (they're most literal) */
1247 if (PL_lex_inwhat == OP_TRANS) {
1248 /* expand a range A-Z to the full set of characters. AIE! */
1250 I32 i; /* current expanded character */
1251 I32 min; /* first character in range */
1252 I32 max; /* last character in range */
1255 char *c = (char*)utf8_hop((U8*)d, -1);
1259 *c = (char)UTF_TO_NATIVE(0xff);
1260 /* mark the range as done, and continue */
1266 i = d - SvPVX(sv); /* remember current offset */
1267 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1268 d = SvPVX(sv) + i; /* refresh d after realloc */
1269 d -= 2; /* eat the first char and the - */
1271 min = (U8)*d; /* first char in range */
1272 max = (U8)d[1]; /* last char in range */
1276 "Invalid range \"%c-%c\" in transliteration operator",
1277 (char)min, (char)max);
1281 if ((isLOWER(min) && isLOWER(max)) ||
1282 (isUPPER(min) && isUPPER(max))) {
1284 for (i = min; i <= max; i++)
1286 *d++ = NATIVE_TO_NEED(has_utf8,i);
1288 for (i = min; i <= max; i++)
1290 *d++ = NATIVE_TO_NEED(has_utf8,i);
1295 for (i = min; i <= max; i++)
1298 /* mark the range as done, and continue */
1304 /* range begins (ignore - as first or last char) */
1305 else if (*s == '-' && s+1 < send && s != start) {
1307 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1310 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1322 /* if we get here, we're not doing a transliteration */
1324 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1325 except for the last char, which will be done separately. */
1326 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1328 while (s < send && *s != ')')
1329 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1331 else if (s[2] == '{' /* This should match regcomp.c */
1332 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1335 char *regparse = s + (s[2] == '{' ? 3 : 4);
1338 while (count && (c = *regparse)) {
1339 if (c == '\\' && regparse[1])
1347 if (*regparse != ')') {
1348 regparse--; /* Leave one char for continuation. */
1349 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1351 while (s < regparse)
1352 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1356 /* likewise skip #-initiated comments in //x patterns */
1357 else if (*s == '#' && PL_lex_inpat &&
1358 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1359 while (s+1 < send && *s != '\n')
1360 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1363 /* check for embedded arrays
1364 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1366 else if (*s == '@' && s[1]
1367 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1370 /* check for embedded scalars. only stop if we're sure it's a
1373 else if (*s == '$') {
1374 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1376 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1377 break; /* in regexp, $ might be tail anchor */
1380 /* End of else if chain - OP_TRANS rejoin rest */
1383 if (*s == '\\' && s+1 < send) {
1386 /* some backslashes we leave behind */
1387 if (*leaveit && *s && strchr(leaveit, *s)) {
1388 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1389 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1393 /* deprecate \1 in strings and substitution replacements */
1394 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1395 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1397 if (ckWARN(WARN_SYNTAX))
1398 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1403 /* string-change backslash escapes */
1404 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1409 /* if we get here, it's either a quoted -, or a digit */
1412 /* quoted - in transliterations */
1414 if (PL_lex_inwhat == OP_TRANS) {
1421 if (ckWARN(WARN_MISC) &&
1424 Perl_warner(aTHX_ packWARN(WARN_MISC),
1425 "Unrecognized escape \\%c passed through",
1427 /* default action is to copy the quoted character */
1428 goto default_action;
1431 /* \132 indicates an octal constant */
1432 case '0': case '1': case '2': case '3':
1433 case '4': case '5': case '6': case '7':
1437 uv = grok_oct(s, &len, &flags, NULL);
1440 goto NUM_ESCAPE_INSERT;
1442 /* \x24 indicates a hex constant */
1446 char* e = strchr(s, '}');
1447 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1448 PERL_SCAN_DISALLOW_PREFIX;
1453 yyerror("Missing right brace on \\x{}");
1457 uv = grok_hex(s, &len, &flags, NULL);
1463 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1464 uv = grok_hex(s, &len, &flags, NULL);
1470 /* Insert oct or hex escaped character.
1471 * There will always enough room in sv since such
1472 * escapes will be longer than any UTF-8 sequence
1473 * they can end up as. */
1475 /* We need to map to chars to ASCII before doing the tests
1478 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1479 if (!has_utf8 && uv > 255) {
1480 /* Might need to recode whatever we have
1481 * accumulated so far if it contains any
1484 * (Can't we keep track of that and avoid
1485 * this rescan? --jhi)
1489 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1490 if (!NATIVE_IS_INVARIANT(*c)) {
1495 STRLEN offset = d - SvPVX(sv);
1497 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1501 while (src >= (U8 *)SvPVX(sv)) {
1502 if (!NATIVE_IS_INVARIANT(*src)) {
1503 U8 ch = NATIVE_TO_ASCII(*src);
1504 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1505 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1515 if (has_utf8 || uv > 255) {
1516 d = (char*)uvchr_to_utf8((U8*)d, uv);
1518 if (PL_lex_inwhat == OP_TRANS &&
1519 PL_sublex_info.sub_op) {
1520 PL_sublex_info.sub_op->op_private |=
1521 (PL_lex_repl ? OPpTRANS_FROM_UTF
1534 /* \N{LATIN SMALL LETTER A} is a named character */
1538 char* e = strchr(s, '}');
1544 yyerror("Missing right brace on \\N{}");
1548 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1550 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1551 PERL_SCAN_DISALLOW_PREFIX;
1554 uv = grok_hex(s, &len, &flags, NULL);
1556 goto NUM_ESCAPE_INSERT;
1558 res = newSVpvn(s + 1, e - s - 1);
1559 res = new_constant( Nullch, 0, "charnames",
1560 res, Nullsv, "\\N{...}" );
1562 sv_utf8_upgrade(res);
1563 str = SvPV(res,len);
1564 #ifdef EBCDIC_NEVER_MIND
1565 /* charnames uses pack U and that has been
1566 * recently changed to do the below uni->native
1567 * mapping, so this would be redundant (and wrong,
1568 * the code point would be doubly converted).
1569 * But leave this in just in case the pack U change
1570 * gets revoked, but the semantics is still
1571 * desireable for charnames. --jhi */
1573 UV uv = utf8_to_uvchr((U8*)str, 0);
1576 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1578 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1579 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1580 str = SvPV(res, len);
1584 if (!has_utf8 && SvUTF8(res)) {
1585 char *ostart = SvPVX(sv);
1586 SvCUR_set(sv, d - ostart);
1589 sv_utf8_upgrade(sv);
1590 /* this just broke our allocation above... */
1591 SvGROW(sv, (STRLEN)(send - start));
1592 d = SvPVX(sv) + SvCUR(sv);
1595 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1596 char *odest = SvPVX(sv);
1598 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1599 d = SvPVX(sv) + (d - odest);
1601 Copy(str, d, len, char);
1608 yyerror("Missing braces on \\N{}");
1611 /* \c is a control character */
1620 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1623 yyerror("Missing control char name in \\c");
1627 /* printf-style backslashes, formfeeds, newlines, etc */
1629 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1632 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1635 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1638 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1641 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1644 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1647 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1653 } /* end if (backslash) */
1656 /* If we started with encoded form, or already know we want it
1657 and then encode the next character */
1658 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1660 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1661 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1664 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1665 STRLEN off = d - SvPVX(sv);
1666 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1668 d = (char*)uvchr_to_utf8((U8*)d, uv);
1672 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1674 } /* while loop to process each character */
1676 /* terminate the string and set up the sv */
1678 SvCUR_set(sv, d - SvPVX(sv));
1679 if (SvCUR(sv) >= SvLEN(sv))
1680 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1683 if (PL_encoding && !has_utf8) {
1684 sv_recode_to_utf8(sv, PL_encoding);
1690 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1691 PL_sublex_info.sub_op->op_private |=
1692 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1696 /* shrink the sv if we allocated more than we used */
1697 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1698 SvLEN_set(sv, SvCUR(sv) + 1);
1699 Renew(SvPVX(sv), SvLEN(sv), char);
1702 /* return the substring (via yylval) only if we parsed anything */
1703 if (s > PL_bufptr) {
1704 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1705 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1707 ( PL_lex_inwhat == OP_TRANS
1709 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1712 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1719 * Returns TRUE if there's more to the expression (e.g., a subscript),
1722 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1724 * ->[ and ->{ return TRUE
1725 * { and [ outside a pattern are always subscripts, so return TRUE
1726 * if we're outside a pattern and it's not { or [, then return FALSE
1727 * if we're in a pattern and the first char is a {
1728 * {4,5} (any digits around the comma) returns FALSE
1729 * if we're in a pattern and the first char is a [
1731 * [SOMETHING] has a funky algorithm to decide whether it's a
1732 * character class or not. It has to deal with things like
1733 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1734 * anything else returns TRUE
1737 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1740 S_intuit_more(pTHX_ register char *s)
1742 if (PL_lex_brackets)
1744 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1746 if (*s != '{' && *s != '[')
1751 /* In a pattern, so maybe we have {n,m}. */
1768 /* On the other hand, maybe we have a character class */
1771 if (*s == ']' || *s == '^')
1774 /* this is terrifying, and it works */
1775 int weight = 2; /* let's weigh the evidence */
1777 unsigned char un_char = 255, last_un_char;
1778 char *send = strchr(s,']');
1779 char tmpbuf[sizeof PL_tokenbuf * 4];
1781 if (!send) /* has to be an expression */
1784 Zero(seen,256,char);
1787 else if (isDIGIT(*s)) {
1789 if (isDIGIT(s[1]) && s[2] == ']')
1795 for (; s < send; s++) {
1796 last_un_char = un_char;
1797 un_char = (unsigned char)*s;
1802 weight -= seen[un_char] * 10;
1803 if (isALNUM_lazy_if(s+1,UTF)) {
1804 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1805 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1810 else if (*s == '$' && s[1] &&
1811 strchr("[#!%*<>()-=",s[1])) {
1812 if (/*{*/ strchr("])} =",s[2]))
1821 if (strchr("wds]",s[1]))
1823 else if (seen['\''] || seen['"'])
1825 else if (strchr("rnftbxcav",s[1]))
1827 else if (isDIGIT(s[1])) {
1829 while (s[1] && isDIGIT(s[1]))
1839 if (strchr("aA01! ",last_un_char))
1841 if (strchr("zZ79~",s[1]))
1843 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1844 weight -= 5; /* cope with negative subscript */
1847 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1848 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1853 if (keyword(tmpbuf, d - tmpbuf))
1856 if (un_char == last_un_char + 1)
1858 weight -= seen[un_char];
1863 if (weight >= 0) /* probably a character class */
1873 * Does all the checking to disambiguate
1875 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1876 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1878 * First argument is the stuff after the first token, e.g. "bar".
1880 * Not a method if bar is a filehandle.
1881 * Not a method if foo is a subroutine prototyped to take a filehandle.
1882 * Not a method if it's really "Foo $bar"
1883 * Method if it's "foo $bar"
1884 * Not a method if it's really "print foo $bar"
1885 * Method if it's really "foo package::" (interpreted as package->foo)
1886 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1887 * Not a method if bar is a filehandle or package, but is quoted with
1892 S_intuit_method(pTHX_ char *start, GV *gv)
1894 char *s = start + (*start == '$');
1895 char tmpbuf[sizeof PL_tokenbuf];
1903 if ((cv = GvCVu(gv))) {
1904 char *proto = SvPVX(cv);
1914 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1915 /* start is the beginning of the possible filehandle/object,
1916 * and s is the end of it
1917 * tmpbuf is a copy of it
1920 if (*start == '$') {
1921 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1926 return *s == '(' ? FUNCMETH : METHOD;
1928 if (!keyword(tmpbuf, len)) {
1929 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1934 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1935 if (indirgv && GvCVu(indirgv))
1937 /* filehandle or package name makes it a method */
1938 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1940 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1941 return 0; /* no assumptions -- "=>" quotes bearword */
1943 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1944 newSVpvn(tmpbuf,len));
1945 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1949 return *s == '(' ? FUNCMETH : METHOD;
1957 * Return a string of Perl code to load the debugger. If PERL5DB
1958 * is set, it will return the contents of that, otherwise a
1959 * compile-time require of perl5db.pl.
1966 char *pdb = PerlEnv_getenv("PERL5DB");
1970 SETERRNO(0,SS_NORMAL);
1971 return "BEGIN { require 'perl5db.pl' }";
1977 /* Encoded script support. filter_add() effectively inserts a
1978 * 'pre-processing' function into the current source input stream.
1979 * Note that the filter function only applies to the current source file
1980 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1982 * The datasv parameter (which may be NULL) can be used to pass
1983 * private data to this instance of the filter. The filter function
1984 * can recover the SV using the FILTER_DATA macro and use it to
1985 * store private buffers and state information.
1987 * The supplied datasv parameter is upgraded to a PVIO type
1988 * and the IoDIRP/IoANY field is used to store the function pointer,
1989 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1990 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1991 * private use must be set using malloc'd pointers.
1995 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2000 if (!PL_rsfp_filters)
2001 PL_rsfp_filters = newAV();
2003 datasv = NEWSV(255,0);
2004 if (!SvUPGRADE(datasv, SVt_PVIO))
2005 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2006 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2007 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2008 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2009 (void*)funcp, SvPV_nolen(datasv)));
2010 av_unshift(PL_rsfp_filters, 1);
2011 av_store(PL_rsfp_filters, 0, datasv) ;
2016 /* Delete most recently added instance of this filter function. */
2018 Perl_filter_del(pTHX_ filter_t funcp)
2021 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2022 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2024 /* if filter is on top of stack (usual case) just pop it off */
2025 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2026 if (IoANY(datasv) == (void *)funcp) {
2027 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2028 IoANY(datasv) = (void *)NULL;
2029 sv_free(av_pop(PL_rsfp_filters));
2033 /* we need to search for the correct entry and clear it */
2034 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2038 /* Invoke the n'th filter function for the current rsfp. */
2040 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2043 /* 0 = read one text line */
2048 if (!PL_rsfp_filters)
2050 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2051 /* Provide a default input filter to make life easy. */
2052 /* Note that we append to the line. This is handy. */
2053 DEBUG_P(PerlIO_printf(Perl_debug_log,
2054 "filter_read %d: from rsfp\n", idx));
2058 int old_len = SvCUR(buf_sv) ;
2060 /* ensure buf_sv is large enough */
2061 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2062 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2063 if (PerlIO_error(PL_rsfp))
2064 return -1; /* error */
2066 return 0 ; /* end of file */
2068 SvCUR_set(buf_sv, old_len + len) ;
2071 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2072 if (PerlIO_error(PL_rsfp))
2073 return -1; /* error */
2075 return 0 ; /* end of file */
2078 return SvCUR(buf_sv);
2080 /* Skip this filter slot if filter has been deleted */
2081 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2082 DEBUG_P(PerlIO_printf(Perl_debug_log,
2083 "filter_read %d: skipped (filter deleted)\n",
2085 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2087 /* Get function pointer hidden within datasv */
2088 funcp = (filter_t)IoANY(datasv);
2089 DEBUG_P(PerlIO_printf(Perl_debug_log,
2090 "filter_read %d: via function %p (%s)\n",
2091 idx, (void*)funcp, SvPV_nolen(datasv)));
2092 /* Call function. The function is expected to */
2093 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2094 /* Return: <0:error, =0:eof, >0:not eof */
2095 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2099 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2101 #ifdef PERL_CR_FILTER
2102 if (!PL_rsfp_filters) {
2103 filter_add(S_cr_textfilter,NULL);
2106 if (PL_rsfp_filters) {
2109 SvCUR_set(sv, 0); /* start with empty line */
2110 if (FILTER_READ(0, sv, 0) > 0)
2111 return ( SvPVX(sv) ) ;
2116 return (sv_gets(sv, fp, append));
2120 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2124 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2128 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2129 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2131 return GvHV(gv); /* Foo:: */
2134 /* use constant CLASS => 'MyClass' */
2135 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2137 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2138 pkgname = SvPV_nolen(sv);
2142 return gv_stashpv(pkgname, FALSE);
2146 static char* exp_name[] =
2147 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2148 "ATTRTERM", "TERMBLOCK"
2155 Works out what to call the token just pulled out of the input
2156 stream. The yacc parser takes care of taking the ops we return and
2157 stitching them into a tree.
2163 if read an identifier
2164 if we're in a my declaration
2165 croak if they tried to say my($foo::bar)
2166 build the ops for a my() declaration
2167 if it's an access to a my() variable
2168 are we in a sort block?
2169 croak if my($a); $a <=> $b
2170 build ops for access to a my() variable
2171 if in a dq string, and they've said @foo and we can't find @foo
2173 build ops for a bareword
2174 if we already built the token before, use it.
2177 #ifdef USE_PURE_BISON
2179 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2184 yylval_pointer[yyactlevel] = lvalp;
2185 yychar_pointer[yyactlevel] = lcharp;
2186 if (yyactlevel >= YYMAXLEVEL)
2187 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2189 r = Perl_yylex(aTHX);
2199 #pragma segment Perl_yylex
2212 /* check if there's an identifier for us to look at */
2213 if (PL_pending_ident)
2214 return S_pending_ident(aTHX);
2216 /* no identifier pending identification */
2218 switch (PL_lex_state) {
2220 case LEX_NORMAL: /* Some compilers will produce faster */
2221 case LEX_INTERPNORMAL: /* code if we comment these out. */
2225 /* when we've already built the next token, just pull it out of the queue */
2228 yylval = PL_nextval[PL_nexttoke];
2230 PL_lex_state = PL_lex_defer;
2231 PL_expect = PL_lex_expect;
2232 PL_lex_defer = LEX_NORMAL;
2234 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2235 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2236 (IV)PL_nexttype[PL_nexttoke]); });
2238 return(PL_nexttype[PL_nexttoke]);
2240 /* interpolated case modifiers like \L \U, including \Q and \E.
2241 when we get here, PL_bufptr is at the \
2243 case LEX_INTERPCASEMOD:
2245 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2246 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2248 /* handle \E or end of string */
2249 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2253 if (PL_lex_casemods) {
2254 oldmod = PL_lex_casestack[--PL_lex_casemods];
2255 PL_lex_casestack[PL_lex_casemods] = '\0';
2257 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2259 PL_lex_state = LEX_INTERPCONCAT;
2263 if (PL_bufptr != PL_bufend)
2265 PL_lex_state = LEX_INTERPCONCAT;
2269 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2270 "### Saw case modifier at '%s'\n", PL_bufptr); });
2272 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2273 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2274 if (strchr("LU", *s) &&
2275 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2277 PL_lex_casestack[--PL_lex_casemods] = '\0';
2280 if (PL_lex_casemods > 10) {
2281 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2282 if (newlb != PL_lex_casestack) {
2284 PL_lex_casestack = newlb;
2287 PL_lex_casestack[PL_lex_casemods++] = *s;
2288 PL_lex_casestack[PL_lex_casemods] = '\0';
2289 PL_lex_state = LEX_INTERPCONCAT;
2290 PL_nextval[PL_nexttoke].ival = 0;
2293 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2295 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2297 PL_nextval[PL_nexttoke].ival = OP_LC;
2299 PL_nextval[PL_nexttoke].ival = OP_UC;
2301 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2303 Perl_croak(aTHX_ "panic: yylex");
2306 if (PL_lex_starts) {
2315 case LEX_INTERPPUSH:
2316 return sublex_push();
2318 case LEX_INTERPSTART:
2319 if (PL_bufptr == PL_bufend)
2320 return sublex_done();
2321 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2322 "### Interpolated variable at '%s'\n", PL_bufptr); });
2324 PL_lex_dojoin = (*PL_bufptr == '@');
2325 PL_lex_state = LEX_INTERPNORMAL;
2326 if (PL_lex_dojoin) {
2327 PL_nextval[PL_nexttoke].ival = 0;
2329 force_ident("\"", '$');
2330 PL_nextval[PL_nexttoke].ival = 0;
2332 PL_nextval[PL_nexttoke].ival = 0;
2334 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2337 if (PL_lex_starts++) {
2343 case LEX_INTERPENDMAYBE:
2344 if (intuit_more(PL_bufptr)) {
2345 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2351 if (PL_lex_dojoin) {
2352 PL_lex_dojoin = FALSE;
2353 PL_lex_state = LEX_INTERPCONCAT;
2356 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2357 && SvEVALED(PL_lex_repl))
2359 if (PL_bufptr != PL_bufend)
2360 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2361 PL_lex_repl = Nullsv;
2364 case LEX_INTERPCONCAT:
2366 if (PL_lex_brackets)
2367 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2369 if (PL_bufptr == PL_bufend)
2370 return sublex_done();
2372 if (SvIVX(PL_linestr) == '\'') {
2373 SV *sv = newSVsv(PL_linestr);
2376 else if ( PL_hints & HINT_NEW_RE )
2377 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2378 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2382 s = scan_const(PL_bufptr);
2384 PL_lex_state = LEX_INTERPCASEMOD;
2386 PL_lex_state = LEX_INTERPSTART;
2389 if (s != PL_bufptr) {
2390 PL_nextval[PL_nexttoke] = yylval;
2393 if (PL_lex_starts++)
2403 PL_lex_state = LEX_NORMAL;
2404 s = scan_formline(PL_bufptr);
2405 if (!PL_lex_formbrack)
2411 PL_oldoldbufptr = PL_oldbufptr;
2414 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2415 exp_name[PL_expect], s);
2421 if (isIDFIRST_lazy_if(s,UTF))
2423 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2426 goto fake_eof; /* emulate EOF on ^D or ^Z */
2431 if (PL_lex_brackets)
2432 yyerror("Missing right curly or square bracket");
2433 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2434 "### Tokener got EOF\n");
2438 if (s++ < PL_bufend)
2439 goto retry; /* ignore stray nulls */
2442 if (!PL_in_eval && !PL_preambled) {
2443 PL_preambled = TRUE;
2444 sv_setpv(PL_linestr,incl_perldb());
2445 if (SvCUR(PL_linestr))
2446 sv_catpv(PL_linestr,";");
2448 while(AvFILLp(PL_preambleav) >= 0) {
2449 SV *tmpsv = av_shift(PL_preambleav);
2450 sv_catsv(PL_linestr, tmpsv);
2451 sv_catpv(PL_linestr, ";");
2454 sv_free((SV*)PL_preambleav);
2455 PL_preambleav = NULL;
2457 if (PL_minus_n || PL_minus_p) {
2458 sv_catpv(PL_linestr, "LINE: while (<>) {");
2460 sv_catpv(PL_linestr,"chomp;");
2463 if (strchr("/'\"", *PL_splitstr)
2464 && strchr(PL_splitstr + 1, *PL_splitstr))
2465 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2468 s = "'~#\200\1'"; /* surely one char is unused...*/
2469 while (s[1] && strchr(PL_splitstr, *s)) s++;
2471 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2472 "q" + (delim == '\''), delim);
2473 for (s = PL_splitstr; *s; s++) {
2475 sv_catpvn(PL_linestr, "\\", 1);
2476 sv_catpvn(PL_linestr, s, 1);
2478 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2482 sv_catpv(PL_linestr,"our @F=split(' ');");
2485 sv_catpv(PL_linestr, "\n");
2486 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2487 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2488 PL_last_lop = PL_last_uni = Nullch;
2489 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2490 SV *sv = NEWSV(85,0);
2492 sv_upgrade(sv, SVt_PVMG);
2493 sv_setsv(sv,PL_linestr);
2496 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2501 bof = PL_rsfp ? TRUE : FALSE;
2502 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2505 if (PL_preprocess && !PL_in_eval)
2506 (void)PerlProc_pclose(PL_rsfp);
2507 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2508 PerlIO_clearerr(PL_rsfp);
2510 (void)PerlIO_close(PL_rsfp);
2512 PL_doextract = FALSE;
2514 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2515 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2516 sv_catpv(PL_linestr,";}");
2517 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2518 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2519 PL_last_lop = PL_last_uni = Nullch;
2520 PL_minus_n = PL_minus_p = 0;
2523 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2524 PL_last_lop = PL_last_uni = Nullch;
2525 sv_setpv(PL_linestr,"");
2526 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2528 /* if it looks like the start of a BOM, check if it in fact is */
2529 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2530 #ifdef PERLIO_IS_STDIO
2531 # ifdef __GNU_LIBRARY__
2532 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2533 # define FTELL_FOR_PIPE_IS_BROKEN
2537 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2538 # define FTELL_FOR_PIPE_IS_BROKEN
2543 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2544 /* This loses the possibility to detect the bof
2545 * situation on perl -P when the libc5 is being used.
2546 * Workaround? Maybe attach some extra state to PL_rsfp?
2549 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2551 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2554 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2555 s = swallow_bom((U8*)s);
2559 /* Incest with pod. */
2560 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2561 sv_setpv(PL_linestr, "");
2562 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2563 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2564 PL_last_lop = PL_last_uni = Nullch;
2565 PL_doextract = FALSE;
2569 } while (PL_doextract);
2570 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2571 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2572 SV *sv = NEWSV(85,0);
2574 sv_upgrade(sv, SVt_PVMG);
2575 sv_setsv(sv,PL_linestr);
2578 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2580 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2581 PL_last_lop = PL_last_uni = Nullch;
2582 if (CopLINE(PL_curcop) == 1) {
2583 while (s < PL_bufend && isSPACE(*s))
2585 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2589 if (*s == '#' && *(s+1) == '!')
2591 #ifdef ALTERNATE_SHEBANG
2593 static char as[] = ALTERNATE_SHEBANG;
2594 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2595 d = s + (sizeof(as) - 1);
2597 #endif /* ALTERNATE_SHEBANG */
2606 while (*d && !isSPACE(*d))
2610 #ifdef ARG_ZERO_IS_SCRIPT
2611 if (ipathend > ipath) {
2613 * HP-UX (at least) sets argv[0] to the script name,
2614 * which makes $^X incorrect. And Digital UNIX and Linux,
2615 * at least, set argv[0] to the basename of the Perl
2616 * interpreter. So, having found "#!", we'll set it right.
2618 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2619 assert(SvPOK(x) || SvGMAGICAL(x));
2620 if (sv_eq(x, CopFILESV(PL_curcop))) {
2621 sv_setpvn(x, ipath, ipathend - ipath);
2627 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2628 char *lstart = SvPV(x,llen);
2630 bstart += blen - llen;
2631 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2632 sv_setpvn(x, ipath, ipathend - ipath);
2637 TAINT_NOT; /* $^X is always tainted, but that's OK */
2639 #endif /* ARG_ZERO_IS_SCRIPT */
2644 d = instr(s,"perl -");
2646 d = instr(s,"perl");
2648 /* avoid getting into infinite loops when shebang
2649 * line contains "Perl" rather than "perl" */
2651 for (d = ipathend-4; d >= ipath; --d) {
2652 if ((*d == 'p' || *d == 'P')
2653 && !ibcmp(d, "perl", 4))
2663 #ifdef ALTERNATE_SHEBANG
2665 * If the ALTERNATE_SHEBANG on this system starts with a
2666 * character that can be part of a Perl expression, then if
2667 * we see it but not "perl", we're probably looking at the
2668 * start of Perl code, not a request to hand off to some
2669 * other interpreter. Similarly, if "perl" is there, but
2670 * not in the first 'word' of the line, we assume the line
2671 * contains the start of the Perl program.
2673 if (d && *s != '#') {
2675 while (*c && !strchr("; \t\r\n\f\v#", *c))
2678 d = Nullch; /* "perl" not in first word; ignore */
2680 *s = '#'; /* Don't try to parse shebang line */
2682 #endif /* ALTERNATE_SHEBANG */
2683 #ifndef MACOS_TRADITIONAL
2688 !instr(s,"indir") &&
2689 instr(PL_origargv[0],"perl"))
2695 while (s < PL_bufend && isSPACE(*s))
2697 if (s < PL_bufend) {
2698 Newz(899,newargv,PL_origargc+3,char*);
2700 while (s < PL_bufend && !isSPACE(*s))
2703 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2706 newargv = PL_origargv;
2708 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2709 Perl_croak(aTHX_ "Can't exec %s", ipath);
2713 U32 oldpdb = PL_perldb;
2714 bool oldn = PL_minus_n;
2715 bool oldp = PL_minus_p;
2717 while (*d && !isSPACE(*d)) d++;
2718 while (SPACE_OR_TAB(*d)) d++;
2721 bool switches_done = PL_doswitches;
2723 if (*d == 'M' || *d == 'm') {
2725 while (*d && !isSPACE(*d)) d++;
2726 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2729 d = moreswitches(d);
2731 if ((PERLDB_LINE && !oldpdb) ||
2732 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2733 /* if we have already added "LINE: while (<>) {",
2734 we must not do it again */
2736 sv_setpv(PL_linestr, "");
2737 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2738 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2739 PL_last_lop = PL_last_uni = Nullch;
2740 PL_preambled = FALSE;
2742 (void)gv_fetchfile(PL_origfilename);
2745 if (PL_doswitches && !switches_done) {
2746 int argc = PL_origargc;
2747 char **argv = PL_origargv;
2750 } while (argc && argv[0][0] == '-' && argv[0][1]);
2751 init_argv_symbols(argc,argv);
2757 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2759 PL_lex_state = LEX_FORMLINE;
2764 #ifdef PERL_STRICT_CR
2765 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2767 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2769 case ' ': case '\t': case '\f': case 013:
2770 #ifdef MACOS_TRADITIONAL
2777 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2778 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2779 /* handle eval qq[#line 1 "foo"\n ...] */
2780 CopLINE_dec(PL_curcop);
2784 while (s < d && *s != '\n')
2788 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2789 Perl_croak(aTHX_ "panic: input overflow");
2791 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2793 PL_lex_state = LEX_FORMLINE;
2803 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2810 while (s < PL_bufend && SPACE_OR_TAB(*s))
2813 if (strnEQ(s,"=>",2)) {
2814 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2815 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2816 "### Saw unary minus before =>, forcing word '%s'\n", s);
2818 OPERATOR('-'); /* unary minus */
2820 PL_last_uni = PL_oldbufptr;
2822 case 'r': ftst = OP_FTEREAD; break;
2823 case 'w': ftst = OP_FTEWRITE; break;
2824 case 'x': ftst = OP_FTEEXEC; break;
2825 case 'o': ftst = OP_FTEOWNED; break;
2826 case 'R': ftst = OP_FTRREAD; break;
2827 case 'W': ftst = OP_FTRWRITE; break;
2828 case 'X': ftst = OP_FTREXEC; break;
2829 case 'O': ftst = OP_FTROWNED; break;
2830 case 'e': ftst = OP_FTIS; break;
2831 case 'z': ftst = OP_FTZERO; break;
2832 case 's': ftst = OP_FTSIZE; break;
2833 case 'f': ftst = OP_FTFILE; break;
2834 case 'd': ftst = OP_FTDIR; break;
2835 case 'l': ftst = OP_FTLINK; break;
2836 case 'p': ftst = OP_FTPIPE; break;
2837 case 'S': ftst = OP_FTSOCK; break;
2838 case 'u': ftst = OP_FTSUID; break;
2839 case 'g': ftst = OP_FTSGID; break;
2840 case 'k': ftst = OP_FTSVTX; break;
2841 case 'b': ftst = OP_FTBLK; break;
2842 case 'c': ftst = OP_FTCHR; break;
2843 case 't': ftst = OP_FTTTY; break;
2844 case 'T': ftst = OP_FTTEXT; break;
2845 case 'B': ftst = OP_FTBINARY; break;
2846 case 'M': case 'A': case 'C':
2847 gv_fetchpv("\024",TRUE, SVt_PV);
2849 case 'M': ftst = OP_FTMTIME; break;
2850 case 'A': ftst = OP_FTATIME; break;
2851 case 'C': ftst = OP_FTCTIME; break;
2859 PL_last_lop_op = (OPCODE)ftst;
2860 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2861 "### Saw file test %c\n", (int)ftst);
2866 /* Assume it was a minus followed by a one-letter named
2867 * subroutine call (or a -bareword), then. */
2868 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2869 "### %c looked like a file test but was not\n",
2878 if (PL_expect == XOPERATOR)
2883 else if (*s == '>') {
2886 if (isIDFIRST_lazy_if(s,UTF)) {
2887 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2895 if (PL_expect == XOPERATOR)
2898 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2900 OPERATOR('-'); /* unary minus */
2907 if (PL_expect == XOPERATOR)
2912 if (PL_expect == XOPERATOR)
2915 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2921 if (PL_expect != XOPERATOR) {
2922 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2923 PL_expect = XOPERATOR;
2924 force_ident(PL_tokenbuf, '*');
2937 if (PL_expect == XOPERATOR) {
2941 PL_tokenbuf[0] = '%';
2942 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2943 if (!PL_tokenbuf[1]) {
2945 yyerror("Final % should be \\% or %name");
2948 PL_pending_ident = '%';
2967 switch (PL_expect) {
2970 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2972 PL_bufptr = s; /* update in case we back off */
2978 PL_expect = XTERMBLOCK;
2982 while (isIDFIRST_lazy_if(s,UTF)) {
2983 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2984 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2985 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 /* NOTE: any CV attrs applied here need to be part of
3023 the CVf_BUILTIN_ATTRS define in cv.h! */
3024 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3025 CvLVALUE_on(PL_compcv);
3026 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3027 CvLOCKED_on(PL_compcv);
3028 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3029 CvMETHOD_on(PL_compcv);
3031 else if (PL_in_my == KEY_our && len == 6 &&
3032 strnEQ(s, "unique", len))
3033 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3035 /* After we've set the flags, it could be argued that
3036 we don't need to do the attributes.pm-based setting
3037 process, and shouldn't bother appending recognized
3038 flags. To experiment with that, uncomment the
3039 following "else". (Note that's already been
3040 uncommented. That keeps the above-applied built-in
3041 attributes from being intercepted (and possibly
3042 rejected) by a package's attribute routines, but is
3043 justified by the performance win for the common case
3044 of applying only built-in attributes.) */
3046 attrs = append_elem(OP_LIST, attrs,
3047 newSVOP(OP_CONST, 0,
3051 if (*s == ':' && s[1] != ':')
3054 break; /* require real whitespace or :'s */
3056 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3057 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3058 char q = ((*s == '\'') ? '"' : '\'');
3059 /* If here for an expression, and parsed no attrs, back off. */
3060 if (tmp == '=' && !attrs) {
3064 /* MUST advance bufptr here to avoid bogus "at end of line"
3065 context messages from yyerror().
3069 yyerror("Unterminated attribute list");
3071 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3079 PL_nextval[PL_nexttoke].opval = attrs;
3087 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3088 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3104 if (PL_lex_brackets <= 0)
3105 yyerror("Unmatched right square bracket");
3108 if (PL_lex_state == LEX_INTERPNORMAL) {
3109 if (PL_lex_brackets == 0) {
3110 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3111 PL_lex_state = LEX_INTERPEND;
3118 if (PL_lex_brackets > 100) {
3119 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3120 if (newlb != PL_lex_brackstack) {
3122 PL_lex_brackstack = newlb;
3125 switch (PL_expect) {
3127 if (PL_lex_formbrack) {
3131 if (PL_oldoldbufptr == PL_last_lop)
3132 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3134 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3135 OPERATOR(HASHBRACK);
3137 while (s < PL_bufend && SPACE_OR_TAB(*s))
3140 PL_tokenbuf[0] = '\0';
3141 if (d < PL_bufend && *d == '-') {
3142 PL_tokenbuf[0] = '-';
3144 while (d < PL_bufend && SPACE_OR_TAB(*d))
3147 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3148 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3150 while (d < PL_bufend && SPACE_OR_TAB(*d))
3153 char minus = (PL_tokenbuf[0] == '-');
3154 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3162 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3167 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3172 if (PL_oldoldbufptr == PL_last_lop)
3173 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3175 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3178 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3180 /* This hack is to get the ${} in the message. */
3182 yyerror("syntax error");
3185 OPERATOR(HASHBRACK);
3187 /* This hack serves to disambiguate a pair of curlies
3188 * as being a block or an anon hash. Normally, expectation
3189 * determines that, but in cases where we're not in a
3190 * position to expect anything in particular (like inside
3191 * eval"") we have to resolve the ambiguity. This code
3192 * covers the case where the first term in the curlies is a
3193 * quoted string. Most other cases need to be explicitly
3194 * disambiguated by prepending a `+' before the opening
3195 * curly in order to force resolution as an anon hash.
3197 * XXX should probably propagate the outer expectation
3198 * into eval"" to rely less on this hack, but that could
3199 * potentially break current behavior of eval"".
3203 if (*s == '\'' || *s == '"' || *s == '`') {
3204 /* common case: get past first string, handling escapes */
3205 for (t++; t < PL_bufend && *t != *s;)
3206 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3210 else if (*s == 'q') {
3213 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3217 char open, close, term;
3220 while (t < PL_bufend && isSPACE(*t))
3224 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3228 for (t++; t < PL_bufend; t++) {
3229 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3231 else if (*t == open)
3235 for (t++; t < PL_bufend; t++) {
3236 if (*t == '\\' && t+1 < PL_bufend)
3238 else if (*t == close && --brackets <= 0)
3240 else if (*t == open)
3246 else if (isALNUM_lazy_if(t,UTF)) {
3248 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3251 while (t < PL_bufend && isSPACE(*t))
3253 /* if comma follows first term, call it an anon hash */
3254 /* XXX it could be a comma expression with loop modifiers */
3255 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3256 || (*t == '=' && t[1] == '>')))
3257 OPERATOR(HASHBRACK);
3258 if (PL_expect == XREF)
3261 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3267 yylval.ival = CopLINE(PL_curcop);
3268 if (isSPACE(*s) || *s == '#')
3269 PL_copline = NOLINE; /* invalidate current command line number */
3274 if (PL_lex_brackets <= 0)
3275 yyerror("Unmatched right curly bracket");
3277 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3278 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3279 PL_lex_formbrack = 0;
3280 if (PL_lex_state == LEX_INTERPNORMAL) {
3281 if (PL_lex_brackets == 0) {
3282 if (PL_expect & XFAKEBRACK) {
3283 PL_expect &= XENUMMASK;
3284 PL_lex_state = LEX_INTERPEND;
3286 return yylex(); /* ignore fake brackets */
3288 if (*s == '-' && s[1] == '>')
3289 PL_lex_state = LEX_INTERPENDMAYBE;
3290 else if (*s != '[' && *s != '{')
3291 PL_lex_state = LEX_INTERPEND;
3294 if (PL_expect & XFAKEBRACK) {
3295 PL_expect &= XENUMMASK;
3297 return yylex(); /* ignore fake brackets */
3307 if (PL_expect == XOPERATOR) {
3308 if (ckWARN(WARN_SEMICOLON)
3309 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3311 CopLINE_dec(PL_curcop);
3312 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3313 CopLINE_inc(PL_curcop);
3318 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3320 PL_expect = XOPERATOR;
3321 force_ident(PL_tokenbuf, '&');
3325 yylval.ival = (OPpENTERSUB_AMPER<<8);
3344 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3345 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3347 if (PL_expect == XSTATE && isALPHA(tmp) &&
3348 (s == PL_linestart+1 || s[-2] == '\n') )
3350 if (PL_in_eval && !PL_rsfp) {
3355 if (strnEQ(s,"=cut",4)) {
3369 PL_doextract = TRUE;
3372 if (PL_lex_brackets < PL_lex_formbrack) {
3374 #ifdef PERL_STRICT_CR
3375 for (t = s; SPACE_OR_TAB(*t); t++) ;
3377 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3379 if (*t == '\n' || *t == '#') {
3397 if (PL_expect != XOPERATOR) {
3398 if (s[1] != '<' && !strchr(s,'>'))
3401 s = scan_heredoc(s);
3403 s = scan_inputsymbol(s);
3404 TERM(sublex_start());
3409 SHop(OP_LEFT_SHIFT);
3423 SHop(OP_RIGHT_SHIFT);
3432 if (PL_expect == XOPERATOR) {
3433 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3436 return ','; /* grandfather non-comma-format format */
3440 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3441 PL_tokenbuf[0] = '@';
3442 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3443 sizeof PL_tokenbuf - 1, FALSE);
3444 if (PL_expect == XOPERATOR)
3445 no_op("Array length", s);
3446 if (!PL_tokenbuf[1])
3448 PL_expect = XOPERATOR;
3449 PL_pending_ident = '#';
3453 PL_tokenbuf[0] = '$';
3454 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3455 sizeof PL_tokenbuf - 1, FALSE);
3456 if (PL_expect == XOPERATOR)
3458 if (!PL_tokenbuf[1]) {
3460 yyerror("Final $ should be \\$ or $name");
3464 /* This kludge not intended to be bulletproof. */
3465 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3466 yylval.opval = newSVOP(OP_CONST, 0,
3467 newSViv(PL_compiling.cop_arybase));
3468 yylval.opval->op_private = OPpCONST_ARYBASE;
3474 if (PL_lex_state == LEX_NORMAL)
3477 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3480 PL_tokenbuf[0] = '@';
3481 if (ckWARN(WARN_SYNTAX)) {
3483 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3486 PL_bufptr = skipspace(PL_bufptr);
3487 while (t < PL_bufend && *t != ']')
3489 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3490 "Multidimensional syntax %.*s not supported",
3491 (t - PL_bufptr) + 1, PL_bufptr);
3495 else if (*s == '{') {
3496 PL_tokenbuf[0] = '%';
3497 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3498 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3500 char tmpbuf[sizeof PL_tokenbuf];
3502 for (t++; isSPACE(*t); t++) ;
3503 if (isIDFIRST_lazy_if(t,UTF)) {
3504 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3505 for (; isSPACE(*t); t++) ;
3506 if (*t == ';' && get_cv(tmpbuf, FALSE))
3507 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3508 "You need to quote \"%s\"", tmpbuf);
3514 PL_expect = XOPERATOR;
3515 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3516 bool islop = (PL_last_lop == PL_oldoldbufptr);
3517 if (!islop || PL_last_lop_op == OP_GREPSTART)
3518 PL_expect = XOPERATOR;
3519 else if (strchr("$@\"'`q", *s))
3520 PL_expect = XTERM; /* e.g. print $fh "foo" */
3521 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3522 PL_expect = XTERM; /* e.g. print $fh &sub */
3523 else if (isIDFIRST_lazy_if(s,UTF)) {
3524 char tmpbuf[sizeof PL_tokenbuf];
3525 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3526 if ((tmp = keyword(tmpbuf, len))) {
3527 /* binary operators exclude handle interpretations */
3539 PL_expect = XTERM; /* e.g. print $fh length() */
3544 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3545 if (gv && GvCVu(gv))
3546 PL_expect = XTERM; /* e.g. print $fh subr() */
3549 else if (isDIGIT(*s))
3550 PL_expect = XTERM; /* e.g. print $fh 3 */
3551 else if (*s == '.' && isDIGIT(s[1]))
3552 PL_expect = XTERM; /* e.g. print $fh .3 */
3553 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3554 PL_expect = XTERM; /* e.g. print $fh -1 */
3555 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3556 PL_expect = XTERM; /* e.g. print $fh /.../
3557 XXX except DORDOR operator */
3558 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3559 PL_expect = XTERM; /* print $fh <<"EOF" */
3561 PL_pending_ident = '$';
3565 if (PL_expect == XOPERATOR)
3567 PL_tokenbuf[0] = '@';
3568 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3569 if (!PL_tokenbuf[1]) {
3571 yyerror("Final @ should be \\@ or @name");
3574 if (PL_lex_state == LEX_NORMAL)
3576 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3578 PL_tokenbuf[0] = '%';
3580 /* Warn about @ where they meant $. */
3581 if (ckWARN(WARN_SYNTAX)) {
3582 if (*s == '[' || *s == '{') {
3584 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3586 if (*t == '}' || *t == ']') {
3588 PL_bufptr = skipspace(PL_bufptr);
3589 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3590 "Scalar value %.*s better written as $%.*s",
3591 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3596 PL_pending_ident = '@';
3599 case '/': /* may be division, defined-or, or pattern */
3600 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3604 case '?': /* may either be conditional or pattern */
3605 if(PL_expect == XOPERATOR) {
3613 /* A // operator. */
3623 /* Disable warning on "study /blah/" */
3624 if (PL_oldoldbufptr == PL_last_uni
3625 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3626 || memNE(PL_last_uni, "study", 5)
3627 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3630 s = scan_pat(s,OP_MATCH);
3631 TERM(sublex_start());
3635 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3636 #ifdef PERL_STRICT_CR
3639 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3641 && (s == PL_linestart || s[-1] == '\n') )
3643 PL_lex_formbrack = 0;
3647 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3653 yylval.ival = OPf_SPECIAL;
3659 if (PL_expect != XOPERATOR)
3664 case '0': case '1': case '2': case '3': case '4':
3665 case '5': case '6': case '7': case '8': case '9':
3666 s = scan_num(s, &yylval);
3667 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3668 "### Saw number in '%s'\n", s);
3670 if (PL_expect == XOPERATOR)
3675 s = scan_str(s,FALSE,FALSE);
3676 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3677 "### Saw string before '%s'\n", s);
3679 if (PL_expect == XOPERATOR) {
3680 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3683 return ','; /* grandfather non-comma-format format */
3689 missingterm((char*)0);
3690 yylval.ival = OP_CONST;
3691 TERM(sublex_start());
3694 s = scan_str(s,FALSE,FALSE);
3695 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3696 "### Saw string before '%s'\n", s);
3698 if (PL_expect == XOPERATOR) {
3699 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3702 return ','; /* grandfather non-comma-format format */
3708 missingterm((char*)0);
3709 yylval.ival = OP_CONST;
3710 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3711 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3712 yylval.ival = OP_STRINGIFY;
3716 TERM(sublex_start());
3719 s = scan_str(s,FALSE,FALSE);
3720 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3721 "### Saw backtick string before '%s'\n", s);
3723 if (PL_expect == XOPERATOR)
3724 no_op("Backticks",s);
3726 missingterm((char*)0);
3727 yylval.ival = OP_BACKTICK;
3729 TERM(sublex_start());
3733 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3734 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3736 if (PL_expect == XOPERATOR)
3737 no_op("Backslash",s);
3741 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3745 while (isDIGIT(*start) || *start == '_')
3747 if (*start == '.' && isDIGIT(start[1])) {
3748 s = scan_num(s, &yylval);
3751 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3752 else if (!isALPHA(*start) && (PL_expect == XTERM
3753 || PL_expect == XREF || PL_expect == XSTATE
3754 || PL_expect == XTERMORDORDOR)) {
3758 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3761 s = scan_num(s, &yylval);
3768 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3803 I32 orig_keyword = 0;
3808 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3810 /* Some keywords can be followed by any delimiter, including ':' */
3811 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3812 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3813 (PL_tokenbuf[0] == 'q' &&
3814 strchr("qwxr", PL_tokenbuf[1])))));
3816 /* x::* is just a word, unless x is "CORE" */
3817 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3821 while (d < PL_bufend && isSPACE(*d))
3822 d++; /* no comments skipped here, or s### is misparsed */
3824 /* Is this a label? */
3825 if (!tmp && PL_expect == XSTATE
3826 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3828 yylval.pval = savepv(PL_tokenbuf);
3833 /* Check for keywords */
3834 tmp = keyword(PL_tokenbuf, len);
3836 /* Is this a word before a => operator? */
3837 if (*d == '=' && d[1] == '>') {
3839 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3840 yylval.opval->op_private = OPpCONST_BARE;
3841 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3842 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3846 if (tmp < 0) { /* second-class keyword? */
3847 GV *ogv = Nullgv; /* override (winner) */
3848 GV *hgv = Nullgv; /* hidden (loser) */
3849 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3851 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3854 if (GvIMPORTED_CV(gv))
3856 else if (! CvMETHOD(cv))
3860 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3861 (gv = *gvp) != (GV*)&PL_sv_undef &&
3862 GvCVu(gv) && GvIMPORTED_CV(gv))
3869 tmp = 0; /* overridden by import or by GLOBAL */
3872 && -tmp==KEY_lock /* XXX generalizable kludge */
3874 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3876 tmp = 0; /* any sub overrides "weak" keyword */
3878 else { /* no override */
3880 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3881 Perl_warner(aTHX_ packWARN(WARN_MISC),
3882 "dump() better written as CORE::dump()");
3886 if (ckWARN(WARN_AMBIGUOUS) && hgv
3887 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3888 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3889 "Ambiguous call resolved as CORE::%s(), %s",
3890 GvENAME(hgv), "qualify as such or use &");
3897 default: /* not a keyword */
3901 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3903 /* Get the rest if it looks like a package qualifier */
3905 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3907 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3910 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3911 *s == '\'' ? "'" : "::");
3916 if (PL_expect == XOPERATOR) {
3917 if (PL_bufptr == PL_linestart) {
3918 CopLINE_dec(PL_curcop);
3919 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3920 CopLINE_inc(PL_curcop);
3923 no_op("Bareword",s);
3926 /* Look for a subroutine with this name in current package,
3927 unless name is "Foo::", in which case Foo is a bearword
3928 (and a package name). */
3931 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3933 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3934 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3935 "Bareword \"%s\" refers to nonexistent package",
3938 PL_tokenbuf[len] = '\0';
3945 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3948 /* if we saw a global override before, get the right name */
3951 sv = newSVpvn("CORE::GLOBAL::",14);
3952 sv_catpv(sv,PL_tokenbuf);
3955 sv = newSVpv(PL_tokenbuf,0);
3957 /* Presume this is going to be a bareword of some sort. */
3960 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3961 yylval.opval->op_private = OPpCONST_BARE;
3962 /* UTF-8 package name? */
3963 if (UTF && !IN_BYTES &&
3964 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3967 /* And if "Foo::", then that's what it certainly is. */
3972 /* See if it's the indirect object for a list operator. */
3974 if (PL_oldoldbufptr &&
3975 PL_oldoldbufptr < PL_bufptr &&
3976 (PL_oldoldbufptr == PL_last_lop
3977 || PL_oldoldbufptr == PL_last_uni) &&
3978 /* NO SKIPSPACE BEFORE HERE! */
3979 (PL_expect == XREF ||
3980 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3982 bool immediate_paren = *s == '(';
3984 /* (Now we can afford to cross potential line boundary.) */
3987 /* Two barewords in a row may indicate method call. */
3989 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3992 /* If not a declared subroutine, it's an indirect object. */
3993 /* (But it's an indir obj regardless for sort.) */
3995 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3996 ((!gv || !GvCVu(gv)) &&
3997 (PL_last_lop_op != OP_MAPSTART &&
3998 PL_last_lop_op != OP_GREPSTART))))
4000 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4005 PL_expect = XOPERATOR;
4008 /* Is this a word before a => operator? */
4009 if (*s == '=' && s[1] == '>' && !pkgname) {
4011 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4012 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4013 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4017 /* If followed by a paren, it's certainly a subroutine. */
4020 if (gv && GvCVu(gv)) {
4021 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4022 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4027 PL_nextval[PL_nexttoke].opval = yylval.opval;
4028 PL_expect = XOPERATOR;
4034 /* If followed by var or block, call it a method (unless sub) */
4036 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4037 PL_last_lop = PL_oldbufptr;
4038 PL_last_lop_op = OP_METHOD;
4042 /* If followed by a bareword, see if it looks like indir obj. */
4045 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4046 && (tmp = intuit_method(s,gv)))
4049 /* Not a method, so call it a subroutine (if defined) */
4051 if (gv && GvCVu(gv)) {
4053 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4054 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4055 "Ambiguous use of -%s resolved as -&%s()",
4056 PL_tokenbuf, PL_tokenbuf);
4057 /* Check for a constant sub */
4059 if ((sv = cv_const_sv(cv))) {
4061 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4062 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4063 yylval.opval->op_private = 0;
4067 /* Resolve to GV now. */
4068 op_free(yylval.opval);
4069 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4070 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4071 PL_last_lop = PL_oldbufptr;
4072 PL_last_lop_op = OP_ENTERSUB;
4073 /* Is there a prototype? */
4076 char *proto = SvPV((SV*)cv, len);
4079 if (strEQ(proto, "$"))
4081 if (*proto == '&' && *s == '{') {
4082 sv_setpv(PL_subname, PL_curstash ?
4083 "__ANON__" : "__ANON__::__ANON__");
4087 PL_nextval[PL_nexttoke].opval = yylval.opval;
4093 /* Call it a bare word */
4095 if (PL_hints & HINT_STRICT_SUBS)
4096 yylval.opval->op_private |= OPpCONST_STRICT;
4099 if (ckWARN(WARN_RESERVED)) {
4100 if (lastchar != '-') {
4101 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4102 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4103 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4110 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4111 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4112 "Operator or semicolon missing before %c%s",
4113 lastchar, PL_tokenbuf);
4114 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4115 "Ambiguous use of %c resolved as operator %c",
4116 lastchar, lastchar);
4122 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4123 newSVpv(CopFILE(PL_curcop),0));
4127 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4128 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4131 case KEY___PACKAGE__:
4132 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4134 ? newSVsv(PL_curstname)
4143 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4144 char *pname = "main";
4145 if (PL_tokenbuf[2] == 'D')
4146 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4147 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4150 GvIOp(gv) = newIO();
4151 IoIFP(GvIOp(gv)) = PL_rsfp;
4152 #if defined(HAS_FCNTL) && defined(F_SETFD)
4154 int fd = PerlIO_fileno(PL_rsfp);
4155 fcntl(fd,F_SETFD,fd >= 3);
4158 /* Mark this internal pseudo-handle as clean */
4159 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4161 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4162 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4163 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4165 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4166 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4167 /* if the script was opened in binmode, we need to revert
4168 * it to text mode for compatibility; but only iff it has CRs
4169 * XXX this is a questionable hack at best. */
4170 if (PL_bufend-PL_bufptr > 2
4171 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4174 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4175 loc = PerlIO_tell(PL_rsfp);
4176 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4179 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4181 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4182 #endif /* NETWARE */
4183 #ifdef PERLIO_IS_STDIO /* really? */
4184 # if defined(__BORLANDC__)
4185 /* XXX see note in do_binmode() */
4186 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4190 PerlIO_seek(PL_rsfp, loc, 0);
4194 #ifdef PERLIO_LAYERS
4195 if (UTF && !IN_BYTES)
4196 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4209 if (PL_expect == XSTATE) {
4216 if (*s == ':' && s[1] == ':') {
4219 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4220 if (!(tmp = keyword(PL_tokenbuf, len)))
4221 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4235 LOP(OP_ACCEPT,XTERM);
4241 LOP(OP_ATAN2,XTERM);
4247 LOP(OP_BINMODE,XTERM);
4250 LOP(OP_BLESS,XTERM);
4259 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4276 if (!PL_cryptseen) {
4277 PL_cryptseen = TRUE;
4281 LOP(OP_CRYPT,XTERM);
4284 LOP(OP_CHMOD,XTERM);
4287 LOP(OP_CHOWN,XTERM);
4290 LOP(OP_CONNECT,XTERM);
4306 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4310 PL_hints |= HINT_BLOCK_SCOPE;
4320 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4321 LOP(OP_DBMOPEN,XTERM);
4327 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4334 yylval.ival = CopLINE(PL_curcop);
4348 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4349 UNIBRACK(OP_ENTEREVAL);
4367 case KEY_endhostent:
4373 case KEY_endservent:
4376 case KEY_endprotoent:
4387 yylval.ival = CopLINE(PL_curcop);
4389 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4391 if ((PL_bufend - p) >= 3 &&
4392 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4394 else if ((PL_bufend - p) >= 4 &&
4395 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4398 if (isIDFIRST_lazy_if(p,UTF)) {
4399 p = scan_ident(p, PL_bufend,
4400 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4404 Perl_croak(aTHX_ "Missing $ on loop variable");
4409 LOP(OP_FORMLINE,XTERM);
4415 LOP(OP_FCNTL,XTERM);
4421 LOP(OP_FLOCK,XTERM);
4430 LOP(OP_GREPSTART, XREF);
4433 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4448 case KEY_getpriority:
4449 LOP(OP_GETPRIORITY,XTERM);
4451 case KEY_getprotobyname:
4454 case KEY_getprotobynumber:
4455 LOP(OP_GPBYNUMBER,XTERM);
4457 case KEY_getprotoent:
4469 case KEY_getpeername:
4470 UNI(OP_GETPEERNAME);
4472 case KEY_gethostbyname:
4475 case KEY_gethostbyaddr:
4476 LOP(OP_GHBYADDR,XTERM);
4478 case KEY_gethostent:
4481 case KEY_getnetbyname:
4484 case KEY_getnetbyaddr:
4485 LOP(OP_GNBYADDR,XTERM);
4490 case KEY_getservbyname:
4491 LOP(OP_GSBYNAME,XTERM);
4493 case KEY_getservbyport:
4494 LOP(OP_GSBYPORT,XTERM);
4496 case KEY_getservent:
4499 case KEY_getsockname:
4500 UNI(OP_GETSOCKNAME);
4502 case KEY_getsockopt:
4503 LOP(OP_GSOCKOPT,XTERM);
4525 yylval.ival = CopLINE(PL_curcop);
4529 LOP(OP_INDEX,XTERM);
4535 LOP(OP_IOCTL,XTERM);
4547 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4579 LOP(OP_LISTEN,XTERM);
4588 s = scan_pat(s,OP_MATCH);
4589 TERM(sublex_start());
4592 LOP(OP_MAPSTART, XREF);
4595 LOP(OP_MKDIR,XTERM);
4598 LOP(OP_MSGCTL,XTERM);
4601 LOP(OP_MSGGET,XTERM);
4604 LOP(OP_MSGRCV,XTERM);
4607 LOP(OP_MSGSND,XTERM);
4613 if (isIDFIRST_lazy_if(s,UTF)) {
4614 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4615 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4617 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4618 if (!PL_in_my_stash) {
4621 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4629 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4636 if (PL_expect != XSTATE)
4637 yyerror("\"no\" not allowed in expression");
4638 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4639 s = force_version(s, FALSE);
4644 if (*s == '(' || (s = skipspace(s), *s == '('))
4651 if (isIDFIRST_lazy_if(s,UTF)) {
4653 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4655 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4657 && !(t[0] == '=' && t[1] == '>')
4659 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4660 "Precedence problem: open %.*s should be open(%.*s)",
4661 d - s, s, d - s, s);
4667 yylval.ival = OP_OR;
4677 LOP(OP_OPEN_DIR,XTERM);
4680 checkcomma(s,PL_tokenbuf,"filehandle");
4684 checkcomma(s,PL_tokenbuf,"filehandle");
4703 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4707 LOP(OP_PIPE_OP,XTERM);
4710 s = scan_str(s,FALSE,FALSE);
4712 missingterm((char*)0);
4713 yylval.ival = OP_CONST;
4714 TERM(sublex_start());
4720 s = scan_str(s,FALSE,FALSE);
4722 missingterm((char*)0);
4724 if (SvCUR(PL_lex_stuff)) {
4727 d = SvPV_force(PL_lex_stuff, len);
4730 for (; isSPACE(*d) && len; --len, ++d) ;
4733 if (!warned && ckWARN(WARN_QW)) {
4734 for (; !isSPACE(*d) && len; --len, ++d) {
4736 Perl_warner(aTHX_ packWARN(WARN_QW),
4737 "Possible attempt to separate words with commas");
4740 else if (*d == '#') {
4741 Perl_warner(aTHX_ packWARN(WARN_QW),
4742 "Possible attempt to put comments in qw() list");
4748 for (; !isSPACE(*d) && len; --len, ++d) ;
4750 sv = newSVpvn(b, d-b);
4751 if (DO_UTF8(PL_lex_stuff))
4753 words = append_elem(OP_LIST, words,
4754 newSVOP(OP_CONST, 0, tokeq(sv)));
4758 PL_nextval[PL_nexttoke].opval = words;
4763 SvREFCNT_dec(PL_lex_stuff);
4764 PL_lex_stuff = Nullsv;
4770 s = scan_str(s,FALSE,FALSE);
4772 missingterm((char*)0);
4773 yylval.ival = OP_STRINGIFY;
4774 if (SvIVX(PL_lex_stuff) == '\'')
4775 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4776 TERM(sublex_start());
4779 s = scan_pat(s,OP_QR);
4780 TERM(sublex_start());
4783 s = scan_str(s,FALSE,FALSE);
4785 missingterm((char*)0);
4786 yylval.ival = OP_BACKTICK;
4788 TERM(sublex_start());
4796 s = force_version(s, FALSE);
4798 else if (*s != 'v' || !isDIGIT(s[1])
4799 || (s = force_version(s, TRUE), *s == 'v'))
4801 *PL_tokenbuf = '\0';
4802 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4803 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4804 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4806 yyerror("<> should be quotes");
4814 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4818 LOP(OP_RENAME,XTERM);
4827 LOP(OP_RINDEX,XTERM);
4837 UNIDOR(OP_READLINE);
4850 LOP(OP_REVERSE,XTERM);
4853 UNIDOR(OP_READLINK);
4861 TERM(sublex_start());
4863 TOKEN(1); /* force error */
4872 LOP(OP_SELECT,XTERM);
4878 LOP(OP_SEMCTL,XTERM);
4881 LOP(OP_SEMGET,XTERM);
4884 LOP(OP_SEMOP,XTERM);
4890 LOP(OP_SETPGRP,XTERM);
4892 case KEY_setpriority:
4893 LOP(OP_SETPRIORITY,XTERM);
4895 case KEY_sethostent:
4901 case KEY_setservent:
4904 case KEY_setprotoent:
4914 LOP(OP_SEEKDIR,XTERM);
4916 case KEY_setsockopt:
4917 LOP(OP_SSOCKOPT,XTERM);
4923 LOP(OP_SHMCTL,XTERM);
4926 LOP(OP_SHMGET,XTERM);
4929 LOP(OP_SHMREAD,XTERM);
4932 LOP(OP_SHMWRITE,XTERM);
4935 LOP(OP_SHUTDOWN,XTERM);
4944 LOP(OP_SOCKET,XTERM);
4946 case KEY_socketpair:
4947 LOP(OP_SOCKPAIR,XTERM);
4950 checkcomma(s,PL_tokenbuf,"subroutine name");
4952 if (*s == ';' || *s == ')') /* probably a close */
4953 Perl_croak(aTHX_ "sort is now a reserved word");
4955 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4959 LOP(OP_SPLIT,XTERM);
4962 LOP(OP_SPRINTF,XTERM);
4965 LOP(OP_SPLICE,XTERM);
4980 LOP(OP_SUBSTR,XTERM);
4986 char tmpbuf[sizeof PL_tokenbuf];
4987 SSize_t tboffset = 0;
4988 expectation attrful;
4989 bool have_name, have_proto, bad_proto;
4994 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4995 (*s == ':' && s[1] == ':'))
4998 attrful = XATTRBLOCK;
4999 /* remember buffer pos'n for later force_word */
5000 tboffset = s - PL_oldbufptr;
5001 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5002 if (strchr(tmpbuf, ':'))
5003 sv_setpv(PL_subname, tmpbuf);
5005 sv_setsv(PL_subname,PL_curstname);
5006 sv_catpvn(PL_subname,"::",2);
5007 sv_catpvn(PL_subname,tmpbuf,len);
5014 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5015 PL_expect = XTERMBLOCK;
5016 attrful = XATTRTERM;
5017 sv_setpv(PL_subname,"?");
5021 if (key == KEY_format) {
5023 PL_lex_formbrack = PL_lex_brackets + 1;
5025 (void) force_word(PL_oldbufptr + tboffset, WORD,
5030 /* Look for a prototype */
5034 s = scan_str(s,FALSE,FALSE);
5036 Perl_croak(aTHX_ "Prototype not terminated");
5037 /* strip spaces and check for bad characters */
5038 d = SvPVX(PL_lex_stuff);
5041 for (p = d; *p; ++p) {
5044 if (!strchr("$@%*;[]&\\", *p))
5049 if (bad_proto && ckWARN(WARN_SYNTAX))
5050 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5051 "Illegal character in prototype for %s : %s",
5052 SvPVX(PL_subname), d);
5053 SvCUR(PL_lex_stuff) = tmp;
5061 if (*s == ':' && s[1] != ':')
5062 PL_expect = attrful;
5063 else if (!have_name && *s != '{' && key == KEY_sub)
5064 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5067 PL_nextval[PL_nexttoke].opval =
5068 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5069 PL_lex_stuff = Nullsv;
5073 sv_setpv(PL_subname,
5074 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5077 (void) force_word(PL_oldbufptr + tboffset, WORD,
5086 LOP(OP_SYSTEM,XREF);
5089 LOP(OP_SYMLINK,XTERM);
5092 LOP(OP_SYSCALL,XTERM);
5095 LOP(OP_SYSOPEN,XTERM);
5098 LOP(OP_SYSSEEK,XTERM);
5101 LOP(OP_SYSREAD,XTERM);
5104 LOP(OP_SYSWRITE,XTERM);
5108 TERM(sublex_start());
5129 LOP(OP_TRUNCATE,XTERM);
5141 yylval.ival = CopLINE(PL_curcop);
5145 yylval.ival = CopLINE(PL_curcop);
5149 LOP(OP_UNLINK,XTERM);
5155 LOP(OP_UNPACK,XTERM);
5158 LOP(OP_UTIME,XTERM);
5164 LOP(OP_UNSHIFT,XTERM);
5167 if (PL_expect != XSTATE)
5168 yyerror("\"use\" not allowed in expression");
5170 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5171 s = force_version(s, TRUE);
5172 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5173 PL_nextval[PL_nexttoke].opval = Nullop;
5176 else if (*s == 'v') {
5177 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5178 s = force_version(s, FALSE);
5182 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5183 s = force_version(s, FALSE);
5195 yylval.ival = CopLINE(PL_curcop);
5199 PL_hints |= HINT_BLOCK_SCOPE;
5206 LOP(OP_WAITPID,XTERM);
5215 ctl_l[0] = toCTRL('L');
5217 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5220 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5225 if (PL_expect == XOPERATOR)
5231 yylval.ival = OP_XOR;
5236 TERM(sublex_start());
5241 #pragma segment Main
5245 S_pending_ident(pTHX)
5249 /* pit holds the identifier we read and pending_ident is reset */
5250 char pit = PL_pending_ident;
5251 PL_pending_ident = 0;
5253 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5254 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5256 /* if we're in a my(), we can't allow dynamics here.
5257 $foo'bar has already been turned into $foo::bar, so
5258 just check for colons.
5260 if it's a legal name, the OP is a PADANY.
5263 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5264 if (strchr(PL_tokenbuf,':'))
5265 yyerror(Perl_form(aTHX_ "No package name allowed for "
5266 "variable %s in \"our\"",
5268 tmp = allocmy(PL_tokenbuf);
5271 if (strchr(PL_tokenbuf,':'))
5272 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5274 yylval.opval = newOP(OP_PADANY, 0);
5275 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5281 build the ops for accesses to a my() variable.
5283 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5284 then used in a comparison. This catches most, but not
5285 all cases. For instance, it catches
5286 sort { my($a); $a <=> $b }
5288 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5289 (although why you'd do that is anyone's guess).
5292 if (!strchr(PL_tokenbuf,':')) {
5293 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5294 /* might be an "our" variable" */
5295 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5296 /* build ops for a bareword */
5297 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5298 sv_catpvn(sym, "::", 2);
5299 sv_catpv(sym, PL_tokenbuf+1);
5300 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5301 yylval.opval->op_private = OPpCONST_ENTERED;
5302 gv_fetchpv(SvPVX(sym),
5304 ? (GV_ADDMULTI | GV_ADDINEVAL)
5307 ((PL_tokenbuf[0] == '$') ? SVt_PV
5308 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5313 /* if it's a sort block and they're naming $a or $b */
5314 if (PL_last_lop_op == OP_SORT &&
5315 PL_tokenbuf[0] == '$' &&
5316 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5319 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5320 d < PL_bufend && *d != '\n';
5323 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5324 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5330 yylval.opval = newOP(OP_PADANY, 0);
5331 yylval.opval->op_targ = tmp;
5337 Whine if they've said @foo in a doublequoted string,
5338 and @foo isn't a variable we can find in the symbol
5341 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5342 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5343 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5344 && ckWARN(WARN_AMBIGUOUS))
5346 /* Downgraded from fatal to warning 20000522 mjd */
5347 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5348 "Possible unintended interpolation of %s in string",
5353 /* build ops for a bareword */
5354 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5355 yylval.opval->op_private = OPpCONST_ENTERED;
5356 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5357 ((PL_tokenbuf[0] == '$') ? SVt_PV
5358 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5364 Perl_keyword(pTHX_ register char *d, I32 len)
5369 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5370 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5371 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5372 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5373 if (strEQ(d,"__END__")) return KEY___END__;
5377 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5382 if (strEQ(d,"and")) return -KEY_and;
5383 if (strEQ(d,"abs")) return -KEY_abs;
5386 if (strEQ(d,"alarm")) return -KEY_alarm;
5387 if (strEQ(d,"atan2")) return -KEY_atan2;
5390 if (strEQ(d,"accept")) return -KEY_accept;
5395 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5398 if (strEQ(d,"bless")) return -KEY_bless;
5399 if (strEQ(d,"bind")) return -KEY_bind;
5400 if (strEQ(d,"binmode")) return -KEY_binmode;
5403 if (strEQ(d,"CORE")) return -KEY_CORE;
5404 if (strEQ(d,"CHECK")) return KEY_CHECK;
5409 if (strEQ(d,"cmp")) return -KEY_cmp;
5410 if (strEQ(d,"chr")) return -KEY_chr;
5411 if (strEQ(d,"cos")) return -KEY_cos;
5414 if (strEQ(d,"chop")) return -KEY_chop;
5417 if (strEQ(d,"close")) return -KEY_close;
5418 if (strEQ(d,"chdir")) return -KEY_chdir;
5419 if (strEQ(d,"chomp")) return -KEY_chomp;
5420 if (strEQ(d,"chmod")) return -KEY_chmod;
5421 if (strEQ(d,"chown")) return -KEY_chown;
5422 if (strEQ(d,"crypt")) return -KEY_crypt;
5425 if (strEQ(d,"chroot")) return -KEY_chroot;
5426 if (strEQ(d,"caller")) return -KEY_caller;
5429 if (strEQ(d,"connect")) return -KEY_connect;
5432 if (strEQ(d,"closedir")) return -KEY_closedir;
5433 if (strEQ(d,"continue")) return -KEY_continue;
5438 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5443 if (strEQ(d,"do")) return KEY_do;
5446 if (strEQ(d,"die")) return -KEY_die;
5449 if (strEQ(d,"dump")) return -KEY_dump;
5452 if (strEQ(d,"delete")) return KEY_delete;
5455 if (strEQ(d,"defined")) return KEY_defined;
5456 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5459 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5464 if (strEQ(d,"END")) return KEY_END;
5469 if (strEQ(d,"eq")) return -KEY_eq;
5472 if (strEQ(d,"eof")) return -KEY_eof;
5473 if (strEQ(d,"err")) return -KEY_err;
5474 if (strEQ(d,"exp")) return -KEY_exp;
5477 if (strEQ(d,"else")) return KEY_else;
5478 if (strEQ(d,"exit")) return -KEY_exit;
5479 if (strEQ(d,"eval")) return KEY_eval;
5480 if (strEQ(d,"exec")) return -KEY_exec;
5481 if (strEQ(d,"each")) return -KEY_each;
5484 if (strEQ(d,"elsif")) return KEY_elsif;
5487 if (strEQ(d,"exists")) return KEY_exists;
5488 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5491 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5492 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5495 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5498 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5499 if (strEQ(d,"endservent")) return -KEY_endservent;
5502 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5509 if (strEQ(d,"for")) return KEY_for;
5512 if (strEQ(d,"fork")) return -KEY_fork;
5515 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5516 if (strEQ(d,"flock")) return -KEY_flock;
5519 if (strEQ(d,"format")) return KEY_format;
5520 if (strEQ(d,"fileno")) return -KEY_fileno;
5523 if (strEQ(d,"foreach")) return KEY_foreach;
5526 if (strEQ(d,"formline")) return -KEY_formline;
5531 if (strnEQ(d,"get",3)) {
5536 if (strEQ(d,"ppid")) return -KEY_getppid;
5537 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5540 if (strEQ(d,"pwent")) return -KEY_getpwent;
5541 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5542 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5545 if (strEQ(d,"peername")) return -KEY_getpeername;
5546 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5547 if (strEQ(d,"priority")) return -KEY_getpriority;
5550 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5553 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5557 else if (*d == 'h') {
5558 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5559 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5560 if (strEQ(d,"hostent")) return -KEY_gethostent;
5562 else if (*d == 'n') {
5563 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5564 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5565 if (strEQ(d,"netent")) return -KEY_getnetent;
5567 else if (*d == 's') {
5568 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5569 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5570 if (strEQ(d,"servent")) return -KEY_getservent;
5571 if (strEQ(d,"sockname")) return -KEY_getsockname;
5572 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5574 else if (*d == 'g') {
5575 if (strEQ(d,"grent")) return -KEY_getgrent;
5576 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5577 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5579 else if (*d == 'l') {
5580 if (strEQ(d,"login")) return -KEY_getlogin;
5582 else if (strEQ(d,"c")) return -KEY_getc;
5587 if (strEQ(d,"gt")) return -KEY_gt;
5588 if (strEQ(d,"ge")) return -KEY_ge;
5591 if (strEQ(d,"grep")) return KEY_grep;
5592 if (strEQ(d,"goto")) return KEY_goto;
5593 if (strEQ(d,"glob")) return KEY_glob;
5596 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5601 if (strEQ(d,"hex")) return -KEY_hex;
5604 if (strEQ(d,"INIT")) return KEY_INIT;
5609 if (strEQ(d,"if")) return KEY_if;
5612 if (strEQ(d,"int")) return -KEY_int;
5615 if (strEQ(d,"index")) return -KEY_index;
5616 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5621 if (strEQ(d,"join")) return -KEY_join;
5625 if (strEQ(d,"keys")) return -KEY_keys;
5626 if (strEQ(d,"kill")) return -KEY_kill;
5632 if (strEQ(d,"lt")) return -KEY_lt;
5633 if (strEQ(d,"le")) return -KEY_le;
5634 if (strEQ(d,"lc")) return -KEY_lc;
5637 if (strEQ(d,"log")) return -KEY_log;
5640 if (strEQ(d,"last")) return KEY_last;
5641 if (strEQ(d,"link")) return -KEY_link;
5642 if (strEQ(d,"lock")) return -KEY_lock;
5645 if (strEQ(d,"local")) return KEY_local;
5646 if (strEQ(d,"lstat")) return -KEY_lstat;
5649 if (strEQ(d,"length")) return -KEY_length;
5650 if (strEQ(d,"listen")) return -KEY_listen;
5653 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5656 if (strEQ(d,"localtime")) return -KEY_localtime;
5662 case 1: return KEY_m;
5664 if (strEQ(d,"my")) return KEY_my;
5667 if (strEQ(d,"map")) return KEY_map;
5670 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5673 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5674 if (strEQ(d,"msgget")) return -KEY_msgget;
5675 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5676 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5681 if (strEQ(d,"next")) return KEY_next;
5682 if (strEQ(d,"ne")) return -KEY_ne;
5683 if (strEQ(d,"not")) return -KEY_not;
5684 if (strEQ(d,"no")) return KEY_no;
5689 if (strEQ(d,"or")) return -KEY_or;
5692 if (strEQ(d,"ord")) return -KEY_ord;
5693 if (strEQ(d,"oct")) return -KEY_oct;
5694 if (strEQ(d,"our")) return KEY_our;
5697 if (strEQ(d,"open")) return -KEY_open;
5700 if (strEQ(d,"opendir")) return -KEY_opendir;
5707 if (strEQ(d,"pop")) return -KEY_pop;
5708 if (strEQ(d,"pos")) return KEY_pos;
5711 if (strEQ(d,"push")) return -KEY_push;
5712 if (strEQ(d,"pack")) return -KEY_pack;
5713 if (strEQ(d,"pipe")) return -KEY_pipe;
5716 if (strEQ(d,"print")) return KEY_print;
5719 if (strEQ(d,"printf")) return KEY_printf;
5722 if (strEQ(d,"package")) return KEY_package;
5725 if (strEQ(d,"prototype")) return KEY_prototype;
5730 if (strEQ(d,"q")) return KEY_q;
5731 if (strEQ(d,"qr")) return KEY_qr;
5732 if (strEQ(d,"qq")) return KEY_qq;
5733 if (strEQ(d,"qw")) return KEY_qw;
5734 if (strEQ(d,"qx")) return KEY_qx;
5736 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5741 if (strEQ(d,"ref")) return -KEY_ref;
5744 if (strEQ(d,"read")) return -KEY_read;
5745 if (strEQ(d,"rand")) return -KEY_rand;
5746 if (strEQ(d,"recv")) return -KEY_recv;
5747 if (strEQ(d,"redo")) return KEY_redo;
5750 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5751 if (strEQ(d,"reset")) return -KEY_reset;
5754 if (strEQ(d,"return")) return KEY_return;
5755 if (strEQ(d,"rename")) return -KEY_rename;
5756 if (strEQ(d,"rindex")) return -KEY_rindex;
5759 if (strEQ(d,"require")) return KEY_require;
5760 if (strEQ(d,"reverse")) return -KEY_reverse;
5761 if (strEQ(d,"readdir")) return -KEY_readdir;
5764 if (strEQ(d,"readlink")) return -KEY_readlink;
5765 if (strEQ(d,"readline")) return -KEY_readline;
5766 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5769 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5775 case 0: return KEY_s;
5777 if (strEQ(d,"scalar")) return KEY_scalar;
5782 if (strEQ(d,"seek")) return -KEY_seek;
5783 if (strEQ(d,"send")) return -KEY_send;
5786 if (strEQ(d,"semop")) return -KEY_semop;
5789 if (strEQ(d,"select")) return -KEY_select;
5790 if (strEQ(d,"semctl")) return -KEY_semctl;
5791 if (strEQ(d,"semget")) return -KEY_semget;
5794 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5795 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5798 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5799 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5802 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5805 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5806 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5807 if (strEQ(d,"setservent")) return -KEY_setservent;
5810 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5811 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5818 if (strEQ(d,"shift")) return -KEY_shift;
5821 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5822 if (strEQ(d,"shmget")) return -KEY_shmget;
5825 if (strEQ(d,"shmread")) return -KEY_shmread;
5828 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5829 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5834 if (strEQ(d,"sin")) return -KEY_sin;
5837 if (strEQ(d,"sleep")) return -KEY_sleep;
5840 if (strEQ(d,"sort")) return KEY_sort;
5841 if (strEQ(d,"socket")) return -KEY_socket;
5842 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5845 if (strEQ(d,"split")) return KEY_split;
5846 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5847 if (strEQ(d,"splice")) return -KEY_splice;
5850 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5853 if (strEQ(d,"srand")) return -KEY_srand;
5856 if (strEQ(d,"stat")) return -KEY_stat;
5857 if (strEQ(d,"study")) return KEY_study;
5860 if (strEQ(d,"substr")) return -KEY_substr;
5861 if (strEQ(d,"sub")) return KEY_sub;
5866 if (strEQ(d,"system")) return -KEY_system;
5869 if (strEQ(d,"symlink")) return -KEY_symlink;
5870 if (strEQ(d,"syscall")) return -KEY_syscall;
5871 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5872 if (strEQ(d,"sysread")) return -KEY_sysread;
5873 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5876 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5885 if (strEQ(d,"tr")) return KEY_tr;
5888 if (strEQ(d,"tie")) return KEY_tie;
5891 if (strEQ(d,"tell")) return -KEY_tell;
5892 if (strEQ(d,"tied")) return KEY_tied;
5893 if (strEQ(d,"time")) return -KEY_time;
5896 if (strEQ(d,"times")) return -KEY_times;
5899 if (strEQ(d,"telldir")) return -KEY_telldir;
5902 if (strEQ(d,"truncate")) return -KEY_truncate;
5909 if (strEQ(d,"uc")) return -KEY_uc;
5912 if (strEQ(d,"use")) return KEY_use;
5915 if (strEQ(d,"undef")) return KEY_undef;
5916 if (strEQ(d,"until")) return KEY_until;
5917 if (strEQ(d,"untie")) return KEY_untie;
5918 if (strEQ(d,"utime")) return -KEY_utime;
5919 if (strEQ(d,"umask")) return -KEY_umask;
5922 if (strEQ(d,"unless")) return KEY_unless;
5923 if (strEQ(d,"unpack")) return -KEY_unpack;
5924 if (strEQ(d,"unlink")) return -KEY_unlink;
5927 if (strEQ(d,"unshift")) return -KEY_unshift;
5928 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5933 if (strEQ(d,"values")) return -KEY_values;
5934 if (strEQ(d,"vec")) return -KEY_vec;
5939 if (strEQ(d,"warn")) return -KEY_warn;
5940 if (strEQ(d,"wait")) return -KEY_wait;
5943 if (strEQ(d,"while")) return KEY_while;
5944 if (strEQ(d,"write")) return -KEY_write;
5947 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5950 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5955 if (len == 1) return -KEY_x;
5956 if (strEQ(d,"xor")) return -KEY_xor;
5959 if (len == 1) return KEY_y;
5968 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5972 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5973 if (ckWARN(WARN_SYNTAX)) {
5975 for (w = s+2; *w && level; w++) {
5982 for (; *w && isSPACE(*w); w++) ;
5983 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5984 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5985 "%s (...) interpreted as function",name);
5988 while (s < PL_bufend && isSPACE(*s))
5992 while (s < PL_bufend && isSPACE(*s))
5994 if (isIDFIRST_lazy_if(s,UTF)) {
5996 while (isALNUM_lazy_if(s,UTF))
5998 while (s < PL_bufend && isSPACE(*s))
6003 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6007 Perl_croak(aTHX_ "No comma allowed after %s", what);
6012 /* Either returns sv, or mortalizes sv and returns a new SV*.
6013 Best used as sv=new_constant(..., sv, ...).
6014 If s, pv are NULL, calls subroutine with one argument,
6015 and type is used with error messages only. */
6018 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6022 HV *table = GvHV(PL_hintgv); /* ^H */
6026 const char *why1, *why2, *why3;
6028 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6031 why2 = strEQ(key,"charnames")
6032 ? "(possibly a missing \"use charnames ...\")"
6034 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6035 (type ? type: "undef"), why2);
6037 /* This is convoluted and evil ("goto considered harmful")
6038 * but I do not understand the intricacies of all the different
6039 * failure modes of %^H in here. The goal here is to make
6040 * the most probable error message user-friendly. --jhi */
6045 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6046 (type ? type: "undef"), why1, why2, why3);
6048 yyerror(SvPVX(msg));
6052 cvp = hv_fetch(table, key, strlen(key), FALSE);
6053 if (!cvp || !SvOK(*cvp)) {
6056 why3 = "} is not defined";
6059 sv_2mortal(sv); /* Parent created it permanently */
6062 pv = sv_2mortal(newSVpvn(s, len));
6064 typesv = sv_2mortal(newSVpv(type, 0));
6066 typesv = &PL_sv_undef;
6068 PUSHSTACKi(PERLSI_OVERLOAD);
6080 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6084 /* Check the eval first */
6085 if (!PL_in_eval && SvTRUE(ERRSV)) {
6087 sv_catpv(ERRSV, "Propagated");
6088 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6090 res = SvREFCNT_inc(sv);
6094 (void)SvREFCNT_inc(res);
6103 why1 = "Call to &{$^H{";
6105 why3 = "}} did not return a defined value";
6114 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6116 register char *d = dest;
6117 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6120 Perl_croak(aTHX_ ident_too_long);
6121 if (isALNUM(*s)) /* UTF handled below */
6123 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6128 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6132 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6133 char *t = s + UTF8SKIP(s);
6134 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6136 if (d + (t - s) > e)
6137 Perl_croak(aTHX_ ident_too_long);
6138 Copy(s, d, t - s, char);
6151 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6161 e = d + destlen - 3; /* two-character token, ending NUL */
6163 while (isDIGIT(*s)) {
6165 Perl_croak(aTHX_ ident_too_long);
6172 Perl_croak(aTHX_ ident_too_long);
6173 if (isALNUM(*s)) /* UTF handled below */
6175 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6180 else if (*s == ':' && s[1] == ':') {
6184 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6185 char *t = s + UTF8SKIP(s);
6186 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6188 if (d + (t - s) > e)
6189 Perl_croak(aTHX_ ident_too_long);
6190 Copy(s, d, t - s, char);
6201 if (PL_lex_state != LEX_NORMAL)
6202 PL_lex_state = LEX_INTERPENDMAYBE;
6205 if (*s == '$' && s[1] &&
6206 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6219 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6224 if (isSPACE(s[-1])) {
6227 if (!SPACE_OR_TAB(ch)) {
6233 if (isIDFIRST_lazy_if(d,UTF)) {
6237 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6239 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6242 Copy(s, d, e - s, char);
6247 while ((isALNUM(*s) || *s == ':') && d < e)
6250 Perl_croak(aTHX_ ident_too_long);
6253 while (s < send && SPACE_OR_TAB(*s)) s++;
6254 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6255 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6256 const char *brack = *s == '[' ? "[...]" : "{...}";
6257 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6258 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6259 funny, dest, brack, funny, dest, brack);
6262 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6266 /* Handle extended ${^Foo} variables
6267 * 1999-02-27 mjd-perl-patch@plover.com */
6268 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6272 while (isALNUM(*s) && d < e) {
6276 Perl_croak(aTHX_ ident_too_long);
6281 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6282 PL_lex_state = LEX_INTERPEND;
6285 if (PL_lex_state == LEX_NORMAL) {
6286 if (ckWARN(WARN_AMBIGUOUS) &&
6287 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6289 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6290 "Ambiguous use of %c{%s} resolved to %c%s",
6291 funny, dest, funny, dest);
6296 s = bracket; /* let the parser handle it */
6300 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6301 PL_lex_state = LEX_INTERPEND;
6306 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6311 *pmfl |= PMf_GLOBAL;
6313 *pmfl |= PMf_CONTINUE;
6317 *pmfl |= PMf_MULTILINE;
6319 *pmfl |= PMf_SINGLELINE;
6321 *pmfl |= PMf_EXTENDED;
6325 S_scan_pat(pTHX_ char *start, I32 type)
6330 s = scan_str(start,FALSE,FALSE);
6332 Perl_croak(aTHX_ "Search pattern not terminated");
6334 pm = (PMOP*)newPMOP(type, 0);
6335 if (PL_multi_open == '?')
6336 pm->op_pmflags |= PMf_ONCE;
6338 while (*s && strchr("iomsx", *s))
6339 pmflag(&pm->op_pmflags,*s++);
6342 while (*s && strchr("iogcmsx", *s))
6343 pmflag(&pm->op_pmflags,*s++);
6345 /* issue a warning if /c is specified,but /g is not */
6346 if (ckWARN(WARN_REGEXP) &&
6347 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6349 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6352 pm->op_pmpermflags = pm->op_pmflags;
6354 PL_lex_op = (OP*)pm;
6355 yylval.ival = OP_MATCH;
6360 S_scan_subst(pTHX_ char *start)
6367 yylval.ival = OP_NULL;
6369 s = scan_str(start,FALSE,FALSE);
6372 Perl_croak(aTHX_ "Substitution pattern not terminated");
6374 if (s[-1] == PL_multi_open)
6377 first_start = PL_multi_start;
6378 s = scan_str(s,FALSE,FALSE);
6381 SvREFCNT_dec(PL_lex_stuff);
6382 PL_lex_stuff = Nullsv;
6384 Perl_croak(aTHX_ "Substitution replacement not terminated");
6386 PL_multi_start = first_start; /* so whole substitution is taken together */
6388 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6394 else if (strchr("iogcmsx", *s))
6395 pmflag(&pm->op_pmflags,*s++);
6400 /* /c is not meaningful with s/// */
6401 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6403 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6408 PL_sublex_info.super_bufptr = s;
6409 PL_sublex_info.super_bufend = PL_bufend;
6411 pm->op_pmflags |= PMf_EVAL;
6412 repl = newSVpvn("",0);
6414 sv_catpv(repl, es ? "eval " : "do ");
6415 sv_catpvn(repl, "{ ", 2);
6416 sv_catsv(repl, PL_lex_repl);
6417 sv_catpvn(repl, " };", 2);
6419 SvREFCNT_dec(PL_lex_repl);
6423 pm->op_pmpermflags = pm->op_pmflags;
6424 PL_lex_op = (OP*)pm;
6425 yylval.ival = OP_SUBST;
6430 S_scan_trans(pTHX_ char *start)
6439 yylval.ival = OP_NULL;
6441 s = scan_str(start,FALSE,FALSE);
6443 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6444 if (s[-1] == PL_multi_open)
6447 s = scan_str(s,FALSE,FALSE);
6450 SvREFCNT_dec(PL_lex_stuff);
6451 PL_lex_stuff = Nullsv;
6453 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6456 complement = del = squash = 0;
6457 while (strchr("cds", *s)) {
6459 complement = OPpTRANS_COMPLEMENT;
6461 del = OPpTRANS_DELETE;
6463 squash = OPpTRANS_SQUASH;
6467 New(803, tbl, complement&&!del?258:256, short);
6468 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6469 o->op_private = del|squash|complement|
6470 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6471 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6474 yylval.ival = OP_TRANS;
6479 S_scan_heredoc(pTHX_ register char *s)
6482 I32 op_type = OP_SCALAR;
6489 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6493 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6496 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6497 if (*peek && strchr("`'\"",*peek)) {
6500 s = delimcpy(d, e, s, PL_bufend, term, &len);
6510 if (!isALNUM_lazy_if(s,UTF))
6511 deprecate_old("bare << to mean <<\"\"");
6512 for (; isALNUM_lazy_if(s,UTF); s++) {
6517 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6518 Perl_croak(aTHX_ "Delimiter for here document is too long");
6521 len = d - PL_tokenbuf;
6522 #ifndef PERL_STRICT_CR
6523 d = strchr(s, '\r');
6527 while (s < PL_bufend) {
6533 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6542 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6547 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6548 herewas = newSVpvn(s,PL_bufend-s);
6550 s--, herewas = newSVpvn(s,d-s);
6551 s += SvCUR(herewas);
6553 tmpstr = NEWSV(87,79);
6554 sv_upgrade(tmpstr, SVt_PVIV);
6559 else if (term == '`') {
6560 op_type = OP_BACKTICK;
6561 SvIVX(tmpstr) = '\\';
6565 PL_multi_start = CopLINE(PL_curcop);
6566 PL_multi_open = PL_multi_close = '<';
6567 term = *PL_tokenbuf;
6568 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6569 char *bufptr = PL_sublex_info.super_bufptr;
6570 char *bufend = PL_sublex_info.super_bufend;
6571 char *olds = s - SvCUR(herewas);
6572 s = strchr(bufptr, '\n');
6576 while (s < bufend &&
6577 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6579 CopLINE_inc(PL_curcop);
6582 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6583 missingterm(PL_tokenbuf);
6585 sv_setpvn(herewas,bufptr,d-bufptr+1);
6586 sv_setpvn(tmpstr,d+1,s-d);
6588 sv_catpvn(herewas,s,bufend-s);
6589 (void)strcpy(bufptr,SvPVX(herewas));
6596 while (s < PL_bufend &&
6597 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6599 CopLINE_inc(PL_curcop);
6601 if (s >= PL_bufend) {
6602 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6603 missingterm(PL_tokenbuf);
6605 sv_setpvn(tmpstr,d+1,s-d);
6607 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6609 sv_catpvn(herewas,s,PL_bufend-s);
6610 sv_setsv(PL_linestr,herewas);
6611 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6612 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6613 PL_last_lop = PL_last_uni = Nullch;
6616 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6617 while (s >= PL_bufend) { /* multiple line string? */
6619 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6620 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6621 missingterm(PL_tokenbuf);
6623 CopLINE_inc(PL_curcop);
6624 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6625 PL_last_lop = PL_last_uni = Nullch;
6626 #ifndef PERL_STRICT_CR
6627 if (PL_bufend - PL_linestart >= 2) {
6628 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6629 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6631 PL_bufend[-2] = '\n';
6633 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6635 else if (PL_bufend[-1] == '\r')
6636 PL_bufend[-1] = '\n';
6638 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6639 PL_bufend[-1] = '\n';
6641 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6642 SV *sv = NEWSV(88,0);
6644 sv_upgrade(sv, SVt_PVMG);
6645 sv_setsv(sv,PL_linestr);
6648 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6650 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6653 sv_catsv(PL_linestr,herewas);
6654 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6658 sv_catsv(tmpstr,PL_linestr);
6663 PL_multi_end = CopLINE(PL_curcop);
6664 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6665 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6666 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6668 SvREFCNT_dec(herewas);
6669 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6671 PL_lex_stuff = tmpstr;
6672 yylval.ival = op_type;
6677 takes: current position in input buffer
6678 returns: new position in input buffer
6679 side-effects: yylval and lex_op are set.
6684 <FH> read from filehandle
6685 <pkg::FH> read from package qualified filehandle
6686 <pkg'FH> read from package qualified filehandle
6687 <$fh> read from filehandle in $fh
6693 S_scan_inputsymbol(pTHX_ char *start)
6695 register char *s = start; /* current position in buffer */
6701 d = PL_tokenbuf; /* start of temp holding space */
6702 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6703 end = strchr(s, '\n');
6706 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6708 /* die if we didn't have space for the contents of the <>,
6709 or if it didn't end, or if we see a newline
6712 if (len >= sizeof PL_tokenbuf)
6713 Perl_croak(aTHX_ "Excessively long <> operator");
6715 Perl_croak(aTHX_ "Unterminated <> operator");
6720 Remember, only scalar variables are interpreted as filehandles by
6721 this code. Anything more complex (e.g., <$fh{$num}>) will be
6722 treated as a glob() call.
6723 This code makes use of the fact that except for the $ at the front,
6724 a scalar variable and a filehandle look the same.
6726 if (*d == '$' && d[1]) d++;
6728 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6729 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6732 /* If we've tried to read what we allow filehandles to look like, and
6733 there's still text left, then it must be a glob() and not a getline.
6734 Use scan_str to pull out the stuff between the <> and treat it
6735 as nothing more than a string.
6738 if (d - PL_tokenbuf != len) {
6739 yylval.ival = OP_GLOB;
6741 s = scan_str(start,FALSE,FALSE);
6743 Perl_croak(aTHX_ "Glob not terminated");
6747 bool readline_overriden = FALSE;
6748 GV *gv_readline = Nullgv;
6750 /* we're in a filehandle read situation */
6753 /* turn <> into <ARGV> */
6755 (void)strcpy(d,"ARGV");
6757 /* Check whether readline() is overriden */
6758 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6759 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6761 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6762 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6763 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6764 readline_overriden = TRUE;
6766 /* if <$fh>, create the ops to turn the variable into a
6772 /* try to find it in the pad for this block, otherwise find
6773 add symbol table ops
6775 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6776 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6777 SV *sym = sv_2mortal(
6778 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6779 sv_catpvn(sym, "::", 2);
6785 OP *o = newOP(OP_PADSV, 0);
6787 PL_lex_op = readline_overriden
6788 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6789 append_elem(OP_LIST, o,
6790 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6791 : (OP*)newUNOP(OP_READLINE, 0, o);
6800 ? (GV_ADDMULTI | GV_ADDINEVAL)
6803 PL_lex_op = readline_overriden
6804 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6805 append_elem(OP_LIST,
6806 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6807 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6808 : (OP*)newUNOP(OP_READLINE, 0,
6809 newUNOP(OP_RV2SV, 0,
6810 newGVOP(OP_GV, 0, gv)));
6812 if (!readline_overriden)
6813 PL_lex_op->op_flags |= OPf_SPECIAL;
6814 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6815 yylval.ival = OP_NULL;
6818 /* If it's none of the above, it must be a literal filehandle
6819 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6821 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6822 PL_lex_op = readline_overriden
6823 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6824 append_elem(OP_LIST,
6825 newGVOP(OP_GV, 0, gv),
6826 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6827 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6828 yylval.ival = OP_NULL;
6837 takes: start position in buffer
6838 keep_quoted preserve \ on the embedded delimiter(s)
6839 keep_delims preserve the delimiters around the string
6840 returns: position to continue reading from buffer
6841 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6842 updates the read buffer.
6844 This subroutine pulls a string out of the input. It is called for:
6845 q single quotes q(literal text)
6846 ' single quotes 'literal text'
6847 qq double quotes qq(interpolate $here please)
6848 " double quotes "interpolate $here please"
6849 qx backticks qx(/bin/ls -l)
6850 ` backticks `/bin/ls -l`
6851 qw quote words @EXPORT_OK = qw( func() $spam )
6852 m// regexp match m/this/
6853 s/// regexp substitute s/this/that/
6854 tr/// string transliterate tr/this/that/
6855 y/// string transliterate y/this/that/
6856 ($*@) sub prototypes sub foo ($)
6857 (stuff) sub attr parameters sub foo : attr(stuff)
6858 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6860 In most of these cases (all but <>, patterns and transliterate)
6861 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6862 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6863 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6866 It skips whitespace before the string starts, and treats the first
6867 character as the delimiter. If the delimiter is one of ([{< then
6868 the corresponding "close" character )]}> is used as the closing
6869 delimiter. It allows quoting of delimiters, and if the string has
6870 balanced delimiters ([{<>}]) it allows nesting.
6872 On success, the SV with the resulting string is put into lex_stuff or,
6873 if that is already non-NULL, into lex_repl. The second case occurs only
6874 when parsing the RHS of the special constructs s/// and tr/// (y///).
6875 For convenience, the terminating delimiter character is stuffed into
6880 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6882 SV *sv; /* scalar value: string */
6883 char *tmps; /* temp string, used for delimiter matching */
6884 register char *s = start; /* current position in the buffer */
6885 register char term; /* terminating character */
6886 register char *to; /* current position in the sv's data */
6887 I32 brackets = 1; /* bracket nesting level */
6888 bool has_utf8 = FALSE; /* is there any utf8 content? */
6890 /* skip space before the delimiter */
6894 /* mark where we are, in case we need to report errors */
6897 /* after skipping whitespace, the next character is the terminator */
6899 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6902 /* mark where we are */
6903 PL_multi_start = CopLINE(PL_curcop);
6904 PL_multi_open = term;
6906 /* find corresponding closing delimiter */
6907 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6909 PL_multi_close = term;
6911 /* create a new SV to hold the contents. 87 is leak category, I'm
6912 assuming. 79 is the SV's initial length. What a random number. */
6914 sv_upgrade(sv, SVt_PVIV);
6916 (void)SvPOK_only(sv); /* validate pointer */
6918 /* move past delimiter and try to read a complete string */
6920 sv_catpvn(sv, s, 1);
6923 /* extend sv if need be */
6924 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6925 /* set 'to' to the next character in the sv's string */
6926 to = SvPVX(sv)+SvCUR(sv);
6928 /* if open delimiter is the close delimiter read unbridle */
6929 if (PL_multi_open == PL_multi_close) {
6930 for (; s < PL_bufend; s++,to++) {
6931 /* embedded newlines increment the current line number */
6932 if (*s == '\n' && !PL_rsfp)
6933 CopLINE_inc(PL_curcop);
6934 /* handle quoted delimiters */
6935 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6936 if (!keep_quoted && s[1] == term)
6938 /* any other quotes are simply copied straight through */
6942 /* terminate when run out of buffer (the for() condition), or
6943 have found the terminator */
6944 else if (*s == term)
6946 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6952 /* if the terminator isn't the same as the start character (e.g.,
6953 matched brackets), we have to allow more in the quoting, and
6954 be prepared for nested brackets.
6957 /* read until we run out of string, or we find the terminator */
6958 for (; s < PL_bufend; s++,to++) {
6959 /* embedded newlines increment the line count */
6960 if (*s == '\n' && !PL_rsfp)
6961 CopLINE_inc(PL_curcop);
6962 /* backslashes can escape the open or closing characters */
6963 if (*s == '\\' && s+1 < PL_bufend) {
6965 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6970 /* allow nested opens and closes */
6971 else if (*s == PL_multi_close && --brackets <= 0)
6973 else if (*s == PL_multi_open)
6975 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6980 /* terminate the copied string and update the sv's end-of-string */
6982 SvCUR_set(sv, to - SvPVX(sv));
6985 * this next chunk reads more into the buffer if we're not done yet
6989 break; /* handle case where we are done yet :-) */
6991 #ifndef PERL_STRICT_CR
6992 if (to - SvPVX(sv) >= 2) {
6993 if ((to[-2] == '\r' && to[-1] == '\n') ||
6994 (to[-2] == '\n' && to[-1] == '\r'))
6998 SvCUR_set(sv, to - SvPVX(sv));
7000 else if (to[-1] == '\r')
7003 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7007 /* if we're out of file, or a read fails, bail and reset the current
7008 line marker so we can report where the unterminated string began
7011 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7013 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7016 /* we read a line, so increment our line counter */
7017 CopLINE_inc(PL_curcop);
7019 /* update debugger info */
7020 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7021 SV *sv = NEWSV(88,0);
7023 sv_upgrade(sv, SVt_PVMG);
7024 sv_setsv(sv,PL_linestr);
7027 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7030 /* having changed the buffer, we must update PL_bufend */
7031 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7032 PL_last_lop = PL_last_uni = Nullch;
7035 /* at this point, we have successfully read the delimited string */
7038 sv_catpvn(sv, s, 1);
7041 else if (PL_encoding)
7042 sv_recode_to_utf8(sv, PL_encoding);
7044 PL_multi_end = CopLINE(PL_curcop);
7047 /* if we allocated too much space, give some back */
7048 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7049 SvLEN_set(sv, SvCUR(sv) + 1);
7050 Renew(SvPVX(sv), SvLEN(sv), char);
7053 /* decide whether this is the first or second quoted string we've read
7066 takes: pointer to position in buffer
7067 returns: pointer to new position in buffer
7068 side-effects: builds ops for the constant in yylval.op
7070 Read a number in any of the formats that Perl accepts:
7072 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7073 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7076 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7078 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7081 If it reads a number without a decimal point or an exponent, it will
7082 try converting the number to an integer and see if it can do so
7083 without loss of precision.
7087 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7089 register char *s = start; /* current position in buffer */
7090 register char *d; /* destination in temp buffer */
7091 register char *e; /* end of temp buffer */
7092 NV nv; /* number read, as a double */
7093 SV *sv = Nullsv; /* place to put the converted number */
7094 bool floatit; /* boolean: int or float? */
7095 char *lastub = 0; /* position of last underbar */
7096 static char number_too_long[] = "Number too long";
7098 /* We use the first character to decide what type of number this is */
7102 Perl_croak(aTHX_ "panic: scan_num");
7104 /* if it starts with a 0, it could be an octal number, a decimal in
7105 0.13 disguise, or a hexadecimal number, or a binary number. */
7109 u holds the "number so far"
7110 shift the power of 2 of the base
7111 (hex == 4, octal == 3, binary == 1)
7112 overflowed was the number more than we can hold?
7114 Shift is used when we add a digit. It also serves as an "are
7115 we in octal/hex/binary?" indicator to disallow hex characters
7121 bool overflowed = FALSE;
7122 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7123 static char* bases[5] = { "", "binary", "", "octal",
7125 static char* Bases[5] = { "", "Binary", "", "Octal",
7127 static char *maxima[5] = { "",
7128 "0b11111111111111111111111111111111",
7132 char *base, *Base, *max;
7138 } else if (s[1] == 'b') {
7142 /* check for a decimal in disguise */
7143 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7145 /* so it must be octal */
7152 if (ckWARN(WARN_SYNTAX))
7153 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7154 "Misplaced _ in number");
7158 base = bases[shift];
7159 Base = Bases[shift];
7160 max = maxima[shift];
7162 /* read the rest of the number */
7164 /* x is used in the overflow test,
7165 b is the digit we're adding on. */
7170 /* if we don't mention it, we're done */
7174 /* _ are ignored -- but warned about if consecutive */
7176 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7177 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7178 "Misplaced _ in number");
7182 /* 8 and 9 are not octal */
7185 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7189 case '2': case '3': case '4':
7190 case '5': case '6': case '7':
7192 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7196 b = *s++ & 15; /* ASCII digit -> value of digit */
7200 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7201 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7202 /* make sure they said 0x */
7207 /* Prepare to put the digit we have onto the end
7208 of the number so far. We check for overflows.
7213 x = u << shift; /* make room for the digit */
7215 if ((x >> shift) != u
7216 && !(PL_hints & HINT_NEW_BINARY)) {
7219 if (ckWARN_d(WARN_OVERFLOW))
7220 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7221 "Integer overflow in %s number",
7224 u = x | b; /* add the digit to the end */
7227 n *= nvshift[shift];
7228 /* If an NV has not enough bits in its
7229 * mantissa to represent an UV this summing of
7230 * small low-order numbers is a waste of time
7231 * (because the NV cannot preserve the
7232 * low-order bits anyway): we could just
7233 * remember when did we overflow and in the
7234 * end just multiply n by the right
7242 /* if we get here, we had success: make a scalar value from
7247 /* final misplaced underbar check */
7249 if (ckWARN(WARN_SYNTAX))
7250 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7255 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7256 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7257 "%s number > %s non-portable",
7263 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7264 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7265 "%s number > %s non-portable",
7270 if (PL_hints & HINT_NEW_BINARY)
7271 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7276 handle decimal numbers.
7277 we're also sent here when we read a 0 as the first digit
7279 case '1': case '2': case '3': case '4': case '5':
7280 case '6': case '7': case '8': case '9': case '.':
7283 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7286 /* read next group of digits and _ and copy into d */
7287 while (isDIGIT(*s) || *s == '_') {
7288 /* skip underscores, checking for misplaced ones
7292 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7293 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7294 "Misplaced _ in number");
7298 /* check for end of fixed-length buffer */
7300 Perl_croak(aTHX_ number_too_long);
7301 /* if we're ok, copy the character */
7306 /* final misplaced underbar check */
7307 if (lastub && s == lastub + 1) {
7308 if (ckWARN(WARN_SYNTAX))
7309 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7312 /* read a decimal portion if there is one. avoid
7313 3..5 being interpreted as the number 3. followed
7316 if (*s == '.' && s[1] != '.') {
7321 if (ckWARN(WARN_SYNTAX))
7322 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7323 "Misplaced _ in number");
7327 /* copy, ignoring underbars, until we run out of digits.
7329 for (; isDIGIT(*s) || *s == '_'; s++) {
7330 /* fixed length buffer check */
7332 Perl_croak(aTHX_ number_too_long);
7334 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7335 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7336 "Misplaced _ in number");
7342 /* fractional part ending in underbar? */
7344 if (ckWARN(WARN_SYNTAX))
7345 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7346 "Misplaced _ in number");
7348 if (*s == '.' && isDIGIT(s[1])) {
7349 /* oops, it's really a v-string, but without the "v" */
7355 /* read exponent part, if present */
7356 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7360 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7361 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7363 /* stray preinitial _ */
7365 if (ckWARN(WARN_SYNTAX))
7366 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7367 "Misplaced _ in number");
7371 /* allow positive or negative exponent */
7372 if (*s == '+' || *s == '-')
7375 /* stray initial _ */
7377 if (ckWARN(WARN_SYNTAX))
7378 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7379 "Misplaced _ in number");
7383 /* read digits of exponent */
7384 while (isDIGIT(*s) || *s == '_') {
7387 Perl_croak(aTHX_ number_too_long);
7391 if (ckWARN(WARN_SYNTAX) &&
7392 ((lastub && s == lastub + 1) ||
7393 (!isDIGIT(s[1]) && s[1] != '_')))
7394 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7395 "Misplaced _ in number");
7402 /* make an sv from the string */
7406 We try to do an integer conversion first if no characters
7407 indicating "float" have been found.
7412 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7414 if (flags == IS_NUMBER_IN_UV) {
7416 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7419 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7420 if (uv <= (UV) IV_MIN)
7421 sv_setiv(sv, -(IV)uv);
7428 /* terminate the string */
7430 nv = Atof(PL_tokenbuf);
7434 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7435 (PL_hints & HINT_NEW_INTEGER) )
7436 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7437 (floatit ? "float" : "integer"),
7441 /* if it starts with a v, it could be a v-string */
7444 sv = NEWSV(92,5); /* preallocate storage space */
7445 s = scan_vstring(s,sv);
7449 /* make the op for the constant and return */
7452 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7454 lvalp->opval = Nullop;
7460 S_scan_formline(pTHX_ register char *s)
7464 SV *stuff = newSVpvn("",0);
7465 bool needargs = FALSE;
7468 if (*s == '.' || *s == /*{*/'}') {
7470 #ifdef PERL_STRICT_CR
7471 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7473 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7475 if (*t == '\n' || t == PL_bufend)
7478 if (PL_in_eval && !PL_rsfp) {
7479 eol = strchr(s,'\n');
7484 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7486 for (t = s; t < eol; t++) {
7487 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7489 goto enough; /* ~~ must be first line in formline */
7491 if (*t == '@' || *t == '^')
7495 sv_catpvn(stuff, s, eol-s);
7496 #ifndef PERL_STRICT_CR
7497 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7498 char *end = SvPVX(stuff) + SvCUR(stuff);
7510 s = filter_gets(PL_linestr, PL_rsfp, 0);
7511 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7512 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7513 PL_last_lop = PL_last_uni = Nullch;
7516 yyerror("Format not terminated");
7526 PL_lex_state = LEX_NORMAL;
7527 PL_nextval[PL_nexttoke].ival = 0;
7531 PL_lex_state = LEX_FORMLINE;
7532 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7534 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7538 SvREFCNT_dec(stuff);
7539 PL_lex_formbrack = 0;
7550 PL_cshlen = strlen(PL_cshname);
7555 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7557 I32 oldsavestack_ix = PL_savestack_ix;
7558 CV* outsidecv = PL_compcv;
7561 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7563 SAVEI32(PL_subline);
7564 save_item(PL_subname);
7565 SAVESPTR(PL_compcv);
7567 PL_compcv = (CV*)NEWSV(1104,0);
7568 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7569 CvFLAGS(PL_compcv) |= flags;
7571 PL_subline = CopLINE(PL_curcop);
7572 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7573 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7574 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7576 return oldsavestack_ix;
7580 #pragma segment Perl_yylex
7583 Perl_yywarn(pTHX_ char *s)
7585 PL_in_eval |= EVAL_WARNONLY;
7587 PL_in_eval &= ~EVAL_WARNONLY;
7592 Perl_yyerror(pTHX_ char *s)
7595 char *context = NULL;
7599 if (!yychar || (yychar == ';' && !PL_rsfp))
7601 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7602 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7605 The code below is removed for NetWare because it abends/crashes on NetWare
7606 when the script has error such as not having the closing quotes like:
7608 Checking of white spaces is anyway done in NetWare code.
7611 while (isSPACE(*PL_oldoldbufptr))
7614 context = PL_oldoldbufptr;
7615 contlen = PL_bufptr - PL_oldoldbufptr;
7617 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7618 PL_oldbufptr != PL_bufptr) {
7621 The code below is removed for NetWare because it abends/crashes on NetWare
7622 when the script has error such as not having the closing quotes like:
7624 Checking of white spaces is anyway done in NetWare code.
7627 while (isSPACE(*PL_oldbufptr))
7630 context = PL_oldbufptr;
7631 contlen = PL_bufptr - PL_oldbufptr;
7633 else if (yychar > 255)
7634 where = "next token ???";
7635 #ifdef USE_PURE_BISON
7636 /* GNU Bison sets the value -2 */
7637 else if (yychar == -2) {
7639 else if ((yychar & 127) == 127) {
7641 if (PL_lex_state == LEX_NORMAL ||
7642 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7643 where = "at end of line";
7644 else if (PL_lex_inpat)
7645 where = "within pattern";
7647 where = "within string";
7650 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7652 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7653 else if (isPRINT_LC(yychar))
7654 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7656 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7657 where = SvPVX(where_sv);
7659 msg = sv_2mortal(newSVpv(s, 0));
7660 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7661 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7663 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7665 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7666 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7667 Perl_sv_catpvf(aTHX_ msg,
7668 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7669 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7672 if (PL_in_eval & EVAL_WARNONLY)
7673 Perl_warn(aTHX_ "%"SVf, msg);
7676 if (PL_error_count >= 10) {
7677 if (PL_in_eval && SvCUR(ERRSV))
7678 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7679 ERRSV, OutCopFILE(PL_curcop));
7681 Perl_croak(aTHX_ "%s has too many errors.\n",
7682 OutCopFILE(PL_curcop));
7685 PL_in_my_stash = Nullhv;
7689 #pragma segment Main
7693 S_swallow_bom(pTHX_ U8 *s)
7696 slen = SvCUR(PL_linestr);
7700 /* UTF-16 little-endian */
7701 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7702 Perl_croak(aTHX_ "Unsupported script encoding");
7703 #ifndef PERL_NO_UTF16_FILTER
7704 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7706 if (PL_bufend > (char*)s) {
7710 filter_add(utf16rev_textfilter, NULL);
7711 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7712 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7713 PL_bufend - (char*)s - 1,
7715 Copy(news, s, newlen, U8);
7716 SvCUR_set(PL_linestr, newlen);
7717 PL_bufend = SvPVX(PL_linestr) + newlen;
7718 news[newlen++] = '\0';
7722 Perl_croak(aTHX_ "Unsupported script encoding");
7727 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7728 #ifndef PERL_NO_UTF16_FILTER
7729 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7731 if (PL_bufend > (char *)s) {
7735 filter_add(utf16_textfilter, NULL);
7736 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7737 PL_bufend = (char*)utf16_to_utf8(s, news,
7738 PL_bufend - (char*)s,
7740 Copy(news, s, newlen, U8);
7741 SvCUR_set(PL_linestr, newlen);
7742 PL_bufend = SvPVX(PL_linestr) + newlen;
7743 news[newlen++] = '\0';
7747 Perl_croak(aTHX_ "Unsupported script encoding");
7752 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7753 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7758 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7759 s[2] == 0xFE && s[3] == 0xFF)
7761 Perl_croak(aTHX_ "Unsupported script encoding");
7769 * Restore a source filter.
7773 restore_rsfp(pTHX_ void *f)
7775 PerlIO *fp = (PerlIO*)f;
7777 if (PL_rsfp == PerlIO_stdin())
7778 PerlIO_clearerr(PL_rsfp);
7779 else if (PL_rsfp && (PL_rsfp != fp))
7780 PerlIO_close(PL_rsfp);
7784 #ifndef PERL_NO_UTF16_FILTER
7786 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7788 I32 count = FILTER_READ(idx+1, sv, maxlen);
7793 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7794 if (!*SvPV_nolen(sv))
7795 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7798 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7799 sv_usepvn(sv, (char*)tmps, tend - tmps);
7805 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7807 I32 count = FILTER_READ(idx+1, sv, maxlen);
7812 if (!*SvPV_nolen(sv))
7813 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7816 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7817 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7818 sv_usepvn(sv, (char*)tmps, tend - tmps);