3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
30 static void restore_rsfp(pTHX_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHX_ 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_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
323 Perl_deprecate_old(pTHX_ char *s)
325 /* This function should NOT be called for any new deprecated warnings */
326 /* Use Perl_deprecate instead */
328 /* It is here to maintain backward compatibility with the pre-5.8 */
329 /* warnings category hierarchy. The "deprecated" category used to */
330 /* live under the "syntax" category. It is now a top-level category */
331 /* in its own right. */
333 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
334 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
335 "Use of %s is deprecated", s);
340 * Deprecate a comma-less variable list.
346 deprecate_old("comma-less variable list");
350 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
351 * utf16-to-utf8-reversed.
354 #ifdef PERL_CR_FILTER
358 register char *s = SvPVX(sv);
359 register char *e = s + SvCUR(sv);
360 /* outer loop optimized to do nothing if there are no CR-LFs */
362 if (*s++ == '\r' && *s == '\n') {
363 /* hit a CR-LF, need to copy the rest */
364 register char *d = s - 1;
367 if (*s == '\r' && s[1] == '\n')
378 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
380 I32 count = FILTER_READ(idx+1, sv, maxlen);
381 if (count > 0 && !maxlen)
389 * Initialize variables. Uses the Perl save_stack to save its state (for
390 * recursive calls to the parser).
394 Perl_lex_start(pTHX_ SV *line)
399 SAVEI32(PL_lex_dojoin);
400 SAVEI32(PL_lex_brackets);
401 SAVEI32(PL_lex_casemods);
402 SAVEI32(PL_lex_starts);
403 SAVEI32(PL_lex_state);
404 SAVEVPTR(PL_lex_inpat);
405 SAVEI32(PL_lex_inwhat);
406 if (PL_lex_state == LEX_KNOWNEXT) {
407 I32 toke = PL_nexttoke;
408 while (--toke >= 0) {
409 SAVEI32(PL_nexttype[toke]);
410 SAVEVPTR(PL_nextval[toke]);
412 SAVEI32(PL_nexttoke);
414 SAVECOPLINE(PL_curcop);
417 SAVEPPTR(PL_oldbufptr);
418 SAVEPPTR(PL_oldoldbufptr);
419 SAVEPPTR(PL_last_lop);
420 SAVEPPTR(PL_last_uni);
421 SAVEPPTR(PL_linestart);
422 SAVESPTR(PL_linestr);
423 SAVEPPTR(PL_lex_brackstack);
424 SAVEPPTR(PL_lex_casestack);
425 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
426 SAVESPTR(PL_lex_stuff);
427 SAVEI32(PL_lex_defer);
428 SAVEI32(PL_sublex_info.sub_inwhat);
429 SAVESPTR(PL_lex_repl);
431 SAVEINT(PL_lex_expect);
433 PL_lex_state = LEX_NORMAL;
437 New(899, PL_lex_brackstack, 120, char);
438 New(899, PL_lex_casestack, 12, char);
439 SAVEFREEPV(PL_lex_brackstack);
440 SAVEFREEPV(PL_lex_casestack);
442 *PL_lex_casestack = '\0';
445 PL_lex_stuff = Nullsv;
446 PL_lex_repl = Nullsv;
450 PL_sublex_info.sub_inwhat = 0;
452 if (SvREADONLY(PL_linestr))
453 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
454 s = SvPV(PL_linestr, len);
455 if (len && s[len-1] != ';') {
456 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
457 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
458 sv_catpvn(PL_linestr, "\n;", 2);
460 SvTEMP_off(PL_linestr);
461 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
462 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
463 PL_last_lop = PL_last_uni = Nullch;
469 * Finalizer for lexing operations. Must be called when the parser is
470 * done with the lexer.
476 PL_doextract = FALSE;
481 * This subroutine has nothing to do with tilting, whether at windmills
482 * or pinball tables. Its name is short for "increment line". It
483 * increments the current line number in CopLINE(PL_curcop) and checks
484 * to see whether the line starts with a comment of the form
485 * # line 500 "foo.pm"
486 * If so, it sets the current line number and file to the values in the comment.
490 S_incline(pTHX_ char *s)
497 CopLINE_inc(PL_curcop);
500 while (SPACE_OR_TAB(*s)) s++;
501 if (strnEQ(s, "line", 4))
505 if (SPACE_OR_TAB(*s))
509 while (SPACE_OR_TAB(*s)) s++;
515 while (SPACE_OR_TAB(*s))
517 if (*s == '"' && (t = strchr(s+1, '"'))) {
522 for (t = s; !isSPACE(*t); t++) ;
525 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
527 if (*e != '\n' && *e != '\0')
528 return; /* false alarm */
533 CopFILE_free(PL_curcop);
534 CopFILE_set(PL_curcop, s);
537 CopLINE_set(PL_curcop, atoi(n)-1);
542 * Called to gobble the appropriate amount and type of whitespace.
543 * Skips comments as well.
547 S_skipspace(pTHX_ register char *s)
549 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
550 while (s < PL_bufend && SPACE_OR_TAB(*s))
556 SSize_t oldprevlen, oldoldprevlen;
557 SSize_t oldloplen = 0, oldunilen = 0;
558 while (s < PL_bufend && isSPACE(*s)) {
559 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
564 if (s < PL_bufend && *s == '#') {
565 while (s < PL_bufend && *s != '\n')
569 if (PL_in_eval && !PL_rsfp) {
576 /* only continue to recharge the buffer if we're at the end
577 * of the buffer, we're not reading from a source filter, and
578 * we're in normal lexing mode
580 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
581 PL_lex_state == LEX_FORMLINE)
584 /* try to recharge the buffer */
585 if ((s = filter_gets(PL_linestr, PL_rsfp,
586 (prevlen = SvCUR(PL_linestr)))) == Nullch)
588 /* end of file. Add on the -p or -n magic */
589 if (PL_minus_n || PL_minus_p) {
590 sv_setpv(PL_linestr,PL_minus_p ?
591 ";}continue{print or die qq(-p destination: $!\\n)" :
593 sv_catpv(PL_linestr,";}");
594 PL_minus_n = PL_minus_p = 0;
597 sv_setpv(PL_linestr,";");
599 /* reset variables for next time we lex */
600 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
602 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
603 PL_last_lop = PL_last_uni = Nullch;
605 /* Close the filehandle. Could be from -P preprocessor,
606 * STDIN, or a regular file. If we were reading code from
607 * STDIN (because the commandline held no -e or filename)
608 * then we don't close it, we reset it so the code can
609 * read from STDIN too.
612 if (PL_preprocess && !PL_in_eval)
613 (void)PerlProc_pclose(PL_rsfp);
614 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
615 PerlIO_clearerr(PL_rsfp);
617 (void)PerlIO_close(PL_rsfp);
622 /* not at end of file, so we only read another line */
623 /* make corresponding updates to old pointers, for yyerror() */
624 oldprevlen = PL_oldbufptr - PL_bufend;
625 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
627 oldunilen = PL_last_uni - PL_bufend;
629 oldloplen = PL_last_lop - PL_bufend;
630 PL_linestart = PL_bufptr = s + prevlen;
631 PL_bufend = s + SvCUR(PL_linestr);
633 PL_oldbufptr = s + oldprevlen;
634 PL_oldoldbufptr = s + oldoldprevlen;
636 PL_last_uni = s + oldunilen;
638 PL_last_lop = s + oldloplen;
641 /* debugger active and we're not compiling the debugger code,
642 * so store the line into the debugger's array of lines
644 if (PERLDB_LINE && PL_curstash != PL_debstash) {
645 SV *sv = NEWSV(85,0);
647 sv_upgrade(sv, SVt_PVMG);
648 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
651 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
658 * Check the unary operators to ensure there's no ambiguity in how they're
659 * used. An ambiguous piece of code would be:
661 * This doesn't mean rand() + 5. Because rand() is a unary operator,
662 * the +5 is its argument.
671 if (PL_oldoldbufptr != PL_last_uni)
673 while (isSPACE(*PL_last_uni))
675 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
676 if ((t = strchr(s, '(')) && t < PL_bufptr)
678 if (ckWARN_d(WARN_AMBIGUOUS)){
681 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
682 "Warning: Use of \"%s\" without parens is ambiguous",
689 * LOP : macro to build a list operator. Its behaviour has been replaced
690 * with a subroutine, S_lop() for which LOP is just another name.
693 #define LOP(f,x) return lop(f,x,s)
697 * Build a list operator (or something that might be one). The rules:
698 * - if we have a next token, then it's a list operator [why?]
699 * - if the next thing is an opening paren, then it's a function
700 * - else it's a list operator
704 S_lop(pTHX_ I32 f, int x, char *s)
711 PL_last_lop = PL_oldbufptr;
726 * When the lexer realizes it knows the next token (for instance,
727 * it is reordering tokens for the parser) then it can call S_force_next
728 * to know what token to return the next time the lexer is called. Caller
729 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
730 * handles the token correctly.
734 S_force_next(pTHX_ I32 type)
736 PL_nexttype[PL_nexttoke] = type;
738 if (PL_lex_state != LEX_KNOWNEXT) {
739 PL_lex_defer = PL_lex_state;
740 PL_lex_expect = PL_expect;
741 PL_lex_state = LEX_KNOWNEXT;
747 * When the lexer knows the next thing is a word (for instance, it has
748 * just seen -> and it knows that the next char is a word char, then
749 * it calls S_force_word to stick the next word into the PL_next lookahead.
752 * char *start : buffer position (must be within PL_linestr)
753 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
754 * int check_keyword : if true, Perl checks to make sure the word isn't
755 * a keyword (do this if the word is a label, e.g. goto FOO)
756 * int allow_pack : if true, : characters will also be allowed (require,
758 * int allow_initial_tick : used by the "sub" lexer only.
762 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
767 start = skipspace(start);
769 if (isIDFIRST_lazy_if(s,UTF) ||
770 (allow_pack && *s == ':') ||
771 (allow_initial_tick && *s == '\'') )
773 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
774 if (check_keyword && keyword(PL_tokenbuf, len))
776 if (token == METHOD) {
781 PL_expect = XOPERATOR;
784 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
785 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
793 * Called when the lexer wants $foo *foo &foo etc, but the program
794 * text only contains the "foo" portion. The first argument is a pointer
795 * to the "foo", and the second argument is the type symbol to prefix.
796 * Forces the next token to be a "WORD".
797 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
801 S_force_ident(pTHX_ register char *s, int kind)
804 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
805 PL_nextval[PL_nexttoke].opval = o;
808 o->op_private = OPpCONST_ENTERED;
809 /* XXX see note in pp_entereval() for why we forgo typo
810 warnings if the symbol must be introduced in an eval.
812 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
813 kind == '$' ? SVt_PV :
814 kind == '@' ? SVt_PVAV :
815 kind == '%' ? SVt_PVHV :
823 Perl_str_to_version(pTHX_ SV *sv)
828 char *start = SvPVx(sv,len);
829 bool utf = SvUTF8(sv) ? TRUE : FALSE;
830 char *end = start + len;
831 while (start < end) {
835 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
840 retval += ((NV)n)/nshift;
849 * Forces the next token to be a version number.
850 * If the next token appears to be an invalid version number, (e.g. "v2b"),
851 * and if "guessing" is TRUE, then no new token is created (and the caller
852 * must use an alternative parsing method).
856 S_force_version(pTHX_ char *s, int guessing)
858 OP *version = Nullop;
867 while (isDIGIT(*d) || *d == '_' || *d == '.')
869 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
871 s = scan_num(s, &yylval);
872 version = yylval.opval;
873 ver = cSVOPx(version)->op_sv;
874 if (SvPOK(ver) && !SvNIOK(ver)) {
875 (void)SvUPGRADE(ver, SVt_PVNV);
876 SvNVX(ver) = str_to_version(ver);
877 SvNOK_on(ver); /* hint that it is a version */
884 /* NOTE: The parser sees the package name and the VERSION swapped */
885 PL_nextval[PL_nexttoke].opval = version;
893 * Tokenize a quoted string passed in as an SV. It finds the next
894 * chunk, up to end of string or a backslash. It may make a new
895 * SV containing that chunk (if HINT_NEW_STRING is on). It also
900 S_tokeq(pTHX_ SV *sv)
911 s = SvPV_force(sv, len);
912 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
915 while (s < send && *s != '\\')
920 if ( PL_hints & HINT_NEW_STRING ) {
921 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
927 if (s + 1 < send && (s[1] == '\\'))
928 s++; /* all that, just for this */
933 SvCUR_set(sv, d - SvPVX(sv));
935 if ( PL_hints & HINT_NEW_STRING )
936 return new_constant(NULL, 0, "q", sv, pv, "q");
941 * Now come three functions related to double-quote context,
942 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
943 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
944 * interact with PL_lex_state, and create fake ( ... ) argument lists
945 * to handle functions and concatenation.
946 * They assume that whoever calls them will be setting up a fake
947 * join call, because each subthing puts a ',' after it. This lets
950 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
952 * (I'm not sure whether the spurious commas at the end of lcfirst's
953 * arguments and join's arguments are created or not).
958 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
960 * Pattern matching will set PL_lex_op to the pattern-matching op to
961 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
963 * OP_CONST and OP_READLINE are easy--just make the new op and return.
965 * Everything else becomes a FUNC.
967 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
968 * had an OP_CONST or OP_READLINE). This just sets us up for a
969 * call to S_sublex_push().
975 register I32 op_type = yylval.ival;
977 if (op_type == OP_NULL) {
978 yylval.opval = PL_lex_op;
982 if (op_type == OP_CONST || op_type == OP_READLINE) {
983 SV *sv = tokeq(PL_lex_stuff);
985 if (SvTYPE(sv) == SVt_PVIV) {
986 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
992 nsv = newSVpvn(p, len);
998 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
999 PL_lex_stuff = Nullsv;
1003 PL_sublex_info.super_state = PL_lex_state;
1004 PL_sublex_info.sub_inwhat = op_type;
1005 PL_sublex_info.sub_op = PL_lex_op;
1006 PL_lex_state = LEX_INTERPPUSH;
1010 yylval.opval = PL_lex_op;
1020 * Create a new scope to save the lexing state. The scope will be
1021 * ended in S_sublex_done. Returns a '(', starting the function arguments
1022 * to the uc, lc, etc. found before.
1023 * Sets PL_lex_state to LEX_INTERPCONCAT.
1031 PL_lex_state = PL_sublex_info.super_state;
1032 SAVEI32(PL_lex_dojoin);
1033 SAVEI32(PL_lex_brackets);
1034 SAVEI32(PL_lex_casemods);
1035 SAVEI32(PL_lex_starts);
1036 SAVEI32(PL_lex_state);
1037 SAVEVPTR(PL_lex_inpat);
1038 SAVEI32(PL_lex_inwhat);
1039 SAVECOPLINE(PL_curcop);
1040 SAVEPPTR(PL_bufptr);
1041 SAVEPPTR(PL_bufend);
1042 SAVEPPTR(PL_oldbufptr);
1043 SAVEPPTR(PL_oldoldbufptr);
1044 SAVEPPTR(PL_last_lop);
1045 SAVEPPTR(PL_last_uni);
1046 SAVEPPTR(PL_linestart);
1047 SAVESPTR(PL_linestr);
1048 SAVEPPTR(PL_lex_brackstack);
1049 SAVEPPTR(PL_lex_casestack);
1051 PL_linestr = PL_lex_stuff;
1052 PL_lex_stuff = Nullsv;
1054 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1055 = SvPVX(PL_linestr);
1056 PL_bufend += SvCUR(PL_linestr);
1057 PL_last_lop = PL_last_uni = Nullch;
1058 SAVEFREESV(PL_linestr);
1060 PL_lex_dojoin = FALSE;
1061 PL_lex_brackets = 0;
1062 New(899, PL_lex_brackstack, 120, char);
1063 New(899, PL_lex_casestack, 12, char);
1064 SAVEFREEPV(PL_lex_brackstack);
1065 SAVEFREEPV(PL_lex_casestack);
1066 PL_lex_casemods = 0;
1067 *PL_lex_casestack = '\0';
1069 PL_lex_state = LEX_INTERPCONCAT;
1070 CopLINE_set(PL_curcop, PL_multi_start);
1072 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1073 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1074 PL_lex_inpat = PL_sublex_info.sub_op;
1076 PL_lex_inpat = Nullop;
1083 * Restores lexer state after a S_sublex_push.
1089 if (!PL_lex_starts++) {
1090 SV *sv = newSVpvn("",0);
1091 if (SvUTF8(PL_linestr))
1093 PL_expect = XOPERATOR;
1094 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1098 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1099 PL_lex_state = LEX_INTERPCASEMOD;
1103 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1104 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1105 PL_linestr = PL_lex_repl;
1107 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1108 PL_bufend += SvCUR(PL_linestr);
1109 PL_last_lop = PL_last_uni = Nullch;
1110 SAVEFREESV(PL_linestr);
1111 PL_lex_dojoin = FALSE;
1112 PL_lex_brackets = 0;
1113 PL_lex_casemods = 0;
1114 *PL_lex_casestack = '\0';
1116 if (SvEVALED(PL_lex_repl)) {
1117 PL_lex_state = LEX_INTERPNORMAL;
1119 /* we don't clear PL_lex_repl here, so that we can check later
1120 whether this is an evalled subst; that means we rely on the
1121 logic to ensure sublex_done() is called again only via the
1122 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1125 PL_lex_state = LEX_INTERPCONCAT;
1126 PL_lex_repl = Nullsv;
1132 PL_bufend = SvPVX(PL_linestr);
1133 PL_bufend += SvCUR(PL_linestr);
1134 PL_expect = XOPERATOR;
1135 PL_sublex_info.sub_inwhat = 0;
1143 Extracts a pattern, double-quoted string, or transliteration. This
1146 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1147 processing a pattern (PL_lex_inpat is true), a transliteration
1148 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1150 Returns a pointer to the character scanned up to. Iff this is
1151 advanced from the start pointer supplied (ie if anything was
1152 successfully parsed), will leave an OP for the substring scanned
1153 in yylval. Caller must intuit reason for not parsing further
1154 by looking at the next characters herself.
1158 double-quoted style: \r and \n
1159 regexp special ones: \D \s
1161 backrefs: \1 (deprecated in substitution replacements)
1162 case and quoting: \U \Q \E
1163 stops on @ and $, but not for $ as tail anchor
1165 In transliterations:
1166 characters are VERY literal, except for - not at the start or end
1167 of the string, which indicates a range. scan_const expands the
1168 range to the full set of intermediate characters.
1170 In double-quoted strings:
1172 double-quoted style: \r and \n
1174 backrefs: \1 (deprecated)
1175 case and quoting: \U \Q \E
1178 scan_const does *not* construct ops to handle interpolated strings.
1179 It stops processing as soon as it finds an embedded $ or @ variable
1180 and leaves it to the caller to work out what's going on.
1182 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1184 $ in pattern could be $foo or could be tail anchor. Assumption:
1185 it's a tail anchor if $ is the last thing in the string, or if it's
1186 followed by one of ")| \n\t"
1188 \1 (backreferences) are turned into $1
1190 The structure of the code is
1191 while (there's a character to process) {
1192 handle transliteration ranges
1193 skip regexp comments
1194 skip # initiated comments in //x patterns
1195 check for embedded @foo
1196 check for embedded scalars
1198 leave intact backslashes from leave (below)
1199 deprecate \1 in strings and sub replacements
1200 handle string-changing backslashes \l \U \Q \E, etc.
1201 switch (what was escaped) {
1202 handle - in a transliteration (becomes a literal -)
1203 handle \132 octal characters
1204 handle 0x15 hex characters
1205 handle \cV (control V)
1206 handle printf backslashes (\f, \r, \n, etc)
1208 } (end if backslash)
1209 } (end while character to read)
1214 S_scan_const(pTHX_ char *start)
1216 register char *send = PL_bufend; /* end of the constant */
1217 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1218 register char *s = start; /* start of the constant */
1219 register char *d = SvPVX(sv); /* destination for copies */
1220 bool dorange = FALSE; /* are we in a translit range? */
1221 bool didrange = FALSE; /* did we just finish a range? */
1222 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1223 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1226 const char *leaveit = /* set of acceptably-backslashed characters */
1228 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1231 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1232 /* If we are doing a trans and we know we want UTF8 set expectation */
1233 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1234 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1238 while (s < send || dorange) {
1239 /* get transliterations out of the way (they're most literal) */
1240 if (PL_lex_inwhat == OP_TRANS) {
1241 /* expand a range A-Z to the full set of characters. AIE! */
1243 I32 i; /* current expanded character */
1244 I32 min; /* first character in range */
1245 I32 max; /* last character in range */
1248 char *c = (char*)utf8_hop((U8*)d, -1);
1252 *c = (char)UTF_TO_NATIVE(0xff);
1253 /* mark the range as done, and continue */
1259 i = d - SvPVX(sv); /* remember current offset */
1260 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1261 d = SvPVX(sv) + i; /* refresh d after realloc */
1262 d -= 2; /* eat the first char and the - */
1264 min = (U8)*d; /* first char in range */
1265 max = (U8)d[1]; /* last char in range */
1269 "Invalid [] range \"%c-%c\" in transliteration operator",
1270 (char)min, (char)max);
1274 if ((isLOWER(min) && isLOWER(max)) ||
1275 (isUPPER(min) && isUPPER(max))) {
1277 for (i = min; i <= max; i++)
1279 *d++ = NATIVE_TO_NEED(has_utf8,i);
1281 for (i = min; i <= max; i++)
1283 *d++ = NATIVE_TO_NEED(has_utf8,i);
1288 for (i = min; i <= max; i++)
1291 /* mark the range as done, and continue */
1297 /* range begins (ignore - as first or last char) */
1298 else if (*s == '-' && s+1 < send && s != start) {
1300 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1303 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1315 /* if we get here, we're not doing a transliteration */
1317 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1318 except for the last char, which will be done separately. */
1319 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1321 while (s < send && *s != ')')
1322 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1324 else if (s[2] == '{' /* This should match regcomp.c */
1325 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1328 char *regparse = s + (s[2] == '{' ? 3 : 4);
1331 while (count && (c = *regparse)) {
1332 if (c == '\\' && regparse[1])
1340 if (*regparse != ')') {
1341 regparse--; /* Leave one char for continuation. */
1342 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1344 while (s < regparse)
1345 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1349 /* likewise skip #-initiated comments in //x patterns */
1350 else if (*s == '#' && PL_lex_inpat &&
1351 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1352 while (s+1 < send && *s != '\n')
1353 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1356 /* check for embedded arrays
1357 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1359 else if (*s == '@' && s[1]
1360 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1363 /* check for embedded scalars. only stop if we're sure it's a
1366 else if (*s == '$') {
1367 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1369 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1370 break; /* in regexp, $ might be tail anchor */
1373 /* End of else if chain - OP_TRANS rejoin rest */
1376 if (*s == '\\' && s+1 < send) {
1379 /* some backslashes we leave behind */
1380 if (*leaveit && *s && strchr(leaveit, *s)) {
1381 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1382 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1386 /* deprecate \1 in strings and substitution replacements */
1387 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1388 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1390 if (ckWARN(WARN_SYNTAX))
1391 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1396 /* string-change backslash escapes */
1397 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1402 /* if we get here, it's either a quoted -, or a digit */
1405 /* quoted - in transliterations */
1407 if (PL_lex_inwhat == OP_TRANS) {
1414 if (ckWARN(WARN_MISC) &&
1417 Perl_warner(aTHX_ packWARN(WARN_MISC),
1418 "Unrecognized escape \\%c passed through",
1420 /* default action is to copy the quoted character */
1421 goto default_action;
1424 /* \132 indicates an octal constant */
1425 case '0': case '1': case '2': case '3':
1426 case '4': case '5': case '6': case '7':
1430 uv = grok_oct(s, &len, &flags, NULL);
1433 goto NUM_ESCAPE_INSERT;
1435 /* \x24 indicates a hex constant */
1439 char* e = strchr(s, '}');
1440 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1441 PERL_SCAN_DISALLOW_PREFIX;
1446 yyerror("Missing right brace on \\x{}");
1450 uv = grok_hex(s, &len, &flags, NULL);
1456 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1457 uv = grok_hex(s, &len, &flags, NULL);
1463 /* Insert oct or hex escaped character.
1464 * There will always enough room in sv since such
1465 * escapes will be longer than any UTF-8 sequence
1466 * they can end up as. */
1468 /* We need to map to chars to ASCII before doing the tests
1471 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1472 if (!has_utf8 && uv > 255) {
1473 /* Might need to recode whatever we have
1474 * accumulated so far if it contains any
1477 * (Can't we keep track of that and avoid
1478 * this rescan? --jhi)
1482 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1483 if (!NATIVE_IS_INVARIANT(*c)) {
1488 STRLEN offset = d - SvPVX(sv);
1490 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1494 while (src >= (U8 *)SvPVX(sv)) {
1495 if (!NATIVE_IS_INVARIANT(*src)) {
1496 U8 ch = NATIVE_TO_ASCII(*src);
1497 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1498 *dst-- = UTF8_EIGHT_BIT_HI(ch);
1508 if (has_utf8 || uv > 255) {
1509 d = (char*)uvchr_to_utf8((U8*)d, uv);
1511 if (PL_lex_inwhat == OP_TRANS &&
1512 PL_sublex_info.sub_op) {
1513 PL_sublex_info.sub_op->op_private |=
1514 (PL_lex_repl ? OPpTRANS_FROM_UTF
1527 /* \N{LATIN SMALL LETTER A} is a named character */
1531 char* e = strchr(s, '}');
1537 yyerror("Missing right brace on \\N{}");
1541 res = newSVpvn(s + 1, e - s - 1);
1542 res = new_constant( Nullch, 0, "charnames",
1543 res, Nullsv, "\\N{...}" );
1545 sv_utf8_upgrade(res);
1546 str = SvPV(res,len);
1547 #ifdef EBCDIC_NEVER_MIND
1548 /* charnames uses pack U and that has been
1549 * recently changed to do the below uni->native
1550 * mapping, so this would be redundant (and wrong,
1551 * the code point would be doubly converted).
1552 * But leave this in just in case the pack U change
1553 * gets revoked, but the semantics is still
1554 * desireable for charnames. --jhi */
1556 UV uv = utf8_to_uvchr((U8*)str, 0);
1559 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1561 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1562 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1563 str = SvPV(res, len);
1567 if (!has_utf8 && SvUTF8(res)) {
1568 char *ostart = SvPVX(sv);
1569 SvCUR_set(sv, d - ostart);
1572 sv_utf8_upgrade(sv);
1573 /* this just broke our allocation above... */
1574 SvGROW(sv, send - start);
1575 d = SvPVX(sv) + SvCUR(sv);
1578 if (len > e - s + 4) { /* I _guess_ 4 is \N{} --jhi */
1579 char *odest = SvPVX(sv);
1581 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1582 d = SvPVX(sv) + (d - odest);
1584 Copy(str, d, len, char);
1591 yyerror("Missing braces on \\N{}");
1594 /* \c is a control character */
1603 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1607 /* printf-style backslashes, formfeeds, newlines, etc */
1609 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1612 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1615 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1618 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1621 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1624 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1627 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1633 } /* end if (backslash) */
1636 /* If we started with encoded form, or already know we want it
1637 and then encode the next character */
1638 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1640 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1641 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1644 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1645 STRLEN off = d - SvPVX(sv);
1646 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1648 d = (char*)uvchr_to_utf8((U8*)d, uv);
1652 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1654 } /* while loop to process each character */
1656 /* terminate the string and set up the sv */
1658 SvCUR_set(sv, d - SvPVX(sv));
1659 if (SvCUR(sv) >= SvLEN(sv))
1660 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1663 if (PL_encoding && !has_utf8) {
1664 sv_recode_to_utf8(sv, PL_encoding);
1669 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1670 PL_sublex_info.sub_op->op_private |=
1671 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1675 /* shrink the sv if we allocated more than we used */
1676 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1677 SvLEN_set(sv, SvCUR(sv) + 1);
1678 Renew(SvPVX(sv), SvLEN(sv), char);
1681 /* return the substring (via yylval) only if we parsed anything */
1682 if (s > PL_bufptr) {
1683 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1684 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1686 ( PL_lex_inwhat == OP_TRANS
1688 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1691 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1698 * Returns TRUE if there's more to the expression (e.g., a subscript),
1701 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1703 * ->[ and ->{ return TRUE
1704 * { and [ outside a pattern are always subscripts, so return TRUE
1705 * if we're outside a pattern and it's not { or [, then return FALSE
1706 * if we're in a pattern and the first char is a {
1707 * {4,5} (any digits around the comma) returns FALSE
1708 * if we're in a pattern and the first char is a [
1710 * [SOMETHING] has a funky algorithm to decide whether it's a
1711 * character class or not. It has to deal with things like
1712 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1713 * anything else returns TRUE
1716 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1719 S_intuit_more(pTHX_ register char *s)
1721 if (PL_lex_brackets)
1723 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1725 if (*s != '{' && *s != '[')
1730 /* In a pattern, so maybe we have {n,m}. */
1747 /* On the other hand, maybe we have a character class */
1750 if (*s == ']' || *s == '^')
1753 /* this is terrifying, and it works */
1754 int weight = 2; /* let's weigh the evidence */
1756 unsigned char un_char = 255, last_un_char;
1757 char *send = strchr(s,']');
1758 char tmpbuf[sizeof PL_tokenbuf * 4];
1760 if (!send) /* has to be an expression */
1763 Zero(seen,256,char);
1766 else if (isDIGIT(*s)) {
1768 if (isDIGIT(s[1]) && s[2] == ']')
1774 for (; s < send; s++) {
1775 last_un_char = un_char;
1776 un_char = (unsigned char)*s;
1781 weight -= seen[un_char] * 10;
1782 if (isALNUM_lazy_if(s+1,UTF)) {
1783 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1784 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1789 else if (*s == '$' && s[1] &&
1790 strchr("[#!%*<>()-=",s[1])) {
1791 if (/*{*/ strchr("])} =",s[2]))
1800 if (strchr("wds]",s[1]))
1802 else if (seen['\''] || seen['"'])
1804 else if (strchr("rnftbxcav",s[1]))
1806 else if (isDIGIT(s[1])) {
1808 while (s[1] && isDIGIT(s[1]))
1818 if (strchr("aA01! ",last_un_char))
1820 if (strchr("zZ79~",s[1]))
1822 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1823 weight -= 5; /* cope with negative subscript */
1826 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1827 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1832 if (keyword(tmpbuf, d - tmpbuf))
1835 if (un_char == last_un_char + 1)
1837 weight -= seen[un_char];
1842 if (weight >= 0) /* probably a character class */
1852 * Does all the checking to disambiguate
1854 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1855 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1857 * First argument is the stuff after the first token, e.g. "bar".
1859 * Not a method if bar is a filehandle.
1860 * Not a method if foo is a subroutine prototyped to take a filehandle.
1861 * Not a method if it's really "Foo $bar"
1862 * Method if it's "foo $bar"
1863 * Not a method if it's really "print foo $bar"
1864 * Method if it's really "foo package::" (interpreted as package->foo)
1865 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1866 * Not a method if bar is a filehandle or package, but is quoted with
1871 S_intuit_method(pTHX_ char *start, GV *gv)
1873 char *s = start + (*start == '$');
1874 char tmpbuf[sizeof PL_tokenbuf];
1882 if ((cv = GvCVu(gv))) {
1883 char *proto = SvPVX(cv);
1893 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1894 /* start is the beginning of the possible filehandle/object,
1895 * and s is the end of it
1896 * tmpbuf is a copy of it
1899 if (*start == '$') {
1900 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1905 return *s == '(' ? FUNCMETH : METHOD;
1907 if (!keyword(tmpbuf, len)) {
1908 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1913 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1914 if (indirgv && GvCVu(indirgv))
1916 /* filehandle or package name makes it a method */
1917 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1919 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1920 return 0; /* no assumptions -- "=>" quotes bearword */
1922 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1923 newSVpvn(tmpbuf,len));
1924 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1928 return *s == '(' ? FUNCMETH : METHOD;
1936 * Return a string of Perl code to load the debugger. If PERL5DB
1937 * is set, it will return the contents of that, otherwise a
1938 * compile-time require of perl5db.pl.
1945 char *pdb = PerlEnv_getenv("PERL5DB");
1949 SETERRNO(0,SS$_NORMAL);
1950 return "BEGIN { require 'perl5db.pl' }";
1956 /* Encoded script support. filter_add() effectively inserts a
1957 * 'pre-processing' function into the current source input stream.
1958 * Note that the filter function only applies to the current source file
1959 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1961 * The datasv parameter (which may be NULL) can be used to pass
1962 * private data to this instance of the filter. The filter function
1963 * can recover the SV using the FILTER_DATA macro and use it to
1964 * store private buffers and state information.
1966 * The supplied datasv parameter is upgraded to a PVIO type
1967 * and the IoDIRP/IoANY field is used to store the function pointer,
1968 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1969 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1970 * private use must be set using malloc'd pointers.
1974 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1979 if (!PL_rsfp_filters)
1980 PL_rsfp_filters = newAV();
1982 datasv = NEWSV(255,0);
1983 if (!SvUPGRADE(datasv, SVt_PVIO))
1984 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1985 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1986 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1987 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1988 (void*)funcp, SvPV_nolen(datasv)));
1989 av_unshift(PL_rsfp_filters, 1);
1990 av_store(PL_rsfp_filters, 0, datasv) ;
1995 /* Delete most recently added instance of this filter function. */
1997 Perl_filter_del(pTHX_ filter_t funcp)
2000 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2001 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2003 /* if filter is on top of stack (usual case) just pop it off */
2004 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2005 if (IoANY(datasv) == (void *)funcp) {
2006 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2007 IoANY(datasv) = (void *)NULL;
2008 sv_free(av_pop(PL_rsfp_filters));
2012 /* we need to search for the correct entry and clear it */
2013 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2017 /* Invoke the n'th filter function for the current rsfp. */
2019 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2022 /* 0 = read one text line */
2027 if (!PL_rsfp_filters)
2029 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2030 /* Provide a default input filter to make life easy. */
2031 /* Note that we append to the line. This is handy. */
2032 DEBUG_P(PerlIO_printf(Perl_debug_log,
2033 "filter_read %d: from rsfp\n", idx));
2037 int old_len = SvCUR(buf_sv) ;
2039 /* ensure buf_sv is large enough */
2040 SvGROW(buf_sv, old_len + maxlen) ;
2041 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2042 if (PerlIO_error(PL_rsfp))
2043 return -1; /* error */
2045 return 0 ; /* end of file */
2047 SvCUR_set(buf_sv, old_len + len) ;
2050 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2051 if (PerlIO_error(PL_rsfp))
2052 return -1; /* error */
2054 return 0 ; /* end of file */
2057 return SvCUR(buf_sv);
2059 /* Skip this filter slot if filter has been deleted */
2060 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2061 DEBUG_P(PerlIO_printf(Perl_debug_log,
2062 "filter_read %d: skipped (filter deleted)\n",
2064 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2066 /* Get function pointer hidden within datasv */
2067 funcp = (filter_t)IoANY(datasv);
2068 DEBUG_P(PerlIO_printf(Perl_debug_log,
2069 "filter_read %d: via function %p (%s)\n",
2070 idx, (void*)funcp, SvPV_nolen(datasv)));
2071 /* Call function. The function is expected to */
2072 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2073 /* Return: <0:error, =0:eof, >0:not eof */
2074 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2078 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2080 #ifdef PERL_CR_FILTER
2081 if (!PL_rsfp_filters) {
2082 filter_add(S_cr_textfilter,NULL);
2085 if (PL_rsfp_filters) {
2088 SvCUR_set(sv, 0); /* start with empty line */
2089 if (FILTER_READ(0, sv, 0) > 0)
2090 return ( SvPVX(sv) ) ;
2095 return (sv_gets(sv, fp, append));
2099 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2103 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2107 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2108 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2110 return GvHV(gv); /* Foo:: */
2113 /* use constant CLASS => 'MyClass' */
2114 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2116 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2117 pkgname = SvPV_nolen(sv);
2121 return gv_stashpv(pkgname, FALSE);
2125 static char* exp_name[] =
2126 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2127 "ATTRTERM", "TERMBLOCK"
2134 Works out what to call the token just pulled out of the input
2135 stream. The yacc parser takes care of taking the ops we return and
2136 stitching them into a tree.
2142 if read an identifier
2143 if we're in a my declaration
2144 croak if they tried to say my($foo::bar)
2145 build the ops for a my() declaration
2146 if it's an access to a my() variable
2147 are we in a sort block?
2148 croak if my($a); $a <=> $b
2149 build ops for access to a my() variable
2150 if in a dq string, and they've said @foo and we can't find @foo
2152 build ops for a bareword
2153 if we already built the token before, use it.
2156 #ifdef USE_PURE_BISON
2158 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2163 yylval_pointer[yyactlevel] = lvalp;
2164 yychar_pointer[yyactlevel] = lcharp;
2165 if (yyactlevel >= YYMAXLEVEL)
2166 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2168 r = Perl_yylex(aTHX);
2178 #pragma segment Perl_yylex
2191 /* check if there's an identifier for us to look at */
2192 if (PL_pending_ident)
2193 return S_pending_ident(aTHX);
2195 /* no identifier pending identification */
2197 switch (PL_lex_state) {
2199 case LEX_NORMAL: /* Some compilers will produce faster */
2200 case LEX_INTERPNORMAL: /* code if we comment these out. */
2204 /* when we've already built the next token, just pull it out of the queue */
2207 yylval = PL_nextval[PL_nexttoke];
2209 PL_lex_state = PL_lex_defer;
2210 PL_expect = PL_lex_expect;
2211 PL_lex_defer = LEX_NORMAL;
2213 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2214 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2215 (IV)PL_nexttype[PL_nexttoke]); });
2217 return(PL_nexttype[PL_nexttoke]);
2219 /* interpolated case modifiers like \L \U, including \Q and \E.
2220 when we get here, PL_bufptr is at the \
2222 case LEX_INTERPCASEMOD:
2224 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2225 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2227 /* handle \E or end of string */
2228 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2232 if (PL_lex_casemods) {
2233 oldmod = PL_lex_casestack[--PL_lex_casemods];
2234 PL_lex_casestack[PL_lex_casemods] = '\0';
2236 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2238 PL_lex_state = LEX_INTERPCONCAT;
2242 if (PL_bufptr != PL_bufend)
2244 PL_lex_state = LEX_INTERPCONCAT;
2248 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2249 "### Saw case modifier at '%s'\n", PL_bufptr); });
2251 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2252 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2253 if (strchr("LU", *s) &&
2254 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2256 PL_lex_casestack[--PL_lex_casemods] = '\0';
2259 if (PL_lex_casemods > 10) {
2260 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2261 if (newlb != PL_lex_casestack) {
2263 PL_lex_casestack = newlb;
2266 PL_lex_casestack[PL_lex_casemods++] = *s;
2267 PL_lex_casestack[PL_lex_casemods] = '\0';
2268 PL_lex_state = LEX_INTERPCONCAT;
2269 PL_nextval[PL_nexttoke].ival = 0;
2272 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2274 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2276 PL_nextval[PL_nexttoke].ival = OP_LC;
2278 PL_nextval[PL_nexttoke].ival = OP_UC;
2280 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2282 Perl_croak(aTHX_ "panic: yylex");
2285 if (PL_lex_starts) {
2294 case LEX_INTERPPUSH:
2295 return sublex_push();
2297 case LEX_INTERPSTART:
2298 if (PL_bufptr == PL_bufend)
2299 return sublex_done();
2300 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2301 "### Interpolated variable at '%s'\n", PL_bufptr); });
2303 PL_lex_dojoin = (*PL_bufptr == '@');
2304 PL_lex_state = LEX_INTERPNORMAL;
2305 if (PL_lex_dojoin) {
2306 PL_nextval[PL_nexttoke].ival = 0;
2308 #ifdef USE_5005THREADS
2309 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2310 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2311 force_next(PRIVATEREF);
2313 force_ident("\"", '$');
2314 #endif /* USE_5005THREADS */
2315 PL_nextval[PL_nexttoke].ival = 0;
2317 PL_nextval[PL_nexttoke].ival = 0;
2319 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2322 if (PL_lex_starts++) {
2328 case LEX_INTERPENDMAYBE:
2329 if (intuit_more(PL_bufptr)) {
2330 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2336 if (PL_lex_dojoin) {
2337 PL_lex_dojoin = FALSE;
2338 PL_lex_state = LEX_INTERPCONCAT;
2341 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2342 && SvEVALED(PL_lex_repl))
2344 if (PL_bufptr != PL_bufend)
2345 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2346 PL_lex_repl = Nullsv;
2349 case LEX_INTERPCONCAT:
2351 if (PL_lex_brackets)
2352 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2354 if (PL_bufptr == PL_bufend)
2355 return sublex_done();
2357 if (SvIVX(PL_linestr) == '\'') {
2358 SV *sv = newSVsv(PL_linestr);
2361 else if ( PL_hints & HINT_NEW_RE )
2362 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2363 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2367 s = scan_const(PL_bufptr);
2369 PL_lex_state = LEX_INTERPCASEMOD;
2371 PL_lex_state = LEX_INTERPSTART;
2374 if (s != PL_bufptr) {
2375 PL_nextval[PL_nexttoke] = yylval;
2378 if (PL_lex_starts++)
2388 PL_lex_state = LEX_NORMAL;
2389 s = scan_formline(PL_bufptr);
2390 if (!PL_lex_formbrack)
2396 PL_oldoldbufptr = PL_oldbufptr;
2399 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2400 exp_name[PL_expect], s);
2406 if (isIDFIRST_lazy_if(s,UTF))
2408 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2411 goto fake_eof; /* emulate EOF on ^D or ^Z */
2416 if (PL_lex_brackets)
2417 yyerror("Missing right curly or square bracket");
2418 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2419 "### Tokener got EOF\n");
2423 if (s++ < PL_bufend)
2424 goto retry; /* ignore stray nulls */
2427 if (!PL_in_eval && !PL_preambled) {
2428 PL_preambled = TRUE;
2429 sv_setpv(PL_linestr,incl_perldb());
2430 if (SvCUR(PL_linestr))
2431 sv_catpv(PL_linestr,";");
2433 while(AvFILLp(PL_preambleav) >= 0) {
2434 SV *tmpsv = av_shift(PL_preambleav);
2435 sv_catsv(PL_linestr, tmpsv);
2436 sv_catpv(PL_linestr, ";");
2439 sv_free((SV*)PL_preambleav);
2440 PL_preambleav = NULL;
2442 if (PL_minus_n || PL_minus_p) {
2443 sv_catpv(PL_linestr, "LINE: while (<>) {");
2445 sv_catpv(PL_linestr,"chomp;");
2448 if (strchr("/'\"", *PL_splitstr)
2449 && strchr(PL_splitstr + 1, *PL_splitstr))
2450 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2453 s = "'~#\200\1'"; /* surely one char is unused...*/
2454 while (s[1] && strchr(PL_splitstr, *s)) s++;
2456 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2457 "q" + (delim == '\''), delim);
2458 for (s = PL_splitstr; *s; s++) {
2460 sv_catpvn(PL_linestr, "\\", 1);
2461 sv_catpvn(PL_linestr, s, 1);
2463 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2467 sv_catpv(PL_linestr,"our @F=split(' ');");
2470 sv_catpv(PL_linestr, "\n");
2471 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2472 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2473 PL_last_lop = PL_last_uni = Nullch;
2474 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2475 SV *sv = NEWSV(85,0);
2477 sv_upgrade(sv, SVt_PVMG);
2478 sv_setsv(sv,PL_linestr);
2481 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2486 bof = PL_rsfp ? TRUE : FALSE;
2487 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2490 if (PL_preprocess && !PL_in_eval)
2491 (void)PerlProc_pclose(PL_rsfp);
2492 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2493 PerlIO_clearerr(PL_rsfp);
2495 (void)PerlIO_close(PL_rsfp);
2497 PL_doextract = FALSE;
2499 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2500 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2501 sv_catpv(PL_linestr,";}");
2502 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2503 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2504 PL_last_lop = PL_last_uni = Nullch;
2505 PL_minus_n = PL_minus_p = 0;
2508 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2509 PL_last_lop = PL_last_uni = Nullch;
2510 sv_setpv(PL_linestr,"");
2511 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2513 /* if it looks like the start of a BOM, check if it in fact is */
2514 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2515 #ifdef PERLIO_IS_STDIO
2516 # ifdef __GNU_LIBRARY__
2517 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2518 # define FTELL_FOR_PIPE_IS_BROKEN
2522 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2523 # define FTELL_FOR_PIPE_IS_BROKEN
2528 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2529 /* This loses the possibility to detect the bof
2530 * situation on perl -P when the libc5 is being used.
2531 * Workaround? Maybe attach some extra state to PL_rsfp?
2534 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2536 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2539 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2540 s = swallow_bom((U8*)s);
2544 /* Incest with pod. */
2545 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2546 sv_setpv(PL_linestr, "");
2547 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2548 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2549 PL_last_lop = PL_last_uni = Nullch;
2550 PL_doextract = FALSE;
2554 } while (PL_doextract);
2555 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2556 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2557 SV *sv = NEWSV(85,0);
2559 sv_upgrade(sv, SVt_PVMG);
2560 sv_setsv(sv,PL_linestr);
2563 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2565 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2566 PL_last_lop = PL_last_uni = Nullch;
2567 if (CopLINE(PL_curcop) == 1) {
2568 while (s < PL_bufend && isSPACE(*s))
2570 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2574 if (*s == '#' && *(s+1) == '!')
2576 #ifdef ALTERNATE_SHEBANG
2578 static char as[] = ALTERNATE_SHEBANG;
2579 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2580 d = s + (sizeof(as) - 1);
2582 #endif /* ALTERNATE_SHEBANG */
2591 while (*d && !isSPACE(*d))
2595 #ifdef ARG_ZERO_IS_SCRIPT
2596 if (ipathend > ipath) {
2598 * HP-UX (at least) sets argv[0] to the script name,
2599 * which makes $^X incorrect. And Digital UNIX and Linux,
2600 * at least, set argv[0] to the basename of the Perl
2601 * interpreter. So, having found "#!", we'll set it right.
2603 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2604 assert(SvPOK(x) || SvGMAGICAL(x));
2605 if (sv_eq(x, CopFILESV(PL_curcop))) {
2606 sv_setpvn(x, ipath, ipathend - ipath);
2609 TAINT_NOT; /* $^X is always tainted, but that's OK */
2611 #endif /* ARG_ZERO_IS_SCRIPT */
2616 d = instr(s,"perl -");
2618 d = instr(s,"perl");
2620 /* avoid getting into infinite loops when shebang
2621 * line contains "Perl" rather than "perl" */
2623 for (d = ipathend-4; d >= ipath; --d) {
2624 if ((*d == 'p' || *d == 'P')
2625 && !ibcmp(d, "perl", 4))
2635 #ifdef ALTERNATE_SHEBANG
2637 * If the ALTERNATE_SHEBANG on this system starts with a
2638 * character that can be part of a Perl expression, then if
2639 * we see it but not "perl", we're probably looking at the
2640 * start of Perl code, not a request to hand off to some
2641 * other interpreter. Similarly, if "perl" is there, but
2642 * not in the first 'word' of the line, we assume the line
2643 * contains the start of the Perl program.
2645 if (d && *s != '#') {
2647 while (*c && !strchr("; \t\r\n\f\v#", *c))
2650 d = Nullch; /* "perl" not in first word; ignore */
2652 *s = '#'; /* Don't try to parse shebang line */
2654 #endif /* ALTERNATE_SHEBANG */
2655 #ifndef MACOS_TRADITIONAL
2660 !instr(s,"indir") &&
2661 instr(PL_origargv[0],"perl"))
2667 while (s < PL_bufend && isSPACE(*s))
2669 if (s < PL_bufend) {
2670 Newz(899,newargv,PL_origargc+3,char*);
2672 while (s < PL_bufend && !isSPACE(*s))
2675 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2678 newargv = PL_origargv;
2680 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2681 Perl_croak(aTHX_ "Can't exec %s", ipath);
2685 U32 oldpdb = PL_perldb;
2686 bool oldn = PL_minus_n;
2687 bool oldp = PL_minus_p;
2689 while (*d && !isSPACE(*d)) d++;
2690 while (SPACE_OR_TAB(*d)) d++;
2693 bool switches_done = PL_doswitches;
2695 if (*d == 'M' || *d == 'm') {
2697 while (*d && !isSPACE(*d)) d++;
2698 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2701 d = moreswitches(d);
2703 if ((PERLDB_LINE && !oldpdb) ||
2704 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2705 /* if we have already added "LINE: while (<>) {",
2706 we must not do it again */
2708 sv_setpv(PL_linestr, "");
2709 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2710 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2711 PL_last_lop = PL_last_uni = Nullch;
2712 PL_preambled = FALSE;
2714 (void)gv_fetchfile(PL_origfilename);
2717 if (PL_doswitches && !switches_done) {
2718 int argc = PL_origargc;
2719 char **argv = PL_origargv;
2722 } while (argc && argv[0][0] == '-' && argv[0][1]);
2723 init_argv_symbols(argc,argv);
2729 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2731 PL_lex_state = LEX_FORMLINE;
2736 #ifdef PERL_STRICT_CR
2737 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2739 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2741 case ' ': case '\t': case '\f': case 013:
2742 #ifdef MACOS_TRADITIONAL
2749 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2750 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2751 /* handle eval qq[#line 1 "foo"\n ...] */
2752 CopLINE_dec(PL_curcop);
2756 while (s < d && *s != '\n')
2760 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2761 Perl_croak(aTHX_ "panic: input overflow");
2763 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2765 PL_lex_state = LEX_FORMLINE;
2775 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2782 while (s < PL_bufend && SPACE_OR_TAB(*s))
2785 if (strnEQ(s,"=>",2)) {
2786 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2787 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2788 "### Saw unary minus before =>, forcing word '%s'\n", s);
2790 OPERATOR('-'); /* unary minus */
2792 PL_last_uni = PL_oldbufptr;
2794 case 'r': ftst = OP_FTEREAD; break;
2795 case 'w': ftst = OP_FTEWRITE; break;
2796 case 'x': ftst = OP_FTEEXEC; break;
2797 case 'o': ftst = OP_FTEOWNED; break;
2798 case 'R': ftst = OP_FTRREAD; break;
2799 case 'W': ftst = OP_FTRWRITE; break;
2800 case 'X': ftst = OP_FTREXEC; break;
2801 case 'O': ftst = OP_FTROWNED; break;
2802 case 'e': ftst = OP_FTIS; break;
2803 case 'z': ftst = OP_FTZERO; break;
2804 case 's': ftst = OP_FTSIZE; break;
2805 case 'f': ftst = OP_FTFILE; break;
2806 case 'd': ftst = OP_FTDIR; break;
2807 case 'l': ftst = OP_FTLINK; break;
2808 case 'p': ftst = OP_FTPIPE; break;
2809 case 'S': ftst = OP_FTSOCK; break;
2810 case 'u': ftst = OP_FTSUID; break;
2811 case 'g': ftst = OP_FTSGID; break;
2812 case 'k': ftst = OP_FTSVTX; break;
2813 case 'b': ftst = OP_FTBLK; break;
2814 case 'c': ftst = OP_FTCHR; break;
2815 case 't': ftst = OP_FTTTY; break;
2816 case 'T': ftst = OP_FTTEXT; break;
2817 case 'B': ftst = OP_FTBINARY; break;
2818 case 'M': case 'A': case 'C':
2819 gv_fetchpv("\024",TRUE, SVt_PV);
2821 case 'M': ftst = OP_FTMTIME; break;
2822 case 'A': ftst = OP_FTATIME; break;
2823 case 'C': ftst = OP_FTCTIME; break;
2831 PL_last_lop_op = ftst;
2832 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2833 "### Saw file test %c\n", (int)ftst);
2838 /* Assume it was a minus followed by a one-letter named
2839 * subroutine call (or a -bareword), then. */
2840 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2841 "### %c looked like a file test but was not\n",
2850 if (PL_expect == XOPERATOR)
2855 else if (*s == '>') {
2858 if (isIDFIRST_lazy_if(s,UTF)) {
2859 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2867 if (PL_expect == XOPERATOR)
2870 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2872 OPERATOR('-'); /* unary minus */
2879 if (PL_expect == XOPERATOR)
2884 if (PL_expect == XOPERATOR)
2887 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2893 if (PL_expect != XOPERATOR) {
2894 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2895 PL_expect = XOPERATOR;
2896 force_ident(PL_tokenbuf, '*');
2909 if (PL_expect == XOPERATOR) {
2913 PL_tokenbuf[0] = '%';
2914 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2915 if (!PL_tokenbuf[1]) {
2917 yyerror("Final % should be \\% or %name");
2920 PL_pending_ident = '%';
2939 switch (PL_expect) {
2942 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2944 PL_bufptr = s; /* update in case we back off */
2950 PL_expect = XTERMBLOCK;
2954 while (isIDFIRST_lazy_if(s,UTF)) {
2955 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2956 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2957 if (tmp < 0) tmp = -tmp;
2972 d = scan_str(d,TRUE,TRUE);
2974 /* MUST advance bufptr here to avoid bogus
2975 "at end of line" context messages from yyerror().
2977 PL_bufptr = s + len;
2978 yyerror("Unterminated attribute parameter in attribute list");
2981 return 0; /* EOF indicator */
2985 SV *sv = newSVpvn(s, len);
2986 sv_catsv(sv, PL_lex_stuff);
2987 attrs = append_elem(OP_LIST, attrs,
2988 newSVOP(OP_CONST, 0, sv));
2989 SvREFCNT_dec(PL_lex_stuff);
2990 PL_lex_stuff = Nullsv;
2993 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
2994 CvLVALUE_on(PL_compcv);
2995 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
2996 CvLOCKED_on(PL_compcv);
2997 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
2998 CvMETHOD_on(PL_compcv);
3000 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "unique", len))
3001 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3003 /* After we've set the flags, it could be argued that
3004 we don't need to do the attributes.pm-based setting
3005 process, and shouldn't bother appending recognized
3006 flags. To experiment with that, uncomment the
3007 following "else": */
3009 attrs = append_elem(OP_LIST, attrs,
3010 newSVOP(OP_CONST, 0,
3014 if (*s == ':' && s[1] != ':')
3017 break; /* require real whitespace or :'s */
3019 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3020 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3021 char q = ((*s == '\'') ? '"' : '\'');
3022 /* If here for an expression, and parsed no attrs, back off. */
3023 if (tmp == '=' && !attrs) {
3027 /* MUST advance bufptr here to avoid bogus "at end of line"
3028 context messages from yyerror().
3032 yyerror("Unterminated attribute list");
3034 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3042 PL_nextval[PL_nexttoke].opval = attrs;
3050 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3051 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3067 if (PL_lex_brackets <= 0)
3068 yyerror("Unmatched right square bracket");
3071 if (PL_lex_state == LEX_INTERPNORMAL) {
3072 if (PL_lex_brackets == 0) {
3073 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3074 PL_lex_state = LEX_INTERPEND;
3081 if (PL_lex_brackets > 100) {
3082 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3083 if (newlb != PL_lex_brackstack) {
3085 PL_lex_brackstack = newlb;
3088 switch (PL_expect) {
3090 if (PL_lex_formbrack) {
3094 if (PL_oldoldbufptr == PL_last_lop)
3095 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3097 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3098 OPERATOR(HASHBRACK);
3100 while (s < PL_bufend && SPACE_OR_TAB(*s))
3103 PL_tokenbuf[0] = '\0';
3104 if (d < PL_bufend && *d == '-') {
3105 PL_tokenbuf[0] = '-';
3107 while (d < PL_bufend && SPACE_OR_TAB(*d))
3110 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3111 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3113 while (d < PL_bufend && SPACE_OR_TAB(*d))
3116 char minus = (PL_tokenbuf[0] == '-');
3117 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3125 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3130 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3135 if (PL_oldoldbufptr == PL_last_lop)
3136 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3138 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3141 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3143 /* This hack is to get the ${} in the message. */
3145 yyerror("syntax error");
3148 OPERATOR(HASHBRACK);
3150 /* This hack serves to disambiguate a pair of curlies
3151 * as being a block or an anon hash. Normally, expectation
3152 * determines that, but in cases where we're not in a
3153 * position to expect anything in particular (like inside
3154 * eval"") we have to resolve the ambiguity. This code
3155 * covers the case where the first term in the curlies is a
3156 * quoted string. Most other cases need to be explicitly
3157 * disambiguated by prepending a `+' before the opening
3158 * curly in order to force resolution as an anon hash.
3160 * XXX should probably propagate the outer expectation
3161 * into eval"" to rely less on this hack, but that could
3162 * potentially break current behavior of eval"".
3166 if (*s == '\'' || *s == '"' || *s == '`') {
3167 /* common case: get past first string, handling escapes */
3168 for (t++; t < PL_bufend && *t != *s;)
3169 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3173 else if (*s == 'q') {
3176 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3180 char open, close, term;
3183 while (t < PL_bufend && isSPACE(*t))
3187 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3191 for (t++; t < PL_bufend; t++) {
3192 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3194 else if (*t == open)
3198 for (t++; t < PL_bufend; t++) {
3199 if (*t == '\\' && t+1 < PL_bufend)
3201 else if (*t == close && --brackets <= 0)
3203 else if (*t == open)
3209 else if (isALNUM_lazy_if(t,UTF)) {
3211 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3214 while (t < PL_bufend && isSPACE(*t))
3216 /* if comma follows first term, call it an anon hash */
3217 /* XXX it could be a comma expression with loop modifiers */
3218 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3219 || (*t == '=' && t[1] == '>')))
3220 OPERATOR(HASHBRACK);
3221 if (PL_expect == XREF)
3224 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3230 yylval.ival = CopLINE(PL_curcop);
3231 if (isSPACE(*s) || *s == '#')
3232 PL_copline = NOLINE; /* invalidate current command line number */
3237 if (PL_lex_brackets <= 0)
3238 yyerror("Unmatched right curly bracket");
3240 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3241 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3242 PL_lex_formbrack = 0;
3243 if (PL_lex_state == LEX_INTERPNORMAL) {
3244 if (PL_lex_brackets == 0) {
3245 if (PL_expect & XFAKEBRACK) {
3246 PL_expect &= XENUMMASK;
3247 PL_lex_state = LEX_INTERPEND;
3249 return yylex(); /* ignore fake brackets */
3251 if (*s == '-' && s[1] == '>')
3252 PL_lex_state = LEX_INTERPENDMAYBE;
3253 else if (*s != '[' && *s != '{')
3254 PL_lex_state = LEX_INTERPEND;
3257 if (PL_expect & XFAKEBRACK) {
3258 PL_expect &= XENUMMASK;
3260 return yylex(); /* ignore fake brackets */
3270 if (PL_expect == XOPERATOR) {
3271 if (ckWARN(WARN_SEMICOLON)
3272 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3274 CopLINE_dec(PL_curcop);
3275 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3276 CopLINE_inc(PL_curcop);
3281 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3283 PL_expect = XOPERATOR;
3284 force_ident(PL_tokenbuf, '&');
3288 yylval.ival = (OPpENTERSUB_AMPER<<8);
3307 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3308 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3310 if (PL_expect == XSTATE && isALPHA(tmp) &&
3311 (s == PL_linestart+1 || s[-2] == '\n') )
3313 if (PL_in_eval && !PL_rsfp) {
3318 if (strnEQ(s,"=cut",4)) {
3332 PL_doextract = TRUE;
3335 if (PL_lex_brackets < PL_lex_formbrack) {
3337 #ifdef PERL_STRICT_CR
3338 for (t = s; SPACE_OR_TAB(*t); t++) ;
3340 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3342 if (*t == '\n' || *t == '#') {
3360 if (PL_expect != XOPERATOR) {
3361 if (s[1] != '<' && !strchr(s,'>'))
3364 s = scan_heredoc(s);
3366 s = scan_inputsymbol(s);
3367 TERM(sublex_start());
3372 SHop(OP_LEFT_SHIFT);
3386 SHop(OP_RIGHT_SHIFT);
3395 if (PL_expect == XOPERATOR) {
3396 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3399 return ','; /* grandfather non-comma-format format */
3403 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3404 PL_tokenbuf[0] = '@';
3405 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3406 sizeof PL_tokenbuf - 1, FALSE);
3407 if (PL_expect == XOPERATOR)
3408 no_op("Array length", s);
3409 if (!PL_tokenbuf[1])
3411 PL_expect = XOPERATOR;
3412 PL_pending_ident = '#';
3416 PL_tokenbuf[0] = '$';
3417 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3418 sizeof PL_tokenbuf - 1, FALSE);
3419 if (PL_expect == XOPERATOR)
3421 if (!PL_tokenbuf[1]) {
3423 yyerror("Final $ should be \\$ or $name");
3427 /* This kludge not intended to be bulletproof. */
3428 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3429 yylval.opval = newSVOP(OP_CONST, 0,
3430 newSViv(PL_compiling.cop_arybase));
3431 yylval.opval->op_private = OPpCONST_ARYBASE;
3437 if (PL_lex_state == LEX_NORMAL)
3440 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3443 PL_tokenbuf[0] = '@';
3444 if (ckWARN(WARN_SYNTAX)) {
3446 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3449 PL_bufptr = skipspace(PL_bufptr);
3450 while (t < PL_bufend && *t != ']')
3452 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3453 "Multidimensional syntax %.*s not supported",
3454 (t - PL_bufptr) + 1, PL_bufptr);
3458 else if (*s == '{') {
3459 PL_tokenbuf[0] = '%';
3460 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3461 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3463 char tmpbuf[sizeof PL_tokenbuf];
3465 for (t++; isSPACE(*t); t++) ;
3466 if (isIDFIRST_lazy_if(t,UTF)) {
3467 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3468 for (; isSPACE(*t); t++) ;
3469 if (*t == ';' && get_cv(tmpbuf, FALSE))
3470 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3471 "You need to quote \"%s\"", tmpbuf);
3477 PL_expect = XOPERATOR;
3478 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3479 bool islop = (PL_last_lop == PL_oldoldbufptr);
3480 if (!islop || PL_last_lop_op == OP_GREPSTART)
3481 PL_expect = XOPERATOR;
3482 else if (strchr("$@\"'`q", *s))
3483 PL_expect = XTERM; /* e.g. print $fh "foo" */
3484 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3485 PL_expect = XTERM; /* e.g. print $fh &sub */
3486 else if (isIDFIRST_lazy_if(s,UTF)) {
3487 char tmpbuf[sizeof PL_tokenbuf];
3488 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3489 if ((tmp = keyword(tmpbuf, len))) {
3490 /* binary operators exclude handle interpretations */
3502 PL_expect = XTERM; /* e.g. print $fh length() */
3507 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3508 if (gv && GvCVu(gv))
3509 PL_expect = XTERM; /* e.g. print $fh subr() */
3512 else if (isDIGIT(*s))
3513 PL_expect = XTERM; /* e.g. print $fh 3 */
3514 else if (*s == '.' && isDIGIT(s[1]))
3515 PL_expect = XTERM; /* e.g. print $fh .3 */
3516 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3517 PL_expect = XTERM; /* e.g. print $fh -1 */
3518 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3519 PL_expect = XTERM; /* print $fh <<"EOF" */
3521 PL_pending_ident = '$';
3525 if (PL_expect == XOPERATOR)
3527 PL_tokenbuf[0] = '@';
3528 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3529 if (!PL_tokenbuf[1]) {
3531 yyerror("Final @ should be \\@ or @name");
3534 if (PL_lex_state == LEX_NORMAL)
3536 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3538 PL_tokenbuf[0] = '%';
3540 /* Warn about @ where they meant $. */
3541 if (ckWARN(WARN_SYNTAX)) {
3542 if (*s == '[' || *s == '{') {
3544 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3546 if (*t == '}' || *t == ']') {
3548 PL_bufptr = skipspace(PL_bufptr);
3549 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3550 "Scalar value %.*s better written as $%.*s",
3551 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3556 PL_pending_ident = '@';
3559 case '/': /* may either be division or pattern */
3560 case '?': /* may either be conditional or pattern */
3561 if (PL_expect != XOPERATOR) {
3562 /* Disable warning on "study /blah/" */
3563 if (PL_oldoldbufptr == PL_last_uni
3564 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3565 || memNE(PL_last_uni, "study", 5)
3566 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3568 s = scan_pat(s,OP_MATCH);
3569 TERM(sublex_start());
3577 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3578 #ifdef PERL_STRICT_CR
3581 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3583 && (s == PL_linestart || s[-1] == '\n') )
3585 PL_lex_formbrack = 0;
3589 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3595 yylval.ival = OPf_SPECIAL;
3601 if (PL_expect != XOPERATOR)
3606 case '0': case '1': case '2': case '3': case '4':
3607 case '5': case '6': case '7': case '8': case '9':
3608 s = scan_num(s, &yylval);
3609 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3610 "### Saw number in '%s'\n", s);
3612 if (PL_expect == XOPERATOR)
3617 s = scan_str(s,FALSE,FALSE);
3618 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3619 "### Saw string before '%s'\n", s);
3621 if (PL_expect == XOPERATOR) {
3622 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3625 return ','; /* grandfather non-comma-format format */
3631 missingterm((char*)0);
3632 yylval.ival = OP_CONST;
3633 TERM(sublex_start());
3636 s = scan_str(s,FALSE,FALSE);
3637 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3638 "### Saw string before '%s'\n", s);
3640 if (PL_expect == XOPERATOR) {
3641 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3644 return ','; /* grandfather non-comma-format format */
3650 missingterm((char*)0);
3651 yylval.ival = OP_CONST;
3652 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3653 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3654 yylval.ival = OP_STRINGIFY;
3658 TERM(sublex_start());
3661 s = scan_str(s,FALSE,FALSE);
3662 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3663 "### Saw backtick string before '%s'\n", s);
3665 if (PL_expect == XOPERATOR)
3666 no_op("Backticks",s);
3668 missingterm((char*)0);
3669 yylval.ival = OP_BACKTICK;
3671 TERM(sublex_start());
3675 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3676 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3678 if (PL_expect == XOPERATOR)
3679 no_op("Backslash",s);
3683 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3687 while (isDIGIT(*start) || *start == '_')
3689 if (*start == '.' && isDIGIT(start[1])) {
3690 s = scan_num(s, &yylval);
3693 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3694 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF || PL_expect == XSTATE)) {
3698 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3701 s = scan_num(s, &yylval);
3708 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3747 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3749 /* Some keywords can be followed by any delimiter, including ':' */
3750 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3751 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3752 (PL_tokenbuf[0] == 'q' &&
3753 strchr("qwxr", PL_tokenbuf[1])))));
3755 /* x::* is just a word, unless x is "CORE" */
3756 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3760 while (d < PL_bufend && isSPACE(*d))
3761 d++; /* no comments skipped here, or s### is misparsed */
3763 /* Is this a label? */
3764 if (!tmp && PL_expect == XSTATE
3765 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3767 yylval.pval = savepv(PL_tokenbuf);
3772 /* Check for keywords */
3773 tmp = keyword(PL_tokenbuf, len);
3775 /* Is this a word before a => operator? */
3776 if (*d == '=' && d[1] == '>') {
3778 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3779 yylval.opval->op_private = OPpCONST_BARE;
3780 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3781 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3785 if (tmp < 0) { /* second-class keyword? */
3786 GV *ogv = Nullgv; /* override (winner) */
3787 GV *hgv = Nullgv; /* hidden (loser) */
3788 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3790 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3793 if (GvIMPORTED_CV(gv))
3795 else if (! CvMETHOD(cv))
3799 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3800 (gv = *gvp) != (GV*)&PL_sv_undef &&
3801 GvCVu(gv) && GvIMPORTED_CV(gv))
3807 tmp = 0; /* overridden by import or by GLOBAL */
3810 && -tmp==KEY_lock /* XXX generalizable kludge */
3812 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3814 tmp = 0; /* any sub overrides "weak" keyword */
3816 else { /* no override */
3818 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3819 Perl_warner(aTHX_ packWARN(WARN_MISC),
3820 "dump() better written as CORE::dump()");
3824 if (ckWARN(WARN_AMBIGUOUS) && hgv
3825 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3826 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3827 "Ambiguous call resolved as CORE::%s(), %s",
3828 GvENAME(hgv), "qualify as such or use &");
3835 default: /* not a keyword */
3839 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3841 /* Get the rest if it looks like a package qualifier */
3843 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3845 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3848 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3849 *s == '\'' ? "'" : "::");
3854 if (PL_expect == XOPERATOR) {
3855 if (PL_bufptr == PL_linestart) {
3856 CopLINE_dec(PL_curcop);
3857 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3858 CopLINE_inc(PL_curcop);
3861 no_op("Bareword",s);
3864 /* Look for a subroutine with this name in current package,
3865 unless name is "Foo::", in which case Foo is a bearword
3866 (and a package name). */
3869 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3871 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3872 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3873 "Bareword \"%s\" refers to nonexistent package",
3876 PL_tokenbuf[len] = '\0';
3883 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3886 /* if we saw a global override before, get the right name */
3889 sv = newSVpvn("CORE::GLOBAL::",14);
3890 sv_catpv(sv,PL_tokenbuf);
3893 sv = newSVpv(PL_tokenbuf,0);
3895 /* Presume this is going to be a bareword of some sort. */
3898 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3899 yylval.opval->op_private = OPpCONST_BARE;
3901 /* And if "Foo::", then that's what it certainly is. */
3906 /* See if it's the indirect object for a list operator. */
3908 if (PL_oldoldbufptr &&
3909 PL_oldoldbufptr < PL_bufptr &&
3910 (PL_oldoldbufptr == PL_last_lop
3911 || PL_oldoldbufptr == PL_last_uni) &&
3912 /* NO SKIPSPACE BEFORE HERE! */
3913 (PL_expect == XREF ||
3914 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3916 bool immediate_paren = *s == '(';
3918 /* (Now we can afford to cross potential line boundary.) */
3921 /* Two barewords in a row may indicate method call. */
3923 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3926 /* If not a declared subroutine, it's an indirect object. */
3927 /* (But it's an indir obj regardless for sort.) */
3929 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3930 ((!gv || !GvCVu(gv)) &&
3931 (PL_last_lop_op != OP_MAPSTART &&
3932 PL_last_lop_op != OP_GREPSTART))))
3934 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3939 PL_expect = XOPERATOR;
3942 /* Is this a word before a => operator? */
3943 if (*s == '=' && s[1] == '>' && !pkgname) {
3945 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3946 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3947 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3951 /* If followed by a paren, it's certainly a subroutine. */
3954 if (gv && GvCVu(gv)) {
3955 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3956 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3961 PL_nextval[PL_nexttoke].opval = yylval.opval;
3962 PL_expect = XOPERATOR;
3968 /* If followed by var or block, call it a method (unless sub) */
3970 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3971 PL_last_lop = PL_oldbufptr;
3972 PL_last_lop_op = OP_METHOD;
3976 /* If followed by a bareword, see if it looks like indir obj. */
3978 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3981 /* Not a method, so call it a subroutine (if defined) */
3983 if (gv && GvCVu(gv)) {
3985 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3986 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3987 "Ambiguous use of -%s resolved as -&%s()",
3988 PL_tokenbuf, PL_tokenbuf);
3989 /* Check for a constant sub */
3991 if ((sv = cv_const_sv(cv))) {
3993 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3994 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3995 yylval.opval->op_private = 0;
3999 /* Resolve to GV now. */
4000 op_free(yylval.opval);
4001 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4002 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4003 PL_last_lop = PL_oldbufptr;
4004 PL_last_lop_op = OP_ENTERSUB;
4005 /* Is there a prototype? */
4008 char *proto = SvPV((SV*)cv, len);
4011 if (strEQ(proto, "$"))
4013 if (*proto == '&' && *s == '{') {
4014 sv_setpv(PL_subname, PL_curstash ?
4015 "__ANON__" : "__ANON__::__ANON__");
4019 PL_nextval[PL_nexttoke].opval = yylval.opval;
4025 /* Call it a bare word */
4027 if (PL_hints & HINT_STRICT_SUBS)
4028 yylval.opval->op_private |= OPpCONST_STRICT;
4031 if (ckWARN(WARN_RESERVED)) {
4032 if (lastchar != '-') {
4033 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4034 if (!*d && strNE(PL_tokenbuf,"main"))
4035 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4042 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4043 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4044 "Operator or semicolon missing before %c%s",
4045 lastchar, PL_tokenbuf);
4046 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4047 "Ambiguous use of %c resolved as operator %c",
4048 lastchar, lastchar);
4054 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4055 newSVpv(CopFILE(PL_curcop),0));
4059 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4060 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4063 case KEY___PACKAGE__:
4064 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4066 ? newSVsv(PL_curstname)
4075 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4076 char *pname = "main";
4077 if (PL_tokenbuf[2] == 'D')
4078 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4079 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4082 GvIOp(gv) = newIO();
4083 IoIFP(GvIOp(gv)) = PL_rsfp;
4084 #if defined(HAS_FCNTL) && defined(F_SETFD)
4086 int fd = PerlIO_fileno(PL_rsfp);
4087 fcntl(fd,F_SETFD,fd >= 3);
4090 /* Mark this internal pseudo-handle as clean */
4091 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4093 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4094 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4095 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4097 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4098 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4099 /* if the script was opened in binmode, we need to revert
4100 * it to text mode for compatibility; but only iff it has CRs
4101 * XXX this is a questionable hack at best. */
4102 if (PL_bufend-PL_bufptr > 2
4103 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4106 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4107 loc = PerlIO_tell(PL_rsfp);
4108 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4111 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4113 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4114 #endif /* NETWARE */
4115 #ifdef PERLIO_IS_STDIO /* really? */
4116 # if defined(__BORLANDC__)
4117 /* XXX see note in do_binmode() */
4118 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4122 PerlIO_seek(PL_rsfp, loc, 0);
4126 #ifdef PERLIO_LAYERS
4127 if (UTF && !IN_BYTES)
4128 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4141 if (PL_expect == XSTATE) {
4148 if (*s == ':' && s[1] == ':') {
4151 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4152 if (!(tmp = keyword(PL_tokenbuf, len)))
4153 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4167 LOP(OP_ACCEPT,XTERM);
4173 LOP(OP_ATAN2,XTERM);
4179 LOP(OP_BINMODE,XTERM);
4182 LOP(OP_BLESS,XTERM);
4191 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4208 if (!PL_cryptseen) {
4209 PL_cryptseen = TRUE;
4213 LOP(OP_CRYPT,XTERM);
4216 LOP(OP_CHMOD,XTERM);
4219 LOP(OP_CHOWN,XTERM);
4222 LOP(OP_CONNECT,XTERM);
4238 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4242 PL_hints |= HINT_BLOCK_SCOPE;
4252 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4253 LOP(OP_DBMOPEN,XTERM);
4259 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4266 yylval.ival = CopLINE(PL_curcop);
4280 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4281 UNIBRACK(OP_ENTEREVAL);
4296 case KEY_endhostent:
4302 case KEY_endservent:
4305 case KEY_endprotoent:
4316 yylval.ival = CopLINE(PL_curcop);
4318 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4320 if ((PL_bufend - p) >= 3 &&
4321 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4323 else if ((PL_bufend - p) >= 4 &&
4324 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4327 if (isIDFIRST_lazy_if(p,UTF)) {
4328 p = scan_ident(p, PL_bufend,
4329 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4333 Perl_croak(aTHX_ "Missing $ on loop variable");
4338 LOP(OP_FORMLINE,XTERM);
4344 LOP(OP_FCNTL,XTERM);
4350 LOP(OP_FLOCK,XTERM);
4359 LOP(OP_GREPSTART, XREF);
4362 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4377 case KEY_getpriority:
4378 LOP(OP_GETPRIORITY,XTERM);
4380 case KEY_getprotobyname:
4383 case KEY_getprotobynumber:
4384 LOP(OP_GPBYNUMBER,XTERM);
4386 case KEY_getprotoent:
4398 case KEY_getpeername:
4399 UNI(OP_GETPEERNAME);
4401 case KEY_gethostbyname:
4404 case KEY_gethostbyaddr:
4405 LOP(OP_GHBYADDR,XTERM);
4407 case KEY_gethostent:
4410 case KEY_getnetbyname:
4413 case KEY_getnetbyaddr:
4414 LOP(OP_GNBYADDR,XTERM);
4419 case KEY_getservbyname:
4420 LOP(OP_GSBYNAME,XTERM);
4422 case KEY_getservbyport:
4423 LOP(OP_GSBYPORT,XTERM);
4425 case KEY_getservent:
4428 case KEY_getsockname:
4429 UNI(OP_GETSOCKNAME);
4431 case KEY_getsockopt:
4432 LOP(OP_GSOCKOPT,XTERM);
4454 yylval.ival = CopLINE(PL_curcop);
4458 LOP(OP_INDEX,XTERM);
4464 LOP(OP_IOCTL,XTERM);
4476 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4508 LOP(OP_LISTEN,XTERM);
4517 s = scan_pat(s,OP_MATCH);
4518 TERM(sublex_start());
4521 LOP(OP_MAPSTART, XREF);
4524 LOP(OP_MKDIR,XTERM);
4527 LOP(OP_MSGCTL,XTERM);
4530 LOP(OP_MSGGET,XTERM);
4533 LOP(OP_MSGRCV,XTERM);
4536 LOP(OP_MSGSND,XTERM);
4542 if (isIDFIRST_lazy_if(s,UTF)) {
4543 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4544 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4546 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4547 if (!PL_in_my_stash) {
4550 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4558 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4565 if (PL_expect != XSTATE)
4566 yyerror("\"no\" not allowed in expression");
4567 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4568 s = force_version(s, FALSE);
4573 if (*s == '(' || (s = skipspace(s), *s == '('))
4580 if (isIDFIRST_lazy_if(s,UTF)) {
4582 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4584 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4585 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4586 "Precedence problem: open %.*s should be open(%.*s)",
4592 yylval.ival = OP_OR;
4602 LOP(OP_OPEN_DIR,XTERM);
4605 checkcomma(s,PL_tokenbuf,"filehandle");
4609 checkcomma(s,PL_tokenbuf,"filehandle");
4628 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4632 LOP(OP_PIPE_OP,XTERM);
4635 s = scan_str(s,FALSE,FALSE);
4637 missingterm((char*)0);
4638 yylval.ival = OP_CONST;
4639 TERM(sublex_start());
4645 s = scan_str(s,FALSE,FALSE);
4647 missingterm((char*)0);
4649 if (SvCUR(PL_lex_stuff)) {
4652 d = SvPV_force(PL_lex_stuff, len);
4655 for (; isSPACE(*d) && len; --len, ++d) ;
4658 if (!warned && ckWARN(WARN_QW)) {
4659 for (; !isSPACE(*d) && len; --len, ++d) {
4661 Perl_warner(aTHX_ packWARN(WARN_QW),
4662 "Possible attempt to separate words with commas");
4665 else if (*d == '#') {
4666 Perl_warner(aTHX_ packWARN(WARN_QW),
4667 "Possible attempt to put comments in qw() list");
4673 for (; !isSPACE(*d) && len; --len, ++d) ;
4675 sv = newSVpvn(b, d-b);
4676 if (DO_UTF8(PL_lex_stuff))
4678 words = append_elem(OP_LIST, words,
4679 newSVOP(OP_CONST, 0, tokeq(sv)));
4683 PL_nextval[PL_nexttoke].opval = words;
4688 SvREFCNT_dec(PL_lex_stuff);
4689 PL_lex_stuff = Nullsv;
4695 s = scan_str(s,FALSE,FALSE);
4697 missingterm((char*)0);
4698 yylval.ival = OP_STRINGIFY;
4699 if (SvIVX(PL_lex_stuff) == '\'')
4700 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4701 TERM(sublex_start());
4704 s = scan_pat(s,OP_QR);
4705 TERM(sublex_start());
4708 s = scan_str(s,FALSE,FALSE);
4710 missingterm((char*)0);
4711 yylval.ival = OP_BACKTICK;
4713 TERM(sublex_start());
4721 s = force_version(s, FALSE);
4723 else if (*s != 'v' || !isDIGIT(s[1])
4724 || (s = force_version(s, TRUE), *s == 'v'))
4726 *PL_tokenbuf = '\0';
4727 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4728 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4729 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4731 yyerror("<> should be quotes");
4739 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4743 LOP(OP_RENAME,XTERM);
4752 LOP(OP_RINDEX,XTERM);
4775 LOP(OP_REVERSE,XTERM);
4786 TERM(sublex_start());
4788 TOKEN(1); /* force error */
4797 LOP(OP_SELECT,XTERM);
4803 LOP(OP_SEMCTL,XTERM);
4806 LOP(OP_SEMGET,XTERM);
4809 LOP(OP_SEMOP,XTERM);
4815 LOP(OP_SETPGRP,XTERM);
4817 case KEY_setpriority:
4818 LOP(OP_SETPRIORITY,XTERM);
4820 case KEY_sethostent:
4826 case KEY_setservent:
4829 case KEY_setprotoent:
4839 LOP(OP_SEEKDIR,XTERM);
4841 case KEY_setsockopt:
4842 LOP(OP_SSOCKOPT,XTERM);
4848 LOP(OP_SHMCTL,XTERM);
4851 LOP(OP_SHMGET,XTERM);
4854 LOP(OP_SHMREAD,XTERM);
4857 LOP(OP_SHMWRITE,XTERM);
4860 LOP(OP_SHUTDOWN,XTERM);
4869 LOP(OP_SOCKET,XTERM);
4871 case KEY_socketpair:
4872 LOP(OP_SOCKPAIR,XTERM);
4875 checkcomma(s,PL_tokenbuf,"subroutine name");
4877 if (*s == ';' || *s == ')') /* probably a close */
4878 Perl_croak(aTHX_ "sort is now a reserved word");
4880 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4884 LOP(OP_SPLIT,XTERM);
4887 LOP(OP_SPRINTF,XTERM);
4890 LOP(OP_SPLICE,XTERM);
4905 LOP(OP_SUBSTR,XTERM);
4911 char tmpbuf[sizeof PL_tokenbuf];
4912 SSize_t tboffset = 0;
4913 expectation attrful;
4914 bool have_name, have_proto, bad_proto;
4919 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4920 (*s == ':' && s[1] == ':'))
4923 attrful = XATTRBLOCK;
4924 /* remember buffer pos'n for later force_word */
4925 tboffset = s - PL_oldbufptr;
4926 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4927 if (strchr(tmpbuf, ':'))
4928 sv_setpv(PL_subname, tmpbuf);
4930 sv_setsv(PL_subname,PL_curstname);
4931 sv_catpvn(PL_subname,"::",2);
4932 sv_catpvn(PL_subname,tmpbuf,len);
4939 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4940 PL_expect = XTERMBLOCK;
4941 attrful = XATTRTERM;
4942 sv_setpv(PL_subname,"?");
4946 if (key == KEY_format) {
4948 PL_lex_formbrack = PL_lex_brackets + 1;
4950 (void) force_word(PL_oldbufptr + tboffset, WORD,
4955 /* Look for a prototype */
4959 s = scan_str(s,FALSE,FALSE);
4961 Perl_croak(aTHX_ "Prototype not terminated");
4962 /* strip spaces and check for bad characters */
4963 d = SvPVX(PL_lex_stuff);
4966 for (p = d; *p; ++p) {
4969 if (!strchr("$@%*;[]&\\", *p))
4974 if (bad_proto && ckWARN(WARN_SYNTAX))
4975 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
4976 "Illegal character in prototype for %s : %s",
4977 SvPVX(PL_subname), d);
4978 SvCUR(PL_lex_stuff) = tmp;
4986 if (*s == ':' && s[1] != ':')
4987 PL_expect = attrful;
4990 PL_nextval[PL_nexttoke].opval =
4991 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4992 PL_lex_stuff = Nullsv;
4996 sv_setpv(PL_subname,
4997 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5000 (void) force_word(PL_oldbufptr + tboffset, WORD,
5009 LOP(OP_SYSTEM,XREF);
5012 LOP(OP_SYMLINK,XTERM);
5015 LOP(OP_SYSCALL,XTERM);
5018 LOP(OP_SYSOPEN,XTERM);
5021 LOP(OP_SYSSEEK,XTERM);
5024 LOP(OP_SYSREAD,XTERM);
5027 LOP(OP_SYSWRITE,XTERM);
5031 TERM(sublex_start());
5052 LOP(OP_TRUNCATE,XTERM);
5064 yylval.ival = CopLINE(PL_curcop);
5068 yylval.ival = CopLINE(PL_curcop);
5072 LOP(OP_UNLINK,XTERM);
5078 LOP(OP_UNPACK,XTERM);
5081 LOP(OP_UTIME,XTERM);
5087 LOP(OP_UNSHIFT,XTERM);
5090 if (PL_expect != XSTATE)
5091 yyerror("\"use\" not allowed in expression");
5093 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5094 s = force_version(s, TRUE);
5095 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5096 PL_nextval[PL_nexttoke].opval = Nullop;
5099 else if (*s == 'v') {
5100 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5101 s = force_version(s, FALSE);
5105 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5106 s = force_version(s, FALSE);
5118 yylval.ival = CopLINE(PL_curcop);
5122 PL_hints |= HINT_BLOCK_SCOPE;
5129 LOP(OP_WAITPID,XTERM);
5138 ctl_l[0] = toCTRL('L');
5140 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5143 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5148 if (PL_expect == XOPERATOR)
5154 yylval.ival = OP_XOR;
5159 TERM(sublex_start());
5164 #pragma segment Main
5168 S_pending_ident(pTHX)
5172 /* pit holds the identifier we read and pending_ident is reset */
5173 char pit = PL_pending_ident;
5174 PL_pending_ident = 0;
5176 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5177 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5179 /* if we're in a my(), we can't allow dynamics here.
5180 $foo'bar has already been turned into $foo::bar, so
5181 just check for colons.
5183 if it's a legal name, the OP is a PADANY.
5186 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5187 if (strchr(PL_tokenbuf,':'))
5188 yyerror(Perl_form(aTHX_ "No package name allowed for "
5189 "variable %s in \"our\"",
5191 tmp = pad_allocmy(PL_tokenbuf);
5194 if (strchr(PL_tokenbuf,':'))
5195 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5197 yylval.opval = newOP(OP_PADANY, 0);
5198 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5204 build the ops for accesses to a my() variable.
5206 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5207 then used in a comparison. This catches most, but not
5208 all cases. For instance, it catches
5209 sort { my($a); $a <=> $b }
5211 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5212 (although why you'd do that is anyone's guess).
5215 if (!strchr(PL_tokenbuf,':')) {
5216 #ifdef USE_5005THREADS
5217 /* Check for single character per-thread SVs */
5218 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5219 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5220 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5222 yylval.opval = newOP(OP_THREADSV, 0);
5223 yylval.opval->op_targ = tmp;
5226 #endif /* USE_5005THREADS */
5227 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5228 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5229 /* might be an "our" variable" */
5230 if (SvFLAGS(namesv) & SVpad_OUR) {
5231 /* build ops for a bareword */
5232 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5233 sv_catpvn(sym, "::", 2);
5234 sv_catpv(sym, PL_tokenbuf+1);
5235 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5236 yylval.opval->op_private = OPpCONST_ENTERED;
5237 gv_fetchpv(SvPVX(sym),
5239 ? (GV_ADDMULTI | GV_ADDINEVAL)
5242 ((PL_tokenbuf[0] == '$') ? SVt_PV
5243 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5248 /* if it's a sort block and they're naming $a or $b */
5249 if (PL_last_lop_op == OP_SORT &&
5250 PL_tokenbuf[0] == '$' &&
5251 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5254 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5255 d < PL_bufend && *d != '\n';
5258 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5259 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5265 yylval.opval = newOP(OP_PADANY, 0);
5266 yylval.opval->op_targ = tmp;
5272 Whine if they've said @foo in a doublequoted string,
5273 and @foo isn't a variable we can find in the symbol
5276 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5277 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5278 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5279 && ckWARN(WARN_AMBIGUOUS))
5281 /* Downgraded from fatal to warning 20000522 mjd */
5282 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5283 "Possible unintended interpolation of %s in string",
5288 /* build ops for a bareword */
5289 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5290 yylval.opval->op_private = OPpCONST_ENTERED;
5291 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5292 ((PL_tokenbuf[0] == '$') ? SVt_PV
5293 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5299 Perl_keyword(pTHX_ register char *d, I32 len)
5304 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5305 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5306 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5307 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5308 if (strEQ(d,"__END__")) return KEY___END__;
5312 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5317 if (strEQ(d,"and")) return -KEY_and;
5318 if (strEQ(d,"abs")) return -KEY_abs;
5321 if (strEQ(d,"alarm")) return -KEY_alarm;
5322 if (strEQ(d,"atan2")) return -KEY_atan2;
5325 if (strEQ(d,"accept")) return -KEY_accept;
5330 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5333 if (strEQ(d,"bless")) return -KEY_bless;
5334 if (strEQ(d,"bind")) return -KEY_bind;
5335 if (strEQ(d,"binmode")) return -KEY_binmode;
5338 if (strEQ(d,"CORE")) return -KEY_CORE;
5339 if (strEQ(d,"CHECK")) return KEY_CHECK;
5344 if (strEQ(d,"cmp")) return -KEY_cmp;
5345 if (strEQ(d,"chr")) return -KEY_chr;
5346 if (strEQ(d,"cos")) return -KEY_cos;
5349 if (strEQ(d,"chop")) return -KEY_chop;
5352 if (strEQ(d,"close")) return -KEY_close;
5353 if (strEQ(d,"chdir")) return -KEY_chdir;
5354 if (strEQ(d,"chomp")) return -KEY_chomp;
5355 if (strEQ(d,"chmod")) return -KEY_chmod;
5356 if (strEQ(d,"chown")) return -KEY_chown;
5357 if (strEQ(d,"crypt")) return -KEY_crypt;
5360 if (strEQ(d,"chroot")) return -KEY_chroot;
5361 if (strEQ(d,"caller")) return -KEY_caller;
5364 if (strEQ(d,"connect")) return -KEY_connect;
5367 if (strEQ(d,"closedir")) return -KEY_closedir;
5368 if (strEQ(d,"continue")) return -KEY_continue;
5373 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5378 if (strEQ(d,"do")) return KEY_do;
5381 if (strEQ(d,"die")) return -KEY_die;
5384 if (strEQ(d,"dump")) return -KEY_dump;
5387 if (strEQ(d,"delete")) return KEY_delete;
5390 if (strEQ(d,"defined")) return KEY_defined;
5391 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5394 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5399 if (strEQ(d,"END")) return KEY_END;
5404 if (strEQ(d,"eq")) return -KEY_eq;
5407 if (strEQ(d,"eof")) return -KEY_eof;
5408 if (strEQ(d,"exp")) return -KEY_exp;
5411 if (strEQ(d,"else")) return KEY_else;
5412 if (strEQ(d,"exit")) return -KEY_exit;
5413 if (strEQ(d,"eval")) return KEY_eval;
5414 if (strEQ(d,"exec")) return -KEY_exec;
5415 if (strEQ(d,"each")) return -KEY_each;
5418 if (strEQ(d,"elsif")) return KEY_elsif;
5421 if (strEQ(d,"exists")) return KEY_exists;
5422 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5425 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5426 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5429 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5432 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5433 if (strEQ(d,"endservent")) return -KEY_endservent;
5436 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5443 if (strEQ(d,"for")) return KEY_for;
5446 if (strEQ(d,"fork")) return -KEY_fork;
5449 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5450 if (strEQ(d,"flock")) return -KEY_flock;
5453 if (strEQ(d,"format")) return KEY_format;
5454 if (strEQ(d,"fileno")) return -KEY_fileno;
5457 if (strEQ(d,"foreach")) return KEY_foreach;
5460 if (strEQ(d,"formline")) return -KEY_formline;
5465 if (strnEQ(d,"get",3)) {
5470 if (strEQ(d,"ppid")) return -KEY_getppid;
5471 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5474 if (strEQ(d,"pwent")) return -KEY_getpwent;
5475 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5476 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5479 if (strEQ(d,"peername")) return -KEY_getpeername;
5480 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5481 if (strEQ(d,"priority")) return -KEY_getpriority;
5484 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5487 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5491 else if (*d == 'h') {
5492 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5493 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5494 if (strEQ(d,"hostent")) return -KEY_gethostent;
5496 else if (*d == 'n') {
5497 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5498 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5499 if (strEQ(d,"netent")) return -KEY_getnetent;
5501 else if (*d == 's') {
5502 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5503 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5504 if (strEQ(d,"servent")) return -KEY_getservent;
5505 if (strEQ(d,"sockname")) return -KEY_getsockname;
5506 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5508 else if (*d == 'g') {
5509 if (strEQ(d,"grent")) return -KEY_getgrent;
5510 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5511 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5513 else if (*d == 'l') {
5514 if (strEQ(d,"login")) return -KEY_getlogin;
5516 else if (strEQ(d,"c")) return -KEY_getc;
5521 if (strEQ(d,"gt")) return -KEY_gt;
5522 if (strEQ(d,"ge")) return -KEY_ge;
5525 if (strEQ(d,"grep")) return KEY_grep;
5526 if (strEQ(d,"goto")) return KEY_goto;
5527 if (strEQ(d,"glob")) return KEY_glob;
5530 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5535 if (strEQ(d,"hex")) return -KEY_hex;
5538 if (strEQ(d,"INIT")) return KEY_INIT;
5543 if (strEQ(d,"if")) return KEY_if;
5546 if (strEQ(d,"int")) return -KEY_int;
5549 if (strEQ(d,"index")) return -KEY_index;
5550 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5555 if (strEQ(d,"join")) return -KEY_join;
5559 if (strEQ(d,"keys")) return -KEY_keys;
5560 if (strEQ(d,"kill")) return -KEY_kill;
5566 if (strEQ(d,"lt")) return -KEY_lt;
5567 if (strEQ(d,"le")) return -KEY_le;
5568 if (strEQ(d,"lc")) return -KEY_lc;
5571 if (strEQ(d,"log")) return -KEY_log;
5574 if (strEQ(d,"last")) return KEY_last;
5575 if (strEQ(d,"link")) return -KEY_link;
5576 if (strEQ(d,"lock")) return -KEY_lock;
5579 if (strEQ(d,"local")) return KEY_local;
5580 if (strEQ(d,"lstat")) return -KEY_lstat;
5583 if (strEQ(d,"length")) return -KEY_length;
5584 if (strEQ(d,"listen")) return -KEY_listen;
5587 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5590 if (strEQ(d,"localtime")) return -KEY_localtime;
5596 case 1: return KEY_m;
5598 if (strEQ(d,"my")) return KEY_my;
5601 if (strEQ(d,"map")) return KEY_map;
5604 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5607 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5608 if (strEQ(d,"msgget")) return -KEY_msgget;
5609 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5610 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5615 if (strEQ(d,"next")) return KEY_next;
5616 if (strEQ(d,"ne")) return -KEY_ne;
5617 if (strEQ(d,"not")) return -KEY_not;
5618 if (strEQ(d,"no")) return KEY_no;
5623 if (strEQ(d,"or")) return -KEY_or;
5626 if (strEQ(d,"ord")) return -KEY_ord;
5627 if (strEQ(d,"oct")) return -KEY_oct;
5628 if (strEQ(d,"our")) return KEY_our;
5631 if (strEQ(d,"open")) return -KEY_open;
5634 if (strEQ(d,"opendir")) return -KEY_opendir;
5641 if (strEQ(d,"pop")) return -KEY_pop;
5642 if (strEQ(d,"pos")) return KEY_pos;
5645 if (strEQ(d,"push")) return -KEY_push;
5646 if (strEQ(d,"pack")) return -KEY_pack;
5647 if (strEQ(d,"pipe")) return -KEY_pipe;
5650 if (strEQ(d,"print")) return KEY_print;
5653 if (strEQ(d,"printf")) return KEY_printf;
5656 if (strEQ(d,"package")) return KEY_package;
5659 if (strEQ(d,"prototype")) return KEY_prototype;
5664 if (strEQ(d,"q")) return KEY_q;
5665 if (strEQ(d,"qr")) return KEY_qr;
5666 if (strEQ(d,"qq")) return KEY_qq;
5667 if (strEQ(d,"qw")) return KEY_qw;
5668 if (strEQ(d,"qx")) return KEY_qx;
5670 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5675 if (strEQ(d,"ref")) return -KEY_ref;
5678 if (strEQ(d,"read")) return -KEY_read;
5679 if (strEQ(d,"rand")) return -KEY_rand;
5680 if (strEQ(d,"recv")) return -KEY_recv;
5681 if (strEQ(d,"redo")) return KEY_redo;
5684 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5685 if (strEQ(d,"reset")) return -KEY_reset;
5688 if (strEQ(d,"return")) return KEY_return;
5689 if (strEQ(d,"rename")) return -KEY_rename;
5690 if (strEQ(d,"rindex")) return -KEY_rindex;
5693 if (strEQ(d,"require")) return KEY_require;
5694 if (strEQ(d,"reverse")) return -KEY_reverse;
5695 if (strEQ(d,"readdir")) return -KEY_readdir;
5698 if (strEQ(d,"readlink")) return -KEY_readlink;
5699 if (strEQ(d,"readline")) return -KEY_readline;
5700 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5703 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5709 case 0: return KEY_s;
5711 if (strEQ(d,"scalar")) return KEY_scalar;
5716 if (strEQ(d,"seek")) return -KEY_seek;
5717 if (strEQ(d,"send")) return -KEY_send;
5720 if (strEQ(d,"semop")) return -KEY_semop;
5723 if (strEQ(d,"select")) return -KEY_select;
5724 if (strEQ(d,"semctl")) return -KEY_semctl;
5725 if (strEQ(d,"semget")) return -KEY_semget;
5728 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5729 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5732 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5733 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5736 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5739 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5740 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5741 if (strEQ(d,"setservent")) return -KEY_setservent;
5744 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5745 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5752 if (strEQ(d,"shift")) return -KEY_shift;
5755 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5756 if (strEQ(d,"shmget")) return -KEY_shmget;
5759 if (strEQ(d,"shmread")) return -KEY_shmread;
5762 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5763 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5768 if (strEQ(d,"sin")) return -KEY_sin;
5771 if (strEQ(d,"sleep")) return -KEY_sleep;
5774 if (strEQ(d,"sort")) return KEY_sort;
5775 if (strEQ(d,"socket")) return -KEY_socket;
5776 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5779 if (strEQ(d,"split")) return KEY_split;
5780 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5781 if (strEQ(d,"splice")) return -KEY_splice;
5784 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5787 if (strEQ(d,"srand")) return -KEY_srand;
5790 if (strEQ(d,"stat")) return -KEY_stat;
5791 if (strEQ(d,"study")) return KEY_study;
5794 if (strEQ(d,"substr")) return -KEY_substr;
5795 if (strEQ(d,"sub")) return KEY_sub;
5800 if (strEQ(d,"system")) return -KEY_system;
5803 if (strEQ(d,"symlink")) return -KEY_symlink;
5804 if (strEQ(d,"syscall")) return -KEY_syscall;
5805 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5806 if (strEQ(d,"sysread")) return -KEY_sysread;
5807 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5810 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5819 if (strEQ(d,"tr")) return KEY_tr;
5822 if (strEQ(d,"tie")) return KEY_tie;
5825 if (strEQ(d,"tell")) return -KEY_tell;
5826 if (strEQ(d,"tied")) return KEY_tied;
5827 if (strEQ(d,"time")) return -KEY_time;
5830 if (strEQ(d,"times")) return -KEY_times;
5833 if (strEQ(d,"telldir")) return -KEY_telldir;
5836 if (strEQ(d,"truncate")) return -KEY_truncate;
5843 if (strEQ(d,"uc")) return -KEY_uc;
5846 if (strEQ(d,"use")) return KEY_use;
5849 if (strEQ(d,"undef")) return KEY_undef;
5850 if (strEQ(d,"until")) return KEY_until;
5851 if (strEQ(d,"untie")) return KEY_untie;
5852 if (strEQ(d,"utime")) return -KEY_utime;
5853 if (strEQ(d,"umask")) return -KEY_umask;
5856 if (strEQ(d,"unless")) return KEY_unless;
5857 if (strEQ(d,"unpack")) return -KEY_unpack;
5858 if (strEQ(d,"unlink")) return -KEY_unlink;
5861 if (strEQ(d,"unshift")) return -KEY_unshift;
5862 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5867 if (strEQ(d,"values")) return -KEY_values;
5868 if (strEQ(d,"vec")) return -KEY_vec;
5873 if (strEQ(d,"warn")) return -KEY_warn;
5874 if (strEQ(d,"wait")) return -KEY_wait;
5877 if (strEQ(d,"while")) return KEY_while;
5878 if (strEQ(d,"write")) return -KEY_write;
5881 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5884 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5889 if (len == 1) return -KEY_x;
5890 if (strEQ(d,"xor")) return -KEY_xor;
5893 if (len == 1) return KEY_y;
5902 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5906 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5907 if (ckWARN(WARN_SYNTAX)) {
5909 for (w = s+2; *w && level; w++) {
5916 for (; *w && isSPACE(*w); w++) ;
5917 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5918 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5919 "%s (...) interpreted as function",name);
5922 while (s < PL_bufend && isSPACE(*s))
5926 while (s < PL_bufend && isSPACE(*s))
5928 if (isIDFIRST_lazy_if(s,UTF)) {
5930 while (isALNUM_lazy_if(s,UTF))
5932 while (s < PL_bufend && isSPACE(*s))
5937 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5941 Perl_croak(aTHX_ "No comma allowed after %s", what);
5946 /* Either returns sv, or mortalizes sv and returns a new SV*.
5947 Best used as sv=new_constant(..., sv, ...).
5948 If s, pv are NULL, calls subroutine with one argument,
5949 and type is used with error messages only. */
5952 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5956 HV *table = GvHV(PL_hintgv); /* ^H */
5960 const char *why1, *why2, *why3;
5962 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5965 why2 = strEQ(key,"charnames")
5966 ? "(possibly a missing \"use charnames ...\")"
5968 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5969 (type ? type: "undef"), why2);
5971 /* This is convoluted and evil ("goto considered harmful")
5972 * but I do not understand the intricacies of all the different
5973 * failure modes of %^H in here. The goal here is to make
5974 * the most probable error message user-friendly. --jhi */
5979 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5980 (type ? type: "undef"), why1, why2, why3);
5982 yyerror(SvPVX(msg));
5986 cvp = hv_fetch(table, key, strlen(key), FALSE);
5987 if (!cvp || !SvOK(*cvp)) {
5990 why3 = "} is not defined";
5993 sv_2mortal(sv); /* Parent created it permanently */
5996 pv = sv_2mortal(newSVpvn(s, len));
5998 typesv = sv_2mortal(newSVpv(type, 0));
6000 typesv = &PL_sv_undef;
6002 PUSHSTACKi(PERLSI_OVERLOAD);
6014 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6018 /* Check the eval first */
6019 if (!PL_in_eval && SvTRUE(ERRSV)) {
6021 sv_catpv(ERRSV, "Propagated");
6022 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6024 res = SvREFCNT_inc(sv);
6028 (void)SvREFCNT_inc(res);
6037 why1 = "Call to &{$^H{";
6039 why3 = "}} did not return a defined value";
6048 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6050 register char *d = dest;
6051 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6054 Perl_croak(aTHX_ ident_too_long);
6055 if (isALNUM(*s)) /* UTF handled below */
6057 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6062 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6066 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6067 char *t = s + UTF8SKIP(s);
6068 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6070 if (d + (t - s) > e)
6071 Perl_croak(aTHX_ ident_too_long);
6072 Copy(s, d, t - s, char);
6085 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6095 e = d + destlen - 3; /* two-character token, ending NUL */
6097 while (isDIGIT(*s)) {
6099 Perl_croak(aTHX_ ident_too_long);
6106 Perl_croak(aTHX_ ident_too_long);
6107 if (isALNUM(*s)) /* UTF handled below */
6109 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6114 else if (*s == ':' && s[1] == ':') {
6118 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6119 char *t = s + UTF8SKIP(s);
6120 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6122 if (d + (t - s) > e)
6123 Perl_croak(aTHX_ ident_too_long);
6124 Copy(s, d, t - s, char);
6135 if (PL_lex_state != LEX_NORMAL)
6136 PL_lex_state = LEX_INTERPENDMAYBE;
6139 if (*s == '$' && s[1] &&
6140 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6153 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6158 if (isSPACE(s[-1])) {
6161 if (!SPACE_OR_TAB(ch)) {
6167 if (isIDFIRST_lazy_if(d,UTF)) {
6171 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6173 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6176 Copy(s, d, e - s, char);
6181 while ((isALNUM(*s) || *s == ':') && d < e)
6184 Perl_croak(aTHX_ ident_too_long);
6187 while (s < send && SPACE_OR_TAB(*s)) s++;
6188 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6189 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6190 const char *brack = *s == '[' ? "[...]" : "{...}";
6191 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6192 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6193 funny, dest, brack, funny, dest, brack);
6196 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6200 /* Handle extended ${^Foo} variables
6201 * 1999-02-27 mjd-perl-patch@plover.com */
6202 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6206 while (isALNUM(*s) && d < e) {
6210 Perl_croak(aTHX_ ident_too_long);
6215 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6216 PL_lex_state = LEX_INTERPEND;
6219 if (PL_lex_state == LEX_NORMAL) {
6220 if (ckWARN(WARN_AMBIGUOUS) &&
6221 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6223 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6224 "Ambiguous use of %c{%s} resolved to %c%s",
6225 funny, dest, funny, dest);
6230 s = bracket; /* let the parser handle it */
6234 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6235 PL_lex_state = LEX_INTERPEND;
6240 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6245 *pmfl |= PMf_GLOBAL;
6247 *pmfl |= PMf_CONTINUE;
6251 *pmfl |= PMf_MULTILINE;
6253 *pmfl |= PMf_SINGLELINE;
6255 *pmfl |= PMf_EXTENDED;
6259 S_scan_pat(pTHX_ char *start, I32 type)
6264 s = scan_str(start,FALSE,FALSE);
6266 Perl_croak(aTHX_ "Search pattern not terminated");
6268 pm = (PMOP*)newPMOP(type, 0);
6269 if (PL_multi_open == '?')
6270 pm->op_pmflags |= PMf_ONCE;
6272 while (*s && strchr("iomsx", *s))
6273 pmflag(&pm->op_pmflags,*s++);
6276 while (*s && strchr("iogcmsx", *s))
6277 pmflag(&pm->op_pmflags,*s++);
6279 pm->op_pmpermflags = pm->op_pmflags;
6281 PL_lex_op = (OP*)pm;
6282 yylval.ival = OP_MATCH;
6287 S_scan_subst(pTHX_ char *start)
6294 yylval.ival = OP_NULL;
6296 s = scan_str(start,FALSE,FALSE);
6299 Perl_croak(aTHX_ "Substitution pattern not terminated");
6301 if (s[-1] == PL_multi_open)
6304 first_start = PL_multi_start;
6305 s = scan_str(s,FALSE,FALSE);
6308 SvREFCNT_dec(PL_lex_stuff);
6309 PL_lex_stuff = Nullsv;
6311 Perl_croak(aTHX_ "Substitution replacement not terminated");
6313 PL_multi_start = first_start; /* so whole substitution is taken together */
6315 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6321 else if (strchr("iogcmsx", *s))
6322 pmflag(&pm->op_pmflags,*s++);
6329 PL_sublex_info.super_bufptr = s;
6330 PL_sublex_info.super_bufend = PL_bufend;
6332 pm->op_pmflags |= PMf_EVAL;
6333 repl = newSVpvn("",0);
6335 sv_catpv(repl, es ? "eval " : "do ");
6336 sv_catpvn(repl, "{ ", 2);
6337 sv_catsv(repl, PL_lex_repl);
6338 sv_catpvn(repl, " };", 2);
6340 SvREFCNT_dec(PL_lex_repl);
6344 pm->op_pmpermflags = pm->op_pmflags;
6345 PL_lex_op = (OP*)pm;
6346 yylval.ival = OP_SUBST;
6351 S_scan_trans(pTHX_ char *start)
6360 yylval.ival = OP_NULL;
6362 s = scan_str(start,FALSE,FALSE);
6364 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6365 if (s[-1] == PL_multi_open)
6368 s = scan_str(s,FALSE,FALSE);
6371 SvREFCNT_dec(PL_lex_stuff);
6372 PL_lex_stuff = Nullsv;
6374 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6377 complement = del = squash = 0;
6378 while (strchr("cds", *s)) {
6380 complement = OPpTRANS_COMPLEMENT;
6382 del = OPpTRANS_DELETE;
6384 squash = OPpTRANS_SQUASH;
6388 New(803, tbl, complement&&!del?258:256, short);
6389 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6390 o->op_private = del|squash|complement|
6391 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6392 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6395 yylval.ival = OP_TRANS;
6400 S_scan_heredoc(pTHX_ register char *s)
6403 I32 op_type = OP_SCALAR;
6410 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6414 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6417 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6418 if (*peek && strchr("`'\"",*peek)) {
6421 s = delimcpy(d, e, s, PL_bufend, term, &len);
6431 if (!isALNUM_lazy_if(s,UTF))
6432 deprecate_old("bare << to mean <<\"\"");
6433 for (; isALNUM_lazy_if(s,UTF); s++) {
6438 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6439 Perl_croak(aTHX_ "Delimiter for here document is too long");
6442 len = d - PL_tokenbuf;
6443 #ifndef PERL_STRICT_CR
6444 d = strchr(s, '\r');
6448 while (s < PL_bufend) {
6454 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6463 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6468 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6469 herewas = newSVpvn(s,PL_bufend-s);
6471 s--, herewas = newSVpvn(s,d-s);
6472 s += SvCUR(herewas);
6474 tmpstr = NEWSV(87,79);
6475 sv_upgrade(tmpstr, SVt_PVIV);
6480 else if (term == '`') {
6481 op_type = OP_BACKTICK;
6482 SvIVX(tmpstr) = '\\';
6486 PL_multi_start = CopLINE(PL_curcop);
6487 PL_multi_open = PL_multi_close = '<';
6488 term = *PL_tokenbuf;
6489 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6490 char *bufptr = PL_sublex_info.super_bufptr;
6491 char *bufend = PL_sublex_info.super_bufend;
6492 char *olds = s - SvCUR(herewas);
6493 s = strchr(bufptr, '\n');
6497 while (s < bufend &&
6498 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6500 CopLINE_inc(PL_curcop);
6503 CopLINE_set(PL_curcop, PL_multi_start);
6504 missingterm(PL_tokenbuf);
6506 sv_setpvn(herewas,bufptr,d-bufptr+1);
6507 sv_setpvn(tmpstr,d+1,s-d);
6509 sv_catpvn(herewas,s,bufend-s);
6510 (void)strcpy(bufptr,SvPVX(herewas));
6517 while (s < PL_bufend &&
6518 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6520 CopLINE_inc(PL_curcop);
6522 if (s >= PL_bufend) {
6523 CopLINE_set(PL_curcop, PL_multi_start);
6524 missingterm(PL_tokenbuf);
6526 sv_setpvn(tmpstr,d+1,s-d);
6528 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6530 sv_catpvn(herewas,s,PL_bufend-s);
6531 sv_setsv(PL_linestr,herewas);
6532 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6533 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6534 PL_last_lop = PL_last_uni = Nullch;
6537 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6538 while (s >= PL_bufend) { /* multiple line string? */
6540 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6541 CopLINE_set(PL_curcop, PL_multi_start);
6542 missingterm(PL_tokenbuf);
6544 CopLINE_inc(PL_curcop);
6545 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6546 PL_last_lop = PL_last_uni = Nullch;
6547 #ifndef PERL_STRICT_CR
6548 if (PL_bufend - PL_linestart >= 2) {
6549 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6550 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6552 PL_bufend[-2] = '\n';
6554 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6556 else if (PL_bufend[-1] == '\r')
6557 PL_bufend[-1] = '\n';
6559 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6560 PL_bufend[-1] = '\n';
6562 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6563 SV *sv = NEWSV(88,0);
6565 sv_upgrade(sv, SVt_PVMG);
6566 sv_setsv(sv,PL_linestr);
6569 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6571 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6574 sv_catsv(PL_linestr,herewas);
6575 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6579 sv_catsv(tmpstr,PL_linestr);
6584 PL_multi_end = CopLINE(PL_curcop);
6585 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6586 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6587 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6589 SvREFCNT_dec(herewas);
6590 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6592 PL_lex_stuff = tmpstr;
6593 yylval.ival = op_type;
6598 takes: current position in input buffer
6599 returns: new position in input buffer
6600 side-effects: yylval and lex_op are set.
6605 <FH> read from filehandle
6606 <pkg::FH> read from package qualified filehandle
6607 <pkg'FH> read from package qualified filehandle
6608 <$fh> read from filehandle in $fh
6614 S_scan_inputsymbol(pTHX_ char *start)
6616 register char *s = start; /* current position in buffer */
6622 d = PL_tokenbuf; /* start of temp holding space */
6623 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6624 end = strchr(s, '\n');
6627 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6629 /* die if we didn't have space for the contents of the <>,
6630 or if it didn't end, or if we see a newline
6633 if (len >= sizeof PL_tokenbuf)
6634 Perl_croak(aTHX_ "Excessively long <> operator");
6636 Perl_croak(aTHX_ "Unterminated <> operator");
6641 Remember, only scalar variables are interpreted as filehandles by
6642 this code. Anything more complex (e.g., <$fh{$num}>) will be
6643 treated as a glob() call.
6644 This code makes use of the fact that except for the $ at the front,
6645 a scalar variable and a filehandle look the same.
6647 if (*d == '$' && d[1]) d++;
6649 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6650 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6653 /* If we've tried to read what we allow filehandles to look like, and
6654 there's still text left, then it must be a glob() and not a getline.
6655 Use scan_str to pull out the stuff between the <> and treat it
6656 as nothing more than a string.
6659 if (d - PL_tokenbuf != len) {
6660 yylval.ival = OP_GLOB;
6662 s = scan_str(start,FALSE,FALSE);
6664 Perl_croak(aTHX_ "Glob not terminated");
6668 bool readline_overriden = FALSE;
6669 GV *gv_readline = Nullgv;
6671 /* we're in a filehandle read situation */
6674 /* turn <> into <ARGV> */
6676 (void)strcpy(d,"ARGV");
6678 /* Check whether readline() is overriden */
6679 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6680 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6682 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6683 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6684 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6685 readline_overriden = TRUE;
6687 /* if <$fh>, create the ops to turn the variable into a
6693 /* try to find it in the pad for this block, otherwise find
6694 add symbol table ops
6696 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6697 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
6698 if (SvFLAGS(namesv) & SVpad_OUR) {
6699 SV *sym = sv_2mortal(newSVpv(HvNAME(GvSTASH(namesv)),0));
6700 sv_catpvn(sym, "::", 2);
6706 OP *o = newOP(OP_PADSV, 0);
6708 PL_lex_op = readline_overriden
6709 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6710 append_elem(OP_LIST, o,
6711 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6712 : (OP*)newUNOP(OP_READLINE, 0, o);
6721 ? (GV_ADDMULTI | GV_ADDINEVAL)
6724 PL_lex_op = readline_overriden
6725 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6726 append_elem(OP_LIST,
6727 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6728 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6729 : (OP*)newUNOP(OP_READLINE, 0,
6730 newUNOP(OP_RV2SV, 0,
6731 newGVOP(OP_GV, 0, gv)));
6733 if (!readline_overriden)
6734 PL_lex_op->op_flags |= OPf_SPECIAL;
6735 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6736 yylval.ival = OP_NULL;
6739 /* If it's none of the above, it must be a literal filehandle
6740 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6742 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6743 PL_lex_op = readline_overriden
6744 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6745 append_elem(OP_LIST,
6746 newGVOP(OP_GV, 0, gv),
6747 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6748 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6749 yylval.ival = OP_NULL;
6758 takes: start position in buffer
6759 keep_quoted preserve \ on the embedded delimiter(s)
6760 keep_delims preserve the delimiters around the string
6761 returns: position to continue reading from buffer
6762 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6763 updates the read buffer.
6765 This subroutine pulls a string out of the input. It is called for:
6766 q single quotes q(literal text)
6767 ' single quotes 'literal text'
6768 qq double quotes qq(interpolate $here please)
6769 " double quotes "interpolate $here please"
6770 qx backticks qx(/bin/ls -l)
6771 ` backticks `/bin/ls -l`
6772 qw quote words @EXPORT_OK = qw( func() $spam )
6773 m// regexp match m/this/
6774 s/// regexp substitute s/this/that/
6775 tr/// string transliterate tr/this/that/
6776 y/// string transliterate y/this/that/
6777 ($*@) sub prototypes sub foo ($)
6778 (stuff) sub attr parameters sub foo : attr(stuff)
6779 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6781 In most of these cases (all but <>, patterns and transliterate)
6782 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6783 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6784 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6787 It skips whitespace before the string starts, and treats the first
6788 character as the delimiter. If the delimiter is one of ([{< then
6789 the corresponding "close" character )]}> is used as the closing
6790 delimiter. It allows quoting of delimiters, and if the string has
6791 balanced delimiters ([{<>}]) it allows nesting.
6793 On success, the SV with the resulting string is put into lex_stuff or,
6794 if that is already non-NULL, into lex_repl. The second case occurs only
6795 when parsing the RHS of the special constructs s/// and tr/// (y///).
6796 For convenience, the terminating delimiter character is stuffed into
6801 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6803 SV *sv; /* scalar value: string */
6804 char *tmps; /* temp string, used for delimiter matching */
6805 register char *s = start; /* current position in the buffer */
6806 register char term; /* terminating character */
6807 register char *to; /* current position in the sv's data */
6808 I32 brackets = 1; /* bracket nesting level */
6809 bool has_utf8 = FALSE; /* is there any utf8 content? */
6811 /* skip space before the delimiter */
6815 /* mark where we are, in case we need to report errors */
6818 /* after skipping whitespace, the next character is the terminator */
6820 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6823 /* mark where we are */
6824 PL_multi_start = CopLINE(PL_curcop);
6825 PL_multi_open = term;
6827 /* find corresponding closing delimiter */
6828 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6830 PL_multi_close = term;
6832 /* create a new SV to hold the contents. 87 is leak category, I'm
6833 assuming. 79 is the SV's initial length. What a random number. */
6835 sv_upgrade(sv, SVt_PVIV);
6837 (void)SvPOK_only(sv); /* validate pointer */
6839 /* move past delimiter and try to read a complete string */
6841 sv_catpvn(sv, s, 1);
6844 /* extend sv if need be */
6845 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6846 /* set 'to' to the next character in the sv's string */
6847 to = SvPVX(sv)+SvCUR(sv);
6849 /* if open delimiter is the close delimiter read unbridle */
6850 if (PL_multi_open == PL_multi_close) {
6851 for (; s < PL_bufend; s++,to++) {
6852 /* embedded newlines increment the current line number */
6853 if (*s == '\n' && !PL_rsfp)
6854 CopLINE_inc(PL_curcop);
6855 /* handle quoted delimiters */
6856 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6857 if (!keep_quoted && s[1] == term)
6859 /* any other quotes are simply copied straight through */
6863 /* terminate when run out of buffer (the for() condition), or
6864 have found the terminator */
6865 else if (*s == term)
6867 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6873 /* if the terminator isn't the same as the start character (e.g.,
6874 matched brackets), we have to allow more in the quoting, and
6875 be prepared for nested brackets.
6878 /* read until we run out of string, or we find the terminator */
6879 for (; s < PL_bufend; s++,to++) {
6880 /* embedded newlines increment the line count */
6881 if (*s == '\n' && !PL_rsfp)
6882 CopLINE_inc(PL_curcop);
6883 /* backslashes can escape the open or closing characters */
6884 if (*s == '\\' && s+1 < PL_bufend) {
6886 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6891 /* allow nested opens and closes */
6892 else if (*s == PL_multi_close && --brackets <= 0)
6894 else if (*s == PL_multi_open)
6896 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6901 /* terminate the copied string and update the sv's end-of-string */
6903 SvCUR_set(sv, to - SvPVX(sv));
6906 * this next chunk reads more into the buffer if we're not done yet
6910 break; /* handle case where we are done yet :-) */
6912 #ifndef PERL_STRICT_CR
6913 if (to - SvPVX(sv) >= 2) {
6914 if ((to[-2] == '\r' && to[-1] == '\n') ||
6915 (to[-2] == '\n' && to[-1] == '\r'))
6919 SvCUR_set(sv, to - SvPVX(sv));
6921 else if (to[-1] == '\r')
6924 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6928 /* if we're out of file, or a read fails, bail and reset the current
6929 line marker so we can report where the unterminated string began
6932 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6934 CopLINE_set(PL_curcop, PL_multi_start);
6937 /* we read a line, so increment our line counter */
6938 CopLINE_inc(PL_curcop);
6940 /* update debugger info */
6941 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6942 SV *sv = NEWSV(88,0);
6944 sv_upgrade(sv, SVt_PVMG);
6945 sv_setsv(sv,PL_linestr);
6948 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6951 /* having changed the buffer, we must update PL_bufend */
6952 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6953 PL_last_lop = PL_last_uni = Nullch;
6956 /* at this point, we have successfully read the delimited string */
6959 sv_catpvn(sv, s, 1);
6962 PL_multi_end = CopLINE(PL_curcop);
6965 /* if we allocated too much space, give some back */
6966 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6967 SvLEN_set(sv, SvCUR(sv) + 1);
6968 Renew(SvPVX(sv), SvLEN(sv), char);
6971 /* decide whether this is the first or second quoted string we've read
6984 takes: pointer to position in buffer
6985 returns: pointer to new position in buffer
6986 side-effects: builds ops for the constant in yylval.op
6988 Read a number in any of the formats that Perl accepts:
6990 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
6991 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
6994 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
6996 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6999 If it reads a number without a decimal point or an exponent, it will
7000 try converting the number to an integer and see if it can do so
7001 without loss of precision.
7005 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7007 register char *s = start; /* current position in buffer */
7008 register char *d; /* destination in temp buffer */
7009 register char *e; /* end of temp buffer */
7010 NV nv; /* number read, as a double */
7011 SV *sv = Nullsv; /* place to put the converted number */
7012 bool floatit; /* boolean: int or float? */
7013 char *lastub = 0; /* position of last underbar */
7014 static char number_too_long[] = "Number too long";
7016 /* We use the first character to decide what type of number this is */
7020 Perl_croak(aTHX_ "panic: scan_num");
7022 /* if it starts with a 0, it could be an octal number, a decimal in
7023 0.13 disguise, or a hexadecimal number, or a binary number. */
7027 u holds the "number so far"
7028 shift the power of 2 of the base
7029 (hex == 4, octal == 3, binary == 1)
7030 overflowed was the number more than we can hold?
7032 Shift is used when we add a digit. It also serves as an "are
7033 we in octal/hex/binary?" indicator to disallow hex characters
7039 bool overflowed = FALSE;
7040 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7041 static char* bases[5] = { "", "binary", "", "octal",
7043 static char* Bases[5] = { "", "Binary", "", "Octal",
7045 static char *maxima[5] = { "",
7046 "0b11111111111111111111111111111111",
7050 char *base, *Base, *max;
7056 } else if (s[1] == 'b') {
7060 /* check for a decimal in disguise */
7061 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7063 /* so it must be octal */
7070 if (ckWARN(WARN_SYNTAX))
7071 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7072 "Misplaced _ in number");
7076 base = bases[shift];
7077 Base = Bases[shift];
7078 max = maxima[shift];
7080 /* read the rest of the number */
7082 /* x is used in the overflow test,
7083 b is the digit we're adding on. */
7088 /* if we don't mention it, we're done */
7092 /* _ are ignored -- but warned about if consecutive */
7094 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7095 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7096 "Misplaced _ in number");
7100 /* 8 and 9 are not octal */
7103 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7107 case '2': case '3': case '4':
7108 case '5': case '6': case '7':
7110 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7114 b = *s++ & 15; /* ASCII digit -> value of digit */
7118 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7119 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7120 /* make sure they said 0x */
7125 /* Prepare to put the digit we have onto the end
7126 of the number so far. We check for overflows.
7131 x = u << shift; /* make room for the digit */
7133 if ((x >> shift) != u
7134 && !(PL_hints & HINT_NEW_BINARY)) {
7137 if (ckWARN_d(WARN_OVERFLOW))
7138 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7139 "Integer overflow in %s number",
7142 u = x | b; /* add the digit to the end */
7145 n *= nvshift[shift];
7146 /* If an NV has not enough bits in its
7147 * mantissa to represent an UV this summing of
7148 * small low-order numbers is a waste of time
7149 * (because the NV cannot preserve the
7150 * low-order bits anyway): we could just
7151 * remember when did we overflow and in the
7152 * end just multiply n by the right
7160 /* if we get here, we had success: make a scalar value from
7165 /* final misplaced underbar check */
7167 if (ckWARN(WARN_SYNTAX))
7168 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7173 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7174 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7175 "%s number > %s non-portable",
7181 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7182 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7183 "%s number > %s non-portable",
7188 if (PL_hints & HINT_NEW_BINARY)
7189 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7194 handle decimal numbers.
7195 we're also sent here when we read a 0 as the first digit
7197 case '1': case '2': case '3': case '4': case '5':
7198 case '6': case '7': case '8': case '9': case '.':
7201 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7204 /* read next group of digits and _ and copy into d */
7205 while (isDIGIT(*s) || *s == '_') {
7206 /* skip underscores, checking for misplaced ones
7210 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7211 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7212 "Misplaced _ in number");
7216 /* check for end of fixed-length buffer */
7218 Perl_croak(aTHX_ number_too_long);
7219 /* if we're ok, copy the character */
7224 /* final misplaced underbar check */
7225 if (lastub && s == lastub + 1) {
7226 if (ckWARN(WARN_SYNTAX))
7227 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7230 /* read a decimal portion if there is one. avoid
7231 3..5 being interpreted as the number 3. followed
7234 if (*s == '.' && s[1] != '.') {
7239 if (ckWARN(WARN_SYNTAX))
7240 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7241 "Misplaced _ in number");
7245 /* copy, ignoring underbars, until we run out of digits.
7247 for (; isDIGIT(*s) || *s == '_'; s++) {
7248 /* fixed length buffer check */
7250 Perl_croak(aTHX_ number_too_long);
7252 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7253 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7254 "Misplaced _ in number");
7260 /* fractional part ending in underbar? */
7262 if (ckWARN(WARN_SYNTAX))
7263 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7264 "Misplaced _ in number");
7266 if (*s == '.' && isDIGIT(s[1])) {
7267 /* oops, it's really a v-string, but without the "v" */
7273 /* read exponent part, if present */
7274 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7278 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7279 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7281 /* stray preinitial _ */
7283 if (ckWARN(WARN_SYNTAX))
7284 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7285 "Misplaced _ in number");
7289 /* allow positive or negative exponent */
7290 if (*s == '+' || *s == '-')
7293 /* stray initial _ */
7295 if (ckWARN(WARN_SYNTAX))
7296 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7297 "Misplaced _ in number");
7301 /* read digits of exponent */
7302 while (isDIGIT(*s) || *s == '_') {
7305 Perl_croak(aTHX_ number_too_long);
7309 if (ckWARN(WARN_SYNTAX) &&
7310 ((lastub && s == lastub + 1) ||
7311 (!isDIGIT(s[1]) && s[1] != '_')))
7312 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7313 "Misplaced _ in number");
7320 /* make an sv from the string */
7324 We try to do an integer conversion first if no characters
7325 indicating "float" have been found.
7330 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7332 if (flags == IS_NUMBER_IN_UV) {
7334 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7337 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7338 if (uv <= (UV) IV_MIN)
7339 sv_setiv(sv, -(IV)uv);
7346 /* terminate the string */
7348 nv = Atof(PL_tokenbuf);
7352 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7353 (PL_hints & HINT_NEW_INTEGER) )
7354 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7355 (floatit ? "float" : "integer"),
7359 /* if it starts with a v, it could be a v-string */
7362 sv = NEWSV(92,5); /* preallocate storage space */
7363 s = new_vstring(s,sv);
7367 /* make the op for the constant and return */
7370 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7372 lvalp->opval = Nullop;
7378 S_scan_formline(pTHX_ register char *s)
7382 SV *stuff = newSVpvn("",0);
7383 bool needargs = FALSE;
7386 if (*s == '.' || *s == /*{*/'}') {
7388 #ifdef PERL_STRICT_CR
7389 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7391 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7393 if (*t == '\n' || t == PL_bufend)
7396 if (PL_in_eval && !PL_rsfp) {
7397 eol = strchr(s,'\n');
7402 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7404 for (t = s; t < eol; t++) {
7405 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7407 goto enough; /* ~~ must be first line in formline */
7409 if (*t == '@' || *t == '^')
7413 sv_catpvn(stuff, s, eol-s);
7414 #ifndef PERL_STRICT_CR
7415 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7416 char *end = SvPVX(stuff) + SvCUR(stuff);
7428 s = filter_gets(PL_linestr, PL_rsfp, 0);
7429 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7430 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7431 PL_last_lop = PL_last_uni = Nullch;
7434 yyerror("Format not terminated");
7444 PL_lex_state = LEX_NORMAL;
7445 PL_nextval[PL_nexttoke].ival = 0;
7449 PL_lex_state = LEX_FORMLINE;
7450 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7452 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7456 SvREFCNT_dec(stuff);
7457 PL_lex_formbrack = 0;
7468 PL_cshlen = strlen(PL_cshname);
7473 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7475 I32 oldsavestack_ix = PL_savestack_ix;
7476 CV* outsidecv = PL_compcv;
7480 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7482 SAVEI32(PL_subline);
7483 save_item(PL_subname);
7486 SAVESPTR(PL_comppad_name);
7487 SAVESPTR(PL_compcv);
7488 SAVEI32(PL_comppad_name_fill);
7489 SAVEI32(PL_min_intro_pending);
7490 SAVEI32(PL_max_intro_pending);
7491 SAVEI32(PL_pad_reset_pending);
7493 PL_compcv = (CV*)NEWSV(1104,0);
7494 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7495 CvFLAGS(PL_compcv) |= flags;
7497 PL_comppad = newAV();
7498 av_push(PL_comppad, Nullsv);
7499 PL_curpad = AvARRAY(PL_comppad);
7500 PL_comppad_name = newAV();
7501 PL_comppad_name_fill = 0;
7502 PL_min_intro_pending = 0;
7504 PL_subline = CopLINE(PL_curcop);
7505 #ifdef USE_5005THREADS
7506 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7507 PL_curpad[0] = (SV*)newAV();
7508 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7509 #endif /* USE_5005THREADS */
7511 comppadlist = newAV();
7512 AvREAL_off(comppadlist);
7513 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7514 av_store(comppadlist, 1, (SV*)PL_comppad);
7516 CvPADLIST(PL_compcv) = comppadlist;
7517 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7518 #ifdef USE_5005THREADS
7519 CvOWNER(PL_compcv) = 0;
7520 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7521 MUTEX_INIT(CvMUTEXP(PL_compcv));
7522 #endif /* USE_5005THREADS */
7524 return oldsavestack_ix;
7528 #pragma segment Perl_yylex
7531 Perl_yywarn(pTHX_ char *s)
7533 PL_in_eval |= EVAL_WARNONLY;
7535 PL_in_eval &= ~EVAL_WARNONLY;
7540 Perl_yyerror(pTHX_ char *s)
7543 char *context = NULL;
7547 if (!yychar || (yychar == ';' && !PL_rsfp))
7549 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7550 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7551 while (isSPACE(*PL_oldoldbufptr))
7553 context = PL_oldoldbufptr;
7554 contlen = PL_bufptr - PL_oldoldbufptr;
7556 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7557 PL_oldbufptr != PL_bufptr) {
7558 while (isSPACE(*PL_oldbufptr))
7560 context = PL_oldbufptr;
7561 contlen = PL_bufptr - PL_oldbufptr;
7563 else if (yychar > 255)
7564 where = "next token ???";
7565 #ifdef USE_PURE_BISON
7566 /* GNU Bison sets the value -2 */
7567 else if (yychar == -2) {
7569 else if ((yychar & 127) == 127) {
7571 if (PL_lex_state == LEX_NORMAL ||
7572 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7573 where = "at end of line";
7574 else if (PL_lex_inpat)
7575 where = "within pattern";
7577 where = "within string";
7580 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7582 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7583 else if (isPRINT_LC(yychar))
7584 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7586 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7587 where = SvPVX(where_sv);
7589 msg = sv_2mortal(newSVpv(s, 0));
7590 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7591 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7593 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7595 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7596 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7597 Perl_sv_catpvf(aTHX_ msg,
7598 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7599 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7602 if (PL_in_eval & EVAL_WARNONLY)
7603 Perl_warn(aTHX_ "%"SVf, msg);
7606 if (PL_error_count >= 10) {
7607 if (PL_in_eval && SvCUR(ERRSV))
7608 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7609 ERRSV, OutCopFILE(PL_curcop));
7611 Perl_croak(aTHX_ "%s has too many errors.\n",
7612 OutCopFILE(PL_curcop));
7615 PL_in_my_stash = Nullhv;
7619 #pragma segment Main
7623 S_swallow_bom(pTHX_ U8 *s)
7626 slen = SvCUR(PL_linestr);
7630 /* UTF-16 little-endian */
7631 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7632 Perl_croak(aTHX_ "Unsupported script encoding");
7633 #ifndef PERL_NO_UTF16_FILTER
7634 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7636 if (PL_bufend > (char*)s) {
7640 filter_add(utf16rev_textfilter, NULL);
7641 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7642 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7643 PL_bufend - (char*)s - 1,
7645 Copy(news, s, newlen, U8);
7646 SvCUR_set(PL_linestr, newlen);
7647 PL_bufend = SvPVX(PL_linestr) + newlen;
7648 news[newlen++] = '\0';
7652 Perl_croak(aTHX_ "Unsupported script encoding");
7657 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7658 #ifndef PERL_NO_UTF16_FILTER
7659 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7661 if (PL_bufend > (char *)s) {
7665 filter_add(utf16_textfilter, NULL);
7666 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7667 PL_bufend = (char*)utf16_to_utf8(s, news,
7668 PL_bufend - (char*)s,
7670 Copy(news, s, newlen, U8);
7671 SvCUR_set(PL_linestr, newlen);
7672 PL_bufend = SvPVX(PL_linestr) + newlen;
7673 news[newlen++] = '\0';
7677 Perl_croak(aTHX_ "Unsupported script encoding");
7682 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7683 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7688 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7689 s[2] == 0xFE && s[3] == 0xFF)
7691 Perl_croak(aTHX_ "Unsupported script encoding");
7699 * Restore a source filter.
7703 restore_rsfp(pTHX_ void *f)
7705 PerlIO *fp = (PerlIO*)f;
7707 if (PL_rsfp == PerlIO_stdin())
7708 PerlIO_clearerr(PL_rsfp);
7709 else if (PL_rsfp && (PL_rsfp != fp))
7710 PerlIO_close(PL_rsfp);
7714 #ifndef PERL_NO_UTF16_FILTER
7716 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7718 I32 count = FILTER_READ(idx+1, sv, maxlen);
7723 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7724 if (!*SvPV_nolen(sv))
7725 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7728 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7729 sv_usepvn(sv, (char*)tmps, tend - tmps);
7735 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7737 I32 count = FILTER_READ(idx+1, sv, maxlen);
7742 if (!*SvPV_nolen(sv))
7743 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7746 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7747 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7748 sv_usepvn(sv, (char*)tmps, tend - tmps);