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);
1686 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1687 PL_sublex_info.sub_op->op_private |=
1688 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1692 /* shrink the sv if we allocated more than we used */
1693 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1694 SvLEN_set(sv, SvCUR(sv) + 1);
1695 Renew(SvPVX(sv), SvLEN(sv), char);
1698 /* return the substring (via yylval) only if we parsed anything */
1699 if (s > PL_bufptr) {
1700 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1701 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1703 ( PL_lex_inwhat == OP_TRANS
1705 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1708 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1715 * Returns TRUE if there's more to the expression (e.g., a subscript),
1718 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1720 * ->[ and ->{ return TRUE
1721 * { and [ outside a pattern are always subscripts, so return TRUE
1722 * if we're outside a pattern and it's not { or [, then return FALSE
1723 * if we're in a pattern and the first char is a {
1724 * {4,5} (any digits around the comma) returns FALSE
1725 * if we're in a pattern and the first char is a [
1727 * [SOMETHING] has a funky algorithm to decide whether it's a
1728 * character class or not. It has to deal with things like
1729 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1730 * anything else returns TRUE
1733 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1736 S_intuit_more(pTHX_ register char *s)
1738 if (PL_lex_brackets)
1740 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1742 if (*s != '{' && *s != '[')
1747 /* In a pattern, so maybe we have {n,m}. */
1764 /* On the other hand, maybe we have a character class */
1767 if (*s == ']' || *s == '^')
1770 /* this is terrifying, and it works */
1771 int weight = 2; /* let's weigh the evidence */
1773 unsigned char un_char = 255, last_un_char;
1774 char *send = strchr(s,']');
1775 char tmpbuf[sizeof PL_tokenbuf * 4];
1777 if (!send) /* has to be an expression */
1780 Zero(seen,256,char);
1783 else if (isDIGIT(*s)) {
1785 if (isDIGIT(s[1]) && s[2] == ']')
1791 for (; s < send; s++) {
1792 last_un_char = un_char;
1793 un_char = (unsigned char)*s;
1798 weight -= seen[un_char] * 10;
1799 if (isALNUM_lazy_if(s+1,UTF)) {
1800 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1801 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1806 else if (*s == '$' && s[1] &&
1807 strchr("[#!%*<>()-=",s[1])) {
1808 if (/*{*/ strchr("])} =",s[2]))
1817 if (strchr("wds]",s[1]))
1819 else if (seen['\''] || seen['"'])
1821 else if (strchr("rnftbxcav",s[1]))
1823 else if (isDIGIT(s[1])) {
1825 while (s[1] && isDIGIT(s[1]))
1835 if (strchr("aA01! ",last_un_char))
1837 if (strchr("zZ79~",s[1]))
1839 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1840 weight -= 5; /* cope with negative subscript */
1843 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1844 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1849 if (keyword(tmpbuf, d - tmpbuf))
1852 if (un_char == last_un_char + 1)
1854 weight -= seen[un_char];
1859 if (weight >= 0) /* probably a character class */
1869 * Does all the checking to disambiguate
1871 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1872 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1874 * First argument is the stuff after the first token, e.g. "bar".
1876 * Not a method if bar is a filehandle.
1877 * Not a method if foo is a subroutine prototyped to take a filehandle.
1878 * Not a method if it's really "Foo $bar"
1879 * Method if it's "foo $bar"
1880 * Not a method if it's really "print foo $bar"
1881 * Method if it's really "foo package::" (interpreted as package->foo)
1882 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1883 * Not a method if bar is a filehandle or package, but is quoted with
1888 S_intuit_method(pTHX_ char *start, GV *gv)
1890 char *s = start + (*start == '$');
1891 char tmpbuf[sizeof PL_tokenbuf];
1899 if ((cv = GvCVu(gv))) {
1900 char *proto = SvPVX(cv);
1910 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1911 /* start is the beginning of the possible filehandle/object,
1912 * and s is the end of it
1913 * tmpbuf is a copy of it
1916 if (*start == '$') {
1917 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1922 return *s == '(' ? FUNCMETH : METHOD;
1924 if (!keyword(tmpbuf, len)) {
1925 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1930 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1931 if (indirgv && GvCVu(indirgv))
1933 /* filehandle or package name makes it a method */
1934 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1936 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1937 return 0; /* no assumptions -- "=>" quotes bearword */
1939 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1940 newSVpvn(tmpbuf,len));
1941 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1945 return *s == '(' ? FUNCMETH : METHOD;
1953 * Return a string of Perl code to load the debugger. If PERL5DB
1954 * is set, it will return the contents of that, otherwise a
1955 * compile-time require of perl5db.pl.
1962 char *pdb = PerlEnv_getenv("PERL5DB");
1966 SETERRNO(0,SS_NORMAL);
1967 return "BEGIN { require 'perl5db.pl' }";
1973 /* Encoded script support. filter_add() effectively inserts a
1974 * 'pre-processing' function into the current source input stream.
1975 * Note that the filter function only applies to the current source file
1976 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1978 * The datasv parameter (which may be NULL) can be used to pass
1979 * private data to this instance of the filter. The filter function
1980 * can recover the SV using the FILTER_DATA macro and use it to
1981 * store private buffers and state information.
1983 * The supplied datasv parameter is upgraded to a PVIO type
1984 * and the IoDIRP/IoANY field is used to store the function pointer,
1985 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1986 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1987 * private use must be set using malloc'd pointers.
1991 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1996 if (!PL_rsfp_filters)
1997 PL_rsfp_filters = newAV();
1999 datasv = NEWSV(255,0);
2000 if (!SvUPGRADE(datasv, SVt_PVIO))
2001 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2002 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2003 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2004 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2005 (void*)funcp, SvPV_nolen(datasv)));
2006 av_unshift(PL_rsfp_filters, 1);
2007 av_store(PL_rsfp_filters, 0, datasv) ;
2012 /* Delete most recently added instance of this filter function. */
2014 Perl_filter_del(pTHX_ filter_t funcp)
2017 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2018 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2020 /* if filter is on top of stack (usual case) just pop it off */
2021 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2022 if (IoANY(datasv) == (void *)funcp) {
2023 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2024 IoANY(datasv) = (void *)NULL;
2025 sv_free(av_pop(PL_rsfp_filters));
2029 /* we need to search for the correct entry and clear it */
2030 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2034 /* Invoke the n'th filter function for the current rsfp. */
2036 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2039 /* 0 = read one text line */
2044 if (!PL_rsfp_filters)
2046 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2047 /* Provide a default input filter to make life easy. */
2048 /* Note that we append to the line. This is handy. */
2049 DEBUG_P(PerlIO_printf(Perl_debug_log,
2050 "filter_read %d: from rsfp\n", idx));
2054 int old_len = SvCUR(buf_sv) ;
2056 /* ensure buf_sv is large enough */
2057 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2058 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2059 if (PerlIO_error(PL_rsfp))
2060 return -1; /* error */
2062 return 0 ; /* end of file */
2064 SvCUR_set(buf_sv, old_len + len) ;
2067 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2068 if (PerlIO_error(PL_rsfp))
2069 return -1; /* error */
2071 return 0 ; /* end of file */
2074 return SvCUR(buf_sv);
2076 /* Skip this filter slot if filter has been deleted */
2077 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2078 DEBUG_P(PerlIO_printf(Perl_debug_log,
2079 "filter_read %d: skipped (filter deleted)\n",
2081 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2083 /* Get function pointer hidden within datasv */
2084 funcp = (filter_t)IoANY(datasv);
2085 DEBUG_P(PerlIO_printf(Perl_debug_log,
2086 "filter_read %d: via function %p (%s)\n",
2087 idx, (void*)funcp, SvPV_nolen(datasv)));
2088 /* Call function. The function is expected to */
2089 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2090 /* Return: <0:error, =0:eof, >0:not eof */
2091 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2095 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2097 #ifdef PERL_CR_FILTER
2098 if (!PL_rsfp_filters) {
2099 filter_add(S_cr_textfilter,NULL);
2102 if (PL_rsfp_filters) {
2105 SvCUR_set(sv, 0); /* start with empty line */
2106 if (FILTER_READ(0, sv, 0) > 0)
2107 return ( SvPVX(sv) ) ;
2112 return (sv_gets(sv, fp, append));
2116 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2120 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2124 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2125 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2127 return GvHV(gv); /* Foo:: */
2130 /* use constant CLASS => 'MyClass' */
2131 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2133 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2134 pkgname = SvPV_nolen(sv);
2138 return gv_stashpv(pkgname, FALSE);
2142 static char* exp_name[] =
2143 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2144 "ATTRTERM", "TERMBLOCK"
2151 Works out what to call the token just pulled out of the input
2152 stream. The yacc parser takes care of taking the ops we return and
2153 stitching them into a tree.
2159 if read an identifier
2160 if we're in a my declaration
2161 croak if they tried to say my($foo::bar)
2162 build the ops for a my() declaration
2163 if it's an access to a my() variable
2164 are we in a sort block?
2165 croak if my($a); $a <=> $b
2166 build ops for access to a my() variable
2167 if in a dq string, and they've said @foo and we can't find @foo
2169 build ops for a bareword
2170 if we already built the token before, use it.
2173 #ifdef USE_PURE_BISON
2175 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2180 yylval_pointer[yyactlevel] = lvalp;
2181 yychar_pointer[yyactlevel] = lcharp;
2182 if (yyactlevel >= YYMAXLEVEL)
2183 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2185 r = Perl_yylex(aTHX);
2195 #pragma segment Perl_yylex
2208 /* check if there's an identifier for us to look at */
2209 if (PL_pending_ident)
2210 return S_pending_ident(aTHX);
2212 /* no identifier pending identification */
2214 switch (PL_lex_state) {
2216 case LEX_NORMAL: /* Some compilers will produce faster */
2217 case LEX_INTERPNORMAL: /* code if we comment these out. */
2221 /* when we've already built the next token, just pull it out of the queue */
2224 yylval = PL_nextval[PL_nexttoke];
2226 PL_lex_state = PL_lex_defer;
2227 PL_expect = PL_lex_expect;
2228 PL_lex_defer = LEX_NORMAL;
2230 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2231 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2232 (IV)PL_nexttype[PL_nexttoke]); });
2234 return(PL_nexttype[PL_nexttoke]);
2236 /* interpolated case modifiers like \L \U, including \Q and \E.
2237 when we get here, PL_bufptr is at the \
2239 case LEX_INTERPCASEMOD:
2241 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2242 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2244 /* handle \E or end of string */
2245 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2249 if (PL_lex_casemods) {
2250 oldmod = PL_lex_casestack[--PL_lex_casemods];
2251 PL_lex_casestack[PL_lex_casemods] = '\0';
2253 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2255 PL_lex_state = LEX_INTERPCONCAT;
2259 if (PL_bufptr != PL_bufend)
2261 PL_lex_state = LEX_INTERPCONCAT;
2265 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2266 "### Saw case modifier at '%s'\n", PL_bufptr); });
2268 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2269 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2270 if (strchr("LU", *s) &&
2271 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2273 PL_lex_casestack[--PL_lex_casemods] = '\0';
2276 if (PL_lex_casemods > 10) {
2277 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2278 if (newlb != PL_lex_casestack) {
2280 PL_lex_casestack = newlb;
2283 PL_lex_casestack[PL_lex_casemods++] = *s;
2284 PL_lex_casestack[PL_lex_casemods] = '\0';
2285 PL_lex_state = LEX_INTERPCONCAT;
2286 PL_nextval[PL_nexttoke].ival = 0;
2289 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2291 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2293 PL_nextval[PL_nexttoke].ival = OP_LC;
2295 PL_nextval[PL_nexttoke].ival = OP_UC;
2297 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2299 Perl_croak(aTHX_ "panic: yylex");
2302 if (PL_lex_starts) {
2311 case LEX_INTERPPUSH:
2312 return sublex_push();
2314 case LEX_INTERPSTART:
2315 if (PL_bufptr == PL_bufend)
2316 return sublex_done();
2317 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2318 "### Interpolated variable at '%s'\n", PL_bufptr); });
2320 PL_lex_dojoin = (*PL_bufptr == '@');
2321 PL_lex_state = LEX_INTERPNORMAL;
2322 if (PL_lex_dojoin) {
2323 PL_nextval[PL_nexttoke].ival = 0;
2325 force_ident("\"", '$');
2326 PL_nextval[PL_nexttoke].ival = 0;
2328 PL_nextval[PL_nexttoke].ival = 0;
2330 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2333 if (PL_lex_starts++) {
2339 case LEX_INTERPENDMAYBE:
2340 if (intuit_more(PL_bufptr)) {
2341 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2347 if (PL_lex_dojoin) {
2348 PL_lex_dojoin = FALSE;
2349 PL_lex_state = LEX_INTERPCONCAT;
2352 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2353 && SvEVALED(PL_lex_repl))
2355 if (PL_bufptr != PL_bufend)
2356 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2357 PL_lex_repl = Nullsv;
2360 case LEX_INTERPCONCAT:
2362 if (PL_lex_brackets)
2363 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2365 if (PL_bufptr == PL_bufend)
2366 return sublex_done();
2368 if (SvIVX(PL_linestr) == '\'') {
2369 SV *sv = newSVsv(PL_linestr);
2372 else if ( PL_hints & HINT_NEW_RE )
2373 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2374 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2378 s = scan_const(PL_bufptr);
2380 PL_lex_state = LEX_INTERPCASEMOD;
2382 PL_lex_state = LEX_INTERPSTART;
2385 if (s != PL_bufptr) {
2386 PL_nextval[PL_nexttoke] = yylval;
2389 if (PL_lex_starts++)
2399 PL_lex_state = LEX_NORMAL;
2400 s = scan_formline(PL_bufptr);
2401 if (!PL_lex_formbrack)
2407 PL_oldoldbufptr = PL_oldbufptr;
2410 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2411 exp_name[PL_expect], s);
2417 if (isIDFIRST_lazy_if(s,UTF))
2419 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2422 goto fake_eof; /* emulate EOF on ^D or ^Z */
2427 if (PL_lex_brackets)
2428 yyerror("Missing right curly or square bracket");
2429 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2430 "### Tokener got EOF\n");
2434 if (s++ < PL_bufend)
2435 goto retry; /* ignore stray nulls */
2438 if (!PL_in_eval && !PL_preambled) {
2439 PL_preambled = TRUE;
2440 sv_setpv(PL_linestr,incl_perldb());
2441 if (SvCUR(PL_linestr))
2442 sv_catpv(PL_linestr,";");
2444 while(AvFILLp(PL_preambleav) >= 0) {
2445 SV *tmpsv = av_shift(PL_preambleav);
2446 sv_catsv(PL_linestr, tmpsv);
2447 sv_catpv(PL_linestr, ";");
2450 sv_free((SV*)PL_preambleav);
2451 PL_preambleav = NULL;
2453 if (PL_minus_n || PL_minus_p) {
2454 sv_catpv(PL_linestr, "LINE: while (<>) {");
2456 sv_catpv(PL_linestr,"chomp;");
2459 if (strchr("/'\"", *PL_splitstr)
2460 && strchr(PL_splitstr + 1, *PL_splitstr))
2461 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2464 s = "'~#\200\1'"; /* surely one char is unused...*/
2465 while (s[1] && strchr(PL_splitstr, *s)) s++;
2467 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2468 "q" + (delim == '\''), delim);
2469 for (s = PL_splitstr; *s; s++) {
2471 sv_catpvn(PL_linestr, "\\", 1);
2472 sv_catpvn(PL_linestr, s, 1);
2474 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2478 sv_catpv(PL_linestr,"our @F=split(' ');");
2481 sv_catpv(PL_linestr, "\n");
2482 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2483 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2484 PL_last_lop = PL_last_uni = Nullch;
2485 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2486 SV *sv = NEWSV(85,0);
2488 sv_upgrade(sv, SVt_PVMG);
2489 sv_setsv(sv,PL_linestr);
2492 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2497 bof = PL_rsfp ? TRUE : FALSE;
2498 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2501 if (PL_preprocess && !PL_in_eval)
2502 (void)PerlProc_pclose(PL_rsfp);
2503 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2504 PerlIO_clearerr(PL_rsfp);
2506 (void)PerlIO_close(PL_rsfp);
2508 PL_doextract = FALSE;
2510 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2511 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2512 sv_catpv(PL_linestr,";}");
2513 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2514 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2515 PL_last_lop = PL_last_uni = Nullch;
2516 PL_minus_n = PL_minus_p = 0;
2519 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2520 PL_last_lop = PL_last_uni = Nullch;
2521 sv_setpv(PL_linestr,"");
2522 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2524 /* if it looks like the start of a BOM, check if it in fact is */
2525 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2526 #ifdef PERLIO_IS_STDIO
2527 # ifdef __GNU_LIBRARY__
2528 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2529 # define FTELL_FOR_PIPE_IS_BROKEN
2533 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2534 # define FTELL_FOR_PIPE_IS_BROKEN
2539 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2540 /* This loses the possibility to detect the bof
2541 * situation on perl -P when the libc5 is being used.
2542 * Workaround? Maybe attach some extra state to PL_rsfp?
2545 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2547 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2550 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2551 s = swallow_bom((U8*)s);
2555 /* Incest with pod. */
2556 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2557 sv_setpv(PL_linestr, "");
2558 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2559 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2560 PL_last_lop = PL_last_uni = Nullch;
2561 PL_doextract = FALSE;
2565 } while (PL_doextract);
2566 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2567 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2568 SV *sv = NEWSV(85,0);
2570 sv_upgrade(sv, SVt_PVMG);
2571 sv_setsv(sv,PL_linestr);
2574 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2576 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2577 PL_last_lop = PL_last_uni = Nullch;
2578 if (CopLINE(PL_curcop) == 1) {
2579 while (s < PL_bufend && isSPACE(*s))
2581 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2585 if (*s == '#' && *(s+1) == '!')
2587 #ifdef ALTERNATE_SHEBANG
2589 static char as[] = ALTERNATE_SHEBANG;
2590 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2591 d = s + (sizeof(as) - 1);
2593 #endif /* ALTERNATE_SHEBANG */
2602 while (*d && !isSPACE(*d))
2606 #ifdef ARG_ZERO_IS_SCRIPT
2607 if (ipathend > ipath) {
2609 * HP-UX (at least) sets argv[0] to the script name,
2610 * which makes $^X incorrect. And Digital UNIX and Linux,
2611 * at least, set argv[0] to the basename of the Perl
2612 * interpreter. So, having found "#!", we'll set it right.
2614 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2615 assert(SvPOK(x) || SvGMAGICAL(x));
2616 if (sv_eq(x, CopFILESV(PL_curcop))) {
2617 sv_setpvn(x, ipath, ipathend - ipath);
2623 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2624 char *lstart = SvPV(x,llen);
2626 bstart += blen - llen;
2627 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2628 sv_setpvn(x, ipath, ipathend - ipath);
2633 TAINT_NOT; /* $^X is always tainted, but that's OK */
2635 #endif /* ARG_ZERO_IS_SCRIPT */
2640 d = instr(s,"perl -");
2642 d = instr(s,"perl");
2644 /* avoid getting into infinite loops when shebang
2645 * line contains "Perl" rather than "perl" */
2647 for (d = ipathend-4; d >= ipath; --d) {
2648 if ((*d == 'p' || *d == 'P')
2649 && !ibcmp(d, "perl", 4))
2659 #ifdef ALTERNATE_SHEBANG
2661 * If the ALTERNATE_SHEBANG on this system starts with a
2662 * character that can be part of a Perl expression, then if
2663 * we see it but not "perl", we're probably looking at the
2664 * start of Perl code, not a request to hand off to some
2665 * other interpreter. Similarly, if "perl" is there, but
2666 * not in the first 'word' of the line, we assume the line
2667 * contains the start of the Perl program.
2669 if (d && *s != '#') {
2671 while (*c && !strchr("; \t\r\n\f\v#", *c))
2674 d = Nullch; /* "perl" not in first word; ignore */
2676 *s = '#'; /* Don't try to parse shebang line */
2678 #endif /* ALTERNATE_SHEBANG */
2679 #ifndef MACOS_TRADITIONAL
2684 !instr(s,"indir") &&
2685 instr(PL_origargv[0],"perl"))
2691 while (s < PL_bufend && isSPACE(*s))
2693 if (s < PL_bufend) {
2694 Newz(899,newargv,PL_origargc+3,char*);
2696 while (s < PL_bufend && !isSPACE(*s))
2699 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2702 newargv = PL_origargv;
2704 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2705 Perl_croak(aTHX_ "Can't exec %s", ipath);
2709 U32 oldpdb = PL_perldb;
2710 bool oldn = PL_minus_n;
2711 bool oldp = PL_minus_p;
2713 while (*d && !isSPACE(*d)) d++;
2714 while (SPACE_OR_TAB(*d)) d++;
2717 bool switches_done = PL_doswitches;
2719 if (*d == 'M' || *d == 'm') {
2721 while (*d && !isSPACE(*d)) d++;
2722 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2725 d = moreswitches(d);
2727 if ((PERLDB_LINE && !oldpdb) ||
2728 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2729 /* if we have already added "LINE: while (<>) {",
2730 we must not do it again */
2732 sv_setpv(PL_linestr, "");
2733 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2734 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2735 PL_last_lop = PL_last_uni = Nullch;
2736 PL_preambled = FALSE;
2738 (void)gv_fetchfile(PL_origfilename);
2741 if (PL_doswitches && !switches_done) {
2742 int argc = PL_origargc;
2743 char **argv = PL_origargv;
2746 } while (argc && argv[0][0] == '-' && argv[0][1]);
2747 init_argv_symbols(argc,argv);
2753 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2755 PL_lex_state = LEX_FORMLINE;
2760 #ifdef PERL_STRICT_CR
2761 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2763 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2765 case ' ': case '\t': case '\f': case 013:
2766 #ifdef MACOS_TRADITIONAL
2773 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2774 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2775 /* handle eval qq[#line 1 "foo"\n ...] */
2776 CopLINE_dec(PL_curcop);
2780 while (s < d && *s != '\n')
2784 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2785 Perl_croak(aTHX_ "panic: input overflow");
2787 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2789 PL_lex_state = LEX_FORMLINE;
2799 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2806 while (s < PL_bufend && SPACE_OR_TAB(*s))
2809 if (strnEQ(s,"=>",2)) {
2810 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2811 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2812 "### Saw unary minus before =>, forcing word '%s'\n", s);
2814 OPERATOR('-'); /* unary minus */
2816 PL_last_uni = PL_oldbufptr;
2818 case 'r': ftst = OP_FTEREAD; break;
2819 case 'w': ftst = OP_FTEWRITE; break;
2820 case 'x': ftst = OP_FTEEXEC; break;
2821 case 'o': ftst = OP_FTEOWNED; break;
2822 case 'R': ftst = OP_FTRREAD; break;
2823 case 'W': ftst = OP_FTRWRITE; break;
2824 case 'X': ftst = OP_FTREXEC; break;
2825 case 'O': ftst = OP_FTROWNED; break;
2826 case 'e': ftst = OP_FTIS; break;
2827 case 'z': ftst = OP_FTZERO; break;
2828 case 's': ftst = OP_FTSIZE; break;
2829 case 'f': ftst = OP_FTFILE; break;
2830 case 'd': ftst = OP_FTDIR; break;
2831 case 'l': ftst = OP_FTLINK; break;
2832 case 'p': ftst = OP_FTPIPE; break;
2833 case 'S': ftst = OP_FTSOCK; break;
2834 case 'u': ftst = OP_FTSUID; break;
2835 case 'g': ftst = OP_FTSGID; break;
2836 case 'k': ftst = OP_FTSVTX; break;
2837 case 'b': ftst = OP_FTBLK; break;
2838 case 'c': ftst = OP_FTCHR; break;
2839 case 't': ftst = OP_FTTTY; break;
2840 case 'T': ftst = OP_FTTEXT; break;
2841 case 'B': ftst = OP_FTBINARY; break;
2842 case 'M': case 'A': case 'C':
2843 gv_fetchpv("\024",TRUE, SVt_PV);
2845 case 'M': ftst = OP_FTMTIME; break;
2846 case 'A': ftst = OP_FTATIME; break;
2847 case 'C': ftst = OP_FTCTIME; break;
2855 PL_last_lop_op = (OPCODE)ftst;
2856 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2857 "### Saw file test %c\n", (int)ftst);
2862 /* Assume it was a minus followed by a one-letter named
2863 * subroutine call (or a -bareword), then. */
2864 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2865 "### %c looked like a file test but was not\n",
2874 if (PL_expect == XOPERATOR)
2879 else if (*s == '>') {
2882 if (isIDFIRST_lazy_if(s,UTF)) {
2883 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2891 if (PL_expect == XOPERATOR)
2894 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2896 OPERATOR('-'); /* unary minus */
2903 if (PL_expect == XOPERATOR)
2908 if (PL_expect == XOPERATOR)
2911 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2917 if (PL_expect != XOPERATOR) {
2918 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2919 PL_expect = XOPERATOR;
2920 force_ident(PL_tokenbuf, '*');
2933 if (PL_expect == XOPERATOR) {
2937 PL_tokenbuf[0] = '%';
2938 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2939 if (!PL_tokenbuf[1]) {
2941 yyerror("Final % should be \\% or %name");
2944 PL_pending_ident = '%';
2963 switch (PL_expect) {
2966 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2968 PL_bufptr = s; /* update in case we back off */
2974 PL_expect = XTERMBLOCK;
2978 while (isIDFIRST_lazy_if(s,UTF)) {
2979 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2980 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2981 if (tmp < 0) tmp = -tmp;
2997 d = scan_str(d,TRUE,TRUE);
2999 /* MUST advance bufptr here to avoid bogus
3000 "at end of line" context messages from yyerror().
3002 PL_bufptr = s + len;
3003 yyerror("Unterminated attribute parameter in attribute list");
3006 return 0; /* EOF indicator */
3010 SV *sv = newSVpvn(s, len);
3011 sv_catsv(sv, PL_lex_stuff);
3012 attrs = append_elem(OP_LIST, attrs,
3013 newSVOP(OP_CONST, 0, sv));
3014 SvREFCNT_dec(PL_lex_stuff);
3015 PL_lex_stuff = Nullsv;
3018 /* NOTE: any CV attrs applied here need to be part of
3019 the CVf_BUILTIN_ATTRS define in cv.h! */
3020 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3021 CvLVALUE_on(PL_compcv);
3022 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3023 CvLOCKED_on(PL_compcv);
3024 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3025 CvMETHOD_on(PL_compcv);
3027 else if (PL_in_my == KEY_our && len == 6 &&
3028 strnEQ(s, "unique", len))
3029 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3031 /* After we've set the flags, it could be argued that
3032 we don't need to do the attributes.pm-based setting
3033 process, and shouldn't bother appending recognized
3034 flags. To experiment with that, uncomment the
3035 following "else". (Note that's already been
3036 uncommented. That keeps the above-applied built-in
3037 attributes from being intercepted (and possibly
3038 rejected) by a package's attribute routines, but is
3039 justified by the performance win for the common case
3040 of applying only built-in attributes.) */
3042 attrs = append_elem(OP_LIST, attrs,
3043 newSVOP(OP_CONST, 0,
3047 if (*s == ':' && s[1] != ':')
3050 break; /* require real whitespace or :'s */
3052 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3053 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3054 char q = ((*s == '\'') ? '"' : '\'');
3055 /* If here for an expression, and parsed no attrs, back off. */
3056 if (tmp == '=' && !attrs) {
3060 /* MUST advance bufptr here to avoid bogus "at end of line"
3061 context messages from yyerror().
3065 yyerror("Unterminated attribute list");
3067 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3075 PL_nextval[PL_nexttoke].opval = attrs;
3083 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3084 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3100 if (PL_lex_brackets <= 0)
3101 yyerror("Unmatched right square bracket");
3104 if (PL_lex_state == LEX_INTERPNORMAL) {
3105 if (PL_lex_brackets == 0) {
3106 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3107 PL_lex_state = LEX_INTERPEND;
3114 if (PL_lex_brackets > 100) {
3115 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3116 if (newlb != PL_lex_brackstack) {
3118 PL_lex_brackstack = newlb;
3121 switch (PL_expect) {
3123 if (PL_lex_formbrack) {
3127 if (PL_oldoldbufptr == PL_last_lop)
3128 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3130 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3131 OPERATOR(HASHBRACK);
3133 while (s < PL_bufend && SPACE_OR_TAB(*s))
3136 PL_tokenbuf[0] = '\0';
3137 if (d < PL_bufend && *d == '-') {
3138 PL_tokenbuf[0] = '-';
3140 while (d < PL_bufend && SPACE_OR_TAB(*d))
3143 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3144 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3146 while (d < PL_bufend && SPACE_OR_TAB(*d))
3149 char minus = (PL_tokenbuf[0] == '-');
3150 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3158 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3163 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3168 if (PL_oldoldbufptr == PL_last_lop)
3169 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3171 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3174 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3176 /* This hack is to get the ${} in the message. */
3178 yyerror("syntax error");
3181 OPERATOR(HASHBRACK);
3183 /* This hack serves to disambiguate a pair of curlies
3184 * as being a block or an anon hash. Normally, expectation
3185 * determines that, but in cases where we're not in a
3186 * position to expect anything in particular (like inside
3187 * eval"") we have to resolve the ambiguity. This code
3188 * covers the case where the first term in the curlies is a
3189 * quoted string. Most other cases need to be explicitly
3190 * disambiguated by prepending a `+' before the opening
3191 * curly in order to force resolution as an anon hash.
3193 * XXX should probably propagate the outer expectation
3194 * into eval"" to rely less on this hack, but that could
3195 * potentially break current behavior of eval"".
3199 if (*s == '\'' || *s == '"' || *s == '`') {
3200 /* common case: get past first string, handling escapes */
3201 for (t++; t < PL_bufend && *t != *s;)
3202 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3206 else if (*s == 'q') {
3209 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3213 char open, close, term;
3216 while (t < PL_bufend && isSPACE(*t))
3220 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3224 for (t++; t < PL_bufend; t++) {
3225 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3227 else if (*t == open)
3231 for (t++; t < PL_bufend; t++) {
3232 if (*t == '\\' && t+1 < PL_bufend)
3234 else if (*t == close && --brackets <= 0)
3236 else if (*t == open)
3242 else if (isALNUM_lazy_if(t,UTF)) {
3244 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3247 while (t < PL_bufend && isSPACE(*t))
3249 /* if comma follows first term, call it an anon hash */
3250 /* XXX it could be a comma expression with loop modifiers */
3251 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3252 || (*t == '=' && t[1] == '>')))
3253 OPERATOR(HASHBRACK);
3254 if (PL_expect == XREF)
3257 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3263 yylval.ival = CopLINE(PL_curcop);
3264 if (isSPACE(*s) || *s == '#')
3265 PL_copline = NOLINE; /* invalidate current command line number */
3270 if (PL_lex_brackets <= 0)
3271 yyerror("Unmatched right curly bracket");
3273 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3274 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3275 PL_lex_formbrack = 0;
3276 if (PL_lex_state == LEX_INTERPNORMAL) {
3277 if (PL_lex_brackets == 0) {
3278 if (PL_expect & XFAKEBRACK) {
3279 PL_expect &= XENUMMASK;
3280 PL_lex_state = LEX_INTERPEND;
3282 return yylex(); /* ignore fake brackets */
3284 if (*s == '-' && s[1] == '>')
3285 PL_lex_state = LEX_INTERPENDMAYBE;
3286 else if (*s != '[' && *s != '{')
3287 PL_lex_state = LEX_INTERPEND;
3290 if (PL_expect & XFAKEBRACK) {
3291 PL_expect &= XENUMMASK;
3293 return yylex(); /* ignore fake brackets */
3303 if (PL_expect == XOPERATOR) {
3304 if (ckWARN(WARN_SEMICOLON)
3305 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3307 CopLINE_dec(PL_curcop);
3308 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3309 CopLINE_inc(PL_curcop);
3314 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3316 PL_expect = XOPERATOR;
3317 force_ident(PL_tokenbuf, '&');
3321 yylval.ival = (OPpENTERSUB_AMPER<<8);
3340 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3341 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3343 if (PL_expect == XSTATE && isALPHA(tmp) &&
3344 (s == PL_linestart+1 || s[-2] == '\n') )
3346 if (PL_in_eval && !PL_rsfp) {
3351 if (strnEQ(s,"=cut",4)) {
3365 PL_doextract = TRUE;
3368 if (PL_lex_brackets < PL_lex_formbrack) {
3370 #ifdef PERL_STRICT_CR
3371 for (t = s; SPACE_OR_TAB(*t); t++) ;
3373 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3375 if (*t == '\n' || *t == '#') {
3393 if (PL_expect != XOPERATOR) {
3394 if (s[1] != '<' && !strchr(s,'>'))
3397 s = scan_heredoc(s);
3399 s = scan_inputsymbol(s);
3400 TERM(sublex_start());
3405 SHop(OP_LEFT_SHIFT);
3419 SHop(OP_RIGHT_SHIFT);
3428 if (PL_expect == XOPERATOR) {
3429 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3432 return ','; /* grandfather non-comma-format format */
3436 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3437 PL_tokenbuf[0] = '@';
3438 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3439 sizeof PL_tokenbuf - 1, FALSE);
3440 if (PL_expect == XOPERATOR)
3441 no_op("Array length", s);
3442 if (!PL_tokenbuf[1])
3444 PL_expect = XOPERATOR;
3445 PL_pending_ident = '#';
3449 PL_tokenbuf[0] = '$';
3450 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3451 sizeof PL_tokenbuf - 1, FALSE);
3452 if (PL_expect == XOPERATOR)
3454 if (!PL_tokenbuf[1]) {
3456 yyerror("Final $ should be \\$ or $name");
3460 /* This kludge not intended to be bulletproof. */
3461 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3462 yylval.opval = newSVOP(OP_CONST, 0,
3463 newSViv(PL_compiling.cop_arybase));
3464 yylval.opval->op_private = OPpCONST_ARYBASE;
3470 if (PL_lex_state == LEX_NORMAL)
3473 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3476 PL_tokenbuf[0] = '@';
3477 if (ckWARN(WARN_SYNTAX)) {
3479 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3482 PL_bufptr = skipspace(PL_bufptr);
3483 while (t < PL_bufend && *t != ']')
3485 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3486 "Multidimensional syntax %.*s not supported",
3487 (t - PL_bufptr) + 1, PL_bufptr);
3491 else if (*s == '{') {
3492 PL_tokenbuf[0] = '%';
3493 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3494 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3496 char tmpbuf[sizeof PL_tokenbuf];
3498 for (t++; isSPACE(*t); t++) ;
3499 if (isIDFIRST_lazy_if(t,UTF)) {
3500 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3501 for (; isSPACE(*t); t++) ;
3502 if (*t == ';' && get_cv(tmpbuf, FALSE))
3503 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3504 "You need to quote \"%s\"", tmpbuf);
3510 PL_expect = XOPERATOR;
3511 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3512 bool islop = (PL_last_lop == PL_oldoldbufptr);
3513 if (!islop || PL_last_lop_op == OP_GREPSTART)
3514 PL_expect = XOPERATOR;
3515 else if (strchr("$@\"'`q", *s))
3516 PL_expect = XTERM; /* e.g. print $fh "foo" */
3517 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3518 PL_expect = XTERM; /* e.g. print $fh &sub */
3519 else if (isIDFIRST_lazy_if(s,UTF)) {
3520 char tmpbuf[sizeof PL_tokenbuf];
3521 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3522 if ((tmp = keyword(tmpbuf, len))) {
3523 /* binary operators exclude handle interpretations */
3535 PL_expect = XTERM; /* e.g. print $fh length() */
3540 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3541 if (gv && GvCVu(gv))
3542 PL_expect = XTERM; /* e.g. print $fh subr() */
3545 else if (isDIGIT(*s))
3546 PL_expect = XTERM; /* e.g. print $fh 3 */
3547 else if (*s == '.' && isDIGIT(s[1]))
3548 PL_expect = XTERM; /* e.g. print $fh .3 */
3549 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3550 PL_expect = XTERM; /* e.g. print $fh -1 */
3551 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3552 PL_expect = XTERM; /* e.g. print $fh /.../
3553 XXX except DORDOR operator */
3554 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3555 PL_expect = XTERM; /* print $fh <<"EOF" */
3557 PL_pending_ident = '$';
3561 if (PL_expect == XOPERATOR)
3563 PL_tokenbuf[0] = '@';
3564 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3565 if (!PL_tokenbuf[1]) {
3567 yyerror("Final @ should be \\@ or @name");
3570 if (PL_lex_state == LEX_NORMAL)
3572 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3574 PL_tokenbuf[0] = '%';
3576 /* Warn about @ where they meant $. */
3577 if (ckWARN(WARN_SYNTAX)) {
3578 if (*s == '[' || *s == '{') {
3580 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3582 if (*t == '}' || *t == ']') {
3584 PL_bufptr = skipspace(PL_bufptr);
3585 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3586 "Scalar value %.*s better written as $%.*s",
3587 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3592 PL_pending_ident = '@';
3595 case '/': /* may be division, defined-or, or pattern */
3596 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3600 case '?': /* may either be conditional or pattern */
3601 if(PL_expect == XOPERATOR) {
3609 /* A // operator. */
3619 /* Disable warning on "study /blah/" */
3620 if (PL_oldoldbufptr == PL_last_uni
3621 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3622 || memNE(PL_last_uni, "study", 5)
3623 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3626 s = scan_pat(s,OP_MATCH);
3627 TERM(sublex_start());
3631 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3632 #ifdef PERL_STRICT_CR
3635 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3637 && (s == PL_linestart || s[-1] == '\n') )
3639 PL_lex_formbrack = 0;
3643 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3649 yylval.ival = OPf_SPECIAL;
3655 if (PL_expect != XOPERATOR)
3660 case '0': case '1': case '2': case '3': case '4':
3661 case '5': case '6': case '7': case '8': case '9':
3662 s = scan_num(s, &yylval);
3663 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3664 "### Saw number in '%s'\n", s);
3666 if (PL_expect == XOPERATOR)
3671 s = scan_str(s,FALSE,FALSE);
3672 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3673 "### Saw string before '%s'\n", s);
3675 if (PL_expect == XOPERATOR) {
3676 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3679 return ','; /* grandfather non-comma-format format */
3685 missingterm((char*)0);
3686 yylval.ival = OP_CONST;
3687 TERM(sublex_start());
3690 s = scan_str(s,FALSE,FALSE);
3691 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3692 "### Saw string before '%s'\n", s);
3694 if (PL_expect == XOPERATOR) {
3695 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3698 return ','; /* grandfather non-comma-format format */
3704 missingterm((char*)0);
3705 yylval.ival = OP_CONST;
3706 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3707 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3708 yylval.ival = OP_STRINGIFY;
3712 TERM(sublex_start());
3715 s = scan_str(s,FALSE,FALSE);
3716 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3717 "### Saw backtick string before '%s'\n", s);
3719 if (PL_expect == XOPERATOR)
3720 no_op("Backticks",s);
3722 missingterm((char*)0);
3723 yylval.ival = OP_BACKTICK;
3725 TERM(sublex_start());
3729 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3730 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3732 if (PL_expect == XOPERATOR)
3733 no_op("Backslash",s);
3737 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3741 while (isDIGIT(*start) || *start == '_')
3743 if (*start == '.' && isDIGIT(start[1])) {
3744 s = scan_num(s, &yylval);
3747 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3748 else if (!isALPHA(*start) && (PL_expect == XTERM
3749 || PL_expect == XREF || PL_expect == XSTATE
3750 || PL_expect == XTERMORDORDOR)) {
3754 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3757 s = scan_num(s, &yylval);
3764 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3799 I32 orig_keyword = 0;
3804 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3806 /* Some keywords can be followed by any delimiter, including ':' */
3807 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3808 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3809 (PL_tokenbuf[0] == 'q' &&
3810 strchr("qwxr", PL_tokenbuf[1])))));
3812 /* x::* is just a word, unless x is "CORE" */
3813 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3817 while (d < PL_bufend && isSPACE(*d))
3818 d++; /* no comments skipped here, or s### is misparsed */
3820 /* Is this a label? */
3821 if (!tmp && PL_expect == XSTATE
3822 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3824 yylval.pval = savepv(PL_tokenbuf);
3829 /* Check for keywords */
3830 tmp = keyword(PL_tokenbuf, len);
3832 /* Is this a word before a => operator? */
3833 if (*d == '=' && d[1] == '>') {
3835 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3836 yylval.opval->op_private = OPpCONST_BARE;
3837 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3838 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3842 if (tmp < 0) { /* second-class keyword? */
3843 GV *ogv = Nullgv; /* override (winner) */
3844 GV *hgv = Nullgv; /* hidden (loser) */
3845 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3847 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3850 if (GvIMPORTED_CV(gv))
3852 else if (! CvMETHOD(cv))
3856 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3857 (gv = *gvp) != (GV*)&PL_sv_undef &&
3858 GvCVu(gv) && GvIMPORTED_CV(gv))
3865 tmp = 0; /* overridden by import or by GLOBAL */
3868 && -tmp==KEY_lock /* XXX generalizable kludge */
3870 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3872 tmp = 0; /* any sub overrides "weak" keyword */
3874 else { /* no override */
3876 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3877 Perl_warner(aTHX_ packWARN(WARN_MISC),
3878 "dump() better written as CORE::dump()");
3882 if (ckWARN(WARN_AMBIGUOUS) && hgv
3883 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3884 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3885 "Ambiguous call resolved as CORE::%s(), %s",
3886 GvENAME(hgv), "qualify as such or use &");
3893 default: /* not a keyword */
3897 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3899 /* Get the rest if it looks like a package qualifier */
3901 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3903 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3906 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3907 *s == '\'' ? "'" : "::");
3912 if (PL_expect == XOPERATOR) {
3913 if (PL_bufptr == PL_linestart) {
3914 CopLINE_dec(PL_curcop);
3915 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3916 CopLINE_inc(PL_curcop);
3919 no_op("Bareword",s);
3922 /* Look for a subroutine with this name in current package,
3923 unless name is "Foo::", in which case Foo is a bearword
3924 (and a package name). */
3927 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3929 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3930 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3931 "Bareword \"%s\" refers to nonexistent package",
3934 PL_tokenbuf[len] = '\0';
3941 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3944 /* if we saw a global override before, get the right name */
3947 sv = newSVpvn("CORE::GLOBAL::",14);
3948 sv_catpv(sv,PL_tokenbuf);
3951 sv = newSVpv(PL_tokenbuf,0);
3953 /* Presume this is going to be a bareword of some sort. */
3956 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3957 yylval.opval->op_private = OPpCONST_BARE;
3958 /* UTF-8 package name? */
3959 if (UTF && !IN_BYTES &&
3960 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3963 /* And if "Foo::", then that's what it certainly is. */
3968 /* See if it's the indirect object for a list operator. */
3970 if (PL_oldoldbufptr &&
3971 PL_oldoldbufptr < PL_bufptr &&
3972 (PL_oldoldbufptr == PL_last_lop
3973 || PL_oldoldbufptr == PL_last_uni) &&
3974 /* NO SKIPSPACE BEFORE HERE! */
3975 (PL_expect == XREF ||
3976 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3978 bool immediate_paren = *s == '(';
3980 /* (Now we can afford to cross potential line boundary.) */
3983 /* Two barewords in a row may indicate method call. */
3985 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3988 /* If not a declared subroutine, it's an indirect object. */
3989 /* (But it's an indir obj regardless for sort.) */
3991 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3992 ((!gv || !GvCVu(gv)) &&
3993 (PL_last_lop_op != OP_MAPSTART &&
3994 PL_last_lop_op != OP_GREPSTART))))
3996 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4001 PL_expect = XOPERATOR;
4004 /* Is this a word before a => operator? */
4005 if (*s == '=' && s[1] == '>' && !pkgname) {
4007 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4008 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4009 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4013 /* If followed by a paren, it's certainly a subroutine. */
4016 if (gv && GvCVu(gv)) {
4017 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4018 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4023 PL_nextval[PL_nexttoke].opval = yylval.opval;
4024 PL_expect = XOPERATOR;
4030 /* If followed by var or block, call it a method (unless sub) */
4032 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4033 PL_last_lop = PL_oldbufptr;
4034 PL_last_lop_op = OP_METHOD;
4038 /* If followed by a bareword, see if it looks like indir obj. */
4041 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4042 && (tmp = intuit_method(s,gv)))
4045 /* Not a method, so call it a subroutine (if defined) */
4047 if (gv && GvCVu(gv)) {
4049 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4050 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4051 "Ambiguous use of -%s resolved as -&%s()",
4052 PL_tokenbuf, PL_tokenbuf);
4053 /* Check for a constant sub */
4055 if ((sv = cv_const_sv(cv))) {
4057 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4058 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4059 yylval.opval->op_private = 0;
4063 /* Resolve to GV now. */
4064 op_free(yylval.opval);
4065 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4066 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4067 PL_last_lop = PL_oldbufptr;
4068 PL_last_lop_op = OP_ENTERSUB;
4069 /* Is there a prototype? */
4072 char *proto = SvPV((SV*)cv, len);
4075 if (strEQ(proto, "$"))
4077 if (*proto == '&' && *s == '{') {
4078 sv_setpv(PL_subname, PL_curstash ?
4079 "__ANON__" : "__ANON__::__ANON__");
4083 PL_nextval[PL_nexttoke].opval = yylval.opval;
4089 /* Call it a bare word */
4091 if (PL_hints & HINT_STRICT_SUBS)
4092 yylval.opval->op_private |= OPpCONST_STRICT;
4095 if (ckWARN(WARN_RESERVED)) {
4096 if (lastchar != '-') {
4097 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4098 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4099 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4106 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4107 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4108 "Operator or semicolon missing before %c%s",
4109 lastchar, PL_tokenbuf);
4110 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4111 "Ambiguous use of %c resolved as operator %c",
4112 lastchar, lastchar);
4118 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4119 newSVpv(CopFILE(PL_curcop),0));
4123 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4124 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4127 case KEY___PACKAGE__:
4128 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4130 ? newSVsv(PL_curstname)
4139 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4140 char *pname = "main";
4141 if (PL_tokenbuf[2] == 'D')
4142 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4143 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4146 GvIOp(gv) = newIO();
4147 IoIFP(GvIOp(gv)) = PL_rsfp;
4148 #if defined(HAS_FCNTL) && defined(F_SETFD)
4150 int fd = PerlIO_fileno(PL_rsfp);
4151 fcntl(fd,F_SETFD,fd >= 3);
4154 /* Mark this internal pseudo-handle as clean */
4155 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4157 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4158 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4159 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4161 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4162 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4163 /* if the script was opened in binmode, we need to revert
4164 * it to text mode for compatibility; but only iff it has CRs
4165 * XXX this is a questionable hack at best. */
4166 if (PL_bufend-PL_bufptr > 2
4167 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4170 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4171 loc = PerlIO_tell(PL_rsfp);
4172 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4175 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4177 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4178 #endif /* NETWARE */
4179 #ifdef PERLIO_IS_STDIO /* really? */
4180 # if defined(__BORLANDC__)
4181 /* XXX see note in do_binmode() */
4182 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4186 PerlIO_seek(PL_rsfp, loc, 0);
4190 #ifdef PERLIO_LAYERS
4191 if (UTF && !IN_BYTES)
4192 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4205 if (PL_expect == XSTATE) {
4212 if (*s == ':' && s[1] == ':') {
4215 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4216 if (!(tmp = keyword(PL_tokenbuf, len)))
4217 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4231 LOP(OP_ACCEPT,XTERM);
4237 LOP(OP_ATAN2,XTERM);
4243 LOP(OP_BINMODE,XTERM);
4246 LOP(OP_BLESS,XTERM);
4255 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4272 if (!PL_cryptseen) {
4273 PL_cryptseen = TRUE;
4277 LOP(OP_CRYPT,XTERM);
4280 LOP(OP_CHMOD,XTERM);
4283 LOP(OP_CHOWN,XTERM);
4286 LOP(OP_CONNECT,XTERM);
4302 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4306 PL_hints |= HINT_BLOCK_SCOPE;
4316 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4317 LOP(OP_DBMOPEN,XTERM);
4323 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4330 yylval.ival = CopLINE(PL_curcop);
4344 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4345 UNIBRACK(OP_ENTEREVAL);
4363 case KEY_endhostent:
4369 case KEY_endservent:
4372 case KEY_endprotoent:
4383 yylval.ival = CopLINE(PL_curcop);
4385 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4387 if ((PL_bufend - p) >= 3 &&
4388 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4390 else if ((PL_bufend - p) >= 4 &&
4391 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4394 if (isIDFIRST_lazy_if(p,UTF)) {
4395 p = scan_ident(p, PL_bufend,
4396 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4400 Perl_croak(aTHX_ "Missing $ on loop variable");
4405 LOP(OP_FORMLINE,XTERM);
4411 LOP(OP_FCNTL,XTERM);
4417 LOP(OP_FLOCK,XTERM);
4426 LOP(OP_GREPSTART, XREF);
4429 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4444 case KEY_getpriority:
4445 LOP(OP_GETPRIORITY,XTERM);
4447 case KEY_getprotobyname:
4450 case KEY_getprotobynumber:
4451 LOP(OP_GPBYNUMBER,XTERM);
4453 case KEY_getprotoent:
4465 case KEY_getpeername:
4466 UNI(OP_GETPEERNAME);
4468 case KEY_gethostbyname:
4471 case KEY_gethostbyaddr:
4472 LOP(OP_GHBYADDR,XTERM);
4474 case KEY_gethostent:
4477 case KEY_getnetbyname:
4480 case KEY_getnetbyaddr:
4481 LOP(OP_GNBYADDR,XTERM);
4486 case KEY_getservbyname:
4487 LOP(OP_GSBYNAME,XTERM);
4489 case KEY_getservbyport:
4490 LOP(OP_GSBYPORT,XTERM);
4492 case KEY_getservent:
4495 case KEY_getsockname:
4496 UNI(OP_GETSOCKNAME);
4498 case KEY_getsockopt:
4499 LOP(OP_GSOCKOPT,XTERM);
4521 yylval.ival = CopLINE(PL_curcop);
4525 LOP(OP_INDEX,XTERM);
4531 LOP(OP_IOCTL,XTERM);
4543 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4575 LOP(OP_LISTEN,XTERM);
4584 s = scan_pat(s,OP_MATCH);
4585 TERM(sublex_start());
4588 LOP(OP_MAPSTART, XREF);
4591 LOP(OP_MKDIR,XTERM);
4594 LOP(OP_MSGCTL,XTERM);
4597 LOP(OP_MSGGET,XTERM);
4600 LOP(OP_MSGRCV,XTERM);
4603 LOP(OP_MSGSND,XTERM);
4609 if (isIDFIRST_lazy_if(s,UTF)) {
4610 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4611 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4613 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4614 if (!PL_in_my_stash) {
4617 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4625 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4632 if (PL_expect != XSTATE)
4633 yyerror("\"no\" not allowed in expression");
4634 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4635 s = force_version(s, FALSE);
4640 if (*s == '(' || (s = skipspace(s), *s == '('))
4647 if (isIDFIRST_lazy_if(s,UTF)) {
4649 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4651 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4653 && !(t[0] == '=' && t[1] == '>')
4655 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4656 "Precedence problem: open %.*s should be open(%.*s)",
4657 d - s, s, d - s, s);
4663 yylval.ival = OP_OR;
4673 LOP(OP_OPEN_DIR,XTERM);
4676 checkcomma(s,PL_tokenbuf,"filehandle");
4680 checkcomma(s,PL_tokenbuf,"filehandle");
4699 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4703 LOP(OP_PIPE_OP,XTERM);
4706 s = scan_str(s,FALSE,FALSE);
4708 missingterm((char*)0);
4709 yylval.ival = OP_CONST;
4710 TERM(sublex_start());
4716 s = scan_str(s,FALSE,FALSE);
4718 missingterm((char*)0);
4720 if (SvCUR(PL_lex_stuff)) {
4723 d = SvPV_force(PL_lex_stuff, len);
4726 for (; isSPACE(*d) && len; --len, ++d) ;
4729 if (!warned && ckWARN(WARN_QW)) {
4730 for (; !isSPACE(*d) && len; --len, ++d) {
4732 Perl_warner(aTHX_ packWARN(WARN_QW),
4733 "Possible attempt to separate words with commas");
4736 else if (*d == '#') {
4737 Perl_warner(aTHX_ packWARN(WARN_QW),
4738 "Possible attempt to put comments in qw() list");
4744 for (; !isSPACE(*d) && len; --len, ++d) ;
4746 sv = newSVpvn(b, d-b);
4747 if (DO_UTF8(PL_lex_stuff))
4749 words = append_elem(OP_LIST, words,
4750 newSVOP(OP_CONST, 0, tokeq(sv)));
4754 PL_nextval[PL_nexttoke].opval = words;
4759 SvREFCNT_dec(PL_lex_stuff);
4760 PL_lex_stuff = Nullsv;
4766 s = scan_str(s,FALSE,FALSE);
4768 missingterm((char*)0);
4769 yylval.ival = OP_STRINGIFY;
4770 if (SvIVX(PL_lex_stuff) == '\'')
4771 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4772 TERM(sublex_start());
4775 s = scan_pat(s,OP_QR);
4776 TERM(sublex_start());
4779 s = scan_str(s,FALSE,FALSE);
4781 missingterm((char*)0);
4782 yylval.ival = OP_BACKTICK;
4784 TERM(sublex_start());
4792 s = force_version(s, FALSE);
4794 else if (*s != 'v' || !isDIGIT(s[1])
4795 || (s = force_version(s, TRUE), *s == 'v'))
4797 *PL_tokenbuf = '\0';
4798 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4799 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4800 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4802 yyerror("<> should be quotes");
4810 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4814 LOP(OP_RENAME,XTERM);
4823 LOP(OP_RINDEX,XTERM);
4833 UNIDOR(OP_READLINE);
4846 LOP(OP_REVERSE,XTERM);
4849 UNIDOR(OP_READLINK);
4857 TERM(sublex_start());
4859 TOKEN(1); /* force error */
4868 LOP(OP_SELECT,XTERM);
4874 LOP(OP_SEMCTL,XTERM);
4877 LOP(OP_SEMGET,XTERM);
4880 LOP(OP_SEMOP,XTERM);
4886 LOP(OP_SETPGRP,XTERM);
4888 case KEY_setpriority:
4889 LOP(OP_SETPRIORITY,XTERM);
4891 case KEY_sethostent:
4897 case KEY_setservent:
4900 case KEY_setprotoent:
4910 LOP(OP_SEEKDIR,XTERM);
4912 case KEY_setsockopt:
4913 LOP(OP_SSOCKOPT,XTERM);
4919 LOP(OP_SHMCTL,XTERM);
4922 LOP(OP_SHMGET,XTERM);
4925 LOP(OP_SHMREAD,XTERM);
4928 LOP(OP_SHMWRITE,XTERM);
4931 LOP(OP_SHUTDOWN,XTERM);
4940 LOP(OP_SOCKET,XTERM);
4942 case KEY_socketpair:
4943 LOP(OP_SOCKPAIR,XTERM);
4946 checkcomma(s,PL_tokenbuf,"subroutine name");
4948 if (*s == ';' || *s == ')') /* probably a close */
4949 Perl_croak(aTHX_ "sort is now a reserved word");
4951 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4955 LOP(OP_SPLIT,XTERM);
4958 LOP(OP_SPRINTF,XTERM);
4961 LOP(OP_SPLICE,XTERM);
4976 LOP(OP_SUBSTR,XTERM);
4982 char tmpbuf[sizeof PL_tokenbuf];
4983 SSize_t tboffset = 0;
4984 expectation attrful;
4985 bool have_name, have_proto, bad_proto;
4990 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4991 (*s == ':' && s[1] == ':'))
4994 attrful = XATTRBLOCK;
4995 /* remember buffer pos'n for later force_word */
4996 tboffset = s - PL_oldbufptr;
4997 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4998 if (strchr(tmpbuf, ':'))
4999 sv_setpv(PL_subname, tmpbuf);
5001 sv_setsv(PL_subname,PL_curstname);
5002 sv_catpvn(PL_subname,"::",2);
5003 sv_catpvn(PL_subname,tmpbuf,len);
5010 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5011 PL_expect = XTERMBLOCK;
5012 attrful = XATTRTERM;
5013 sv_setpv(PL_subname,"?");
5017 if (key == KEY_format) {
5019 PL_lex_formbrack = PL_lex_brackets + 1;
5021 (void) force_word(PL_oldbufptr + tboffset, WORD,
5026 /* Look for a prototype */
5030 s = scan_str(s,FALSE,FALSE);
5032 Perl_croak(aTHX_ "Prototype not terminated");
5033 /* strip spaces and check for bad characters */
5034 d = SvPVX(PL_lex_stuff);
5037 for (p = d; *p; ++p) {
5040 if (!strchr("$@%*;[]&\\", *p))
5045 if (bad_proto && ckWARN(WARN_SYNTAX))
5046 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5047 "Illegal character in prototype for %s : %s",
5048 SvPVX(PL_subname), d);
5049 SvCUR(PL_lex_stuff) = tmp;
5057 if (*s == ':' && s[1] != ':')
5058 PL_expect = attrful;
5061 PL_nextval[PL_nexttoke].opval =
5062 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5063 PL_lex_stuff = Nullsv;
5067 sv_setpv(PL_subname,
5068 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5071 (void) force_word(PL_oldbufptr + tboffset, WORD,
5080 LOP(OP_SYSTEM,XREF);
5083 LOP(OP_SYMLINK,XTERM);
5086 LOP(OP_SYSCALL,XTERM);
5089 LOP(OP_SYSOPEN,XTERM);
5092 LOP(OP_SYSSEEK,XTERM);
5095 LOP(OP_SYSREAD,XTERM);
5098 LOP(OP_SYSWRITE,XTERM);
5102 TERM(sublex_start());
5123 LOP(OP_TRUNCATE,XTERM);
5135 yylval.ival = CopLINE(PL_curcop);
5139 yylval.ival = CopLINE(PL_curcop);
5143 LOP(OP_UNLINK,XTERM);
5149 LOP(OP_UNPACK,XTERM);
5152 LOP(OP_UTIME,XTERM);
5158 LOP(OP_UNSHIFT,XTERM);
5161 if (PL_expect != XSTATE)
5162 yyerror("\"use\" not allowed in expression");
5164 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5165 s = force_version(s, TRUE);
5166 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5167 PL_nextval[PL_nexttoke].opval = Nullop;
5170 else if (*s == 'v') {
5171 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5172 s = force_version(s, FALSE);
5176 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5177 s = force_version(s, FALSE);
5189 yylval.ival = CopLINE(PL_curcop);
5193 PL_hints |= HINT_BLOCK_SCOPE;
5200 LOP(OP_WAITPID,XTERM);
5209 ctl_l[0] = toCTRL('L');
5211 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5214 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5219 if (PL_expect == XOPERATOR)
5225 yylval.ival = OP_XOR;
5230 TERM(sublex_start());
5235 #pragma segment Main
5239 S_pending_ident(pTHX)
5243 /* pit holds the identifier we read and pending_ident is reset */
5244 char pit = PL_pending_ident;
5245 PL_pending_ident = 0;
5247 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5248 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5250 /* if we're in a my(), we can't allow dynamics here.
5251 $foo'bar has already been turned into $foo::bar, so
5252 just check for colons.
5254 if it's a legal name, the OP is a PADANY.
5257 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5258 if (strchr(PL_tokenbuf,':'))
5259 yyerror(Perl_form(aTHX_ "No package name allowed for "
5260 "variable %s in \"our\"",
5262 tmp = allocmy(PL_tokenbuf);
5265 if (strchr(PL_tokenbuf,':'))
5266 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5268 yylval.opval = newOP(OP_PADANY, 0);
5269 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5275 build the ops for accesses to a my() variable.
5277 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5278 then used in a comparison. This catches most, but not
5279 all cases. For instance, it catches
5280 sort { my($a); $a <=> $b }
5282 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5283 (although why you'd do that is anyone's guess).
5286 if (!strchr(PL_tokenbuf,':')) {
5287 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5288 /* might be an "our" variable" */
5289 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5290 /* build ops for a bareword */
5291 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5292 sv_catpvn(sym, "::", 2);
5293 sv_catpv(sym, PL_tokenbuf+1);
5294 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5295 yylval.opval->op_private = OPpCONST_ENTERED;
5296 gv_fetchpv(SvPVX(sym),
5298 ? (GV_ADDMULTI | GV_ADDINEVAL)
5301 ((PL_tokenbuf[0] == '$') ? SVt_PV
5302 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5307 /* if it's a sort block and they're naming $a or $b */
5308 if (PL_last_lop_op == OP_SORT &&
5309 PL_tokenbuf[0] == '$' &&
5310 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5313 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5314 d < PL_bufend && *d != '\n';
5317 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5318 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5324 yylval.opval = newOP(OP_PADANY, 0);
5325 yylval.opval->op_targ = tmp;
5331 Whine if they've said @foo in a doublequoted string,
5332 and @foo isn't a variable we can find in the symbol
5335 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5336 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5337 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5338 && ckWARN(WARN_AMBIGUOUS))
5340 /* Downgraded from fatal to warning 20000522 mjd */
5341 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5342 "Possible unintended interpolation of %s in string",
5347 /* build ops for a bareword */
5348 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5349 yylval.opval->op_private = OPpCONST_ENTERED;
5350 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5351 ((PL_tokenbuf[0] == '$') ? SVt_PV
5352 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5358 Perl_keyword(pTHX_ register char *d, I32 len)
5363 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5364 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5365 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5366 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5367 if (strEQ(d,"__END__")) return KEY___END__;
5371 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5376 if (strEQ(d,"and")) return -KEY_and;
5377 if (strEQ(d,"abs")) return -KEY_abs;
5380 if (strEQ(d,"alarm")) return -KEY_alarm;
5381 if (strEQ(d,"atan2")) return -KEY_atan2;
5384 if (strEQ(d,"accept")) return -KEY_accept;
5389 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5392 if (strEQ(d,"bless")) return -KEY_bless;
5393 if (strEQ(d,"bind")) return -KEY_bind;
5394 if (strEQ(d,"binmode")) return -KEY_binmode;
5397 if (strEQ(d,"CORE")) return -KEY_CORE;
5398 if (strEQ(d,"CHECK")) return KEY_CHECK;
5403 if (strEQ(d,"cmp")) return -KEY_cmp;
5404 if (strEQ(d,"chr")) return -KEY_chr;
5405 if (strEQ(d,"cos")) return -KEY_cos;
5408 if (strEQ(d,"chop")) return -KEY_chop;
5411 if (strEQ(d,"close")) return -KEY_close;
5412 if (strEQ(d,"chdir")) return -KEY_chdir;
5413 if (strEQ(d,"chomp")) return -KEY_chomp;
5414 if (strEQ(d,"chmod")) return -KEY_chmod;
5415 if (strEQ(d,"chown")) return -KEY_chown;
5416 if (strEQ(d,"crypt")) return -KEY_crypt;
5419 if (strEQ(d,"chroot")) return -KEY_chroot;
5420 if (strEQ(d,"caller")) return -KEY_caller;
5423 if (strEQ(d,"connect")) return -KEY_connect;
5426 if (strEQ(d,"closedir")) return -KEY_closedir;
5427 if (strEQ(d,"continue")) return -KEY_continue;
5432 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5437 if (strEQ(d,"do")) return KEY_do;
5440 if (strEQ(d,"die")) return -KEY_die;
5443 if (strEQ(d,"dump")) return -KEY_dump;
5446 if (strEQ(d,"delete")) return KEY_delete;
5449 if (strEQ(d,"defined")) return KEY_defined;
5450 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5453 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5458 if (strEQ(d,"END")) return KEY_END;
5463 if (strEQ(d,"eq")) return -KEY_eq;
5466 if (strEQ(d,"eof")) return -KEY_eof;
5467 if (strEQ(d,"err")) return -KEY_err;
5468 if (strEQ(d,"exp")) return -KEY_exp;
5471 if (strEQ(d,"else")) return KEY_else;
5472 if (strEQ(d,"exit")) return -KEY_exit;
5473 if (strEQ(d,"eval")) return KEY_eval;
5474 if (strEQ(d,"exec")) return -KEY_exec;
5475 if (strEQ(d,"each")) return -KEY_each;
5478 if (strEQ(d,"elsif")) return KEY_elsif;
5481 if (strEQ(d,"exists")) return KEY_exists;
5482 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5485 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5486 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5489 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5492 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5493 if (strEQ(d,"endservent")) return -KEY_endservent;
5496 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5503 if (strEQ(d,"for")) return KEY_for;
5506 if (strEQ(d,"fork")) return -KEY_fork;
5509 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5510 if (strEQ(d,"flock")) return -KEY_flock;
5513 if (strEQ(d,"format")) return KEY_format;
5514 if (strEQ(d,"fileno")) return -KEY_fileno;
5517 if (strEQ(d,"foreach")) return KEY_foreach;
5520 if (strEQ(d,"formline")) return -KEY_formline;
5525 if (strnEQ(d,"get",3)) {
5530 if (strEQ(d,"ppid")) return -KEY_getppid;
5531 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5534 if (strEQ(d,"pwent")) return -KEY_getpwent;
5535 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5536 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5539 if (strEQ(d,"peername")) return -KEY_getpeername;
5540 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5541 if (strEQ(d,"priority")) return -KEY_getpriority;
5544 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5547 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5551 else if (*d == 'h') {
5552 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5553 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5554 if (strEQ(d,"hostent")) return -KEY_gethostent;
5556 else if (*d == 'n') {
5557 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5558 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5559 if (strEQ(d,"netent")) return -KEY_getnetent;
5561 else if (*d == 's') {
5562 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5563 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5564 if (strEQ(d,"servent")) return -KEY_getservent;
5565 if (strEQ(d,"sockname")) return -KEY_getsockname;
5566 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5568 else if (*d == 'g') {
5569 if (strEQ(d,"grent")) return -KEY_getgrent;
5570 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5571 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5573 else if (*d == 'l') {
5574 if (strEQ(d,"login")) return -KEY_getlogin;
5576 else if (strEQ(d,"c")) return -KEY_getc;
5581 if (strEQ(d,"gt")) return -KEY_gt;
5582 if (strEQ(d,"ge")) return -KEY_ge;
5585 if (strEQ(d,"grep")) return KEY_grep;
5586 if (strEQ(d,"goto")) return KEY_goto;
5587 if (strEQ(d,"glob")) return KEY_glob;
5590 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5595 if (strEQ(d,"hex")) return -KEY_hex;
5598 if (strEQ(d,"INIT")) return KEY_INIT;
5603 if (strEQ(d,"if")) return KEY_if;
5606 if (strEQ(d,"int")) return -KEY_int;
5609 if (strEQ(d,"index")) return -KEY_index;
5610 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5615 if (strEQ(d,"join")) return -KEY_join;
5619 if (strEQ(d,"keys")) return -KEY_keys;
5620 if (strEQ(d,"kill")) return -KEY_kill;
5626 if (strEQ(d,"lt")) return -KEY_lt;
5627 if (strEQ(d,"le")) return -KEY_le;
5628 if (strEQ(d,"lc")) return -KEY_lc;
5631 if (strEQ(d,"log")) return -KEY_log;
5634 if (strEQ(d,"last")) return KEY_last;
5635 if (strEQ(d,"link")) return -KEY_link;
5636 if (strEQ(d,"lock")) return -KEY_lock;
5639 if (strEQ(d,"local")) return KEY_local;
5640 if (strEQ(d,"lstat")) return -KEY_lstat;
5643 if (strEQ(d,"length")) return -KEY_length;
5644 if (strEQ(d,"listen")) return -KEY_listen;
5647 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5650 if (strEQ(d,"localtime")) return -KEY_localtime;
5656 case 1: return KEY_m;
5658 if (strEQ(d,"my")) return KEY_my;
5661 if (strEQ(d,"map")) return KEY_map;
5664 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5667 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5668 if (strEQ(d,"msgget")) return -KEY_msgget;
5669 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5670 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5675 if (strEQ(d,"next")) return KEY_next;
5676 if (strEQ(d,"ne")) return -KEY_ne;
5677 if (strEQ(d,"not")) return -KEY_not;
5678 if (strEQ(d,"no")) return KEY_no;
5683 if (strEQ(d,"or")) return -KEY_or;
5686 if (strEQ(d,"ord")) return -KEY_ord;
5687 if (strEQ(d,"oct")) return -KEY_oct;
5688 if (strEQ(d,"our")) return KEY_our;
5691 if (strEQ(d,"open")) return -KEY_open;
5694 if (strEQ(d,"opendir")) return -KEY_opendir;
5701 if (strEQ(d,"pop")) return -KEY_pop;
5702 if (strEQ(d,"pos")) return KEY_pos;
5705 if (strEQ(d,"push")) return -KEY_push;
5706 if (strEQ(d,"pack")) return -KEY_pack;
5707 if (strEQ(d,"pipe")) return -KEY_pipe;
5710 if (strEQ(d,"print")) return KEY_print;
5713 if (strEQ(d,"printf")) return KEY_printf;
5716 if (strEQ(d,"package")) return KEY_package;
5719 if (strEQ(d,"prototype")) return KEY_prototype;
5724 if (strEQ(d,"q")) return KEY_q;
5725 if (strEQ(d,"qr")) return KEY_qr;
5726 if (strEQ(d,"qq")) return KEY_qq;
5727 if (strEQ(d,"qw")) return KEY_qw;
5728 if (strEQ(d,"qx")) return KEY_qx;
5730 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5735 if (strEQ(d,"ref")) return -KEY_ref;
5738 if (strEQ(d,"read")) return -KEY_read;
5739 if (strEQ(d,"rand")) return -KEY_rand;
5740 if (strEQ(d,"recv")) return -KEY_recv;
5741 if (strEQ(d,"redo")) return KEY_redo;
5744 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5745 if (strEQ(d,"reset")) return -KEY_reset;
5748 if (strEQ(d,"return")) return KEY_return;
5749 if (strEQ(d,"rename")) return -KEY_rename;
5750 if (strEQ(d,"rindex")) return -KEY_rindex;
5753 if (strEQ(d,"require")) return KEY_require;
5754 if (strEQ(d,"reverse")) return -KEY_reverse;
5755 if (strEQ(d,"readdir")) return -KEY_readdir;
5758 if (strEQ(d,"readlink")) return -KEY_readlink;
5759 if (strEQ(d,"readline")) return -KEY_readline;
5760 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5763 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5769 case 0: return KEY_s;
5771 if (strEQ(d,"scalar")) return KEY_scalar;
5776 if (strEQ(d,"seek")) return -KEY_seek;
5777 if (strEQ(d,"send")) return -KEY_send;
5780 if (strEQ(d,"semop")) return -KEY_semop;
5783 if (strEQ(d,"select")) return -KEY_select;
5784 if (strEQ(d,"semctl")) return -KEY_semctl;
5785 if (strEQ(d,"semget")) return -KEY_semget;
5788 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5789 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5792 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5793 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5796 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5799 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5800 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5801 if (strEQ(d,"setservent")) return -KEY_setservent;
5804 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5805 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5812 if (strEQ(d,"shift")) return -KEY_shift;
5815 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5816 if (strEQ(d,"shmget")) return -KEY_shmget;
5819 if (strEQ(d,"shmread")) return -KEY_shmread;
5822 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5823 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5828 if (strEQ(d,"sin")) return -KEY_sin;
5831 if (strEQ(d,"sleep")) return -KEY_sleep;
5834 if (strEQ(d,"sort")) return KEY_sort;
5835 if (strEQ(d,"socket")) return -KEY_socket;
5836 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5839 if (strEQ(d,"split")) return KEY_split;
5840 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5841 if (strEQ(d,"splice")) return -KEY_splice;
5844 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5847 if (strEQ(d,"srand")) return -KEY_srand;
5850 if (strEQ(d,"stat")) return -KEY_stat;
5851 if (strEQ(d,"study")) return KEY_study;
5854 if (strEQ(d,"substr")) return -KEY_substr;
5855 if (strEQ(d,"sub")) return KEY_sub;
5860 if (strEQ(d,"system")) return -KEY_system;
5863 if (strEQ(d,"symlink")) return -KEY_symlink;
5864 if (strEQ(d,"syscall")) return -KEY_syscall;
5865 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5866 if (strEQ(d,"sysread")) return -KEY_sysread;
5867 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5870 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5879 if (strEQ(d,"tr")) return KEY_tr;
5882 if (strEQ(d,"tie")) return KEY_tie;
5885 if (strEQ(d,"tell")) return -KEY_tell;
5886 if (strEQ(d,"tied")) return KEY_tied;
5887 if (strEQ(d,"time")) return -KEY_time;
5890 if (strEQ(d,"times")) return -KEY_times;
5893 if (strEQ(d,"telldir")) return -KEY_telldir;
5896 if (strEQ(d,"truncate")) return -KEY_truncate;
5903 if (strEQ(d,"uc")) return -KEY_uc;
5906 if (strEQ(d,"use")) return KEY_use;
5909 if (strEQ(d,"undef")) return KEY_undef;
5910 if (strEQ(d,"until")) return KEY_until;
5911 if (strEQ(d,"untie")) return KEY_untie;
5912 if (strEQ(d,"utime")) return -KEY_utime;
5913 if (strEQ(d,"umask")) return -KEY_umask;
5916 if (strEQ(d,"unless")) return KEY_unless;
5917 if (strEQ(d,"unpack")) return -KEY_unpack;
5918 if (strEQ(d,"unlink")) return -KEY_unlink;
5921 if (strEQ(d,"unshift")) return -KEY_unshift;
5922 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5927 if (strEQ(d,"values")) return -KEY_values;
5928 if (strEQ(d,"vec")) return -KEY_vec;
5933 if (strEQ(d,"warn")) return -KEY_warn;
5934 if (strEQ(d,"wait")) return -KEY_wait;
5937 if (strEQ(d,"while")) return KEY_while;
5938 if (strEQ(d,"write")) return -KEY_write;
5941 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5944 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5949 if (len == 1) return -KEY_x;
5950 if (strEQ(d,"xor")) return -KEY_xor;
5953 if (len == 1) return KEY_y;
5962 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5966 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5967 if (ckWARN(WARN_SYNTAX)) {
5969 for (w = s+2; *w && level; w++) {
5976 for (; *w && isSPACE(*w); w++) ;
5977 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5978 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5979 "%s (...) interpreted as function",name);
5982 while (s < PL_bufend && isSPACE(*s))
5986 while (s < PL_bufend && isSPACE(*s))
5988 if (isIDFIRST_lazy_if(s,UTF)) {
5990 while (isALNUM_lazy_if(s,UTF))
5992 while (s < PL_bufend && isSPACE(*s))
5997 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6001 Perl_croak(aTHX_ "No comma allowed after %s", what);
6006 /* Either returns sv, or mortalizes sv and returns a new SV*.
6007 Best used as sv=new_constant(..., sv, ...).
6008 If s, pv are NULL, calls subroutine with one argument,
6009 and type is used with error messages only. */
6012 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6016 HV *table = GvHV(PL_hintgv); /* ^H */
6020 const char *why1, *why2, *why3;
6022 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6025 why2 = strEQ(key,"charnames")
6026 ? "(possibly a missing \"use charnames ...\")"
6028 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6029 (type ? type: "undef"), why2);
6031 /* This is convoluted and evil ("goto considered harmful")
6032 * but I do not understand the intricacies of all the different
6033 * failure modes of %^H in here. The goal here is to make
6034 * the most probable error message user-friendly. --jhi */
6039 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6040 (type ? type: "undef"), why1, why2, why3);
6042 yyerror(SvPVX(msg));
6046 cvp = hv_fetch(table, key, strlen(key), FALSE);
6047 if (!cvp || !SvOK(*cvp)) {
6050 why3 = "} is not defined";
6053 sv_2mortal(sv); /* Parent created it permanently */
6056 pv = sv_2mortal(newSVpvn(s, len));
6058 typesv = sv_2mortal(newSVpv(type, 0));
6060 typesv = &PL_sv_undef;
6062 PUSHSTACKi(PERLSI_OVERLOAD);
6074 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6078 /* Check the eval first */
6079 if (!PL_in_eval && SvTRUE(ERRSV)) {
6081 sv_catpv(ERRSV, "Propagated");
6082 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6084 res = SvREFCNT_inc(sv);
6088 (void)SvREFCNT_inc(res);
6097 why1 = "Call to &{$^H{";
6099 why3 = "}} did not return a defined value";
6108 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6110 register char *d = dest;
6111 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6114 Perl_croak(aTHX_ ident_too_long);
6115 if (isALNUM(*s)) /* UTF handled below */
6117 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6122 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6126 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6127 char *t = s + UTF8SKIP(s);
6128 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6130 if (d + (t - s) > e)
6131 Perl_croak(aTHX_ ident_too_long);
6132 Copy(s, d, t - s, char);
6145 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6155 e = d + destlen - 3; /* two-character token, ending NUL */
6157 while (isDIGIT(*s)) {
6159 Perl_croak(aTHX_ ident_too_long);
6166 Perl_croak(aTHX_ ident_too_long);
6167 if (isALNUM(*s)) /* UTF handled below */
6169 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6174 else if (*s == ':' && s[1] == ':') {
6178 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6179 char *t = s + UTF8SKIP(s);
6180 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6182 if (d + (t - s) > e)
6183 Perl_croak(aTHX_ ident_too_long);
6184 Copy(s, d, t - s, char);
6195 if (PL_lex_state != LEX_NORMAL)
6196 PL_lex_state = LEX_INTERPENDMAYBE;
6199 if (*s == '$' && s[1] &&
6200 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6213 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6218 if (isSPACE(s[-1])) {
6221 if (!SPACE_OR_TAB(ch)) {
6227 if (isIDFIRST_lazy_if(d,UTF)) {
6231 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6233 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6236 Copy(s, d, e - s, char);
6241 while ((isALNUM(*s) || *s == ':') && d < e)
6244 Perl_croak(aTHX_ ident_too_long);
6247 while (s < send && SPACE_OR_TAB(*s)) s++;
6248 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6249 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6250 const char *brack = *s == '[' ? "[...]" : "{...}";
6251 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6252 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6253 funny, dest, brack, funny, dest, brack);
6256 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6260 /* Handle extended ${^Foo} variables
6261 * 1999-02-27 mjd-perl-patch@plover.com */
6262 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6266 while (isALNUM(*s) && d < e) {
6270 Perl_croak(aTHX_ ident_too_long);
6275 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6276 PL_lex_state = LEX_INTERPEND;
6279 if (PL_lex_state == LEX_NORMAL) {
6280 if (ckWARN(WARN_AMBIGUOUS) &&
6281 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6283 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6284 "Ambiguous use of %c{%s} resolved to %c%s",
6285 funny, dest, funny, dest);
6290 s = bracket; /* let the parser handle it */
6294 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6295 PL_lex_state = LEX_INTERPEND;
6300 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6305 *pmfl |= PMf_GLOBAL;
6307 *pmfl |= PMf_CONTINUE;
6311 *pmfl |= PMf_MULTILINE;
6313 *pmfl |= PMf_SINGLELINE;
6315 *pmfl |= PMf_EXTENDED;
6319 S_scan_pat(pTHX_ char *start, I32 type)
6324 s = scan_str(start,FALSE,FALSE);
6326 Perl_croak(aTHX_ "Search pattern not terminated");
6328 pm = (PMOP*)newPMOP(type, 0);
6329 if (PL_multi_open == '?')
6330 pm->op_pmflags |= PMf_ONCE;
6332 while (*s && strchr("iomsx", *s))
6333 pmflag(&pm->op_pmflags,*s++);
6336 while (*s && strchr("iogcmsx", *s))
6337 pmflag(&pm->op_pmflags,*s++);
6339 /* issue a warning if /c is specified,but /g is not */
6340 if (ckWARN(WARN_REGEXP) &&
6341 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6343 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6346 pm->op_pmpermflags = pm->op_pmflags;
6348 PL_lex_op = (OP*)pm;
6349 yylval.ival = OP_MATCH;
6354 S_scan_subst(pTHX_ char *start)
6361 yylval.ival = OP_NULL;
6363 s = scan_str(start,FALSE,FALSE);
6366 Perl_croak(aTHX_ "Substitution pattern not terminated");
6368 if (s[-1] == PL_multi_open)
6371 first_start = PL_multi_start;
6372 s = scan_str(s,FALSE,FALSE);
6375 SvREFCNT_dec(PL_lex_stuff);
6376 PL_lex_stuff = Nullsv;
6378 Perl_croak(aTHX_ "Substitution replacement not terminated");
6380 PL_multi_start = first_start; /* so whole substitution is taken together */
6382 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6388 else if (strchr("iogcmsx", *s))
6389 pmflag(&pm->op_pmflags,*s++);
6394 /* /c is not meaningful with s/// */
6395 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6397 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6402 PL_sublex_info.super_bufptr = s;
6403 PL_sublex_info.super_bufend = PL_bufend;
6405 pm->op_pmflags |= PMf_EVAL;
6406 repl = newSVpvn("",0);
6408 sv_catpv(repl, es ? "eval " : "do ");
6409 sv_catpvn(repl, "{ ", 2);
6410 sv_catsv(repl, PL_lex_repl);
6411 sv_catpvn(repl, " };", 2);
6413 SvREFCNT_dec(PL_lex_repl);
6417 pm->op_pmpermflags = pm->op_pmflags;
6418 PL_lex_op = (OP*)pm;
6419 yylval.ival = OP_SUBST;
6424 S_scan_trans(pTHX_ char *start)
6433 yylval.ival = OP_NULL;
6435 s = scan_str(start,FALSE,FALSE);
6437 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6438 if (s[-1] == PL_multi_open)
6441 s = scan_str(s,FALSE,FALSE);
6444 SvREFCNT_dec(PL_lex_stuff);
6445 PL_lex_stuff = Nullsv;
6447 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6450 complement = del = squash = 0;
6451 while (strchr("cds", *s)) {
6453 complement = OPpTRANS_COMPLEMENT;
6455 del = OPpTRANS_DELETE;
6457 squash = OPpTRANS_SQUASH;
6461 New(803, tbl, complement&&!del?258:256, short);
6462 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6463 o->op_private = del|squash|complement|
6464 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6465 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6468 yylval.ival = OP_TRANS;
6473 S_scan_heredoc(pTHX_ register char *s)
6476 I32 op_type = OP_SCALAR;
6483 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6487 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6490 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6491 if (*peek && strchr("`'\"",*peek)) {
6494 s = delimcpy(d, e, s, PL_bufend, term, &len);
6504 if (!isALNUM_lazy_if(s,UTF))
6505 deprecate_old("bare << to mean <<\"\"");
6506 for (; isALNUM_lazy_if(s,UTF); s++) {
6511 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6512 Perl_croak(aTHX_ "Delimiter for here document is too long");
6515 len = d - PL_tokenbuf;
6516 #ifndef PERL_STRICT_CR
6517 d = strchr(s, '\r');
6521 while (s < PL_bufend) {
6527 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6536 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6541 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6542 herewas = newSVpvn(s,PL_bufend-s);
6544 s--, herewas = newSVpvn(s,d-s);
6545 s += SvCUR(herewas);
6547 tmpstr = NEWSV(87,79);
6548 sv_upgrade(tmpstr, SVt_PVIV);
6553 else if (term == '`') {
6554 op_type = OP_BACKTICK;
6555 SvIVX(tmpstr) = '\\';
6559 PL_multi_start = CopLINE(PL_curcop);
6560 PL_multi_open = PL_multi_close = '<';
6561 term = *PL_tokenbuf;
6562 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6563 char *bufptr = PL_sublex_info.super_bufptr;
6564 char *bufend = PL_sublex_info.super_bufend;
6565 char *olds = s - SvCUR(herewas);
6566 s = strchr(bufptr, '\n');
6570 while (s < bufend &&
6571 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6573 CopLINE_inc(PL_curcop);
6576 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6577 missingterm(PL_tokenbuf);
6579 sv_setpvn(herewas,bufptr,d-bufptr+1);
6580 sv_setpvn(tmpstr,d+1,s-d);
6582 sv_catpvn(herewas,s,bufend-s);
6583 (void)strcpy(bufptr,SvPVX(herewas));
6590 while (s < PL_bufend &&
6591 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6593 CopLINE_inc(PL_curcop);
6595 if (s >= PL_bufend) {
6596 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6597 missingterm(PL_tokenbuf);
6599 sv_setpvn(tmpstr,d+1,s-d);
6601 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6603 sv_catpvn(herewas,s,PL_bufend-s);
6604 sv_setsv(PL_linestr,herewas);
6605 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6606 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6607 PL_last_lop = PL_last_uni = Nullch;
6610 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6611 while (s >= PL_bufend) { /* multiple line string? */
6613 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6614 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6615 missingterm(PL_tokenbuf);
6617 CopLINE_inc(PL_curcop);
6618 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6619 PL_last_lop = PL_last_uni = Nullch;
6620 #ifndef PERL_STRICT_CR
6621 if (PL_bufend - PL_linestart >= 2) {
6622 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6623 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6625 PL_bufend[-2] = '\n';
6627 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6629 else if (PL_bufend[-1] == '\r')
6630 PL_bufend[-1] = '\n';
6632 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6633 PL_bufend[-1] = '\n';
6635 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6636 SV *sv = NEWSV(88,0);
6638 sv_upgrade(sv, SVt_PVMG);
6639 sv_setsv(sv,PL_linestr);
6642 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6644 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6647 sv_catsv(PL_linestr,herewas);
6648 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6652 sv_catsv(tmpstr,PL_linestr);
6657 PL_multi_end = CopLINE(PL_curcop);
6658 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6659 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6660 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6662 SvREFCNT_dec(herewas);
6663 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6665 PL_lex_stuff = tmpstr;
6666 yylval.ival = op_type;
6671 takes: current position in input buffer
6672 returns: new position in input buffer
6673 side-effects: yylval and lex_op are set.
6678 <FH> read from filehandle
6679 <pkg::FH> read from package qualified filehandle
6680 <pkg'FH> read from package qualified filehandle
6681 <$fh> read from filehandle in $fh
6687 S_scan_inputsymbol(pTHX_ char *start)
6689 register char *s = start; /* current position in buffer */
6695 d = PL_tokenbuf; /* start of temp holding space */
6696 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6697 end = strchr(s, '\n');
6700 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6702 /* die if we didn't have space for the contents of the <>,
6703 or if it didn't end, or if we see a newline
6706 if (len >= sizeof PL_tokenbuf)
6707 Perl_croak(aTHX_ "Excessively long <> operator");
6709 Perl_croak(aTHX_ "Unterminated <> operator");
6714 Remember, only scalar variables are interpreted as filehandles by
6715 this code. Anything more complex (e.g., <$fh{$num}>) will be
6716 treated as a glob() call.
6717 This code makes use of the fact that except for the $ at the front,
6718 a scalar variable and a filehandle look the same.
6720 if (*d == '$' && d[1]) d++;
6722 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6723 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6726 /* If we've tried to read what we allow filehandles to look like, and
6727 there's still text left, then it must be a glob() and not a getline.
6728 Use scan_str to pull out the stuff between the <> and treat it
6729 as nothing more than a string.
6732 if (d - PL_tokenbuf != len) {
6733 yylval.ival = OP_GLOB;
6735 s = scan_str(start,FALSE,FALSE);
6737 Perl_croak(aTHX_ "Glob not terminated");
6741 bool readline_overriden = FALSE;
6742 GV *gv_readline = Nullgv;
6744 /* we're in a filehandle read situation */
6747 /* turn <> into <ARGV> */
6749 (void)strcpy(d,"ARGV");
6751 /* Check whether readline() is overriden */
6752 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6753 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6755 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6756 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6757 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6758 readline_overriden = TRUE;
6760 /* if <$fh>, create the ops to turn the variable into a
6766 /* try to find it in the pad for this block, otherwise find
6767 add symbol table ops
6769 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6770 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6771 SV *sym = sv_2mortal(
6772 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6773 sv_catpvn(sym, "::", 2);
6779 OP *o = newOP(OP_PADSV, 0);
6781 PL_lex_op = readline_overriden
6782 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6783 append_elem(OP_LIST, o,
6784 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6785 : (OP*)newUNOP(OP_READLINE, 0, o);
6794 ? (GV_ADDMULTI | GV_ADDINEVAL)
6797 PL_lex_op = readline_overriden
6798 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6799 append_elem(OP_LIST,
6800 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6801 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6802 : (OP*)newUNOP(OP_READLINE, 0,
6803 newUNOP(OP_RV2SV, 0,
6804 newGVOP(OP_GV, 0, gv)));
6806 if (!readline_overriden)
6807 PL_lex_op->op_flags |= OPf_SPECIAL;
6808 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6809 yylval.ival = OP_NULL;
6812 /* If it's none of the above, it must be a literal filehandle
6813 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6815 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6816 PL_lex_op = readline_overriden
6817 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6818 append_elem(OP_LIST,
6819 newGVOP(OP_GV, 0, gv),
6820 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6821 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6822 yylval.ival = OP_NULL;
6831 takes: start position in buffer
6832 keep_quoted preserve \ on the embedded delimiter(s)
6833 keep_delims preserve the delimiters around the string
6834 returns: position to continue reading from buffer
6835 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6836 updates the read buffer.
6838 This subroutine pulls a string out of the input. It is called for:
6839 q single quotes q(literal text)
6840 ' single quotes 'literal text'
6841 qq double quotes qq(interpolate $here please)
6842 " double quotes "interpolate $here please"
6843 qx backticks qx(/bin/ls -l)
6844 ` backticks `/bin/ls -l`
6845 qw quote words @EXPORT_OK = qw( func() $spam )
6846 m// regexp match m/this/
6847 s/// regexp substitute s/this/that/
6848 tr/// string transliterate tr/this/that/
6849 y/// string transliterate y/this/that/
6850 ($*@) sub prototypes sub foo ($)
6851 (stuff) sub attr parameters sub foo : attr(stuff)
6852 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6854 In most of these cases (all but <>, patterns and transliterate)
6855 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6856 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6857 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6860 It skips whitespace before the string starts, and treats the first
6861 character as the delimiter. If the delimiter is one of ([{< then
6862 the corresponding "close" character )]}> is used as the closing
6863 delimiter. It allows quoting of delimiters, and if the string has
6864 balanced delimiters ([{<>}]) it allows nesting.
6866 On success, the SV with the resulting string is put into lex_stuff or,
6867 if that is already non-NULL, into lex_repl. The second case occurs only
6868 when parsing the RHS of the special constructs s/// and tr/// (y///).
6869 For convenience, the terminating delimiter character is stuffed into
6874 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6876 SV *sv; /* scalar value: string */
6877 char *tmps; /* temp string, used for delimiter matching */
6878 register char *s = start; /* current position in the buffer */
6879 register char term; /* terminating character */
6880 register char *to; /* current position in the sv's data */
6881 I32 brackets = 1; /* bracket nesting level */
6882 bool has_utf8 = FALSE; /* is there any utf8 content? */
6884 /* skip space before the delimiter */
6888 /* mark where we are, in case we need to report errors */
6891 /* after skipping whitespace, the next character is the terminator */
6893 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6896 /* mark where we are */
6897 PL_multi_start = CopLINE(PL_curcop);
6898 PL_multi_open = term;
6900 /* find corresponding closing delimiter */
6901 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6903 PL_multi_close = term;
6905 /* create a new SV to hold the contents. 87 is leak category, I'm
6906 assuming. 79 is the SV's initial length. What a random number. */
6908 sv_upgrade(sv, SVt_PVIV);
6910 (void)SvPOK_only(sv); /* validate pointer */
6912 /* move past delimiter and try to read a complete string */
6914 sv_catpvn(sv, s, 1);
6917 /* extend sv if need be */
6918 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6919 /* set 'to' to the next character in the sv's string */
6920 to = SvPVX(sv)+SvCUR(sv);
6922 /* if open delimiter is the close delimiter read unbridle */
6923 if (PL_multi_open == PL_multi_close) {
6924 for (; s < PL_bufend; s++,to++) {
6925 /* embedded newlines increment the current line number */
6926 if (*s == '\n' && !PL_rsfp)
6927 CopLINE_inc(PL_curcop);
6928 /* handle quoted delimiters */
6929 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6930 if (!keep_quoted && s[1] == term)
6932 /* any other quotes are simply copied straight through */
6936 /* terminate when run out of buffer (the for() condition), or
6937 have found the terminator */
6938 else if (*s == term)
6940 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6946 /* if the terminator isn't the same as the start character (e.g.,
6947 matched brackets), we have to allow more in the quoting, and
6948 be prepared for nested brackets.
6951 /* read until we run out of string, or we find the terminator */
6952 for (; s < PL_bufend; s++,to++) {
6953 /* embedded newlines increment the line count */
6954 if (*s == '\n' && !PL_rsfp)
6955 CopLINE_inc(PL_curcop);
6956 /* backslashes can escape the open or closing characters */
6957 if (*s == '\\' && s+1 < PL_bufend) {
6959 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6964 /* allow nested opens and closes */
6965 else if (*s == PL_multi_close && --brackets <= 0)
6967 else if (*s == PL_multi_open)
6969 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6974 /* terminate the copied string and update the sv's end-of-string */
6976 SvCUR_set(sv, to - SvPVX(sv));
6979 * this next chunk reads more into the buffer if we're not done yet
6983 break; /* handle case where we are done yet :-) */
6985 #ifndef PERL_STRICT_CR
6986 if (to - SvPVX(sv) >= 2) {
6987 if ((to[-2] == '\r' && to[-1] == '\n') ||
6988 (to[-2] == '\n' && to[-1] == '\r'))
6992 SvCUR_set(sv, to - SvPVX(sv));
6994 else if (to[-1] == '\r')
6997 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7001 /* if we're out of file, or a read fails, bail and reset the current
7002 line marker so we can report where the unterminated string began
7005 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7007 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7010 /* we read a line, so increment our line counter */
7011 CopLINE_inc(PL_curcop);
7013 /* update debugger info */
7014 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7015 SV *sv = NEWSV(88,0);
7017 sv_upgrade(sv, SVt_PVMG);
7018 sv_setsv(sv,PL_linestr);
7021 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7024 /* having changed the buffer, we must update PL_bufend */
7025 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7026 PL_last_lop = PL_last_uni = Nullch;
7029 /* at this point, we have successfully read the delimited string */
7032 sv_catpvn(sv, s, 1);
7035 PL_multi_end = CopLINE(PL_curcop);
7038 /* if we allocated too much space, give some back */
7039 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7040 SvLEN_set(sv, SvCUR(sv) + 1);
7041 Renew(SvPVX(sv), SvLEN(sv), char);
7044 /* decide whether this is the first or second quoted string we've read
7057 takes: pointer to position in buffer
7058 returns: pointer to new position in buffer
7059 side-effects: builds ops for the constant in yylval.op
7061 Read a number in any of the formats that Perl accepts:
7063 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7064 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7067 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7069 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7072 If it reads a number without a decimal point or an exponent, it will
7073 try converting the number to an integer and see if it can do so
7074 without loss of precision.
7078 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7080 register char *s = start; /* current position in buffer */
7081 register char *d; /* destination in temp buffer */
7082 register char *e; /* end of temp buffer */
7083 NV nv; /* number read, as a double */
7084 SV *sv = Nullsv; /* place to put the converted number */
7085 bool floatit; /* boolean: int or float? */
7086 char *lastub = 0; /* position of last underbar */
7087 static char number_too_long[] = "Number too long";
7089 /* We use the first character to decide what type of number this is */
7093 Perl_croak(aTHX_ "panic: scan_num");
7095 /* if it starts with a 0, it could be an octal number, a decimal in
7096 0.13 disguise, or a hexadecimal number, or a binary number. */
7100 u holds the "number so far"
7101 shift the power of 2 of the base
7102 (hex == 4, octal == 3, binary == 1)
7103 overflowed was the number more than we can hold?
7105 Shift is used when we add a digit. It also serves as an "are
7106 we in octal/hex/binary?" indicator to disallow hex characters
7112 bool overflowed = FALSE;
7113 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7114 static char* bases[5] = { "", "binary", "", "octal",
7116 static char* Bases[5] = { "", "Binary", "", "Octal",
7118 static char *maxima[5] = { "",
7119 "0b11111111111111111111111111111111",
7123 char *base, *Base, *max;
7129 } else if (s[1] == 'b') {
7133 /* check for a decimal in disguise */
7134 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7136 /* so it must be octal */
7143 if (ckWARN(WARN_SYNTAX))
7144 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7145 "Misplaced _ in number");
7149 base = bases[shift];
7150 Base = Bases[shift];
7151 max = maxima[shift];
7153 /* read the rest of the number */
7155 /* x is used in the overflow test,
7156 b is the digit we're adding on. */
7161 /* if we don't mention it, we're done */
7165 /* _ are ignored -- but warned about if consecutive */
7167 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7168 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7169 "Misplaced _ in number");
7173 /* 8 and 9 are not octal */
7176 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7180 case '2': case '3': case '4':
7181 case '5': case '6': case '7':
7183 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7187 b = *s++ & 15; /* ASCII digit -> value of digit */
7191 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7192 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7193 /* make sure they said 0x */
7198 /* Prepare to put the digit we have onto the end
7199 of the number so far. We check for overflows.
7204 x = u << shift; /* make room for the digit */
7206 if ((x >> shift) != u
7207 && !(PL_hints & HINT_NEW_BINARY)) {
7210 if (ckWARN_d(WARN_OVERFLOW))
7211 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7212 "Integer overflow in %s number",
7215 u = x | b; /* add the digit to the end */
7218 n *= nvshift[shift];
7219 /* If an NV has not enough bits in its
7220 * mantissa to represent an UV this summing of
7221 * small low-order numbers is a waste of time
7222 * (because the NV cannot preserve the
7223 * low-order bits anyway): we could just
7224 * remember when did we overflow and in the
7225 * end just multiply n by the right
7233 /* if we get here, we had success: make a scalar value from
7238 /* final misplaced underbar check */
7240 if (ckWARN(WARN_SYNTAX))
7241 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7246 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7247 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7248 "%s number > %s non-portable",
7254 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7255 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7256 "%s number > %s non-portable",
7261 if (PL_hints & HINT_NEW_BINARY)
7262 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7267 handle decimal numbers.
7268 we're also sent here when we read a 0 as the first digit
7270 case '1': case '2': case '3': case '4': case '5':
7271 case '6': case '7': case '8': case '9': case '.':
7274 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7277 /* read next group of digits and _ and copy into d */
7278 while (isDIGIT(*s) || *s == '_') {
7279 /* skip underscores, checking for misplaced ones
7283 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7284 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7285 "Misplaced _ in number");
7289 /* check for end of fixed-length buffer */
7291 Perl_croak(aTHX_ number_too_long);
7292 /* if we're ok, copy the character */
7297 /* final misplaced underbar check */
7298 if (lastub && s == lastub + 1) {
7299 if (ckWARN(WARN_SYNTAX))
7300 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7303 /* read a decimal portion if there is one. avoid
7304 3..5 being interpreted as the number 3. followed
7307 if (*s == '.' && s[1] != '.') {
7312 if (ckWARN(WARN_SYNTAX))
7313 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7314 "Misplaced _ in number");
7318 /* copy, ignoring underbars, until we run out of digits.
7320 for (; isDIGIT(*s) || *s == '_'; s++) {
7321 /* fixed length buffer check */
7323 Perl_croak(aTHX_ number_too_long);
7325 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7326 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7327 "Misplaced _ in number");
7333 /* fractional part ending in underbar? */
7335 if (ckWARN(WARN_SYNTAX))
7336 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7337 "Misplaced _ in number");
7339 if (*s == '.' && isDIGIT(s[1])) {
7340 /* oops, it's really a v-string, but without the "v" */
7346 /* read exponent part, if present */
7347 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7351 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7352 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7354 /* stray preinitial _ */
7356 if (ckWARN(WARN_SYNTAX))
7357 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7358 "Misplaced _ in number");
7362 /* allow positive or negative exponent */
7363 if (*s == '+' || *s == '-')
7366 /* stray initial _ */
7368 if (ckWARN(WARN_SYNTAX))
7369 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7370 "Misplaced _ in number");
7374 /* read digits of exponent */
7375 while (isDIGIT(*s) || *s == '_') {
7378 Perl_croak(aTHX_ number_too_long);
7382 if (ckWARN(WARN_SYNTAX) &&
7383 ((lastub && s == lastub + 1) ||
7384 (!isDIGIT(s[1]) && s[1] != '_')))
7385 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7386 "Misplaced _ in number");
7393 /* make an sv from the string */
7397 We try to do an integer conversion first if no characters
7398 indicating "float" have been found.
7403 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7405 if (flags == IS_NUMBER_IN_UV) {
7407 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7410 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7411 if (uv <= (UV) IV_MIN)
7412 sv_setiv(sv, -(IV)uv);
7419 /* terminate the string */
7421 nv = Atof(PL_tokenbuf);
7425 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7426 (PL_hints & HINT_NEW_INTEGER) )
7427 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7428 (floatit ? "float" : "integer"),
7432 /* if it starts with a v, it could be a v-string */
7435 sv = NEWSV(92,5); /* preallocate storage space */
7436 s = scan_vstring(s,sv);
7440 /* make the op for the constant and return */
7443 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7445 lvalp->opval = Nullop;
7451 S_scan_formline(pTHX_ register char *s)
7455 SV *stuff = newSVpvn("",0);
7456 bool needargs = FALSE;
7459 if (*s == '.' || *s == /*{*/'}') {
7461 #ifdef PERL_STRICT_CR
7462 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7464 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7466 if (*t == '\n' || t == PL_bufend)
7469 if (PL_in_eval && !PL_rsfp) {
7470 eol = strchr(s,'\n');
7475 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7477 for (t = s; t < eol; t++) {
7478 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7480 goto enough; /* ~~ must be first line in formline */
7482 if (*t == '@' || *t == '^')
7486 sv_catpvn(stuff, s, eol-s);
7487 #ifndef PERL_STRICT_CR
7488 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7489 char *end = SvPVX(stuff) + SvCUR(stuff);
7501 s = filter_gets(PL_linestr, PL_rsfp, 0);
7502 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7503 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7504 PL_last_lop = PL_last_uni = Nullch;
7507 yyerror("Format not terminated");
7517 PL_lex_state = LEX_NORMAL;
7518 PL_nextval[PL_nexttoke].ival = 0;
7522 PL_lex_state = LEX_FORMLINE;
7523 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7525 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7529 SvREFCNT_dec(stuff);
7530 PL_lex_formbrack = 0;
7541 PL_cshlen = strlen(PL_cshname);
7546 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7548 I32 oldsavestack_ix = PL_savestack_ix;
7549 CV* outsidecv = PL_compcv;
7552 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7554 SAVEI32(PL_subline);
7555 save_item(PL_subname);
7556 SAVESPTR(PL_compcv);
7558 PL_compcv = (CV*)NEWSV(1104,0);
7559 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7560 CvFLAGS(PL_compcv) |= flags;
7562 PL_subline = CopLINE(PL_curcop);
7563 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7564 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7566 return oldsavestack_ix;
7570 #pragma segment Perl_yylex
7573 Perl_yywarn(pTHX_ char *s)
7575 PL_in_eval |= EVAL_WARNONLY;
7577 PL_in_eval &= ~EVAL_WARNONLY;
7582 Perl_yyerror(pTHX_ char *s)
7585 char *context = NULL;
7589 if (!yychar || (yychar == ';' && !PL_rsfp))
7591 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7592 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7595 The code below is removed for NetWare because it abends/crashes on NetWare
7596 when the script has error such as not having the closing quotes like:
7598 Checking of white spaces is anyway done in NetWare code.
7601 while (isSPACE(*PL_oldoldbufptr))
7604 context = PL_oldoldbufptr;
7605 contlen = PL_bufptr - PL_oldoldbufptr;
7607 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7608 PL_oldbufptr != PL_bufptr) {
7611 The code below is removed for NetWare because it abends/crashes on NetWare
7612 when the script has error such as not having the closing quotes like:
7614 Checking of white spaces is anyway done in NetWare code.
7617 while (isSPACE(*PL_oldbufptr))
7620 context = PL_oldbufptr;
7621 contlen = PL_bufptr - PL_oldbufptr;
7623 else if (yychar > 255)
7624 where = "next token ???";
7625 #ifdef USE_PURE_BISON
7626 /* GNU Bison sets the value -2 */
7627 else if (yychar == -2) {
7629 else if ((yychar & 127) == 127) {
7631 if (PL_lex_state == LEX_NORMAL ||
7632 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7633 where = "at end of line";
7634 else if (PL_lex_inpat)
7635 where = "within pattern";
7637 where = "within string";
7640 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7642 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7643 else if (isPRINT_LC(yychar))
7644 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7646 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7647 where = SvPVX(where_sv);
7649 msg = sv_2mortal(newSVpv(s, 0));
7650 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7651 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7653 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7655 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7656 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7657 Perl_sv_catpvf(aTHX_ msg,
7658 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7659 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7662 if (PL_in_eval & EVAL_WARNONLY)
7663 Perl_warn(aTHX_ "%"SVf, msg);
7666 if (PL_error_count >= 10) {
7667 if (PL_in_eval && SvCUR(ERRSV))
7668 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7669 ERRSV, OutCopFILE(PL_curcop));
7671 Perl_croak(aTHX_ "%s has too many errors.\n",
7672 OutCopFILE(PL_curcop));
7675 PL_in_my_stash = Nullhv;
7679 #pragma segment Main
7683 S_swallow_bom(pTHX_ U8 *s)
7686 slen = SvCUR(PL_linestr);
7690 /* UTF-16 little-endian */
7691 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7692 Perl_croak(aTHX_ "Unsupported script encoding");
7693 #ifndef PERL_NO_UTF16_FILTER
7694 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7696 if (PL_bufend > (char*)s) {
7700 filter_add(utf16rev_textfilter, NULL);
7701 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7702 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7703 PL_bufend - (char*)s - 1,
7705 Copy(news, s, newlen, U8);
7706 SvCUR_set(PL_linestr, newlen);
7707 PL_bufend = SvPVX(PL_linestr) + newlen;
7708 news[newlen++] = '\0';
7712 Perl_croak(aTHX_ "Unsupported script encoding");
7717 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7718 #ifndef PERL_NO_UTF16_FILTER
7719 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7721 if (PL_bufend > (char *)s) {
7725 filter_add(utf16_textfilter, NULL);
7726 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7727 PL_bufend = (char*)utf16_to_utf8(s, news,
7728 PL_bufend - (char*)s,
7730 Copy(news, s, newlen, U8);
7731 SvCUR_set(PL_linestr, newlen);
7732 PL_bufend = SvPVX(PL_linestr) + newlen;
7733 news[newlen++] = '\0';
7737 Perl_croak(aTHX_ "Unsupported script encoding");
7742 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7743 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7748 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7749 s[2] == 0xFE && s[3] == 0xFF)
7751 Perl_croak(aTHX_ "Unsupported script encoding");
7759 * Restore a source filter.
7763 restore_rsfp(pTHX_ void *f)
7765 PerlIO *fp = (PerlIO*)f;
7767 if (PL_rsfp == PerlIO_stdin())
7768 PerlIO_clearerr(PL_rsfp);
7769 else if (PL_rsfp && (PL_rsfp != fp))
7770 PerlIO_close(PL_rsfp);
7774 #ifndef PERL_NO_UTF16_FILTER
7776 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7778 I32 count = FILTER_READ(idx+1, sv, maxlen);
7783 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7784 if (!*SvPV_nolen(sv))
7785 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7788 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7789 sv_usepvn(sv, (char*)tmps, tend - tmps);
7795 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7797 I32 count = FILTER_READ(idx+1, sv, maxlen);
7802 if (!*SvPV_nolen(sv))
7803 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7806 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7807 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7808 sv_usepvn(sv, (char*)tmps, tend - tmps);