3 * Copyright (c) 1991-2001, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
30 static void restore_rsfp(pTHXo_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
39 #ifdef USE_UTF8_SCRIPTS
40 # define UTF (!IN_BYTES)
42 # ifdef EBCDIC /* For now 'use utf8' does not affect tokenizer on EBCDIC */
43 # define UTF (PL_linestr && DO_UTF8(PL_linestr))
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
49 /* In variables named $^X, these are the legal values for X.
50 * 1999-02-27 mjd-perl-patch@plover.com */
51 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
53 /* On MacOS, respect nonbreaking spaces */
54 #ifdef MACOS_TRADITIONAL
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
57 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
60 /* LEX_* are values for PL_lex_state, the state of the lexer.
61 * They are arranged oddly so that the guard on the switch statement
62 * can get by with a single comparison (if the compiler is smart enough).
65 /* #define LEX_NOTPARSING 11 is done in perl.h. */
68 #define LEX_INTERPNORMAL 9
69 #define LEX_INTERPCASEMOD 8
70 #define LEX_INTERPPUSH 7
71 #define LEX_INTERPSTART 6
72 #define LEX_INTERPEND 5
73 #define LEX_INTERPENDMAYBE 4
74 #define LEX_INTERPCONCAT 3
75 #define LEX_INTERPCONST 2
76 #define LEX_FORMLINE 1
77 #define LEX_KNOWNEXT 0
85 # define YYMAXLEVEL 100
87 YYSTYPE* yylval_pointer[YYMAXLEVEL];
88 int* yychar_pointer[YYMAXLEVEL];
92 # define yylval (*yylval_pointer[yyactlevel])
93 # define yychar (*yychar_pointer[yyactlevel])
94 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
96 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
101 /* CLINE is a macro that ensures PL_copline has a sane value */
106 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
109 * Convenience functions to return different tokens and prime the
110 * lexer for the next token. They all take an argument.
112 * TOKEN : generic token (used for '(', DOLSHARP, etc)
113 * OPERATOR : generic operator
114 * AOPERATOR : assignment operator
115 * PREBLOCK : beginning the block after an if, while, foreach, ...
116 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
117 * PREREF : *EXPR where EXPR is not a simple identifier
118 * TERM : expression term
119 * LOOPX : loop exiting command (goto, last, dump, etc)
120 * FTST : file test operator
121 * FUN0 : zero-argument function
122 * FUN1 : not used, except for not, which isn't a UNIOP
123 * BOop : bitwise or or xor
125 * SHop : shift operator
126 * PWop : power operator
127 * PMop : pattern-matching operator
128 * Aop : addition-level operator
129 * Mop : multiplication-level operator
130 * Eop : equality-testing operator
131 * Rop : relational operator <= != gt
133 * Also see LOP and lop() below.
136 /* Note that REPORT() and REPORT2() will be expressions that supply
137 * their own trailing comma, not suitable for statements as such. */
138 #ifdef DEBUGGING /* Serve -DT. */
139 # define REPORT(x,retval) tokereport(x,s,(int)retval),
140 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
142 # define REPORT(x,retval)
143 # define REPORT2(x,retval)
146 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
147 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
148 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
149 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
150 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
151 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
152 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
153 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
154 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
155 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
156 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
157 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
158 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
159 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
160 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
161 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
162 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
163 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
164 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
165 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
167 /* This bit of chicanery makes a unary function followed by
168 * a parenthesis into a function with one argument, highest precedence.
170 #define UNI(f) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
178 #define UNIBRACK(f) return(yylval.ival = f, \
181 PL_last_uni = PL_oldbufptr, \
182 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
184 /* grandfather return to old style */
185 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
190 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
193 SV* report = newSVpv(thing, 0);
194 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
197 if (s - PL_bufptr > 0)
198 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
200 if (PL_oldbufptr && *PL_oldbufptr)
201 sv_catpv(report, PL_tokenbuf);
203 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
212 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
213 * into an OP_ANDASSIGN or OP_ORASSIGN
217 S_ao(pTHX_ int toketype)
219 if (*PL_bufptr == '=') {
221 if (toketype == ANDAND)
222 yylval.ival = OP_ANDASSIGN;
223 else if (toketype == OROR)
224 yylval.ival = OP_ORASSIGN;
232 * When Perl expects an operator and finds something else, no_op
233 * prints the warning. It always prints "<something> found where
234 * operator expected. It prints "Missing semicolon on previous line?"
235 * if the surprise occurs at the start of the line. "do you need to
236 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
237 * where the compiler doesn't know if foo is a method call or a function.
238 * It prints "Missing operator before end of line" if there's nothing
239 * after the missing operator, or "... before <...>" if there is something
240 * after the missing operator.
244 S_no_op(pTHX_ char *what, char *s)
246 char *oldbp = PL_bufptr;
247 bool is_first = (PL_oldbufptr == PL_linestart);
253 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
255 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
256 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
258 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
259 if (t < PL_bufptr && isSPACE(*t))
260 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
261 t - PL_oldoldbufptr, PL_oldoldbufptr);
265 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
272 * Complain about missing quote/regexp/heredoc terminator.
273 * If it's called with (char *)NULL then it cauterizes the line buffer.
274 * If we're in a delimited string and the delimiter is a control
275 * character, it's reformatted into a two-char sequence like ^C.
280 S_missingterm(pTHX_ char *s)
285 char *nl = strrchr(s,'\n');
291 iscntrl(PL_multi_close)
293 PL_multi_close < 32 || PL_multi_close == 127
297 tmpbuf[1] = toCTRL(PL_multi_close);
303 *tmpbuf = PL_multi_close;
307 q = strchr(s,'"') ? '\'' : '"';
308 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
316 Perl_deprecate(pTHX_ char *s)
318 if (ckWARN(WARN_DEPRECATED))
319 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
324 * Deprecate a comma-less variable list.
330 deprecate("comma-less variable list");
334 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
335 * utf16-to-utf8-reversed.
338 #ifdef PERL_CR_FILTER
342 register char *s = SvPVX(sv);
343 register char *e = s + SvCUR(sv);
344 /* outer loop optimized to do nothing if there are no CR-LFs */
346 if (*s++ == '\r' && *s == '\n') {
347 /* hit a CR-LF, need to copy the rest */
348 register char *d = s - 1;
351 if (*s == '\r' && s[1] == '\n')
362 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
364 I32 count = FILTER_READ(idx+1, sv, maxlen);
365 if (count > 0 && !maxlen)
373 * Initialize variables. Uses the Perl save_stack to save its state (for
374 * recursive calls to the parser).
378 Perl_lex_start(pTHX_ SV *line)
383 SAVEI32(PL_lex_dojoin);
384 SAVEI32(PL_lex_brackets);
385 SAVEI32(PL_lex_casemods);
386 SAVEI32(PL_lex_starts);
387 SAVEI32(PL_lex_state);
388 SAVEVPTR(PL_lex_inpat);
389 SAVEI32(PL_lex_inwhat);
390 if (PL_lex_state == LEX_KNOWNEXT) {
391 I32 toke = PL_nexttoke;
392 while (--toke >= 0) {
393 SAVEI32(PL_nexttype[toke]);
394 SAVEVPTR(PL_nextval[toke]);
396 SAVEI32(PL_nexttoke);
398 SAVECOPLINE(PL_curcop);
401 SAVEPPTR(PL_oldbufptr);
402 SAVEPPTR(PL_oldoldbufptr);
403 SAVEPPTR(PL_last_lop);
404 SAVEPPTR(PL_last_uni);
405 SAVEPPTR(PL_linestart);
406 SAVESPTR(PL_linestr);
407 SAVEPPTR(PL_lex_brackstack);
408 SAVEPPTR(PL_lex_casestack);
409 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
410 SAVESPTR(PL_lex_stuff);
411 SAVEI32(PL_lex_defer);
412 SAVEI32(PL_sublex_info.sub_inwhat);
413 SAVESPTR(PL_lex_repl);
415 SAVEINT(PL_lex_expect);
417 PL_lex_state = LEX_NORMAL;
421 New(899, PL_lex_brackstack, 120, char);
422 New(899, PL_lex_casestack, 12, char);
423 SAVEFREEPV(PL_lex_brackstack);
424 SAVEFREEPV(PL_lex_casestack);
426 *PL_lex_casestack = '\0';
429 PL_lex_stuff = Nullsv;
430 PL_lex_repl = Nullsv;
434 PL_sublex_info.sub_inwhat = 0;
436 if (SvREADONLY(PL_linestr))
437 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
438 s = SvPV(PL_linestr, len);
439 if (len && s[len-1] != ';') {
440 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
441 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
442 sv_catpvn(PL_linestr, "\n;", 2);
444 SvTEMP_off(PL_linestr);
445 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
446 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
447 PL_last_lop = PL_last_uni = Nullch;
449 PL_rs = newSVpvn("\n", 1);
455 * Finalizer for lexing operations. Must be called when the parser is
456 * done with the lexer.
462 PL_doextract = FALSE;
467 * This subroutine has nothing to do with tilting, whether at windmills
468 * or pinball tables. Its name is short for "increment line". It
469 * increments the current line number in CopLINE(PL_curcop) and checks
470 * to see whether the line starts with a comment of the form
471 * # line 500 "foo.pm"
472 * If so, it sets the current line number and file to the values in the comment.
476 S_incline(pTHX_ char *s)
483 CopLINE_inc(PL_curcop);
486 while (SPACE_OR_TAB(*s)) s++;
487 if (strnEQ(s, "line", 4))
491 if (SPACE_OR_TAB(*s))
495 while (SPACE_OR_TAB(*s)) s++;
501 while (SPACE_OR_TAB(*s))
503 if (*s == '"' && (t = strchr(s+1, '"'))) {
508 for (t = s; !isSPACE(*t); t++) ;
511 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
513 if (*e != '\n' && *e != '\0')
514 return; /* false alarm */
520 Safefree(CopFILE(PL_curcop));
522 SvREFCNT_dec(CopFILEGV(PL_curcop));
524 CopFILE_set(PL_curcop, s);
527 CopLINE_set(PL_curcop, atoi(n)-1);
532 * Called to gobble the appropriate amount and type of whitespace.
533 * Skips comments as well.
537 S_skipspace(pTHX_ register char *s)
539 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
540 while (s < PL_bufend && SPACE_OR_TAB(*s))
546 SSize_t oldprevlen, oldoldprevlen;
547 SSize_t oldloplen = 0, oldunilen = 0;
548 while (s < PL_bufend && isSPACE(*s)) {
549 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
554 if (s < PL_bufend && *s == '#') {
555 while (s < PL_bufend && *s != '\n')
559 if (PL_in_eval && !PL_rsfp) {
566 /* only continue to recharge the buffer if we're at the end
567 * of the buffer, we're not reading from a source filter, and
568 * we're in normal lexing mode
570 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
571 PL_lex_state == LEX_FORMLINE)
574 /* try to recharge the buffer */
575 if ((s = filter_gets(PL_linestr, PL_rsfp,
576 (prevlen = SvCUR(PL_linestr)))) == Nullch)
578 /* end of file. Add on the -p or -n magic */
579 if (PL_minus_n || PL_minus_p) {
580 sv_setpv(PL_linestr,PL_minus_p ?
581 ";}continue{print or die qq(-p destination: $!\\n)" :
583 sv_catpv(PL_linestr,";}");
584 PL_minus_n = PL_minus_p = 0;
587 sv_setpv(PL_linestr,";");
589 /* reset variables for next time we lex */
590 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
592 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
593 PL_last_lop = PL_last_uni = Nullch;
595 /* Close the filehandle. Could be from -P preprocessor,
596 * STDIN, or a regular file. If we were reading code from
597 * STDIN (because the commandline held no -e or filename)
598 * then we don't close it, we reset it so the code can
599 * read from STDIN too.
602 if (PL_preprocess && !PL_in_eval)
603 (void)PerlProc_pclose(PL_rsfp);
604 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
605 PerlIO_clearerr(PL_rsfp);
607 (void)PerlIO_close(PL_rsfp);
612 /* not at end of file, so we only read another line */
613 /* make corresponding updates to old pointers, for yyerror() */
614 oldprevlen = PL_oldbufptr - PL_bufend;
615 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
617 oldunilen = PL_last_uni - PL_bufend;
619 oldloplen = PL_last_lop - PL_bufend;
620 PL_linestart = PL_bufptr = s + prevlen;
621 PL_bufend = s + SvCUR(PL_linestr);
623 PL_oldbufptr = s + oldprevlen;
624 PL_oldoldbufptr = s + oldoldprevlen;
626 PL_last_uni = s + oldunilen;
628 PL_last_lop = s + oldloplen;
631 /* debugger active and we're not compiling the debugger code,
632 * so store the line into the debugger's array of lines
634 if (PERLDB_LINE && PL_curstash != PL_debstash) {
635 SV *sv = NEWSV(85,0);
637 sv_upgrade(sv, SVt_PVMG);
638 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
639 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
646 * Check the unary operators to ensure there's no ambiguity in how they're
647 * used. An ambiguous piece of code would be:
649 * This doesn't mean rand() + 5. Because rand() is a unary operator,
650 * the +5 is its argument.
659 if (PL_oldoldbufptr != PL_last_uni)
661 while (isSPACE(*PL_last_uni))
663 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
664 if ((t = strchr(s, '(')) && t < PL_bufptr)
666 if (ckWARN_d(WARN_AMBIGUOUS)){
669 Perl_warner(aTHX_ WARN_AMBIGUOUS,
670 "Warning: Use of \"%s\" without parens is ambiguous",
676 /* workaround to replace the UNI() macro with a function. Only the
677 * hints/uts.sh file mentions this. Other comments elsewhere in the
678 * source indicate Microport Unix might need it too.
684 #define UNI(f) return uni(f,s)
687 S_uni(pTHX_ I32 f, char *s)
692 PL_last_uni = PL_oldbufptr;
703 #endif /* CRIPPLED_CC */
706 * LOP : macro to build a list operator. Its behaviour has been replaced
707 * with a subroutine, S_lop() for which LOP is just another name.
710 #define LOP(f,x) return lop(f,x,s)
714 * Build a list operator (or something that might be one). The rules:
715 * - if we have a next token, then it's a list operator [why?]
716 * - if the next thing is an opening paren, then it's a function
717 * - else it's a list operator
721 S_lop(pTHX_ I32 f, int x, char *s)
728 PL_last_lop = PL_oldbufptr;
743 * When the lexer realizes it knows the next token (for instance,
744 * it is reordering tokens for the parser) then it can call S_force_next
745 * to know what token to return the next time the lexer is called. Caller
746 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
747 * handles the token correctly.
751 S_force_next(pTHX_ I32 type)
753 PL_nexttype[PL_nexttoke] = type;
755 if (PL_lex_state != LEX_KNOWNEXT) {
756 PL_lex_defer = PL_lex_state;
757 PL_lex_expect = PL_expect;
758 PL_lex_state = LEX_KNOWNEXT;
764 * When the lexer knows the next thing is a word (for instance, it has
765 * just seen -> and it knows that the next char is a word char, then
766 * it calls S_force_word to stick the next word into the PL_next lookahead.
769 * char *start : buffer position (must be within PL_linestr)
770 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
771 * int check_keyword : if true, Perl checks to make sure the word isn't
772 * a keyword (do this if the word is a label, e.g. goto FOO)
773 * int allow_pack : if true, : characters will also be allowed (require,
775 * int allow_initial_tick : used by the "sub" lexer only.
779 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
784 start = skipspace(start);
786 if (isIDFIRST_lazy_if(s,UTF) ||
787 (allow_pack && *s == ':') ||
788 (allow_initial_tick && *s == '\'') )
790 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
791 if (check_keyword && keyword(PL_tokenbuf, len))
793 if (token == METHOD) {
798 PL_expect = XOPERATOR;
801 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
802 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
810 * Called when the lexer wants $foo *foo &foo etc, but the program
811 * text only contains the "foo" portion. The first argument is a pointer
812 * to the "foo", and the second argument is the type symbol to prefix.
813 * Forces the next token to be a "WORD".
814 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
818 S_force_ident(pTHX_ register char *s, int kind)
821 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
822 PL_nextval[PL_nexttoke].opval = o;
825 o->op_private = OPpCONST_ENTERED;
826 /* XXX see note in pp_entereval() for why we forgo typo
827 warnings if the symbol must be introduced in an eval.
829 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
830 kind == '$' ? SVt_PV :
831 kind == '@' ? SVt_PVAV :
832 kind == '%' ? SVt_PVHV :
840 Perl_str_to_version(pTHX_ SV *sv)
845 char *start = SvPVx(sv,len);
846 bool utf = SvUTF8(sv) ? TRUE : FALSE;
847 char *end = start + len;
848 while (start < end) {
852 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
857 retval += ((NV)n)/nshift;
866 * Forces the next token to be a version number.
870 S_force_version(pTHX_ char *s)
872 OP *version = Nullop;
881 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
882 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
884 s = scan_num(s, &yylval);
885 version = yylval.opval;
886 ver = cSVOPx(version)->op_sv;
887 if (SvPOK(ver) && !SvNIOK(ver)) {
888 (void)SvUPGRADE(ver, SVt_PVNV);
889 SvNVX(ver) = str_to_version(ver);
890 SvNOK_on(ver); /* hint that it is a version */
895 /* NOTE: The parser sees the package name and the VERSION swapped */
896 PL_nextval[PL_nexttoke].opval = version;
904 * Tokenize a quoted string passed in as an SV. It finds the next
905 * chunk, up to end of string or a backslash. It may make a new
906 * SV containing that chunk (if HINT_NEW_STRING is on). It also
911 S_tokeq(pTHX_ SV *sv)
922 s = SvPV_force(sv, len);
923 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
926 while (s < send && *s != '\\')
931 if ( PL_hints & HINT_NEW_STRING ) {
932 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
938 if (s + 1 < send && (s[1] == '\\'))
939 s++; /* all that, just for this */
944 SvCUR_set(sv, d - SvPVX(sv));
946 if ( PL_hints & HINT_NEW_STRING )
947 return new_constant(NULL, 0, "q", sv, pv, "q");
952 * Now come three functions related to double-quote context,
953 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
954 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
955 * interact with PL_lex_state, and create fake ( ... ) argument lists
956 * to handle functions and concatenation.
957 * They assume that whoever calls them will be setting up a fake
958 * join call, because each subthing puts a ',' after it. This lets
961 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
963 * (I'm not sure whether the spurious commas at the end of lcfirst's
964 * arguments and join's arguments are created or not).
969 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
971 * Pattern matching will set PL_lex_op to the pattern-matching op to
972 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
974 * OP_CONST and OP_READLINE are easy--just make the new op and return.
976 * Everything else becomes a FUNC.
978 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
979 * had an OP_CONST or OP_READLINE). This just sets us up for a
980 * call to S_sublex_push().
986 register I32 op_type = yylval.ival;
988 if (op_type == OP_NULL) {
989 yylval.opval = PL_lex_op;
993 if (op_type == OP_CONST || op_type == OP_READLINE) {
994 SV *sv = tokeq(PL_lex_stuff);
996 if (SvTYPE(sv) == SVt_PVIV) {
997 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1003 nsv = newSVpvn(p, len);
1009 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1010 PL_lex_stuff = Nullsv;
1014 PL_sublex_info.super_state = PL_lex_state;
1015 PL_sublex_info.sub_inwhat = op_type;
1016 PL_sublex_info.sub_op = PL_lex_op;
1017 PL_lex_state = LEX_INTERPPUSH;
1021 yylval.opval = PL_lex_op;
1031 * Create a new scope to save the lexing state. The scope will be
1032 * ended in S_sublex_done. Returns a '(', starting the function arguments
1033 * to the uc, lc, etc. found before.
1034 * Sets PL_lex_state to LEX_INTERPCONCAT.
1042 PL_lex_state = PL_sublex_info.super_state;
1043 SAVEI32(PL_lex_dojoin);
1044 SAVEI32(PL_lex_brackets);
1045 SAVEI32(PL_lex_casemods);
1046 SAVEI32(PL_lex_starts);
1047 SAVEI32(PL_lex_state);
1048 SAVEVPTR(PL_lex_inpat);
1049 SAVEI32(PL_lex_inwhat);
1050 SAVECOPLINE(PL_curcop);
1051 SAVEPPTR(PL_bufptr);
1052 SAVEPPTR(PL_bufend);
1053 SAVEPPTR(PL_oldbufptr);
1054 SAVEPPTR(PL_oldoldbufptr);
1055 SAVEPPTR(PL_last_lop);
1056 SAVEPPTR(PL_last_uni);
1057 SAVEPPTR(PL_linestart);
1058 SAVESPTR(PL_linestr);
1059 SAVEPPTR(PL_lex_brackstack);
1060 SAVEPPTR(PL_lex_casestack);
1062 PL_linestr = PL_lex_stuff;
1063 PL_lex_stuff = Nullsv;
1065 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1066 = SvPVX(PL_linestr);
1067 PL_bufend += SvCUR(PL_linestr);
1068 PL_last_lop = PL_last_uni = Nullch;
1069 SAVEFREESV(PL_linestr);
1071 PL_lex_dojoin = FALSE;
1072 PL_lex_brackets = 0;
1073 New(899, PL_lex_brackstack, 120, char);
1074 New(899, PL_lex_casestack, 12, char);
1075 SAVEFREEPV(PL_lex_brackstack);
1076 SAVEFREEPV(PL_lex_casestack);
1077 PL_lex_casemods = 0;
1078 *PL_lex_casestack = '\0';
1080 PL_lex_state = LEX_INTERPCONCAT;
1081 CopLINE_set(PL_curcop, PL_multi_start);
1083 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1084 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1085 PL_lex_inpat = PL_sublex_info.sub_op;
1087 PL_lex_inpat = Nullop;
1094 * Restores lexer state after a S_sublex_push.
1100 if (!PL_lex_starts++) {
1101 SV *sv = newSVpvn("",0);
1102 if (SvUTF8(PL_linestr))
1104 PL_expect = XOPERATOR;
1105 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1109 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1110 PL_lex_state = LEX_INTERPCASEMOD;
1114 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1115 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1116 PL_linestr = PL_lex_repl;
1118 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1119 PL_bufend += SvCUR(PL_linestr);
1120 PL_last_lop = PL_last_uni = Nullch;
1121 SAVEFREESV(PL_linestr);
1122 PL_lex_dojoin = FALSE;
1123 PL_lex_brackets = 0;
1124 PL_lex_casemods = 0;
1125 *PL_lex_casestack = '\0';
1127 if (SvEVALED(PL_lex_repl)) {
1128 PL_lex_state = LEX_INTERPNORMAL;
1130 /* we don't clear PL_lex_repl here, so that we can check later
1131 whether this is an evalled subst; that means we rely on the
1132 logic to ensure sublex_done() is called again only via the
1133 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1136 PL_lex_state = LEX_INTERPCONCAT;
1137 PL_lex_repl = Nullsv;
1143 PL_bufend = SvPVX(PL_linestr);
1144 PL_bufend += SvCUR(PL_linestr);
1145 PL_expect = XOPERATOR;
1146 PL_sublex_info.sub_inwhat = 0;
1154 Extracts a pattern, double-quoted string, or transliteration. This
1157 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1158 processing a pattern (PL_lex_inpat is true), a transliteration
1159 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1161 Returns a pointer to the character scanned up to. Iff this is
1162 advanced from the start pointer supplied (ie if anything was
1163 successfully parsed), will leave an OP for the substring scanned
1164 in yylval. Caller must intuit reason for not parsing further
1165 by looking at the next characters herself.
1169 double-quoted style: \r and \n
1170 regexp special ones: \D \s
1172 backrefs: \1 (deprecated in substitution replacements)
1173 case and quoting: \U \Q \E
1174 stops on @ and $, but not for $ as tail anchor
1176 In transliterations:
1177 characters are VERY literal, except for - not at the start or end
1178 of the string, which indicates a range. scan_const expands the
1179 range to the full set of intermediate characters.
1181 In double-quoted strings:
1183 double-quoted style: \r and \n
1185 backrefs: \1 (deprecated)
1186 case and quoting: \U \Q \E
1189 scan_const does *not* construct ops to handle interpolated strings.
1190 It stops processing as soon as it finds an embedded $ or @ variable
1191 and leaves it to the caller to work out what's going on.
1193 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1195 $ in pattern could be $foo or could be tail anchor. Assumption:
1196 it's a tail anchor if $ is the last thing in the string, or if it's
1197 followed by one of ")| \n\t"
1199 \1 (backreferences) are turned into $1
1201 The structure of the code is
1202 while (there's a character to process) {
1203 handle transliteration ranges
1204 skip regexp comments
1205 skip # initiated comments in //x patterns
1206 check for embedded @foo
1207 check for embedded scalars
1209 leave intact backslashes from leave (below)
1210 deprecate \1 in strings and sub replacements
1211 handle string-changing backslashes \l \U \Q \E, etc.
1212 switch (what was escaped) {
1213 handle - in a transliteration (becomes a literal -)
1214 handle \132 octal characters
1215 handle 0x15 hex characters
1216 handle \cV (control V)
1217 handle printf backslashes (\f, \r, \n, etc)
1219 } (end if backslash)
1220 } (end while character to read)
1225 S_scan_const(pTHX_ char *start)
1227 register char *send = PL_bufend; /* end of the constant */
1228 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1229 register char *s = start; /* start of the constant */
1230 register char *d = SvPVX(sv); /* destination for copies */
1231 bool dorange = FALSE; /* are we in a translit range? */
1232 bool didrange = FALSE; /* did we just finish a range? */
1233 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1234 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1237 const char *leaveit = /* set of acceptably-backslashed characters */
1239 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1242 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1243 /* If we are doing a trans and we know we want UTF8 set expectation */
1244 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1245 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1249 while (s < send || dorange) {
1250 /* get transliterations out of the way (they're most literal) */
1251 if (PL_lex_inwhat == OP_TRANS) {
1252 /* expand a range A-Z to the full set of characters. AIE! */
1254 I32 i; /* current expanded character */
1255 I32 min; /* first character in range */
1256 I32 max; /* last character in range */
1259 char *c = (char*)utf8_hop((U8*)d, -1);
1263 *c = (char)UTF_TO_NATIVE(0xff);
1264 /* mark the range as done, and continue */
1270 i = d - SvPVX(sv); /* remember current offset */
1271 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1272 d = SvPVX(sv) + i; /* refresh d after realloc */
1273 d -= 2; /* eat the first char and the - */
1275 min = (U8)*d; /* first char in range */
1276 max = (U8)d[1]; /* last char in range */
1280 "Invalid [] range \"%c-%c\" in transliteration operator",
1281 (char)min, (char)max);
1285 if ((isLOWER(min) && isLOWER(max)) ||
1286 (isUPPER(min) && isUPPER(max))) {
1288 for (i = min; i <= max; i++)
1290 *d++ = NATIVE_TO_NEED(has_utf8,i);
1292 for (i = min; i <= max; i++)
1294 *d++ = NATIVE_TO_NEED(has_utf8,i);
1299 for (i = min; i <= max; i++)
1302 /* mark the range as done, and continue */
1308 /* range begins (ignore - as first or last char) */
1309 else if (*s == '-' && s+1 < send && s != start) {
1311 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1314 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1326 /* if we get here, we're not doing a transliteration */
1328 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1329 except for the last char, which will be done separately. */
1330 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1332 while (s < send && *s != ')')
1333 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1335 else if (s[2] == '{' /* This should match regcomp.c */
1336 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1339 char *regparse = s + (s[2] == '{' ? 3 : 4);
1342 while (count && (c = *regparse)) {
1343 if (c == '\\' && regparse[1])
1351 if (*regparse != ')') {
1352 regparse--; /* Leave one char for continuation. */
1353 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1355 while (s < regparse)
1356 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1360 /* likewise skip #-initiated comments in //x patterns */
1361 else if (*s == '#' && PL_lex_inpat &&
1362 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1363 while (s+1 < send && *s != '\n')
1364 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1367 /* check for embedded arrays
1368 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1370 else if (*s == '@' && s[1]
1371 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1374 /* check for embedded scalars. only stop if we're sure it's a
1377 else if (*s == '$') {
1378 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1380 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1381 break; /* in regexp, $ might be tail anchor */
1384 /* End of else if chain - OP_TRANS rejoin rest */
1387 if (*s == '\\' && s+1 < send) {
1390 /* some backslashes we leave behind */
1391 if (*leaveit && *s && strchr(leaveit, *s)) {
1392 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1393 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1397 /* deprecate \1 in strings and substitution replacements */
1398 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1399 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1401 if (ckWARN(WARN_SYNTAX))
1402 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1407 /* string-change backslash escapes */
1408 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1413 /* if we get here, it's either a quoted -, or a digit */
1416 /* quoted - in transliterations */
1418 if (PL_lex_inwhat == OP_TRANS) {
1425 if (ckWARN(WARN_MISC) && isALNUM(*s))
1426 Perl_warner(aTHX_ WARN_MISC,
1427 "Unrecognized escape \\%c passed through",
1429 /* default action is to copy the quoted character */
1430 goto default_action;
1433 /* \132 indicates an octal constant */
1434 case '0': case '1': case '2': case '3':
1435 case '4': case '5': case '6': case '7':
1437 STRLEN len = 0; /* disallow underscores */
1438 uv = (UV)scan_oct(s, 3, &len);
1441 goto NUM_ESCAPE_INSERT;
1443 /* \x24 indicates a hex constant */
1447 char* e = strchr(s, '}');
1448 STRLEN len = 1; /* allow underscores */
1451 yyerror("Missing right brace on \\x{}");
1455 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1460 STRLEN len = 0; /* disallow underscores */
1461 uv = (UV)scan_hex(s, 2, &len);
1467 /* Insert oct or hex escaped character.
1468 * There will always enough room in sv since such
1469 * escapes will be longer than any UTF-8 sequence
1470 * they can end up as. */
1472 /* We need to map to chars to ASCII before doing the tests
1475 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1476 if (!has_utf8 && uv > 255) {
1477 /* Might need to recode whatever we have
1478 * accumulated so far if it contains any
1481 * (Can't we keep track of that and avoid
1482 * this rescan? --jhi)
1486 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1487 if (!NATIVE_IS_INVARIANT(*c)) {
1492 STRLEN offset = d - SvPVX(sv);
1494 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1498 while (src >= (U8 *)SvPVX(sv)) {
1499 if (!NATIVE_IS_INVARIANT(*src)) {
1500 U8 ch = NATIVE_TO_ASCII(*src);
1501 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1502 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1512 if (has_utf8 || uv > 255) {
1513 d = (char*)uvchr_to_utf8((U8*)d, uv);
1515 if (PL_lex_inwhat == OP_TRANS &&
1516 PL_sublex_info.sub_op) {
1517 PL_sublex_info.sub_op->op_private |=
1518 (PL_lex_repl ? OPpTRANS_FROM_UTF
1531 /* \N{latin small letter a} is a named character */
1535 char* e = strchr(s, '}');
1541 yyerror("Missing right brace on \\N{}");
1545 res = newSVpvn(s + 1, e - s - 1);
1546 res = new_constant( Nullch, 0, "charnames",
1547 res, Nullsv, "\\N{...}" );
1549 sv_utf8_upgrade(res);
1550 str = SvPV(res,len);
1551 if (!has_utf8 && SvUTF8(res)) {
1552 char *ostart = SvPVX(sv);
1553 SvCUR_set(sv, d - ostart);
1556 sv_utf8_upgrade(sv);
1557 /* this just broke our allocation above... */
1558 SvGROW(sv, send - start);
1559 d = SvPVX(sv) + SvCUR(sv);
1562 if (len > e - s + 4) {
1563 char *odest = SvPVX(sv);
1565 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1566 d = SvPVX(sv) + (d - odest);
1568 Copy(str, d, len, char);
1575 yyerror("Missing braces on \\N{}");
1578 /* \c is a control character */
1587 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1591 /* printf-style backslashes, formfeeds, newlines, etc */
1593 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1596 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1599 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1602 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1605 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1608 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1611 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1617 } /* end if (backslash) */
1620 /* If we started with encoded form, or already know we want it
1621 and then encode the next character */
1622 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1624 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1625 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1628 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1629 STRLEN off = d - SvPVX(sv);
1630 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1632 d = (char*)uvchr_to_utf8((U8*)d, uv);
1636 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1638 } /* while loop to process each character */
1640 /* terminate the string and set up the sv */
1642 SvCUR_set(sv, d - SvPVX(sv));
1643 if (SvCUR(sv) >= SvLEN(sv))
1644 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1649 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1650 PL_sublex_info.sub_op->op_private |=
1651 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1655 /* shrink the sv if we allocated more than we used */
1656 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1657 SvLEN_set(sv, SvCUR(sv) + 1);
1658 Renew(SvPVX(sv), SvLEN(sv), char);
1661 /* return the substring (via yylval) only if we parsed anything */
1662 if (s > PL_bufptr) {
1663 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1664 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1666 ( PL_lex_inwhat == OP_TRANS
1668 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1671 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1678 * Returns TRUE if there's more to the expression (e.g., a subscript),
1681 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1683 * ->[ and ->{ return TRUE
1684 * { and [ outside a pattern are always subscripts, so return TRUE
1685 * if we're outside a pattern and it's not { or [, then return FALSE
1686 * if we're in a pattern and the first char is a {
1687 * {4,5} (any digits around the comma) returns FALSE
1688 * if we're in a pattern and the first char is a [
1690 * [SOMETHING] has a funky algorithm to decide whether it's a
1691 * character class or not. It has to deal with things like
1692 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1693 * anything else returns TRUE
1696 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1699 S_intuit_more(pTHX_ register char *s)
1701 if (PL_lex_brackets)
1703 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1705 if (*s != '{' && *s != '[')
1710 /* In a pattern, so maybe we have {n,m}. */
1727 /* On the other hand, maybe we have a character class */
1730 if (*s == ']' || *s == '^')
1733 /* this is terrifying, and it works */
1734 int weight = 2; /* let's weigh the evidence */
1736 unsigned char un_char = 255, last_un_char;
1737 char *send = strchr(s,']');
1738 char tmpbuf[sizeof PL_tokenbuf * 4];
1740 if (!send) /* has to be an expression */
1743 Zero(seen,256,char);
1746 else if (isDIGIT(*s)) {
1748 if (isDIGIT(s[1]) && s[2] == ']')
1754 for (; s < send; s++) {
1755 last_un_char = un_char;
1756 un_char = (unsigned char)*s;
1761 weight -= seen[un_char] * 10;
1762 if (isALNUM_lazy_if(s+1,UTF)) {
1763 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1764 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1769 else if (*s == '$' && s[1] &&
1770 strchr("[#!%*<>()-=",s[1])) {
1771 if (/*{*/ strchr("])} =",s[2]))
1780 if (strchr("wds]",s[1]))
1782 else if (seen['\''] || seen['"'])
1784 else if (strchr("rnftbxcav",s[1]))
1786 else if (isDIGIT(s[1])) {
1788 while (s[1] && isDIGIT(s[1]))
1798 if (strchr("aA01! ",last_un_char))
1800 if (strchr("zZ79~",s[1]))
1802 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1803 weight -= 5; /* cope with negative subscript */
1806 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1807 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1812 if (keyword(tmpbuf, d - tmpbuf))
1815 if (un_char == last_un_char + 1)
1817 weight -= seen[un_char];
1822 if (weight >= 0) /* probably a character class */
1832 * Does all the checking to disambiguate
1834 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1835 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1837 * First argument is the stuff after the first token, e.g. "bar".
1839 * Not a method if bar is a filehandle.
1840 * Not a method if foo is a subroutine prototyped to take a filehandle.
1841 * Not a method if it's really "Foo $bar"
1842 * Method if it's "foo $bar"
1843 * Not a method if it's really "print foo $bar"
1844 * Method if it's really "foo package::" (interpreted as package->foo)
1845 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1846 * Not a method if bar is a filehandle or package, but is quoted with
1851 S_intuit_method(pTHX_ char *start, GV *gv)
1853 char *s = start + (*start == '$');
1854 char tmpbuf[sizeof PL_tokenbuf];
1862 if ((cv = GvCVu(gv))) {
1863 char *proto = SvPVX(cv);
1873 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1874 /* start is the beginning of the possible filehandle/object,
1875 * and s is the end of it
1876 * tmpbuf is a copy of it
1879 if (*start == '$') {
1880 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1885 return *s == '(' ? FUNCMETH : METHOD;
1887 if (!keyword(tmpbuf, len)) {
1888 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1893 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1894 if (indirgv && GvCVu(indirgv))
1896 /* filehandle or package name makes it a method */
1897 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1899 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1900 return 0; /* no assumptions -- "=>" quotes bearword */
1902 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1903 newSVpvn(tmpbuf,len));
1904 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1908 return *s == '(' ? FUNCMETH : METHOD;
1916 * Return a string of Perl code to load the debugger. If PERL5DB
1917 * is set, it will return the contents of that, otherwise a
1918 * compile-time require of perl5db.pl.
1925 char *pdb = PerlEnv_getenv("PERL5DB");
1929 SETERRNO(0,SS$_NORMAL);
1930 return "BEGIN { require 'perl5db.pl' }";
1936 /* Encoded script support. filter_add() effectively inserts a
1937 * 'pre-processing' function into the current source input stream.
1938 * Note that the filter function only applies to the current source file
1939 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1941 * The datasv parameter (which may be NULL) can be used to pass
1942 * private data to this instance of the filter. The filter function
1943 * can recover the SV using the FILTER_DATA macro and use it to
1944 * store private buffers and state information.
1946 * The supplied datasv parameter is upgraded to a PVIO type
1947 * and the IoDIRP/IoANY field is used to store the function pointer,
1948 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1949 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1950 * private use must be set using malloc'd pointers.
1954 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1959 if (!PL_rsfp_filters)
1960 PL_rsfp_filters = newAV();
1962 datasv = NEWSV(255,0);
1963 if (!SvUPGRADE(datasv, SVt_PVIO))
1964 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1965 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1966 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1967 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1968 funcp, SvPV_nolen(datasv)));
1969 av_unshift(PL_rsfp_filters, 1);
1970 av_store(PL_rsfp_filters, 0, datasv) ;
1975 /* Delete most recently added instance of this filter function. */
1977 Perl_filter_del(pTHX_ filter_t funcp)
1980 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1981 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1983 /* if filter is on top of stack (usual case) just pop it off */
1984 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1985 if (IoANY(datasv) == (void *)funcp) {
1986 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1987 IoANY(datasv) = (void *)NULL;
1988 sv_free(av_pop(PL_rsfp_filters));
1992 /* we need to search for the correct entry and clear it */
1993 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1997 /* Invoke the n'th filter function for the current rsfp. */
1999 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2002 /* 0 = read one text line */
2007 if (!PL_rsfp_filters)
2009 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2010 /* Provide a default input filter to make life easy. */
2011 /* Note that we append to the line. This is handy. */
2012 DEBUG_P(PerlIO_printf(Perl_debug_log,
2013 "filter_read %d: from rsfp\n", idx));
2017 int old_len = SvCUR(buf_sv) ;
2019 /* ensure buf_sv is large enough */
2020 SvGROW(buf_sv, old_len + maxlen) ;
2021 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2022 if (PerlIO_error(PL_rsfp))
2023 return -1; /* error */
2025 return 0 ; /* end of file */
2027 SvCUR_set(buf_sv, old_len + len) ;
2030 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2031 if (PerlIO_error(PL_rsfp))
2032 return -1; /* error */
2034 return 0 ; /* end of file */
2037 return SvCUR(buf_sv);
2039 /* Skip this filter slot if filter has been deleted */
2040 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2041 DEBUG_P(PerlIO_printf(Perl_debug_log,
2042 "filter_read %d: skipped (filter deleted)\n",
2044 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2046 /* Get function pointer hidden within datasv */
2047 funcp = (filter_t)IoANY(datasv);
2048 DEBUG_P(PerlIO_printf(Perl_debug_log,
2049 "filter_read %d: via function %p (%s)\n",
2050 idx, funcp, SvPV_nolen(datasv)));
2051 /* Call function. The function is expected to */
2052 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2053 /* Return: <0:error, =0:eof, >0:not eof */
2054 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
2058 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2060 #ifdef PERL_CR_FILTER
2061 if (!PL_rsfp_filters) {
2062 filter_add(S_cr_textfilter,NULL);
2065 if (PL_rsfp_filters) {
2068 SvCUR_set(sv, 0); /* start with empty line */
2069 if (FILTER_READ(0, sv, 0) > 0)
2070 return ( SvPVX(sv) ) ;
2075 return (sv_gets(sv, fp, append));
2079 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2083 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2087 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2088 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2090 return GvHV(gv); /* Foo:: */
2093 /* use constant CLASS => 'MyClass' */
2094 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2096 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2097 pkgname = SvPV_nolen(sv);
2101 return gv_stashpv(pkgname, FALSE);
2105 static char* exp_name[] =
2106 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2107 "ATTRTERM", "TERMBLOCK"
2114 Works out what to call the token just pulled out of the input
2115 stream. The yacc parser takes care of taking the ops we return and
2116 stitching them into a tree.
2122 if read an identifier
2123 if we're in a my declaration
2124 croak if they tried to say my($foo::bar)
2125 build the ops for a my() declaration
2126 if it's an access to a my() variable
2127 are we in a sort block?
2128 croak if my($a); $a <=> $b
2129 build ops for access to a my() variable
2130 if in a dq string, and they've said @foo and we can't find @foo
2132 build ops for a bareword
2133 if we already built the token before, use it.
2136 #ifdef USE_PURE_BISON
2138 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2143 yylval_pointer[yyactlevel] = lvalp;
2144 yychar_pointer[yyactlevel] = lcharp;
2145 if (yyactlevel >= YYMAXLEVEL)
2146 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2148 r = Perl_yylex(aTHX);
2158 #pragma segment Perl_yylex
2171 /* check if there's an identifier for us to look at */
2172 if (PL_pending_ident)
2173 return S_pending_ident(aTHX);
2175 /* no identifier pending identification */
2177 switch (PL_lex_state) {
2179 case LEX_NORMAL: /* Some compilers will produce faster */
2180 case LEX_INTERPNORMAL: /* code if we comment these out. */
2184 /* when we've already built the next token, just pull it out of the queue */
2187 yylval = PL_nextval[PL_nexttoke];
2189 PL_lex_state = PL_lex_defer;
2190 PL_expect = PL_lex_expect;
2191 PL_lex_defer = LEX_NORMAL;
2193 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2194 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2195 (IV)PL_nexttype[PL_nexttoke]); });
2197 return(PL_nexttype[PL_nexttoke]);
2199 /* interpolated case modifiers like \L \U, including \Q and \E.
2200 when we get here, PL_bufptr is at the \
2202 case LEX_INTERPCASEMOD:
2204 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2205 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2207 /* handle \E or end of string */
2208 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2212 if (PL_lex_casemods) {
2213 oldmod = PL_lex_casestack[--PL_lex_casemods];
2214 PL_lex_casestack[PL_lex_casemods] = '\0';
2216 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2218 PL_lex_state = LEX_INTERPCONCAT;
2222 if (PL_bufptr != PL_bufend)
2224 PL_lex_state = LEX_INTERPCONCAT;
2228 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2229 "### Saw case modifier at '%s'\n", PL_bufptr); });
2231 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2232 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2233 if (strchr("LU", *s) &&
2234 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2236 PL_lex_casestack[--PL_lex_casemods] = '\0';
2239 if (PL_lex_casemods > 10) {
2240 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2241 if (newlb != PL_lex_casestack) {
2243 PL_lex_casestack = newlb;
2246 PL_lex_casestack[PL_lex_casemods++] = *s;
2247 PL_lex_casestack[PL_lex_casemods] = '\0';
2248 PL_lex_state = LEX_INTERPCONCAT;
2249 PL_nextval[PL_nexttoke].ival = 0;
2252 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2254 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2256 PL_nextval[PL_nexttoke].ival = OP_LC;
2258 PL_nextval[PL_nexttoke].ival = OP_UC;
2260 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2262 Perl_croak(aTHX_ "panic: yylex");
2265 if (PL_lex_starts) {
2274 case LEX_INTERPPUSH:
2275 return sublex_push();
2277 case LEX_INTERPSTART:
2278 if (PL_bufptr == PL_bufend)
2279 return sublex_done();
2280 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2281 "### Interpolated variable at '%s'\n", PL_bufptr); });
2283 PL_lex_dojoin = (*PL_bufptr == '@');
2284 PL_lex_state = LEX_INTERPNORMAL;
2285 if (PL_lex_dojoin) {
2286 PL_nextval[PL_nexttoke].ival = 0;
2289 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2290 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2291 force_next(PRIVATEREF);
2293 force_ident("\"", '$');
2294 #endif /* USE_THREADS */
2295 PL_nextval[PL_nexttoke].ival = 0;
2297 PL_nextval[PL_nexttoke].ival = 0;
2299 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2302 if (PL_lex_starts++) {
2308 case LEX_INTERPENDMAYBE:
2309 if (intuit_more(PL_bufptr)) {
2310 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2316 if (PL_lex_dojoin) {
2317 PL_lex_dojoin = FALSE;
2318 PL_lex_state = LEX_INTERPCONCAT;
2321 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2322 && SvEVALED(PL_lex_repl))
2324 if (PL_bufptr != PL_bufend)
2325 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2326 PL_lex_repl = Nullsv;
2329 case LEX_INTERPCONCAT:
2331 if (PL_lex_brackets)
2332 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2334 if (PL_bufptr == PL_bufend)
2335 return sublex_done();
2337 if (SvIVX(PL_linestr) == '\'') {
2338 SV *sv = newSVsv(PL_linestr);
2341 else if ( PL_hints & HINT_NEW_RE )
2342 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2343 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2347 s = scan_const(PL_bufptr);
2349 PL_lex_state = LEX_INTERPCASEMOD;
2351 PL_lex_state = LEX_INTERPSTART;
2354 if (s != PL_bufptr) {
2355 PL_nextval[PL_nexttoke] = yylval;
2358 if (PL_lex_starts++)
2368 PL_lex_state = LEX_NORMAL;
2369 s = scan_formline(PL_bufptr);
2370 if (!PL_lex_formbrack)
2376 PL_oldoldbufptr = PL_oldbufptr;
2379 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2380 exp_name[PL_expect], s);
2386 if (isIDFIRST_lazy_if(s,UTF))
2388 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2391 goto fake_eof; /* emulate EOF on ^D or ^Z */
2396 if (PL_lex_brackets)
2397 yyerror("Missing right curly or square bracket");
2398 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2399 "### Tokener got EOF\n");
2403 if (s++ < PL_bufend)
2404 goto retry; /* ignore stray nulls */
2407 if (!PL_in_eval && !PL_preambled) {
2408 PL_preambled = TRUE;
2409 sv_setpv(PL_linestr,incl_perldb());
2410 if (SvCUR(PL_linestr))
2411 sv_catpv(PL_linestr,";");
2413 while(AvFILLp(PL_preambleav) >= 0) {
2414 SV *tmpsv = av_shift(PL_preambleav);
2415 sv_catsv(PL_linestr, tmpsv);
2416 sv_catpv(PL_linestr, ";");
2419 sv_free((SV*)PL_preambleav);
2420 PL_preambleav = NULL;
2422 if (PL_minus_n || PL_minus_p) {
2423 sv_catpv(PL_linestr, "LINE: while (<>) {");
2425 sv_catpv(PL_linestr,"chomp;");
2428 if (strchr("/'\"", *PL_splitstr)
2429 && strchr(PL_splitstr + 1, *PL_splitstr))
2430 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2433 s = "'~#\200\1'"; /* surely one char is unused...*/
2434 while (s[1] && strchr(PL_splitstr, *s)) s++;
2436 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2437 "q" + (delim == '\''), delim);
2438 for (s = PL_splitstr; *s; s++) {
2440 sv_catpvn(PL_linestr, "\\", 1);
2441 sv_catpvn(PL_linestr, s, 1);
2443 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2447 sv_catpv(PL_linestr,"our @F=split(' ');");
2450 sv_catpv(PL_linestr, "\n");
2451 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2452 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2453 PL_last_lop = PL_last_uni = Nullch;
2454 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2455 SV *sv = NEWSV(85,0);
2457 sv_upgrade(sv, SVt_PVMG);
2458 sv_setsv(sv,PL_linestr);
2459 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2464 bof = PL_rsfp ? TRUE : FALSE;
2465 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2468 if (PL_preprocess && !PL_in_eval)
2469 (void)PerlProc_pclose(PL_rsfp);
2470 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2471 PerlIO_clearerr(PL_rsfp);
2473 (void)PerlIO_close(PL_rsfp);
2475 PL_doextract = FALSE;
2477 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2478 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2479 sv_catpv(PL_linestr,";}");
2480 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2481 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2482 PL_last_lop = PL_last_uni = Nullch;
2483 PL_minus_n = PL_minus_p = 0;
2486 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2487 PL_last_lop = PL_last_uni = Nullch;
2488 sv_setpv(PL_linestr,"");
2489 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2491 /* if it looks like the start of a BOM, check if it in fact is */
2492 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2493 #ifdef PERLIO_IS_STDIO
2494 # ifdef __GNU_LIBRARY__
2495 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2496 # define FTELL_FOR_PIPE_IS_BROKEN
2500 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2501 # define FTELL_FOR_PIPE_IS_BROKEN
2506 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2507 /* This loses the possibility to detect the bof
2508 * situation on perl -P when the libc5 is being used.
2509 * Workaround? Maybe attach some extra state to PL_rsfp?
2512 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2514 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2517 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2518 s = swallow_bom((U8*)s);
2522 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2523 PL_doextract = FALSE;
2525 /* Incest with pod. */
2526 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2527 sv_setpv(PL_linestr, "");
2528 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2529 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2530 PL_last_lop = PL_last_uni = Nullch;
2531 PL_doextract = FALSE;
2535 } while (PL_doextract);
2536 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2537 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2538 SV *sv = NEWSV(85,0);
2540 sv_upgrade(sv, SVt_PVMG);
2541 sv_setsv(sv,PL_linestr);
2542 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2544 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2545 PL_last_lop = PL_last_uni = Nullch;
2546 if (CopLINE(PL_curcop) == 1) {
2547 while (s < PL_bufend && isSPACE(*s))
2549 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2553 if (*s == '#' && *(s+1) == '!')
2555 #ifdef ALTERNATE_SHEBANG
2557 static char as[] = ALTERNATE_SHEBANG;
2558 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2559 d = s + (sizeof(as) - 1);
2561 #endif /* ALTERNATE_SHEBANG */
2570 while (*d && !isSPACE(*d))
2574 #ifdef ARG_ZERO_IS_SCRIPT
2575 if (ipathend > ipath) {
2577 * HP-UX (at least) sets argv[0] to the script name,
2578 * which makes $^X incorrect. And Digital UNIX and Linux,
2579 * at least, set argv[0] to the basename of the Perl
2580 * interpreter. So, having found "#!", we'll set it right.
2582 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2583 assert(SvPOK(x) || SvGMAGICAL(x));
2584 if (sv_eq(x, CopFILESV(PL_curcop))) {
2585 sv_setpvn(x, ipath, ipathend - ipath);
2588 TAINT_NOT; /* $^X is always tainted, but that's OK */
2590 #endif /* ARG_ZERO_IS_SCRIPT */
2595 d = instr(s,"perl -");
2597 d = instr(s,"perl");
2599 /* avoid getting into infinite loops when shebang
2600 * line contains "Perl" rather than "perl" */
2602 for (d = ipathend-4; d >= ipath; --d) {
2603 if ((*d == 'p' || *d == 'P')
2604 && !ibcmp(d, "perl", 4))
2614 #ifdef ALTERNATE_SHEBANG
2616 * If the ALTERNATE_SHEBANG on this system starts with a
2617 * character that can be part of a Perl expression, then if
2618 * we see it but not "perl", we're probably looking at the
2619 * start of Perl code, not a request to hand off to some
2620 * other interpreter. Similarly, if "perl" is there, but
2621 * not in the first 'word' of the line, we assume the line
2622 * contains the start of the Perl program.
2624 if (d && *s != '#') {
2626 while (*c && !strchr("; \t\r\n\f\v#", *c))
2629 d = Nullch; /* "perl" not in first word; ignore */
2631 *s = '#'; /* Don't try to parse shebang line */
2633 #endif /* ALTERNATE_SHEBANG */
2634 #ifndef MACOS_TRADITIONAL
2639 !instr(s,"indir") &&
2640 instr(PL_origargv[0],"perl"))
2646 while (s < PL_bufend && isSPACE(*s))
2648 if (s < PL_bufend) {
2649 Newz(899,newargv,PL_origargc+3,char*);
2651 while (s < PL_bufend && !isSPACE(*s))
2654 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2657 newargv = PL_origargv;
2659 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2660 Perl_croak(aTHX_ "Can't exec %s", ipath);
2664 U32 oldpdb = PL_perldb;
2665 bool oldn = PL_minus_n;
2666 bool oldp = PL_minus_p;
2668 while (*d && !isSPACE(*d)) d++;
2669 while (SPACE_OR_TAB(*d)) d++;
2673 if (*d == 'M' || *d == 'm') {
2675 while (*d && !isSPACE(*d)) d++;
2676 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2679 d = moreswitches(d);
2681 if ((PERLDB_LINE && !oldpdb) ||
2682 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2683 /* if we have already added "LINE: while (<>) {",
2684 we must not do it again */
2686 sv_setpv(PL_linestr, "");
2687 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2688 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2689 PL_last_lop = PL_last_uni = Nullch;
2690 PL_preambled = FALSE;
2692 (void)gv_fetchfile(PL_origfilename);
2699 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2701 PL_lex_state = LEX_FORMLINE;
2706 #ifdef PERL_STRICT_CR
2707 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2709 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2711 case ' ': case '\t': case '\f': case 013:
2712 #ifdef MACOS_TRADITIONAL
2719 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2720 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2721 /* handle eval qq[#line 1 "foo"\n ...] */
2722 CopLINE_dec(PL_curcop);
2726 while (s < d && *s != '\n')
2730 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2731 Perl_croak(aTHX_ "panic: input overflow");
2733 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2735 PL_lex_state = LEX_FORMLINE;
2745 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2752 while (s < PL_bufend && SPACE_OR_TAB(*s))
2755 if (strnEQ(s,"=>",2)) {
2756 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2757 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2758 "### Saw unary minus before =>, forcing word '%s'\n", s);
2760 OPERATOR('-'); /* unary minus */
2762 PL_last_uni = PL_oldbufptr;
2764 case 'r': ftst = OP_FTEREAD; break;
2765 case 'w': ftst = OP_FTEWRITE; break;
2766 case 'x': ftst = OP_FTEEXEC; break;
2767 case 'o': ftst = OP_FTEOWNED; break;
2768 case 'R': ftst = OP_FTRREAD; break;
2769 case 'W': ftst = OP_FTRWRITE; break;
2770 case 'X': ftst = OP_FTREXEC; break;
2771 case 'O': ftst = OP_FTROWNED; break;
2772 case 'e': ftst = OP_FTIS; break;
2773 case 'z': ftst = OP_FTZERO; break;
2774 case 's': ftst = OP_FTSIZE; break;
2775 case 'f': ftst = OP_FTFILE; break;
2776 case 'd': ftst = OP_FTDIR; break;
2777 case 'l': ftst = OP_FTLINK; break;
2778 case 'p': ftst = OP_FTPIPE; break;
2779 case 'S': ftst = OP_FTSOCK; break;
2780 case 'u': ftst = OP_FTSUID; break;
2781 case 'g': ftst = OP_FTSGID; break;
2782 case 'k': ftst = OP_FTSVTX; break;
2783 case 'b': ftst = OP_FTBLK; break;
2784 case 'c': ftst = OP_FTCHR; break;
2785 case 't': ftst = OP_FTTTY; break;
2786 case 'T': ftst = OP_FTTEXT; break;
2787 case 'B': ftst = OP_FTBINARY; break;
2788 case 'M': case 'A': case 'C':
2789 gv_fetchpv("\024",TRUE, SVt_PV);
2791 case 'M': ftst = OP_FTMTIME; break;
2792 case 'A': ftst = OP_FTATIME; break;
2793 case 'C': ftst = OP_FTCTIME; break;
2801 PL_last_lop_op = ftst;
2802 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2803 "### Saw file test %c\n", (int)ftst);
2808 /* Assume it was a minus followed by a one-letter named
2809 * subroutine call (or a -bareword), then. */
2810 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2811 "### %c looked like a file test but was not\n",
2820 if (PL_expect == XOPERATOR)
2825 else if (*s == '>') {
2828 if (isIDFIRST_lazy_if(s,UTF)) {
2829 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2837 if (PL_expect == XOPERATOR)
2840 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2842 OPERATOR('-'); /* unary minus */
2849 if (PL_expect == XOPERATOR)
2854 if (PL_expect == XOPERATOR)
2857 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2863 if (PL_expect != XOPERATOR) {
2864 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2865 PL_expect = XOPERATOR;
2866 force_ident(PL_tokenbuf, '*');
2879 if (PL_expect == XOPERATOR) {
2883 PL_tokenbuf[0] = '%';
2884 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2885 if (!PL_tokenbuf[1]) {
2887 yyerror("Final % should be \\% or %name");
2890 PL_pending_ident = '%';
2909 switch (PL_expect) {
2912 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2914 PL_bufptr = s; /* update in case we back off */
2920 PL_expect = XTERMBLOCK;
2924 while (isIDFIRST_lazy_if(s,UTF)) {
2925 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2926 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2927 if (tmp < 0) tmp = -tmp;
2942 d = scan_str(d,TRUE,TRUE);
2944 /* MUST advance bufptr here to avoid bogus
2945 "at end of line" context messages from yyerror().
2947 PL_bufptr = s + len;
2948 yyerror("Unterminated attribute parameter in attribute list");
2951 return 0; /* EOF indicator */
2955 SV *sv = newSVpvn(s, len);
2956 sv_catsv(sv, PL_lex_stuff);
2957 attrs = append_elem(OP_LIST, attrs,
2958 newSVOP(OP_CONST, 0, sv));
2959 SvREFCNT_dec(PL_lex_stuff);
2960 PL_lex_stuff = Nullsv;
2963 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
2964 CvLVALUE_on(PL_compcv);
2965 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
2966 CvLOCKED_on(PL_compcv);
2967 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
2968 CvMETHOD_on(PL_compcv);
2970 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "unique", len))
2971 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
2973 /* After we've set the flags, it could be argued that
2974 we don't need to do the attributes.pm-based setting
2975 process, and shouldn't bother appending recognized
2976 flags. To experiment with that, uncomment the
2977 following "else": */
2979 attrs = append_elem(OP_LIST, attrs,
2980 newSVOP(OP_CONST, 0,
2984 if (*s == ':' && s[1] != ':')
2987 break; /* require real whitespace or :'s */
2989 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
2990 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
2991 char q = ((*s == '\'') ? '"' : '\'');
2992 /* If here for an expression, and parsed no attrs, back off. */
2993 if (tmp == '=' && !attrs) {
2997 /* MUST advance bufptr here to avoid bogus "at end of line"
2998 context messages from yyerror().
3002 yyerror("Unterminated attribute list");
3004 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3012 PL_nextval[PL_nexttoke].opval = attrs;
3020 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3021 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3037 if (PL_lex_brackets <= 0)
3038 yyerror("Unmatched right square bracket");
3041 if (PL_lex_state == LEX_INTERPNORMAL) {
3042 if (PL_lex_brackets == 0) {
3043 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3044 PL_lex_state = LEX_INTERPEND;
3051 if (PL_lex_brackets > 100) {
3052 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3053 if (newlb != PL_lex_brackstack) {
3055 PL_lex_brackstack = newlb;
3058 switch (PL_expect) {
3060 if (PL_lex_formbrack) {
3064 if (PL_oldoldbufptr == PL_last_lop)
3065 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3067 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3068 OPERATOR(HASHBRACK);
3070 while (s < PL_bufend && SPACE_OR_TAB(*s))
3073 PL_tokenbuf[0] = '\0';
3074 if (d < PL_bufend && *d == '-') {
3075 PL_tokenbuf[0] = '-';
3077 while (d < PL_bufend && SPACE_OR_TAB(*d))
3080 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3081 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3083 while (d < PL_bufend && SPACE_OR_TAB(*d))
3086 char minus = (PL_tokenbuf[0] == '-');
3087 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3095 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3100 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3105 if (PL_oldoldbufptr == PL_last_lop)
3106 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3108 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3111 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3113 /* This hack is to get the ${} in the message. */
3115 yyerror("syntax error");
3118 OPERATOR(HASHBRACK);
3120 /* This hack serves to disambiguate a pair of curlies
3121 * as being a block or an anon hash. Normally, expectation
3122 * determines that, but in cases where we're not in a
3123 * position to expect anything in particular (like inside
3124 * eval"") we have to resolve the ambiguity. This code
3125 * covers the case where the first term in the curlies is a
3126 * quoted string. Most other cases need to be explicitly
3127 * disambiguated by prepending a `+' before the opening
3128 * curly in order to force resolution as an anon hash.
3130 * XXX should probably propagate the outer expectation
3131 * into eval"" to rely less on this hack, but that could
3132 * potentially break current behavior of eval"".
3136 if (*s == '\'' || *s == '"' || *s == '`') {
3137 /* common case: get past first string, handling escapes */
3138 for (t++; t < PL_bufend && *t != *s;)
3139 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3143 else if (*s == 'q') {
3146 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3150 char open, close, term;
3153 while (t < PL_bufend && isSPACE(*t))
3157 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3161 for (t++; t < PL_bufend; t++) {
3162 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3164 else if (*t == open)
3168 for (t++; t < PL_bufend; t++) {
3169 if (*t == '\\' && t+1 < PL_bufend)
3171 else if (*t == close && --brackets <= 0)
3173 else if (*t == open)
3179 else if (isALNUM_lazy_if(t,UTF)) {
3181 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3184 while (t < PL_bufend && isSPACE(*t))
3186 /* if comma follows first term, call it an anon hash */
3187 /* XXX it could be a comma expression with loop modifiers */
3188 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3189 || (*t == '=' && t[1] == '>')))
3190 OPERATOR(HASHBRACK);
3191 if (PL_expect == XREF)
3194 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3200 yylval.ival = CopLINE(PL_curcop);
3201 if (isSPACE(*s) || *s == '#')
3202 PL_copline = NOLINE; /* invalidate current command line number */
3207 if (PL_lex_brackets <= 0)
3208 yyerror("Unmatched right curly bracket");
3210 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3211 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3212 PL_lex_formbrack = 0;
3213 if (PL_lex_state == LEX_INTERPNORMAL) {
3214 if (PL_lex_brackets == 0) {
3215 if (PL_expect & XFAKEBRACK) {
3216 PL_expect &= XENUMMASK;
3217 PL_lex_state = LEX_INTERPEND;
3219 return yylex(); /* ignore fake brackets */
3221 if (*s == '-' && s[1] == '>')
3222 PL_lex_state = LEX_INTERPENDMAYBE;
3223 else if (*s != '[' && *s != '{')
3224 PL_lex_state = LEX_INTERPEND;
3227 if (PL_expect & XFAKEBRACK) {
3228 PL_expect &= XENUMMASK;
3230 return yylex(); /* ignore fake brackets */
3240 if (PL_expect == XOPERATOR) {
3241 if (ckWARN(WARN_SEMICOLON)
3242 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3244 CopLINE_dec(PL_curcop);
3245 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3246 CopLINE_inc(PL_curcop);
3251 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3253 PL_expect = XOPERATOR;
3254 force_ident(PL_tokenbuf, '&');
3258 yylval.ival = (OPpENTERSUB_AMPER<<8);
3277 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3278 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3280 if (PL_expect == XSTATE && isALPHA(tmp) &&
3281 (s == PL_linestart+1 || s[-2] == '\n') )
3283 if (PL_in_eval && !PL_rsfp) {
3288 if (strnEQ(s,"=cut",4)) {
3302 PL_doextract = TRUE;
3305 if (PL_lex_brackets < PL_lex_formbrack) {
3307 #ifdef PERL_STRICT_CR
3308 for (t = s; SPACE_OR_TAB(*t); t++) ;
3310 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3312 if (*t == '\n' || *t == '#') {
3330 if (PL_expect != XOPERATOR) {
3331 if (s[1] != '<' && !strchr(s,'>'))
3334 s = scan_heredoc(s);
3336 s = scan_inputsymbol(s);
3337 TERM(sublex_start());
3342 SHop(OP_LEFT_SHIFT);
3356 SHop(OP_RIGHT_SHIFT);
3365 if (PL_expect == XOPERATOR) {
3366 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3369 return ','; /* grandfather non-comma-format format */
3373 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3374 PL_tokenbuf[0] = '@';
3375 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3376 sizeof PL_tokenbuf - 1, FALSE);
3377 if (PL_expect == XOPERATOR)
3378 no_op("Array length", s);
3379 if (!PL_tokenbuf[1])
3381 PL_expect = XOPERATOR;
3382 PL_pending_ident = '#';
3386 PL_tokenbuf[0] = '$';
3387 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3388 sizeof PL_tokenbuf - 1, FALSE);
3389 if (PL_expect == XOPERATOR)
3391 if (!PL_tokenbuf[1]) {
3393 yyerror("Final $ should be \\$ or $name");
3397 /* This kludge not intended to be bulletproof. */
3398 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3399 yylval.opval = newSVOP(OP_CONST, 0,
3400 newSViv(PL_compiling.cop_arybase));
3401 yylval.opval->op_private = OPpCONST_ARYBASE;
3407 if (PL_lex_state == LEX_NORMAL)
3410 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3413 PL_tokenbuf[0] = '@';
3414 if (ckWARN(WARN_SYNTAX)) {
3416 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3419 PL_bufptr = skipspace(PL_bufptr);
3420 while (t < PL_bufend && *t != ']')
3422 Perl_warner(aTHX_ WARN_SYNTAX,
3423 "Multidimensional syntax %.*s not supported",
3424 (t - PL_bufptr) + 1, PL_bufptr);
3428 else if (*s == '{') {
3429 PL_tokenbuf[0] = '%';
3430 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3431 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3433 char tmpbuf[sizeof PL_tokenbuf];
3435 for (t++; isSPACE(*t); t++) ;
3436 if (isIDFIRST_lazy_if(t,UTF)) {
3437 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3438 for (; isSPACE(*t); t++) ;
3439 if (*t == ';' && get_cv(tmpbuf, FALSE))
3440 Perl_warner(aTHX_ WARN_SYNTAX,
3441 "You need to quote \"%s\"", tmpbuf);
3447 PL_expect = XOPERATOR;
3448 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3449 bool islop = (PL_last_lop == PL_oldoldbufptr);
3450 if (!islop || PL_last_lop_op == OP_GREPSTART)
3451 PL_expect = XOPERATOR;
3452 else if (strchr("$@\"'`q", *s))
3453 PL_expect = XTERM; /* e.g. print $fh "foo" */
3454 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3455 PL_expect = XTERM; /* e.g. print $fh &sub */
3456 else if (isIDFIRST_lazy_if(s,UTF)) {
3457 char tmpbuf[sizeof PL_tokenbuf];
3458 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3459 if ((tmp = keyword(tmpbuf, len))) {
3460 /* binary operators exclude handle interpretations */
3472 PL_expect = XTERM; /* e.g. print $fh length() */
3477 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3478 if (gv && GvCVu(gv))
3479 PL_expect = XTERM; /* e.g. print $fh subr() */
3482 else if (isDIGIT(*s))
3483 PL_expect = XTERM; /* e.g. print $fh 3 */
3484 else if (*s == '.' && isDIGIT(s[1]))
3485 PL_expect = XTERM; /* e.g. print $fh .3 */
3486 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3487 PL_expect = XTERM; /* e.g. print $fh -1 */
3488 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3489 PL_expect = XTERM; /* print $fh <<"EOF" */
3491 PL_pending_ident = '$';
3495 if (PL_expect == XOPERATOR)
3497 PL_tokenbuf[0] = '@';
3498 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3499 if (!PL_tokenbuf[1]) {
3501 yyerror("Final @ should be \\@ or @name");
3504 if (PL_lex_state == LEX_NORMAL)
3506 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3508 PL_tokenbuf[0] = '%';
3510 /* Warn about @ where they meant $. */
3511 if (ckWARN(WARN_SYNTAX)) {
3512 if (*s == '[' || *s == '{') {
3514 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3516 if (*t == '}' || *t == ']') {
3518 PL_bufptr = skipspace(PL_bufptr);
3519 Perl_warner(aTHX_ WARN_SYNTAX,
3520 "Scalar value %.*s better written as $%.*s",
3521 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3526 PL_pending_ident = '@';
3529 case '/': /* may either be division or pattern */
3530 case '?': /* may either be conditional or pattern */
3531 if (PL_expect != XOPERATOR) {
3532 /* Disable warning on "study /blah/" */
3533 if (PL_oldoldbufptr == PL_last_uni
3534 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3535 || memNE(PL_last_uni, "study", 5)
3536 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3538 s = scan_pat(s,OP_MATCH);
3539 TERM(sublex_start());
3547 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3548 #ifdef PERL_STRICT_CR
3551 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3553 && (s == PL_linestart || s[-1] == '\n') )
3555 PL_lex_formbrack = 0;
3559 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3565 yylval.ival = OPf_SPECIAL;
3571 if (PL_expect != XOPERATOR)
3576 case '0': case '1': case '2': case '3': case '4':
3577 case '5': case '6': case '7': case '8': case '9':
3578 s = scan_num(s, &yylval);
3579 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3580 "### Saw number in '%s'\n", s);
3582 if (PL_expect == XOPERATOR)
3587 s = scan_str(s,FALSE,FALSE);
3588 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3589 "### Saw string before '%s'\n", s);
3591 if (PL_expect == XOPERATOR) {
3592 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3595 return ','; /* grandfather non-comma-format format */
3601 missingterm((char*)0);
3602 yylval.ival = OP_CONST;
3603 TERM(sublex_start());
3606 s = scan_str(s,FALSE,FALSE);
3607 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3608 "### Saw string before '%s'\n", s);
3610 if (PL_expect == XOPERATOR) {
3611 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3614 return ','; /* grandfather non-comma-format format */
3620 missingterm((char*)0);
3621 yylval.ival = OP_CONST;
3622 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3623 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3624 yylval.ival = OP_STRINGIFY;
3628 TERM(sublex_start());
3631 s = scan_str(s,FALSE,FALSE);
3632 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3633 "### Saw backtick string before '%s'\n", s);
3635 if (PL_expect == XOPERATOR)
3636 no_op("Backticks",s);
3638 missingterm((char*)0);
3639 yylval.ival = OP_BACKTICK;
3641 TERM(sublex_start());
3645 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3646 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3648 if (PL_expect == XOPERATOR)
3649 no_op("Backslash",s);
3653 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3657 while (isDIGIT(*start) || *start == '_')
3659 if (*start == '.' && isDIGIT(start[1])) {
3660 s = scan_num(s, &yylval);
3663 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3664 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3668 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3671 s = scan_num(s, &yylval);
3678 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3717 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3719 /* Some keywords can be followed by any delimiter, including ':' */
3720 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3721 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3722 (PL_tokenbuf[0] == 'q' &&
3723 strchr("qwxr", PL_tokenbuf[1])))));
3725 /* x::* is just a word, unless x is "CORE" */
3726 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3730 while (d < PL_bufend && isSPACE(*d))
3731 d++; /* no comments skipped here, or s### is misparsed */
3733 /* Is this a label? */
3734 if (!tmp && PL_expect == XSTATE
3735 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3737 yylval.pval = savepv(PL_tokenbuf);
3742 /* Check for keywords */
3743 tmp = keyword(PL_tokenbuf, len);
3745 /* Is this a word before a => operator? */
3746 if (*d == '=' && d[1] == '>') {
3748 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3749 yylval.opval->op_private = OPpCONST_BARE;
3750 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3751 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3755 if (tmp < 0) { /* second-class keyword? */
3756 GV *ogv = Nullgv; /* override (winner) */
3757 GV *hgv = Nullgv; /* hidden (loser) */
3758 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3760 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3763 if (GvIMPORTED_CV(gv))
3765 else if (! CvMETHOD(cv))
3769 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3770 (gv = *gvp) != (GV*)&PL_sv_undef &&
3771 GvCVu(gv) && GvIMPORTED_CV(gv))
3777 tmp = 0; /* overridden by import or by GLOBAL */
3780 && -tmp==KEY_lock /* XXX generalizable kludge */
3782 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3784 tmp = 0; /* any sub overrides "weak" keyword */
3786 else { /* no override */
3790 if (ckWARN(WARN_AMBIGUOUS) && hgv
3791 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3792 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3793 "Ambiguous call resolved as CORE::%s(), %s",
3794 GvENAME(hgv), "qualify as such or use &");
3801 default: /* not a keyword */
3805 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3807 /* Get the rest if it looks like a package qualifier */
3809 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3811 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3814 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3815 *s == '\'' ? "'" : "::");
3820 if (PL_expect == XOPERATOR) {
3821 if (PL_bufptr == PL_linestart) {
3822 CopLINE_dec(PL_curcop);
3823 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3824 CopLINE_inc(PL_curcop);
3827 no_op("Bareword",s);
3830 /* Look for a subroutine with this name in current package,
3831 unless name is "Foo::", in which case Foo is a bearword
3832 (and a package name). */
3835 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3837 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3838 Perl_warner(aTHX_ WARN_BAREWORD,
3839 "Bareword \"%s\" refers to nonexistent package",
3842 PL_tokenbuf[len] = '\0';
3849 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3852 /* if we saw a global override before, get the right name */
3855 sv = newSVpvn("CORE::GLOBAL::",14);
3856 sv_catpv(sv,PL_tokenbuf);
3859 sv = newSVpv(PL_tokenbuf,0);
3861 /* Presume this is going to be a bareword of some sort. */
3864 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3865 yylval.opval->op_private = OPpCONST_BARE;
3867 /* And if "Foo::", then that's what it certainly is. */
3872 /* See if it's the indirect object for a list operator. */
3874 if (PL_oldoldbufptr &&
3875 PL_oldoldbufptr < PL_bufptr &&
3876 (PL_oldoldbufptr == PL_last_lop
3877 || PL_oldoldbufptr == PL_last_uni) &&
3878 /* NO SKIPSPACE BEFORE HERE! */
3879 (PL_expect == XREF ||
3880 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3882 bool immediate_paren = *s == '(';
3884 /* (Now we can afford to cross potential line boundary.) */
3887 /* Two barewords in a row may indicate method call. */
3889 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3892 /* If not a declared subroutine, it's an indirect object. */
3893 /* (But it's an indir obj regardless for sort.) */
3895 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3896 ((!gv || !GvCVu(gv)) &&
3897 (PL_last_lop_op != OP_MAPSTART &&
3898 PL_last_lop_op != OP_GREPSTART))))
3900 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3905 PL_expect = XOPERATOR;
3908 /* Is this a word before a => operator? */
3909 if (*s == '=' && s[1] == '>' && !pkgname) {
3911 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3912 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3913 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3917 /* If followed by a paren, it's certainly a subroutine. */
3920 if (gv && GvCVu(gv)) {
3921 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3922 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3927 PL_nextval[PL_nexttoke].opval = yylval.opval;
3928 PL_expect = XOPERATOR;
3934 /* If followed by var or block, call it a method (unless sub) */
3936 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3937 PL_last_lop = PL_oldbufptr;
3938 PL_last_lop_op = OP_METHOD;
3942 /* If followed by a bareword, see if it looks like indir obj. */
3944 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3947 /* Not a method, so call it a subroutine (if defined) */
3949 if (gv && GvCVu(gv)) {
3951 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3952 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3953 "Ambiguous use of -%s resolved as -&%s()",
3954 PL_tokenbuf, PL_tokenbuf);
3955 /* Check for a constant sub */
3957 if ((sv = cv_const_sv(cv))) {
3959 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3960 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3961 yylval.opval->op_private = 0;
3965 /* Resolve to GV now. */
3966 op_free(yylval.opval);
3967 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3968 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3969 PL_last_lop = PL_oldbufptr;
3970 PL_last_lop_op = OP_ENTERSUB;
3971 /* Is there a prototype? */
3974 char *proto = SvPV((SV*)cv, len);
3977 if (strEQ(proto, "$"))
3979 if (*proto == '&' && *s == '{') {
3980 sv_setpv(PL_subname,"__ANON__");
3984 PL_nextval[PL_nexttoke].opval = yylval.opval;
3990 /* Call it a bare word */
3992 if (PL_hints & HINT_STRICT_SUBS)
3993 yylval.opval->op_private |= OPpCONST_STRICT;
3996 if (ckWARN(WARN_RESERVED)) {
3997 if (lastchar != '-') {
3998 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4000 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
4007 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4008 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4009 "Operator or semicolon missing before %c%s",
4010 lastchar, PL_tokenbuf);
4011 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4012 "Ambiguous use of %c resolved as operator %c",
4013 lastchar, lastchar);
4019 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4020 newSVpv(CopFILE(PL_curcop),0));
4024 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4025 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4028 case KEY___PACKAGE__:
4029 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4031 ? newSVsv(PL_curstname)
4040 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4041 char *pname = "main";
4042 if (PL_tokenbuf[2] == 'D')
4043 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4044 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4047 GvIOp(gv) = newIO();
4048 IoIFP(GvIOp(gv)) = PL_rsfp;
4049 #if defined(HAS_FCNTL) && defined(F_SETFD)
4051 int fd = PerlIO_fileno(PL_rsfp);
4052 fcntl(fd,F_SETFD,fd >= 3);
4055 /* Mark this internal pseudo-handle as clean */
4056 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4058 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4059 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4060 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4062 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4063 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4064 /* if the script was opened in binmode, we need to revert
4065 * it to text mode for compatibility; but only iff it has CRs
4066 * XXX this is a questionable hack at best. */
4067 if (PL_bufend-PL_bufptr > 2
4068 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4071 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4072 loc = PerlIO_tell(PL_rsfp);
4073 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4076 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4078 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4079 #endif /* NETWARE */
4080 #ifdef PERLIO_IS_STDIO /* really? */
4081 # if defined(__BORLANDC__)
4082 /* XXX see note in do_binmode() */
4083 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4087 PerlIO_seek(PL_rsfp, loc, 0);
4091 #ifdef PERLIO_LAYERS
4092 if (UTF && !IN_BYTES)
4093 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4106 if (PL_expect == XSTATE) {
4113 if (*s == ':' && s[1] == ':') {
4116 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4117 if (!(tmp = keyword(PL_tokenbuf, len)))
4118 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4132 LOP(OP_ACCEPT,XTERM);
4138 LOP(OP_ATAN2,XTERM);
4144 LOP(OP_BINMODE,XTERM);
4147 LOP(OP_BLESS,XTERM);
4156 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4173 if (!PL_cryptseen) {
4174 PL_cryptseen = TRUE;
4178 LOP(OP_CRYPT,XTERM);
4181 LOP(OP_CHMOD,XTERM);
4184 LOP(OP_CHOWN,XTERM);
4187 LOP(OP_CONNECT,XTERM);
4203 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4207 PL_hints |= HINT_BLOCK_SCOPE;
4217 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4218 LOP(OP_DBMOPEN,XTERM);
4224 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4231 yylval.ival = CopLINE(PL_curcop);
4245 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4246 UNIBRACK(OP_ENTEREVAL);
4261 case KEY_endhostent:
4267 case KEY_endservent:
4270 case KEY_endprotoent:
4281 yylval.ival = CopLINE(PL_curcop);
4283 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4285 if ((PL_bufend - p) >= 3 &&
4286 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4288 else if ((PL_bufend - p) >= 4 &&
4289 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4292 if (isIDFIRST_lazy_if(p,UTF)) {
4293 p = scan_ident(p, PL_bufend,
4294 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4298 Perl_croak(aTHX_ "Missing $ on loop variable");
4303 LOP(OP_FORMLINE,XTERM);
4309 LOP(OP_FCNTL,XTERM);
4315 LOP(OP_FLOCK,XTERM);
4324 LOP(OP_GREPSTART, XREF);
4327 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4342 case KEY_getpriority:
4343 LOP(OP_GETPRIORITY,XTERM);
4345 case KEY_getprotobyname:
4348 case KEY_getprotobynumber:
4349 LOP(OP_GPBYNUMBER,XTERM);
4351 case KEY_getprotoent:
4363 case KEY_getpeername:
4364 UNI(OP_GETPEERNAME);
4366 case KEY_gethostbyname:
4369 case KEY_gethostbyaddr:
4370 LOP(OP_GHBYADDR,XTERM);
4372 case KEY_gethostent:
4375 case KEY_getnetbyname:
4378 case KEY_getnetbyaddr:
4379 LOP(OP_GNBYADDR,XTERM);
4384 case KEY_getservbyname:
4385 LOP(OP_GSBYNAME,XTERM);
4387 case KEY_getservbyport:
4388 LOP(OP_GSBYPORT,XTERM);
4390 case KEY_getservent:
4393 case KEY_getsockname:
4394 UNI(OP_GETSOCKNAME);
4396 case KEY_getsockopt:
4397 LOP(OP_GSOCKOPT,XTERM);
4419 yylval.ival = CopLINE(PL_curcop);
4423 LOP(OP_INDEX,XTERM);
4429 LOP(OP_IOCTL,XTERM);
4441 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4473 LOP(OP_LISTEN,XTERM);
4482 s = scan_pat(s,OP_MATCH);
4483 TERM(sublex_start());
4486 LOP(OP_MAPSTART, XREF);
4489 LOP(OP_MKDIR,XTERM);
4492 LOP(OP_MSGCTL,XTERM);
4495 LOP(OP_MSGGET,XTERM);
4498 LOP(OP_MSGRCV,XTERM);
4501 LOP(OP_MSGSND,XTERM);
4507 if (isIDFIRST_lazy_if(s,UTF)) {
4508 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4509 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4511 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4512 if (!PL_in_my_stash) {
4515 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4523 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4530 if (PL_expect != XSTATE)
4531 yyerror("\"no\" not allowed in expression");
4532 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4533 s = force_version(s);
4538 if (*s == '(' || (s = skipspace(s), *s == '('))
4545 if (isIDFIRST_lazy_if(s,UTF)) {
4547 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4549 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4550 Perl_warner(aTHX_ WARN_PRECEDENCE,
4551 "Precedence problem: open %.*s should be open(%.*s)",
4557 yylval.ival = OP_OR;
4567 LOP(OP_OPEN_DIR,XTERM);
4570 checkcomma(s,PL_tokenbuf,"filehandle");
4574 checkcomma(s,PL_tokenbuf,"filehandle");
4593 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4597 LOP(OP_PIPE_OP,XTERM);
4600 s = scan_str(s,FALSE,FALSE);
4602 missingterm((char*)0);
4603 yylval.ival = OP_CONST;
4604 TERM(sublex_start());
4610 s = scan_str(s,FALSE,FALSE);
4612 missingterm((char*)0);
4614 if (SvCUR(PL_lex_stuff)) {
4617 d = SvPV_force(PL_lex_stuff, len);
4620 for (; isSPACE(*d) && len; --len, ++d) ;
4623 if (!warned && ckWARN(WARN_QW)) {
4624 for (; !isSPACE(*d) && len; --len, ++d) {
4626 Perl_warner(aTHX_ WARN_QW,
4627 "Possible attempt to separate words with commas");
4630 else if (*d == '#') {
4631 Perl_warner(aTHX_ WARN_QW,
4632 "Possible attempt to put comments in qw() list");
4638 for (; !isSPACE(*d) && len; --len, ++d) ;
4640 sv = newSVpvn(b, d-b);
4641 if (DO_UTF8(PL_lex_stuff))
4643 words = append_elem(OP_LIST, words,
4644 newSVOP(OP_CONST, 0, tokeq(sv)));
4648 PL_nextval[PL_nexttoke].opval = words;
4653 SvREFCNT_dec(PL_lex_stuff);
4654 PL_lex_stuff = Nullsv;
4660 s = scan_str(s,FALSE,FALSE);
4662 missingterm((char*)0);
4663 yylval.ival = OP_STRINGIFY;
4664 if (SvIVX(PL_lex_stuff) == '\'')
4665 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4666 TERM(sublex_start());
4669 s = scan_pat(s,OP_QR);
4670 TERM(sublex_start());
4673 s = scan_str(s,FALSE,FALSE);
4675 missingterm((char*)0);
4676 yylval.ival = OP_BACKTICK;
4678 TERM(sublex_start());
4685 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4686 s = force_version(s);
4689 *PL_tokenbuf = '\0';
4690 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4691 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4692 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4694 yyerror("<> should be quotes");
4702 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4706 LOP(OP_RENAME,XTERM);
4715 LOP(OP_RINDEX,XTERM);
4738 LOP(OP_REVERSE,XTERM);
4749 TERM(sublex_start());
4751 TOKEN(1); /* force error */
4760 LOP(OP_SELECT,XTERM);
4766 LOP(OP_SEMCTL,XTERM);
4769 LOP(OP_SEMGET,XTERM);
4772 LOP(OP_SEMOP,XTERM);
4778 LOP(OP_SETPGRP,XTERM);
4780 case KEY_setpriority:
4781 LOP(OP_SETPRIORITY,XTERM);
4783 case KEY_sethostent:
4789 case KEY_setservent:
4792 case KEY_setprotoent:
4802 LOP(OP_SEEKDIR,XTERM);
4804 case KEY_setsockopt:
4805 LOP(OP_SSOCKOPT,XTERM);
4811 LOP(OP_SHMCTL,XTERM);
4814 LOP(OP_SHMGET,XTERM);
4817 LOP(OP_SHMREAD,XTERM);
4820 LOP(OP_SHMWRITE,XTERM);
4823 LOP(OP_SHUTDOWN,XTERM);
4832 LOP(OP_SOCKET,XTERM);
4834 case KEY_socketpair:
4835 LOP(OP_SOCKPAIR,XTERM);
4838 checkcomma(s,PL_tokenbuf,"subroutine name");
4840 if (*s == ';' || *s == ')') /* probably a close */
4841 Perl_croak(aTHX_ "sort is now a reserved word");
4843 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4847 LOP(OP_SPLIT,XTERM);
4850 LOP(OP_SPRINTF,XTERM);
4853 LOP(OP_SPLICE,XTERM);
4868 LOP(OP_SUBSTR,XTERM);
4874 char tmpbuf[sizeof PL_tokenbuf];
4875 SSize_t tboffset = 0;
4876 expectation attrful;
4877 bool have_name, have_proto;
4882 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4883 (*s == ':' && s[1] == ':'))
4886 attrful = XATTRBLOCK;
4887 /* remember buffer pos'n for later force_word */
4888 tboffset = s - PL_oldbufptr;
4889 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4890 if (strchr(tmpbuf, ':'))
4891 sv_setpv(PL_subname, tmpbuf);
4893 sv_setsv(PL_subname,PL_curstname);
4894 sv_catpvn(PL_subname,"::",2);
4895 sv_catpvn(PL_subname,tmpbuf,len);
4902 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4903 PL_expect = XTERMBLOCK;
4904 attrful = XATTRTERM;
4905 sv_setpv(PL_subname,"?");
4909 if (key == KEY_format) {
4911 PL_lex_formbrack = PL_lex_brackets + 1;
4913 (void) force_word(PL_oldbufptr + tboffset, WORD,
4918 /* Look for a prototype */
4922 s = scan_str(s,FALSE,FALSE);
4924 Perl_croak(aTHX_ "Prototype not terminated");
4926 d = SvPVX(PL_lex_stuff);
4928 for (p = d; *p; ++p) {
4933 SvCUR(PL_lex_stuff) = tmp;
4941 if (*s == ':' && s[1] != ':')
4942 PL_expect = attrful;
4945 PL_nextval[PL_nexttoke].opval =
4946 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4947 PL_lex_stuff = Nullsv;
4951 sv_setpv(PL_subname,"__ANON__");
4954 (void) force_word(PL_oldbufptr + tboffset, WORD,
4963 LOP(OP_SYSTEM,XREF);
4966 LOP(OP_SYMLINK,XTERM);
4969 LOP(OP_SYSCALL,XTERM);
4972 LOP(OP_SYSOPEN,XTERM);
4975 LOP(OP_SYSSEEK,XTERM);
4978 LOP(OP_SYSREAD,XTERM);
4981 LOP(OP_SYSWRITE,XTERM);
4985 TERM(sublex_start());
5006 LOP(OP_TRUNCATE,XTERM);
5018 yylval.ival = CopLINE(PL_curcop);
5022 yylval.ival = CopLINE(PL_curcop);
5026 LOP(OP_UNLINK,XTERM);
5032 LOP(OP_UNPACK,XTERM);
5035 LOP(OP_UTIME,XTERM);
5041 LOP(OP_UNSHIFT,XTERM);
5044 if (PL_expect != XSTATE)
5045 yyerror("\"use\" not allowed in expression");
5047 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5048 s = force_version(s);
5049 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5050 PL_nextval[PL_nexttoke].opval = Nullop;
5055 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5056 s = force_version(s);
5068 yylval.ival = CopLINE(PL_curcop);
5072 PL_hints |= HINT_BLOCK_SCOPE;
5079 LOP(OP_WAITPID,XTERM);
5087 static char ctl_l[2];
5089 if (ctl_l[0] == '\0')
5090 ctl_l[0] = toCTRL('L');
5091 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5094 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5099 if (PL_expect == XOPERATOR)
5105 yylval.ival = OP_XOR;
5110 TERM(sublex_start());
5115 #pragma segment Main
5119 S_pending_ident(pTHX)
5123 /* pit holds the identifier we read and pending_ident is reset */
5124 char pit = PL_pending_ident;
5125 PL_pending_ident = 0;
5127 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5128 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5130 /* if we're in a my(), we can't allow dynamics here.
5131 $foo'bar has already been turned into $foo::bar, so
5132 just check for colons.
5134 if it's a legal name, the OP is a PADANY.
5137 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5138 if (strchr(PL_tokenbuf,':'))
5139 yyerror(Perl_form(aTHX_ "No package name allowed for "
5140 "variable %s in \"our\"",
5142 tmp = pad_allocmy(PL_tokenbuf);
5145 if (strchr(PL_tokenbuf,':'))
5146 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5148 yylval.opval = newOP(OP_PADANY, 0);
5149 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5155 build the ops for accesses to a my() variable.
5157 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5158 then used in a comparison. This catches most, but not
5159 all cases. For instance, it catches
5160 sort { my($a); $a <=> $b }
5162 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5163 (although why you'd do that is anyone's guess).
5166 if (!strchr(PL_tokenbuf,':')) {
5168 /* Check for single character per-thread SVs */
5169 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5170 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5171 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5173 yylval.opval = newOP(OP_THREADSV, 0);
5174 yylval.opval->op_targ = tmp;
5177 #endif /* USE_THREADS */
5178 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5179 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5180 /* might be an "our" variable" */
5181 if (SvFLAGS(namesv) & SVpad_OUR) {
5182 /* build ops for a bareword */
5183 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5184 sv_catpvn(sym, "::", 2);
5185 sv_catpv(sym, PL_tokenbuf+1);
5186 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5187 yylval.opval->op_private = OPpCONST_ENTERED;
5188 gv_fetchpv(SvPVX(sym),
5190 ? (GV_ADDMULTI | GV_ADDINEVAL)
5193 ((PL_tokenbuf[0] == '$') ? SVt_PV
5194 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5199 /* if it's a sort block and they're naming $a or $b */
5200 if (PL_last_lop_op == OP_SORT &&
5201 PL_tokenbuf[0] == '$' &&
5202 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5205 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5206 d < PL_bufend && *d != '\n';
5209 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5210 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5216 yylval.opval = newOP(OP_PADANY, 0);
5217 yylval.opval->op_targ = tmp;
5223 Whine if they've said @foo in a doublequoted string,
5224 and @foo isn't a variable we can find in the symbol
5227 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5228 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5229 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5230 && ckWARN(WARN_AMBIGUOUS))
5232 /* Downgraded from fatal to warning 20000522 mjd */
5233 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5234 "Possible unintended interpolation of %s in string",
5239 /* build ops for a bareword */
5240 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5241 yylval.opval->op_private = OPpCONST_ENTERED;
5242 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5243 ((PL_tokenbuf[0] == '$') ? SVt_PV
5244 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5250 Perl_keyword(pTHX_ register char *d, I32 len)
5255 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5256 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5257 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5258 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5259 if (strEQ(d,"__END__")) return KEY___END__;
5263 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5268 if (strEQ(d,"and")) return -KEY_and;
5269 if (strEQ(d,"abs")) return -KEY_abs;
5272 if (strEQ(d,"alarm")) return -KEY_alarm;
5273 if (strEQ(d,"atan2")) return -KEY_atan2;
5276 if (strEQ(d,"accept")) return -KEY_accept;
5281 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5284 if (strEQ(d,"bless")) return -KEY_bless;
5285 if (strEQ(d,"bind")) return -KEY_bind;
5286 if (strEQ(d,"binmode")) return -KEY_binmode;
5289 if (strEQ(d,"CORE")) return -KEY_CORE;
5290 if (strEQ(d,"CHECK")) return KEY_CHECK;
5295 if (strEQ(d,"cmp")) return -KEY_cmp;
5296 if (strEQ(d,"chr")) return -KEY_chr;
5297 if (strEQ(d,"cos")) return -KEY_cos;
5300 if (strEQ(d,"chop")) return -KEY_chop;
5303 if (strEQ(d,"close")) return -KEY_close;
5304 if (strEQ(d,"chdir")) return -KEY_chdir;
5305 if (strEQ(d,"chomp")) return -KEY_chomp;
5306 if (strEQ(d,"chmod")) return -KEY_chmod;
5307 if (strEQ(d,"chown")) return -KEY_chown;
5308 if (strEQ(d,"crypt")) return -KEY_crypt;
5311 if (strEQ(d,"chroot")) return -KEY_chroot;
5312 if (strEQ(d,"caller")) return -KEY_caller;
5315 if (strEQ(d,"connect")) return -KEY_connect;
5318 if (strEQ(d,"closedir")) return -KEY_closedir;
5319 if (strEQ(d,"continue")) return -KEY_continue;
5324 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5329 if (strEQ(d,"do")) return KEY_do;
5332 if (strEQ(d,"die")) return -KEY_die;
5335 if (strEQ(d,"dump")) return -KEY_dump;
5338 if (strEQ(d,"delete")) return KEY_delete;
5341 if (strEQ(d,"defined")) return KEY_defined;
5342 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5345 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5350 if (strEQ(d,"END")) return KEY_END;
5355 if (strEQ(d,"eq")) return -KEY_eq;
5358 if (strEQ(d,"eof")) return -KEY_eof;
5359 if (strEQ(d,"exp")) return -KEY_exp;
5362 if (strEQ(d,"else")) return KEY_else;
5363 if (strEQ(d,"exit")) return -KEY_exit;
5364 if (strEQ(d,"eval")) return KEY_eval;
5365 if (strEQ(d,"exec")) return -KEY_exec;
5366 if (strEQ(d,"each")) return -KEY_each;
5369 if (strEQ(d,"elsif")) return KEY_elsif;
5372 if (strEQ(d,"exists")) return KEY_exists;
5373 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5376 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5377 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5380 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5383 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5384 if (strEQ(d,"endservent")) return -KEY_endservent;
5387 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5394 if (strEQ(d,"for")) return KEY_for;
5397 if (strEQ(d,"fork")) return -KEY_fork;
5400 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5401 if (strEQ(d,"flock")) return -KEY_flock;
5404 if (strEQ(d,"format")) return KEY_format;
5405 if (strEQ(d,"fileno")) return -KEY_fileno;
5408 if (strEQ(d,"foreach")) return KEY_foreach;
5411 if (strEQ(d,"formline")) return -KEY_formline;
5416 if (strnEQ(d,"get",3)) {
5421 if (strEQ(d,"ppid")) return -KEY_getppid;
5422 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5425 if (strEQ(d,"pwent")) return -KEY_getpwent;
5426 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5427 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5430 if (strEQ(d,"peername")) return -KEY_getpeername;
5431 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5432 if (strEQ(d,"priority")) return -KEY_getpriority;
5435 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5438 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5442 else if (*d == 'h') {
5443 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5444 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5445 if (strEQ(d,"hostent")) return -KEY_gethostent;
5447 else if (*d == 'n') {
5448 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5449 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5450 if (strEQ(d,"netent")) return -KEY_getnetent;
5452 else if (*d == 's') {
5453 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5454 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5455 if (strEQ(d,"servent")) return -KEY_getservent;
5456 if (strEQ(d,"sockname")) return -KEY_getsockname;
5457 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5459 else if (*d == 'g') {
5460 if (strEQ(d,"grent")) return -KEY_getgrent;
5461 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5462 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5464 else if (*d == 'l') {
5465 if (strEQ(d,"login")) return -KEY_getlogin;
5467 else if (strEQ(d,"c")) return -KEY_getc;
5472 if (strEQ(d,"gt")) return -KEY_gt;
5473 if (strEQ(d,"ge")) return -KEY_ge;
5476 if (strEQ(d,"grep")) return KEY_grep;
5477 if (strEQ(d,"goto")) return KEY_goto;
5478 if (strEQ(d,"glob")) return KEY_glob;
5481 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5486 if (strEQ(d,"hex")) return -KEY_hex;
5489 if (strEQ(d,"INIT")) return KEY_INIT;
5494 if (strEQ(d,"if")) return KEY_if;
5497 if (strEQ(d,"int")) return -KEY_int;
5500 if (strEQ(d,"index")) return -KEY_index;
5501 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5506 if (strEQ(d,"join")) return -KEY_join;
5510 if (strEQ(d,"keys")) return -KEY_keys;
5511 if (strEQ(d,"kill")) return -KEY_kill;
5517 if (strEQ(d,"lt")) return -KEY_lt;
5518 if (strEQ(d,"le")) return -KEY_le;
5519 if (strEQ(d,"lc")) return -KEY_lc;
5522 if (strEQ(d,"log")) return -KEY_log;
5525 if (strEQ(d,"last")) return KEY_last;
5526 if (strEQ(d,"link")) return -KEY_link;
5527 if (strEQ(d,"lock")) return -KEY_lock;
5530 if (strEQ(d,"local")) return KEY_local;
5531 if (strEQ(d,"lstat")) return -KEY_lstat;
5534 if (strEQ(d,"length")) return -KEY_length;
5535 if (strEQ(d,"listen")) return -KEY_listen;
5538 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5541 if (strEQ(d,"localtime")) return -KEY_localtime;
5547 case 1: return KEY_m;
5549 if (strEQ(d,"my")) return KEY_my;
5552 if (strEQ(d,"map")) return KEY_map;
5555 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5558 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5559 if (strEQ(d,"msgget")) return -KEY_msgget;
5560 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5561 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5566 if (strEQ(d,"next")) return KEY_next;
5567 if (strEQ(d,"ne")) return -KEY_ne;
5568 if (strEQ(d,"not")) return -KEY_not;
5569 if (strEQ(d,"no")) return KEY_no;
5574 if (strEQ(d,"or")) return -KEY_or;
5577 if (strEQ(d,"ord")) return -KEY_ord;
5578 if (strEQ(d,"oct")) return -KEY_oct;
5579 if (strEQ(d,"our")) return KEY_our;
5582 if (strEQ(d,"open")) return -KEY_open;
5585 if (strEQ(d,"opendir")) return -KEY_opendir;
5592 if (strEQ(d,"pop")) return -KEY_pop;
5593 if (strEQ(d,"pos")) return KEY_pos;
5596 if (strEQ(d,"push")) return -KEY_push;
5597 if (strEQ(d,"pack")) return -KEY_pack;
5598 if (strEQ(d,"pipe")) return -KEY_pipe;
5601 if (strEQ(d,"print")) return KEY_print;
5604 if (strEQ(d,"printf")) return KEY_printf;
5607 if (strEQ(d,"package")) return KEY_package;
5610 if (strEQ(d,"prototype")) return KEY_prototype;
5615 if (strEQ(d,"q")) return KEY_q;
5616 if (strEQ(d,"qr")) return KEY_qr;
5617 if (strEQ(d,"qq")) return KEY_qq;
5618 if (strEQ(d,"qw")) return KEY_qw;
5619 if (strEQ(d,"qx")) return KEY_qx;
5621 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5626 if (strEQ(d,"ref")) return -KEY_ref;
5629 if (strEQ(d,"read")) return -KEY_read;
5630 if (strEQ(d,"rand")) return -KEY_rand;
5631 if (strEQ(d,"recv")) return -KEY_recv;
5632 if (strEQ(d,"redo")) return KEY_redo;
5635 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5636 if (strEQ(d,"reset")) return -KEY_reset;
5639 if (strEQ(d,"return")) return KEY_return;
5640 if (strEQ(d,"rename")) return -KEY_rename;
5641 if (strEQ(d,"rindex")) return -KEY_rindex;
5644 if (strEQ(d,"require")) return KEY_require;
5645 if (strEQ(d,"reverse")) return -KEY_reverse;
5646 if (strEQ(d,"readdir")) return -KEY_readdir;
5649 if (strEQ(d,"readlink")) return -KEY_readlink;
5650 if (strEQ(d,"readline")) return -KEY_readline;
5651 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5654 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5660 case 0: return KEY_s;
5662 if (strEQ(d,"scalar")) return KEY_scalar;
5667 if (strEQ(d,"seek")) return -KEY_seek;
5668 if (strEQ(d,"send")) return -KEY_send;
5671 if (strEQ(d,"semop")) return -KEY_semop;
5674 if (strEQ(d,"select")) return -KEY_select;
5675 if (strEQ(d,"semctl")) return -KEY_semctl;
5676 if (strEQ(d,"semget")) return -KEY_semget;
5679 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5680 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5683 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5684 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5687 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5690 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5691 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5692 if (strEQ(d,"setservent")) return -KEY_setservent;
5695 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5696 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5703 if (strEQ(d,"shift")) return -KEY_shift;
5706 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5707 if (strEQ(d,"shmget")) return -KEY_shmget;
5710 if (strEQ(d,"shmread")) return -KEY_shmread;
5713 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5714 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5719 if (strEQ(d,"sin")) return -KEY_sin;
5722 if (strEQ(d,"sleep")) return -KEY_sleep;
5725 if (strEQ(d,"sort")) return KEY_sort;
5726 if (strEQ(d,"socket")) return -KEY_socket;
5727 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5730 if (strEQ(d,"split")) return KEY_split;
5731 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5732 if (strEQ(d,"splice")) return -KEY_splice;
5735 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5738 if (strEQ(d,"srand")) return -KEY_srand;
5741 if (strEQ(d,"stat")) return -KEY_stat;
5742 if (strEQ(d,"study")) return KEY_study;
5745 if (strEQ(d,"substr")) return -KEY_substr;
5746 if (strEQ(d,"sub")) return KEY_sub;
5751 if (strEQ(d,"system")) return -KEY_system;
5754 if (strEQ(d,"symlink")) return -KEY_symlink;
5755 if (strEQ(d,"syscall")) return -KEY_syscall;
5756 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5757 if (strEQ(d,"sysread")) return -KEY_sysread;
5758 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5761 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5770 if (strEQ(d,"tr")) return KEY_tr;
5773 if (strEQ(d,"tie")) return KEY_tie;
5776 if (strEQ(d,"tell")) return -KEY_tell;
5777 if (strEQ(d,"tied")) return KEY_tied;
5778 if (strEQ(d,"time")) return -KEY_time;
5781 if (strEQ(d,"times")) return -KEY_times;
5784 if (strEQ(d,"telldir")) return -KEY_telldir;
5787 if (strEQ(d,"truncate")) return -KEY_truncate;
5794 if (strEQ(d,"uc")) return -KEY_uc;
5797 if (strEQ(d,"use")) return KEY_use;
5800 if (strEQ(d,"undef")) return KEY_undef;
5801 if (strEQ(d,"until")) return KEY_until;
5802 if (strEQ(d,"untie")) return KEY_untie;
5803 if (strEQ(d,"utime")) return -KEY_utime;
5804 if (strEQ(d,"umask")) return -KEY_umask;
5807 if (strEQ(d,"unless")) return KEY_unless;
5808 if (strEQ(d,"unpack")) return -KEY_unpack;
5809 if (strEQ(d,"unlink")) return -KEY_unlink;
5812 if (strEQ(d,"unshift")) return -KEY_unshift;
5813 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5818 if (strEQ(d,"values")) return -KEY_values;
5819 if (strEQ(d,"vec")) return -KEY_vec;
5824 if (strEQ(d,"warn")) return -KEY_warn;
5825 if (strEQ(d,"wait")) return -KEY_wait;
5828 if (strEQ(d,"while")) return KEY_while;
5829 if (strEQ(d,"write")) return -KEY_write;
5832 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5835 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5840 if (len == 1) return -KEY_x;
5841 if (strEQ(d,"xor")) return -KEY_xor;
5844 if (len == 1) return KEY_y;
5853 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5857 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5858 if (ckWARN(WARN_SYNTAX)) {
5860 for (w = s+2; *w && level; w++) {
5867 for (; *w && isSPACE(*w); w++) ;
5868 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5869 Perl_warner(aTHX_ WARN_SYNTAX,
5870 "%s (...) interpreted as function",name);
5873 while (s < PL_bufend && isSPACE(*s))
5877 while (s < PL_bufend && isSPACE(*s))
5879 if (isIDFIRST_lazy_if(s,UTF)) {
5881 while (isALNUM_lazy_if(s,UTF))
5883 while (s < PL_bufend && isSPACE(*s))
5888 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5892 Perl_croak(aTHX_ "No comma allowed after %s", what);
5897 /* Either returns sv, or mortalizes sv and returns a new SV*.
5898 Best used as sv=new_constant(..., sv, ...).
5899 If s, pv are NULL, calls subroutine with one argument,
5900 and type is used with error messages only. */
5903 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5907 HV *table = GvHV(PL_hintgv); /* ^H */
5911 const char *why1, *why2, *why3;
5913 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5916 why2 = strEQ(key,"charnames")
5917 ? "(possibly a missing \"use charnames ...\")"
5919 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5920 (type ? type: "undef"), why2);
5922 /* This is convoluted and evil ("goto considered harmful")
5923 * but I do not understand the intricacies of all the different
5924 * failure modes of %^H in here. The goal here is to make
5925 * the most probable error message user-friendly. --jhi */
5930 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5931 (type ? type: "undef"), why1, why2, why3);
5933 yyerror(SvPVX(msg));
5937 cvp = hv_fetch(table, key, strlen(key), FALSE);
5938 if (!cvp || !SvOK(*cvp)) {
5941 why3 = "} is not defined";
5944 sv_2mortal(sv); /* Parent created it permanently */
5947 pv = sv_2mortal(newSVpvn(s, len));
5949 typesv = sv_2mortal(newSVpv(type, 0));
5951 typesv = &PL_sv_undef;
5953 PUSHSTACKi(PERLSI_OVERLOAD);
5965 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5969 /* Check the eval first */
5970 if (!PL_in_eval && SvTRUE(ERRSV)) {
5972 sv_catpv(ERRSV, "Propagated");
5973 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5975 res = SvREFCNT_inc(sv);
5979 (void)SvREFCNT_inc(res);
5988 why1 = "Call to &{$^H{";
5990 why3 = "}} did not return a defined value";
5999 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6001 register char *d = dest;
6002 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6005 Perl_croak(aTHX_ ident_too_long);
6006 if (isALNUM(*s)) /* UTF handled below */
6008 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6013 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6017 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6018 char *t = s + UTF8SKIP(s);
6019 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6021 if (d + (t - s) > e)
6022 Perl_croak(aTHX_ ident_too_long);
6023 Copy(s, d, t - s, char);
6036 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6046 e = d + destlen - 3; /* two-character token, ending NUL */
6048 while (isDIGIT(*s)) {
6050 Perl_croak(aTHX_ ident_too_long);
6057 Perl_croak(aTHX_ ident_too_long);
6058 if (isALNUM(*s)) /* UTF handled below */
6060 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6065 else if (*s == ':' && s[1] == ':') {
6069 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6070 char *t = s + UTF8SKIP(s);
6071 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6073 if (d + (t - s) > e)
6074 Perl_croak(aTHX_ ident_too_long);
6075 Copy(s, d, t - s, char);
6086 if (PL_lex_state != LEX_NORMAL)
6087 PL_lex_state = LEX_INTERPENDMAYBE;
6090 if (*s == '$' && s[1] &&
6091 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6104 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6109 if (isSPACE(s[-1])) {
6112 if (!SPACE_OR_TAB(ch)) {
6118 if (isIDFIRST_lazy_if(d,UTF)) {
6122 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6124 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6127 Copy(s, d, e - s, char);
6132 while ((isALNUM(*s) || *s == ':') && d < e)
6135 Perl_croak(aTHX_ ident_too_long);
6138 while (s < send && SPACE_OR_TAB(*s)) s++;
6139 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6140 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6141 const char *brack = *s == '[' ? "[...]" : "{...}";
6142 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6143 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6144 funny, dest, brack, funny, dest, brack);
6147 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6151 /* Handle extended ${^Foo} variables
6152 * 1999-02-27 mjd-perl-patch@plover.com */
6153 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6157 while (isALNUM(*s) && d < e) {
6161 Perl_croak(aTHX_ ident_too_long);
6166 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6167 PL_lex_state = LEX_INTERPEND;
6170 if (PL_lex_state == LEX_NORMAL) {
6171 if (ckWARN(WARN_AMBIGUOUS) &&
6172 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6174 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6175 "Ambiguous use of %c{%s} resolved to %c%s",
6176 funny, dest, funny, dest);
6181 s = bracket; /* let the parser handle it */
6185 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6186 PL_lex_state = LEX_INTERPEND;
6191 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6196 *pmfl |= PMf_GLOBAL;
6198 *pmfl |= PMf_CONTINUE;
6202 *pmfl |= PMf_MULTILINE;
6204 *pmfl |= PMf_SINGLELINE;
6206 *pmfl |= PMf_EXTENDED;
6210 S_scan_pat(pTHX_ char *start, I32 type)
6215 s = scan_str(start,FALSE,FALSE);
6217 Perl_croak(aTHX_ "Search pattern not terminated");
6219 pm = (PMOP*)newPMOP(type, 0);
6220 if (PL_multi_open == '?')
6221 pm->op_pmflags |= PMf_ONCE;
6223 while (*s && strchr("iomsx", *s))
6224 pmflag(&pm->op_pmflags,*s++);
6227 while (*s && strchr("iogcmsx", *s))
6228 pmflag(&pm->op_pmflags,*s++);
6230 pm->op_pmpermflags = pm->op_pmflags;
6232 PL_lex_op = (OP*)pm;
6233 yylval.ival = OP_MATCH;
6238 S_scan_subst(pTHX_ char *start)
6245 yylval.ival = OP_NULL;
6247 s = scan_str(start,FALSE,FALSE);
6250 Perl_croak(aTHX_ "Substitution pattern not terminated");
6252 if (s[-1] == PL_multi_open)
6255 first_start = PL_multi_start;
6256 s = scan_str(s,FALSE,FALSE);
6259 SvREFCNT_dec(PL_lex_stuff);
6260 PL_lex_stuff = Nullsv;
6262 Perl_croak(aTHX_ "Substitution replacement not terminated");
6264 PL_multi_start = first_start; /* so whole substitution is taken together */
6266 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6272 else if (strchr("iogcmsx", *s))
6273 pmflag(&pm->op_pmflags,*s++);
6280 PL_sublex_info.super_bufptr = s;
6281 PL_sublex_info.super_bufend = PL_bufend;
6283 pm->op_pmflags |= PMf_EVAL;
6284 repl = newSVpvn("",0);
6286 sv_catpv(repl, es ? "eval " : "do ");
6287 sv_catpvn(repl, "{ ", 2);
6288 sv_catsv(repl, PL_lex_repl);
6289 sv_catpvn(repl, " };", 2);
6291 SvREFCNT_dec(PL_lex_repl);
6295 pm->op_pmpermflags = pm->op_pmflags;
6296 PL_lex_op = (OP*)pm;
6297 yylval.ival = OP_SUBST;
6302 S_scan_trans(pTHX_ char *start)
6311 yylval.ival = OP_NULL;
6313 s = scan_str(start,FALSE,FALSE);
6315 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6316 if (s[-1] == PL_multi_open)
6319 s = scan_str(s,FALSE,FALSE);
6322 SvREFCNT_dec(PL_lex_stuff);
6323 PL_lex_stuff = Nullsv;
6325 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6328 complement = del = squash = 0;
6329 while (strchr("cds", *s)) {
6331 complement = OPpTRANS_COMPLEMENT;
6333 del = OPpTRANS_DELETE;
6335 squash = OPpTRANS_SQUASH;
6339 New(803, tbl, complement&&!del?258:256, short);
6340 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6341 o->op_private = del|squash|complement|
6342 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6343 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6346 yylval.ival = OP_TRANS;
6351 S_scan_heredoc(pTHX_ register char *s)
6354 I32 op_type = OP_SCALAR;
6361 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6365 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6368 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6369 if (*peek && strchr("`'\"",*peek)) {
6372 s = delimcpy(d, e, s, PL_bufend, term, &len);
6382 if (!isALNUM_lazy_if(s,UTF))
6383 deprecate("bare << to mean <<\"\"");
6384 for (; isALNUM_lazy_if(s,UTF); s++) {
6389 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6390 Perl_croak(aTHX_ "Delimiter for here document is too long");
6393 len = d - PL_tokenbuf;
6394 #ifndef PERL_STRICT_CR
6395 d = strchr(s, '\r');
6399 while (s < PL_bufend) {
6405 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6414 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6419 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6420 herewas = newSVpvn(s,PL_bufend-s);
6422 s--, herewas = newSVpvn(s,d-s);
6423 s += SvCUR(herewas);
6425 tmpstr = NEWSV(87,79);
6426 sv_upgrade(tmpstr, SVt_PVIV);
6431 else if (term == '`') {
6432 op_type = OP_BACKTICK;
6433 SvIVX(tmpstr) = '\\';
6437 PL_multi_start = CopLINE(PL_curcop);
6438 PL_multi_open = PL_multi_close = '<';
6439 term = *PL_tokenbuf;
6440 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6441 char *bufptr = PL_sublex_info.super_bufptr;
6442 char *bufend = PL_sublex_info.super_bufend;
6443 char *olds = s - SvCUR(herewas);
6444 s = strchr(bufptr, '\n');
6448 while (s < bufend &&
6449 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6451 CopLINE_inc(PL_curcop);
6454 CopLINE_set(PL_curcop, PL_multi_start);
6455 missingterm(PL_tokenbuf);
6457 sv_setpvn(herewas,bufptr,d-bufptr+1);
6458 sv_setpvn(tmpstr,d+1,s-d);
6460 sv_catpvn(herewas,s,bufend-s);
6461 (void)strcpy(bufptr,SvPVX(herewas));
6468 while (s < PL_bufend &&
6469 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6471 CopLINE_inc(PL_curcop);
6473 if (s >= PL_bufend) {
6474 CopLINE_set(PL_curcop, PL_multi_start);
6475 missingterm(PL_tokenbuf);
6477 sv_setpvn(tmpstr,d+1,s-d);
6479 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6481 sv_catpvn(herewas,s,PL_bufend-s);
6482 sv_setsv(PL_linestr,herewas);
6483 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6484 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6485 PL_last_lop = PL_last_uni = Nullch;
6488 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6489 while (s >= PL_bufend) { /* multiple line string? */
6491 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6492 CopLINE_set(PL_curcop, PL_multi_start);
6493 missingterm(PL_tokenbuf);
6495 CopLINE_inc(PL_curcop);
6496 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6497 PL_last_lop = PL_last_uni = Nullch;
6498 #ifndef PERL_STRICT_CR
6499 if (PL_bufend - PL_linestart >= 2) {
6500 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6501 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6503 PL_bufend[-2] = '\n';
6505 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6507 else if (PL_bufend[-1] == '\r')
6508 PL_bufend[-1] = '\n';
6510 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6511 PL_bufend[-1] = '\n';
6513 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6514 SV *sv = NEWSV(88,0);
6516 sv_upgrade(sv, SVt_PVMG);
6517 sv_setsv(sv,PL_linestr);
6518 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6520 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6523 sv_catsv(PL_linestr,herewas);
6524 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6528 sv_catsv(tmpstr,PL_linestr);
6533 PL_multi_end = CopLINE(PL_curcop);
6534 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6535 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6536 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6538 SvREFCNT_dec(herewas);
6539 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6541 PL_lex_stuff = tmpstr;
6542 yylval.ival = op_type;
6547 takes: current position in input buffer
6548 returns: new position in input buffer
6549 side-effects: yylval and lex_op are set.
6554 <FH> read from filehandle
6555 <pkg::FH> read from package qualified filehandle
6556 <pkg'FH> read from package qualified filehandle
6557 <$fh> read from filehandle in $fh
6563 S_scan_inputsymbol(pTHX_ char *start)
6565 register char *s = start; /* current position in buffer */
6571 d = PL_tokenbuf; /* start of temp holding space */
6572 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6573 end = strchr(s, '\n');
6576 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6578 /* die if we didn't have space for the contents of the <>,
6579 or if it didn't end, or if we see a newline
6582 if (len >= sizeof PL_tokenbuf)
6583 Perl_croak(aTHX_ "Excessively long <> operator");
6585 Perl_croak(aTHX_ "Unterminated <> operator");
6590 Remember, only scalar variables are interpreted as filehandles by
6591 this code. Anything more complex (e.g., <$fh{$num}>) will be
6592 treated as a glob() call.
6593 This code makes use of the fact that except for the $ at the front,
6594 a scalar variable and a filehandle look the same.
6596 if (*d == '$' && d[1]) d++;
6598 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6599 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6602 /* If we've tried to read what we allow filehandles to look like, and
6603 there's still text left, then it must be a glob() and not a getline.
6604 Use scan_str to pull out the stuff between the <> and treat it
6605 as nothing more than a string.
6608 if (d - PL_tokenbuf != len) {
6609 yylval.ival = OP_GLOB;
6611 s = scan_str(start,FALSE,FALSE);
6613 Perl_croak(aTHX_ "Glob not terminated");
6617 /* we're in a filehandle read situation */
6620 /* turn <> into <ARGV> */
6622 (void)strcpy(d,"ARGV");
6624 /* if <$fh>, create the ops to turn the variable into a
6630 /* try to find it in the pad for this block, otherwise find
6631 add symbol table ops
6633 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6634 OP *o = newOP(OP_PADSV, 0);
6636 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6639 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6640 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6641 newUNOP(OP_RV2SV, 0,
6642 newGVOP(OP_GV, 0, gv)));
6644 PL_lex_op->op_flags |= OPf_SPECIAL;
6645 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6646 yylval.ival = OP_NULL;
6649 /* If it's none of the above, it must be a literal filehandle
6650 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6652 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6653 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6654 yylval.ival = OP_NULL;
6663 takes: start position in buffer
6664 keep_quoted preserve \ on the embedded delimiter(s)
6665 keep_delims preserve the delimiters around the string
6666 returns: position to continue reading from buffer
6667 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6668 updates the read buffer.
6670 This subroutine pulls a string out of the input. It is called for:
6671 q single quotes q(literal text)
6672 ' single quotes 'literal text'
6673 qq double quotes qq(interpolate $here please)
6674 " double quotes "interpolate $here please"
6675 qx backticks qx(/bin/ls -l)
6676 ` backticks `/bin/ls -l`
6677 qw quote words @EXPORT_OK = qw( func() $spam )
6678 m// regexp match m/this/
6679 s/// regexp substitute s/this/that/
6680 tr/// string transliterate tr/this/that/
6681 y/// string transliterate y/this/that/
6682 ($*@) sub prototypes sub foo ($)
6683 (stuff) sub attr parameters sub foo : attr(stuff)
6684 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6686 In most of these cases (all but <>, patterns and transliterate)
6687 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6688 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6689 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6692 It skips whitespace before the string starts, and treats the first
6693 character as the delimiter. If the delimiter is one of ([{< then
6694 the corresponding "close" character )]}> is used as the closing
6695 delimiter. It allows quoting of delimiters, and if the string has
6696 balanced delimiters ([{<>}]) it allows nesting.
6698 On success, the SV with the resulting string is put into lex_stuff or,
6699 if that is already non-NULL, into lex_repl. The second case occurs only
6700 when parsing the RHS of the special constructs s/// and tr/// (y///).
6701 For convenience, the terminating delimiter character is stuffed into
6706 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6708 SV *sv; /* scalar value: string */
6709 char *tmps; /* temp string, used for delimiter matching */
6710 register char *s = start; /* current position in the buffer */
6711 register char term; /* terminating character */
6712 register char *to; /* current position in the sv's data */
6713 I32 brackets = 1; /* bracket nesting level */
6714 bool has_utf8 = FALSE; /* is there any utf8 content? */
6716 /* skip space before the delimiter */
6720 /* mark where we are, in case we need to report errors */
6723 /* after skipping whitespace, the next character is the terminator */
6725 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6728 /* mark where we are */
6729 PL_multi_start = CopLINE(PL_curcop);
6730 PL_multi_open = term;
6732 /* find corresponding closing delimiter */
6733 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6735 PL_multi_close = term;
6737 /* create a new SV to hold the contents. 87 is leak category, I'm
6738 assuming. 79 is the SV's initial length. What a random number. */
6740 sv_upgrade(sv, SVt_PVIV);
6742 (void)SvPOK_only(sv); /* validate pointer */
6744 /* move past delimiter and try to read a complete string */
6746 sv_catpvn(sv, s, 1);
6749 /* extend sv if need be */
6750 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6751 /* set 'to' to the next character in the sv's string */
6752 to = SvPVX(sv)+SvCUR(sv);
6754 /* if open delimiter is the close delimiter read unbridle */
6755 if (PL_multi_open == PL_multi_close) {
6756 for (; s < PL_bufend; s++,to++) {
6757 /* embedded newlines increment the current line number */
6758 if (*s == '\n' && !PL_rsfp)
6759 CopLINE_inc(PL_curcop);
6760 /* handle quoted delimiters */
6761 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6762 if (!keep_quoted && s[1] == term)
6764 /* any other quotes are simply copied straight through */
6768 /* terminate when run out of buffer (the for() condition), or
6769 have found the terminator */
6770 else if (*s == term)
6772 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6778 /* if the terminator isn't the same as the start character (e.g.,
6779 matched brackets), we have to allow more in the quoting, and
6780 be prepared for nested brackets.
6783 /* read until we run out of string, or we find the terminator */
6784 for (; s < PL_bufend; s++,to++) {
6785 /* embedded newlines increment the line count */
6786 if (*s == '\n' && !PL_rsfp)
6787 CopLINE_inc(PL_curcop);
6788 /* backslashes can escape the open or closing characters */
6789 if (*s == '\\' && s+1 < PL_bufend) {
6791 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6796 /* allow nested opens and closes */
6797 else if (*s == PL_multi_close && --brackets <= 0)
6799 else if (*s == PL_multi_open)
6801 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6806 /* terminate the copied string and update the sv's end-of-string */
6808 SvCUR_set(sv, to - SvPVX(sv));
6811 * this next chunk reads more into the buffer if we're not done yet
6815 break; /* handle case where we are done yet :-) */
6817 #ifndef PERL_STRICT_CR
6818 if (to - SvPVX(sv) >= 2) {
6819 if ((to[-2] == '\r' && to[-1] == '\n') ||
6820 (to[-2] == '\n' && to[-1] == '\r'))
6824 SvCUR_set(sv, to - SvPVX(sv));
6826 else if (to[-1] == '\r')
6829 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6833 /* if we're out of file, or a read fails, bail and reset the current
6834 line marker so we can report where the unterminated string began
6837 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6839 CopLINE_set(PL_curcop, PL_multi_start);
6842 /* we read a line, so increment our line counter */
6843 CopLINE_inc(PL_curcop);
6845 /* update debugger info */
6846 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6847 SV *sv = NEWSV(88,0);
6849 sv_upgrade(sv, SVt_PVMG);
6850 sv_setsv(sv,PL_linestr);
6851 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6854 /* having changed the buffer, we must update PL_bufend */
6855 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6856 PL_last_lop = PL_last_uni = Nullch;
6859 /* at this point, we have successfully read the delimited string */
6862 sv_catpvn(sv, s, 1);
6865 PL_multi_end = CopLINE(PL_curcop);
6868 /* if we allocated too much space, give some back */
6869 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6870 SvLEN_set(sv, SvCUR(sv) + 1);
6871 Renew(SvPVX(sv), SvLEN(sv), char);
6874 /* decide whether this is the first or second quoted string we've read
6887 takes: pointer to position in buffer
6888 returns: pointer to new position in buffer
6889 side-effects: builds ops for the constant in yylval.op
6891 Read a number in any of the formats that Perl accepts:
6893 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
6894 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
6897 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
6899 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6902 If it reads a number without a decimal point or an exponent, it will
6903 try converting the number to an integer and see if it can do so
6904 without loss of precision.
6908 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6910 register char *s = start; /* current position in buffer */
6911 register char *d; /* destination in temp buffer */
6912 register char *e; /* end of temp buffer */
6913 NV nv; /* number read, as a double */
6914 SV *sv = Nullsv; /* place to put the converted number */
6915 bool floatit; /* boolean: int or float? */
6916 char *lastub = 0; /* position of last underbar */
6917 static char number_too_long[] = "Number too long";
6919 /* We use the first character to decide what type of number this is */
6923 Perl_croak(aTHX_ "panic: scan_num");
6925 /* if it starts with a 0, it could be an octal number, a decimal in
6926 0.13 disguise, or a hexadecimal number, or a binary number. */
6930 u holds the "number so far"
6931 shift the power of 2 of the base
6932 (hex == 4, octal == 3, binary == 1)
6933 overflowed was the number more than we can hold?
6935 Shift is used when we add a digit. It also serves as an "are
6936 we in octal/hex/binary?" indicator to disallow hex characters
6942 bool overflowed = FALSE;
6943 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6944 static char* bases[5] = { "", "binary", "", "octal",
6946 static char* Bases[5] = { "", "Binary", "", "Octal",
6948 static char *maxima[5] = { "",
6949 "0b11111111111111111111111111111111",
6953 char *base, *Base, *max;
6959 } else if (s[1] == 'b') {
6963 /* check for a decimal in disguise */
6964 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6966 /* so it must be octal */
6973 if (ckWARN(WARN_SYNTAX))
6974 Perl_warner(aTHX_ WARN_SYNTAX,
6975 "Misplaced _ in number");
6979 base = bases[shift];
6980 Base = Bases[shift];
6981 max = maxima[shift];
6983 /* read the rest of the number */
6985 /* x is used in the overflow test,
6986 b is the digit we're adding on. */
6991 /* if we don't mention it, we're done */
6995 /* _ are ignored -- but warned about if consecutive */
6997 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
6998 Perl_warner(aTHX_ WARN_SYNTAX,
6999 "Misplaced _ in number");
7003 /* 8 and 9 are not octal */
7006 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7010 case '2': case '3': case '4':
7011 case '5': case '6': case '7':
7013 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7017 b = *s++ & 15; /* ASCII digit -> value of digit */
7021 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7022 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7023 /* make sure they said 0x */
7028 /* Prepare to put the digit we have onto the end
7029 of the number so far. We check for overflows.
7034 x = u << shift; /* make room for the digit */
7036 if ((x >> shift) != u
7037 && !(PL_hints & HINT_NEW_BINARY)) {
7040 if (ckWARN_d(WARN_OVERFLOW))
7041 Perl_warner(aTHX_ WARN_OVERFLOW,
7042 "Integer overflow in %s number",
7045 u = x | b; /* add the digit to the end */
7048 n *= nvshift[shift];
7049 /* If an NV has not enough bits in its
7050 * mantissa to represent an UV this summing of
7051 * small low-order numbers is a waste of time
7052 * (because the NV cannot preserve the
7053 * low-order bits anyway): we could just
7054 * remember when did we overflow and in the
7055 * end just multiply n by the right
7063 /* if we get here, we had success: make a scalar value from
7068 /* final misplaced underbar check */
7070 if (ckWARN(WARN_SYNTAX))
7071 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7076 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7077 Perl_warner(aTHX_ WARN_PORTABLE,
7078 "%s number > %s non-portable",
7084 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7085 Perl_warner(aTHX_ WARN_PORTABLE,
7086 "%s number > %s non-portable",
7091 if (PL_hints & HINT_NEW_BINARY)
7092 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7097 handle decimal numbers.
7098 we're also sent here when we read a 0 as the first digit
7100 case '1': case '2': case '3': case '4': case '5':
7101 case '6': case '7': case '8': case '9': case '.':
7104 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7107 /* read next group of digits and _ and copy into d */
7108 while (isDIGIT(*s) || *s == '_') {
7109 /* skip underscores, checking for misplaced ones
7113 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7114 Perl_warner(aTHX_ WARN_SYNTAX,
7115 "Misplaced _ in number");
7119 /* check for end of fixed-length buffer */
7121 Perl_croak(aTHX_ number_too_long);
7122 /* if we're ok, copy the character */
7127 /* final misplaced underbar check */
7128 if (lastub && s == lastub + 1) {
7129 if (ckWARN(WARN_SYNTAX))
7130 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7133 /* read a decimal portion if there is one. avoid
7134 3..5 being interpreted as the number 3. followed
7137 if (*s == '.' && s[1] != '.') {
7142 if (ckWARN(WARN_SYNTAX))
7143 Perl_warner(aTHX_ WARN_SYNTAX,
7144 "Misplaced _ in number");
7148 /* copy, ignoring underbars, until we run out of digits.
7150 for (; isDIGIT(*s) || *s == '_'; s++) {
7151 /* fixed length buffer check */
7153 Perl_croak(aTHX_ number_too_long);
7155 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7156 Perl_warner(aTHX_ WARN_SYNTAX,
7157 "Misplaced _ in number");
7163 /* fractional part ending in underbar? */
7165 if (ckWARN(WARN_SYNTAX))
7166 Perl_warner(aTHX_ WARN_SYNTAX,
7167 "Misplaced _ in number");
7169 if (*s == '.' && isDIGIT(s[1])) {
7170 /* oops, it's really a v-string, but without the "v" */
7176 /* read exponent part, if present */
7177 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7181 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7182 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7184 /* stray preinitial _ */
7186 if (ckWARN(WARN_SYNTAX))
7187 Perl_warner(aTHX_ WARN_SYNTAX,
7188 "Misplaced _ in number");
7192 /* allow positive or negative exponent */
7193 if (*s == '+' || *s == '-')
7196 /* stray initial _ */
7198 if (ckWARN(WARN_SYNTAX))
7199 Perl_warner(aTHX_ WARN_SYNTAX,
7200 "Misplaced _ in number");
7204 /* read digits of exponent */
7205 while (isDIGIT(*s) || *s == '_') {
7208 Perl_croak(aTHX_ number_too_long);
7212 if (ckWARN(WARN_SYNTAX) &&
7213 ((lastub && s == lastub + 1) ||
7214 (!isDIGIT(s[1]) && s[1] != '_')))
7215 Perl_warner(aTHX_ WARN_SYNTAX,
7216 "Misplaced _ in number");
7223 /* make an sv from the string */
7227 We try to do an integer conversion first if no characters
7228 indicating "float" have been found.
7233 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7235 if (flags == IS_NUMBER_IN_UV) {
7237 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7240 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7241 if (uv <= (UV) IV_MIN)
7242 sv_setiv(sv, -(IV)uv);
7249 /* terminate the string */
7251 nv = Atof(PL_tokenbuf);
7255 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7256 (PL_hints & HINT_NEW_INTEGER) )
7257 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7258 (floatit ? "float" : "integer"),
7262 /* if it starts with a v, it could be a v-string */
7268 while (isDIGIT(*pos) || *pos == '_')
7270 if (!isALPHA(*pos)) {
7272 U8 tmpbuf[UTF8_MAXLEN+1];
7274 s++; /* get past 'v' */
7277 sv_setpvn(sv, "", 0);
7280 if (*s == '0' && isDIGIT(s[1]))
7281 yyerror("Octal number in vector unsupported");
7284 /* this is atoi() that tolerates underscores */
7287 while (--end >= s) {
7292 rev += (*end - '0') * mult;
7294 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7295 Perl_warner(aTHX_ WARN_OVERFLOW,
7296 "Integer overflow in decimal number");
7299 /* Append native character for the rev point */
7300 tmpend = uvchr_to_utf8(tmpbuf, rev);
7301 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7302 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
7304 if (*pos == '.' && isDIGIT(pos[1]))
7310 while (isDIGIT(*pos) || *pos == '_')
7320 /* make the op for the constant and return */
7323 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7325 lvalp->opval = Nullop;
7331 S_scan_formline(pTHX_ register char *s)
7335 SV *stuff = newSVpvn("",0);
7336 bool needargs = FALSE;
7339 if (*s == '.' || *s == /*{*/'}') {
7341 #ifdef PERL_STRICT_CR
7342 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7344 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7346 if (*t == '\n' || t == PL_bufend)
7349 if (PL_in_eval && !PL_rsfp) {
7350 eol = strchr(s,'\n');
7355 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7357 for (t = s; t < eol; t++) {
7358 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7360 goto enough; /* ~~ must be first line in formline */
7362 if (*t == '@' || *t == '^')
7366 sv_catpvn(stuff, s, eol-s);
7367 #ifndef PERL_STRICT_CR
7368 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7369 char *end = SvPVX(stuff) + SvCUR(stuff);
7381 s = filter_gets(PL_linestr, PL_rsfp, 0);
7382 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7383 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7384 PL_last_lop = PL_last_uni = Nullch;
7387 yyerror("Format not terminated");
7397 PL_lex_state = LEX_NORMAL;
7398 PL_nextval[PL_nexttoke].ival = 0;
7402 PL_lex_state = LEX_FORMLINE;
7403 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7405 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7409 SvREFCNT_dec(stuff);
7410 PL_lex_formbrack = 0;
7421 PL_cshlen = strlen(PL_cshname);
7426 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7428 I32 oldsavestack_ix = PL_savestack_ix;
7429 CV* outsidecv = PL_compcv;
7433 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7435 SAVEI32(PL_subline);
7436 save_item(PL_subname);
7439 SAVESPTR(PL_comppad_name);
7440 SAVESPTR(PL_compcv);
7441 SAVEI32(PL_comppad_name_fill);
7442 SAVEI32(PL_min_intro_pending);
7443 SAVEI32(PL_max_intro_pending);
7444 SAVEI32(PL_pad_reset_pending);
7446 PL_compcv = (CV*)NEWSV(1104,0);
7447 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7448 CvFLAGS(PL_compcv) |= flags;
7450 PL_comppad = newAV();
7451 av_push(PL_comppad, Nullsv);
7452 PL_curpad = AvARRAY(PL_comppad);
7453 PL_comppad_name = newAV();
7454 PL_comppad_name_fill = 0;
7455 PL_min_intro_pending = 0;
7457 PL_subline = CopLINE(PL_curcop);
7459 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7460 PL_curpad[0] = (SV*)newAV();
7461 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7462 #endif /* USE_THREADS */
7464 comppadlist = newAV();
7465 AvREAL_off(comppadlist);
7466 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7467 av_store(comppadlist, 1, (SV*)PL_comppad);
7469 CvPADLIST(PL_compcv) = comppadlist;
7470 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7472 CvOWNER(PL_compcv) = 0;
7473 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7474 MUTEX_INIT(CvMUTEXP(PL_compcv));
7475 #endif /* USE_THREADS */
7477 return oldsavestack_ix;
7481 #pragma segment Perl_yylex
7484 Perl_yywarn(pTHX_ char *s)
7486 PL_in_eval |= EVAL_WARNONLY;
7488 PL_in_eval &= ~EVAL_WARNONLY;
7493 Perl_yyerror(pTHX_ char *s)
7496 char *context = NULL;
7500 if (!yychar || (yychar == ';' && !PL_rsfp))
7502 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7503 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7504 while (isSPACE(*PL_oldoldbufptr))
7506 context = PL_oldoldbufptr;
7507 contlen = PL_bufptr - PL_oldoldbufptr;
7509 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7510 PL_oldbufptr != PL_bufptr) {
7511 while (isSPACE(*PL_oldbufptr))
7513 context = PL_oldbufptr;
7514 contlen = PL_bufptr - PL_oldbufptr;
7516 else if (yychar > 255)
7517 where = "next token ???";
7518 #ifdef USE_PURE_BISON
7519 /* GNU Bison sets the value -2 */
7520 else if (yychar == -2) {
7522 else if ((yychar & 127) == 127) {
7524 if (PL_lex_state == LEX_NORMAL ||
7525 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7526 where = "at end of line";
7527 else if (PL_lex_inpat)
7528 where = "within pattern";
7530 where = "within string";
7533 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7535 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7536 else if (isPRINT_LC(yychar))
7537 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7539 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7540 where = SvPVX(where_sv);
7542 msg = sv_2mortal(newSVpv(s, 0));
7543 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7544 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7546 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7548 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7549 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7550 Perl_sv_catpvf(aTHX_ msg,
7551 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7552 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7555 if (PL_in_eval & EVAL_WARNONLY)
7556 Perl_warn(aTHX_ "%"SVf, msg);
7559 if (PL_error_count >= 10) {
7560 if (PL_in_eval && SvCUR(ERRSV))
7561 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7562 ERRSV, CopFILE(PL_curcop));
7564 Perl_croak(aTHX_ "%s has too many errors.\n",
7565 CopFILE(PL_curcop));
7568 PL_in_my_stash = Nullhv;
7572 #pragma segment Main
7576 S_swallow_bom(pTHX_ U8 *s)
7579 slen = SvCUR(PL_linestr);
7583 /* UTF-16 little-endian */
7584 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7585 Perl_croak(aTHX_ "Unsupported script encoding");
7586 #ifndef PERL_NO_UTF16_FILTER
7587 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7589 if (PL_bufend > (char*)s) {
7593 filter_add(utf16rev_textfilter, NULL);
7594 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7595 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7596 PL_bufend - (char*)s - 1,
7598 Copy(news, s, newlen, U8);
7599 SvCUR_set(PL_linestr, newlen);
7600 PL_bufend = SvPVX(PL_linestr) + newlen;
7601 news[newlen++] = '\0';
7605 Perl_croak(aTHX_ "Unsupported script encoding");
7610 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7611 #ifndef PERL_NO_UTF16_FILTER
7612 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7614 if (PL_bufend > (char *)s) {
7618 filter_add(utf16_textfilter, NULL);
7619 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7620 PL_bufend = (char*)utf16_to_utf8(s, news,
7621 PL_bufend - (char*)s,
7623 Copy(news, s, newlen, U8);
7624 SvCUR_set(PL_linestr, newlen);
7625 PL_bufend = SvPVX(PL_linestr) + newlen;
7626 news[newlen++] = '\0';
7630 Perl_croak(aTHX_ "Unsupported script encoding");
7635 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7636 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7641 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7642 s[2] == 0xFE && s[3] == 0xFF)
7644 Perl_croak(aTHX_ "Unsupported script encoding");
7656 * Restore a source filter.
7660 restore_rsfp(pTHXo_ void *f)
7662 PerlIO *fp = (PerlIO*)f;
7664 if (PL_rsfp == PerlIO_stdin())
7665 PerlIO_clearerr(PL_rsfp);
7666 else if (PL_rsfp && (PL_rsfp != fp))
7667 PerlIO_close(PL_rsfp);
7671 #ifndef PERL_NO_UTF16_FILTER
7673 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7675 I32 count = FILTER_READ(idx+1, sv, maxlen);
7680 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7681 if (!*SvPV_nolen(sv))
7682 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7685 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7686 sv_usepvn(sv, (char*)tmps, tend - tmps);
7692 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7694 I32 count = FILTER_READ(idx+1, sv, maxlen);
7699 if (!*SvPV_nolen(sv))
7700 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7703 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7704 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7705 sv_usepvn(sv, (char*)tmps, tend - tmps);