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 = XTERM,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.
168 #define UNI(f) return(yylval.ival = f, \
172 PL_last_uni = PL_oldbufptr, \
173 PL_last_lop_op = f, \
174 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
176 #define UNIBRACK(f) return(yylval.ival = f, \
179 PL_last_uni = PL_oldbufptr, \
180 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
182 /* grandfather return to old style */
183 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
188 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
191 SV* report = newSVpv(thing, 0);
192 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
195 if (s - PL_bufptr > 0)
196 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
198 if (PL_oldbufptr && *PL_oldbufptr)
199 sv_catpv(report, PL_tokenbuf);
201 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
210 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
211 * into an OP_ANDASSIGN or OP_ORASSIGN
215 S_ao(pTHX_ int toketype)
217 if (*PL_bufptr == '=') {
219 if (toketype == ANDAND)
220 yylval.ival = OP_ANDASSIGN;
221 else if (toketype == OROR)
222 yylval.ival = OP_ORASSIGN;
230 * When Perl expects an operator and finds something else, no_op
231 * prints the warning. It always prints "<something> found where
232 * operator expected. It prints "Missing semicolon on previous line?"
233 * if the surprise occurs at the start of the line. "do you need to
234 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
235 * where the compiler doesn't know if foo is a method call or a function.
236 * It prints "Missing operator before end of line" if there's nothing
237 * after the missing operator, or "... before <...>" if there is something
238 * after the missing operator.
242 S_no_op(pTHX_ char *what, char *s)
244 char *oldbp = PL_bufptr;
245 bool is_first = (PL_oldbufptr == PL_linestart);
251 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
253 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
254 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
256 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
257 if (t < PL_bufptr && isSPACE(*t))
258 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
259 t - PL_oldoldbufptr, PL_oldoldbufptr);
263 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
270 * Complain about missing quote/regexp/heredoc terminator.
271 * If it's called with (char *)NULL then it cauterizes the line buffer.
272 * If we're in a delimited string and the delimiter is a control
273 * character, it's reformatted into a two-char sequence like ^C.
278 S_missingterm(pTHX_ char *s)
283 char *nl = strrchr(s,'\n');
289 iscntrl(PL_multi_close)
291 PL_multi_close < 32 || PL_multi_close == 127
295 tmpbuf[1] = toCTRL(PL_multi_close);
301 *tmpbuf = (char)PL_multi_close;
305 q = strchr(s,'"') ? '\'' : '"';
306 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
314 Perl_deprecate(pTHX_ char *s)
316 if (ckWARN(WARN_DEPRECATED))
317 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
321 Perl_deprecate_old(pTHX_ char *s)
323 /* This function should NOT be called for any new deprecated warnings */
324 /* Use Perl_deprecate instead */
326 /* It is here to maintain backward compatibility with the pre-5.8 */
327 /* warnings category hierarchy. The "deprecated" category used to */
328 /* live under the "syntax" category. It is now a top-level category */
329 /* in its own right. */
331 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
332 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
333 "Use of %s is deprecated", s);
338 * Deprecate a comma-less variable list.
344 deprecate_old("comma-less variable list");
348 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
349 * utf16-to-utf8-reversed.
352 #ifdef PERL_CR_FILTER
356 register char *s = SvPVX(sv);
357 register char *e = s + SvCUR(sv);
358 /* outer loop optimized to do nothing if there are no CR-LFs */
360 if (*s++ == '\r' && *s == '\n') {
361 /* hit a CR-LF, need to copy the rest */
362 register char *d = s - 1;
365 if (*s == '\r' && s[1] == '\n')
376 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
378 I32 count = FILTER_READ(idx+1, sv, maxlen);
379 if (count > 0 && !maxlen)
387 * Initialize variables. Uses the Perl save_stack to save its state (for
388 * recursive calls to the parser).
392 Perl_lex_start(pTHX_ SV *line)
397 SAVEI32(PL_lex_dojoin);
398 SAVEI32(PL_lex_brackets);
399 SAVEI32(PL_lex_casemods);
400 SAVEI32(PL_lex_starts);
401 SAVEI32(PL_lex_state);
402 SAVEVPTR(PL_lex_inpat);
403 SAVEI32(PL_lex_inwhat);
404 if (PL_lex_state == LEX_KNOWNEXT) {
405 I32 toke = PL_nexttoke;
406 while (--toke >= 0) {
407 SAVEI32(PL_nexttype[toke]);
408 SAVEVPTR(PL_nextval[toke]);
410 SAVEI32(PL_nexttoke);
412 SAVECOPLINE(PL_curcop);
415 SAVEPPTR(PL_oldbufptr);
416 SAVEPPTR(PL_oldoldbufptr);
417 SAVEPPTR(PL_last_lop);
418 SAVEPPTR(PL_last_uni);
419 SAVEPPTR(PL_linestart);
420 SAVESPTR(PL_linestr);
421 SAVEPPTR(PL_lex_brackstack);
422 SAVEPPTR(PL_lex_casestack);
423 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
424 SAVESPTR(PL_lex_stuff);
425 SAVEI32(PL_lex_defer);
426 SAVEI32(PL_sublex_info.sub_inwhat);
427 SAVESPTR(PL_lex_repl);
429 SAVEINT(PL_lex_expect);
431 PL_lex_state = LEX_NORMAL;
435 New(899, PL_lex_brackstack, 120, char);
436 New(899, PL_lex_casestack, 12, char);
437 SAVEFREEPV(PL_lex_brackstack);
438 SAVEFREEPV(PL_lex_casestack);
440 *PL_lex_casestack = '\0';
443 PL_lex_stuff = Nullsv;
444 PL_lex_repl = Nullsv;
448 PL_sublex_info.sub_inwhat = 0;
450 if (SvREADONLY(PL_linestr))
451 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
452 s = SvPV(PL_linestr, len);
453 if (len && s[len-1] != ';') {
454 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
455 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
456 sv_catpvn(PL_linestr, "\n;", 2);
458 SvTEMP_off(PL_linestr);
459 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
460 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
461 PL_last_lop = PL_last_uni = Nullch;
467 * Finalizer for lexing operations. Must be called when the parser is
468 * done with the lexer.
474 PL_doextract = FALSE;
479 * This subroutine has nothing to do with tilting, whether at windmills
480 * or pinball tables. Its name is short for "increment line". It
481 * increments the current line number in CopLINE(PL_curcop) and checks
482 * to see whether the line starts with a comment of the form
483 * # line 500 "foo.pm"
484 * If so, it sets the current line number and file to the values in the comment.
488 S_incline(pTHX_ char *s)
495 CopLINE_inc(PL_curcop);
498 while (SPACE_OR_TAB(*s)) s++;
499 if (strnEQ(s, "line", 4))
503 if (SPACE_OR_TAB(*s))
507 while (SPACE_OR_TAB(*s)) s++;
513 while (SPACE_OR_TAB(*s))
515 if (*s == '"' && (t = strchr(s+1, '"'))) {
520 for (t = s; !isSPACE(*t); t++) ;
523 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
525 if (*e != '\n' && *e != '\0')
526 return; /* false alarm */
531 CopFILE_free(PL_curcop);
532 CopFILE_set(PL_curcop, s);
535 CopLINE_set(PL_curcop, atoi(n)-1);
540 * Called to gobble the appropriate amount and type of whitespace.
541 * Skips comments as well.
545 S_skipspace(pTHX_ register char *s)
547 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
548 while (s < PL_bufend && SPACE_OR_TAB(*s))
554 SSize_t oldprevlen, oldoldprevlen;
555 SSize_t oldloplen = 0, oldunilen = 0;
556 while (s < PL_bufend && isSPACE(*s)) {
557 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
562 if (s < PL_bufend && *s == '#') {
563 while (s < PL_bufend && *s != '\n')
567 if (PL_in_eval && !PL_rsfp) {
574 /* only continue to recharge the buffer if we're at the end
575 * of the buffer, we're not reading from a source filter, and
576 * we're in normal lexing mode
578 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
579 PL_lex_state == LEX_FORMLINE)
582 /* try to recharge the buffer */
583 if ((s = filter_gets(PL_linestr, PL_rsfp,
584 (prevlen = SvCUR(PL_linestr)))) == Nullch)
586 /* end of file. Add on the -p or -n magic */
587 if (PL_minus_n || PL_minus_p) {
588 sv_setpv(PL_linestr,PL_minus_p ?
589 ";}continue{print or die qq(-p destination: $!\\n)" :
591 sv_catpv(PL_linestr,";}");
592 PL_minus_n = PL_minus_p = 0;
595 sv_setpv(PL_linestr,";");
597 /* reset variables for next time we lex */
598 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
600 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
601 PL_last_lop = PL_last_uni = Nullch;
603 /* Close the filehandle. Could be from -P preprocessor,
604 * STDIN, or a regular file. If we were reading code from
605 * STDIN (because the commandline held no -e or filename)
606 * then we don't close it, we reset it so the code can
607 * read from STDIN too.
610 if (PL_preprocess && !PL_in_eval)
611 (void)PerlProc_pclose(PL_rsfp);
612 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
613 PerlIO_clearerr(PL_rsfp);
615 (void)PerlIO_close(PL_rsfp);
620 /* not at end of file, so we only read another line */
621 /* make corresponding updates to old pointers, for yyerror() */
622 oldprevlen = PL_oldbufptr - PL_bufend;
623 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
625 oldunilen = PL_last_uni - PL_bufend;
627 oldloplen = PL_last_lop - PL_bufend;
628 PL_linestart = PL_bufptr = s + prevlen;
629 PL_bufend = s + SvCUR(PL_linestr);
631 PL_oldbufptr = s + oldprevlen;
632 PL_oldoldbufptr = s + oldoldprevlen;
634 PL_last_uni = s + oldunilen;
636 PL_last_lop = s + oldloplen;
639 /* debugger active and we're not compiling the debugger code,
640 * so store the line into the debugger's array of lines
642 if (PERLDB_LINE && PL_curstash != PL_debstash) {
643 SV *sv = NEWSV(85,0);
645 sv_upgrade(sv, SVt_PVMG);
646 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
649 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
656 * Check the unary operators to ensure there's no ambiguity in how they're
657 * used. An ambiguous piece of code would be:
659 * This doesn't mean rand() + 5. Because rand() is a unary operator,
660 * the +5 is its argument.
669 if (PL_oldoldbufptr != PL_last_uni)
671 while (isSPACE(*PL_last_uni))
673 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
674 if ((t = strchr(s, '(')) && t < PL_bufptr)
676 if (ckWARN_d(WARN_AMBIGUOUS)){
679 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
680 "Warning: Use of \"%s\" without parens is ambiguous",
687 * LOP : macro to build a list operator. Its behaviour has been replaced
688 * with a subroutine, S_lop() for which LOP is just another name.
691 #define LOP(f,x) return lop(f,x,s)
695 * Build a list operator (or something that might be one). The rules:
696 * - if we have a next token, then it's a list operator [why?]
697 * - if the next thing is an opening paren, then it's a function
698 * - else it's a list operator
702 S_lop(pTHX_ I32 f, int x, char *s)
709 PL_last_lop = PL_oldbufptr;
710 PL_last_lop_op = (OPCODE)f;
724 * When the lexer realizes it knows the next token (for instance,
725 * it is reordering tokens for the parser) then it can call S_force_next
726 * to know what token to return the next time the lexer is called. Caller
727 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
728 * handles the token correctly.
732 S_force_next(pTHX_ I32 type)
734 PL_nexttype[PL_nexttoke] = type;
736 if (PL_lex_state != LEX_KNOWNEXT) {
737 PL_lex_defer = PL_lex_state;
738 PL_lex_expect = PL_expect;
739 PL_lex_state = LEX_KNOWNEXT;
745 * When the lexer knows the next thing is a word (for instance, it has
746 * just seen -> and it knows that the next char is a word char, then
747 * it calls S_force_word to stick the next word into the PL_next lookahead.
750 * char *start : buffer position (must be within PL_linestr)
751 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
752 * int check_keyword : if true, Perl checks to make sure the word isn't
753 * a keyword (do this if the word is a label, e.g. goto FOO)
754 * int allow_pack : if true, : characters will also be allowed (require,
756 * int allow_initial_tick : used by the "sub" lexer only.
760 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
765 start = skipspace(start);
767 if (isIDFIRST_lazy_if(s,UTF) ||
768 (allow_pack && *s == ':') ||
769 (allow_initial_tick && *s == '\'') )
771 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
772 if (check_keyword && keyword(PL_tokenbuf, len))
774 if (token == METHOD) {
779 PL_expect = XOPERATOR;
782 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
783 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
791 * Called when the lexer wants $foo *foo &foo etc, but the program
792 * text only contains the "foo" portion. The first argument is a pointer
793 * to the "foo", and the second argument is the type symbol to prefix.
794 * Forces the next token to be a "WORD".
795 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
799 S_force_ident(pTHX_ register char *s, int kind)
802 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
803 PL_nextval[PL_nexttoke].opval = o;
806 o->op_private = OPpCONST_ENTERED;
807 /* XXX see note in pp_entereval() for why we forgo typo
808 warnings if the symbol must be introduced in an eval.
810 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
811 kind == '$' ? SVt_PV :
812 kind == '@' ? SVt_PVAV :
813 kind == '%' ? SVt_PVHV :
821 Perl_str_to_version(pTHX_ SV *sv)
826 char *start = SvPVx(sv,len);
827 bool utf = SvUTF8(sv) ? TRUE : FALSE;
828 char *end = start + len;
829 while (start < end) {
833 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
838 retval += ((NV)n)/nshift;
847 * Forces the next token to be a version number.
848 * If the next token appears to be an invalid version number, (e.g. "v2b"),
849 * and if "guessing" is TRUE, then no new token is created (and the caller
850 * must use an alternative parsing method).
854 S_force_version(pTHX_ char *s, int guessing)
856 OP *version = Nullop;
865 while (isDIGIT(*d) || *d == '_' || *d == '.')
867 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
869 s = scan_num(s, &yylval);
870 version = yylval.opval;
871 ver = cSVOPx(version)->op_sv;
872 if (SvPOK(ver) && !SvNIOK(ver)) {
873 (void)SvUPGRADE(ver, SVt_PVNV);
874 SvNVX(ver) = str_to_version(ver);
875 SvNOK_on(ver); /* hint that it is a version */
882 /* NOTE: The parser sees the package name and the VERSION swapped */
883 PL_nextval[PL_nexttoke].opval = version;
891 * Tokenize a quoted string passed in as an SV. It finds the next
892 * chunk, up to end of string or a backslash. It may make a new
893 * SV containing that chunk (if HINT_NEW_STRING is on). It also
898 S_tokeq(pTHX_ SV *sv)
909 s = SvPV_force(sv, len);
910 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
913 while (s < send && *s != '\\')
918 if ( PL_hints & HINT_NEW_STRING ) {
919 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
925 if (s + 1 < send && (s[1] == '\\'))
926 s++; /* all that, just for this */
931 SvCUR_set(sv, d - SvPVX(sv));
933 if ( PL_hints & HINT_NEW_STRING )
934 return new_constant(NULL, 0, "q", sv, pv, "q");
939 * Now come three functions related to double-quote context,
940 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
941 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
942 * interact with PL_lex_state, and create fake ( ... ) argument lists
943 * to handle functions and concatenation.
944 * They assume that whoever calls them will be setting up a fake
945 * join call, because each subthing puts a ',' after it. This lets
948 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
950 * (I'm not sure whether the spurious commas at the end of lcfirst's
951 * arguments and join's arguments are created or not).
956 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
958 * Pattern matching will set PL_lex_op to the pattern-matching op to
959 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
961 * OP_CONST and OP_READLINE are easy--just make the new op and return.
963 * Everything else becomes a FUNC.
965 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
966 * had an OP_CONST or OP_READLINE). This just sets us up for a
967 * call to S_sublex_push().
973 register I32 op_type = yylval.ival;
975 if (op_type == OP_NULL) {
976 yylval.opval = PL_lex_op;
980 if (op_type == OP_CONST || op_type == OP_READLINE) {
981 SV *sv = tokeq(PL_lex_stuff);
983 if (SvTYPE(sv) == SVt_PVIV) {
984 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
990 nsv = newSVpvn(p, len);
996 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
997 PL_lex_stuff = Nullsv;
1001 PL_sublex_info.super_state = PL_lex_state;
1002 PL_sublex_info.sub_inwhat = op_type;
1003 PL_sublex_info.sub_op = PL_lex_op;
1004 PL_lex_state = LEX_INTERPPUSH;
1008 yylval.opval = PL_lex_op;
1018 * Create a new scope to save the lexing state. The scope will be
1019 * ended in S_sublex_done. Returns a '(', starting the function arguments
1020 * to the uc, lc, etc. found before.
1021 * Sets PL_lex_state to LEX_INTERPCONCAT.
1029 PL_lex_state = PL_sublex_info.super_state;
1030 SAVEI32(PL_lex_dojoin);
1031 SAVEI32(PL_lex_brackets);
1032 SAVEI32(PL_lex_casemods);
1033 SAVEI32(PL_lex_starts);
1034 SAVEI32(PL_lex_state);
1035 SAVEVPTR(PL_lex_inpat);
1036 SAVEI32(PL_lex_inwhat);
1037 SAVECOPLINE(PL_curcop);
1038 SAVEPPTR(PL_bufptr);
1039 SAVEPPTR(PL_bufend);
1040 SAVEPPTR(PL_oldbufptr);
1041 SAVEPPTR(PL_oldoldbufptr);
1042 SAVEPPTR(PL_last_lop);
1043 SAVEPPTR(PL_last_uni);
1044 SAVEPPTR(PL_linestart);
1045 SAVESPTR(PL_linestr);
1046 SAVEPPTR(PL_lex_brackstack);
1047 SAVEPPTR(PL_lex_casestack);
1049 PL_linestr = PL_lex_stuff;
1050 PL_lex_stuff = Nullsv;
1052 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1053 = SvPVX(PL_linestr);
1054 PL_bufend += SvCUR(PL_linestr);
1055 PL_last_lop = PL_last_uni = Nullch;
1056 SAVEFREESV(PL_linestr);
1058 PL_lex_dojoin = FALSE;
1059 PL_lex_brackets = 0;
1060 New(899, PL_lex_brackstack, 120, char);
1061 New(899, PL_lex_casestack, 12, char);
1062 SAVEFREEPV(PL_lex_brackstack);
1063 SAVEFREEPV(PL_lex_casestack);
1064 PL_lex_casemods = 0;
1065 *PL_lex_casestack = '\0';
1067 PL_lex_state = LEX_INTERPCONCAT;
1068 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1070 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1071 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1072 PL_lex_inpat = PL_sublex_info.sub_op;
1074 PL_lex_inpat = Nullop;
1081 * Restores lexer state after a S_sublex_push.
1087 if (!PL_lex_starts++) {
1088 SV *sv = newSVpvn("",0);
1089 if (SvUTF8(PL_linestr))
1091 PL_expect = XOPERATOR;
1092 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1096 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1097 PL_lex_state = LEX_INTERPCASEMOD;
1101 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1102 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1103 PL_linestr = PL_lex_repl;
1105 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1106 PL_bufend += SvCUR(PL_linestr);
1107 PL_last_lop = PL_last_uni = Nullch;
1108 SAVEFREESV(PL_linestr);
1109 PL_lex_dojoin = FALSE;
1110 PL_lex_brackets = 0;
1111 PL_lex_casemods = 0;
1112 *PL_lex_casestack = '\0';
1114 if (SvEVALED(PL_lex_repl)) {
1115 PL_lex_state = LEX_INTERPNORMAL;
1117 /* we don't clear PL_lex_repl here, so that we can check later
1118 whether this is an evalled subst; that means we rely on the
1119 logic to ensure sublex_done() is called again only via the
1120 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1123 PL_lex_state = LEX_INTERPCONCAT;
1124 PL_lex_repl = Nullsv;
1130 PL_bufend = SvPVX(PL_linestr);
1131 PL_bufend += SvCUR(PL_linestr);
1132 PL_expect = XOPERATOR;
1133 PL_sublex_info.sub_inwhat = 0;
1141 Extracts a pattern, double-quoted string, or transliteration. This
1144 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1145 processing a pattern (PL_lex_inpat is true), a transliteration
1146 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1148 Returns a pointer to the character scanned up to. Iff this is
1149 advanced from the start pointer supplied (ie if anything was
1150 successfully parsed), will leave an OP for the substring scanned
1151 in yylval. Caller must intuit reason for not parsing further
1152 by looking at the next characters herself.
1156 double-quoted style: \r and \n
1157 regexp special ones: \D \s
1159 backrefs: \1 (deprecated in substitution replacements)
1160 case and quoting: \U \Q \E
1161 stops on @ and $, but not for $ as tail anchor
1163 In transliterations:
1164 characters are VERY literal, except for - not at the start or end
1165 of the string, which indicates a range. scan_const expands the
1166 range to the full set of intermediate characters.
1168 In double-quoted strings:
1170 double-quoted style: \r and \n
1172 backrefs: \1 (deprecated)
1173 case and quoting: \U \Q \E
1176 scan_const does *not* construct ops to handle interpolated strings.
1177 It stops processing as soon as it finds an embedded $ or @ variable
1178 and leaves it to the caller to work out what's going on.
1180 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1182 $ in pattern could be $foo or could be tail anchor. Assumption:
1183 it's a tail anchor if $ is the last thing in the string, or if it's
1184 followed by one of ")| \n\t"
1186 \1 (backreferences) are turned into $1
1188 The structure of the code is
1189 while (there's a character to process) {
1190 handle transliteration ranges
1191 skip regexp comments
1192 skip # initiated comments in //x patterns
1193 check for embedded @foo
1194 check for embedded scalars
1196 leave intact backslashes from leave (below)
1197 deprecate \1 in strings and sub replacements
1198 handle string-changing backslashes \l \U \Q \E, etc.
1199 switch (what was escaped) {
1200 handle - in a transliteration (becomes a literal -)
1201 handle \132 octal characters
1202 handle 0x15 hex characters
1203 handle \cV (control V)
1204 handle printf backslashes (\f, \r, \n, etc)
1206 } (end if backslash)
1207 } (end while character to read)
1212 S_scan_const(pTHX_ char *start)
1214 register char *send = PL_bufend; /* end of the constant */
1215 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1216 register char *s = start; /* start of the constant */
1217 register char *d = SvPVX(sv); /* destination for copies */
1218 bool dorange = FALSE; /* are we in a translit range? */
1219 bool didrange = FALSE; /* did we just finish a range? */
1220 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1221 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1224 const char *leaveit = /* set of acceptably-backslashed characters */
1226 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1229 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1230 /* If we are doing a trans and we know we want UTF8 set expectation */
1231 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1232 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1236 while (s < send || dorange) {
1237 /* get transliterations out of the way (they're most literal) */
1238 if (PL_lex_inwhat == OP_TRANS) {
1239 /* expand a range A-Z to the full set of characters. AIE! */
1241 I32 i; /* current expanded character */
1242 I32 min; /* first character in range */
1243 I32 max; /* last character in range */
1246 char *c = (char*)utf8_hop((U8*)d, -1);
1250 *c = (char)UTF_TO_NATIVE(0xff);
1251 /* mark the range as done, and continue */
1257 i = d - SvPVX(sv); /* remember current offset */
1258 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1259 d = SvPVX(sv) + i; /* refresh d after realloc */
1260 d -= 2; /* eat the first char and the - */
1262 min = (U8)*d; /* first char in range */
1263 max = (U8)d[1]; /* last char in range */
1267 "Invalid [] range \"%c-%c\" in transliteration operator",
1268 (char)min, (char)max);
1272 if ((isLOWER(min) && isLOWER(max)) ||
1273 (isUPPER(min) && isUPPER(max))) {
1275 for (i = min; i <= max; i++)
1277 *d++ = NATIVE_TO_NEED(has_utf8,i);
1279 for (i = min; i <= max; i++)
1281 *d++ = NATIVE_TO_NEED(has_utf8,i);
1286 for (i = min; i <= max; i++)
1289 /* mark the range as done, and continue */
1295 /* range begins (ignore - as first or last char) */
1296 else if (*s == '-' && s+1 < send && s != start) {
1298 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1301 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1313 /* if we get here, we're not doing a transliteration */
1315 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1316 except for the last char, which will be done separately. */
1317 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1319 while (s < send && *s != ')')
1320 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1322 else if (s[2] == '{' /* This should match regcomp.c */
1323 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1326 char *regparse = s + (s[2] == '{' ? 3 : 4);
1329 while (count && (c = *regparse)) {
1330 if (c == '\\' && regparse[1])
1338 if (*regparse != ')') {
1339 regparse--; /* Leave one char for continuation. */
1340 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1342 while (s < regparse)
1343 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1347 /* likewise skip #-initiated comments in //x patterns */
1348 else if (*s == '#' && PL_lex_inpat &&
1349 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1350 while (s+1 < send && *s != '\n')
1351 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1354 /* check for embedded arrays
1355 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1357 else if (*s == '@' && s[1]
1358 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1361 /* check for embedded scalars. only stop if we're sure it's a
1364 else if (*s == '$') {
1365 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1367 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1368 break; /* in regexp, $ might be tail anchor */
1371 /* End of else if chain - OP_TRANS rejoin rest */
1374 if (*s == '\\' && s+1 < send) {
1377 /* some backslashes we leave behind */
1378 if (*leaveit && *s && strchr(leaveit, *s)) {
1379 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1380 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1384 /* deprecate \1 in strings and substitution replacements */
1385 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1386 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1388 if (ckWARN(WARN_SYNTAX))
1389 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1394 /* string-change backslash escapes */
1395 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1400 /* if we get here, it's either a quoted -, or a digit */
1403 /* quoted - in transliterations */
1405 if (PL_lex_inwhat == OP_TRANS) {
1412 if (ckWARN(WARN_MISC) &&
1415 Perl_warner(aTHX_ packWARN(WARN_MISC),
1416 "Unrecognized escape \\%c passed through",
1418 /* default action is to copy the quoted character */
1419 goto default_action;
1422 /* \132 indicates an octal constant */
1423 case '0': case '1': case '2': case '3':
1424 case '4': case '5': case '6': case '7':
1428 uv = grok_oct(s, &len, &flags, NULL);
1431 goto NUM_ESCAPE_INSERT;
1433 /* \x24 indicates a hex constant */
1437 char* e = strchr(s, '}');
1438 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1439 PERL_SCAN_DISALLOW_PREFIX;
1444 yyerror("Missing right brace on \\x{}");
1448 uv = grok_hex(s, &len, &flags, NULL);
1454 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1455 uv = grok_hex(s, &len, &flags, NULL);
1461 /* Insert oct or hex escaped character.
1462 * There will always enough room in sv since such
1463 * escapes will be longer than any UTF-8 sequence
1464 * they can end up as. */
1466 /* We need to map to chars to ASCII before doing the tests
1469 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1470 if (!has_utf8 && uv > 255) {
1471 /* Might need to recode whatever we have
1472 * accumulated so far if it contains any
1475 * (Can't we keep track of that and avoid
1476 * this rescan? --jhi)
1480 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1481 if (!NATIVE_IS_INVARIANT(*c)) {
1486 STRLEN offset = d - SvPVX(sv);
1488 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1492 while (src >= (U8 *)SvPVX(sv)) {
1493 if (!NATIVE_IS_INVARIANT(*src)) {
1494 U8 ch = NATIVE_TO_ASCII(*src);
1495 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1496 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1506 if (has_utf8 || uv > 255) {
1507 d = (char*)uvchr_to_utf8((U8*)d, uv);
1509 if (PL_lex_inwhat == OP_TRANS &&
1510 PL_sublex_info.sub_op) {
1511 PL_sublex_info.sub_op->op_private |=
1512 (PL_lex_repl ? OPpTRANS_FROM_UTF
1525 /* \N{LATIN SMALL LETTER A} is a named character */
1529 char* e = strchr(s, '}');
1535 yyerror("Missing right brace on \\N{}");
1539 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1541 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1542 PERL_SCAN_DISALLOW_PREFIX;
1545 uv = grok_hex(s, &len, &flags, NULL);
1547 goto NUM_ESCAPE_INSERT;
1549 res = newSVpvn(s + 1, e - s - 1);
1550 res = new_constant( Nullch, 0, "charnames",
1551 res, Nullsv, "\\N{...}" );
1553 sv_utf8_upgrade(res);
1554 str = SvPV(res,len);
1555 #ifdef EBCDIC_NEVER_MIND
1556 /* charnames uses pack U and that has been
1557 * recently changed to do the below uni->native
1558 * mapping, so this would be redundant (and wrong,
1559 * the code point would be doubly converted).
1560 * But leave this in just in case the pack U change
1561 * gets revoked, but the semantics is still
1562 * desireable for charnames. --jhi */
1564 UV uv = utf8_to_uvchr((U8*)str, 0);
1567 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1569 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1570 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1571 str = SvPV(res, len);
1575 if (!has_utf8 && SvUTF8(res)) {
1576 char *ostart = SvPVX(sv);
1577 SvCUR_set(sv, d - ostart);
1580 sv_utf8_upgrade(sv);
1581 /* this just broke our allocation above... */
1582 SvGROW(sv, (STRLEN)(send - start));
1583 d = SvPVX(sv) + SvCUR(sv);
1586 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1587 char *odest = SvPVX(sv);
1589 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1590 d = SvPVX(sv) + (d - odest);
1592 Copy(str, d, len, char);
1599 yyerror("Missing braces on \\N{}");
1602 /* \c is a control character */
1611 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1615 /* printf-style backslashes, formfeeds, newlines, etc */
1617 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1620 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1623 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1626 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1629 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1632 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1635 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1641 } /* end if (backslash) */
1644 /* If we started with encoded form, or already know we want it
1645 and then encode the next character */
1646 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1648 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1649 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1652 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1653 STRLEN off = d - SvPVX(sv);
1654 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1656 d = (char*)uvchr_to_utf8((U8*)d, uv);
1660 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1662 } /* while loop to process each character */
1664 /* terminate the string and set up the sv */
1666 SvCUR_set(sv, d - SvPVX(sv));
1667 if (SvCUR(sv) >= SvLEN(sv))
1668 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1671 if (PL_encoding && !has_utf8) {
1672 sv_recode_to_utf8(sv, PL_encoding);
1677 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1678 PL_sublex_info.sub_op->op_private |=
1679 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1683 /* shrink the sv if we allocated more than we used */
1684 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1685 SvLEN_set(sv, SvCUR(sv) + 1);
1686 Renew(SvPVX(sv), SvLEN(sv), char);
1689 /* return the substring (via yylval) only if we parsed anything */
1690 if (s > PL_bufptr) {
1691 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1692 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1694 ( PL_lex_inwhat == OP_TRANS
1696 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1699 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1706 * Returns TRUE if there's more to the expression (e.g., a subscript),
1709 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1711 * ->[ and ->{ return TRUE
1712 * { and [ outside a pattern are always subscripts, so return TRUE
1713 * if we're outside a pattern and it's not { or [, then return FALSE
1714 * if we're in a pattern and the first char is a {
1715 * {4,5} (any digits around the comma) returns FALSE
1716 * if we're in a pattern and the first char is a [
1718 * [SOMETHING] has a funky algorithm to decide whether it's a
1719 * character class or not. It has to deal with things like
1720 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1721 * anything else returns TRUE
1724 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1727 S_intuit_more(pTHX_ register char *s)
1729 if (PL_lex_brackets)
1731 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1733 if (*s != '{' && *s != '[')
1738 /* In a pattern, so maybe we have {n,m}. */
1755 /* On the other hand, maybe we have a character class */
1758 if (*s == ']' || *s == '^')
1761 /* this is terrifying, and it works */
1762 int weight = 2; /* let's weigh the evidence */
1764 unsigned char un_char = 255, last_un_char;
1765 char *send = strchr(s,']');
1766 char tmpbuf[sizeof PL_tokenbuf * 4];
1768 if (!send) /* has to be an expression */
1771 Zero(seen,256,char);
1774 else if (isDIGIT(*s)) {
1776 if (isDIGIT(s[1]) && s[2] == ']')
1782 for (; s < send; s++) {
1783 last_un_char = un_char;
1784 un_char = (unsigned char)*s;
1789 weight -= seen[un_char] * 10;
1790 if (isALNUM_lazy_if(s+1,UTF)) {
1791 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1792 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1797 else if (*s == '$' && s[1] &&
1798 strchr("[#!%*<>()-=",s[1])) {
1799 if (/*{*/ strchr("])} =",s[2]))
1808 if (strchr("wds]",s[1]))
1810 else if (seen['\''] || seen['"'])
1812 else if (strchr("rnftbxcav",s[1]))
1814 else if (isDIGIT(s[1])) {
1816 while (s[1] && isDIGIT(s[1]))
1826 if (strchr("aA01! ",last_un_char))
1828 if (strchr("zZ79~",s[1]))
1830 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1831 weight -= 5; /* cope with negative subscript */
1834 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1835 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1840 if (keyword(tmpbuf, d - tmpbuf))
1843 if (un_char == last_un_char + 1)
1845 weight -= seen[un_char];
1850 if (weight >= 0) /* probably a character class */
1860 * Does all the checking to disambiguate
1862 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1863 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1865 * First argument is the stuff after the first token, e.g. "bar".
1867 * Not a method if bar is a filehandle.
1868 * Not a method if foo is a subroutine prototyped to take a filehandle.
1869 * Not a method if it's really "Foo $bar"
1870 * Method if it's "foo $bar"
1871 * Not a method if it's really "print foo $bar"
1872 * Method if it's really "foo package::" (interpreted as package->foo)
1873 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1874 * Not a method if bar is a filehandle or package, but is quoted with
1879 S_intuit_method(pTHX_ char *start, GV *gv)
1881 char *s = start + (*start == '$');
1882 char tmpbuf[sizeof PL_tokenbuf];
1890 if ((cv = GvCVu(gv))) {
1891 char *proto = SvPVX(cv);
1901 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1902 /* start is the beginning of the possible filehandle/object,
1903 * and s is the end of it
1904 * tmpbuf is a copy of it
1907 if (*start == '$') {
1908 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1913 return *s == '(' ? FUNCMETH : METHOD;
1915 if (!keyword(tmpbuf, len)) {
1916 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1921 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1922 if (indirgv && GvCVu(indirgv))
1924 /* filehandle or package name makes it a method */
1925 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1927 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1928 return 0; /* no assumptions -- "=>" quotes bearword */
1930 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1931 newSVpvn(tmpbuf,len));
1932 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1936 return *s == '(' ? FUNCMETH : METHOD;
1944 * Return a string of Perl code to load the debugger. If PERL5DB
1945 * is set, it will return the contents of that, otherwise a
1946 * compile-time require of perl5db.pl.
1953 char *pdb = PerlEnv_getenv("PERL5DB");
1957 SETERRNO(0,SS$_NORMAL);
1958 return "BEGIN { require 'perl5db.pl' }";
1964 /* Encoded script support. filter_add() effectively inserts a
1965 * 'pre-processing' function into the current source input stream.
1966 * Note that the filter function only applies to the current source file
1967 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1969 * The datasv parameter (which may be NULL) can be used to pass
1970 * private data to this instance of the filter. The filter function
1971 * can recover the SV using the FILTER_DATA macro and use it to
1972 * store private buffers and state information.
1974 * The supplied datasv parameter is upgraded to a PVIO type
1975 * and the IoDIRP/IoANY field is used to store the function pointer,
1976 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1977 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1978 * private use must be set using malloc'd pointers.
1982 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1987 if (!PL_rsfp_filters)
1988 PL_rsfp_filters = newAV();
1990 datasv = NEWSV(255,0);
1991 if (!SvUPGRADE(datasv, SVt_PVIO))
1992 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1993 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1994 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1995 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1996 (void*)funcp, SvPV_nolen(datasv)));
1997 av_unshift(PL_rsfp_filters, 1);
1998 av_store(PL_rsfp_filters, 0, datasv) ;
2003 /* Delete most recently added instance of this filter function. */
2005 Perl_filter_del(pTHX_ filter_t funcp)
2008 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2009 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2011 /* if filter is on top of stack (usual case) just pop it off */
2012 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2013 if (IoANY(datasv) == (void *)funcp) {
2014 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2015 IoANY(datasv) = (void *)NULL;
2016 sv_free(av_pop(PL_rsfp_filters));
2020 /* we need to search for the correct entry and clear it */
2021 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2025 /* Invoke the n'th filter function for the current rsfp. */
2027 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2030 /* 0 = read one text line */
2035 if (!PL_rsfp_filters)
2037 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2038 /* Provide a default input filter to make life easy. */
2039 /* Note that we append to the line. This is handy. */
2040 DEBUG_P(PerlIO_printf(Perl_debug_log,
2041 "filter_read %d: from rsfp\n", idx));
2045 int old_len = SvCUR(buf_sv) ;
2047 /* ensure buf_sv is large enough */
2048 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2049 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2050 if (PerlIO_error(PL_rsfp))
2051 return -1; /* error */
2053 return 0 ; /* end of file */
2055 SvCUR_set(buf_sv, old_len + len) ;
2058 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2059 if (PerlIO_error(PL_rsfp))
2060 return -1; /* error */
2062 return 0 ; /* end of file */
2065 return SvCUR(buf_sv);
2067 /* Skip this filter slot if filter has been deleted */
2068 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2069 DEBUG_P(PerlIO_printf(Perl_debug_log,
2070 "filter_read %d: skipped (filter deleted)\n",
2072 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2074 /* Get function pointer hidden within datasv */
2075 funcp = (filter_t)IoANY(datasv);
2076 DEBUG_P(PerlIO_printf(Perl_debug_log,
2077 "filter_read %d: via function %p (%s)\n",
2078 idx, (void*)funcp, SvPV_nolen(datasv)));
2079 /* Call function. The function is expected to */
2080 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2081 /* Return: <0:error, =0:eof, >0:not eof */
2082 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2086 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2088 #ifdef PERL_CR_FILTER
2089 if (!PL_rsfp_filters) {
2090 filter_add(S_cr_textfilter,NULL);
2093 if (PL_rsfp_filters) {
2096 SvCUR_set(sv, 0); /* start with empty line */
2097 if (FILTER_READ(0, sv, 0) > 0)
2098 return ( SvPVX(sv) ) ;
2103 return (sv_gets(sv, fp, append));
2107 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2111 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2115 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2116 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2118 return GvHV(gv); /* Foo:: */
2121 /* use constant CLASS => 'MyClass' */
2122 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2124 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2125 pkgname = SvPV_nolen(sv);
2129 return gv_stashpv(pkgname, FALSE);
2133 static char* exp_name[] =
2134 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2135 "ATTRTERM", "TERMBLOCK"
2142 Works out what to call the token just pulled out of the input
2143 stream. The yacc parser takes care of taking the ops we return and
2144 stitching them into a tree.
2150 if read an identifier
2151 if we're in a my declaration
2152 croak if they tried to say my($foo::bar)
2153 build the ops for a my() declaration
2154 if it's an access to a my() variable
2155 are we in a sort block?
2156 croak if my($a); $a <=> $b
2157 build ops for access to a my() variable
2158 if in a dq string, and they've said @foo and we can't find @foo
2160 build ops for a bareword
2161 if we already built the token before, use it.
2164 #ifdef USE_PURE_BISON
2166 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2171 yylval_pointer[yyactlevel] = lvalp;
2172 yychar_pointer[yyactlevel] = lcharp;
2173 if (yyactlevel >= YYMAXLEVEL)
2174 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2176 r = Perl_yylex(aTHX);
2186 #pragma segment Perl_yylex
2199 /* check if there's an identifier for us to look at */
2200 if (PL_pending_ident)
2201 return S_pending_ident(aTHX);
2203 /* no identifier pending identification */
2205 switch (PL_lex_state) {
2207 case LEX_NORMAL: /* Some compilers will produce faster */
2208 case LEX_INTERPNORMAL: /* code if we comment these out. */
2212 /* when we've already built the next token, just pull it out of the queue */
2215 yylval = PL_nextval[PL_nexttoke];
2217 PL_lex_state = PL_lex_defer;
2218 PL_expect = PL_lex_expect;
2219 PL_lex_defer = LEX_NORMAL;
2221 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2222 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2223 (IV)PL_nexttype[PL_nexttoke]); });
2225 return(PL_nexttype[PL_nexttoke]);
2227 /* interpolated case modifiers like \L \U, including \Q and \E.
2228 when we get here, PL_bufptr is at the \
2230 case LEX_INTERPCASEMOD:
2232 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2233 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2235 /* handle \E or end of string */
2236 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2240 if (PL_lex_casemods) {
2241 oldmod = PL_lex_casestack[--PL_lex_casemods];
2242 PL_lex_casestack[PL_lex_casemods] = '\0';
2244 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2246 PL_lex_state = LEX_INTERPCONCAT;
2250 if (PL_bufptr != PL_bufend)
2252 PL_lex_state = LEX_INTERPCONCAT;
2256 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2257 "### Saw case modifier at '%s'\n", PL_bufptr); });
2259 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2260 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2261 if (strchr("LU", *s) &&
2262 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2264 PL_lex_casestack[--PL_lex_casemods] = '\0';
2267 if (PL_lex_casemods > 10) {
2268 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2269 if (newlb != PL_lex_casestack) {
2271 PL_lex_casestack = newlb;
2274 PL_lex_casestack[PL_lex_casemods++] = *s;
2275 PL_lex_casestack[PL_lex_casemods] = '\0';
2276 PL_lex_state = LEX_INTERPCONCAT;
2277 PL_nextval[PL_nexttoke].ival = 0;
2280 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2282 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2284 PL_nextval[PL_nexttoke].ival = OP_LC;
2286 PL_nextval[PL_nexttoke].ival = OP_UC;
2288 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2290 Perl_croak(aTHX_ "panic: yylex");
2293 if (PL_lex_starts) {
2302 case LEX_INTERPPUSH:
2303 return sublex_push();
2305 case LEX_INTERPSTART:
2306 if (PL_bufptr == PL_bufend)
2307 return sublex_done();
2308 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2309 "### Interpolated variable at '%s'\n", PL_bufptr); });
2311 PL_lex_dojoin = (*PL_bufptr == '@');
2312 PL_lex_state = LEX_INTERPNORMAL;
2313 if (PL_lex_dojoin) {
2314 PL_nextval[PL_nexttoke].ival = 0;
2316 #ifdef USE_5005THREADS
2317 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2318 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2319 force_next(PRIVATEREF);
2321 force_ident("\"", '$');
2322 #endif /* USE_5005THREADS */
2323 PL_nextval[PL_nexttoke].ival = 0;
2325 PL_nextval[PL_nexttoke].ival = 0;
2327 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2330 if (PL_lex_starts++) {
2336 case LEX_INTERPENDMAYBE:
2337 if (intuit_more(PL_bufptr)) {
2338 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2344 if (PL_lex_dojoin) {
2345 PL_lex_dojoin = FALSE;
2346 PL_lex_state = LEX_INTERPCONCAT;
2349 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2350 && SvEVALED(PL_lex_repl))
2352 if (PL_bufptr != PL_bufend)
2353 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2354 PL_lex_repl = Nullsv;
2357 case LEX_INTERPCONCAT:
2359 if (PL_lex_brackets)
2360 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2362 if (PL_bufptr == PL_bufend)
2363 return sublex_done();
2365 if (SvIVX(PL_linestr) == '\'') {
2366 SV *sv = newSVsv(PL_linestr);
2369 else if ( PL_hints & HINT_NEW_RE )
2370 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2371 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2375 s = scan_const(PL_bufptr);
2377 PL_lex_state = LEX_INTERPCASEMOD;
2379 PL_lex_state = LEX_INTERPSTART;
2382 if (s != PL_bufptr) {
2383 PL_nextval[PL_nexttoke] = yylval;
2386 if (PL_lex_starts++)
2396 PL_lex_state = LEX_NORMAL;
2397 s = scan_formline(PL_bufptr);
2398 if (!PL_lex_formbrack)
2404 PL_oldoldbufptr = PL_oldbufptr;
2407 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2408 exp_name[PL_expect], s);
2414 if (isIDFIRST_lazy_if(s,UTF))
2416 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2419 goto fake_eof; /* emulate EOF on ^D or ^Z */
2424 if (PL_lex_brackets)
2425 yyerror("Missing right curly or square bracket");
2426 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2427 "### Tokener got EOF\n");
2431 if (s++ < PL_bufend)
2432 goto retry; /* ignore stray nulls */
2435 if (!PL_in_eval && !PL_preambled) {
2436 PL_preambled = TRUE;
2437 sv_setpv(PL_linestr,incl_perldb());
2438 if (SvCUR(PL_linestr))
2439 sv_catpv(PL_linestr,";");
2441 while(AvFILLp(PL_preambleav) >= 0) {
2442 SV *tmpsv = av_shift(PL_preambleav);
2443 sv_catsv(PL_linestr, tmpsv);
2444 sv_catpv(PL_linestr, ";");
2447 sv_free((SV*)PL_preambleav);
2448 PL_preambleav = NULL;
2450 if (PL_minus_n || PL_minus_p) {
2451 sv_catpv(PL_linestr, "LINE: while (<>) {");
2453 sv_catpv(PL_linestr,"chomp;");
2456 if (strchr("/'\"", *PL_splitstr)
2457 && strchr(PL_splitstr + 1, *PL_splitstr))
2458 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2461 s = "'~#\200\1'"; /* surely one char is unused...*/
2462 while (s[1] && strchr(PL_splitstr, *s)) s++;
2464 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2465 "q" + (delim == '\''), delim);
2466 for (s = PL_splitstr; *s; s++) {
2468 sv_catpvn(PL_linestr, "\\", 1);
2469 sv_catpvn(PL_linestr, s, 1);
2471 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2475 sv_catpv(PL_linestr,"our @F=split(' ');");
2478 sv_catpv(PL_linestr, "\n");
2479 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2480 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2481 PL_last_lop = PL_last_uni = Nullch;
2482 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2483 SV *sv = NEWSV(85,0);
2485 sv_upgrade(sv, SVt_PVMG);
2486 sv_setsv(sv,PL_linestr);
2489 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2494 bof = PL_rsfp ? TRUE : FALSE;
2495 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2498 if (PL_preprocess && !PL_in_eval)
2499 (void)PerlProc_pclose(PL_rsfp);
2500 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2501 PerlIO_clearerr(PL_rsfp);
2503 (void)PerlIO_close(PL_rsfp);
2505 PL_doextract = FALSE;
2507 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2508 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2509 sv_catpv(PL_linestr,";}");
2510 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2511 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2512 PL_last_lop = PL_last_uni = Nullch;
2513 PL_minus_n = PL_minus_p = 0;
2516 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2517 PL_last_lop = PL_last_uni = Nullch;
2518 sv_setpv(PL_linestr,"");
2519 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2521 /* if it looks like the start of a BOM, check if it in fact is */
2522 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2523 #ifdef PERLIO_IS_STDIO
2524 # ifdef __GNU_LIBRARY__
2525 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2526 # define FTELL_FOR_PIPE_IS_BROKEN
2530 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2531 # define FTELL_FOR_PIPE_IS_BROKEN
2536 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2537 /* This loses the possibility to detect the bof
2538 * situation on perl -P when the libc5 is being used.
2539 * Workaround? Maybe attach some extra state to PL_rsfp?
2542 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2544 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2547 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2548 s = swallow_bom((U8*)s);
2552 /* Incest with pod. */
2553 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2554 sv_setpv(PL_linestr, "");
2555 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2556 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2557 PL_last_lop = PL_last_uni = Nullch;
2558 PL_doextract = FALSE;
2562 } while (PL_doextract);
2563 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2564 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2565 SV *sv = NEWSV(85,0);
2567 sv_upgrade(sv, SVt_PVMG);
2568 sv_setsv(sv,PL_linestr);
2571 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2573 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2574 PL_last_lop = PL_last_uni = Nullch;
2575 if (CopLINE(PL_curcop) == 1) {
2576 while (s < PL_bufend && isSPACE(*s))
2578 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2582 if (*s == '#' && *(s+1) == '!')
2584 #ifdef ALTERNATE_SHEBANG
2586 static char as[] = ALTERNATE_SHEBANG;
2587 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2588 d = s + (sizeof(as) - 1);
2590 #endif /* ALTERNATE_SHEBANG */
2599 while (*d && !isSPACE(*d))
2603 #ifdef ARG_ZERO_IS_SCRIPT
2604 if (ipathend > ipath) {
2606 * HP-UX (at least) sets argv[0] to the script name,
2607 * which makes $^X incorrect. And Digital UNIX and Linux,
2608 * at least, set argv[0] to the basename of the Perl
2609 * interpreter. So, having found "#!", we'll set it right.
2611 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2612 assert(SvPOK(x) || SvGMAGICAL(x));
2613 if (sv_eq(x, CopFILESV(PL_curcop))) {
2614 sv_setpvn(x, ipath, ipathend - ipath);
2617 TAINT_NOT; /* $^X is always tainted, but that's OK */
2619 #endif /* ARG_ZERO_IS_SCRIPT */
2624 d = instr(s,"perl -");
2626 d = instr(s,"perl");
2628 /* avoid getting into infinite loops when shebang
2629 * line contains "Perl" rather than "perl" */
2631 for (d = ipathend-4; d >= ipath; --d) {
2632 if ((*d == 'p' || *d == 'P')
2633 && !ibcmp(d, "perl", 4))
2643 #ifdef ALTERNATE_SHEBANG
2645 * If the ALTERNATE_SHEBANG on this system starts with a
2646 * character that can be part of a Perl expression, then if
2647 * we see it but not "perl", we're probably looking at the
2648 * start of Perl code, not a request to hand off to some
2649 * other interpreter. Similarly, if "perl" is there, but
2650 * not in the first 'word' of the line, we assume the line
2651 * contains the start of the Perl program.
2653 if (d && *s != '#') {
2655 while (*c && !strchr("; \t\r\n\f\v#", *c))
2658 d = Nullch; /* "perl" not in first word; ignore */
2660 *s = '#'; /* Don't try to parse shebang line */
2662 #endif /* ALTERNATE_SHEBANG */
2663 #ifndef MACOS_TRADITIONAL
2668 !instr(s,"indir") &&
2669 instr(PL_origargv[0],"perl"))
2675 while (s < PL_bufend && isSPACE(*s))
2677 if (s < PL_bufend) {
2678 Newz(899,newargv,PL_origargc+3,char*);
2680 while (s < PL_bufend && !isSPACE(*s))
2683 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2686 newargv = PL_origargv;
2688 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2689 Perl_croak(aTHX_ "Can't exec %s", ipath);
2693 U32 oldpdb = PL_perldb;
2694 bool oldn = PL_minus_n;
2695 bool oldp = PL_minus_p;
2697 while (*d && !isSPACE(*d)) d++;
2698 while (SPACE_OR_TAB(*d)) d++;
2701 bool switches_done = PL_doswitches;
2703 if (*d == 'M' || *d == 'm') {
2705 while (*d && !isSPACE(*d)) d++;
2706 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2709 d = moreswitches(d);
2711 if ((PERLDB_LINE && !oldpdb) ||
2712 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2713 /* if we have already added "LINE: while (<>) {",
2714 we must not do it again */
2716 sv_setpv(PL_linestr, "");
2717 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2718 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2719 PL_last_lop = PL_last_uni = Nullch;
2720 PL_preambled = FALSE;
2722 (void)gv_fetchfile(PL_origfilename);
2725 if (PL_doswitches && !switches_done) {
2726 int argc = PL_origargc;
2727 char **argv = PL_origargv;
2730 } while (argc && argv[0][0] == '-' && argv[0][1]);
2731 init_argv_symbols(argc,argv);
2737 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2739 PL_lex_state = LEX_FORMLINE;
2744 #ifdef PERL_STRICT_CR
2745 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2747 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2749 case ' ': case '\t': case '\f': case 013:
2750 #ifdef MACOS_TRADITIONAL
2757 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2758 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2759 /* handle eval qq[#line 1 "foo"\n ...] */
2760 CopLINE_dec(PL_curcop);
2764 while (s < d && *s != '\n')
2768 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2769 Perl_croak(aTHX_ "panic: input overflow");
2771 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2773 PL_lex_state = LEX_FORMLINE;
2783 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2790 while (s < PL_bufend && SPACE_OR_TAB(*s))
2793 if (strnEQ(s,"=>",2)) {
2794 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2795 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2796 "### Saw unary minus before =>, forcing word '%s'\n", s);
2798 OPERATOR('-'); /* unary minus */
2800 PL_last_uni = PL_oldbufptr;
2802 case 'r': ftst = OP_FTEREAD; break;
2803 case 'w': ftst = OP_FTEWRITE; break;
2804 case 'x': ftst = OP_FTEEXEC; break;
2805 case 'o': ftst = OP_FTEOWNED; break;
2806 case 'R': ftst = OP_FTRREAD; break;
2807 case 'W': ftst = OP_FTRWRITE; break;
2808 case 'X': ftst = OP_FTREXEC; break;
2809 case 'O': ftst = OP_FTROWNED; break;
2810 case 'e': ftst = OP_FTIS; break;
2811 case 'z': ftst = OP_FTZERO; break;
2812 case 's': ftst = OP_FTSIZE; break;
2813 case 'f': ftst = OP_FTFILE; break;
2814 case 'd': ftst = OP_FTDIR; break;
2815 case 'l': ftst = OP_FTLINK; break;
2816 case 'p': ftst = OP_FTPIPE; break;
2817 case 'S': ftst = OP_FTSOCK; break;
2818 case 'u': ftst = OP_FTSUID; break;
2819 case 'g': ftst = OP_FTSGID; break;
2820 case 'k': ftst = OP_FTSVTX; break;
2821 case 'b': ftst = OP_FTBLK; break;
2822 case 'c': ftst = OP_FTCHR; break;
2823 case 't': ftst = OP_FTTTY; break;
2824 case 'T': ftst = OP_FTTEXT; break;
2825 case 'B': ftst = OP_FTBINARY; break;
2826 case 'M': case 'A': case 'C':
2827 gv_fetchpv("\024",TRUE, SVt_PV);
2829 case 'M': ftst = OP_FTMTIME; break;
2830 case 'A': ftst = OP_FTATIME; break;
2831 case 'C': ftst = OP_FTCTIME; break;
2839 PL_last_lop_op = (OPCODE)ftst;
2840 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2841 "### Saw file test %c\n", (int)ftst);
2846 /* Assume it was a minus followed by a one-letter named
2847 * subroutine call (or a -bareword), then. */
2848 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2849 "### %c looked like a file test but was not\n",
2858 if (PL_expect == XOPERATOR)
2863 else if (*s == '>') {
2866 if (isIDFIRST_lazy_if(s,UTF)) {
2867 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2875 if (PL_expect == XOPERATOR)
2878 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2880 OPERATOR('-'); /* unary minus */
2887 if (PL_expect == XOPERATOR)
2892 if (PL_expect == XOPERATOR)
2895 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2901 if (PL_expect != XOPERATOR) {
2902 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2903 PL_expect = XOPERATOR;
2904 force_ident(PL_tokenbuf, '*');
2917 if (PL_expect == XOPERATOR) {
2921 PL_tokenbuf[0] = '%';
2922 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2923 if (!PL_tokenbuf[1]) {
2925 yyerror("Final % should be \\% or %name");
2928 PL_pending_ident = '%';
2947 switch (PL_expect) {
2950 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2952 PL_bufptr = s; /* update in case we back off */
2958 PL_expect = XTERMBLOCK;
2962 while (isIDFIRST_lazy_if(s,UTF)) {
2963 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2964 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2965 if (tmp < 0) tmp = -tmp;
2980 d = scan_str(d,TRUE,TRUE);
2982 /* MUST advance bufptr here to avoid bogus
2983 "at end of line" context messages from yyerror().
2985 PL_bufptr = s + len;
2986 yyerror("Unterminated attribute parameter in attribute list");
2989 return 0; /* EOF indicator */
2993 SV *sv = newSVpvn(s, len);
2994 sv_catsv(sv, PL_lex_stuff);
2995 attrs = append_elem(OP_LIST, attrs,
2996 newSVOP(OP_CONST, 0, sv));
2997 SvREFCNT_dec(PL_lex_stuff);
2998 PL_lex_stuff = Nullsv;
3001 /* NOTE: any CV attrs applied here need to be part of
3002 the CVf_BUILTIN_ATTRS define in cv.h! */
3003 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3004 CvLVALUE_on(PL_compcv);
3005 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3006 CvLOCKED_on(PL_compcv);
3007 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3008 CvMETHOD_on(PL_compcv);
3010 else if (PL_in_my == KEY_our && len == 6 &&
3011 strnEQ(s, "unique", len))
3012 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3014 /* After we've set the flags, it could be argued that
3015 we don't need to do the attributes.pm-based setting
3016 process, and shouldn't bother appending recognized
3017 flags. To experiment with that, uncomment the
3018 following "else". (Note that's already been
3019 uncommented. That keeps the above-applied built-in
3020 attributes from being intercepted (and possibly
3021 rejected) by a package's attribute routines, but is
3022 justified by the performance win for the common case
3023 of applying only built-in attributes.) */
3025 attrs = append_elem(OP_LIST, attrs,
3026 newSVOP(OP_CONST, 0,
3030 if (*s == ':' && s[1] != ':')
3033 break; /* require real whitespace or :'s */
3035 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3036 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3037 char q = ((*s == '\'') ? '"' : '\'');
3038 /* If here for an expression, and parsed no attrs, back off. */
3039 if (tmp == '=' && !attrs) {
3043 /* MUST advance bufptr here to avoid bogus "at end of line"
3044 context messages from yyerror().
3048 yyerror("Unterminated attribute list");
3050 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3058 PL_nextval[PL_nexttoke].opval = attrs;
3066 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3067 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3083 if (PL_lex_brackets <= 0)
3084 yyerror("Unmatched right square bracket");
3087 if (PL_lex_state == LEX_INTERPNORMAL) {
3088 if (PL_lex_brackets == 0) {
3089 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3090 PL_lex_state = LEX_INTERPEND;
3097 if (PL_lex_brackets > 100) {
3098 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3099 if (newlb != PL_lex_brackstack) {
3101 PL_lex_brackstack = newlb;
3104 switch (PL_expect) {
3106 if (PL_lex_formbrack) {
3110 if (PL_oldoldbufptr == PL_last_lop)
3111 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3113 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3114 OPERATOR(HASHBRACK);
3116 while (s < PL_bufend && SPACE_OR_TAB(*s))
3119 PL_tokenbuf[0] = '\0';
3120 if (d < PL_bufend && *d == '-') {
3121 PL_tokenbuf[0] = '-';
3123 while (d < PL_bufend && SPACE_OR_TAB(*d))
3126 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3127 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3129 while (d < PL_bufend && SPACE_OR_TAB(*d))
3132 char minus = (PL_tokenbuf[0] == '-');
3133 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3141 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3146 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3151 if (PL_oldoldbufptr == PL_last_lop)
3152 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3154 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3157 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3159 /* This hack is to get the ${} in the message. */
3161 yyerror("syntax error");
3164 OPERATOR(HASHBRACK);
3166 /* This hack serves to disambiguate a pair of curlies
3167 * as being a block or an anon hash. Normally, expectation
3168 * determines that, but in cases where we're not in a
3169 * position to expect anything in particular (like inside
3170 * eval"") we have to resolve the ambiguity. This code
3171 * covers the case where the first term in the curlies is a
3172 * quoted string. Most other cases need to be explicitly
3173 * disambiguated by prepending a `+' before the opening
3174 * curly in order to force resolution as an anon hash.
3176 * XXX should probably propagate the outer expectation
3177 * into eval"" to rely less on this hack, but that could
3178 * potentially break current behavior of eval"".
3182 if (*s == '\'' || *s == '"' || *s == '`') {
3183 /* common case: get past first string, handling escapes */
3184 for (t++; t < PL_bufend && *t != *s;)
3185 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3189 else if (*s == 'q') {
3192 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3196 char open, close, term;
3199 while (t < PL_bufend && isSPACE(*t))
3203 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3207 for (t++; t < PL_bufend; t++) {
3208 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3210 else if (*t == open)
3214 for (t++; t < PL_bufend; t++) {
3215 if (*t == '\\' && t+1 < PL_bufend)
3217 else if (*t == close && --brackets <= 0)
3219 else if (*t == open)
3225 else if (isALNUM_lazy_if(t,UTF)) {
3227 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3230 while (t < PL_bufend && isSPACE(*t))
3232 /* if comma follows first term, call it an anon hash */
3233 /* XXX it could be a comma expression with loop modifiers */
3234 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3235 || (*t == '=' && t[1] == '>')))
3236 OPERATOR(HASHBRACK);
3237 if (PL_expect == XREF)
3240 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3246 yylval.ival = CopLINE(PL_curcop);
3247 if (isSPACE(*s) || *s == '#')
3248 PL_copline = NOLINE; /* invalidate current command line number */
3253 if (PL_lex_brackets <= 0)
3254 yyerror("Unmatched right curly bracket");
3256 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3257 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3258 PL_lex_formbrack = 0;
3259 if (PL_lex_state == LEX_INTERPNORMAL) {
3260 if (PL_lex_brackets == 0) {
3261 if (PL_expect & XFAKEBRACK) {
3262 PL_expect &= XENUMMASK;
3263 PL_lex_state = LEX_INTERPEND;
3265 return yylex(); /* ignore fake brackets */
3267 if (*s == '-' && s[1] == '>')
3268 PL_lex_state = LEX_INTERPENDMAYBE;
3269 else if (*s != '[' && *s != '{')
3270 PL_lex_state = LEX_INTERPEND;
3273 if (PL_expect & XFAKEBRACK) {
3274 PL_expect &= XENUMMASK;
3276 return yylex(); /* ignore fake brackets */
3286 if (PL_expect == XOPERATOR) {
3287 if (ckWARN(WARN_SEMICOLON)
3288 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3290 CopLINE_dec(PL_curcop);
3291 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3292 CopLINE_inc(PL_curcop);
3297 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3299 PL_expect = XOPERATOR;
3300 force_ident(PL_tokenbuf, '&');
3304 yylval.ival = (OPpENTERSUB_AMPER<<8);
3323 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3324 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3326 if (PL_expect == XSTATE && isALPHA(tmp) &&
3327 (s == PL_linestart+1 || s[-2] == '\n') )
3329 if (PL_in_eval && !PL_rsfp) {
3334 if (strnEQ(s,"=cut",4)) {
3348 PL_doextract = TRUE;
3351 if (PL_lex_brackets < PL_lex_formbrack) {
3353 #ifdef PERL_STRICT_CR
3354 for (t = s; SPACE_OR_TAB(*t); t++) ;
3356 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3358 if (*t == '\n' || *t == '#') {
3376 if (PL_expect != XOPERATOR) {
3377 if (s[1] != '<' && !strchr(s,'>'))
3380 s = scan_heredoc(s);
3382 s = scan_inputsymbol(s);
3383 TERM(sublex_start());
3388 SHop(OP_LEFT_SHIFT);
3402 SHop(OP_RIGHT_SHIFT);
3411 if (PL_expect == XOPERATOR) {
3412 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3415 return ','; /* grandfather non-comma-format format */
3419 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3420 PL_tokenbuf[0] = '@';
3421 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3422 sizeof PL_tokenbuf - 1, FALSE);
3423 if (PL_expect == XOPERATOR)
3424 no_op("Array length", s);
3425 if (!PL_tokenbuf[1])
3427 PL_expect = XOPERATOR;
3428 PL_pending_ident = '#';
3432 PL_tokenbuf[0] = '$';
3433 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3434 sizeof PL_tokenbuf - 1, FALSE);
3435 if (PL_expect == XOPERATOR)
3437 if (!PL_tokenbuf[1]) {
3439 yyerror("Final $ should be \\$ or $name");
3443 /* This kludge not intended to be bulletproof. */
3444 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3445 yylval.opval = newSVOP(OP_CONST, 0,
3446 newSViv(PL_compiling.cop_arybase));
3447 yylval.opval->op_private = OPpCONST_ARYBASE;
3453 if (PL_lex_state == LEX_NORMAL)
3456 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3459 PL_tokenbuf[0] = '@';
3460 if (ckWARN(WARN_SYNTAX)) {
3462 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3465 PL_bufptr = skipspace(PL_bufptr);
3466 while (t < PL_bufend && *t != ']')
3468 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3469 "Multidimensional syntax %.*s not supported",
3470 (t - PL_bufptr) + 1, PL_bufptr);
3474 else if (*s == '{') {
3475 PL_tokenbuf[0] = '%';
3476 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3477 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3479 char tmpbuf[sizeof PL_tokenbuf];
3481 for (t++; isSPACE(*t); t++) ;
3482 if (isIDFIRST_lazy_if(t,UTF)) {
3483 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3484 for (; isSPACE(*t); t++) ;
3485 if (*t == ';' && get_cv(tmpbuf, FALSE))
3486 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3487 "You need to quote \"%s\"", tmpbuf);
3493 PL_expect = XOPERATOR;
3494 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3495 bool islop = (PL_last_lop == PL_oldoldbufptr);
3496 if (!islop || PL_last_lop_op == OP_GREPSTART)
3497 PL_expect = XOPERATOR;
3498 else if (strchr("$@\"'`q", *s))
3499 PL_expect = XTERM; /* e.g. print $fh "foo" */
3500 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3501 PL_expect = XTERM; /* e.g. print $fh &sub */
3502 else if (isIDFIRST_lazy_if(s,UTF)) {
3503 char tmpbuf[sizeof PL_tokenbuf];
3504 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3505 if ((tmp = keyword(tmpbuf, len))) {
3506 /* binary operators exclude handle interpretations */
3518 PL_expect = XTERM; /* e.g. print $fh length() */
3523 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3524 if (gv && GvCVu(gv))
3525 PL_expect = XTERM; /* e.g. print $fh subr() */
3528 else if (isDIGIT(*s))
3529 PL_expect = XTERM; /* e.g. print $fh 3 */
3530 else if (*s == '.' && isDIGIT(s[1]))
3531 PL_expect = XTERM; /* e.g. print $fh .3 */
3532 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3533 PL_expect = XTERM; /* e.g. print $fh -1 */
3534 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3535 PL_expect = XTERM; /* print $fh <<"EOF" */
3537 PL_pending_ident = '$';
3541 if (PL_expect == XOPERATOR)
3543 PL_tokenbuf[0] = '@';
3544 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3545 if (!PL_tokenbuf[1]) {
3547 yyerror("Final @ should be \\@ or @name");
3550 if (PL_lex_state == LEX_NORMAL)
3552 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3554 PL_tokenbuf[0] = '%';
3556 /* Warn about @ where they meant $. */
3557 if (ckWARN(WARN_SYNTAX)) {
3558 if (*s == '[' || *s == '{') {
3560 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3562 if (*t == '}' || *t == ']') {
3564 PL_bufptr = skipspace(PL_bufptr);
3565 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3566 "Scalar value %.*s better written as $%.*s",
3567 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3572 PL_pending_ident = '@';
3575 case '/': /* may either be division or pattern */
3576 case '?': /* may either be conditional or pattern */
3577 if (PL_expect != XOPERATOR) {
3578 /* Disable warning on "study /blah/" */
3579 if (PL_oldoldbufptr == PL_last_uni
3580 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3581 || memNE(PL_last_uni, "study", 5)
3582 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3584 s = scan_pat(s,OP_MATCH);
3585 TERM(sublex_start());
3593 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3594 #ifdef PERL_STRICT_CR
3597 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3599 && (s == PL_linestart || s[-1] == '\n') )
3601 PL_lex_formbrack = 0;
3605 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3611 yylval.ival = OPf_SPECIAL;
3617 if (PL_expect != XOPERATOR)
3622 case '0': case '1': case '2': case '3': case '4':
3623 case '5': case '6': case '7': case '8': case '9':
3624 s = scan_num(s, &yylval);
3625 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3626 "### Saw number in '%s'\n", s);
3628 if (PL_expect == XOPERATOR)
3633 s = scan_str(s,FALSE,FALSE);
3634 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3635 "### Saw string before '%s'\n", s);
3637 if (PL_expect == XOPERATOR) {
3638 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3641 return ','; /* grandfather non-comma-format format */
3647 missingterm((char*)0);
3648 yylval.ival = OP_CONST;
3649 TERM(sublex_start());
3652 s = scan_str(s,FALSE,FALSE);
3653 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3654 "### Saw string before '%s'\n", s);
3656 if (PL_expect == XOPERATOR) {
3657 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3660 return ','; /* grandfather non-comma-format format */
3666 missingterm((char*)0);
3667 yylval.ival = OP_CONST;
3668 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3669 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3670 yylval.ival = OP_STRINGIFY;
3674 TERM(sublex_start());
3677 s = scan_str(s,FALSE,FALSE);
3678 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3679 "### Saw backtick string before '%s'\n", s);
3681 if (PL_expect == XOPERATOR)
3682 no_op("Backticks",s);
3684 missingterm((char*)0);
3685 yylval.ival = OP_BACKTICK;
3687 TERM(sublex_start());
3691 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3692 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3694 if (PL_expect == XOPERATOR)
3695 no_op("Backslash",s);
3699 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3703 while (isDIGIT(*start) || *start == '_')
3705 if (*start == '.' && isDIGIT(start[1])) {
3706 s = scan_num(s, &yylval);
3709 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3710 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3714 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3717 s = scan_num(s, &yylval);
3724 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3763 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3765 /* Some keywords can be followed by any delimiter, including ':' */
3766 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3767 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3768 (PL_tokenbuf[0] == 'q' &&
3769 strchr("qwxr", PL_tokenbuf[1])))));
3771 /* x::* is just a word, unless x is "CORE" */
3772 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3776 while (d < PL_bufend && isSPACE(*d))
3777 d++; /* no comments skipped here, or s### is misparsed */
3779 /* Is this a label? */
3780 if (!tmp && PL_expect == XSTATE
3781 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3783 yylval.pval = savepv(PL_tokenbuf);
3788 /* Check for keywords */
3789 tmp = keyword(PL_tokenbuf, len);
3791 /* Is this a word before a => operator? */
3792 if (*d == '=' && d[1] == '>') {
3794 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3795 yylval.opval->op_private = OPpCONST_BARE;
3796 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3797 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3801 if (tmp < 0) { /* second-class keyword? */
3802 GV *ogv = Nullgv; /* override (winner) */
3803 GV *hgv = Nullgv; /* hidden (loser) */
3804 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3806 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3809 if (GvIMPORTED_CV(gv))
3811 else if (! CvMETHOD(cv))
3815 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3816 (gv = *gvp) != (GV*)&PL_sv_undef &&
3817 GvCVu(gv) && GvIMPORTED_CV(gv))
3823 tmp = 0; /* overridden by import or by GLOBAL */
3826 && -tmp==KEY_lock /* XXX generalizable kludge */
3828 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3830 tmp = 0; /* any sub overrides "weak" keyword */
3832 else { /* no override */
3834 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3835 Perl_warner(aTHX_ packWARN(WARN_MISC),
3836 "dump() better written as CORE::dump()");
3840 if (ckWARN(WARN_AMBIGUOUS) && hgv
3841 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3842 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3843 "Ambiguous call resolved as CORE::%s(), %s",
3844 GvENAME(hgv), "qualify as such or use &");
3851 default: /* not a keyword */
3855 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3857 /* Get the rest if it looks like a package qualifier */
3859 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3861 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3864 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3865 *s == '\'' ? "'" : "::");
3870 if (PL_expect == XOPERATOR) {
3871 if (PL_bufptr == PL_linestart) {
3872 CopLINE_dec(PL_curcop);
3873 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3874 CopLINE_inc(PL_curcop);
3877 no_op("Bareword",s);
3880 /* Look for a subroutine with this name in current package,
3881 unless name is "Foo::", in which case Foo is a bearword
3882 (and a package name). */
3885 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3887 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3888 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3889 "Bareword \"%s\" refers to nonexistent package",
3892 PL_tokenbuf[len] = '\0';
3899 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3902 /* if we saw a global override before, get the right name */
3905 sv = newSVpvn("CORE::GLOBAL::",14);
3906 sv_catpv(sv,PL_tokenbuf);
3909 sv = newSVpv(PL_tokenbuf,0);
3911 /* Presume this is going to be a bareword of some sort. */
3914 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3915 yylval.opval->op_private = OPpCONST_BARE;
3916 /* UTF-8 package name? */
3917 if (UTF && !IN_BYTES &&
3918 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3921 /* And if "Foo::", then that's what it certainly is. */
3926 /* See if it's the indirect object for a list operator. */
3928 if (PL_oldoldbufptr &&
3929 PL_oldoldbufptr < PL_bufptr &&
3930 (PL_oldoldbufptr == PL_last_lop
3931 || PL_oldoldbufptr == PL_last_uni) &&
3932 /* NO SKIPSPACE BEFORE HERE! */
3933 (PL_expect == XREF ||
3934 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3936 bool immediate_paren = *s == '(';
3938 /* (Now we can afford to cross potential line boundary.) */
3941 /* Two barewords in a row may indicate method call. */
3943 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3946 /* If not a declared subroutine, it's an indirect object. */
3947 /* (But it's an indir obj regardless for sort.) */
3949 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3950 ((!gv || !GvCVu(gv)) &&
3951 (PL_last_lop_op != OP_MAPSTART &&
3952 PL_last_lop_op != OP_GREPSTART))))
3954 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3959 PL_expect = XOPERATOR;
3962 /* Is this a word before a => operator? */
3963 if (*s == '=' && s[1] == '>' && !pkgname) {
3965 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3966 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3967 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3971 /* If followed by a paren, it's certainly a subroutine. */
3974 if (gv && GvCVu(gv)) {
3975 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3976 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3981 PL_nextval[PL_nexttoke].opval = yylval.opval;
3982 PL_expect = XOPERATOR;
3988 /* If followed by var or block, call it a method (unless sub) */
3990 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3991 PL_last_lop = PL_oldbufptr;
3992 PL_last_lop_op = OP_METHOD;
3996 /* If followed by a bareword, see if it looks like indir obj. */
3998 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4001 /* Not a method, so call it a subroutine (if defined) */
4003 if (gv && GvCVu(gv)) {
4005 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4006 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4007 "Ambiguous use of -%s resolved as -&%s()",
4008 PL_tokenbuf, PL_tokenbuf);
4009 /* Check for a constant sub */
4011 if ((sv = cv_const_sv(cv))) {
4013 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4014 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4015 yylval.opval->op_private = 0;
4019 /* Resolve to GV now. */
4020 op_free(yylval.opval);
4021 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4022 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4023 PL_last_lop = PL_oldbufptr;
4024 PL_last_lop_op = OP_ENTERSUB;
4025 /* Is there a prototype? */
4028 char *proto = SvPV((SV*)cv, len);
4031 if (strEQ(proto, "$"))
4033 if (*proto == '&' && *s == '{') {
4034 sv_setpv(PL_subname, PL_curstash ?
4035 "__ANON__" : "__ANON__::__ANON__");
4039 PL_nextval[PL_nexttoke].opval = yylval.opval;
4045 /* Call it a bare word */
4047 if (PL_hints & HINT_STRICT_SUBS)
4048 yylval.opval->op_private |= OPpCONST_STRICT;
4051 if (ckWARN(WARN_RESERVED)) {
4052 if (lastchar != '-') {
4053 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4054 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4055 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4062 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4063 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4064 "Operator or semicolon missing before %c%s",
4065 lastchar, PL_tokenbuf);
4066 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4067 "Ambiguous use of %c resolved as operator %c",
4068 lastchar, lastchar);
4074 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4075 newSVpv(CopFILE(PL_curcop),0));
4079 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4080 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4083 case KEY___PACKAGE__:
4084 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4086 ? newSVsv(PL_curstname)
4095 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4096 char *pname = "main";
4097 if (PL_tokenbuf[2] == 'D')
4098 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4099 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4102 GvIOp(gv) = newIO();
4103 IoIFP(GvIOp(gv)) = PL_rsfp;
4104 #if defined(HAS_FCNTL) && defined(F_SETFD)
4106 int fd = PerlIO_fileno(PL_rsfp);
4107 fcntl(fd,F_SETFD,fd >= 3);
4110 /* Mark this internal pseudo-handle as clean */
4111 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4113 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4114 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4115 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4117 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4118 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4119 /* if the script was opened in binmode, we need to revert
4120 * it to text mode for compatibility; but only iff it has CRs
4121 * XXX this is a questionable hack at best. */
4122 if (PL_bufend-PL_bufptr > 2
4123 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4126 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4127 loc = PerlIO_tell(PL_rsfp);
4128 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4131 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4133 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4134 #endif /* NETWARE */
4135 #ifdef PERLIO_IS_STDIO /* really? */
4136 # if defined(__BORLANDC__)
4137 /* XXX see note in do_binmode() */
4138 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4142 PerlIO_seek(PL_rsfp, loc, 0);
4146 #ifdef PERLIO_LAYERS
4147 if (UTF && !IN_BYTES)
4148 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4161 if (PL_expect == XSTATE) {
4168 if (*s == ':' && s[1] == ':') {
4171 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4172 if (!(tmp = keyword(PL_tokenbuf, len)))
4173 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4187 LOP(OP_ACCEPT,XTERM);
4193 LOP(OP_ATAN2,XTERM);
4199 LOP(OP_BINMODE,XTERM);
4202 LOP(OP_BLESS,XTERM);
4211 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4228 if (!PL_cryptseen) {
4229 PL_cryptseen = TRUE;
4233 LOP(OP_CRYPT,XTERM);
4236 LOP(OP_CHMOD,XTERM);
4239 LOP(OP_CHOWN,XTERM);
4242 LOP(OP_CONNECT,XTERM);
4258 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4262 PL_hints |= HINT_BLOCK_SCOPE;
4272 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4273 LOP(OP_DBMOPEN,XTERM);
4279 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4286 yylval.ival = CopLINE(PL_curcop);
4300 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4301 UNIBRACK(OP_ENTEREVAL);
4316 case KEY_endhostent:
4322 case KEY_endservent:
4325 case KEY_endprotoent:
4336 yylval.ival = CopLINE(PL_curcop);
4338 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4340 if ((PL_bufend - p) >= 3 &&
4341 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4343 else if ((PL_bufend - p) >= 4 &&
4344 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4347 if (isIDFIRST_lazy_if(p,UTF)) {
4348 p = scan_ident(p, PL_bufend,
4349 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4353 Perl_croak(aTHX_ "Missing $ on loop variable");
4358 LOP(OP_FORMLINE,XTERM);
4364 LOP(OP_FCNTL,XTERM);
4370 LOP(OP_FLOCK,XTERM);
4379 LOP(OP_GREPSTART, XREF);
4382 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4397 case KEY_getpriority:
4398 LOP(OP_GETPRIORITY,XTERM);
4400 case KEY_getprotobyname:
4403 case KEY_getprotobynumber:
4404 LOP(OP_GPBYNUMBER,XTERM);
4406 case KEY_getprotoent:
4418 case KEY_getpeername:
4419 UNI(OP_GETPEERNAME);
4421 case KEY_gethostbyname:
4424 case KEY_gethostbyaddr:
4425 LOP(OP_GHBYADDR,XTERM);
4427 case KEY_gethostent:
4430 case KEY_getnetbyname:
4433 case KEY_getnetbyaddr:
4434 LOP(OP_GNBYADDR,XTERM);
4439 case KEY_getservbyname:
4440 LOP(OP_GSBYNAME,XTERM);
4442 case KEY_getservbyport:
4443 LOP(OP_GSBYPORT,XTERM);
4445 case KEY_getservent:
4448 case KEY_getsockname:
4449 UNI(OP_GETSOCKNAME);
4451 case KEY_getsockopt:
4452 LOP(OP_GSOCKOPT,XTERM);
4474 yylval.ival = CopLINE(PL_curcop);
4478 LOP(OP_INDEX,XTERM);
4484 LOP(OP_IOCTL,XTERM);
4496 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4528 LOP(OP_LISTEN,XTERM);
4537 s = scan_pat(s,OP_MATCH);
4538 TERM(sublex_start());
4541 LOP(OP_MAPSTART, XREF);
4544 LOP(OP_MKDIR,XTERM);
4547 LOP(OP_MSGCTL,XTERM);
4550 LOP(OP_MSGGET,XTERM);
4553 LOP(OP_MSGRCV,XTERM);
4556 LOP(OP_MSGSND,XTERM);
4562 if (isIDFIRST_lazy_if(s,UTF)) {
4563 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4564 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4566 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4567 if (!PL_in_my_stash) {
4570 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4578 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4585 if (PL_expect != XSTATE)
4586 yyerror("\"no\" not allowed in expression");
4587 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4588 s = force_version(s, FALSE);
4593 if (*s == '(' || (s = skipspace(s), *s == '('))
4600 if (isIDFIRST_lazy_if(s,UTF)) {
4602 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4604 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4605 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4606 "Precedence problem: open %.*s should be open(%.*s)",
4612 yylval.ival = OP_OR;
4622 LOP(OP_OPEN_DIR,XTERM);
4625 checkcomma(s,PL_tokenbuf,"filehandle");
4629 checkcomma(s,PL_tokenbuf,"filehandle");
4648 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4652 LOP(OP_PIPE_OP,XTERM);
4655 s = scan_str(s,FALSE,FALSE);
4657 missingterm((char*)0);
4658 yylval.ival = OP_CONST;
4659 TERM(sublex_start());
4665 s = scan_str(s,FALSE,FALSE);
4667 missingterm((char*)0);
4669 if (SvCUR(PL_lex_stuff)) {
4672 d = SvPV_force(PL_lex_stuff, len);
4675 for (; isSPACE(*d) && len; --len, ++d) ;
4678 if (!warned && ckWARN(WARN_QW)) {
4679 for (; !isSPACE(*d) && len; --len, ++d) {
4681 Perl_warner(aTHX_ packWARN(WARN_QW),
4682 "Possible attempt to separate words with commas");
4685 else if (*d == '#') {
4686 Perl_warner(aTHX_ packWARN(WARN_QW),
4687 "Possible attempt to put comments in qw() list");
4693 for (; !isSPACE(*d) && len; --len, ++d) ;
4695 sv = newSVpvn(b, d-b);
4696 if (DO_UTF8(PL_lex_stuff))
4698 words = append_elem(OP_LIST, words,
4699 newSVOP(OP_CONST, 0, tokeq(sv)));
4703 PL_nextval[PL_nexttoke].opval = words;
4708 SvREFCNT_dec(PL_lex_stuff);
4709 PL_lex_stuff = Nullsv;
4715 s = scan_str(s,FALSE,FALSE);
4717 missingterm((char*)0);
4718 yylval.ival = OP_STRINGIFY;
4719 if (SvIVX(PL_lex_stuff) == '\'')
4720 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4721 TERM(sublex_start());
4724 s = scan_pat(s,OP_QR);
4725 TERM(sublex_start());
4728 s = scan_str(s,FALSE,FALSE);
4730 missingterm((char*)0);
4731 yylval.ival = OP_BACKTICK;
4733 TERM(sublex_start());
4741 s = force_version(s, FALSE);
4743 else if (*s != 'v' || !isDIGIT(s[1])
4744 || (s = force_version(s, TRUE), *s == 'v'))
4746 *PL_tokenbuf = '\0';
4747 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4748 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4749 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4751 yyerror("<> should be quotes");
4759 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4763 LOP(OP_RENAME,XTERM);
4772 LOP(OP_RINDEX,XTERM);
4795 LOP(OP_REVERSE,XTERM);
4806 TERM(sublex_start());
4808 TOKEN(1); /* force error */
4817 LOP(OP_SELECT,XTERM);
4823 LOP(OP_SEMCTL,XTERM);
4826 LOP(OP_SEMGET,XTERM);
4829 LOP(OP_SEMOP,XTERM);
4835 LOP(OP_SETPGRP,XTERM);
4837 case KEY_setpriority:
4838 LOP(OP_SETPRIORITY,XTERM);
4840 case KEY_sethostent:
4846 case KEY_setservent:
4849 case KEY_setprotoent:
4859 LOP(OP_SEEKDIR,XTERM);
4861 case KEY_setsockopt:
4862 LOP(OP_SSOCKOPT,XTERM);
4868 LOP(OP_SHMCTL,XTERM);
4871 LOP(OP_SHMGET,XTERM);
4874 LOP(OP_SHMREAD,XTERM);
4877 LOP(OP_SHMWRITE,XTERM);
4880 LOP(OP_SHUTDOWN,XTERM);
4889 LOP(OP_SOCKET,XTERM);
4891 case KEY_socketpair:
4892 LOP(OP_SOCKPAIR,XTERM);
4895 checkcomma(s,PL_tokenbuf,"subroutine name");
4897 if (*s == ';' || *s == ')') /* probably a close */
4898 Perl_croak(aTHX_ "sort is now a reserved word");
4900 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4904 LOP(OP_SPLIT,XTERM);
4907 LOP(OP_SPRINTF,XTERM);
4910 LOP(OP_SPLICE,XTERM);
4925 LOP(OP_SUBSTR,XTERM);
4931 char tmpbuf[sizeof PL_tokenbuf];
4932 SSize_t tboffset = 0;
4933 expectation attrful;
4934 bool have_name, have_proto, bad_proto;
4939 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4940 (*s == ':' && s[1] == ':'))
4943 attrful = XATTRBLOCK;
4944 /* remember buffer pos'n for later force_word */
4945 tboffset = s - PL_oldbufptr;
4946 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4947 if (strchr(tmpbuf, ':'))
4948 sv_setpv(PL_subname, tmpbuf);
4950 sv_setsv(PL_subname,PL_curstname);
4951 sv_catpvn(PL_subname,"::",2);
4952 sv_catpvn(PL_subname,tmpbuf,len);
4959 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4960 PL_expect = XTERMBLOCK;
4961 attrful = XATTRTERM;
4962 sv_setpv(PL_subname,"?");
4966 if (key == KEY_format) {
4968 PL_lex_formbrack = PL_lex_brackets + 1;
4970 (void) force_word(PL_oldbufptr + tboffset, WORD,
4975 /* Look for a prototype */
4979 s = scan_str(s,FALSE,FALSE);
4981 Perl_croak(aTHX_ "Prototype not terminated");
4982 /* strip spaces and check for bad characters */
4983 d = SvPVX(PL_lex_stuff);
4986 for (p = d; *p; ++p) {
4989 if (!strchr("$@%*;[]&\\", *p))
4994 if (bad_proto && ckWARN(WARN_SYNTAX))
4995 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
4996 "Illegal character in prototype for %s : %s",
4997 SvPVX(PL_subname), d);
4998 SvCUR(PL_lex_stuff) = tmp;
5006 if (*s == ':' && s[1] != ':')
5007 PL_expect = attrful;
5010 PL_nextval[PL_nexttoke].opval =
5011 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5012 PL_lex_stuff = Nullsv;
5016 sv_setpv(PL_subname,
5017 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5020 (void) force_word(PL_oldbufptr + tboffset, WORD,
5029 LOP(OP_SYSTEM,XREF);
5032 LOP(OP_SYMLINK,XTERM);
5035 LOP(OP_SYSCALL,XTERM);
5038 LOP(OP_SYSOPEN,XTERM);
5041 LOP(OP_SYSSEEK,XTERM);
5044 LOP(OP_SYSREAD,XTERM);
5047 LOP(OP_SYSWRITE,XTERM);
5051 TERM(sublex_start());
5072 LOP(OP_TRUNCATE,XTERM);
5084 yylval.ival = CopLINE(PL_curcop);
5088 yylval.ival = CopLINE(PL_curcop);
5092 LOP(OP_UNLINK,XTERM);
5098 LOP(OP_UNPACK,XTERM);
5101 LOP(OP_UTIME,XTERM);
5107 LOP(OP_UNSHIFT,XTERM);
5110 if (PL_expect != XSTATE)
5111 yyerror("\"use\" not allowed in expression");
5113 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5114 s = force_version(s, TRUE);
5115 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5116 PL_nextval[PL_nexttoke].opval = Nullop;
5119 else if (*s == 'v') {
5120 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5121 s = force_version(s, FALSE);
5125 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5126 s = force_version(s, FALSE);
5138 yylval.ival = CopLINE(PL_curcop);
5142 PL_hints |= HINT_BLOCK_SCOPE;
5149 LOP(OP_WAITPID,XTERM);
5158 ctl_l[0] = toCTRL('L');
5160 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5163 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5168 if (PL_expect == XOPERATOR)
5174 yylval.ival = OP_XOR;
5179 TERM(sublex_start());
5184 #pragma segment Main
5188 S_pending_ident(pTHX)
5192 /* pit holds the identifier we read and pending_ident is reset */
5193 char pit = PL_pending_ident;
5194 PL_pending_ident = 0;
5196 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5197 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5199 /* if we're in a my(), we can't allow dynamics here.
5200 $foo'bar has already been turned into $foo::bar, so
5201 just check for colons.
5203 if it's a legal name, the OP is a PADANY.
5206 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5207 if (strchr(PL_tokenbuf,':'))
5208 yyerror(Perl_form(aTHX_ "No package name allowed for "
5209 "variable %s in \"our\"",
5211 tmp = pad_allocmy(PL_tokenbuf);
5214 if (strchr(PL_tokenbuf,':'))
5215 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5217 yylval.opval = newOP(OP_PADANY, 0);
5218 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5224 build the ops for accesses to a my() variable.
5226 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5227 then used in a comparison. This catches most, but not
5228 all cases. For instance, it catches
5229 sort { my($a); $a <=> $b }
5231 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5232 (although why you'd do that is anyone's guess).
5235 if (!strchr(PL_tokenbuf,':')) {
5236 #ifdef USE_5005THREADS
5237 /* Check for single character per-thread SVs */
5238 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5239 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5240 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5242 yylval.opval = newOP(OP_THREADSV, 0);
5243 yylval.opval->op_targ = tmp;
5246 #endif /* USE_5005THREADS */
5247 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5248 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5249 /* might be an "our" variable" */
5250 if (SvFLAGS(namesv) & SVpad_OUR) {
5251 /* build ops for a bareword */
5252 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5253 sv_catpvn(sym, "::", 2);
5254 sv_catpv(sym, PL_tokenbuf+1);
5255 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5256 yylval.opval->op_private = OPpCONST_ENTERED;
5257 gv_fetchpv(SvPVX(sym),
5259 ? (GV_ADDMULTI | GV_ADDINEVAL)
5262 ((PL_tokenbuf[0] == '$') ? SVt_PV
5263 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5268 /* if it's a sort block and they're naming $a or $b */
5269 if (PL_last_lop_op == OP_SORT &&
5270 PL_tokenbuf[0] == '$' &&
5271 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5274 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5275 d < PL_bufend && *d != '\n';
5278 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5279 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5285 yylval.opval = newOP(OP_PADANY, 0);
5286 yylval.opval->op_targ = tmp;
5292 Whine if they've said @foo in a doublequoted string,
5293 and @foo isn't a variable we can find in the symbol
5296 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5297 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5298 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5299 && ckWARN(WARN_AMBIGUOUS))
5301 /* Downgraded from fatal to warning 20000522 mjd */
5302 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5303 "Possible unintended interpolation of %s in string",
5308 /* build ops for a bareword */
5309 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5310 yylval.opval->op_private = OPpCONST_ENTERED;
5311 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5312 ((PL_tokenbuf[0] == '$') ? SVt_PV
5313 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5319 Perl_keyword(pTHX_ register char *d, I32 len)
5324 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5325 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5326 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5327 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5328 if (strEQ(d,"__END__")) return KEY___END__;
5332 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5337 if (strEQ(d,"and")) return -KEY_and;
5338 if (strEQ(d,"abs")) return -KEY_abs;
5341 if (strEQ(d,"alarm")) return -KEY_alarm;
5342 if (strEQ(d,"atan2")) return -KEY_atan2;
5345 if (strEQ(d,"accept")) return -KEY_accept;
5350 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5353 if (strEQ(d,"bless")) return -KEY_bless;
5354 if (strEQ(d,"bind")) return -KEY_bind;
5355 if (strEQ(d,"binmode")) return -KEY_binmode;
5358 if (strEQ(d,"CORE")) return -KEY_CORE;
5359 if (strEQ(d,"CHECK")) return KEY_CHECK;
5364 if (strEQ(d,"cmp")) return -KEY_cmp;
5365 if (strEQ(d,"chr")) return -KEY_chr;
5366 if (strEQ(d,"cos")) return -KEY_cos;
5369 if (strEQ(d,"chop")) return -KEY_chop;
5372 if (strEQ(d,"close")) return -KEY_close;
5373 if (strEQ(d,"chdir")) return -KEY_chdir;
5374 if (strEQ(d,"chomp")) return -KEY_chomp;
5375 if (strEQ(d,"chmod")) return -KEY_chmod;
5376 if (strEQ(d,"chown")) return -KEY_chown;
5377 if (strEQ(d,"crypt")) return -KEY_crypt;
5380 if (strEQ(d,"chroot")) return -KEY_chroot;
5381 if (strEQ(d,"caller")) return -KEY_caller;
5384 if (strEQ(d,"connect")) return -KEY_connect;
5387 if (strEQ(d,"closedir")) return -KEY_closedir;
5388 if (strEQ(d,"continue")) return -KEY_continue;
5393 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5398 if (strEQ(d,"do")) return KEY_do;
5401 if (strEQ(d,"die")) return -KEY_die;
5404 if (strEQ(d,"dump")) return -KEY_dump;
5407 if (strEQ(d,"delete")) return KEY_delete;
5410 if (strEQ(d,"defined")) return KEY_defined;
5411 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5414 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5419 if (strEQ(d,"END")) return KEY_END;
5424 if (strEQ(d,"eq")) return -KEY_eq;
5427 if (strEQ(d,"eof")) return -KEY_eof;
5428 if (strEQ(d,"exp")) return -KEY_exp;
5431 if (strEQ(d,"else")) return KEY_else;
5432 if (strEQ(d,"exit")) return -KEY_exit;
5433 if (strEQ(d,"eval")) return KEY_eval;
5434 if (strEQ(d,"exec")) return -KEY_exec;
5435 if (strEQ(d,"each")) return -KEY_each;
5438 if (strEQ(d,"elsif")) return KEY_elsif;
5441 if (strEQ(d,"exists")) return KEY_exists;
5442 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5445 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5446 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5449 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5452 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5453 if (strEQ(d,"endservent")) return -KEY_endservent;
5456 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5463 if (strEQ(d,"for")) return KEY_for;
5466 if (strEQ(d,"fork")) return -KEY_fork;
5469 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5470 if (strEQ(d,"flock")) return -KEY_flock;
5473 if (strEQ(d,"format")) return KEY_format;
5474 if (strEQ(d,"fileno")) return -KEY_fileno;
5477 if (strEQ(d,"foreach")) return KEY_foreach;
5480 if (strEQ(d,"formline")) return -KEY_formline;
5485 if (strnEQ(d,"get",3)) {
5490 if (strEQ(d,"ppid")) return -KEY_getppid;
5491 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5494 if (strEQ(d,"pwent")) return -KEY_getpwent;
5495 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5496 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5499 if (strEQ(d,"peername")) return -KEY_getpeername;
5500 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5501 if (strEQ(d,"priority")) return -KEY_getpriority;
5504 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5507 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5511 else if (*d == 'h') {
5512 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5513 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5514 if (strEQ(d,"hostent")) return -KEY_gethostent;
5516 else if (*d == 'n') {
5517 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5518 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5519 if (strEQ(d,"netent")) return -KEY_getnetent;
5521 else if (*d == 's') {
5522 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5523 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5524 if (strEQ(d,"servent")) return -KEY_getservent;
5525 if (strEQ(d,"sockname")) return -KEY_getsockname;
5526 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5528 else if (*d == 'g') {
5529 if (strEQ(d,"grent")) return -KEY_getgrent;
5530 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5531 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5533 else if (*d == 'l') {
5534 if (strEQ(d,"login")) return -KEY_getlogin;
5536 else if (strEQ(d,"c")) return -KEY_getc;
5541 if (strEQ(d,"gt")) return -KEY_gt;
5542 if (strEQ(d,"ge")) return -KEY_ge;
5545 if (strEQ(d,"grep")) return KEY_grep;
5546 if (strEQ(d,"goto")) return KEY_goto;
5547 if (strEQ(d,"glob")) return KEY_glob;
5550 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5555 if (strEQ(d,"hex")) return -KEY_hex;
5558 if (strEQ(d,"INIT")) return KEY_INIT;
5563 if (strEQ(d,"if")) return KEY_if;
5566 if (strEQ(d,"int")) return -KEY_int;
5569 if (strEQ(d,"index")) return -KEY_index;
5570 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5575 if (strEQ(d,"join")) return -KEY_join;
5579 if (strEQ(d,"keys")) return -KEY_keys;
5580 if (strEQ(d,"kill")) return -KEY_kill;
5586 if (strEQ(d,"lt")) return -KEY_lt;
5587 if (strEQ(d,"le")) return -KEY_le;
5588 if (strEQ(d,"lc")) return -KEY_lc;
5591 if (strEQ(d,"log")) return -KEY_log;
5594 if (strEQ(d,"last")) return KEY_last;
5595 if (strEQ(d,"link")) return -KEY_link;
5596 if (strEQ(d,"lock")) return -KEY_lock;
5599 if (strEQ(d,"local")) return KEY_local;
5600 if (strEQ(d,"lstat")) return -KEY_lstat;
5603 if (strEQ(d,"length")) return -KEY_length;
5604 if (strEQ(d,"listen")) return -KEY_listen;
5607 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5610 if (strEQ(d,"localtime")) return -KEY_localtime;
5616 case 1: return KEY_m;
5618 if (strEQ(d,"my")) return KEY_my;
5621 if (strEQ(d,"map")) return KEY_map;
5624 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5627 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5628 if (strEQ(d,"msgget")) return -KEY_msgget;
5629 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5630 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5635 if (strEQ(d,"next")) return KEY_next;
5636 if (strEQ(d,"ne")) return -KEY_ne;
5637 if (strEQ(d,"not")) return -KEY_not;
5638 if (strEQ(d,"no")) return KEY_no;
5643 if (strEQ(d,"or")) return -KEY_or;
5646 if (strEQ(d,"ord")) return -KEY_ord;
5647 if (strEQ(d,"oct")) return -KEY_oct;
5648 if (strEQ(d,"our")) return KEY_our;
5651 if (strEQ(d,"open")) return -KEY_open;
5654 if (strEQ(d,"opendir")) return -KEY_opendir;
5661 if (strEQ(d,"pop")) return -KEY_pop;
5662 if (strEQ(d,"pos")) return KEY_pos;
5665 if (strEQ(d,"push")) return -KEY_push;
5666 if (strEQ(d,"pack")) return -KEY_pack;
5667 if (strEQ(d,"pipe")) return -KEY_pipe;
5670 if (strEQ(d,"print")) return KEY_print;
5673 if (strEQ(d,"printf")) return KEY_printf;
5676 if (strEQ(d,"package")) return KEY_package;
5679 if (strEQ(d,"prototype")) return KEY_prototype;
5684 if (strEQ(d,"q")) return KEY_q;
5685 if (strEQ(d,"qr")) return KEY_qr;
5686 if (strEQ(d,"qq")) return KEY_qq;
5687 if (strEQ(d,"qw")) return KEY_qw;
5688 if (strEQ(d,"qx")) return KEY_qx;
5690 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5695 if (strEQ(d,"ref")) return -KEY_ref;
5698 if (strEQ(d,"read")) return -KEY_read;
5699 if (strEQ(d,"rand")) return -KEY_rand;
5700 if (strEQ(d,"recv")) return -KEY_recv;
5701 if (strEQ(d,"redo")) return KEY_redo;
5704 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5705 if (strEQ(d,"reset")) return -KEY_reset;
5708 if (strEQ(d,"return")) return KEY_return;
5709 if (strEQ(d,"rename")) return -KEY_rename;
5710 if (strEQ(d,"rindex")) return -KEY_rindex;
5713 if (strEQ(d,"require")) return KEY_require;
5714 if (strEQ(d,"reverse")) return -KEY_reverse;
5715 if (strEQ(d,"readdir")) return -KEY_readdir;
5718 if (strEQ(d,"readlink")) return -KEY_readlink;
5719 if (strEQ(d,"readline")) return -KEY_readline;
5720 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5723 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5729 case 0: return KEY_s;
5731 if (strEQ(d,"scalar")) return KEY_scalar;
5736 if (strEQ(d,"seek")) return -KEY_seek;
5737 if (strEQ(d,"send")) return -KEY_send;
5740 if (strEQ(d,"semop")) return -KEY_semop;
5743 if (strEQ(d,"select")) return -KEY_select;
5744 if (strEQ(d,"semctl")) return -KEY_semctl;
5745 if (strEQ(d,"semget")) return -KEY_semget;
5748 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5749 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5752 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5753 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5756 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5759 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5760 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5761 if (strEQ(d,"setservent")) return -KEY_setservent;
5764 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5765 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5772 if (strEQ(d,"shift")) return -KEY_shift;
5775 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5776 if (strEQ(d,"shmget")) return -KEY_shmget;
5779 if (strEQ(d,"shmread")) return -KEY_shmread;
5782 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5783 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5788 if (strEQ(d,"sin")) return -KEY_sin;
5791 if (strEQ(d,"sleep")) return -KEY_sleep;
5794 if (strEQ(d,"sort")) return KEY_sort;
5795 if (strEQ(d,"socket")) return -KEY_socket;
5796 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5799 if (strEQ(d,"split")) return KEY_split;
5800 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5801 if (strEQ(d,"splice")) return -KEY_splice;
5804 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5807 if (strEQ(d,"srand")) return -KEY_srand;
5810 if (strEQ(d,"stat")) return -KEY_stat;
5811 if (strEQ(d,"study")) return KEY_study;
5814 if (strEQ(d,"substr")) return -KEY_substr;
5815 if (strEQ(d,"sub")) return KEY_sub;
5820 if (strEQ(d,"system")) return -KEY_system;
5823 if (strEQ(d,"symlink")) return -KEY_symlink;
5824 if (strEQ(d,"syscall")) return -KEY_syscall;
5825 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5826 if (strEQ(d,"sysread")) return -KEY_sysread;
5827 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5830 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5839 if (strEQ(d,"tr")) return KEY_tr;
5842 if (strEQ(d,"tie")) return KEY_tie;
5845 if (strEQ(d,"tell")) return -KEY_tell;
5846 if (strEQ(d,"tied")) return KEY_tied;
5847 if (strEQ(d,"time")) return -KEY_time;
5850 if (strEQ(d,"times")) return -KEY_times;
5853 if (strEQ(d,"telldir")) return -KEY_telldir;
5856 if (strEQ(d,"truncate")) return -KEY_truncate;
5863 if (strEQ(d,"uc")) return -KEY_uc;
5866 if (strEQ(d,"use")) return KEY_use;
5869 if (strEQ(d,"undef")) return KEY_undef;
5870 if (strEQ(d,"until")) return KEY_until;
5871 if (strEQ(d,"untie")) return KEY_untie;
5872 if (strEQ(d,"utime")) return -KEY_utime;
5873 if (strEQ(d,"umask")) return -KEY_umask;
5876 if (strEQ(d,"unless")) return KEY_unless;
5877 if (strEQ(d,"unpack")) return -KEY_unpack;
5878 if (strEQ(d,"unlink")) return -KEY_unlink;
5881 if (strEQ(d,"unshift")) return -KEY_unshift;
5882 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5887 if (strEQ(d,"values")) return -KEY_values;
5888 if (strEQ(d,"vec")) return -KEY_vec;
5893 if (strEQ(d,"warn")) return -KEY_warn;
5894 if (strEQ(d,"wait")) return -KEY_wait;
5897 if (strEQ(d,"while")) return KEY_while;
5898 if (strEQ(d,"write")) return -KEY_write;
5901 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5904 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5909 if (len == 1) return -KEY_x;
5910 if (strEQ(d,"xor")) return -KEY_xor;
5913 if (len == 1) return KEY_y;
5922 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5926 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5927 if (ckWARN(WARN_SYNTAX)) {
5929 for (w = s+2; *w && level; w++) {
5936 for (; *w && isSPACE(*w); w++) ;
5937 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5938 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5939 "%s (...) interpreted as function",name);
5942 while (s < PL_bufend && isSPACE(*s))
5946 while (s < PL_bufend && isSPACE(*s))
5948 if (isIDFIRST_lazy_if(s,UTF)) {
5950 while (isALNUM_lazy_if(s,UTF))
5952 while (s < PL_bufend && isSPACE(*s))
5957 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5961 Perl_croak(aTHX_ "No comma allowed after %s", what);
5966 /* Either returns sv, or mortalizes sv and returns a new SV*.
5967 Best used as sv=new_constant(..., sv, ...).
5968 If s, pv are NULL, calls subroutine with one argument,
5969 and type is used with error messages only. */
5972 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5976 HV *table = GvHV(PL_hintgv); /* ^H */
5980 const char *why1, *why2, *why3;
5982 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5985 why2 = strEQ(key,"charnames")
5986 ? "(possibly a missing \"use charnames ...\")"
5988 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5989 (type ? type: "undef"), why2);
5991 /* This is convoluted and evil ("goto considered harmful")
5992 * but I do not understand the intricacies of all the different
5993 * failure modes of %^H in here. The goal here is to make
5994 * the most probable error message user-friendly. --jhi */
5999 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6000 (type ? type: "undef"), why1, why2, why3);
6002 yyerror(SvPVX(msg));
6006 cvp = hv_fetch(table, key, strlen(key), FALSE);
6007 if (!cvp || !SvOK(*cvp)) {
6010 why3 = "} is not defined";
6013 sv_2mortal(sv); /* Parent created it permanently */
6016 pv = sv_2mortal(newSVpvn(s, len));
6018 typesv = sv_2mortal(newSVpv(type, 0));
6020 typesv = &PL_sv_undef;
6022 PUSHSTACKi(PERLSI_OVERLOAD);
6034 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6038 /* Check the eval first */
6039 if (!PL_in_eval && SvTRUE(ERRSV)) {
6041 sv_catpv(ERRSV, "Propagated");
6042 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6044 res = SvREFCNT_inc(sv);
6048 (void)SvREFCNT_inc(res);
6057 why1 = "Call to &{$^H{";
6059 why3 = "}} did not return a defined value";
6068 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6070 register char *d = dest;
6071 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6074 Perl_croak(aTHX_ ident_too_long);
6075 if (isALNUM(*s)) /* UTF handled below */
6077 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6082 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6086 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6087 char *t = s + UTF8SKIP(s);
6088 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6090 if (d + (t - s) > e)
6091 Perl_croak(aTHX_ ident_too_long);
6092 Copy(s, d, t - s, char);
6105 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6115 e = d + destlen - 3; /* two-character token, ending NUL */
6117 while (isDIGIT(*s)) {
6119 Perl_croak(aTHX_ ident_too_long);
6126 Perl_croak(aTHX_ ident_too_long);
6127 if (isALNUM(*s)) /* UTF handled below */
6129 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6134 else if (*s == ':' && s[1] == ':') {
6138 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6139 char *t = s + UTF8SKIP(s);
6140 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6142 if (d + (t - s) > e)
6143 Perl_croak(aTHX_ ident_too_long);
6144 Copy(s, d, t - s, char);
6155 if (PL_lex_state != LEX_NORMAL)
6156 PL_lex_state = LEX_INTERPENDMAYBE;
6159 if (*s == '$' && s[1] &&
6160 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6173 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6178 if (isSPACE(s[-1])) {
6181 if (!SPACE_OR_TAB(ch)) {
6187 if (isIDFIRST_lazy_if(d,UTF)) {
6191 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6193 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6196 Copy(s, d, e - s, char);
6201 while ((isALNUM(*s) || *s == ':') && d < e)
6204 Perl_croak(aTHX_ ident_too_long);
6207 while (s < send && SPACE_OR_TAB(*s)) s++;
6208 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6209 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6210 const char *brack = *s == '[' ? "[...]" : "{...}";
6211 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6212 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6213 funny, dest, brack, funny, dest, brack);
6216 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6220 /* Handle extended ${^Foo} variables
6221 * 1999-02-27 mjd-perl-patch@plover.com */
6222 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6226 while (isALNUM(*s) && d < e) {
6230 Perl_croak(aTHX_ ident_too_long);
6235 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6236 PL_lex_state = LEX_INTERPEND;
6239 if (PL_lex_state == LEX_NORMAL) {
6240 if (ckWARN(WARN_AMBIGUOUS) &&
6241 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6243 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6244 "Ambiguous use of %c{%s} resolved to %c%s",
6245 funny, dest, funny, dest);
6250 s = bracket; /* let the parser handle it */
6254 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6255 PL_lex_state = LEX_INTERPEND;
6260 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6265 *pmfl |= PMf_GLOBAL;
6267 *pmfl |= PMf_CONTINUE;
6271 *pmfl |= PMf_MULTILINE;
6273 *pmfl |= PMf_SINGLELINE;
6275 *pmfl |= PMf_EXTENDED;
6279 S_scan_pat(pTHX_ char *start, I32 type)
6284 s = scan_str(start,FALSE,FALSE);
6286 Perl_croak(aTHX_ "Search pattern not terminated");
6288 pm = (PMOP*)newPMOP(type, 0);
6289 if (PL_multi_open == '?')
6290 pm->op_pmflags |= PMf_ONCE;
6292 while (*s && strchr("iomsx", *s))
6293 pmflag(&pm->op_pmflags,*s++);
6296 while (*s && strchr("iogcmsx", *s))
6297 pmflag(&pm->op_pmflags,*s++);
6299 /* issue a warning if /c is specified,but /g is not */
6300 if (ckWARN(WARN_REGEXP) &&
6301 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6303 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6306 pm->op_pmpermflags = pm->op_pmflags;
6308 PL_lex_op = (OP*)pm;
6309 yylval.ival = OP_MATCH;
6314 S_scan_subst(pTHX_ char *start)
6321 yylval.ival = OP_NULL;
6323 s = scan_str(start,FALSE,FALSE);
6326 Perl_croak(aTHX_ "Substitution pattern not terminated");
6328 if (s[-1] == PL_multi_open)
6331 first_start = PL_multi_start;
6332 s = scan_str(s,FALSE,FALSE);
6335 SvREFCNT_dec(PL_lex_stuff);
6336 PL_lex_stuff = Nullsv;
6338 Perl_croak(aTHX_ "Substitution replacement not terminated");
6340 PL_multi_start = first_start; /* so whole substitution is taken together */
6342 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6348 else if (strchr("iogcmsx", *s))
6349 pmflag(&pm->op_pmflags,*s++);
6354 /* /c is not meaningful with s/// */
6355 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6357 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6362 PL_sublex_info.super_bufptr = s;
6363 PL_sublex_info.super_bufend = PL_bufend;
6365 pm->op_pmflags |= PMf_EVAL;
6366 repl = newSVpvn("",0);
6368 sv_catpv(repl, es ? "eval " : "do ");
6369 sv_catpvn(repl, "{ ", 2);
6370 sv_catsv(repl, PL_lex_repl);
6371 sv_catpvn(repl, " };", 2);
6373 SvREFCNT_dec(PL_lex_repl);
6377 pm->op_pmpermflags = pm->op_pmflags;
6378 PL_lex_op = (OP*)pm;
6379 yylval.ival = OP_SUBST;
6384 S_scan_trans(pTHX_ char *start)
6393 yylval.ival = OP_NULL;
6395 s = scan_str(start,FALSE,FALSE);
6397 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6398 if (s[-1] == PL_multi_open)
6401 s = scan_str(s,FALSE,FALSE);
6404 SvREFCNT_dec(PL_lex_stuff);
6405 PL_lex_stuff = Nullsv;
6407 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6410 complement = del = squash = 0;
6411 while (strchr("cds", *s)) {
6413 complement = OPpTRANS_COMPLEMENT;
6415 del = OPpTRANS_DELETE;
6417 squash = OPpTRANS_SQUASH;
6421 New(803, tbl, complement&&!del?258:256, short);
6422 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6423 o->op_private = del|squash|complement|
6424 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6425 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6428 yylval.ival = OP_TRANS;
6433 S_scan_heredoc(pTHX_ register char *s)
6436 I32 op_type = OP_SCALAR;
6443 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6447 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6450 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6451 if (*peek && strchr("`'\"",*peek)) {
6454 s = delimcpy(d, e, s, PL_bufend, term, &len);
6464 if (!isALNUM_lazy_if(s,UTF))
6465 deprecate_old("bare << to mean <<\"\"");
6466 for (; isALNUM_lazy_if(s,UTF); s++) {
6471 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6472 Perl_croak(aTHX_ "Delimiter for here document is too long");
6475 len = d - PL_tokenbuf;
6476 #ifndef PERL_STRICT_CR
6477 d = strchr(s, '\r');
6481 while (s < PL_bufend) {
6487 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6496 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6501 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6502 herewas = newSVpvn(s,PL_bufend-s);
6504 s--, herewas = newSVpvn(s,d-s);
6505 s += SvCUR(herewas);
6507 tmpstr = NEWSV(87,79);
6508 sv_upgrade(tmpstr, SVt_PVIV);
6513 else if (term == '`') {
6514 op_type = OP_BACKTICK;
6515 SvIVX(tmpstr) = '\\';
6519 PL_multi_start = CopLINE(PL_curcop);
6520 PL_multi_open = PL_multi_close = '<';
6521 term = *PL_tokenbuf;
6522 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6523 char *bufptr = PL_sublex_info.super_bufptr;
6524 char *bufend = PL_sublex_info.super_bufend;
6525 char *olds = s - SvCUR(herewas);
6526 s = strchr(bufptr, '\n');
6530 while (s < bufend &&
6531 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6533 CopLINE_inc(PL_curcop);
6536 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6537 missingterm(PL_tokenbuf);
6539 sv_setpvn(herewas,bufptr,d-bufptr+1);
6540 sv_setpvn(tmpstr,d+1,s-d);
6542 sv_catpvn(herewas,s,bufend-s);
6543 (void)strcpy(bufptr,SvPVX(herewas));
6550 while (s < PL_bufend &&
6551 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6553 CopLINE_inc(PL_curcop);
6555 if (s >= PL_bufend) {
6556 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6557 missingterm(PL_tokenbuf);
6559 sv_setpvn(tmpstr,d+1,s-d);
6561 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6563 sv_catpvn(herewas,s,PL_bufend-s);
6564 sv_setsv(PL_linestr,herewas);
6565 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6566 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6567 PL_last_lop = PL_last_uni = Nullch;
6570 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6571 while (s >= PL_bufend) { /* multiple line string? */
6573 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6574 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6575 missingterm(PL_tokenbuf);
6577 CopLINE_inc(PL_curcop);
6578 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6579 PL_last_lop = PL_last_uni = Nullch;
6580 #ifndef PERL_STRICT_CR
6581 if (PL_bufend - PL_linestart >= 2) {
6582 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6583 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6585 PL_bufend[-2] = '\n';
6587 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6589 else if (PL_bufend[-1] == '\r')
6590 PL_bufend[-1] = '\n';
6592 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6593 PL_bufend[-1] = '\n';
6595 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6596 SV *sv = NEWSV(88,0);
6598 sv_upgrade(sv, SVt_PVMG);
6599 sv_setsv(sv,PL_linestr);
6602 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6604 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6607 sv_catsv(PL_linestr,herewas);
6608 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6612 sv_catsv(tmpstr,PL_linestr);
6617 PL_multi_end = CopLINE(PL_curcop);
6618 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6619 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6620 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6622 SvREFCNT_dec(herewas);
6623 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6625 PL_lex_stuff = tmpstr;
6626 yylval.ival = op_type;
6631 takes: current position in input buffer
6632 returns: new position in input buffer
6633 side-effects: yylval and lex_op are set.
6638 <FH> read from filehandle
6639 <pkg::FH> read from package qualified filehandle
6640 <pkg'FH> read from package qualified filehandle
6641 <$fh> read from filehandle in $fh
6647 S_scan_inputsymbol(pTHX_ char *start)
6649 register char *s = start; /* current position in buffer */
6655 d = PL_tokenbuf; /* start of temp holding space */
6656 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6657 end = strchr(s, '\n');
6660 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6662 /* die if we didn't have space for the contents of the <>,
6663 or if it didn't end, or if we see a newline
6666 if (len >= sizeof PL_tokenbuf)
6667 Perl_croak(aTHX_ "Excessively long <> operator");
6669 Perl_croak(aTHX_ "Unterminated <> operator");
6674 Remember, only scalar variables are interpreted as filehandles by
6675 this code. Anything more complex (e.g., <$fh{$num}>) will be
6676 treated as a glob() call.
6677 This code makes use of the fact that except for the $ at the front,
6678 a scalar variable and a filehandle look the same.
6680 if (*d == '$' && d[1]) d++;
6682 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6683 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6686 /* If we've tried to read what we allow filehandles to look like, and
6687 there's still text left, then it must be a glob() and not a getline.
6688 Use scan_str to pull out the stuff between the <> and treat it
6689 as nothing more than a string.
6692 if (d - PL_tokenbuf != len) {
6693 yylval.ival = OP_GLOB;
6695 s = scan_str(start,FALSE,FALSE);
6697 Perl_croak(aTHX_ "Glob not terminated");
6701 bool readline_overriden = FALSE;
6702 GV *gv_readline = Nullgv;
6704 /* we're in a filehandle read situation */
6707 /* turn <> into <ARGV> */
6709 (void)strcpy(d,"ARGV");
6711 /* Check whether readline() is overriden */
6712 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6713 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6715 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6716 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6717 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6718 readline_overriden = TRUE;
6720 /* if <$fh>, create the ops to turn the variable into a
6726 /* try to find it in the pad for this block, otherwise find
6727 add symbol table ops
6729 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6730 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
6731 if (SvFLAGS(namesv) & SVpad_OUR) {
6732 SV *sym = sv_2mortal(newSVpv(HvNAME(GvSTASH(namesv)),0));
6733 sv_catpvn(sym, "::", 2);
6739 OP *o = newOP(OP_PADSV, 0);
6741 PL_lex_op = readline_overriden
6742 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6743 append_elem(OP_LIST, o,
6744 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6745 : (OP*)newUNOP(OP_READLINE, 0, o);
6754 ? (GV_ADDMULTI | GV_ADDINEVAL)
6757 PL_lex_op = readline_overriden
6758 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6759 append_elem(OP_LIST,
6760 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6761 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6762 : (OP*)newUNOP(OP_READLINE, 0,
6763 newUNOP(OP_RV2SV, 0,
6764 newGVOP(OP_GV, 0, gv)));
6766 if (!readline_overriden)
6767 PL_lex_op->op_flags |= OPf_SPECIAL;
6768 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6769 yylval.ival = OP_NULL;
6772 /* If it's none of the above, it must be a literal filehandle
6773 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6775 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6776 PL_lex_op = readline_overriden
6777 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6778 append_elem(OP_LIST,
6779 newGVOP(OP_GV, 0, gv),
6780 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6781 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6782 yylval.ival = OP_NULL;
6791 takes: start position in buffer
6792 keep_quoted preserve \ on the embedded delimiter(s)
6793 keep_delims preserve the delimiters around the string
6794 returns: position to continue reading from buffer
6795 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6796 updates the read buffer.
6798 This subroutine pulls a string out of the input. It is called for:
6799 q single quotes q(literal text)
6800 ' single quotes 'literal text'
6801 qq double quotes qq(interpolate $here please)
6802 " double quotes "interpolate $here please"
6803 qx backticks qx(/bin/ls -l)
6804 ` backticks `/bin/ls -l`
6805 qw quote words @EXPORT_OK = qw( func() $spam )
6806 m// regexp match m/this/
6807 s/// regexp substitute s/this/that/
6808 tr/// string transliterate tr/this/that/
6809 y/// string transliterate y/this/that/
6810 ($*@) sub prototypes sub foo ($)
6811 (stuff) sub attr parameters sub foo : attr(stuff)
6812 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6814 In most of these cases (all but <>, patterns and transliterate)
6815 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6816 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6817 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6820 It skips whitespace before the string starts, and treats the first
6821 character as the delimiter. If the delimiter is one of ([{< then
6822 the corresponding "close" character )]}> is used as the closing
6823 delimiter. It allows quoting of delimiters, and if the string has
6824 balanced delimiters ([{<>}]) it allows nesting.
6826 On success, the SV with the resulting string is put into lex_stuff or,
6827 if that is already non-NULL, into lex_repl. The second case occurs only
6828 when parsing the RHS of the special constructs s/// and tr/// (y///).
6829 For convenience, the terminating delimiter character is stuffed into
6834 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6836 SV *sv; /* scalar value: string */
6837 char *tmps; /* temp string, used for delimiter matching */
6838 register char *s = start; /* current position in the buffer */
6839 register char term; /* terminating character */
6840 register char *to; /* current position in the sv's data */
6841 I32 brackets = 1; /* bracket nesting level */
6842 bool has_utf8 = FALSE; /* is there any utf8 content? */
6844 /* skip space before the delimiter */
6848 /* mark where we are, in case we need to report errors */
6851 /* after skipping whitespace, the next character is the terminator */
6853 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6856 /* mark where we are */
6857 PL_multi_start = CopLINE(PL_curcop);
6858 PL_multi_open = term;
6860 /* find corresponding closing delimiter */
6861 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6863 PL_multi_close = term;
6865 /* create a new SV to hold the contents. 87 is leak category, I'm
6866 assuming. 79 is the SV's initial length. What a random number. */
6868 sv_upgrade(sv, SVt_PVIV);
6870 (void)SvPOK_only(sv); /* validate pointer */
6872 /* move past delimiter and try to read a complete string */
6874 sv_catpvn(sv, s, 1);
6877 /* extend sv if need be */
6878 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6879 /* set 'to' to the next character in the sv's string */
6880 to = SvPVX(sv)+SvCUR(sv);
6882 /* if open delimiter is the close delimiter read unbridle */
6883 if (PL_multi_open == PL_multi_close) {
6884 for (; s < PL_bufend; s++,to++) {
6885 /* embedded newlines increment the current line number */
6886 if (*s == '\n' && !PL_rsfp)
6887 CopLINE_inc(PL_curcop);
6888 /* handle quoted delimiters */
6889 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6890 if (!keep_quoted && s[1] == term)
6892 /* any other quotes are simply copied straight through */
6896 /* terminate when run out of buffer (the for() condition), or
6897 have found the terminator */
6898 else if (*s == term)
6900 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6906 /* if the terminator isn't the same as the start character (e.g.,
6907 matched brackets), we have to allow more in the quoting, and
6908 be prepared for nested brackets.
6911 /* read until we run out of string, or we find the terminator */
6912 for (; s < PL_bufend; s++,to++) {
6913 /* embedded newlines increment the line count */
6914 if (*s == '\n' && !PL_rsfp)
6915 CopLINE_inc(PL_curcop);
6916 /* backslashes can escape the open or closing characters */
6917 if (*s == '\\' && s+1 < PL_bufend) {
6919 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6924 /* allow nested opens and closes */
6925 else if (*s == PL_multi_close && --brackets <= 0)
6927 else if (*s == PL_multi_open)
6929 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6934 /* terminate the copied string and update the sv's end-of-string */
6936 SvCUR_set(sv, to - SvPVX(sv));
6939 * this next chunk reads more into the buffer if we're not done yet
6943 break; /* handle case where we are done yet :-) */
6945 #ifndef PERL_STRICT_CR
6946 if (to - SvPVX(sv) >= 2) {
6947 if ((to[-2] == '\r' && to[-1] == '\n') ||
6948 (to[-2] == '\n' && to[-1] == '\r'))
6952 SvCUR_set(sv, to - SvPVX(sv));
6954 else if (to[-1] == '\r')
6957 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6961 /* if we're out of file, or a read fails, bail and reset the current
6962 line marker so we can report where the unterminated string began
6965 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6967 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6970 /* we read a line, so increment our line counter */
6971 CopLINE_inc(PL_curcop);
6973 /* update debugger info */
6974 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6975 SV *sv = NEWSV(88,0);
6977 sv_upgrade(sv, SVt_PVMG);
6978 sv_setsv(sv,PL_linestr);
6981 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6984 /* having changed the buffer, we must update PL_bufend */
6985 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6986 PL_last_lop = PL_last_uni = Nullch;
6989 /* at this point, we have successfully read the delimited string */
6992 sv_catpvn(sv, s, 1);
6995 PL_multi_end = CopLINE(PL_curcop);
6998 /* if we allocated too much space, give some back */
6999 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7000 SvLEN_set(sv, SvCUR(sv) + 1);
7001 Renew(SvPVX(sv), SvLEN(sv), char);
7004 /* decide whether this is the first or second quoted string we've read
7017 takes: pointer to position in buffer
7018 returns: pointer to new position in buffer
7019 side-effects: builds ops for the constant in yylval.op
7021 Read a number in any of the formats that Perl accepts:
7023 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7024 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7027 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7029 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7032 If it reads a number without a decimal point or an exponent, it will
7033 try converting the number to an integer and see if it can do so
7034 without loss of precision.
7038 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7040 register char *s = start; /* current position in buffer */
7041 register char *d; /* destination in temp buffer */
7042 register char *e; /* end of temp buffer */
7043 NV nv; /* number read, as a double */
7044 SV *sv = Nullsv; /* place to put the converted number */
7045 bool floatit; /* boolean: int or float? */
7046 char *lastub = 0; /* position of last underbar */
7047 static char number_too_long[] = "Number too long";
7049 /* We use the first character to decide what type of number this is */
7053 Perl_croak(aTHX_ "panic: scan_num");
7055 /* if it starts with a 0, it could be an octal number, a decimal in
7056 0.13 disguise, or a hexadecimal number, or a binary number. */
7060 u holds the "number so far"
7061 shift the power of 2 of the base
7062 (hex == 4, octal == 3, binary == 1)
7063 overflowed was the number more than we can hold?
7065 Shift is used when we add a digit. It also serves as an "are
7066 we in octal/hex/binary?" indicator to disallow hex characters
7072 bool overflowed = FALSE;
7073 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7074 static char* bases[5] = { "", "binary", "", "octal",
7076 static char* Bases[5] = { "", "Binary", "", "Octal",
7078 static char *maxima[5] = { "",
7079 "0b11111111111111111111111111111111",
7083 char *base, *Base, *max;
7089 } else if (s[1] == 'b') {
7093 /* check for a decimal in disguise */
7094 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7096 /* so it must be octal */
7103 if (ckWARN(WARN_SYNTAX))
7104 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7105 "Misplaced _ in number");
7109 base = bases[shift];
7110 Base = Bases[shift];
7111 max = maxima[shift];
7113 /* read the rest of the number */
7115 /* x is used in the overflow test,
7116 b is the digit we're adding on. */
7121 /* if we don't mention it, we're done */
7125 /* _ are ignored -- but warned about if consecutive */
7127 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7128 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7129 "Misplaced _ in number");
7133 /* 8 and 9 are not octal */
7136 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7140 case '2': case '3': case '4':
7141 case '5': case '6': case '7':
7143 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7147 b = *s++ & 15; /* ASCII digit -> value of digit */
7151 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7152 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7153 /* make sure they said 0x */
7158 /* Prepare to put the digit we have onto the end
7159 of the number so far. We check for overflows.
7164 x = u << shift; /* make room for the digit */
7166 if ((x >> shift) != u
7167 && !(PL_hints & HINT_NEW_BINARY)) {
7170 if (ckWARN_d(WARN_OVERFLOW))
7171 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7172 "Integer overflow in %s number",
7175 u = x | b; /* add the digit to the end */
7178 n *= nvshift[shift];
7179 /* If an NV has not enough bits in its
7180 * mantissa to represent an UV this summing of
7181 * small low-order numbers is a waste of time
7182 * (because the NV cannot preserve the
7183 * low-order bits anyway): we could just
7184 * remember when did we overflow and in the
7185 * end just multiply n by the right
7193 /* if we get here, we had success: make a scalar value from
7198 /* final misplaced underbar check */
7200 if (ckWARN(WARN_SYNTAX))
7201 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7206 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7207 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7208 "%s number > %s non-portable",
7214 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7215 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7216 "%s number > %s non-portable",
7221 if (PL_hints & HINT_NEW_BINARY)
7222 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7227 handle decimal numbers.
7228 we're also sent here when we read a 0 as the first digit
7230 case '1': case '2': case '3': case '4': case '5':
7231 case '6': case '7': case '8': case '9': case '.':
7234 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7237 /* read next group of digits and _ and copy into d */
7238 while (isDIGIT(*s) || *s == '_') {
7239 /* skip underscores, checking for misplaced ones
7243 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7244 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7245 "Misplaced _ in number");
7249 /* check for end of fixed-length buffer */
7251 Perl_croak(aTHX_ number_too_long);
7252 /* if we're ok, copy the character */
7257 /* final misplaced underbar check */
7258 if (lastub && s == lastub + 1) {
7259 if (ckWARN(WARN_SYNTAX))
7260 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7263 /* read a decimal portion if there is one. avoid
7264 3..5 being interpreted as the number 3. followed
7267 if (*s == '.' && s[1] != '.') {
7272 if (ckWARN(WARN_SYNTAX))
7273 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7274 "Misplaced _ in number");
7278 /* copy, ignoring underbars, until we run out of digits.
7280 for (; isDIGIT(*s) || *s == '_'; s++) {
7281 /* fixed length buffer check */
7283 Perl_croak(aTHX_ number_too_long);
7285 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7286 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7287 "Misplaced _ in number");
7293 /* fractional part ending in underbar? */
7295 if (ckWARN(WARN_SYNTAX))
7296 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7297 "Misplaced _ in number");
7299 if (*s == '.' && isDIGIT(s[1])) {
7300 /* oops, it's really a v-string, but without the "v" */
7306 /* read exponent part, if present */
7307 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7311 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7312 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7314 /* stray preinitial _ */
7316 if (ckWARN(WARN_SYNTAX))
7317 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7318 "Misplaced _ in number");
7322 /* allow positive or negative exponent */
7323 if (*s == '+' || *s == '-')
7326 /* stray initial _ */
7328 if (ckWARN(WARN_SYNTAX))
7329 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7330 "Misplaced _ in number");
7334 /* read digits of exponent */
7335 while (isDIGIT(*s) || *s == '_') {
7338 Perl_croak(aTHX_ number_too_long);
7342 if (ckWARN(WARN_SYNTAX) &&
7343 ((lastub && s == lastub + 1) ||
7344 (!isDIGIT(s[1]) && s[1] != '_')))
7345 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7346 "Misplaced _ in number");
7353 /* make an sv from the string */
7357 We try to do an integer conversion first if no characters
7358 indicating "float" have been found.
7363 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7365 if (flags == IS_NUMBER_IN_UV) {
7367 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7370 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7371 if (uv <= (UV) IV_MIN)
7372 sv_setiv(sv, -(IV)uv);
7379 /* terminate the string */
7381 nv = Atof(PL_tokenbuf);
7385 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7386 (PL_hints & HINT_NEW_INTEGER) )
7387 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7388 (floatit ? "float" : "integer"),
7392 /* if it starts with a v, it could be a v-string */
7395 sv = NEWSV(92,5); /* preallocate storage space */
7396 s = new_vstring(s,sv);
7400 /* make the op for the constant and return */
7403 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7405 lvalp->opval = Nullop;
7411 S_scan_formline(pTHX_ register char *s)
7415 SV *stuff = newSVpvn("",0);
7416 bool needargs = FALSE;
7419 if (*s == '.' || *s == /*{*/'}') {
7421 #ifdef PERL_STRICT_CR
7422 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7424 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7426 if (*t == '\n' || t == PL_bufend)
7429 if (PL_in_eval && !PL_rsfp) {
7430 eol = strchr(s,'\n');
7435 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7437 for (t = s; t < eol; t++) {
7438 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7440 goto enough; /* ~~ must be first line in formline */
7442 if (*t == '@' || *t == '^')
7446 sv_catpvn(stuff, s, eol-s);
7447 #ifndef PERL_STRICT_CR
7448 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7449 char *end = SvPVX(stuff) + SvCUR(stuff);
7461 s = filter_gets(PL_linestr, PL_rsfp, 0);
7462 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7463 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7464 PL_last_lop = PL_last_uni = Nullch;
7467 yyerror("Format not terminated");
7477 PL_lex_state = LEX_NORMAL;
7478 PL_nextval[PL_nexttoke].ival = 0;
7482 PL_lex_state = LEX_FORMLINE;
7483 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7485 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7489 SvREFCNT_dec(stuff);
7490 PL_lex_formbrack = 0;
7501 PL_cshlen = strlen(PL_cshname);
7506 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7508 I32 oldsavestack_ix = PL_savestack_ix;
7509 CV* outsidecv = PL_compcv;
7513 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7515 SAVEI32(PL_subline);
7516 save_item(PL_subname);
7519 SAVESPTR(PL_comppad_name);
7520 SAVESPTR(PL_compcv);
7521 SAVEI32(PL_comppad_name_fill);
7522 SAVEI32(PL_min_intro_pending);
7523 SAVEI32(PL_max_intro_pending);
7524 SAVEI32(PL_pad_reset_pending);
7526 PL_compcv = (CV*)NEWSV(1104,0);
7527 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7528 CvFLAGS(PL_compcv) |= flags;
7530 PL_comppad = newAV();
7531 av_push(PL_comppad, Nullsv);
7532 PL_curpad = AvARRAY(PL_comppad);
7533 PL_comppad_name = newAV();
7534 PL_comppad_name_fill = 0;
7535 PL_min_intro_pending = 0;
7537 PL_subline = CopLINE(PL_curcop);
7538 #ifdef USE_5005THREADS
7539 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7540 PL_curpad[0] = (SV*)newAV();
7541 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7542 #endif /* USE_5005THREADS */
7544 comppadlist = newAV();
7545 AvREAL_off(comppadlist);
7546 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7547 av_store(comppadlist, 1, (SV*)PL_comppad);
7549 CvPADLIST(PL_compcv) = comppadlist;
7550 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7551 #ifdef USE_5005THREADS
7552 CvOWNER(PL_compcv) = 0;
7553 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7554 MUTEX_INIT(CvMUTEXP(PL_compcv));
7555 #endif /* USE_5005THREADS */
7557 return oldsavestack_ix;
7561 #pragma segment Perl_yylex
7564 Perl_yywarn(pTHX_ char *s)
7566 PL_in_eval |= EVAL_WARNONLY;
7568 PL_in_eval &= ~EVAL_WARNONLY;
7573 Perl_yyerror(pTHX_ char *s)
7576 char *context = NULL;
7580 if (!yychar || (yychar == ';' && !PL_rsfp))
7582 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7583 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7586 The code below is removed for NetWare because it abends/crashes on NetWare
7587 when the script has error such as not having the closing quotes like:
7589 Checking of white spaces is anyway done in NetWare code.
7592 while (isSPACE(*PL_oldoldbufptr))
7595 context = PL_oldoldbufptr;
7596 contlen = PL_bufptr - PL_oldoldbufptr;
7598 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7599 PL_oldbufptr != PL_bufptr) {
7602 The code below is removed for NetWare because it abends/crashes on NetWare
7603 when the script has error such as not having the closing quotes like:
7605 Checking of white spaces is anyway done in NetWare code.
7608 while (isSPACE(*PL_oldbufptr))
7611 context = PL_oldbufptr;
7612 contlen = PL_bufptr - PL_oldbufptr;
7614 else if (yychar > 255)
7615 where = "next token ???";
7616 #ifdef USE_PURE_BISON
7617 /* GNU Bison sets the value -2 */
7618 else if (yychar == -2) {
7620 else if ((yychar & 127) == 127) {
7622 if (PL_lex_state == LEX_NORMAL ||
7623 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7624 where = "at end of line";
7625 else if (PL_lex_inpat)
7626 where = "within pattern";
7628 where = "within string";
7631 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7633 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7634 else if (isPRINT_LC(yychar))
7635 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7637 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7638 where = SvPVX(where_sv);
7640 msg = sv_2mortal(newSVpv(s, 0));
7641 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7642 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7644 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7646 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7647 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7648 Perl_sv_catpvf(aTHX_ msg,
7649 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7650 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7653 if (PL_in_eval & EVAL_WARNONLY)
7654 Perl_warn(aTHX_ "%"SVf, msg);
7657 if (PL_error_count >= 10) {
7658 if (PL_in_eval && SvCUR(ERRSV))
7659 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7660 ERRSV, OutCopFILE(PL_curcop));
7662 Perl_croak(aTHX_ "%s has too many errors.\n",
7663 OutCopFILE(PL_curcop));
7666 PL_in_my_stash = Nullhv;
7670 #pragma segment Main
7674 S_swallow_bom(pTHX_ U8 *s)
7677 slen = SvCUR(PL_linestr);
7681 /* UTF-16 little-endian */
7682 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7683 Perl_croak(aTHX_ "Unsupported script encoding");
7684 #ifndef PERL_NO_UTF16_FILTER
7685 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7687 if (PL_bufend > (char*)s) {
7691 filter_add(utf16rev_textfilter, NULL);
7692 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7693 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7694 PL_bufend - (char*)s - 1,
7696 Copy(news, s, newlen, U8);
7697 SvCUR_set(PL_linestr, newlen);
7698 PL_bufend = SvPVX(PL_linestr) + newlen;
7699 news[newlen++] = '\0';
7703 Perl_croak(aTHX_ "Unsupported script encoding");
7708 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7709 #ifndef PERL_NO_UTF16_FILTER
7710 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7712 if (PL_bufend > (char *)s) {
7716 filter_add(utf16_textfilter, NULL);
7717 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7718 PL_bufend = (char*)utf16_to_utf8(s, news,
7719 PL_bufend - (char*)s,
7721 Copy(news, s, newlen, U8);
7722 SvCUR_set(PL_linestr, newlen);
7723 PL_bufend = SvPVX(PL_linestr) + newlen;
7724 news[newlen++] = '\0';
7728 Perl_croak(aTHX_ "Unsupported script encoding");
7733 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7734 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7739 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7740 s[2] == 0xFE && s[3] == 0xFF)
7742 Perl_croak(aTHX_ "Unsupported script encoding");
7750 * Restore a source filter.
7754 restore_rsfp(pTHX_ void *f)
7756 PerlIO *fp = (PerlIO*)f;
7758 if (PL_rsfp == PerlIO_stdin())
7759 PerlIO_clearerr(PL_rsfp);
7760 else if (PL_rsfp && (PL_rsfp != fp))
7761 PerlIO_close(PL_rsfp);
7765 #ifndef PERL_NO_UTF16_FILTER
7767 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7769 I32 count = FILTER_READ(idx+1, sv, maxlen);
7774 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7775 if (!*SvPV_nolen(sv))
7776 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7779 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7780 sv_usepvn(sv, (char*)tmps, tend - tmps);
7786 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7788 I32 count = FILTER_READ(idx+1, sv, maxlen);
7793 if (!*SvPV_nolen(sv))
7794 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7797 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7798 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7799 sv_usepvn(sv, (char*)tmps, tend - tmps);