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));
1624 /* printf-style backslashes, formfeeds, newlines, etc */
1626 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1629 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1632 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1635 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1638 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1641 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1644 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1650 } /* end if (backslash) */
1653 /* If we started with encoded form, or already know we want it
1654 and then encode the next character */
1655 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1657 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1658 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1661 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1662 STRLEN off = d - SvPVX(sv);
1663 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1665 d = (char*)uvchr_to_utf8((U8*)d, uv);
1669 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1671 } /* while loop to process each character */
1673 /* terminate the string and set up the sv */
1675 SvCUR_set(sv, d - SvPVX(sv));
1676 if (SvCUR(sv) >= SvLEN(sv))
1677 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1680 if (PL_encoding && !has_utf8) {
1681 sv_recode_to_utf8(sv, PL_encoding);
1687 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1688 PL_sublex_info.sub_op->op_private |=
1689 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1693 /* shrink the sv if we allocated more than we used */
1694 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1695 SvLEN_set(sv, SvCUR(sv) + 1);
1696 Renew(SvPVX(sv), SvLEN(sv), char);
1699 /* return the substring (via yylval) only if we parsed anything */
1700 if (s > PL_bufptr) {
1701 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1702 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1704 ( PL_lex_inwhat == OP_TRANS
1706 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1709 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1716 * Returns TRUE if there's more to the expression (e.g., a subscript),
1719 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1721 * ->[ and ->{ return TRUE
1722 * { and [ outside a pattern are always subscripts, so return TRUE
1723 * if we're outside a pattern and it's not { or [, then return FALSE
1724 * if we're in a pattern and the first char is a {
1725 * {4,5} (any digits around the comma) returns FALSE
1726 * if we're in a pattern and the first char is a [
1728 * [SOMETHING] has a funky algorithm to decide whether it's a
1729 * character class or not. It has to deal with things like
1730 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1731 * anything else returns TRUE
1734 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1737 S_intuit_more(pTHX_ register char *s)
1739 if (PL_lex_brackets)
1741 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1743 if (*s != '{' && *s != '[')
1748 /* In a pattern, so maybe we have {n,m}. */
1765 /* On the other hand, maybe we have a character class */
1768 if (*s == ']' || *s == '^')
1771 /* this is terrifying, and it works */
1772 int weight = 2; /* let's weigh the evidence */
1774 unsigned char un_char = 255, last_un_char;
1775 char *send = strchr(s,']');
1776 char tmpbuf[sizeof PL_tokenbuf * 4];
1778 if (!send) /* has to be an expression */
1781 Zero(seen,256,char);
1784 else if (isDIGIT(*s)) {
1786 if (isDIGIT(s[1]) && s[2] == ']')
1792 for (; s < send; s++) {
1793 last_un_char = un_char;
1794 un_char = (unsigned char)*s;
1799 weight -= seen[un_char] * 10;
1800 if (isALNUM_lazy_if(s+1,UTF)) {
1801 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1802 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1807 else if (*s == '$' && s[1] &&
1808 strchr("[#!%*<>()-=",s[1])) {
1809 if (/*{*/ strchr("])} =",s[2]))
1818 if (strchr("wds]",s[1]))
1820 else if (seen['\''] || seen['"'])
1822 else if (strchr("rnftbxcav",s[1]))
1824 else if (isDIGIT(s[1])) {
1826 while (s[1] && isDIGIT(s[1]))
1836 if (strchr("aA01! ",last_un_char))
1838 if (strchr("zZ79~",s[1]))
1840 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1841 weight -= 5; /* cope with negative subscript */
1844 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1845 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1850 if (keyword(tmpbuf, d - tmpbuf))
1853 if (un_char == last_un_char + 1)
1855 weight -= seen[un_char];
1860 if (weight >= 0) /* probably a character class */
1870 * Does all the checking to disambiguate
1872 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1873 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1875 * First argument is the stuff after the first token, e.g. "bar".
1877 * Not a method if bar is a filehandle.
1878 * Not a method if foo is a subroutine prototyped to take a filehandle.
1879 * Not a method if it's really "Foo $bar"
1880 * Method if it's "foo $bar"
1881 * Not a method if it's really "print foo $bar"
1882 * Method if it's really "foo package::" (interpreted as package->foo)
1883 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1884 * Not a method if bar is a filehandle or package, but is quoted with
1889 S_intuit_method(pTHX_ char *start, GV *gv)
1891 char *s = start + (*start == '$');
1892 char tmpbuf[sizeof PL_tokenbuf];
1900 if ((cv = GvCVu(gv))) {
1901 char *proto = SvPVX(cv);
1911 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1912 /* start is the beginning of the possible filehandle/object,
1913 * and s is the end of it
1914 * tmpbuf is a copy of it
1917 if (*start == '$') {
1918 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1923 return *s == '(' ? FUNCMETH : METHOD;
1925 if (!keyword(tmpbuf, len)) {
1926 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1931 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1932 if (indirgv && GvCVu(indirgv))
1934 /* filehandle or package name makes it a method */
1935 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1937 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1938 return 0; /* no assumptions -- "=>" quotes bearword */
1940 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1941 newSVpvn(tmpbuf,len));
1942 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1946 return *s == '(' ? FUNCMETH : METHOD;
1954 * Return a string of Perl code to load the debugger. If PERL5DB
1955 * is set, it will return the contents of that, otherwise a
1956 * compile-time require of perl5db.pl.
1963 char *pdb = PerlEnv_getenv("PERL5DB");
1967 SETERRNO(0,SS_NORMAL);
1968 return "BEGIN { require 'perl5db.pl' }";
1974 /* Encoded script support. filter_add() effectively inserts a
1975 * 'pre-processing' function into the current source input stream.
1976 * Note that the filter function only applies to the current source file
1977 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1979 * The datasv parameter (which may be NULL) can be used to pass
1980 * private data to this instance of the filter. The filter function
1981 * can recover the SV using the FILTER_DATA macro and use it to
1982 * store private buffers and state information.
1984 * The supplied datasv parameter is upgraded to a PVIO type
1985 * and the IoDIRP/IoANY field is used to store the function pointer,
1986 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1987 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1988 * private use must be set using malloc'd pointers.
1992 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1997 if (!PL_rsfp_filters)
1998 PL_rsfp_filters = newAV();
2000 datasv = NEWSV(255,0);
2001 if (!SvUPGRADE(datasv, SVt_PVIO))
2002 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2003 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2004 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2005 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2006 (void*)funcp, SvPV_nolen(datasv)));
2007 av_unshift(PL_rsfp_filters, 1);
2008 av_store(PL_rsfp_filters, 0, datasv) ;
2013 /* Delete most recently added instance of this filter function. */
2015 Perl_filter_del(pTHX_ filter_t funcp)
2018 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2019 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2021 /* if filter is on top of stack (usual case) just pop it off */
2022 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2023 if (IoANY(datasv) == (void *)funcp) {
2024 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2025 IoANY(datasv) = (void *)NULL;
2026 sv_free(av_pop(PL_rsfp_filters));
2030 /* we need to search for the correct entry and clear it */
2031 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2035 /* Invoke the n'th filter function for the current rsfp. */
2037 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2040 /* 0 = read one text line */
2045 if (!PL_rsfp_filters)
2047 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2048 /* Provide a default input filter to make life easy. */
2049 /* Note that we append to the line. This is handy. */
2050 DEBUG_P(PerlIO_printf(Perl_debug_log,
2051 "filter_read %d: from rsfp\n", idx));
2055 int old_len = SvCUR(buf_sv) ;
2057 /* ensure buf_sv is large enough */
2058 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2059 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2060 if (PerlIO_error(PL_rsfp))
2061 return -1; /* error */
2063 return 0 ; /* end of file */
2065 SvCUR_set(buf_sv, old_len + len) ;
2068 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2069 if (PerlIO_error(PL_rsfp))
2070 return -1; /* error */
2072 return 0 ; /* end of file */
2075 return SvCUR(buf_sv);
2077 /* Skip this filter slot if filter has been deleted */
2078 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2079 DEBUG_P(PerlIO_printf(Perl_debug_log,
2080 "filter_read %d: skipped (filter deleted)\n",
2082 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2084 /* Get function pointer hidden within datasv */
2085 funcp = (filter_t)IoANY(datasv);
2086 DEBUG_P(PerlIO_printf(Perl_debug_log,
2087 "filter_read %d: via function %p (%s)\n",
2088 idx, (void*)funcp, SvPV_nolen(datasv)));
2089 /* Call function. The function is expected to */
2090 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2091 /* Return: <0:error, =0:eof, >0:not eof */
2092 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2096 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2098 #ifdef PERL_CR_FILTER
2099 if (!PL_rsfp_filters) {
2100 filter_add(S_cr_textfilter,NULL);
2103 if (PL_rsfp_filters) {
2106 SvCUR_set(sv, 0); /* start with empty line */
2107 if (FILTER_READ(0, sv, 0) > 0)
2108 return ( SvPVX(sv) ) ;
2113 return (sv_gets(sv, fp, append));
2117 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2121 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2125 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2126 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2128 return GvHV(gv); /* Foo:: */
2131 /* use constant CLASS => 'MyClass' */
2132 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2134 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2135 pkgname = SvPV_nolen(sv);
2139 return gv_stashpv(pkgname, FALSE);
2143 static char* exp_name[] =
2144 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2145 "ATTRTERM", "TERMBLOCK"
2152 Works out what to call the token just pulled out of the input
2153 stream. The yacc parser takes care of taking the ops we return and
2154 stitching them into a tree.
2160 if read an identifier
2161 if we're in a my declaration
2162 croak if they tried to say my($foo::bar)
2163 build the ops for a my() declaration
2164 if it's an access to a my() variable
2165 are we in a sort block?
2166 croak if my($a); $a <=> $b
2167 build ops for access to a my() variable
2168 if in a dq string, and they've said @foo and we can't find @foo
2170 build ops for a bareword
2171 if we already built the token before, use it.
2174 #ifdef USE_PURE_BISON
2176 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2181 yylval_pointer[yyactlevel] = lvalp;
2182 yychar_pointer[yyactlevel] = lcharp;
2183 if (yyactlevel >= YYMAXLEVEL)
2184 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2186 r = Perl_yylex(aTHX);
2196 #pragma segment Perl_yylex
2209 /* check if there's an identifier for us to look at */
2210 if (PL_pending_ident)
2211 return S_pending_ident(aTHX);
2213 /* no identifier pending identification */
2215 switch (PL_lex_state) {
2217 case LEX_NORMAL: /* Some compilers will produce faster */
2218 case LEX_INTERPNORMAL: /* code if we comment these out. */
2222 /* when we've already built the next token, just pull it out of the queue */
2225 yylval = PL_nextval[PL_nexttoke];
2227 PL_lex_state = PL_lex_defer;
2228 PL_expect = PL_lex_expect;
2229 PL_lex_defer = LEX_NORMAL;
2231 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2232 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2233 (IV)PL_nexttype[PL_nexttoke]); });
2235 return(PL_nexttype[PL_nexttoke]);
2237 /* interpolated case modifiers like \L \U, including \Q and \E.
2238 when we get here, PL_bufptr is at the \
2240 case LEX_INTERPCASEMOD:
2242 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2243 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2245 /* handle \E or end of string */
2246 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2250 if (PL_lex_casemods) {
2251 oldmod = PL_lex_casestack[--PL_lex_casemods];
2252 PL_lex_casestack[PL_lex_casemods] = '\0';
2254 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2256 PL_lex_state = LEX_INTERPCONCAT;
2260 if (PL_bufptr != PL_bufend)
2262 PL_lex_state = LEX_INTERPCONCAT;
2266 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2267 "### Saw case modifier at '%s'\n", PL_bufptr); });
2269 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2270 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2271 if (strchr("LU", *s) &&
2272 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2274 PL_lex_casestack[--PL_lex_casemods] = '\0';
2277 if (PL_lex_casemods > 10) {
2278 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2279 if (newlb != PL_lex_casestack) {
2281 PL_lex_casestack = newlb;
2284 PL_lex_casestack[PL_lex_casemods++] = *s;
2285 PL_lex_casestack[PL_lex_casemods] = '\0';
2286 PL_lex_state = LEX_INTERPCONCAT;
2287 PL_nextval[PL_nexttoke].ival = 0;
2290 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2292 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2294 PL_nextval[PL_nexttoke].ival = OP_LC;
2296 PL_nextval[PL_nexttoke].ival = OP_UC;
2298 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2300 Perl_croak(aTHX_ "panic: yylex");
2303 if (PL_lex_starts) {
2312 case LEX_INTERPPUSH:
2313 return sublex_push();
2315 case LEX_INTERPSTART:
2316 if (PL_bufptr == PL_bufend)
2317 return sublex_done();
2318 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2319 "### Interpolated variable at '%s'\n", PL_bufptr); });
2321 PL_lex_dojoin = (*PL_bufptr == '@');
2322 PL_lex_state = LEX_INTERPNORMAL;
2323 if (PL_lex_dojoin) {
2324 PL_nextval[PL_nexttoke].ival = 0;
2326 force_ident("\"", '$');
2327 PL_nextval[PL_nexttoke].ival = 0;
2329 PL_nextval[PL_nexttoke].ival = 0;
2331 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2334 if (PL_lex_starts++) {
2340 case LEX_INTERPENDMAYBE:
2341 if (intuit_more(PL_bufptr)) {
2342 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2348 if (PL_lex_dojoin) {
2349 PL_lex_dojoin = FALSE;
2350 PL_lex_state = LEX_INTERPCONCAT;
2353 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2354 && SvEVALED(PL_lex_repl))
2356 if (PL_bufptr != PL_bufend)
2357 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2358 PL_lex_repl = Nullsv;
2361 case LEX_INTERPCONCAT:
2363 if (PL_lex_brackets)
2364 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2366 if (PL_bufptr == PL_bufend)
2367 return sublex_done();
2369 if (SvIVX(PL_linestr) == '\'') {
2370 SV *sv = newSVsv(PL_linestr);
2373 else if ( PL_hints & HINT_NEW_RE )
2374 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2375 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2379 s = scan_const(PL_bufptr);
2381 PL_lex_state = LEX_INTERPCASEMOD;
2383 PL_lex_state = LEX_INTERPSTART;
2386 if (s != PL_bufptr) {
2387 PL_nextval[PL_nexttoke] = yylval;
2390 if (PL_lex_starts++)
2400 PL_lex_state = LEX_NORMAL;
2401 s = scan_formline(PL_bufptr);
2402 if (!PL_lex_formbrack)
2408 PL_oldoldbufptr = PL_oldbufptr;
2411 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2412 exp_name[PL_expect], s);
2418 if (isIDFIRST_lazy_if(s,UTF))
2420 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2423 goto fake_eof; /* emulate EOF on ^D or ^Z */
2428 if (PL_lex_brackets)
2429 yyerror("Missing right curly or square bracket");
2430 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2431 "### Tokener got EOF\n");
2435 if (s++ < PL_bufend)
2436 goto retry; /* ignore stray nulls */
2439 if (!PL_in_eval && !PL_preambled) {
2440 PL_preambled = TRUE;
2441 sv_setpv(PL_linestr,incl_perldb());
2442 if (SvCUR(PL_linestr))
2443 sv_catpv(PL_linestr,";");
2445 while(AvFILLp(PL_preambleav) >= 0) {
2446 SV *tmpsv = av_shift(PL_preambleav);
2447 sv_catsv(PL_linestr, tmpsv);
2448 sv_catpv(PL_linestr, ";");
2451 sv_free((SV*)PL_preambleav);
2452 PL_preambleav = NULL;
2454 if (PL_minus_n || PL_minus_p) {
2455 sv_catpv(PL_linestr, "LINE: while (<>) {");
2457 sv_catpv(PL_linestr,"chomp;");
2460 if (strchr("/'\"", *PL_splitstr)
2461 && strchr(PL_splitstr + 1, *PL_splitstr))
2462 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2465 s = "'~#\200\1'"; /* surely one char is unused...*/
2466 while (s[1] && strchr(PL_splitstr, *s)) s++;
2468 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2469 "q" + (delim == '\''), delim);
2470 for (s = PL_splitstr; *s; s++) {
2472 sv_catpvn(PL_linestr, "\\", 1);
2473 sv_catpvn(PL_linestr, s, 1);
2475 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2479 sv_catpv(PL_linestr,"our @F=split(' ');");
2482 sv_catpv(PL_linestr, "\n");
2483 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2484 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2485 PL_last_lop = PL_last_uni = Nullch;
2486 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2487 SV *sv = NEWSV(85,0);
2489 sv_upgrade(sv, SVt_PVMG);
2490 sv_setsv(sv,PL_linestr);
2493 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2498 bof = PL_rsfp ? TRUE : FALSE;
2499 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2502 if (PL_preprocess && !PL_in_eval)
2503 (void)PerlProc_pclose(PL_rsfp);
2504 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2505 PerlIO_clearerr(PL_rsfp);
2507 (void)PerlIO_close(PL_rsfp);
2509 PL_doextract = FALSE;
2511 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2512 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2513 sv_catpv(PL_linestr,";}");
2514 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2515 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2516 PL_last_lop = PL_last_uni = Nullch;
2517 PL_minus_n = PL_minus_p = 0;
2520 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2521 PL_last_lop = PL_last_uni = Nullch;
2522 sv_setpv(PL_linestr,"");
2523 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2525 /* if it looks like the start of a BOM, check if it in fact is */
2526 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2527 #ifdef PERLIO_IS_STDIO
2528 # ifdef __GNU_LIBRARY__
2529 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2530 # define FTELL_FOR_PIPE_IS_BROKEN
2534 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2535 # define FTELL_FOR_PIPE_IS_BROKEN
2540 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2541 /* This loses the possibility to detect the bof
2542 * situation on perl -P when the libc5 is being used.
2543 * Workaround? Maybe attach some extra state to PL_rsfp?
2546 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2548 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2551 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2552 s = swallow_bom((U8*)s);
2556 /* Incest with pod. */
2557 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2558 sv_setpv(PL_linestr, "");
2559 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2560 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2561 PL_last_lop = PL_last_uni = Nullch;
2562 PL_doextract = FALSE;
2566 } while (PL_doextract);
2567 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2568 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2569 SV *sv = NEWSV(85,0);
2571 sv_upgrade(sv, SVt_PVMG);
2572 sv_setsv(sv,PL_linestr);
2575 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2577 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2578 PL_last_lop = PL_last_uni = Nullch;
2579 if (CopLINE(PL_curcop) == 1) {
2580 while (s < PL_bufend && isSPACE(*s))
2582 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2586 if (*s == '#' && *(s+1) == '!')
2588 #ifdef ALTERNATE_SHEBANG
2590 static char as[] = ALTERNATE_SHEBANG;
2591 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2592 d = s + (sizeof(as) - 1);
2594 #endif /* ALTERNATE_SHEBANG */
2603 while (*d && !isSPACE(*d))
2607 #ifdef ARG_ZERO_IS_SCRIPT
2608 if (ipathend > ipath) {
2610 * HP-UX (at least) sets argv[0] to the script name,
2611 * which makes $^X incorrect. And Digital UNIX and Linux,
2612 * at least, set argv[0] to the basename of the Perl
2613 * interpreter. So, having found "#!", we'll set it right.
2615 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2616 assert(SvPOK(x) || SvGMAGICAL(x));
2617 if (sv_eq(x, CopFILESV(PL_curcop))) {
2618 sv_setpvn(x, ipath, ipathend - ipath);
2624 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2625 char *lstart = SvPV(x,llen);
2627 bstart += blen - llen;
2628 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2629 sv_setpvn(x, ipath, ipathend - ipath);
2634 TAINT_NOT; /* $^X is always tainted, but that's OK */
2636 #endif /* ARG_ZERO_IS_SCRIPT */
2641 d = instr(s,"perl -");
2643 d = instr(s,"perl");
2645 /* avoid getting into infinite loops when shebang
2646 * line contains "Perl" rather than "perl" */
2648 for (d = ipathend-4; d >= ipath; --d) {
2649 if ((*d == 'p' || *d == 'P')
2650 && !ibcmp(d, "perl", 4))
2660 #ifdef ALTERNATE_SHEBANG
2662 * If the ALTERNATE_SHEBANG on this system starts with a
2663 * character that can be part of a Perl expression, then if
2664 * we see it but not "perl", we're probably looking at the
2665 * start of Perl code, not a request to hand off to some
2666 * other interpreter. Similarly, if "perl" is there, but
2667 * not in the first 'word' of the line, we assume the line
2668 * contains the start of the Perl program.
2670 if (d && *s != '#') {
2672 while (*c && !strchr("; \t\r\n\f\v#", *c))
2675 d = Nullch; /* "perl" not in first word; ignore */
2677 *s = '#'; /* Don't try to parse shebang line */
2679 #endif /* ALTERNATE_SHEBANG */
2680 #ifndef MACOS_TRADITIONAL
2685 !instr(s,"indir") &&
2686 instr(PL_origargv[0],"perl"))
2692 while (s < PL_bufend && isSPACE(*s))
2694 if (s < PL_bufend) {
2695 Newz(899,newargv,PL_origargc+3,char*);
2697 while (s < PL_bufend && !isSPACE(*s))
2700 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2703 newargv = PL_origargv;
2705 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2706 Perl_croak(aTHX_ "Can't exec %s", ipath);
2710 U32 oldpdb = PL_perldb;
2711 bool oldn = PL_minus_n;
2712 bool oldp = PL_minus_p;
2714 while (*d && !isSPACE(*d)) d++;
2715 while (SPACE_OR_TAB(*d)) d++;
2718 bool switches_done = PL_doswitches;
2720 if (*d == 'M' || *d == 'm') {
2722 while (*d && !isSPACE(*d)) d++;
2723 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2726 d = moreswitches(d);
2728 if ((PERLDB_LINE && !oldpdb) ||
2729 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2730 /* if we have already added "LINE: while (<>) {",
2731 we must not do it again */
2733 sv_setpv(PL_linestr, "");
2734 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2735 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2736 PL_last_lop = PL_last_uni = Nullch;
2737 PL_preambled = FALSE;
2739 (void)gv_fetchfile(PL_origfilename);
2742 if (PL_doswitches && !switches_done) {
2743 int argc = PL_origargc;
2744 char **argv = PL_origargv;
2747 } while (argc && argv[0][0] == '-' && argv[0][1]);
2748 init_argv_symbols(argc,argv);
2754 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2756 PL_lex_state = LEX_FORMLINE;
2761 #ifdef PERL_STRICT_CR
2762 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2764 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2766 case ' ': case '\t': case '\f': case 013:
2767 #ifdef MACOS_TRADITIONAL
2774 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2775 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2776 /* handle eval qq[#line 1 "foo"\n ...] */
2777 CopLINE_dec(PL_curcop);
2781 while (s < d && *s != '\n')
2785 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2786 Perl_croak(aTHX_ "panic: input overflow");
2788 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2790 PL_lex_state = LEX_FORMLINE;
2800 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2807 while (s < PL_bufend && SPACE_OR_TAB(*s))
2810 if (strnEQ(s,"=>",2)) {
2811 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2812 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2813 "### Saw unary minus before =>, forcing word '%s'\n", s);
2815 OPERATOR('-'); /* unary minus */
2817 PL_last_uni = PL_oldbufptr;
2819 case 'r': ftst = OP_FTEREAD; break;
2820 case 'w': ftst = OP_FTEWRITE; break;
2821 case 'x': ftst = OP_FTEEXEC; break;
2822 case 'o': ftst = OP_FTEOWNED; break;
2823 case 'R': ftst = OP_FTRREAD; break;
2824 case 'W': ftst = OP_FTRWRITE; break;
2825 case 'X': ftst = OP_FTREXEC; break;
2826 case 'O': ftst = OP_FTROWNED; break;
2827 case 'e': ftst = OP_FTIS; break;
2828 case 'z': ftst = OP_FTZERO; break;
2829 case 's': ftst = OP_FTSIZE; break;
2830 case 'f': ftst = OP_FTFILE; break;
2831 case 'd': ftst = OP_FTDIR; break;
2832 case 'l': ftst = OP_FTLINK; break;
2833 case 'p': ftst = OP_FTPIPE; break;
2834 case 'S': ftst = OP_FTSOCK; break;
2835 case 'u': ftst = OP_FTSUID; break;
2836 case 'g': ftst = OP_FTSGID; break;
2837 case 'k': ftst = OP_FTSVTX; break;
2838 case 'b': ftst = OP_FTBLK; break;
2839 case 'c': ftst = OP_FTCHR; break;
2840 case 't': ftst = OP_FTTTY; break;
2841 case 'T': ftst = OP_FTTEXT; break;
2842 case 'B': ftst = OP_FTBINARY; break;
2843 case 'M': case 'A': case 'C':
2844 gv_fetchpv("\024",TRUE, SVt_PV);
2846 case 'M': ftst = OP_FTMTIME; break;
2847 case 'A': ftst = OP_FTATIME; break;
2848 case 'C': ftst = OP_FTCTIME; break;
2856 PL_last_lop_op = (OPCODE)ftst;
2857 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2858 "### Saw file test %c\n", (int)ftst);
2863 /* Assume it was a minus followed by a one-letter named
2864 * subroutine call (or a -bareword), then. */
2865 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2866 "### %c looked like a file test but was not\n",
2875 if (PL_expect == XOPERATOR)
2880 else if (*s == '>') {
2883 if (isIDFIRST_lazy_if(s,UTF)) {
2884 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2892 if (PL_expect == XOPERATOR)
2895 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2897 OPERATOR('-'); /* unary minus */
2904 if (PL_expect == XOPERATOR)
2909 if (PL_expect == XOPERATOR)
2912 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2918 if (PL_expect != XOPERATOR) {
2919 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2920 PL_expect = XOPERATOR;
2921 force_ident(PL_tokenbuf, '*');
2934 if (PL_expect == XOPERATOR) {
2938 PL_tokenbuf[0] = '%';
2939 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2940 if (!PL_tokenbuf[1]) {
2942 yyerror("Final % should be \\% or %name");
2945 PL_pending_ident = '%';
2964 switch (PL_expect) {
2967 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2969 PL_bufptr = s; /* update in case we back off */
2975 PL_expect = XTERMBLOCK;
2979 while (isIDFIRST_lazy_if(s,UTF)) {
2980 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2981 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2982 if (tmp < 0) tmp = -tmp;
2998 d = scan_str(d,TRUE,TRUE);
3000 /* MUST advance bufptr here to avoid bogus
3001 "at end of line" context messages from yyerror().
3003 PL_bufptr = s + len;
3004 yyerror("Unterminated attribute parameter in attribute list");
3007 return 0; /* EOF indicator */
3011 SV *sv = newSVpvn(s, len);
3012 sv_catsv(sv, PL_lex_stuff);
3013 attrs = append_elem(OP_LIST, attrs,
3014 newSVOP(OP_CONST, 0, sv));
3015 SvREFCNT_dec(PL_lex_stuff);
3016 PL_lex_stuff = Nullsv;
3019 /* NOTE: any CV attrs applied here need to be part of
3020 the CVf_BUILTIN_ATTRS define in cv.h! */
3021 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3022 CvLVALUE_on(PL_compcv);
3023 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3024 CvLOCKED_on(PL_compcv);
3025 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3026 CvMETHOD_on(PL_compcv);
3028 else if (PL_in_my == KEY_our && len == 6 &&
3029 strnEQ(s, "unique", len))
3030 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3032 /* After we've set the flags, it could be argued that
3033 we don't need to do the attributes.pm-based setting
3034 process, and shouldn't bother appending recognized
3035 flags. To experiment with that, uncomment the
3036 following "else". (Note that's already been
3037 uncommented. That keeps the above-applied built-in
3038 attributes from being intercepted (and possibly
3039 rejected) by a package's attribute routines, but is
3040 justified by the performance win for the common case
3041 of applying only built-in attributes.) */
3043 attrs = append_elem(OP_LIST, attrs,
3044 newSVOP(OP_CONST, 0,
3048 if (*s == ':' && s[1] != ':')
3051 break; /* require real whitespace or :'s */
3053 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3054 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3055 char q = ((*s == '\'') ? '"' : '\'');
3056 /* If here for an expression, and parsed no attrs, back off. */
3057 if (tmp == '=' && !attrs) {
3061 /* MUST advance bufptr here to avoid bogus "at end of line"
3062 context messages from yyerror().
3066 yyerror("Unterminated attribute list");
3068 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3076 PL_nextval[PL_nexttoke].opval = attrs;
3084 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3085 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3101 if (PL_lex_brackets <= 0)
3102 yyerror("Unmatched right square bracket");
3105 if (PL_lex_state == LEX_INTERPNORMAL) {
3106 if (PL_lex_brackets == 0) {
3107 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3108 PL_lex_state = LEX_INTERPEND;
3115 if (PL_lex_brackets > 100) {
3116 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3117 if (newlb != PL_lex_brackstack) {
3119 PL_lex_brackstack = newlb;
3122 switch (PL_expect) {
3124 if (PL_lex_formbrack) {
3128 if (PL_oldoldbufptr == PL_last_lop)
3129 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3131 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3132 OPERATOR(HASHBRACK);
3134 while (s < PL_bufend && SPACE_OR_TAB(*s))
3137 PL_tokenbuf[0] = '\0';
3138 if (d < PL_bufend && *d == '-') {
3139 PL_tokenbuf[0] = '-';
3141 while (d < PL_bufend && SPACE_OR_TAB(*d))
3144 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3145 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3147 while (d < PL_bufend && SPACE_OR_TAB(*d))
3150 char minus = (PL_tokenbuf[0] == '-');
3151 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3159 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3164 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3169 if (PL_oldoldbufptr == PL_last_lop)
3170 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3172 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3175 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3177 /* This hack is to get the ${} in the message. */
3179 yyerror("syntax error");
3182 OPERATOR(HASHBRACK);
3184 /* This hack serves to disambiguate a pair of curlies
3185 * as being a block or an anon hash. Normally, expectation
3186 * determines that, but in cases where we're not in a
3187 * position to expect anything in particular (like inside
3188 * eval"") we have to resolve the ambiguity. This code
3189 * covers the case where the first term in the curlies is a
3190 * quoted string. Most other cases need to be explicitly
3191 * disambiguated by prepending a `+' before the opening
3192 * curly in order to force resolution as an anon hash.
3194 * XXX should probably propagate the outer expectation
3195 * into eval"" to rely less on this hack, but that could
3196 * potentially break current behavior of eval"".
3200 if (*s == '\'' || *s == '"' || *s == '`') {
3201 /* common case: get past first string, handling escapes */
3202 for (t++; t < PL_bufend && *t != *s;)
3203 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3207 else if (*s == 'q') {
3210 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3214 char open, close, term;
3217 while (t < PL_bufend && isSPACE(*t))
3221 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3225 for (t++; t < PL_bufend; t++) {
3226 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3228 else if (*t == open)
3232 for (t++; t < PL_bufend; t++) {
3233 if (*t == '\\' && t+1 < PL_bufend)
3235 else if (*t == close && --brackets <= 0)
3237 else if (*t == open)
3243 else if (isALNUM_lazy_if(t,UTF)) {
3245 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3248 while (t < PL_bufend && isSPACE(*t))
3250 /* if comma follows first term, call it an anon hash */
3251 /* XXX it could be a comma expression with loop modifiers */
3252 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3253 || (*t == '=' && t[1] == '>')))
3254 OPERATOR(HASHBRACK);
3255 if (PL_expect == XREF)
3258 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3264 yylval.ival = CopLINE(PL_curcop);
3265 if (isSPACE(*s) || *s == '#')
3266 PL_copline = NOLINE; /* invalidate current command line number */
3271 if (PL_lex_brackets <= 0)
3272 yyerror("Unmatched right curly bracket");
3274 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3275 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3276 PL_lex_formbrack = 0;
3277 if (PL_lex_state == LEX_INTERPNORMAL) {
3278 if (PL_lex_brackets == 0) {
3279 if (PL_expect & XFAKEBRACK) {
3280 PL_expect &= XENUMMASK;
3281 PL_lex_state = LEX_INTERPEND;
3283 return yylex(); /* ignore fake brackets */
3285 if (*s == '-' && s[1] == '>')
3286 PL_lex_state = LEX_INTERPENDMAYBE;
3287 else if (*s != '[' && *s != '{')
3288 PL_lex_state = LEX_INTERPEND;
3291 if (PL_expect & XFAKEBRACK) {
3292 PL_expect &= XENUMMASK;
3294 return yylex(); /* ignore fake brackets */
3304 if (PL_expect == XOPERATOR) {
3305 if (ckWARN(WARN_SEMICOLON)
3306 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3308 CopLINE_dec(PL_curcop);
3309 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3310 CopLINE_inc(PL_curcop);
3315 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3317 PL_expect = XOPERATOR;
3318 force_ident(PL_tokenbuf, '&');
3322 yylval.ival = (OPpENTERSUB_AMPER<<8);
3341 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3342 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3344 if (PL_expect == XSTATE && isALPHA(tmp) &&
3345 (s == PL_linestart+1 || s[-2] == '\n') )
3347 if (PL_in_eval && !PL_rsfp) {
3352 if (strnEQ(s,"=cut",4)) {
3366 PL_doextract = TRUE;
3369 if (PL_lex_brackets < PL_lex_formbrack) {
3371 #ifdef PERL_STRICT_CR
3372 for (t = s; SPACE_OR_TAB(*t); t++) ;
3374 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3376 if (*t == '\n' || *t == '#') {
3394 if (PL_expect != XOPERATOR) {
3395 if (s[1] != '<' && !strchr(s,'>'))
3398 s = scan_heredoc(s);
3400 s = scan_inputsymbol(s);
3401 TERM(sublex_start());
3406 SHop(OP_LEFT_SHIFT);
3420 SHop(OP_RIGHT_SHIFT);
3429 if (PL_expect == XOPERATOR) {
3430 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3433 return ','; /* grandfather non-comma-format format */
3437 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3438 PL_tokenbuf[0] = '@';
3439 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3440 sizeof PL_tokenbuf - 1, FALSE);
3441 if (PL_expect == XOPERATOR)
3442 no_op("Array length", s);
3443 if (!PL_tokenbuf[1])
3445 PL_expect = XOPERATOR;
3446 PL_pending_ident = '#';
3450 PL_tokenbuf[0] = '$';
3451 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3452 sizeof PL_tokenbuf - 1, FALSE);
3453 if (PL_expect == XOPERATOR)
3455 if (!PL_tokenbuf[1]) {
3457 yyerror("Final $ should be \\$ or $name");
3461 /* This kludge not intended to be bulletproof. */
3462 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3463 yylval.opval = newSVOP(OP_CONST, 0,
3464 newSViv(PL_compiling.cop_arybase));
3465 yylval.opval->op_private = OPpCONST_ARYBASE;
3471 if (PL_lex_state == LEX_NORMAL)
3474 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3477 PL_tokenbuf[0] = '@';
3478 if (ckWARN(WARN_SYNTAX)) {
3480 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3483 PL_bufptr = skipspace(PL_bufptr);
3484 while (t < PL_bufend && *t != ']')
3486 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3487 "Multidimensional syntax %.*s not supported",
3488 (t - PL_bufptr) + 1, PL_bufptr);
3492 else if (*s == '{') {
3493 PL_tokenbuf[0] = '%';
3494 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3495 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3497 char tmpbuf[sizeof PL_tokenbuf];
3499 for (t++; isSPACE(*t); t++) ;
3500 if (isIDFIRST_lazy_if(t,UTF)) {
3501 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3502 for (; isSPACE(*t); t++) ;
3503 if (*t == ';' && get_cv(tmpbuf, FALSE))
3504 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3505 "You need to quote \"%s\"", tmpbuf);
3511 PL_expect = XOPERATOR;
3512 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3513 bool islop = (PL_last_lop == PL_oldoldbufptr);
3514 if (!islop || PL_last_lop_op == OP_GREPSTART)
3515 PL_expect = XOPERATOR;
3516 else if (strchr("$@\"'`q", *s))
3517 PL_expect = XTERM; /* e.g. print $fh "foo" */
3518 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3519 PL_expect = XTERM; /* e.g. print $fh &sub */
3520 else if (isIDFIRST_lazy_if(s,UTF)) {
3521 char tmpbuf[sizeof PL_tokenbuf];
3522 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3523 if ((tmp = keyword(tmpbuf, len))) {
3524 /* binary operators exclude handle interpretations */
3536 PL_expect = XTERM; /* e.g. print $fh length() */
3541 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3542 if (gv && GvCVu(gv))
3543 PL_expect = XTERM; /* e.g. print $fh subr() */
3546 else if (isDIGIT(*s))
3547 PL_expect = XTERM; /* e.g. print $fh 3 */
3548 else if (*s == '.' && isDIGIT(s[1]))
3549 PL_expect = XTERM; /* e.g. print $fh .3 */
3550 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3551 PL_expect = XTERM; /* e.g. print $fh -1 */
3552 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3553 PL_expect = XTERM; /* e.g. print $fh /.../
3554 XXX except DORDOR operator */
3555 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3556 PL_expect = XTERM; /* print $fh <<"EOF" */
3558 PL_pending_ident = '$';
3562 if (PL_expect == XOPERATOR)
3564 PL_tokenbuf[0] = '@';
3565 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3566 if (!PL_tokenbuf[1]) {
3568 yyerror("Final @ should be \\@ or @name");
3571 if (PL_lex_state == LEX_NORMAL)
3573 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3575 PL_tokenbuf[0] = '%';
3577 /* Warn about @ where they meant $. */
3578 if (ckWARN(WARN_SYNTAX)) {
3579 if (*s == '[' || *s == '{') {
3581 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3583 if (*t == '}' || *t == ']') {
3585 PL_bufptr = skipspace(PL_bufptr);
3586 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3587 "Scalar value %.*s better written as $%.*s",
3588 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3593 PL_pending_ident = '@';
3596 case '/': /* may be division, defined-or, or pattern */
3597 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3601 case '?': /* may either be conditional or pattern */
3602 if(PL_expect == XOPERATOR) {
3610 /* A // operator. */
3620 /* Disable warning on "study /blah/" */
3621 if (PL_oldoldbufptr == PL_last_uni
3622 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3623 || memNE(PL_last_uni, "study", 5)
3624 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3627 s = scan_pat(s,OP_MATCH);
3628 TERM(sublex_start());
3632 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3633 #ifdef PERL_STRICT_CR
3636 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3638 && (s == PL_linestart || s[-1] == '\n') )
3640 PL_lex_formbrack = 0;
3644 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3650 yylval.ival = OPf_SPECIAL;
3656 if (PL_expect != XOPERATOR)
3661 case '0': case '1': case '2': case '3': case '4':
3662 case '5': case '6': case '7': case '8': case '9':
3663 s = scan_num(s, &yylval);
3664 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3665 "### Saw number in '%s'\n", s);
3667 if (PL_expect == XOPERATOR)
3672 s = scan_str(s,FALSE,FALSE);
3673 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3674 "### Saw string before '%s'\n", s);
3676 if (PL_expect == XOPERATOR) {
3677 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3680 return ','; /* grandfather non-comma-format format */
3686 missingterm((char*)0);
3687 yylval.ival = OP_CONST;
3688 TERM(sublex_start());
3691 s = scan_str(s,FALSE,FALSE);
3692 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3693 "### Saw string before '%s'\n", s);
3695 if (PL_expect == XOPERATOR) {
3696 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3699 return ','; /* grandfather non-comma-format format */
3705 missingterm((char*)0);
3706 yylval.ival = OP_CONST;
3707 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3708 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3709 yylval.ival = OP_STRINGIFY;
3713 TERM(sublex_start());
3716 s = scan_str(s,FALSE,FALSE);
3717 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3718 "### Saw backtick string before '%s'\n", s);
3720 if (PL_expect == XOPERATOR)
3721 no_op("Backticks",s);
3723 missingterm((char*)0);
3724 yylval.ival = OP_BACKTICK;
3726 TERM(sublex_start());
3730 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3731 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3733 if (PL_expect == XOPERATOR)
3734 no_op("Backslash",s);
3738 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3742 while (isDIGIT(*start) || *start == '_')
3744 if (*start == '.' && isDIGIT(start[1])) {
3745 s = scan_num(s, &yylval);
3748 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3749 else if (!isALPHA(*start) && (PL_expect == XTERM
3750 || PL_expect == XREF || PL_expect == XSTATE
3751 || PL_expect == XTERMORDORDOR)) {
3755 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3758 s = scan_num(s, &yylval);
3765 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3800 I32 orig_keyword = 0;
3805 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3807 /* Some keywords can be followed by any delimiter, including ':' */
3808 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3809 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3810 (PL_tokenbuf[0] == 'q' &&
3811 strchr("qwxr", PL_tokenbuf[1])))));
3813 /* x::* is just a word, unless x is "CORE" */
3814 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3818 while (d < PL_bufend && isSPACE(*d))
3819 d++; /* no comments skipped here, or s### is misparsed */
3821 /* Is this a label? */
3822 if (!tmp && PL_expect == XSTATE
3823 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3825 yylval.pval = savepv(PL_tokenbuf);
3830 /* Check for keywords */
3831 tmp = keyword(PL_tokenbuf, len);
3833 /* Is this a word before a => operator? */
3834 if (*d == '=' && d[1] == '>') {
3836 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3837 yylval.opval->op_private = OPpCONST_BARE;
3838 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3839 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3843 if (tmp < 0) { /* second-class keyword? */
3844 GV *ogv = Nullgv; /* override (winner) */
3845 GV *hgv = Nullgv; /* hidden (loser) */
3846 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3848 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3851 if (GvIMPORTED_CV(gv))
3853 else if (! CvMETHOD(cv))
3857 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3858 (gv = *gvp) != (GV*)&PL_sv_undef &&
3859 GvCVu(gv) && GvIMPORTED_CV(gv))
3866 tmp = 0; /* overridden by import or by GLOBAL */
3869 && -tmp==KEY_lock /* XXX generalizable kludge */
3871 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3873 tmp = 0; /* any sub overrides "weak" keyword */
3875 else { /* no override */
3877 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3878 Perl_warner(aTHX_ packWARN(WARN_MISC),
3879 "dump() better written as CORE::dump()");
3883 if (ckWARN(WARN_AMBIGUOUS) && hgv
3884 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3885 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3886 "Ambiguous call resolved as CORE::%s(), %s",
3887 GvENAME(hgv), "qualify as such or use &");
3894 default: /* not a keyword */
3898 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3900 /* Get the rest if it looks like a package qualifier */
3902 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3904 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3907 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3908 *s == '\'' ? "'" : "::");
3913 if (PL_expect == XOPERATOR) {
3914 if (PL_bufptr == PL_linestart) {
3915 CopLINE_dec(PL_curcop);
3916 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3917 CopLINE_inc(PL_curcop);
3920 no_op("Bareword",s);
3923 /* Look for a subroutine with this name in current package,
3924 unless name is "Foo::", in which case Foo is a bearword
3925 (and a package name). */
3928 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3930 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3931 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3932 "Bareword \"%s\" refers to nonexistent package",
3935 PL_tokenbuf[len] = '\0';
3942 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3945 /* if we saw a global override before, get the right name */
3948 sv = newSVpvn("CORE::GLOBAL::",14);
3949 sv_catpv(sv,PL_tokenbuf);
3952 sv = newSVpv(PL_tokenbuf,0);
3954 /* Presume this is going to be a bareword of some sort. */
3957 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3958 yylval.opval->op_private = OPpCONST_BARE;
3959 /* UTF-8 package name? */
3960 if (UTF && !IN_BYTES &&
3961 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3964 /* And if "Foo::", then that's what it certainly is. */
3969 /* See if it's the indirect object for a list operator. */
3971 if (PL_oldoldbufptr &&
3972 PL_oldoldbufptr < PL_bufptr &&
3973 (PL_oldoldbufptr == PL_last_lop
3974 || PL_oldoldbufptr == PL_last_uni) &&
3975 /* NO SKIPSPACE BEFORE HERE! */
3976 (PL_expect == XREF ||
3977 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3979 bool immediate_paren = *s == '(';
3981 /* (Now we can afford to cross potential line boundary.) */
3984 /* Two barewords in a row may indicate method call. */
3986 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3989 /* If not a declared subroutine, it's an indirect object. */
3990 /* (But it's an indir obj regardless for sort.) */
3992 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3993 ((!gv || !GvCVu(gv)) &&
3994 (PL_last_lop_op != OP_MAPSTART &&
3995 PL_last_lop_op != OP_GREPSTART))))
3997 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4002 PL_expect = XOPERATOR;
4005 /* Is this a word before a => operator? */
4006 if (*s == '=' && s[1] == '>' && !pkgname) {
4008 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4009 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4010 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4014 /* If followed by a paren, it's certainly a subroutine. */
4017 if (gv && GvCVu(gv)) {
4018 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4019 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4024 PL_nextval[PL_nexttoke].opval = yylval.opval;
4025 PL_expect = XOPERATOR;
4031 /* If followed by var or block, call it a method (unless sub) */
4033 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4034 PL_last_lop = PL_oldbufptr;
4035 PL_last_lop_op = OP_METHOD;
4039 /* If followed by a bareword, see if it looks like indir obj. */
4042 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4043 && (tmp = intuit_method(s,gv)))
4046 /* Not a method, so call it a subroutine (if defined) */
4048 if (gv && GvCVu(gv)) {
4050 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4051 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4052 "Ambiguous use of -%s resolved as -&%s()",
4053 PL_tokenbuf, PL_tokenbuf);
4054 /* Check for a constant sub */
4056 if ((sv = cv_const_sv(cv))) {
4058 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4059 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4060 yylval.opval->op_private = 0;
4064 /* Resolve to GV now. */
4065 op_free(yylval.opval);
4066 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4067 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4068 PL_last_lop = PL_oldbufptr;
4069 PL_last_lop_op = OP_ENTERSUB;
4070 /* Is there a prototype? */
4073 char *proto = SvPV((SV*)cv, len);
4076 if (strEQ(proto, "$"))
4078 if (*proto == '&' && *s == '{') {
4079 sv_setpv(PL_subname, PL_curstash ?
4080 "__ANON__" : "__ANON__::__ANON__");
4084 PL_nextval[PL_nexttoke].opval = yylval.opval;
4090 /* Call it a bare word */
4092 if (PL_hints & HINT_STRICT_SUBS)
4093 yylval.opval->op_private |= OPpCONST_STRICT;
4096 if (ckWARN(WARN_RESERVED)) {
4097 if (lastchar != '-') {
4098 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4099 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4100 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4107 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4108 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4109 "Operator or semicolon missing before %c%s",
4110 lastchar, PL_tokenbuf);
4111 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4112 "Ambiguous use of %c resolved as operator %c",
4113 lastchar, lastchar);
4119 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4120 newSVpv(CopFILE(PL_curcop),0));
4124 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4125 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4128 case KEY___PACKAGE__:
4129 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4131 ? newSVsv(PL_curstname)
4140 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4141 char *pname = "main";
4142 if (PL_tokenbuf[2] == 'D')
4143 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4144 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4147 GvIOp(gv) = newIO();
4148 IoIFP(GvIOp(gv)) = PL_rsfp;
4149 #if defined(HAS_FCNTL) && defined(F_SETFD)
4151 int fd = PerlIO_fileno(PL_rsfp);
4152 fcntl(fd,F_SETFD,fd >= 3);
4155 /* Mark this internal pseudo-handle as clean */
4156 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4158 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4159 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4160 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4162 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4163 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4164 /* if the script was opened in binmode, we need to revert
4165 * it to text mode for compatibility; but only iff it has CRs
4166 * XXX this is a questionable hack at best. */
4167 if (PL_bufend-PL_bufptr > 2
4168 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4171 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4172 loc = PerlIO_tell(PL_rsfp);
4173 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4176 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4178 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4179 #endif /* NETWARE */
4180 #ifdef PERLIO_IS_STDIO /* really? */
4181 # if defined(__BORLANDC__)
4182 /* XXX see note in do_binmode() */
4183 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4187 PerlIO_seek(PL_rsfp, loc, 0);
4191 #ifdef PERLIO_LAYERS
4192 if (UTF && !IN_BYTES)
4193 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4206 if (PL_expect == XSTATE) {
4213 if (*s == ':' && s[1] == ':') {
4216 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4217 if (!(tmp = keyword(PL_tokenbuf, len)))
4218 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4232 LOP(OP_ACCEPT,XTERM);
4238 LOP(OP_ATAN2,XTERM);
4244 LOP(OP_BINMODE,XTERM);
4247 LOP(OP_BLESS,XTERM);
4256 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4273 if (!PL_cryptseen) {
4274 PL_cryptseen = TRUE;
4278 LOP(OP_CRYPT,XTERM);
4281 LOP(OP_CHMOD,XTERM);
4284 LOP(OP_CHOWN,XTERM);
4287 LOP(OP_CONNECT,XTERM);
4303 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4307 PL_hints |= HINT_BLOCK_SCOPE;
4317 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4318 LOP(OP_DBMOPEN,XTERM);
4324 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4331 yylval.ival = CopLINE(PL_curcop);
4345 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4346 UNIBRACK(OP_ENTEREVAL);
4364 case KEY_endhostent:
4370 case KEY_endservent:
4373 case KEY_endprotoent:
4384 yylval.ival = CopLINE(PL_curcop);
4386 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4388 if ((PL_bufend - p) >= 3 &&
4389 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4391 else if ((PL_bufend - p) >= 4 &&
4392 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4395 if (isIDFIRST_lazy_if(p,UTF)) {
4396 p = scan_ident(p, PL_bufend,
4397 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4401 Perl_croak(aTHX_ "Missing $ on loop variable");
4406 LOP(OP_FORMLINE,XTERM);
4412 LOP(OP_FCNTL,XTERM);
4418 LOP(OP_FLOCK,XTERM);
4427 LOP(OP_GREPSTART, XREF);
4430 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4445 case KEY_getpriority:
4446 LOP(OP_GETPRIORITY,XTERM);
4448 case KEY_getprotobyname:
4451 case KEY_getprotobynumber:
4452 LOP(OP_GPBYNUMBER,XTERM);
4454 case KEY_getprotoent:
4466 case KEY_getpeername:
4467 UNI(OP_GETPEERNAME);
4469 case KEY_gethostbyname:
4472 case KEY_gethostbyaddr:
4473 LOP(OP_GHBYADDR,XTERM);
4475 case KEY_gethostent:
4478 case KEY_getnetbyname:
4481 case KEY_getnetbyaddr:
4482 LOP(OP_GNBYADDR,XTERM);
4487 case KEY_getservbyname:
4488 LOP(OP_GSBYNAME,XTERM);
4490 case KEY_getservbyport:
4491 LOP(OP_GSBYPORT,XTERM);
4493 case KEY_getservent:
4496 case KEY_getsockname:
4497 UNI(OP_GETSOCKNAME);
4499 case KEY_getsockopt:
4500 LOP(OP_GSOCKOPT,XTERM);
4522 yylval.ival = CopLINE(PL_curcop);
4526 LOP(OP_INDEX,XTERM);
4532 LOP(OP_IOCTL,XTERM);
4544 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4576 LOP(OP_LISTEN,XTERM);
4585 s = scan_pat(s,OP_MATCH);
4586 TERM(sublex_start());
4589 LOP(OP_MAPSTART, XREF);
4592 LOP(OP_MKDIR,XTERM);
4595 LOP(OP_MSGCTL,XTERM);
4598 LOP(OP_MSGGET,XTERM);
4601 LOP(OP_MSGRCV,XTERM);
4604 LOP(OP_MSGSND,XTERM);
4610 if (isIDFIRST_lazy_if(s,UTF)) {
4611 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4612 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4614 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4615 if (!PL_in_my_stash) {
4618 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4626 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4633 if (PL_expect != XSTATE)
4634 yyerror("\"no\" not allowed in expression");
4635 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4636 s = force_version(s, FALSE);
4641 if (*s == '(' || (s = skipspace(s), *s == '('))
4648 if (isIDFIRST_lazy_if(s,UTF)) {
4650 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4652 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4654 && !(t[0] == '=' && t[1] == '>')
4656 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4657 "Precedence problem: open %.*s should be open(%.*s)",
4658 d - s, s, d - s, s);
4664 yylval.ival = OP_OR;
4674 LOP(OP_OPEN_DIR,XTERM);
4677 checkcomma(s,PL_tokenbuf,"filehandle");
4681 checkcomma(s,PL_tokenbuf,"filehandle");
4700 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4704 LOP(OP_PIPE_OP,XTERM);
4707 s = scan_str(s,FALSE,FALSE);
4709 missingterm((char*)0);
4710 yylval.ival = OP_CONST;
4711 TERM(sublex_start());
4717 s = scan_str(s,FALSE,FALSE);
4719 missingterm((char*)0);
4721 if (SvCUR(PL_lex_stuff)) {
4724 d = SvPV_force(PL_lex_stuff, len);
4727 for (; isSPACE(*d) && len; --len, ++d) ;
4730 if (!warned && ckWARN(WARN_QW)) {
4731 for (; !isSPACE(*d) && len; --len, ++d) {
4733 Perl_warner(aTHX_ packWARN(WARN_QW),
4734 "Possible attempt to separate words with commas");
4737 else if (*d == '#') {
4738 Perl_warner(aTHX_ packWARN(WARN_QW),
4739 "Possible attempt to put comments in qw() list");
4745 for (; !isSPACE(*d) && len; --len, ++d) ;
4747 sv = newSVpvn(b, d-b);
4748 if (DO_UTF8(PL_lex_stuff))
4750 words = append_elem(OP_LIST, words,
4751 newSVOP(OP_CONST, 0, tokeq(sv)));
4755 PL_nextval[PL_nexttoke].opval = words;
4760 SvREFCNT_dec(PL_lex_stuff);
4761 PL_lex_stuff = Nullsv;
4767 s = scan_str(s,FALSE,FALSE);
4769 missingterm((char*)0);
4770 yylval.ival = OP_STRINGIFY;
4771 if (SvIVX(PL_lex_stuff) == '\'')
4772 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4773 TERM(sublex_start());
4776 s = scan_pat(s,OP_QR);
4777 TERM(sublex_start());
4780 s = scan_str(s,FALSE,FALSE);
4782 missingterm((char*)0);
4783 yylval.ival = OP_BACKTICK;
4785 TERM(sublex_start());
4793 s = force_version(s, FALSE);
4795 else if (*s != 'v' || !isDIGIT(s[1])
4796 || (s = force_version(s, TRUE), *s == 'v'))
4798 *PL_tokenbuf = '\0';
4799 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4800 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4801 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4803 yyerror("<> should be quotes");
4811 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4815 LOP(OP_RENAME,XTERM);
4824 LOP(OP_RINDEX,XTERM);
4834 UNIDOR(OP_READLINE);
4847 LOP(OP_REVERSE,XTERM);
4850 UNIDOR(OP_READLINK);
4858 TERM(sublex_start());
4860 TOKEN(1); /* force error */
4869 LOP(OP_SELECT,XTERM);
4875 LOP(OP_SEMCTL,XTERM);
4878 LOP(OP_SEMGET,XTERM);
4881 LOP(OP_SEMOP,XTERM);
4887 LOP(OP_SETPGRP,XTERM);
4889 case KEY_setpriority:
4890 LOP(OP_SETPRIORITY,XTERM);
4892 case KEY_sethostent:
4898 case KEY_setservent:
4901 case KEY_setprotoent:
4911 LOP(OP_SEEKDIR,XTERM);
4913 case KEY_setsockopt:
4914 LOP(OP_SSOCKOPT,XTERM);
4920 LOP(OP_SHMCTL,XTERM);
4923 LOP(OP_SHMGET,XTERM);
4926 LOP(OP_SHMREAD,XTERM);
4929 LOP(OP_SHMWRITE,XTERM);
4932 LOP(OP_SHUTDOWN,XTERM);
4941 LOP(OP_SOCKET,XTERM);
4943 case KEY_socketpair:
4944 LOP(OP_SOCKPAIR,XTERM);
4947 checkcomma(s,PL_tokenbuf,"subroutine name");
4949 if (*s == ';' || *s == ')') /* probably a close */
4950 Perl_croak(aTHX_ "sort is now a reserved word");
4952 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4956 LOP(OP_SPLIT,XTERM);
4959 LOP(OP_SPRINTF,XTERM);
4962 LOP(OP_SPLICE,XTERM);
4977 LOP(OP_SUBSTR,XTERM);
4983 char tmpbuf[sizeof PL_tokenbuf];
4984 SSize_t tboffset = 0;
4985 expectation attrful;
4986 bool have_name, have_proto, bad_proto;
4991 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4992 (*s == ':' && s[1] == ':'))
4995 attrful = XATTRBLOCK;
4996 /* remember buffer pos'n for later force_word */
4997 tboffset = s - PL_oldbufptr;
4998 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4999 if (strchr(tmpbuf, ':'))
5000 sv_setpv(PL_subname, tmpbuf);
5002 sv_setsv(PL_subname,PL_curstname);
5003 sv_catpvn(PL_subname,"::",2);
5004 sv_catpvn(PL_subname,tmpbuf,len);
5011 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5012 PL_expect = XTERMBLOCK;
5013 attrful = XATTRTERM;
5014 sv_setpv(PL_subname,"?");
5018 if (key == KEY_format) {
5020 PL_lex_formbrack = PL_lex_brackets + 1;
5022 (void) force_word(PL_oldbufptr + tboffset, WORD,
5027 /* Look for a prototype */
5031 s = scan_str(s,FALSE,FALSE);
5033 Perl_croak(aTHX_ "Prototype not terminated");
5034 /* strip spaces and check for bad characters */
5035 d = SvPVX(PL_lex_stuff);
5038 for (p = d; *p; ++p) {
5041 if (!strchr("$@%*;[]&\\", *p))
5046 if (bad_proto && ckWARN(WARN_SYNTAX))
5047 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5048 "Illegal character in prototype for %s : %s",
5049 SvPVX(PL_subname), d);
5050 SvCUR(PL_lex_stuff) = tmp;
5058 if (*s == ':' && s[1] != ':')
5059 PL_expect = attrful;
5062 PL_nextval[PL_nexttoke].opval =
5063 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5064 PL_lex_stuff = Nullsv;
5068 sv_setpv(PL_subname,
5069 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5072 (void) force_word(PL_oldbufptr + tboffset, WORD,
5081 LOP(OP_SYSTEM,XREF);
5084 LOP(OP_SYMLINK,XTERM);
5087 LOP(OP_SYSCALL,XTERM);
5090 LOP(OP_SYSOPEN,XTERM);
5093 LOP(OP_SYSSEEK,XTERM);
5096 LOP(OP_SYSREAD,XTERM);
5099 LOP(OP_SYSWRITE,XTERM);
5103 TERM(sublex_start());
5124 LOP(OP_TRUNCATE,XTERM);
5136 yylval.ival = CopLINE(PL_curcop);
5140 yylval.ival = CopLINE(PL_curcop);
5144 LOP(OP_UNLINK,XTERM);
5150 LOP(OP_UNPACK,XTERM);
5153 LOP(OP_UTIME,XTERM);
5159 LOP(OP_UNSHIFT,XTERM);
5162 if (PL_expect != XSTATE)
5163 yyerror("\"use\" not allowed in expression");
5165 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5166 s = force_version(s, TRUE);
5167 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5168 PL_nextval[PL_nexttoke].opval = Nullop;
5171 else if (*s == 'v') {
5172 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5173 s = force_version(s, FALSE);
5177 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5178 s = force_version(s, FALSE);
5190 yylval.ival = CopLINE(PL_curcop);
5194 PL_hints |= HINT_BLOCK_SCOPE;
5201 LOP(OP_WAITPID,XTERM);
5210 ctl_l[0] = toCTRL('L');
5212 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5215 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5220 if (PL_expect == XOPERATOR)
5226 yylval.ival = OP_XOR;
5231 TERM(sublex_start());
5236 #pragma segment Main
5240 S_pending_ident(pTHX)
5244 /* pit holds the identifier we read and pending_ident is reset */
5245 char pit = PL_pending_ident;
5246 PL_pending_ident = 0;
5248 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5249 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5251 /* if we're in a my(), we can't allow dynamics here.
5252 $foo'bar has already been turned into $foo::bar, so
5253 just check for colons.
5255 if it's a legal name, the OP is a PADANY.
5258 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5259 if (strchr(PL_tokenbuf,':'))
5260 yyerror(Perl_form(aTHX_ "No package name allowed for "
5261 "variable %s in \"our\"",
5263 tmp = allocmy(PL_tokenbuf);
5266 if (strchr(PL_tokenbuf,':'))
5267 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5269 yylval.opval = newOP(OP_PADANY, 0);
5270 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5276 build the ops for accesses to a my() variable.
5278 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5279 then used in a comparison. This catches most, but not
5280 all cases. For instance, it catches
5281 sort { my($a); $a <=> $b }
5283 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5284 (although why you'd do that is anyone's guess).
5287 if (!strchr(PL_tokenbuf,':')) {
5288 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5289 /* might be an "our" variable" */
5290 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5291 /* build ops for a bareword */
5292 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5293 sv_catpvn(sym, "::", 2);
5294 sv_catpv(sym, PL_tokenbuf+1);
5295 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5296 yylval.opval->op_private = OPpCONST_ENTERED;
5297 gv_fetchpv(SvPVX(sym),
5299 ? (GV_ADDMULTI | GV_ADDINEVAL)
5302 ((PL_tokenbuf[0] == '$') ? SVt_PV
5303 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5308 /* if it's a sort block and they're naming $a or $b */
5309 if (PL_last_lop_op == OP_SORT &&
5310 PL_tokenbuf[0] == '$' &&
5311 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5314 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5315 d < PL_bufend && *d != '\n';
5318 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5319 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5325 yylval.opval = newOP(OP_PADANY, 0);
5326 yylval.opval->op_targ = tmp;
5332 Whine if they've said @foo in a doublequoted string,
5333 and @foo isn't a variable we can find in the symbol
5336 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5337 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5338 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5339 && ckWARN(WARN_AMBIGUOUS))
5341 /* Downgraded from fatal to warning 20000522 mjd */
5342 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5343 "Possible unintended interpolation of %s in string",
5348 /* build ops for a bareword */
5349 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5350 yylval.opval->op_private = OPpCONST_ENTERED;
5351 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5352 ((PL_tokenbuf[0] == '$') ? SVt_PV
5353 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5359 Perl_keyword(pTHX_ register char *d, I32 len)
5364 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5365 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5366 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5367 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5368 if (strEQ(d,"__END__")) return KEY___END__;
5372 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5377 if (strEQ(d,"and")) return -KEY_and;
5378 if (strEQ(d,"abs")) return -KEY_abs;
5381 if (strEQ(d,"alarm")) return -KEY_alarm;
5382 if (strEQ(d,"atan2")) return -KEY_atan2;
5385 if (strEQ(d,"accept")) return -KEY_accept;
5390 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5393 if (strEQ(d,"bless")) return -KEY_bless;
5394 if (strEQ(d,"bind")) return -KEY_bind;
5395 if (strEQ(d,"binmode")) return -KEY_binmode;
5398 if (strEQ(d,"CORE")) return -KEY_CORE;
5399 if (strEQ(d,"CHECK")) return KEY_CHECK;
5404 if (strEQ(d,"cmp")) return -KEY_cmp;
5405 if (strEQ(d,"chr")) return -KEY_chr;
5406 if (strEQ(d,"cos")) return -KEY_cos;
5409 if (strEQ(d,"chop")) return -KEY_chop;
5412 if (strEQ(d,"close")) return -KEY_close;
5413 if (strEQ(d,"chdir")) return -KEY_chdir;
5414 if (strEQ(d,"chomp")) return -KEY_chomp;
5415 if (strEQ(d,"chmod")) return -KEY_chmod;
5416 if (strEQ(d,"chown")) return -KEY_chown;
5417 if (strEQ(d,"crypt")) return -KEY_crypt;
5420 if (strEQ(d,"chroot")) return -KEY_chroot;
5421 if (strEQ(d,"caller")) return -KEY_caller;
5424 if (strEQ(d,"connect")) return -KEY_connect;
5427 if (strEQ(d,"closedir")) return -KEY_closedir;
5428 if (strEQ(d,"continue")) return -KEY_continue;
5433 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5438 if (strEQ(d,"do")) return KEY_do;
5441 if (strEQ(d,"die")) return -KEY_die;
5444 if (strEQ(d,"dump")) return -KEY_dump;
5447 if (strEQ(d,"delete")) return KEY_delete;
5450 if (strEQ(d,"defined")) return KEY_defined;
5451 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5454 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5459 if (strEQ(d,"END")) return KEY_END;
5464 if (strEQ(d,"eq")) return -KEY_eq;
5467 if (strEQ(d,"eof")) return -KEY_eof;
5468 if (strEQ(d,"err")) return -KEY_err;
5469 if (strEQ(d,"exp")) return -KEY_exp;
5472 if (strEQ(d,"else")) return KEY_else;
5473 if (strEQ(d,"exit")) return -KEY_exit;
5474 if (strEQ(d,"eval")) return KEY_eval;
5475 if (strEQ(d,"exec")) return -KEY_exec;
5476 if (strEQ(d,"each")) return -KEY_each;
5479 if (strEQ(d,"elsif")) return KEY_elsif;
5482 if (strEQ(d,"exists")) return KEY_exists;
5483 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5486 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5487 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5490 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5493 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5494 if (strEQ(d,"endservent")) return -KEY_endservent;
5497 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5504 if (strEQ(d,"for")) return KEY_for;
5507 if (strEQ(d,"fork")) return -KEY_fork;
5510 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5511 if (strEQ(d,"flock")) return -KEY_flock;
5514 if (strEQ(d,"format")) return KEY_format;
5515 if (strEQ(d,"fileno")) return -KEY_fileno;
5518 if (strEQ(d,"foreach")) return KEY_foreach;
5521 if (strEQ(d,"formline")) return -KEY_formline;
5526 if (strnEQ(d,"get",3)) {
5531 if (strEQ(d,"ppid")) return -KEY_getppid;
5532 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5535 if (strEQ(d,"pwent")) return -KEY_getpwent;
5536 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5537 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5540 if (strEQ(d,"peername")) return -KEY_getpeername;
5541 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5542 if (strEQ(d,"priority")) return -KEY_getpriority;
5545 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5548 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5552 else if (*d == 'h') {
5553 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5554 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5555 if (strEQ(d,"hostent")) return -KEY_gethostent;
5557 else if (*d == 'n') {
5558 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5559 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5560 if (strEQ(d,"netent")) return -KEY_getnetent;
5562 else if (*d == 's') {
5563 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5564 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5565 if (strEQ(d,"servent")) return -KEY_getservent;
5566 if (strEQ(d,"sockname")) return -KEY_getsockname;
5567 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5569 else if (*d == 'g') {
5570 if (strEQ(d,"grent")) return -KEY_getgrent;
5571 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5572 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5574 else if (*d == 'l') {
5575 if (strEQ(d,"login")) return -KEY_getlogin;
5577 else if (strEQ(d,"c")) return -KEY_getc;
5582 if (strEQ(d,"gt")) return -KEY_gt;
5583 if (strEQ(d,"ge")) return -KEY_ge;
5586 if (strEQ(d,"grep")) return KEY_grep;
5587 if (strEQ(d,"goto")) return KEY_goto;
5588 if (strEQ(d,"glob")) return KEY_glob;
5591 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5596 if (strEQ(d,"hex")) return -KEY_hex;
5599 if (strEQ(d,"INIT")) return KEY_INIT;
5604 if (strEQ(d,"if")) return KEY_if;
5607 if (strEQ(d,"int")) return -KEY_int;
5610 if (strEQ(d,"index")) return -KEY_index;
5611 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5616 if (strEQ(d,"join")) return -KEY_join;
5620 if (strEQ(d,"keys")) return -KEY_keys;
5621 if (strEQ(d,"kill")) return -KEY_kill;
5627 if (strEQ(d,"lt")) return -KEY_lt;
5628 if (strEQ(d,"le")) return -KEY_le;
5629 if (strEQ(d,"lc")) return -KEY_lc;
5632 if (strEQ(d,"log")) return -KEY_log;
5635 if (strEQ(d,"last")) return KEY_last;
5636 if (strEQ(d,"link")) return -KEY_link;
5637 if (strEQ(d,"lock")) return -KEY_lock;
5640 if (strEQ(d,"local")) return KEY_local;
5641 if (strEQ(d,"lstat")) return -KEY_lstat;
5644 if (strEQ(d,"length")) return -KEY_length;
5645 if (strEQ(d,"listen")) return -KEY_listen;
5648 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5651 if (strEQ(d,"localtime")) return -KEY_localtime;
5657 case 1: return KEY_m;
5659 if (strEQ(d,"my")) return KEY_my;
5662 if (strEQ(d,"map")) return KEY_map;
5665 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5668 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5669 if (strEQ(d,"msgget")) return -KEY_msgget;
5670 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5671 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5676 if (strEQ(d,"next")) return KEY_next;
5677 if (strEQ(d,"ne")) return -KEY_ne;
5678 if (strEQ(d,"not")) return -KEY_not;
5679 if (strEQ(d,"no")) return KEY_no;
5684 if (strEQ(d,"or")) return -KEY_or;
5687 if (strEQ(d,"ord")) return -KEY_ord;
5688 if (strEQ(d,"oct")) return -KEY_oct;
5689 if (strEQ(d,"our")) return KEY_our;
5692 if (strEQ(d,"open")) return -KEY_open;
5695 if (strEQ(d,"opendir")) return -KEY_opendir;
5702 if (strEQ(d,"pop")) return -KEY_pop;
5703 if (strEQ(d,"pos")) return KEY_pos;
5706 if (strEQ(d,"push")) return -KEY_push;
5707 if (strEQ(d,"pack")) return -KEY_pack;
5708 if (strEQ(d,"pipe")) return -KEY_pipe;
5711 if (strEQ(d,"print")) return KEY_print;
5714 if (strEQ(d,"printf")) return KEY_printf;
5717 if (strEQ(d,"package")) return KEY_package;
5720 if (strEQ(d,"prototype")) return KEY_prototype;
5725 if (strEQ(d,"q")) return KEY_q;
5726 if (strEQ(d,"qr")) return KEY_qr;
5727 if (strEQ(d,"qq")) return KEY_qq;
5728 if (strEQ(d,"qw")) return KEY_qw;
5729 if (strEQ(d,"qx")) return KEY_qx;
5731 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5736 if (strEQ(d,"ref")) return -KEY_ref;
5739 if (strEQ(d,"read")) return -KEY_read;
5740 if (strEQ(d,"rand")) return -KEY_rand;
5741 if (strEQ(d,"recv")) return -KEY_recv;
5742 if (strEQ(d,"redo")) return KEY_redo;
5745 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5746 if (strEQ(d,"reset")) return -KEY_reset;
5749 if (strEQ(d,"return")) return KEY_return;
5750 if (strEQ(d,"rename")) return -KEY_rename;
5751 if (strEQ(d,"rindex")) return -KEY_rindex;
5754 if (strEQ(d,"require")) return KEY_require;
5755 if (strEQ(d,"reverse")) return -KEY_reverse;
5756 if (strEQ(d,"readdir")) return -KEY_readdir;
5759 if (strEQ(d,"readlink")) return -KEY_readlink;
5760 if (strEQ(d,"readline")) return -KEY_readline;
5761 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5764 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5770 case 0: return KEY_s;
5772 if (strEQ(d,"scalar")) return KEY_scalar;
5777 if (strEQ(d,"seek")) return -KEY_seek;
5778 if (strEQ(d,"send")) return -KEY_send;
5781 if (strEQ(d,"semop")) return -KEY_semop;
5784 if (strEQ(d,"select")) return -KEY_select;
5785 if (strEQ(d,"semctl")) return -KEY_semctl;
5786 if (strEQ(d,"semget")) return -KEY_semget;
5789 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5790 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5793 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5794 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5797 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5800 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5801 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5802 if (strEQ(d,"setservent")) return -KEY_setservent;
5805 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5806 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5813 if (strEQ(d,"shift")) return -KEY_shift;
5816 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5817 if (strEQ(d,"shmget")) return -KEY_shmget;
5820 if (strEQ(d,"shmread")) return -KEY_shmread;
5823 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5824 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5829 if (strEQ(d,"sin")) return -KEY_sin;
5832 if (strEQ(d,"sleep")) return -KEY_sleep;
5835 if (strEQ(d,"sort")) return KEY_sort;
5836 if (strEQ(d,"socket")) return -KEY_socket;
5837 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5840 if (strEQ(d,"split")) return KEY_split;
5841 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5842 if (strEQ(d,"splice")) return -KEY_splice;
5845 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5848 if (strEQ(d,"srand")) return -KEY_srand;
5851 if (strEQ(d,"stat")) return -KEY_stat;
5852 if (strEQ(d,"study")) return KEY_study;
5855 if (strEQ(d,"substr")) return -KEY_substr;
5856 if (strEQ(d,"sub")) return KEY_sub;
5861 if (strEQ(d,"system")) return -KEY_system;
5864 if (strEQ(d,"symlink")) return -KEY_symlink;
5865 if (strEQ(d,"syscall")) return -KEY_syscall;
5866 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5867 if (strEQ(d,"sysread")) return -KEY_sysread;
5868 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5871 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5880 if (strEQ(d,"tr")) return KEY_tr;
5883 if (strEQ(d,"tie")) return KEY_tie;
5886 if (strEQ(d,"tell")) return -KEY_tell;
5887 if (strEQ(d,"tied")) return KEY_tied;
5888 if (strEQ(d,"time")) return -KEY_time;
5891 if (strEQ(d,"times")) return -KEY_times;
5894 if (strEQ(d,"telldir")) return -KEY_telldir;
5897 if (strEQ(d,"truncate")) return -KEY_truncate;
5904 if (strEQ(d,"uc")) return -KEY_uc;
5907 if (strEQ(d,"use")) return KEY_use;
5910 if (strEQ(d,"undef")) return KEY_undef;
5911 if (strEQ(d,"until")) return KEY_until;
5912 if (strEQ(d,"untie")) return KEY_untie;
5913 if (strEQ(d,"utime")) return -KEY_utime;
5914 if (strEQ(d,"umask")) return -KEY_umask;
5917 if (strEQ(d,"unless")) return KEY_unless;
5918 if (strEQ(d,"unpack")) return -KEY_unpack;
5919 if (strEQ(d,"unlink")) return -KEY_unlink;
5922 if (strEQ(d,"unshift")) return -KEY_unshift;
5923 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5928 if (strEQ(d,"values")) return -KEY_values;
5929 if (strEQ(d,"vec")) return -KEY_vec;
5934 if (strEQ(d,"warn")) return -KEY_warn;
5935 if (strEQ(d,"wait")) return -KEY_wait;
5938 if (strEQ(d,"while")) return KEY_while;
5939 if (strEQ(d,"write")) return -KEY_write;
5942 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5945 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5950 if (len == 1) return -KEY_x;
5951 if (strEQ(d,"xor")) return -KEY_xor;
5954 if (len == 1) return KEY_y;
5963 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5967 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5968 if (ckWARN(WARN_SYNTAX)) {
5970 for (w = s+2; *w && level; w++) {
5977 for (; *w && isSPACE(*w); w++) ;
5978 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5979 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5980 "%s (...) interpreted as function",name);
5983 while (s < PL_bufend && isSPACE(*s))
5987 while (s < PL_bufend && isSPACE(*s))
5989 if (isIDFIRST_lazy_if(s,UTF)) {
5991 while (isALNUM_lazy_if(s,UTF))
5993 while (s < PL_bufend && isSPACE(*s))
5998 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6002 Perl_croak(aTHX_ "No comma allowed after %s", what);
6007 /* Either returns sv, or mortalizes sv and returns a new SV*.
6008 Best used as sv=new_constant(..., sv, ...).
6009 If s, pv are NULL, calls subroutine with one argument,
6010 and type is used with error messages only. */
6013 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6017 HV *table = GvHV(PL_hintgv); /* ^H */
6021 const char *why1, *why2, *why3;
6023 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6026 why2 = strEQ(key,"charnames")
6027 ? "(possibly a missing \"use charnames ...\")"
6029 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6030 (type ? type: "undef"), why2);
6032 /* This is convoluted and evil ("goto considered harmful")
6033 * but I do not understand the intricacies of all the different
6034 * failure modes of %^H in here. The goal here is to make
6035 * the most probable error message user-friendly. --jhi */
6040 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6041 (type ? type: "undef"), why1, why2, why3);
6043 yyerror(SvPVX(msg));
6047 cvp = hv_fetch(table, key, strlen(key), FALSE);
6048 if (!cvp || !SvOK(*cvp)) {
6051 why3 = "} is not defined";
6054 sv_2mortal(sv); /* Parent created it permanently */
6057 pv = sv_2mortal(newSVpvn(s, len));
6059 typesv = sv_2mortal(newSVpv(type, 0));
6061 typesv = &PL_sv_undef;
6063 PUSHSTACKi(PERLSI_OVERLOAD);
6075 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6079 /* Check the eval first */
6080 if (!PL_in_eval && SvTRUE(ERRSV)) {
6082 sv_catpv(ERRSV, "Propagated");
6083 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6085 res = SvREFCNT_inc(sv);
6089 (void)SvREFCNT_inc(res);
6098 why1 = "Call to &{$^H{";
6100 why3 = "}} did not return a defined value";
6109 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6111 register char *d = dest;
6112 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6115 Perl_croak(aTHX_ ident_too_long);
6116 if (isALNUM(*s)) /* UTF handled below */
6118 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6123 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6127 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6128 char *t = s + UTF8SKIP(s);
6129 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6131 if (d + (t - s) > e)
6132 Perl_croak(aTHX_ ident_too_long);
6133 Copy(s, d, t - s, char);
6146 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6156 e = d + destlen - 3; /* two-character token, ending NUL */
6158 while (isDIGIT(*s)) {
6160 Perl_croak(aTHX_ ident_too_long);
6167 Perl_croak(aTHX_ ident_too_long);
6168 if (isALNUM(*s)) /* UTF handled below */
6170 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6175 else if (*s == ':' && s[1] == ':') {
6179 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6180 char *t = s + UTF8SKIP(s);
6181 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6183 if (d + (t - s) > e)
6184 Perl_croak(aTHX_ ident_too_long);
6185 Copy(s, d, t - s, char);
6196 if (PL_lex_state != LEX_NORMAL)
6197 PL_lex_state = LEX_INTERPENDMAYBE;
6200 if (*s == '$' && s[1] &&
6201 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6214 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6219 if (isSPACE(s[-1])) {
6222 if (!SPACE_OR_TAB(ch)) {
6228 if (isIDFIRST_lazy_if(d,UTF)) {
6232 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6234 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6237 Copy(s, d, e - s, char);
6242 while ((isALNUM(*s) || *s == ':') && d < e)
6245 Perl_croak(aTHX_ ident_too_long);
6248 while (s < send && SPACE_OR_TAB(*s)) s++;
6249 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6250 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6251 const char *brack = *s == '[' ? "[...]" : "{...}";
6252 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6253 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6254 funny, dest, brack, funny, dest, brack);
6257 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6261 /* Handle extended ${^Foo} variables
6262 * 1999-02-27 mjd-perl-patch@plover.com */
6263 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6267 while (isALNUM(*s) && d < e) {
6271 Perl_croak(aTHX_ ident_too_long);
6276 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6277 PL_lex_state = LEX_INTERPEND;
6280 if (PL_lex_state == LEX_NORMAL) {
6281 if (ckWARN(WARN_AMBIGUOUS) &&
6282 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6284 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6285 "Ambiguous use of %c{%s} resolved to %c%s",
6286 funny, dest, funny, dest);
6291 s = bracket; /* let the parser handle it */
6295 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6296 PL_lex_state = LEX_INTERPEND;
6301 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6306 *pmfl |= PMf_GLOBAL;
6308 *pmfl |= PMf_CONTINUE;
6312 *pmfl |= PMf_MULTILINE;
6314 *pmfl |= PMf_SINGLELINE;
6316 *pmfl |= PMf_EXTENDED;
6320 S_scan_pat(pTHX_ char *start, I32 type)
6325 s = scan_str(start,FALSE,FALSE);
6327 Perl_croak(aTHX_ "Search pattern not terminated");
6329 pm = (PMOP*)newPMOP(type, 0);
6330 if (PL_multi_open == '?')
6331 pm->op_pmflags |= PMf_ONCE;
6333 while (*s && strchr("iomsx", *s))
6334 pmflag(&pm->op_pmflags,*s++);
6337 while (*s && strchr("iogcmsx", *s))
6338 pmflag(&pm->op_pmflags,*s++);
6340 /* issue a warning if /c is specified,but /g is not */
6341 if (ckWARN(WARN_REGEXP) &&
6342 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6344 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6347 pm->op_pmpermflags = pm->op_pmflags;
6349 PL_lex_op = (OP*)pm;
6350 yylval.ival = OP_MATCH;
6355 S_scan_subst(pTHX_ char *start)
6362 yylval.ival = OP_NULL;
6364 s = scan_str(start,FALSE,FALSE);
6367 Perl_croak(aTHX_ "Substitution pattern not terminated");
6369 if (s[-1] == PL_multi_open)
6372 first_start = PL_multi_start;
6373 s = scan_str(s,FALSE,FALSE);
6376 SvREFCNT_dec(PL_lex_stuff);
6377 PL_lex_stuff = Nullsv;
6379 Perl_croak(aTHX_ "Substitution replacement not terminated");
6381 PL_multi_start = first_start; /* so whole substitution is taken together */
6383 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6389 else if (strchr("iogcmsx", *s))
6390 pmflag(&pm->op_pmflags,*s++);
6395 /* /c is not meaningful with s/// */
6396 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6398 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6403 PL_sublex_info.super_bufptr = s;
6404 PL_sublex_info.super_bufend = PL_bufend;
6406 pm->op_pmflags |= PMf_EVAL;
6407 repl = newSVpvn("",0);
6409 sv_catpv(repl, es ? "eval " : "do ");
6410 sv_catpvn(repl, "{ ", 2);
6411 sv_catsv(repl, PL_lex_repl);
6412 sv_catpvn(repl, " };", 2);
6414 SvREFCNT_dec(PL_lex_repl);
6418 pm->op_pmpermflags = pm->op_pmflags;
6419 PL_lex_op = (OP*)pm;
6420 yylval.ival = OP_SUBST;
6425 S_scan_trans(pTHX_ char *start)
6434 yylval.ival = OP_NULL;
6436 s = scan_str(start,FALSE,FALSE);
6438 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6439 if (s[-1] == PL_multi_open)
6442 s = scan_str(s,FALSE,FALSE);
6445 SvREFCNT_dec(PL_lex_stuff);
6446 PL_lex_stuff = Nullsv;
6448 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6451 complement = del = squash = 0;
6452 while (strchr("cds", *s)) {
6454 complement = OPpTRANS_COMPLEMENT;
6456 del = OPpTRANS_DELETE;
6458 squash = OPpTRANS_SQUASH;
6462 New(803, tbl, complement&&!del?258:256, short);
6463 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6464 o->op_private = del|squash|complement|
6465 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6466 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6469 yylval.ival = OP_TRANS;
6474 S_scan_heredoc(pTHX_ register char *s)
6477 I32 op_type = OP_SCALAR;
6484 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6488 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6491 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6492 if (*peek && strchr("`'\"",*peek)) {
6495 s = delimcpy(d, e, s, PL_bufend, term, &len);
6505 if (!isALNUM_lazy_if(s,UTF))
6506 deprecate_old("bare << to mean <<\"\"");
6507 for (; isALNUM_lazy_if(s,UTF); s++) {
6512 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6513 Perl_croak(aTHX_ "Delimiter for here document is too long");
6516 len = d - PL_tokenbuf;
6517 #ifndef PERL_STRICT_CR
6518 d = strchr(s, '\r');
6522 while (s < PL_bufend) {
6528 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6537 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6542 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6543 herewas = newSVpvn(s,PL_bufend-s);
6545 s--, herewas = newSVpvn(s,d-s);
6546 s += SvCUR(herewas);
6548 tmpstr = NEWSV(87,79);
6549 sv_upgrade(tmpstr, SVt_PVIV);
6554 else if (term == '`') {
6555 op_type = OP_BACKTICK;
6556 SvIVX(tmpstr) = '\\';
6560 PL_multi_start = CopLINE(PL_curcop);
6561 PL_multi_open = PL_multi_close = '<';
6562 term = *PL_tokenbuf;
6563 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6564 char *bufptr = PL_sublex_info.super_bufptr;
6565 char *bufend = PL_sublex_info.super_bufend;
6566 char *olds = s - SvCUR(herewas);
6567 s = strchr(bufptr, '\n');
6571 while (s < bufend &&
6572 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6574 CopLINE_inc(PL_curcop);
6577 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6578 missingterm(PL_tokenbuf);
6580 sv_setpvn(herewas,bufptr,d-bufptr+1);
6581 sv_setpvn(tmpstr,d+1,s-d);
6583 sv_catpvn(herewas,s,bufend-s);
6584 (void)strcpy(bufptr,SvPVX(herewas));
6591 while (s < PL_bufend &&
6592 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6594 CopLINE_inc(PL_curcop);
6596 if (s >= PL_bufend) {
6597 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6598 missingterm(PL_tokenbuf);
6600 sv_setpvn(tmpstr,d+1,s-d);
6602 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6604 sv_catpvn(herewas,s,PL_bufend-s);
6605 sv_setsv(PL_linestr,herewas);
6606 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6607 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6608 PL_last_lop = PL_last_uni = Nullch;
6611 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6612 while (s >= PL_bufend) { /* multiple line string? */
6614 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6615 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6616 missingterm(PL_tokenbuf);
6618 CopLINE_inc(PL_curcop);
6619 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6620 PL_last_lop = PL_last_uni = Nullch;
6621 #ifndef PERL_STRICT_CR
6622 if (PL_bufend - PL_linestart >= 2) {
6623 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6624 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6626 PL_bufend[-2] = '\n';
6628 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6630 else if (PL_bufend[-1] == '\r')
6631 PL_bufend[-1] = '\n';
6633 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6634 PL_bufend[-1] = '\n';
6636 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6637 SV *sv = NEWSV(88,0);
6639 sv_upgrade(sv, SVt_PVMG);
6640 sv_setsv(sv,PL_linestr);
6643 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6645 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6648 sv_catsv(PL_linestr,herewas);
6649 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6653 sv_catsv(tmpstr,PL_linestr);
6658 PL_multi_end = CopLINE(PL_curcop);
6659 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6660 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6661 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6663 SvREFCNT_dec(herewas);
6664 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6666 PL_lex_stuff = tmpstr;
6667 yylval.ival = op_type;
6672 takes: current position in input buffer
6673 returns: new position in input buffer
6674 side-effects: yylval and lex_op are set.
6679 <FH> read from filehandle
6680 <pkg::FH> read from package qualified filehandle
6681 <pkg'FH> read from package qualified filehandle
6682 <$fh> read from filehandle in $fh
6688 S_scan_inputsymbol(pTHX_ char *start)
6690 register char *s = start; /* current position in buffer */
6696 d = PL_tokenbuf; /* start of temp holding space */
6697 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6698 end = strchr(s, '\n');
6701 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6703 /* die if we didn't have space for the contents of the <>,
6704 or if it didn't end, or if we see a newline
6707 if (len >= sizeof PL_tokenbuf)
6708 Perl_croak(aTHX_ "Excessively long <> operator");
6710 Perl_croak(aTHX_ "Unterminated <> operator");
6715 Remember, only scalar variables are interpreted as filehandles by
6716 this code. Anything more complex (e.g., <$fh{$num}>) will be
6717 treated as a glob() call.
6718 This code makes use of the fact that except for the $ at the front,
6719 a scalar variable and a filehandle look the same.
6721 if (*d == '$' && d[1]) d++;
6723 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6724 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6727 /* If we've tried to read what we allow filehandles to look like, and
6728 there's still text left, then it must be a glob() and not a getline.
6729 Use scan_str to pull out the stuff between the <> and treat it
6730 as nothing more than a string.
6733 if (d - PL_tokenbuf != len) {
6734 yylval.ival = OP_GLOB;
6736 s = scan_str(start,FALSE,FALSE);
6738 Perl_croak(aTHX_ "Glob not terminated");
6742 bool readline_overriden = FALSE;
6743 GV *gv_readline = Nullgv;
6745 /* we're in a filehandle read situation */
6748 /* turn <> into <ARGV> */
6750 (void)strcpy(d,"ARGV");
6752 /* Check whether readline() is overriden */
6753 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6754 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6756 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6757 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6758 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6759 readline_overriden = TRUE;
6761 /* if <$fh>, create the ops to turn the variable into a
6767 /* try to find it in the pad for this block, otherwise find
6768 add symbol table ops
6770 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6771 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6772 SV *sym = sv_2mortal(
6773 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6774 sv_catpvn(sym, "::", 2);
6780 OP *o = newOP(OP_PADSV, 0);
6782 PL_lex_op = readline_overriden
6783 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6784 append_elem(OP_LIST, o,
6785 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6786 : (OP*)newUNOP(OP_READLINE, 0, o);
6795 ? (GV_ADDMULTI | GV_ADDINEVAL)
6798 PL_lex_op = readline_overriden
6799 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6800 append_elem(OP_LIST,
6801 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6802 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6803 : (OP*)newUNOP(OP_READLINE, 0,
6804 newUNOP(OP_RV2SV, 0,
6805 newGVOP(OP_GV, 0, gv)));
6807 if (!readline_overriden)
6808 PL_lex_op->op_flags |= OPf_SPECIAL;
6809 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6810 yylval.ival = OP_NULL;
6813 /* If it's none of the above, it must be a literal filehandle
6814 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6816 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6817 PL_lex_op = readline_overriden
6818 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6819 append_elem(OP_LIST,
6820 newGVOP(OP_GV, 0, gv),
6821 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6822 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6823 yylval.ival = OP_NULL;
6832 takes: start position in buffer
6833 keep_quoted preserve \ on the embedded delimiter(s)
6834 keep_delims preserve the delimiters around the string
6835 returns: position to continue reading from buffer
6836 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6837 updates the read buffer.
6839 This subroutine pulls a string out of the input. It is called for:
6840 q single quotes q(literal text)
6841 ' single quotes 'literal text'
6842 qq double quotes qq(interpolate $here please)
6843 " double quotes "interpolate $here please"
6844 qx backticks qx(/bin/ls -l)
6845 ` backticks `/bin/ls -l`
6846 qw quote words @EXPORT_OK = qw( func() $spam )
6847 m// regexp match m/this/
6848 s/// regexp substitute s/this/that/
6849 tr/// string transliterate tr/this/that/
6850 y/// string transliterate y/this/that/
6851 ($*@) sub prototypes sub foo ($)
6852 (stuff) sub attr parameters sub foo : attr(stuff)
6853 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6855 In most of these cases (all but <>, patterns and transliterate)
6856 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6857 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6858 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6861 It skips whitespace before the string starts, and treats the first
6862 character as the delimiter. If the delimiter is one of ([{< then
6863 the corresponding "close" character )]}> is used as the closing
6864 delimiter. It allows quoting of delimiters, and if the string has
6865 balanced delimiters ([{<>}]) it allows nesting.
6867 On success, the SV with the resulting string is put into lex_stuff or,
6868 if that is already non-NULL, into lex_repl. The second case occurs only
6869 when parsing the RHS of the special constructs s/// and tr/// (y///).
6870 For convenience, the terminating delimiter character is stuffed into
6875 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6877 SV *sv; /* scalar value: string */
6878 char *tmps; /* temp string, used for delimiter matching */
6879 register char *s = start; /* current position in the buffer */
6880 register char term; /* terminating character */
6881 register char *to; /* current position in the sv's data */
6882 I32 brackets = 1; /* bracket nesting level */
6883 bool has_utf8 = FALSE; /* is there any utf8 content? */
6885 /* skip space before the delimiter */
6889 /* mark where we are, in case we need to report errors */
6892 /* after skipping whitespace, the next character is the terminator */
6894 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6897 /* mark where we are */
6898 PL_multi_start = CopLINE(PL_curcop);
6899 PL_multi_open = term;
6901 /* find corresponding closing delimiter */
6902 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6904 PL_multi_close = term;
6906 /* create a new SV to hold the contents. 87 is leak category, I'm
6907 assuming. 79 is the SV's initial length. What a random number. */
6909 sv_upgrade(sv, SVt_PVIV);
6911 (void)SvPOK_only(sv); /* validate pointer */
6913 /* move past delimiter and try to read a complete string */
6915 sv_catpvn(sv, s, 1);
6918 /* extend sv if need be */
6919 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6920 /* set 'to' to the next character in the sv's string */
6921 to = SvPVX(sv)+SvCUR(sv);
6923 /* if open delimiter is the close delimiter read unbridle */
6924 if (PL_multi_open == PL_multi_close) {
6925 for (; s < PL_bufend; s++,to++) {
6926 /* embedded newlines increment the current line number */
6927 if (*s == '\n' && !PL_rsfp)
6928 CopLINE_inc(PL_curcop);
6929 /* handle quoted delimiters */
6930 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6931 if (!keep_quoted && s[1] == term)
6933 /* any other quotes are simply copied straight through */
6937 /* terminate when run out of buffer (the for() condition), or
6938 have found the terminator */
6939 else if (*s == term)
6941 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6947 /* if the terminator isn't the same as the start character (e.g.,
6948 matched brackets), we have to allow more in the quoting, and
6949 be prepared for nested brackets.
6952 /* read until we run out of string, or we find the terminator */
6953 for (; s < PL_bufend; s++,to++) {
6954 /* embedded newlines increment the line count */
6955 if (*s == '\n' && !PL_rsfp)
6956 CopLINE_inc(PL_curcop);
6957 /* backslashes can escape the open or closing characters */
6958 if (*s == '\\' && s+1 < PL_bufend) {
6960 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6965 /* allow nested opens and closes */
6966 else if (*s == PL_multi_close && --brackets <= 0)
6968 else if (*s == PL_multi_open)
6970 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6975 /* terminate the copied string and update the sv's end-of-string */
6977 SvCUR_set(sv, to - SvPVX(sv));
6980 * this next chunk reads more into the buffer if we're not done yet
6984 break; /* handle case where we are done yet :-) */
6986 #ifndef PERL_STRICT_CR
6987 if (to - SvPVX(sv) >= 2) {
6988 if ((to[-2] == '\r' && to[-1] == '\n') ||
6989 (to[-2] == '\n' && to[-1] == '\r'))
6993 SvCUR_set(sv, to - SvPVX(sv));
6995 else if (to[-1] == '\r')
6998 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7002 /* if we're out of file, or a read fails, bail and reset the current
7003 line marker so we can report where the unterminated string began
7006 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7008 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7011 /* we read a line, so increment our line counter */
7012 CopLINE_inc(PL_curcop);
7014 /* update debugger info */
7015 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7016 SV *sv = NEWSV(88,0);
7018 sv_upgrade(sv, SVt_PVMG);
7019 sv_setsv(sv,PL_linestr);
7022 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7025 /* having changed the buffer, we must update PL_bufend */
7026 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7027 PL_last_lop = PL_last_uni = Nullch;
7030 /* at this point, we have successfully read the delimited string */
7033 sv_catpvn(sv, s, 1);
7036 else if (PL_encoding)
7037 sv_recode_to_utf8(sv, PL_encoding);
7039 PL_multi_end = CopLINE(PL_curcop);
7042 /* if we allocated too much space, give some back */
7043 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7044 SvLEN_set(sv, SvCUR(sv) + 1);
7045 Renew(SvPVX(sv), SvLEN(sv), char);
7048 /* decide whether this is the first or second quoted string we've read
7061 takes: pointer to position in buffer
7062 returns: pointer to new position in buffer
7063 side-effects: builds ops for the constant in yylval.op
7065 Read a number in any of the formats that Perl accepts:
7067 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7068 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7071 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7073 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7076 If it reads a number without a decimal point or an exponent, it will
7077 try converting the number to an integer and see if it can do so
7078 without loss of precision.
7082 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7084 register char *s = start; /* current position in buffer */
7085 register char *d; /* destination in temp buffer */
7086 register char *e; /* end of temp buffer */
7087 NV nv; /* number read, as a double */
7088 SV *sv = Nullsv; /* place to put the converted number */
7089 bool floatit; /* boolean: int or float? */
7090 char *lastub = 0; /* position of last underbar */
7091 static char number_too_long[] = "Number too long";
7093 /* We use the first character to decide what type of number this is */
7097 Perl_croak(aTHX_ "panic: scan_num");
7099 /* if it starts with a 0, it could be an octal number, a decimal in
7100 0.13 disguise, or a hexadecimal number, or a binary number. */
7104 u holds the "number so far"
7105 shift the power of 2 of the base
7106 (hex == 4, octal == 3, binary == 1)
7107 overflowed was the number more than we can hold?
7109 Shift is used when we add a digit. It also serves as an "are
7110 we in octal/hex/binary?" indicator to disallow hex characters
7116 bool overflowed = FALSE;
7117 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7118 static char* bases[5] = { "", "binary", "", "octal",
7120 static char* Bases[5] = { "", "Binary", "", "Octal",
7122 static char *maxima[5] = { "",
7123 "0b11111111111111111111111111111111",
7127 char *base, *Base, *max;
7133 } else if (s[1] == 'b') {
7137 /* check for a decimal in disguise */
7138 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7140 /* so it must be octal */
7147 if (ckWARN(WARN_SYNTAX))
7148 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7149 "Misplaced _ in number");
7153 base = bases[shift];
7154 Base = Bases[shift];
7155 max = maxima[shift];
7157 /* read the rest of the number */
7159 /* x is used in the overflow test,
7160 b is the digit we're adding on. */
7165 /* if we don't mention it, we're done */
7169 /* _ are ignored -- but warned about if consecutive */
7171 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7172 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7173 "Misplaced _ in number");
7177 /* 8 and 9 are not octal */
7180 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7184 case '2': case '3': case '4':
7185 case '5': case '6': case '7':
7187 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7191 b = *s++ & 15; /* ASCII digit -> value of digit */
7195 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7196 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7197 /* make sure they said 0x */
7202 /* Prepare to put the digit we have onto the end
7203 of the number so far. We check for overflows.
7208 x = u << shift; /* make room for the digit */
7210 if ((x >> shift) != u
7211 && !(PL_hints & HINT_NEW_BINARY)) {
7214 if (ckWARN_d(WARN_OVERFLOW))
7215 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7216 "Integer overflow in %s number",
7219 u = x | b; /* add the digit to the end */
7222 n *= nvshift[shift];
7223 /* If an NV has not enough bits in its
7224 * mantissa to represent an UV this summing of
7225 * small low-order numbers is a waste of time
7226 * (because the NV cannot preserve the
7227 * low-order bits anyway): we could just
7228 * remember when did we overflow and in the
7229 * end just multiply n by the right
7237 /* if we get here, we had success: make a scalar value from
7242 /* final misplaced underbar check */
7244 if (ckWARN(WARN_SYNTAX))
7245 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7250 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7251 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7252 "%s number > %s non-portable",
7258 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7259 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7260 "%s number > %s non-portable",
7265 if (PL_hints & HINT_NEW_BINARY)
7266 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7271 handle decimal numbers.
7272 we're also sent here when we read a 0 as the first digit
7274 case '1': case '2': case '3': case '4': case '5':
7275 case '6': case '7': case '8': case '9': case '.':
7278 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7281 /* read next group of digits and _ and copy into d */
7282 while (isDIGIT(*s) || *s == '_') {
7283 /* skip underscores, checking for misplaced ones
7287 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7288 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7289 "Misplaced _ in number");
7293 /* check for end of fixed-length buffer */
7295 Perl_croak(aTHX_ number_too_long);
7296 /* if we're ok, copy the character */
7301 /* final misplaced underbar check */
7302 if (lastub && s == lastub + 1) {
7303 if (ckWARN(WARN_SYNTAX))
7304 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7307 /* read a decimal portion if there is one. avoid
7308 3..5 being interpreted as the number 3. followed
7311 if (*s == '.' && s[1] != '.') {
7316 if (ckWARN(WARN_SYNTAX))
7317 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7318 "Misplaced _ in number");
7322 /* copy, ignoring underbars, until we run out of digits.
7324 for (; isDIGIT(*s) || *s == '_'; s++) {
7325 /* fixed length buffer check */
7327 Perl_croak(aTHX_ number_too_long);
7329 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7330 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7331 "Misplaced _ in number");
7337 /* fractional part ending in underbar? */
7339 if (ckWARN(WARN_SYNTAX))
7340 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7341 "Misplaced _ in number");
7343 if (*s == '.' && isDIGIT(s[1])) {
7344 /* oops, it's really a v-string, but without the "v" */
7350 /* read exponent part, if present */
7351 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7355 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7356 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7358 /* stray preinitial _ */
7360 if (ckWARN(WARN_SYNTAX))
7361 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7362 "Misplaced _ in number");
7366 /* allow positive or negative exponent */
7367 if (*s == '+' || *s == '-')
7370 /* stray initial _ */
7372 if (ckWARN(WARN_SYNTAX))
7373 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7374 "Misplaced _ in number");
7378 /* read digits of exponent */
7379 while (isDIGIT(*s) || *s == '_') {
7382 Perl_croak(aTHX_ number_too_long);
7386 if (ckWARN(WARN_SYNTAX) &&
7387 ((lastub && s == lastub + 1) ||
7388 (!isDIGIT(s[1]) && s[1] != '_')))
7389 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7390 "Misplaced _ in number");
7397 /* make an sv from the string */
7401 We try to do an integer conversion first if no characters
7402 indicating "float" have been found.
7407 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7409 if (flags == IS_NUMBER_IN_UV) {
7411 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7414 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7415 if (uv <= (UV) IV_MIN)
7416 sv_setiv(sv, -(IV)uv);
7423 /* terminate the string */
7425 nv = Atof(PL_tokenbuf);
7429 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7430 (PL_hints & HINT_NEW_INTEGER) )
7431 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7432 (floatit ? "float" : "integer"),
7436 /* if it starts with a v, it could be a v-string */
7439 sv = NEWSV(92,5); /* preallocate storage space */
7440 s = scan_vstring(s,sv);
7444 /* make the op for the constant and return */
7447 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7449 lvalp->opval = Nullop;
7455 S_scan_formline(pTHX_ register char *s)
7459 SV *stuff = newSVpvn("",0);
7460 bool needargs = FALSE;
7463 if (*s == '.' || *s == /*{*/'}') {
7465 #ifdef PERL_STRICT_CR
7466 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7468 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7470 if (*t == '\n' || t == PL_bufend)
7473 if (PL_in_eval && !PL_rsfp) {
7474 eol = strchr(s,'\n');
7479 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7481 for (t = s; t < eol; t++) {
7482 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7484 goto enough; /* ~~ must be first line in formline */
7486 if (*t == '@' || *t == '^')
7490 sv_catpvn(stuff, s, eol-s);
7491 #ifndef PERL_STRICT_CR
7492 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7493 char *end = SvPVX(stuff) + SvCUR(stuff);
7505 s = filter_gets(PL_linestr, PL_rsfp, 0);
7506 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7507 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7508 PL_last_lop = PL_last_uni = Nullch;
7511 yyerror("Format not terminated");
7521 PL_lex_state = LEX_NORMAL;
7522 PL_nextval[PL_nexttoke].ival = 0;
7526 PL_lex_state = LEX_FORMLINE;
7527 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7529 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7533 SvREFCNT_dec(stuff);
7534 PL_lex_formbrack = 0;
7545 PL_cshlen = strlen(PL_cshname);
7550 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7552 I32 oldsavestack_ix = PL_savestack_ix;
7553 CV* outsidecv = PL_compcv;
7556 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7558 SAVEI32(PL_subline);
7559 save_item(PL_subname);
7560 SAVESPTR(PL_compcv);
7562 PL_compcv = (CV*)NEWSV(1104,0);
7563 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7564 CvFLAGS(PL_compcv) |= flags;
7566 PL_subline = CopLINE(PL_curcop);
7567 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7568 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7570 return oldsavestack_ix;
7574 #pragma segment Perl_yylex
7577 Perl_yywarn(pTHX_ char *s)
7579 PL_in_eval |= EVAL_WARNONLY;
7581 PL_in_eval &= ~EVAL_WARNONLY;
7586 Perl_yyerror(pTHX_ char *s)
7589 char *context = NULL;
7593 if (!yychar || (yychar == ';' && !PL_rsfp))
7595 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7596 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7599 The code below is removed for NetWare because it abends/crashes on NetWare
7600 when the script has error such as not having the closing quotes like:
7602 Checking of white spaces is anyway done in NetWare code.
7605 while (isSPACE(*PL_oldoldbufptr))
7608 context = PL_oldoldbufptr;
7609 contlen = PL_bufptr - PL_oldoldbufptr;
7611 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7612 PL_oldbufptr != PL_bufptr) {
7615 The code below is removed for NetWare because it abends/crashes on NetWare
7616 when the script has error such as not having the closing quotes like:
7618 Checking of white spaces is anyway done in NetWare code.
7621 while (isSPACE(*PL_oldbufptr))
7624 context = PL_oldbufptr;
7625 contlen = PL_bufptr - PL_oldbufptr;
7627 else if (yychar > 255)
7628 where = "next token ???";
7629 #ifdef USE_PURE_BISON
7630 /* GNU Bison sets the value -2 */
7631 else if (yychar == -2) {
7633 else if ((yychar & 127) == 127) {
7635 if (PL_lex_state == LEX_NORMAL ||
7636 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7637 where = "at end of line";
7638 else if (PL_lex_inpat)
7639 where = "within pattern";
7641 where = "within string";
7644 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7646 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7647 else if (isPRINT_LC(yychar))
7648 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7650 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7651 where = SvPVX(where_sv);
7653 msg = sv_2mortal(newSVpv(s, 0));
7654 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7655 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7657 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7659 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7660 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7661 Perl_sv_catpvf(aTHX_ msg,
7662 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7663 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7666 if (PL_in_eval & EVAL_WARNONLY)
7667 Perl_warn(aTHX_ "%"SVf, msg);
7670 if (PL_error_count >= 10) {
7671 if (PL_in_eval && SvCUR(ERRSV))
7672 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7673 ERRSV, OutCopFILE(PL_curcop));
7675 Perl_croak(aTHX_ "%s has too many errors.\n",
7676 OutCopFILE(PL_curcop));
7679 PL_in_my_stash = Nullhv;
7683 #pragma segment Main
7687 S_swallow_bom(pTHX_ U8 *s)
7690 slen = SvCUR(PL_linestr);
7694 /* UTF-16 little-endian */
7695 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7696 Perl_croak(aTHX_ "Unsupported script encoding");
7697 #ifndef PERL_NO_UTF16_FILTER
7698 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7700 if (PL_bufend > (char*)s) {
7704 filter_add(utf16rev_textfilter, NULL);
7705 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7706 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7707 PL_bufend - (char*)s - 1,
7709 Copy(news, s, newlen, U8);
7710 SvCUR_set(PL_linestr, newlen);
7711 PL_bufend = SvPVX(PL_linestr) + newlen;
7712 news[newlen++] = '\0';
7716 Perl_croak(aTHX_ "Unsupported script encoding");
7721 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7722 #ifndef PERL_NO_UTF16_FILTER
7723 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7725 if (PL_bufend > (char *)s) {
7729 filter_add(utf16_textfilter, NULL);
7730 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7731 PL_bufend = (char*)utf16_to_utf8(s, news,
7732 PL_bufend - (char*)s,
7734 Copy(news, s, newlen, U8);
7735 SvCUR_set(PL_linestr, newlen);
7736 PL_bufend = SvPVX(PL_linestr) + newlen;
7737 news[newlen++] = '\0';
7741 Perl_croak(aTHX_ "Unsupported script encoding");
7746 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7747 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7752 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7753 s[2] == 0xFE && s[3] == 0xFF)
7755 Perl_croak(aTHX_ "Unsupported script encoding");
7763 * Restore a source filter.
7767 restore_rsfp(pTHX_ void *f)
7769 PerlIO *fp = (PerlIO*)f;
7771 if (PL_rsfp == PerlIO_stdin())
7772 PerlIO_clearerr(PL_rsfp);
7773 else if (PL_rsfp && (PL_rsfp != fp))
7774 PerlIO_close(PL_rsfp);
7778 #ifndef PERL_NO_UTF16_FILTER
7780 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7782 I32 count = FILTER_READ(idx+1, sv, maxlen);
7787 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7788 if (!*SvPV_nolen(sv))
7789 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7792 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7793 sv_usepvn(sv, (char*)tmps, tend - tmps);
7799 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7801 I32 count = FILTER_READ(idx+1, sv, maxlen);
7806 if (!*SvPV_nolen(sv))
7807 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7810 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7811 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7812 sv_usepvn(sv, (char*)tmps, tend - tmps);