3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
30 static void restore_rsfp(pTHXo_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
39 /*#define UTF (SvUTF8(PL_linestr) && !(PL_hints & HINT_BYTE))*/
40 #define UTF (PL_hints & HINT_UTF8)
42 /* In variables name $^X, these are the legal values for X.
43 * 1999-02-27 mjd-perl-patch@plover.com */
44 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
46 /* On MacOS, respect nonbreaking spaces */
47 #ifdef MACOS_TRADITIONAL
48 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
50 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
53 /* LEX_* are values for PL_lex_state, the state of the lexer.
54 * They are arranged oddly so that the guard on the switch statement
55 * can get by with a single comparison (if the compiler is smart enough).
58 /* #define LEX_NOTPARSING 11 is done in perl.h. */
61 #define LEX_INTERPNORMAL 9
62 #define LEX_INTERPCASEMOD 8
63 #define LEX_INTERPPUSH 7
64 #define LEX_INTERPSTART 6
65 #define LEX_INTERPEND 5
66 #define LEX_INTERPENDMAYBE 4
67 #define LEX_INTERPCONCAT 3
68 #define LEX_INTERPCONST 2
69 #define LEX_FORMLINE 1
70 #define LEX_KNOWNEXT 0
72 /* XXX If this causes problems, set i_unistd=undef in the hint file. */
74 # include <unistd.h> /* Needed for execv() */
83 YYSTYPE* yylval_pointer = NULL;
84 int* yychar_pointer = NULL;
87 # define yylval (*yylval_pointer)
88 # define yychar (*yychar_pointer)
89 # define PERL_YYLEX_PARAM yylval_pointer,yychar_pointer
91 # define yylex() Perl_yylex(aTHX_ yylval_pointer, yychar_pointer)
96 /* CLINE is a macro that ensures PL_copline has a sane value */
101 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
104 * Convenience functions to return different tokens and prime the
105 * lexer for the next token. They all take an argument.
107 * TOKEN : generic token (used for '(', DOLSHARP, etc)
108 * OPERATOR : generic operator
109 * AOPERATOR : assignment operator
110 * PREBLOCK : beginning the block after an if, while, foreach, ...
111 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
112 * PREREF : *EXPR where EXPR is not a simple identifier
113 * TERM : expression term
114 * LOOPX : loop exiting command (goto, last, dump, etc)
115 * FTST : file test operator
116 * FUN0 : zero-argument function
117 * FUN1 : not used, except for not, which isn't a UNIOP
118 * BOop : bitwise or or xor
120 * SHop : shift operator
121 * PWop : power operator
122 * PMop : pattern-matching operator
123 * Aop : addition-level operator
124 * Mop : multiplication-level operator
125 * Eop : equality-testing operator
126 * Rop : relational operator <= != gt
128 * Also see LOP and lop() below.
131 #define TOKEN(retval) return (PL_bufptr = s,(int)retval)
132 #define OPERATOR(retval) return (PL_expect = XTERM,PL_bufptr = s,(int)retval)
133 #define AOPERATOR(retval) return ao((PL_expect = XTERM,PL_bufptr = s,(int)retval))
134 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
135 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
136 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s,(int)retval)
137 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR,PL_bufptr = s,(int)retval)
138 #define LOOPX(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
139 #define FTST(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
140 #define FUN0(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
141 #define FUN1(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
142 #define BOop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
143 #define BAop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
144 #define SHop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
145 #define PWop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
146 #define PMop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
147 #define Aop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
148 #define Mop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
149 #define Eop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
150 #define Rop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
152 /* This bit of chicanery makes a unary function followed by
153 * a parenthesis into a function with one argument, highest precedence.
155 #define UNI(f) return(yylval.ival = f, \
158 PL_last_uni = PL_oldbufptr, \
159 PL_last_lop_op = f, \
160 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
162 #define UNIBRACK(f) return(yylval.ival = f, \
164 PL_last_uni = PL_oldbufptr, \
165 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
167 /* grandfather return to old style */
168 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
173 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
174 * into an OP_ANDASSIGN or OP_ORASSIGN
178 S_ao(pTHX_ int toketype)
180 if (*PL_bufptr == '=') {
182 if (toketype == ANDAND)
183 yylval.ival = OP_ANDASSIGN;
184 else if (toketype == OROR)
185 yylval.ival = OP_ORASSIGN;
193 * When Perl expects an operator and finds something else, no_op
194 * prints the warning. It always prints "<something> found where
195 * operator expected. It prints "Missing semicolon on previous line?"
196 * if the surprise occurs at the start of the line. "do you need to
197 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
198 * where the compiler doesn't know if foo is a method call or a function.
199 * It prints "Missing operator before end of line" if there's nothing
200 * after the missing operator, or "... before <...>" if there is something
201 * after the missing operator.
205 S_no_op(pTHX_ char *what, char *s)
207 char *oldbp = PL_bufptr;
208 bool is_first = (PL_oldbufptr == PL_linestart);
216 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
218 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
219 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
221 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
222 if (t < PL_bufptr && isSPACE(*t))
223 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
224 t - PL_oldoldbufptr, PL_oldoldbufptr);
227 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
233 * Complain about missing quote/regexp/heredoc terminator.
234 * If it's called with (char *)NULL then it cauterizes the line buffer.
235 * If we're in a delimited string and the delimiter is a control
236 * character, it's reformatted into a two-char sequence like ^C.
241 S_missingterm(pTHX_ char *s)
246 char *nl = strrchr(s,'\n');
252 iscntrl(PL_multi_close)
254 PL_multi_close < 32 || PL_multi_close == 127
258 tmpbuf[1] = toCTRL(PL_multi_close);
264 *tmpbuf = PL_multi_close;
268 q = strchr(s,'"') ? '\'' : '"';
269 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
277 Perl_deprecate(pTHX_ char *s)
280 if (ckWARN(WARN_DEPRECATED))
281 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
286 * Deprecate a comma-less variable list.
292 deprecate("comma-less variable list");
296 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
297 * utf16-to-utf8-reversed.
300 #ifdef PERL_CR_FILTER
304 register char *s = SvPVX(sv);
305 register char *e = s + SvCUR(sv);
306 /* outer loop optimized to do nothing if there are no CR-LFs */
308 if (*s++ == '\r' && *s == '\n') {
309 /* hit a CR-LF, need to copy the rest */
310 register char *d = s - 1;
313 if (*s == '\r' && s[1] == '\n')
324 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
326 I32 count = FILTER_READ(idx+1, sv, maxlen);
327 if (count > 0 && !maxlen)
335 * Initialize variables. Uses the Perl save_stack to save its state (for
336 * recursive calls to the parser).
340 Perl_lex_start(pTHX_ SV *line)
346 SAVEI32(PL_lex_dojoin);
347 SAVEI32(PL_lex_brackets);
348 SAVEI32(PL_lex_casemods);
349 SAVEI32(PL_lex_starts);
350 SAVEI32(PL_lex_state);
351 SAVEVPTR(PL_lex_inpat);
352 SAVEI32(PL_lex_inwhat);
353 if (PL_lex_state == LEX_KNOWNEXT) {
354 I32 toke = PL_nexttoke;
355 while (--toke >= 0) {
356 SAVEI32(PL_nexttype[toke]);
357 SAVEVPTR(PL_nextval[toke]);
359 SAVEI32(PL_nexttoke);
362 SAVECOPLINE(PL_curcop);
365 SAVEPPTR(PL_oldbufptr);
366 SAVEPPTR(PL_oldoldbufptr);
367 SAVEPPTR(PL_linestart);
368 SAVESPTR(PL_linestr);
369 SAVEPPTR(PL_lex_brackstack);
370 SAVEPPTR(PL_lex_casestack);
371 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
372 SAVESPTR(PL_lex_stuff);
373 SAVEI32(PL_lex_defer);
374 SAVEI32(PL_sublex_info.sub_inwhat);
375 SAVESPTR(PL_lex_repl);
377 SAVEINT(PL_lex_expect);
379 PL_lex_state = LEX_NORMAL;
383 New(899, PL_lex_brackstack, 120, char);
384 New(899, PL_lex_casestack, 12, char);
385 SAVEFREEPV(PL_lex_brackstack);
386 SAVEFREEPV(PL_lex_casestack);
388 *PL_lex_casestack = '\0';
391 PL_lex_stuff = Nullsv;
392 PL_lex_repl = Nullsv;
395 PL_sublex_info.sub_inwhat = 0;
397 if (SvREADONLY(PL_linestr))
398 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
399 s = SvPV(PL_linestr, len);
400 if (len && s[len-1] != ';') {
401 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
402 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
403 sv_catpvn(PL_linestr, "\n;", 2);
405 SvTEMP_off(PL_linestr);
406 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
407 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
409 PL_rs = newSVpvn("\n", 1);
415 * Finalizer for lexing operations. Must be called when the parser is
416 * done with the lexer.
422 PL_doextract = FALSE;
427 * This subroutine has nothing to do with tilting, whether at windmills
428 * or pinball tables. Its name is short for "increment line". It
429 * increments the current line number in CopLINE(PL_curcop) and checks
430 * to see whether the line starts with a comment of the form
431 * # line 500 "foo.pm"
432 * If so, it sets the current line number and file to the values in the comment.
436 S_incline(pTHX_ char *s)
444 CopLINE_inc(PL_curcop);
447 while (SPACE_OR_TAB(*s)) s++;
448 if (strnEQ(s, "line", 4))
452 if (*s == ' ' || *s == '\t')
456 while (SPACE_OR_TAB(*s)) s++;
462 while (SPACE_OR_TAB(*s))
464 if (*s == '"' && (t = strchr(s+1, '"'))) {
469 for (t = s; !isSPACE(*t); t++) ;
472 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
474 if (*e != '\n' && *e != '\0')
475 return; /* false alarm */
481 Safefree(CopFILE(PL_curcop));
483 SvREFCNT_dec(CopFILEGV(PL_curcop));
485 CopFILE_set(PL_curcop, s);
488 CopLINE_set(PL_curcop, atoi(n)-1);
493 * Called to gobble the appropriate amount and type of whitespace.
494 * Skips comments as well.
498 S_skipspace(pTHX_ register char *s)
501 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
502 while (s < PL_bufend && SPACE_OR_TAB(*s))
508 SSize_t oldprevlen, oldoldprevlen;
509 SSize_t oldloplen, oldunilen;
510 while (s < PL_bufend && isSPACE(*s)) {
511 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
516 if (s < PL_bufend && *s == '#') {
517 while (s < PL_bufend && *s != '\n')
521 if (PL_in_eval && !PL_rsfp) {
528 /* only continue to recharge the buffer if we're at the end
529 * of the buffer, we're not reading from a source filter, and
530 * we're in normal lexing mode
532 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
533 PL_lex_state == LEX_FORMLINE)
536 /* try to recharge the buffer */
537 if ((s = filter_gets(PL_linestr, PL_rsfp,
538 (prevlen = SvCUR(PL_linestr)))) == Nullch)
540 /* end of file. Add on the -p or -n magic */
541 if (PL_minus_n || PL_minus_p) {
542 sv_setpv(PL_linestr,PL_minus_p ?
543 ";}continue{print or die qq(-p destination: $!\\n)" :
545 sv_catpv(PL_linestr,";}");
546 PL_minus_n = PL_minus_p = 0;
549 sv_setpv(PL_linestr,";");
551 /* reset variables for next time we lex */
552 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
554 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
556 /* Close the filehandle. Could be from -P preprocessor,
557 * STDIN, or a regular file. If we were reading code from
558 * STDIN (because the commandline held no -e or filename)
559 * then we don't close it, we reset it so the code can
560 * read from STDIN too.
563 if (PL_preprocess && !PL_in_eval)
564 (void)PerlProc_pclose(PL_rsfp);
565 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
566 PerlIO_clearerr(PL_rsfp);
568 (void)PerlIO_close(PL_rsfp);
573 /* not at end of file, so we only read another line */
574 /* make corresponding updates to old pointers, for yyerror() */
575 oldprevlen = PL_oldbufptr - PL_bufend;
576 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
578 oldunilen = PL_last_uni - PL_bufend;
580 oldloplen = PL_last_lop - PL_bufend;
581 PL_linestart = PL_bufptr = s + prevlen;
582 PL_bufend = s + SvCUR(PL_linestr);
584 PL_oldbufptr = s + oldprevlen;
585 PL_oldoldbufptr = s + oldoldprevlen;
587 PL_last_uni = s + oldunilen;
589 PL_last_lop = s + oldloplen;
592 /* debugger active and we're not compiling the debugger code,
593 * so store the line into the debugger's array of lines
595 if (PERLDB_LINE && PL_curstash != PL_debstash) {
596 SV *sv = NEWSV(85,0);
598 sv_upgrade(sv, SVt_PVMG);
599 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
600 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
607 * Check the unary operators to ensure there's no ambiguity in how they're
608 * used. An ambiguous piece of code would be:
610 * This doesn't mean rand() + 5. Because rand() is a unary operator,
611 * the +5 is its argument.
621 if (PL_oldoldbufptr != PL_last_uni)
623 while (isSPACE(*PL_last_uni))
625 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
626 if ((t = strchr(s, '(')) && t < PL_bufptr)
628 if (ckWARN_d(WARN_AMBIGUOUS)){
631 Perl_warner(aTHX_ WARN_AMBIGUOUS,
632 "Warning: Use of \"%s\" without parens is ambiguous",
638 /* workaround to replace the UNI() macro with a function. Only the
639 * hints/uts.sh file mentions this. Other comments elsewhere in the
640 * source indicate Microport Unix might need it too.
646 #define UNI(f) return uni(f,s)
649 S_uni(pTHX_ I32 f, char *s)
654 PL_last_uni = PL_oldbufptr;
665 #endif /* CRIPPLED_CC */
668 * LOP : macro to build a list operator. Its behaviour has been replaced
669 * with a subroutine, S_lop() for which LOP is just another name.
672 #define LOP(f,x) return lop(f,x,s)
676 * Build a list operator (or something that might be one). The rules:
677 * - if we have a next token, then it's a list operator [why?]
678 * - if the next thing is an opening paren, then it's a function
679 * - else it's a list operator
683 S_lop(pTHX_ I32 f, int x, char *s)
690 PL_last_lop = PL_oldbufptr;
705 * When the lexer realizes it knows the next token (for instance,
706 * it is reordering tokens for the parser) then it can call S_force_next
707 * to know what token to return the next time the lexer is called. Caller
708 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
709 * handles the token correctly.
713 S_force_next(pTHX_ I32 type)
715 PL_nexttype[PL_nexttoke] = type;
717 if (PL_lex_state != LEX_KNOWNEXT) {
718 PL_lex_defer = PL_lex_state;
719 PL_lex_expect = PL_expect;
720 PL_lex_state = LEX_KNOWNEXT;
726 * When the lexer knows the next thing is a word (for instance, it has
727 * just seen -> and it knows that the next char is a word char, then
728 * it calls S_force_word to stick the next word into the PL_next lookahead.
731 * char *start : buffer position (must be within PL_linestr)
732 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
733 * int check_keyword : if true, Perl checks to make sure the word isn't
734 * a keyword (do this if the word is a label, e.g. goto FOO)
735 * int allow_pack : if true, : characters will also be allowed (require,
737 * int allow_initial_tick : used by the "sub" lexer only.
741 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
746 start = skipspace(start);
748 if (isIDFIRST_lazy_if(s,UTF) ||
749 (allow_pack && *s == ':') ||
750 (allow_initial_tick && *s == '\'') )
752 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
753 if (check_keyword && keyword(PL_tokenbuf, len))
755 if (token == METHOD) {
760 PL_expect = XOPERATOR;
763 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
764 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
772 * Called when the lexer wants $foo *foo &foo etc, but the program
773 * text only contains the "foo" portion. The first argument is a pointer
774 * to the "foo", and the second argument is the type symbol to prefix.
775 * Forces the next token to be a "WORD".
776 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
780 S_force_ident(pTHX_ register char *s, int kind)
783 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
784 PL_nextval[PL_nexttoke].opval = o;
787 dTHR; /* just for in_eval */
788 o->op_private = OPpCONST_ENTERED;
789 /* XXX see note in pp_entereval() for why we forgo typo
790 warnings if the symbol must be introduced in an eval.
792 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
793 kind == '$' ? SVt_PV :
794 kind == '@' ? SVt_PVAV :
795 kind == '%' ? SVt_PVHV :
803 Perl_str_to_version(pTHX_ SV *sv)
808 char *start = SvPVx(sv,len);
809 bool utf = SvUTF8(sv) ? TRUE : FALSE;
810 char *end = start + len;
811 while (start < end) {
815 n = utf8_to_uv((U8*)start, &skip);
820 retval += ((NV)n)/nshift;
829 * Forces the next token to be a version number.
833 S_force_version(pTHX_ char *s)
835 OP *version = Nullop;
844 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
845 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
848 version = yylval.opval;
849 ver = cSVOPx(version)->op_sv;
850 if (SvPOK(ver) && !SvNIOK(ver)) {
851 (void)SvUPGRADE(ver, SVt_PVNV);
852 SvNVX(ver) = str_to_version(ver);
853 SvNOK_on(ver); /* hint that it is a version */
858 /* NOTE: The parser sees the package name and the VERSION swapped */
859 PL_nextval[PL_nexttoke].opval = version;
867 * Tokenize a quoted string passed in as an SV. It finds the next
868 * chunk, up to end of string or a backslash. It may make a new
869 * SV containing that chunk (if HINT_NEW_STRING is on). It also
874 S_tokeq(pTHX_ SV *sv)
885 s = SvPV_force(sv, len);
886 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
889 while (s < send && *s != '\\')
894 if ( PL_hints & HINT_NEW_STRING )
895 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
898 if (s + 1 < send && (s[1] == '\\'))
899 s++; /* all that, just for this */
904 SvCUR_set(sv, d - SvPVX(sv));
906 if ( PL_hints & HINT_NEW_STRING )
907 return new_constant(NULL, 0, "q", sv, pv, "q");
912 * Now come three functions related to double-quote context,
913 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
914 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
915 * interact with PL_lex_state, and create fake ( ... ) argument lists
916 * to handle functions and concatenation.
917 * They assume that whoever calls them will be setting up a fake
918 * join call, because each subthing puts a ',' after it. This lets
921 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
923 * (I'm not sure whether the spurious commas at the end of lcfirst's
924 * arguments and join's arguments are created or not).
929 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
931 * Pattern matching will set PL_lex_op to the pattern-matching op to
932 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
934 * OP_CONST and OP_READLINE are easy--just make the new op and return.
936 * Everything else becomes a FUNC.
938 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
939 * had an OP_CONST or OP_READLINE). This just sets us up for a
940 * call to S_sublex_push().
946 register I32 op_type = yylval.ival;
948 if (op_type == OP_NULL) {
949 yylval.opval = PL_lex_op;
953 if (op_type == OP_CONST || op_type == OP_READLINE) {
954 SV *sv = tokeq(PL_lex_stuff);
956 if (SvTYPE(sv) == SVt_PVIV) {
957 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
963 nsv = newSVpvn(p, len);
969 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
970 PL_lex_stuff = Nullsv;
974 PL_sublex_info.super_state = PL_lex_state;
975 PL_sublex_info.sub_inwhat = op_type;
976 PL_sublex_info.sub_op = PL_lex_op;
977 PL_lex_state = LEX_INTERPPUSH;
981 yylval.opval = PL_lex_op;
991 * Create a new scope to save the lexing state. The scope will be
992 * ended in S_sublex_done. Returns a '(', starting the function arguments
993 * to the uc, lc, etc. found before.
994 * Sets PL_lex_state to LEX_INTERPCONCAT.
1003 PL_lex_state = PL_sublex_info.super_state;
1004 SAVEI32(PL_lex_dojoin);
1005 SAVEI32(PL_lex_brackets);
1006 SAVEI32(PL_lex_casemods);
1007 SAVEI32(PL_lex_starts);
1008 SAVEI32(PL_lex_state);
1009 SAVEVPTR(PL_lex_inpat);
1010 SAVEI32(PL_lex_inwhat);
1011 SAVECOPLINE(PL_curcop);
1012 SAVEPPTR(PL_bufptr);
1013 SAVEPPTR(PL_oldbufptr);
1014 SAVEPPTR(PL_oldoldbufptr);
1015 SAVEPPTR(PL_linestart);
1016 SAVESPTR(PL_linestr);
1017 SAVEPPTR(PL_lex_brackstack);
1018 SAVEPPTR(PL_lex_casestack);
1020 PL_linestr = PL_lex_stuff;
1021 PL_lex_stuff = Nullsv;
1023 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1024 = SvPVX(PL_linestr);
1025 PL_bufend += SvCUR(PL_linestr);
1026 SAVEFREESV(PL_linestr);
1028 PL_lex_dojoin = FALSE;
1029 PL_lex_brackets = 0;
1030 New(899, PL_lex_brackstack, 120, char);
1031 New(899, PL_lex_casestack, 12, char);
1032 SAVEFREEPV(PL_lex_brackstack);
1033 SAVEFREEPV(PL_lex_casestack);
1034 PL_lex_casemods = 0;
1035 *PL_lex_casestack = '\0';
1037 PL_lex_state = LEX_INTERPCONCAT;
1038 CopLINE_set(PL_curcop, PL_multi_start);
1040 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1041 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1042 PL_lex_inpat = PL_sublex_info.sub_op;
1044 PL_lex_inpat = Nullop;
1051 * Restores lexer state after a S_sublex_push.
1057 if (!PL_lex_starts++) {
1058 PL_expect = XOPERATOR;
1059 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn("",0));
1063 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1064 PL_lex_state = LEX_INTERPCASEMOD;
1068 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1069 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1070 PL_linestr = PL_lex_repl;
1072 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1073 PL_bufend += SvCUR(PL_linestr);
1074 SAVEFREESV(PL_linestr);
1075 PL_lex_dojoin = FALSE;
1076 PL_lex_brackets = 0;
1077 PL_lex_casemods = 0;
1078 *PL_lex_casestack = '\0';
1080 if (SvEVALED(PL_lex_repl)) {
1081 PL_lex_state = LEX_INTERPNORMAL;
1083 /* we don't clear PL_lex_repl here, so that we can check later
1084 whether this is an evalled subst; that means we rely on the
1085 logic to ensure sublex_done() is called again only via the
1086 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1089 PL_lex_state = LEX_INTERPCONCAT;
1090 PL_lex_repl = Nullsv;
1096 PL_bufend = SvPVX(PL_linestr);
1097 PL_bufend += SvCUR(PL_linestr);
1098 PL_expect = XOPERATOR;
1099 PL_sublex_info.sub_inwhat = 0;
1107 Extracts a pattern, double-quoted string, or transliteration. This
1110 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1111 processing a pattern (PL_lex_inpat is true), a transliteration
1112 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1114 Returns a pointer to the character scanned up to. Iff this is
1115 advanced from the start pointer supplied (ie if anything was
1116 successfully parsed), will leave an OP for the substring scanned
1117 in yylval. Caller must intuit reason for not parsing further
1118 by looking at the next characters herself.
1122 double-quoted style: \r and \n
1123 regexp special ones: \D \s
1125 backrefs: \1 (deprecated in substitution replacements)
1126 case and quoting: \U \Q \E
1127 stops on @ and $, but not for $ as tail anchor
1129 In transliterations:
1130 characters are VERY literal, except for - not at the start or end
1131 of the string, which indicates a range. scan_const expands the
1132 range to the full set of intermediate characters.
1134 In double-quoted strings:
1136 double-quoted style: \r and \n
1138 backrefs: \1 (deprecated)
1139 case and quoting: \U \Q \E
1142 scan_const does *not* construct ops to handle interpolated strings.
1143 It stops processing as soon as it finds an embedded $ or @ variable
1144 and leaves it to the caller to work out what's going on.
1146 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1148 $ in pattern could be $foo or could be tail anchor. Assumption:
1149 it's a tail anchor if $ is the last thing in the string, or if it's
1150 followed by one of ")| \n\t"
1152 \1 (backreferences) are turned into $1
1154 The structure of the code is
1155 while (there's a character to process) {
1156 handle transliteration ranges
1157 skip regexp comments
1158 skip # initiated comments in //x patterns
1159 check for embedded @foo
1160 check for embedded scalars
1162 leave intact backslashes from leave (below)
1163 deprecate \1 in strings and sub replacements
1164 handle string-changing backslashes \l \U \Q \E, etc.
1165 switch (what was escaped) {
1166 handle - in a transliteration (becomes a literal -)
1167 handle \132 octal characters
1168 handle 0x15 hex characters
1169 handle \cV (control V)
1170 handle printf backslashes (\f, \r, \n, etc)
1172 } (end if backslash)
1173 } (end while character to read)
1178 S_scan_const(pTHX_ char *start)
1180 register char *send = PL_bufend; /* end of the constant */
1181 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1182 register char *s = start; /* start of the constant */
1183 register char *d = SvPVX(sv); /* destination for copies */
1184 bool dorange = FALSE; /* are we in a translit range? */
1185 bool didrange = FALSE; /* did we just finish a range? */
1186 bool has_utf = FALSE; /* embedded \x{} */
1190 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1191 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1193 I32 thisutf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1194 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1195 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
1197 const char *leaveit = /* set of acceptably-backslashed characters */
1199 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1202 while (s < send || dorange) {
1203 /* get transliterations out of the way (they're most literal) */
1204 if (PL_lex_inwhat == OP_TRANS) {
1205 /* expand a range A-Z to the full set of characters. AIE! */
1207 I32 i; /* current expanded character */
1208 I32 min; /* first character in range */
1209 I32 max; /* last character in range */
1211 i = d - SvPVX(sv); /* remember current offset */
1212 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1213 d = SvPVX(sv) + i; /* refresh d after realloc */
1214 d -= 2; /* eat the first char and the - */
1216 min = (U8)*d; /* first char in range */
1217 max = (U8)d[1]; /* last char in range */
1221 "Invalid [] range \"%c-%c\" in transliteration operator",
1226 if ((isLOWER(min) && isLOWER(max)) ||
1227 (isUPPER(min) && isUPPER(max))) {
1229 for (i = min; i <= max; i++)
1233 for (i = min; i <= max; i++)
1240 for (i = min; i <= max; i++)
1243 /* mark the range as done, and continue */
1249 /* range begins (ignore - as first or last char) */
1250 else if (*s == '-' && s+1 < send && s != start) {
1252 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1255 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
1267 /* if we get here, we're not doing a transliteration */
1269 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1270 except for the last char, which will be done separately. */
1271 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1273 while (s < send && *s != ')')
1276 else if (s[2] == '{' /* This should match regcomp.c */
1277 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1280 char *regparse = s + (s[2] == '{' ? 3 : 4);
1283 while (count && (c = *regparse)) {
1284 if (c == '\\' && regparse[1])
1292 if (*regparse != ')') {
1293 regparse--; /* Leave one char for continuation. */
1294 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1296 while (s < regparse)
1301 /* likewise skip #-initiated comments in //x patterns */
1302 else if (*s == '#' && PL_lex_inpat &&
1303 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1304 while (s+1 < send && *s != '\n')
1308 /* check for embedded arrays (@foo, @:foo, @'foo, @{foo}, @$foo) */
1309 else if (*s == '@' && s[1]
1310 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$", s[1])))
1313 /* check for embedded scalars. only stop if we're sure it's a
1316 else if (*s == '$') {
1317 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1319 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1320 break; /* in regexp, $ might be tail anchor */
1323 /* (now in tr/// code again) */
1325 if (*s & 0x80 && thisutf) {
1326 (void)utf8_to_uv((U8*)s, &len);
1328 /* illegal UTF8, make it valid */
1329 char *old_pvx = SvPVX(sv);
1330 /* need space for one extra char (NOTE: SvCUR() not set here) */
1331 d = SvGROW(sv, SvLEN(sv) + 1) + (d - old_pvx);
1332 d = (char*)uv_to_utf8((U8*)d, (U8)*s++);
1343 if (*s == '\\' && s+1 < send) {
1346 /* some backslashes we leave behind */
1347 if (*leaveit && *s && strchr(leaveit, *s)) {
1353 /* deprecate \1 in strings and substitution replacements */
1354 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1355 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1357 dTHR; /* only for ckWARN */
1358 if (ckWARN(WARN_SYNTAX))
1359 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1364 /* string-change backslash escapes */
1365 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1370 /* if we get here, it's either a quoted -, or a digit */
1373 /* quoted - in transliterations */
1375 if (PL_lex_inwhat == OP_TRANS) {
1383 if (ckWARN(WARN_MISC) && isALNUM(*s))
1384 Perl_warner(aTHX_ WARN_MISC,
1385 "Unrecognized escape \\%c passed through",
1387 /* default action is to copy the quoted character */
1392 /* \132 indicates an octal constant */
1393 case '0': case '1': case '2': case '3':
1394 case '4': case '5': case '6': case '7':
1395 len = 0; /* disallow underscores */
1396 uv = (UV)scan_oct(s, 3, &len);
1398 goto NUM_ESCAPE_INSERT;
1400 /* \x24 indicates a hex constant */
1404 char* e = strchr(s, '}');
1406 yyerror("Missing right brace on \\x{}");
1409 len = 1; /* allow underscores */
1410 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1414 len = 0; /* disallow underscores */
1415 uv = (UV)scan_hex(s, 2, &len);
1420 /* Insert oct or hex escaped character.
1421 * There will always enough room in sv since such escapes will
1422 * be longer than any utf8 sequence they can end up as
1425 if (!thisutf && !has_utf && uv > 255) {
1426 /* might need to recode whatever we have accumulated so far
1427 * if it contains any hibit chars
1431 for (c = SvPVX(sv); c < d; c++) {
1436 char *old_pvx = SvPVX(sv);
1438 d = SvGROW(sv, SvCUR(sv) + hicount + 1) + (d - old_pvx);
1447 uv_to_utf8((U8*)dst, (U8)*src--);
1457 if (thisutf || uv > 255) {
1458 d = (char*)uv_to_utf8((U8*)d, uv);
1470 /* \N{latin small letter a} is a named character */
1474 char* e = strchr(s, '}');
1480 yyerror("Missing right brace on \\N{}");
1484 res = newSVpvn(s + 1, e - s - 1);
1485 res = new_constant( Nullch, 0, "charnames",
1486 res, Nullsv, "\\N{...}" );
1487 str = SvPV(res,len);
1488 if (!has_utf && SvUTF8(res)) {
1489 char *ostart = SvPVX(sv);
1490 SvCUR_set(sv, d - ostart);
1492 sv_utf8_upgrade(sv);
1493 d = SvPVX(sv) + SvCUR(sv);
1496 if (len > e - s + 4) {
1497 char *odest = SvPVX(sv);
1499 SvGROW(sv, (SvCUR(sv) + len - (e - s + 4)));
1500 d = SvPVX(sv) + (d - odest);
1502 Copy(str, d, len, char);
1509 yyerror("Missing braces on \\N{}");
1512 /* \c is a control character */
1527 /* printf-style backslashes, formfeeds, newlines, etc */
1545 *d++ = '\047'; /* CP 1047 */
1548 *d++ = '\057'; /* CP 1047 */
1562 } /* end if (backslash) */
1565 } /* while loop to process each character */
1567 /* terminate the string and set up the sv */
1569 SvCUR_set(sv, d - SvPVX(sv));
1574 /* shrink the sv if we allocated more than we used */
1575 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1576 SvLEN_set(sv, SvCUR(sv) + 1);
1577 Renew(SvPVX(sv), SvLEN(sv), char);
1580 /* return the substring (via yylval) only if we parsed anything */
1581 if (s > PL_bufptr) {
1582 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1583 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1585 ( PL_lex_inwhat == OP_TRANS
1587 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1590 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1597 * Returns TRUE if there's more to the expression (e.g., a subscript),
1600 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1602 * ->[ and ->{ return TRUE
1603 * { and [ outside a pattern are always subscripts, so return TRUE
1604 * if we're outside a pattern and it's not { or [, then return FALSE
1605 * if we're in a pattern and the first char is a {
1606 * {4,5} (any digits around the comma) returns FALSE
1607 * if we're in a pattern and the first char is a [
1609 * [SOMETHING] has a funky algorithm to decide whether it's a
1610 * character class or not. It has to deal with things like
1611 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1612 * anything else returns TRUE
1615 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1618 S_intuit_more(pTHX_ register char *s)
1620 if (PL_lex_brackets)
1622 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1624 if (*s != '{' && *s != '[')
1629 /* In a pattern, so maybe we have {n,m}. */
1646 /* On the other hand, maybe we have a character class */
1649 if (*s == ']' || *s == '^')
1652 /* this is terrifying, and it works */
1653 int weight = 2; /* let's weigh the evidence */
1655 unsigned char un_char = 255, last_un_char;
1656 char *send = strchr(s,']');
1657 char tmpbuf[sizeof PL_tokenbuf * 4];
1659 if (!send) /* has to be an expression */
1662 Zero(seen,256,char);
1665 else if (isDIGIT(*s)) {
1667 if (isDIGIT(s[1]) && s[2] == ']')
1673 for (; s < send; s++) {
1674 last_un_char = un_char;
1675 un_char = (unsigned char)*s;
1680 weight -= seen[un_char] * 10;
1681 if (isALNUM_lazy_if(s+1,UTF)) {
1682 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1683 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1688 else if (*s == '$' && s[1] &&
1689 strchr("[#!%*<>()-=",s[1])) {
1690 if (/*{*/ strchr("])} =",s[2]))
1699 if (strchr("wds]",s[1]))
1701 else if (seen['\''] || seen['"'])
1703 else if (strchr("rnftbxcav",s[1]))
1705 else if (isDIGIT(s[1])) {
1707 while (s[1] && isDIGIT(s[1]))
1717 if (strchr("aA01! ",last_un_char))
1719 if (strchr("zZ79~",s[1]))
1721 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1722 weight -= 5; /* cope with negative subscript */
1725 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1726 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1731 if (keyword(tmpbuf, d - tmpbuf))
1734 if (un_char == last_un_char + 1)
1736 weight -= seen[un_char];
1741 if (weight >= 0) /* probably a character class */
1751 * Does all the checking to disambiguate
1753 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1754 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1756 * First argument is the stuff after the first token, e.g. "bar".
1758 * Not a method if bar is a filehandle.
1759 * Not a method if foo is a subroutine prototyped to take a filehandle.
1760 * Not a method if it's really "Foo $bar"
1761 * Method if it's "foo $bar"
1762 * Not a method if it's really "print foo $bar"
1763 * Method if it's really "foo package::" (interpreted as package->foo)
1764 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1765 * Not a method if bar is a filehandle or package, but is quoted with
1770 S_intuit_method(pTHX_ char *start, GV *gv)
1772 char *s = start + (*start == '$');
1773 char tmpbuf[sizeof PL_tokenbuf];
1781 if ((cv = GvCVu(gv))) {
1782 char *proto = SvPVX(cv);
1792 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1793 /* start is the beginning of the possible filehandle/object,
1794 * and s is the end of it
1795 * tmpbuf is a copy of it
1798 if (*start == '$') {
1799 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1804 return *s == '(' ? FUNCMETH : METHOD;
1806 if (!keyword(tmpbuf, len)) {
1807 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1812 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1813 if (indirgv && GvCVu(indirgv))
1815 /* filehandle or package name makes it a method */
1816 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1818 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1819 return 0; /* no assumptions -- "=>" quotes bearword */
1821 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1822 newSVpvn(tmpbuf,len));
1823 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1827 return *s == '(' ? FUNCMETH : METHOD;
1835 * Return a string of Perl code to load the debugger. If PERL5DB
1836 * is set, it will return the contents of that, otherwise a
1837 * compile-time require of perl5db.pl.
1844 char *pdb = PerlEnv_getenv("PERL5DB");
1848 SETERRNO(0,SS$_NORMAL);
1849 return "BEGIN { require 'perl5db.pl' }";
1855 /* Encoded script support. filter_add() effectively inserts a
1856 * 'pre-processing' function into the current source input stream.
1857 * Note that the filter function only applies to the current source file
1858 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1860 * The datasv parameter (which may be NULL) can be used to pass
1861 * private data to this instance of the filter. The filter function
1862 * can recover the SV using the FILTER_DATA macro and use it to
1863 * store private buffers and state information.
1865 * The supplied datasv parameter is upgraded to a PVIO type
1866 * and the IoDIRP/IoANY field is used to store the function pointer,
1867 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1868 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1869 * private use must be set using malloc'd pointers.
1873 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1878 if (!PL_rsfp_filters)
1879 PL_rsfp_filters = newAV();
1881 datasv = NEWSV(255,0);
1882 if (!SvUPGRADE(datasv, SVt_PVIO))
1883 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1884 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1885 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1886 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1887 funcp, SvPV_nolen(datasv)));
1888 av_unshift(PL_rsfp_filters, 1);
1889 av_store(PL_rsfp_filters, 0, datasv) ;
1894 /* Delete most recently added instance of this filter function. */
1896 Perl_filter_del(pTHX_ filter_t funcp)
1899 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1900 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1902 /* if filter is on top of stack (usual case) just pop it off */
1903 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1904 if (IoANY(datasv) == (void *)funcp) {
1905 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1906 IoANY(datasv) = (void *)NULL;
1907 sv_free(av_pop(PL_rsfp_filters));
1911 /* we need to search for the correct entry and clear it */
1912 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1916 /* Invoke the n'th filter function for the current rsfp. */
1918 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1921 /* 0 = read one text line */
1926 if (!PL_rsfp_filters)
1928 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
1929 /* Provide a default input filter to make life easy. */
1930 /* Note that we append to the line. This is handy. */
1931 DEBUG_P(PerlIO_printf(Perl_debug_log,
1932 "filter_read %d: from rsfp\n", idx));
1936 int old_len = SvCUR(buf_sv) ;
1938 /* ensure buf_sv is large enough */
1939 SvGROW(buf_sv, old_len + maxlen) ;
1940 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
1941 if (PerlIO_error(PL_rsfp))
1942 return -1; /* error */
1944 return 0 ; /* end of file */
1946 SvCUR_set(buf_sv, old_len + len) ;
1949 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
1950 if (PerlIO_error(PL_rsfp))
1951 return -1; /* error */
1953 return 0 ; /* end of file */
1956 return SvCUR(buf_sv);
1958 /* Skip this filter slot if filter has been deleted */
1959 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
1960 DEBUG_P(PerlIO_printf(Perl_debug_log,
1961 "filter_read %d: skipped (filter deleted)\n",
1963 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
1965 /* Get function pointer hidden within datasv */
1966 funcp = (filter_t)IoANY(datasv);
1967 DEBUG_P(PerlIO_printf(Perl_debug_log,
1968 "filter_read %d: via function %p (%s)\n",
1969 idx, funcp, SvPV_nolen(datasv)));
1970 /* Call function. The function is expected to */
1971 /* call "FILTER_READ(idx+1, buf_sv)" first. */
1972 /* Return: <0:error, =0:eof, >0:not eof */
1973 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
1977 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
1979 #ifdef PERL_CR_FILTER
1980 if (!PL_rsfp_filters) {
1981 filter_add(S_cr_textfilter,NULL);
1984 if (PL_rsfp_filters) {
1987 SvCUR_set(sv, 0); /* start with empty line */
1988 if (FILTER_READ(0, sv, 0) > 0)
1989 return ( SvPVX(sv) ) ;
1994 return (sv_gets(sv, fp, append));
1998 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2002 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2006 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2007 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2009 return GvHV(gv); /* Foo:: */
2012 /* use constant CLASS => 'MyClass' */
2013 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2015 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2016 pkgname = SvPV_nolen(sv);
2020 return gv_stashpv(pkgname, FALSE);
2024 static char* exp_name[] =
2025 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2026 "ATTRTERM", "TERMBLOCK"
2033 Works out what to call the token just pulled out of the input
2034 stream. The yacc parser takes care of taking the ops we return and
2035 stitching them into a tree.
2041 if read an identifier
2042 if we're in a my declaration
2043 croak if they tried to say my($foo::bar)
2044 build the ops for a my() declaration
2045 if it's an access to a my() variable
2046 are we in a sort block?
2047 croak if my($a); $a <=> $b
2048 build ops for access to a my() variable
2049 if in a dq string, and they've said @foo and we can't find @foo
2051 build ops for a bareword
2052 if we already built the token before, use it.
2056 #pragma segment Perl_yylex
2059 #ifdef USE_PURE_BISON
2060 Perl_yylex(pTHX_ YYSTYPE *lvalp, int *lcharp)
2073 #ifdef USE_PURE_BISON
2074 yylval_pointer = lvalp;
2075 yychar_pointer = lcharp;
2078 /* check if there's an identifier for us to look at */
2079 if (PL_pending_ident) {
2080 /* pit holds the identifier we read and pending_ident is reset */
2081 char pit = PL_pending_ident;
2082 PL_pending_ident = 0;
2084 /* if we're in a my(), we can't allow dynamics here.
2085 $foo'bar has already been turned into $foo::bar, so
2086 just check for colons.
2088 if it's a legal name, the OP is a PADANY.
2091 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2092 if (strchr(PL_tokenbuf,':'))
2093 yyerror(Perl_form(aTHX_ "No package name allowed for "
2094 "variable %s in \"our\"",
2096 tmp = pad_allocmy(PL_tokenbuf);
2099 if (strchr(PL_tokenbuf,':'))
2100 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2102 yylval.opval = newOP(OP_PADANY, 0);
2103 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2109 build the ops for accesses to a my() variable.
2111 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2112 then used in a comparison. This catches most, but not
2113 all cases. For instance, it catches
2114 sort { my($a); $a <=> $b }
2116 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2117 (although why you'd do that is anyone's guess).
2120 if (!strchr(PL_tokenbuf,':')) {
2122 /* Check for single character per-thread SVs */
2123 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2124 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2125 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2127 yylval.opval = newOP(OP_THREADSV, 0);
2128 yylval.opval->op_targ = tmp;
2131 #endif /* USE_THREADS */
2132 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2133 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2134 /* might be an "our" variable" */
2135 if (SvFLAGS(namesv) & SVpad_OUR) {
2136 /* build ops for a bareword */
2137 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2138 sv_catpvn(sym, "::", 2);
2139 sv_catpv(sym, PL_tokenbuf+1);
2140 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2141 yylval.opval->op_private = OPpCONST_ENTERED;
2142 gv_fetchpv(SvPVX(sym),
2144 ? (GV_ADDMULTI | GV_ADDINEVAL)
2147 ((PL_tokenbuf[0] == '$') ? SVt_PV
2148 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2153 /* if it's a sort block and they're naming $a or $b */
2154 if (PL_last_lop_op == OP_SORT &&
2155 PL_tokenbuf[0] == '$' &&
2156 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2159 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2160 d < PL_bufend && *d != '\n';
2163 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2164 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2170 yylval.opval = newOP(OP_PADANY, 0);
2171 yylval.opval->op_targ = tmp;
2177 Whine if they've said @foo in a doublequoted string,
2178 and @foo isn't a variable we can find in the symbol
2181 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2182 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2183 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2184 && ckWARN(WARN_AMBIGUOUS))
2186 /* Downgraded from fatal to warning 20000522 mjd */
2187 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2188 "Possible unintended interpolation of %s in string",
2193 /* build ops for a bareword */
2194 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2195 yylval.opval->op_private = OPpCONST_ENTERED;
2196 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2197 ((PL_tokenbuf[0] == '$') ? SVt_PV
2198 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2203 /* no identifier pending identification */
2205 switch (PL_lex_state) {
2207 case LEX_NORMAL: /* Some compilers will produce faster */
2208 case LEX_INTERPNORMAL: /* code if we comment these out. */
2212 /* when we've already built the next token, just pull it out of the queue */
2215 yylval = PL_nextval[PL_nexttoke];
2217 PL_lex_state = PL_lex_defer;
2218 PL_expect = PL_lex_expect;
2219 PL_lex_defer = LEX_NORMAL;
2221 return(PL_nexttype[PL_nexttoke]);
2223 /* interpolated case modifiers like \L \U, including \Q and \E.
2224 when we get here, PL_bufptr is at the \
2226 case LEX_INTERPCASEMOD:
2228 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2229 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2231 /* handle \E or end of string */
2232 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2236 if (PL_lex_casemods) {
2237 oldmod = PL_lex_casestack[--PL_lex_casemods];
2238 PL_lex_casestack[PL_lex_casemods] = '\0';
2240 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2242 PL_lex_state = LEX_INTERPCONCAT;
2246 if (PL_bufptr != PL_bufend)
2248 PL_lex_state = LEX_INTERPCONCAT;
2253 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2254 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2255 if (strchr("LU", *s) &&
2256 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2258 PL_lex_casestack[--PL_lex_casemods] = '\0';
2261 if (PL_lex_casemods > 10) {
2262 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2263 if (newlb != PL_lex_casestack) {
2265 PL_lex_casestack = newlb;
2268 PL_lex_casestack[PL_lex_casemods++] = *s;
2269 PL_lex_casestack[PL_lex_casemods] = '\0';
2270 PL_lex_state = LEX_INTERPCONCAT;
2271 PL_nextval[PL_nexttoke].ival = 0;
2274 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2276 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2278 PL_nextval[PL_nexttoke].ival = OP_LC;
2280 PL_nextval[PL_nexttoke].ival = OP_UC;
2282 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2284 Perl_croak(aTHX_ "panic: yylex");
2287 if (PL_lex_starts) {
2296 case LEX_INTERPPUSH:
2297 return sublex_push();
2299 case LEX_INTERPSTART:
2300 if (PL_bufptr == PL_bufend)
2301 return sublex_done();
2303 PL_lex_dojoin = (*PL_bufptr == '@');
2304 PL_lex_state = LEX_INTERPNORMAL;
2305 if (PL_lex_dojoin) {
2306 PL_nextval[PL_nexttoke].ival = 0;
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_THREADS */
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");
2420 if (s++ < PL_bufend)
2421 goto retry; /* ignore stray nulls */
2424 if (!PL_in_eval && !PL_preambled) {
2425 PL_preambled = TRUE;
2426 sv_setpv(PL_linestr,incl_perldb());
2427 if (SvCUR(PL_linestr))
2428 sv_catpv(PL_linestr,";");
2430 while(AvFILLp(PL_preambleav) >= 0) {
2431 SV *tmpsv = av_shift(PL_preambleav);
2432 sv_catsv(PL_linestr, tmpsv);
2433 sv_catpv(PL_linestr, ";");
2436 sv_free((SV*)PL_preambleav);
2437 PL_preambleav = NULL;
2439 if (PL_minus_n || PL_minus_p) {
2440 sv_catpv(PL_linestr, "LINE: while (<>) {");
2442 sv_catpv(PL_linestr,"chomp;");
2444 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2446 GvIMPORTED_AV_on(gv);
2448 if (strchr("/'\"", *PL_splitstr)
2449 && strchr(PL_splitstr + 1, *PL_splitstr))
2450 Perl_sv_catpvf(aTHX_ PL_linestr, "@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, "@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,"@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 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2474 SV *sv = NEWSV(85,0);
2476 sv_upgrade(sv, SVt_PVMG);
2477 sv_setsv(sv,PL_linestr);
2478 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2484 bof = PL_rsfp && (PerlIO_tell(PL_rsfp) == 0); /* *Before* read! */
2485 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2488 if (PL_preprocess && !PL_in_eval)
2489 (void)PerlProc_pclose(PL_rsfp);
2490 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2491 PerlIO_clearerr(PL_rsfp);
2493 (void)PerlIO_close(PL_rsfp);
2495 PL_doextract = FALSE;
2497 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2498 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2499 sv_catpv(PL_linestr,";}");
2500 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2501 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2502 PL_minus_n = PL_minus_p = 0;
2505 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2506 sv_setpv(PL_linestr,"");
2507 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2510 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2511 PL_doextract = FALSE;
2513 /* Incest with pod. */
2514 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2515 sv_setpv(PL_linestr, "");
2516 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2517 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2518 PL_doextract = FALSE;
2523 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2524 /* Shouldn't this wsallow_bom() be earlier, e.g.
2525 * immediately after where bof is set? Currently you can't
2526 * have e.g. a UTF16 sharpbang line. --Mike Guy */
2527 s = swallow_bom((U8*)s);
2530 } while (PL_doextract);
2531 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2532 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2533 SV *sv = NEWSV(85,0);
2535 sv_upgrade(sv, SVt_PVMG);
2536 sv_setsv(sv,PL_linestr);
2537 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2539 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2540 if (CopLINE(PL_curcop) == 1) {
2541 while (s < PL_bufend && isSPACE(*s))
2543 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2547 if (*s == '#' && *(s+1) == '!')
2549 #ifdef ALTERNATE_SHEBANG
2551 static char as[] = ALTERNATE_SHEBANG;
2552 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2553 d = s + (sizeof(as) - 1);
2555 #endif /* ALTERNATE_SHEBANG */
2564 while (*d && !isSPACE(*d))
2568 #ifdef ARG_ZERO_IS_SCRIPT
2569 if (ipathend > ipath) {
2571 * HP-UX (at least) sets argv[0] to the script name,
2572 * which makes $^X incorrect. And Digital UNIX and Linux,
2573 * at least, set argv[0] to the basename of the Perl
2574 * interpreter. So, having found "#!", we'll set it right.
2576 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2577 assert(SvPOK(x) || SvGMAGICAL(x));
2578 if (sv_eq(x, CopFILESV(PL_curcop))) {
2579 sv_setpvn(x, ipath, ipathend - ipath);
2582 TAINT_NOT; /* $^X is always tainted, but that's OK */
2584 #endif /* ARG_ZERO_IS_SCRIPT */
2589 d = instr(s,"perl -");
2591 d = instr(s,"perl");
2593 /* avoid getting into infinite loops when shebang
2594 * line contains "Perl" rather than "perl" */
2596 for (d = ipathend-4; d >= ipath; --d) {
2597 if ((*d == 'p' || *d == 'P')
2598 && !ibcmp(d, "perl", 4))
2608 #ifdef ALTERNATE_SHEBANG
2610 * If the ALTERNATE_SHEBANG on this system starts with a
2611 * character that can be part of a Perl expression, then if
2612 * we see it but not "perl", we're probably looking at the
2613 * start of Perl code, not a request to hand off to some
2614 * other interpreter. Similarly, if "perl" is there, but
2615 * not in the first 'word' of the line, we assume the line
2616 * contains the start of the Perl program.
2618 if (d && *s != '#') {
2620 while (*c && !strchr("; \t\r\n\f\v#", *c))
2623 d = Nullch; /* "perl" not in first word; ignore */
2625 *s = '#'; /* Don't try to parse shebang line */
2627 #endif /* ALTERNATE_SHEBANG */
2628 #ifndef MACOS_TRADITIONAL
2633 !instr(s,"indir") &&
2634 instr(PL_origargv[0],"perl"))
2640 while (s < PL_bufend && isSPACE(*s))
2642 if (s < PL_bufend) {
2643 Newz(899,newargv,PL_origargc+3,char*);
2645 while (s < PL_bufend && !isSPACE(*s))
2648 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2651 newargv = PL_origargv;
2653 PerlProc_execv(ipath, newargv);
2654 Perl_croak(aTHX_ "Can't exec %s", ipath);
2658 U32 oldpdb = PL_perldb;
2659 bool oldn = PL_minus_n;
2660 bool oldp = PL_minus_p;
2662 while (*d && !isSPACE(*d)) d++;
2663 while (SPACE_OR_TAB(*d)) d++;
2667 if (*d == 'M' || *d == 'm') {
2669 while (*d && !isSPACE(*d)) d++;
2670 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2673 d = moreswitches(d);
2675 if ((PERLDB_LINE && !oldpdb) ||
2676 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2677 /* if we have already added "LINE: while (<>) {",
2678 we must not do it again */
2680 sv_setpv(PL_linestr, "");
2681 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2682 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2683 PL_preambled = FALSE;
2685 (void)gv_fetchfile(PL_origfilename);
2692 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2694 PL_lex_state = LEX_FORMLINE;
2699 #ifdef PERL_STRICT_CR
2700 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2702 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2704 case ' ': case '\t': case '\f': case 013:
2705 #ifdef MACOS_TRADITIONAL
2712 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2713 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2714 /* handle eval qq[#line 1 "foo"\n ...] */
2715 CopLINE_dec(PL_curcop);
2719 while (s < d && *s != '\n')
2724 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2726 PL_lex_state = LEX_FORMLINE;
2736 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2741 while (s < PL_bufend && SPACE_OR_TAB(*s))
2744 if (strnEQ(s,"=>",2)) {
2745 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2746 OPERATOR('-'); /* unary minus */
2748 PL_last_uni = PL_oldbufptr;
2749 PL_last_lop_op = OP_FTEREAD; /* good enough */
2751 case 'r': FTST(OP_FTEREAD);
2752 case 'w': FTST(OP_FTEWRITE);
2753 case 'x': FTST(OP_FTEEXEC);
2754 case 'o': FTST(OP_FTEOWNED);
2755 case 'R': FTST(OP_FTRREAD);
2756 case 'W': FTST(OP_FTRWRITE);
2757 case 'X': FTST(OP_FTREXEC);
2758 case 'O': FTST(OP_FTROWNED);
2759 case 'e': FTST(OP_FTIS);
2760 case 'z': FTST(OP_FTZERO);
2761 case 's': FTST(OP_FTSIZE);
2762 case 'f': FTST(OP_FTFILE);
2763 case 'd': FTST(OP_FTDIR);
2764 case 'l': FTST(OP_FTLINK);
2765 case 'p': FTST(OP_FTPIPE);
2766 case 'S': FTST(OP_FTSOCK);
2767 case 'u': FTST(OP_FTSUID);
2768 case 'g': FTST(OP_FTSGID);
2769 case 'k': FTST(OP_FTSVTX);
2770 case 'b': FTST(OP_FTBLK);
2771 case 'c': FTST(OP_FTCHR);
2772 case 't': FTST(OP_FTTTY);
2773 case 'T': FTST(OP_FTTEXT);
2774 case 'B': FTST(OP_FTBINARY);
2775 case 'M': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTMTIME);
2776 case 'A': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTATIME);
2777 case 'C': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTCTIME);
2779 Perl_croak(aTHX_ "Unrecognized file test: -%c", (int)tmp);
2786 if (PL_expect == XOPERATOR)
2791 else if (*s == '>') {
2794 if (isIDFIRST_lazy_if(s,UTF)) {
2795 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2803 if (PL_expect == XOPERATOR)
2806 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2808 OPERATOR('-'); /* unary minus */
2815 if (PL_expect == XOPERATOR)
2820 if (PL_expect == XOPERATOR)
2823 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2829 if (PL_expect != XOPERATOR) {
2830 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2831 PL_expect = XOPERATOR;
2832 force_ident(PL_tokenbuf, '*');
2845 if (PL_expect == XOPERATOR) {
2849 PL_tokenbuf[0] = '%';
2850 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2851 if (!PL_tokenbuf[1]) {
2853 yyerror("Final % should be \\% or %name");
2856 PL_pending_ident = '%';
2875 switch (PL_expect) {
2878 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2880 PL_bufptr = s; /* update in case we back off */
2886 PL_expect = XTERMBLOCK;
2890 while (isIDFIRST_lazy_if(s,UTF)) {
2891 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2892 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2893 if (tmp < 0) tmp = -tmp;
2908 d = scan_str(d,TRUE,TRUE);
2911 SvREFCNT_dec(PL_lex_stuff);
2912 PL_lex_stuff = Nullsv;
2914 /* MUST advance bufptr here to avoid bogus
2915 "at end of line" context messages from yyerror().
2917 PL_bufptr = s + len;
2918 yyerror("Unterminated attribute parameter in attribute list");
2921 return 0; /* EOF indicator */
2925 SV *sv = newSVpvn(s, len);
2926 sv_catsv(sv, PL_lex_stuff);
2927 attrs = append_elem(OP_LIST, attrs,
2928 newSVOP(OP_CONST, 0, sv));
2929 SvREFCNT_dec(PL_lex_stuff);
2930 PL_lex_stuff = Nullsv;
2933 attrs = append_elem(OP_LIST, attrs,
2934 newSVOP(OP_CONST, 0,
2938 if (*s == ':' && s[1] != ':')
2941 break; /* require real whitespace or :'s */
2943 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
2944 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
2945 char q = ((*s == '\'') ? '"' : '\'');
2946 /* If here for an expression, and parsed no attrs, back off. */
2947 if (tmp == '=' && !attrs) {
2951 /* MUST advance bufptr here to avoid bogus "at end of line"
2952 context messages from yyerror().
2956 yyerror("Unterminated attribute list");
2958 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
2966 PL_nextval[PL_nexttoke].opval = attrs;
2974 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
2975 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
2991 if (PL_lex_brackets <= 0)
2992 yyerror("Unmatched right square bracket");
2995 if (PL_lex_state == LEX_INTERPNORMAL) {
2996 if (PL_lex_brackets == 0) {
2997 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
2998 PL_lex_state = LEX_INTERPEND;
3005 if (PL_lex_brackets > 100) {
3006 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3007 if (newlb != PL_lex_brackstack) {
3009 PL_lex_brackstack = newlb;
3012 switch (PL_expect) {
3014 if (PL_lex_formbrack) {
3018 if (PL_oldoldbufptr == PL_last_lop)
3019 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3021 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3022 OPERATOR(HASHBRACK);
3024 while (s < PL_bufend && SPACE_OR_TAB(*s))
3027 PL_tokenbuf[0] = '\0';
3028 if (d < PL_bufend && *d == '-') {
3029 PL_tokenbuf[0] = '-';
3031 while (d < PL_bufend && SPACE_OR_TAB(*d))
3034 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3035 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3037 while (d < PL_bufend && SPACE_OR_TAB(*d))
3040 char minus = (PL_tokenbuf[0] == '-');
3041 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3049 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3054 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3059 if (PL_oldoldbufptr == PL_last_lop)
3060 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3062 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3065 OPERATOR(HASHBRACK);
3066 /* This hack serves to disambiguate a pair of curlies
3067 * as being a block or an anon hash. Normally, expectation
3068 * determines that, but in cases where we're not in a
3069 * position to expect anything in particular (like inside
3070 * eval"") we have to resolve the ambiguity. This code
3071 * covers the case where the first term in the curlies is a
3072 * quoted string. Most other cases need to be explicitly
3073 * disambiguated by prepending a `+' before the opening
3074 * curly in order to force resolution as an anon hash.
3076 * XXX should probably propagate the outer expectation
3077 * into eval"" to rely less on this hack, but that could
3078 * potentially break current behavior of eval"".
3082 if (*s == '\'' || *s == '"' || *s == '`') {
3083 /* common case: get past first string, handling escapes */
3084 for (t++; t < PL_bufend && *t != *s;)
3085 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3089 else if (*s == 'q') {
3092 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3096 char open, close, term;
3099 while (t < PL_bufend && isSPACE(*t))
3103 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3107 for (t++; t < PL_bufend; t++) {
3108 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3110 else if (*t == open)
3114 for (t++; t < PL_bufend; t++) {
3115 if (*t == '\\' && t+1 < PL_bufend)
3117 else if (*t == close && --brackets <= 0)
3119 else if (*t == open)
3125 else if (isALNUM_lazy_if(t,UTF)) {
3127 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3130 while (t < PL_bufend && isSPACE(*t))
3132 /* if comma follows first term, call it an anon hash */
3133 /* XXX it could be a comma expression with loop modifiers */
3134 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3135 || (*t == '=' && t[1] == '>')))
3136 OPERATOR(HASHBRACK);
3137 if (PL_expect == XREF)
3140 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3146 yylval.ival = CopLINE(PL_curcop);
3147 if (isSPACE(*s) || *s == '#')
3148 PL_copline = NOLINE; /* invalidate current command line number */
3153 if (PL_lex_brackets <= 0)
3154 yyerror("Unmatched right curly bracket");
3156 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3157 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3158 PL_lex_formbrack = 0;
3159 if (PL_lex_state == LEX_INTERPNORMAL) {
3160 if (PL_lex_brackets == 0) {
3161 if (PL_expect & XFAKEBRACK) {
3162 PL_expect &= XENUMMASK;
3163 PL_lex_state = LEX_INTERPEND;
3165 return yylex(); /* ignore fake brackets */
3167 if (*s == '-' && s[1] == '>')
3168 PL_lex_state = LEX_INTERPENDMAYBE;
3169 else if (*s != '[' && *s != '{')
3170 PL_lex_state = LEX_INTERPEND;
3173 if (PL_expect & XFAKEBRACK) {
3174 PL_expect &= XENUMMASK;
3176 return yylex(); /* ignore fake brackets */
3186 if (PL_expect == XOPERATOR) {
3187 if (ckWARN(WARN_SEMICOLON)
3188 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3190 CopLINE_dec(PL_curcop);
3191 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3192 CopLINE_inc(PL_curcop);
3197 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3199 PL_expect = XOPERATOR;
3200 force_ident(PL_tokenbuf, '&');
3204 yylval.ival = (OPpENTERSUB_AMPER<<8);
3223 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3224 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3226 if (PL_expect == XSTATE && isALPHA(tmp) &&
3227 (s == PL_linestart+1 || s[-2] == '\n') )
3229 if (PL_in_eval && !PL_rsfp) {
3234 if (strnEQ(s,"=cut",4)) {
3248 PL_doextract = TRUE;
3251 if (PL_lex_brackets < PL_lex_formbrack) {
3253 #ifdef PERL_STRICT_CR
3254 for (t = s; SPACE_OR_TAB(*t); t++) ;
3256 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3258 if (*t == '\n' || *t == '#') {
3276 if (PL_expect != XOPERATOR) {
3277 if (s[1] != '<' && !strchr(s,'>'))
3280 s = scan_heredoc(s);
3282 s = scan_inputsymbol(s);
3283 TERM(sublex_start());
3288 SHop(OP_LEFT_SHIFT);
3302 SHop(OP_RIGHT_SHIFT);
3311 if (PL_expect == XOPERATOR) {
3312 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3315 return ','; /* grandfather non-comma-format format */
3319 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3320 PL_tokenbuf[0] = '@';
3321 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3322 sizeof PL_tokenbuf - 1, FALSE);
3323 if (PL_expect == XOPERATOR)
3324 no_op("Array length", s);
3325 if (!PL_tokenbuf[1])
3327 PL_expect = XOPERATOR;
3328 PL_pending_ident = '#';
3332 PL_tokenbuf[0] = '$';
3333 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3334 sizeof PL_tokenbuf - 1, FALSE);
3335 if (PL_expect == XOPERATOR)
3337 if (!PL_tokenbuf[1]) {
3339 yyerror("Final $ should be \\$ or $name");
3343 /* This kludge not intended to be bulletproof. */
3344 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3345 yylval.opval = newSVOP(OP_CONST, 0,
3346 newSViv(PL_compiling.cop_arybase));
3347 yylval.opval->op_private = OPpCONST_ARYBASE;
3353 if (PL_lex_state == LEX_NORMAL)
3356 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3359 PL_tokenbuf[0] = '@';
3360 if (ckWARN(WARN_SYNTAX)) {
3362 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3365 PL_bufptr = skipspace(PL_bufptr);
3366 while (t < PL_bufend && *t != ']')
3368 Perl_warner(aTHX_ WARN_SYNTAX,
3369 "Multidimensional syntax %.*s not supported",
3370 (t - PL_bufptr) + 1, PL_bufptr);
3374 else if (*s == '{') {
3375 PL_tokenbuf[0] = '%';
3376 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3377 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3379 char tmpbuf[sizeof PL_tokenbuf];
3381 for (t++; isSPACE(*t); t++) ;
3382 if (isIDFIRST_lazy_if(t,UTF)) {
3383 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3384 for (; isSPACE(*t); t++) ;
3385 if (*t == ';' && get_cv(tmpbuf, FALSE))
3386 Perl_warner(aTHX_ WARN_SYNTAX,
3387 "You need to quote \"%s\"", tmpbuf);
3393 PL_expect = XOPERATOR;
3394 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3395 bool islop = (PL_last_lop == PL_oldoldbufptr);
3396 if (!islop || PL_last_lop_op == OP_GREPSTART)
3397 PL_expect = XOPERATOR;
3398 else if (strchr("$@\"'`q", *s))
3399 PL_expect = XTERM; /* e.g. print $fh "foo" */
3400 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3401 PL_expect = XTERM; /* e.g. print $fh &sub */
3402 else if (isIDFIRST_lazy_if(s,UTF)) {
3403 char tmpbuf[sizeof PL_tokenbuf];
3404 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3405 if ((tmp = keyword(tmpbuf, len))) {
3406 /* binary operators exclude handle interpretations */
3418 PL_expect = XTERM; /* e.g. print $fh length() */
3423 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3424 if (gv && GvCVu(gv))
3425 PL_expect = XTERM; /* e.g. print $fh subr() */
3428 else if (isDIGIT(*s))
3429 PL_expect = XTERM; /* e.g. print $fh 3 */
3430 else if (*s == '.' && isDIGIT(s[1]))
3431 PL_expect = XTERM; /* e.g. print $fh .3 */
3432 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3433 PL_expect = XTERM; /* e.g. print $fh -1 */
3434 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3435 PL_expect = XTERM; /* print $fh <<"EOF" */
3437 PL_pending_ident = '$';
3441 if (PL_expect == XOPERATOR)
3443 PL_tokenbuf[0] = '@';
3444 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3445 if (!PL_tokenbuf[1]) {
3447 yyerror("Final @ should be \\@ or @name");
3450 if (PL_lex_state == LEX_NORMAL)
3452 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3454 PL_tokenbuf[0] = '%';
3456 /* Warn about @ where they meant $. */
3457 if (ckWARN(WARN_SYNTAX)) {
3458 if (*s == '[' || *s == '{') {
3460 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3462 if (*t == '}' || *t == ']') {
3464 PL_bufptr = skipspace(PL_bufptr);
3465 Perl_warner(aTHX_ WARN_SYNTAX,
3466 "Scalar value %.*s better written as $%.*s",
3467 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3472 PL_pending_ident = '@';
3475 case '/': /* may either be division or pattern */
3476 case '?': /* may either be conditional or pattern */
3477 if (PL_expect != XOPERATOR) {
3478 /* Disable warning on "study /blah/" */
3479 if (PL_oldoldbufptr == PL_last_uni
3480 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3481 || memNE(PL_last_uni, "study", 5)
3482 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3484 s = scan_pat(s,OP_MATCH);
3485 TERM(sublex_start());
3493 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3494 #ifdef PERL_STRICT_CR
3497 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3499 && (s == PL_linestart || s[-1] == '\n') )
3501 PL_lex_formbrack = 0;
3505 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3511 yylval.ival = OPf_SPECIAL;
3517 if (PL_expect != XOPERATOR)
3522 case '0': case '1': case '2': case '3': case '4':
3523 case '5': case '6': case '7': case '8': case '9':
3525 if (PL_expect == XOPERATOR)
3530 s = scan_str(s,FALSE,FALSE);
3531 if (PL_expect == XOPERATOR) {
3532 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3535 return ','; /* grandfather non-comma-format format */
3541 missingterm((char*)0);
3542 yylval.ival = OP_CONST;
3543 TERM(sublex_start());
3546 s = scan_str(s,FALSE,FALSE);
3547 if (PL_expect == XOPERATOR) {
3548 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3551 return ','; /* grandfather non-comma-format format */
3557 missingterm((char*)0);
3558 yylval.ival = OP_CONST;
3559 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3560 if (*d == '$' || *d == '@' || *d == '\\' || *d & 0x80) {
3561 yylval.ival = OP_STRINGIFY;
3565 TERM(sublex_start());
3568 s = scan_str(s,FALSE,FALSE);
3569 if (PL_expect == XOPERATOR)
3570 no_op("Backticks",s);
3572 missingterm((char*)0);
3573 yylval.ival = OP_BACKTICK;
3575 TERM(sublex_start());
3579 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3580 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3582 if (PL_expect == XOPERATOR)
3583 no_op("Backslash",s);
3587 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3591 while (isDIGIT(*start) || *start == '_')
3593 if (*start == '.' && isDIGIT(start[1])) {
3597 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3598 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF)) {
3602 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3612 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3651 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3653 /* Some keywords can be followed by any delimiter, including ':' */
3654 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3655 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3656 (PL_tokenbuf[0] == 'q' &&
3657 strchr("qwxr", PL_tokenbuf[1])))));
3659 /* x::* is just a word, unless x is "CORE" */
3660 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3664 while (d < PL_bufend && isSPACE(*d))
3665 d++; /* no comments skipped here, or s### is misparsed */
3667 /* Is this a label? */
3668 if (!tmp && PL_expect == XSTATE
3669 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3671 yylval.pval = savepv(PL_tokenbuf);
3676 /* Check for keywords */
3677 tmp = keyword(PL_tokenbuf, len);
3679 /* Is this a word before a => operator? */
3680 if (*d == '=' && d[1] == '>') {
3682 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3683 yylval.opval->op_private = OPpCONST_BARE;
3687 if (tmp < 0) { /* second-class keyword? */
3688 GV *ogv = Nullgv; /* override (winner) */
3689 GV *hgv = Nullgv; /* hidden (loser) */
3690 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3692 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3695 if (GvIMPORTED_CV(gv))
3697 else if (! CvMETHOD(cv))
3701 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3702 (gv = *gvp) != (GV*)&PL_sv_undef &&
3703 GvCVu(gv) && GvIMPORTED_CV(gv))
3709 tmp = 0; /* overridden by import or by GLOBAL */
3712 && -tmp==KEY_lock /* XXX generalizable kludge */
3714 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3716 tmp = 0; /* any sub overrides "weak" keyword */
3718 else { /* no override */
3722 if (ckWARN(WARN_AMBIGUOUS) && hgv
3723 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3724 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3725 "Ambiguous call resolved as CORE::%s(), %s",
3726 GvENAME(hgv), "qualify as such or use &");
3733 default: /* not a keyword */
3736 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3738 /* Get the rest if it looks like a package qualifier */
3740 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3742 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3745 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3746 *s == '\'' ? "'" : "::");
3750 if (PL_expect == XOPERATOR) {
3751 if (PL_bufptr == PL_linestart) {
3752 CopLINE_dec(PL_curcop);
3753 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3754 CopLINE_inc(PL_curcop);
3757 no_op("Bareword",s);
3760 /* Look for a subroutine with this name in current package,
3761 unless name is "Foo::", in which case Foo is a bearword
3762 (and a package name). */
3765 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3767 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3768 Perl_warner(aTHX_ WARN_BAREWORD,
3769 "Bareword \"%s\" refers to nonexistent package",
3772 PL_tokenbuf[len] = '\0';
3779 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3782 /* if we saw a global override before, get the right name */
3785 sv = newSVpvn("CORE::GLOBAL::",14);
3786 sv_catpv(sv,PL_tokenbuf);
3789 sv = newSVpv(PL_tokenbuf,0);
3791 /* Presume this is going to be a bareword of some sort. */
3794 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3795 yylval.opval->op_private = OPpCONST_BARE;
3797 /* And if "Foo::", then that's what it certainly is. */
3802 /* See if it's the indirect object for a list operator. */
3804 if (PL_oldoldbufptr &&
3805 PL_oldoldbufptr < PL_bufptr &&
3806 (PL_oldoldbufptr == PL_last_lop
3807 || PL_oldoldbufptr == PL_last_uni) &&
3808 /* NO SKIPSPACE BEFORE HERE! */
3809 (PL_expect == XREF ||
3810 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3812 bool immediate_paren = *s == '(';
3814 /* (Now we can afford to cross potential line boundary.) */
3817 /* Two barewords in a row may indicate method call. */
3819 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3822 /* If not a declared subroutine, it's an indirect object. */
3823 /* (But it's an indir obj regardless for sort.) */
3825 if ((PL_last_lop_op == OP_SORT ||
3826 (!immediate_paren && (!gv || !GvCVu(gv)))) &&
3827 (PL_last_lop_op != OP_MAPSTART &&
3828 PL_last_lop_op != OP_GREPSTART))
3830 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3836 PL_expect = XOPERATOR;
3839 /* Is this a word before a => operator? */
3840 if (*s == '=' && s[1] == '>') {
3842 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3846 /* If followed by a paren, it's certainly a subroutine. */
3849 if (gv && GvCVu(gv)) {
3850 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3851 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3856 PL_nextval[PL_nexttoke].opval = yylval.opval;
3857 PL_expect = XOPERATOR;
3863 /* If followed by var or block, call it a method (unless sub) */
3865 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3866 PL_last_lop = PL_oldbufptr;
3867 PL_last_lop_op = OP_METHOD;
3871 /* If followed by a bareword, see if it looks like indir obj. */
3873 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3876 /* Not a method, so call it a subroutine (if defined) */
3878 if (gv && GvCVu(gv)) {
3880 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3881 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3882 "Ambiguous use of -%s resolved as -&%s()",
3883 PL_tokenbuf, PL_tokenbuf);
3884 /* Check for a constant sub */
3886 if ((sv = cv_const_sv(cv))) {
3888 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3889 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3890 yylval.opval->op_private = 0;
3894 /* Resolve to GV now. */
3895 op_free(yylval.opval);
3896 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3897 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3898 PL_last_lop = PL_oldbufptr;
3899 PL_last_lop_op = OP_ENTERSUB;
3900 /* Is there a prototype? */
3903 char *proto = SvPV((SV*)cv, len);
3906 if (strEQ(proto, "$"))
3908 if (*proto == '&' && *s == '{') {
3909 sv_setpv(PL_subname,"__ANON__");
3913 PL_nextval[PL_nexttoke].opval = yylval.opval;
3919 /* Call it a bare word */
3921 if (PL_hints & HINT_STRICT_SUBS)
3922 yylval.opval->op_private |= OPpCONST_STRICT;
3925 if (ckWARN(WARN_RESERVED)) {
3926 if (lastchar != '-') {
3927 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
3929 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
3936 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
3937 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3938 "Operator or semicolon missing before %c%s",
3939 lastchar, PL_tokenbuf);
3940 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3941 "Ambiguous use of %c resolved as operator %c",
3942 lastchar, lastchar);
3948 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3949 newSVpv(CopFILE(PL_curcop),0));
3953 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3954 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
3957 case KEY___PACKAGE__:
3958 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3960 ? newSVsv(PL_curstname)
3969 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
3970 char *pname = "main";
3971 if (PL_tokenbuf[2] == 'D')
3972 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
3973 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
3976 GvIOp(gv) = newIO();
3977 IoIFP(GvIOp(gv)) = PL_rsfp;
3978 #if defined(HAS_FCNTL) && defined(F_SETFD)
3980 int fd = PerlIO_fileno(PL_rsfp);
3981 fcntl(fd,F_SETFD,fd >= 3);
3984 /* Mark this internal pseudo-handle as clean */
3985 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
3987 IoTYPE(GvIOp(gv)) = '|';
3988 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
3989 IoTYPE(GvIOp(gv)) = '-';
3991 IoTYPE(GvIOp(gv)) = '<';
3992 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
3993 /* if the script was opened in binmode, we need to revert
3994 * it to text mode for compatibility; but only iff it has CRs
3995 * XXX this is a questionable hack at best. */
3996 if (PL_bufend-PL_bufptr > 2
3997 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4000 if (IoTYPE(GvIOp(gv)) == '<') {
4001 loc = PerlIO_tell(PL_rsfp);
4002 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4004 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4005 #if defined(__BORLANDC__)
4006 /* XXX see note in do_binmode() */
4007 ((FILE*)PL_rsfp)->flags |= _F_BIN;
4010 PerlIO_seek(PL_rsfp, loc, 0);
4025 if (PL_expect == XSTATE) {
4032 if (*s == ':' && s[1] == ':') {
4035 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4036 if (!(tmp = keyword(PL_tokenbuf, len)))
4037 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4051 LOP(OP_ACCEPT,XTERM);
4057 LOP(OP_ATAN2,XTERM);
4063 LOP(OP_BINMODE,XTERM);
4066 LOP(OP_BLESS,XTERM);
4075 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4092 if (!PL_cryptseen) {
4093 PL_cryptseen = TRUE;
4097 LOP(OP_CRYPT,XTERM);
4100 if (ckWARN(WARN_CHMOD)) {
4101 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4102 if (*d != '0' && isDIGIT(*d))
4103 Perl_warner(aTHX_ WARN_CHMOD,
4104 "chmod() mode argument is missing initial 0");
4106 LOP(OP_CHMOD,XTERM);
4109 LOP(OP_CHOWN,XTERM);
4112 LOP(OP_CONNECT,XTERM);
4128 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4132 PL_hints |= HINT_BLOCK_SCOPE;
4142 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4143 LOP(OP_DBMOPEN,XTERM);
4149 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4156 yylval.ival = CopLINE(PL_curcop);
4170 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4171 UNIBRACK(OP_ENTEREVAL);
4186 case KEY_endhostent:
4192 case KEY_endservent:
4195 case KEY_endprotoent:
4206 yylval.ival = CopLINE(PL_curcop);
4208 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4210 if ((PL_bufend - p) >= 3 &&
4211 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4213 else if ((PL_bufend - p) >= 4 &&
4214 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4217 if (isIDFIRST_lazy_if(p,UTF)) {
4218 p = scan_ident(p, PL_bufend,
4219 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4223 Perl_croak(aTHX_ "Missing $ on loop variable");
4228 LOP(OP_FORMLINE,XTERM);
4234 LOP(OP_FCNTL,XTERM);
4240 LOP(OP_FLOCK,XTERM);
4249 LOP(OP_GREPSTART, XREF);
4252 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4267 case KEY_getpriority:
4268 LOP(OP_GETPRIORITY,XTERM);
4270 case KEY_getprotobyname:
4273 case KEY_getprotobynumber:
4274 LOP(OP_GPBYNUMBER,XTERM);
4276 case KEY_getprotoent:
4288 case KEY_getpeername:
4289 UNI(OP_GETPEERNAME);
4291 case KEY_gethostbyname:
4294 case KEY_gethostbyaddr:
4295 LOP(OP_GHBYADDR,XTERM);
4297 case KEY_gethostent:
4300 case KEY_getnetbyname:
4303 case KEY_getnetbyaddr:
4304 LOP(OP_GNBYADDR,XTERM);
4309 case KEY_getservbyname:
4310 LOP(OP_GSBYNAME,XTERM);
4312 case KEY_getservbyport:
4313 LOP(OP_GSBYPORT,XTERM);
4315 case KEY_getservent:
4318 case KEY_getsockname:
4319 UNI(OP_GETSOCKNAME);
4321 case KEY_getsockopt:
4322 LOP(OP_GSOCKOPT,XTERM);
4344 yylval.ival = CopLINE(PL_curcop);
4348 LOP(OP_INDEX,XTERM);
4354 LOP(OP_IOCTL,XTERM);
4366 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4398 LOP(OP_LISTEN,XTERM);
4407 s = scan_pat(s,OP_MATCH);
4408 TERM(sublex_start());
4411 LOP(OP_MAPSTART, XREF);
4414 LOP(OP_MKDIR,XTERM);
4417 LOP(OP_MSGCTL,XTERM);
4420 LOP(OP_MSGGET,XTERM);
4423 LOP(OP_MSGRCV,XTERM);
4426 LOP(OP_MSGSND,XTERM);
4432 if (isIDFIRST_lazy_if(s,UTF)) {
4433 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4434 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4436 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4437 if (!PL_in_my_stash) {
4440 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4448 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4455 if (PL_expect != XSTATE)
4456 yyerror("\"no\" not allowed in expression");
4457 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4458 s = force_version(s);
4463 if (*s == '(' || (s = skipspace(s), *s == '('))
4470 if (isIDFIRST_lazy_if(s,UTF)) {
4472 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4474 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4475 Perl_warner(aTHX_ WARN_PRECEDENCE,
4476 "Precedence problem: open %.*s should be open(%.*s)",
4482 yylval.ival = OP_OR;
4492 LOP(OP_OPEN_DIR,XTERM);
4495 checkcomma(s,PL_tokenbuf,"filehandle");
4499 checkcomma(s,PL_tokenbuf,"filehandle");
4518 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4522 LOP(OP_PIPE_OP,XTERM);
4525 s = scan_str(s,FALSE,FALSE);
4527 missingterm((char*)0);
4528 yylval.ival = OP_CONST;
4529 TERM(sublex_start());
4535 s = scan_str(s,FALSE,FALSE);
4537 missingterm((char*)0);
4539 if (SvCUR(PL_lex_stuff)) {
4542 d = SvPV_force(PL_lex_stuff, len);
4544 for (; isSPACE(*d) && len; --len, ++d) ;
4547 if (!warned && ckWARN(WARN_QW)) {
4548 for (; !isSPACE(*d) && len; --len, ++d) {
4550 Perl_warner(aTHX_ WARN_QW,
4551 "Possible attempt to separate words with commas");
4554 else if (*d == '#') {
4555 Perl_warner(aTHX_ WARN_QW,
4556 "Possible attempt to put comments in qw() list");
4562 for (; !isSPACE(*d) && len; --len, ++d) ;
4564 words = append_elem(OP_LIST, words,
4565 newSVOP(OP_CONST, 0, tokeq(newSVpvn(b, d-b))));
4569 PL_nextval[PL_nexttoke].opval = words;
4574 SvREFCNT_dec(PL_lex_stuff);
4575 PL_lex_stuff = Nullsv;
4580 s = scan_str(s,FALSE,FALSE);
4582 missingterm((char*)0);
4583 yylval.ival = OP_STRINGIFY;
4584 if (SvIVX(PL_lex_stuff) == '\'')
4585 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4586 TERM(sublex_start());
4589 s = scan_pat(s,OP_QR);
4590 TERM(sublex_start());
4593 s = scan_str(s,FALSE,FALSE);
4595 missingterm((char*)0);
4596 yylval.ival = OP_BACKTICK;
4598 TERM(sublex_start());
4605 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4606 s = force_version(s);
4609 *PL_tokenbuf = '\0';
4610 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4611 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4612 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4614 yyerror("<> should be quotes");
4622 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4626 LOP(OP_RENAME,XTERM);
4635 LOP(OP_RINDEX,XTERM);
4658 LOP(OP_REVERSE,XTERM);
4669 TERM(sublex_start());
4671 TOKEN(1); /* force error */
4680 LOP(OP_SELECT,XTERM);
4686 LOP(OP_SEMCTL,XTERM);
4689 LOP(OP_SEMGET,XTERM);
4692 LOP(OP_SEMOP,XTERM);
4698 LOP(OP_SETPGRP,XTERM);
4700 case KEY_setpriority:
4701 LOP(OP_SETPRIORITY,XTERM);
4703 case KEY_sethostent:
4709 case KEY_setservent:
4712 case KEY_setprotoent:
4722 LOP(OP_SEEKDIR,XTERM);
4724 case KEY_setsockopt:
4725 LOP(OP_SSOCKOPT,XTERM);
4731 LOP(OP_SHMCTL,XTERM);
4734 LOP(OP_SHMGET,XTERM);
4737 LOP(OP_SHMREAD,XTERM);
4740 LOP(OP_SHMWRITE,XTERM);
4743 LOP(OP_SHUTDOWN,XTERM);
4752 LOP(OP_SOCKET,XTERM);
4754 case KEY_socketpair:
4755 LOP(OP_SOCKPAIR,XTERM);
4758 checkcomma(s,PL_tokenbuf,"subroutine name");
4760 if (*s == ';' || *s == ')') /* probably a close */
4761 Perl_croak(aTHX_ "sort is now a reserved word");
4763 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4767 LOP(OP_SPLIT,XTERM);
4770 LOP(OP_SPRINTF,XTERM);
4773 LOP(OP_SPLICE,XTERM);
4788 LOP(OP_SUBSTR,XTERM);
4794 char tmpbuf[sizeof PL_tokenbuf];
4796 expectation attrful;
4797 bool have_name, have_proto;
4802 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4803 (*s == ':' && s[1] == ':'))
4806 attrful = XATTRBLOCK;
4807 /* remember buffer pos'n for later force_word */
4808 tboffset = s - PL_oldbufptr;
4809 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4810 if (strchr(tmpbuf, ':'))
4811 sv_setpv(PL_subname, tmpbuf);
4813 sv_setsv(PL_subname,PL_curstname);
4814 sv_catpvn(PL_subname,"::",2);
4815 sv_catpvn(PL_subname,tmpbuf,len);
4822 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4823 PL_expect = XTERMBLOCK;
4824 attrful = XATTRTERM;
4825 sv_setpv(PL_subname,"?");
4829 if (key == KEY_format) {
4831 PL_lex_formbrack = PL_lex_brackets + 1;
4833 (void) force_word(PL_oldbufptr + tboffset, WORD,
4838 /* Look for a prototype */
4842 s = scan_str(s,FALSE,FALSE);
4845 SvREFCNT_dec(PL_lex_stuff);
4846 PL_lex_stuff = Nullsv;
4847 Perl_croak(aTHX_ "Prototype not terminated");
4850 d = SvPVX(PL_lex_stuff);
4852 for (p = d; *p; ++p) {
4857 SvCUR(PL_lex_stuff) = tmp;
4865 if (*s == ':' && s[1] != ':')
4866 PL_expect = attrful;
4869 PL_nextval[PL_nexttoke].opval =
4870 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4871 PL_lex_stuff = Nullsv;
4875 sv_setpv(PL_subname,"__ANON__");
4878 (void) force_word(PL_oldbufptr + tboffset, WORD,
4887 LOP(OP_SYSTEM,XREF);
4890 LOP(OP_SYMLINK,XTERM);
4893 LOP(OP_SYSCALL,XTERM);
4896 LOP(OP_SYSOPEN,XTERM);
4899 LOP(OP_SYSSEEK,XTERM);
4902 LOP(OP_SYSREAD,XTERM);
4905 LOP(OP_SYSWRITE,XTERM);
4909 TERM(sublex_start());
4930 LOP(OP_TRUNCATE,XTERM);
4942 yylval.ival = CopLINE(PL_curcop);
4946 yylval.ival = CopLINE(PL_curcop);
4950 LOP(OP_UNLINK,XTERM);
4956 LOP(OP_UNPACK,XTERM);
4959 LOP(OP_UTIME,XTERM);
4962 if (ckWARN(WARN_UMASK)) {
4963 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4964 if (*d != '0' && isDIGIT(*d))
4965 Perl_warner(aTHX_ WARN_UMASK,
4966 "umask: argument is missing initial 0");
4971 LOP(OP_UNSHIFT,XTERM);
4974 if (PL_expect != XSTATE)
4975 yyerror("\"use\" not allowed in expression");
4977 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4978 s = force_version(s);
4979 if (*s == ';' || (s = skipspace(s), *s == ';')) {
4980 PL_nextval[PL_nexttoke].opval = Nullop;
4985 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4986 s = force_version(s);
4998 yylval.ival = CopLINE(PL_curcop);
5002 PL_hints |= HINT_BLOCK_SCOPE;
5009 LOP(OP_WAITPID,XTERM);
5017 static char ctl_l[2];
5019 if (ctl_l[0] == '\0')
5020 ctl_l[0] = toCTRL('L');
5021 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5024 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5029 if (PL_expect == XOPERATOR)
5035 yylval.ival = OP_XOR;
5040 TERM(sublex_start());
5045 #pragma segment Main
5049 Perl_keyword(pTHX_ register char *d, I32 len)
5054 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5055 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5056 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5057 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5058 if (strEQ(d,"__END__")) return KEY___END__;
5062 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5067 if (strEQ(d,"and")) return -KEY_and;
5068 if (strEQ(d,"abs")) return -KEY_abs;
5071 if (strEQ(d,"alarm")) return -KEY_alarm;
5072 if (strEQ(d,"atan2")) return -KEY_atan2;
5075 if (strEQ(d,"accept")) return -KEY_accept;
5080 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5083 if (strEQ(d,"bless")) return -KEY_bless;
5084 if (strEQ(d,"bind")) return -KEY_bind;
5085 if (strEQ(d,"binmode")) return -KEY_binmode;
5088 if (strEQ(d,"CORE")) return -KEY_CORE;
5089 if (strEQ(d,"CHECK")) return KEY_CHECK;
5094 if (strEQ(d,"cmp")) return -KEY_cmp;
5095 if (strEQ(d,"chr")) return -KEY_chr;
5096 if (strEQ(d,"cos")) return -KEY_cos;
5099 if (strEQ(d,"chop")) return KEY_chop;
5102 if (strEQ(d,"close")) return -KEY_close;
5103 if (strEQ(d,"chdir")) return -KEY_chdir;
5104 if (strEQ(d,"chomp")) return KEY_chomp;
5105 if (strEQ(d,"chmod")) return -KEY_chmod;
5106 if (strEQ(d,"chown")) return -KEY_chown;
5107 if (strEQ(d,"crypt")) return -KEY_crypt;
5110 if (strEQ(d,"chroot")) return -KEY_chroot;
5111 if (strEQ(d,"caller")) return -KEY_caller;
5114 if (strEQ(d,"connect")) return -KEY_connect;
5117 if (strEQ(d,"closedir")) return -KEY_closedir;
5118 if (strEQ(d,"continue")) return -KEY_continue;
5123 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5128 if (strEQ(d,"do")) return KEY_do;
5131 if (strEQ(d,"die")) return -KEY_die;
5134 if (strEQ(d,"dump")) return -KEY_dump;
5137 if (strEQ(d,"delete")) return KEY_delete;
5140 if (strEQ(d,"defined")) return KEY_defined;
5141 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5144 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5149 if (strEQ(d,"END")) return KEY_END;
5154 if (strEQ(d,"eq")) return -KEY_eq;
5157 if (strEQ(d,"eof")) return -KEY_eof;
5158 if (strEQ(d,"exp")) return -KEY_exp;
5161 if (strEQ(d,"else")) return KEY_else;
5162 if (strEQ(d,"exit")) return -KEY_exit;
5163 if (strEQ(d,"eval")) return KEY_eval;
5164 if (strEQ(d,"exec")) return -KEY_exec;
5165 if (strEQ(d,"each")) return KEY_each;
5168 if (strEQ(d,"elsif")) return KEY_elsif;
5171 if (strEQ(d,"exists")) return KEY_exists;
5172 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5175 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5176 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5179 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5182 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5183 if (strEQ(d,"endservent")) return -KEY_endservent;
5186 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5193 if (strEQ(d,"for")) return KEY_for;
5196 if (strEQ(d,"fork")) return -KEY_fork;
5199 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5200 if (strEQ(d,"flock")) return -KEY_flock;
5203 if (strEQ(d,"format")) return KEY_format;
5204 if (strEQ(d,"fileno")) return -KEY_fileno;
5207 if (strEQ(d,"foreach")) return KEY_foreach;
5210 if (strEQ(d,"formline")) return -KEY_formline;
5215 if (strnEQ(d,"get",3)) {
5220 if (strEQ(d,"ppid")) return -KEY_getppid;
5221 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5224 if (strEQ(d,"pwent")) return -KEY_getpwent;
5225 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5226 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5229 if (strEQ(d,"peername")) return -KEY_getpeername;
5230 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5231 if (strEQ(d,"priority")) return -KEY_getpriority;
5234 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5237 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5241 else if (*d == 'h') {
5242 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5243 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5244 if (strEQ(d,"hostent")) return -KEY_gethostent;
5246 else if (*d == 'n') {
5247 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5248 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5249 if (strEQ(d,"netent")) return -KEY_getnetent;
5251 else if (*d == 's') {
5252 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5253 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5254 if (strEQ(d,"servent")) return -KEY_getservent;
5255 if (strEQ(d,"sockname")) return -KEY_getsockname;
5256 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5258 else if (*d == 'g') {
5259 if (strEQ(d,"grent")) return -KEY_getgrent;
5260 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5261 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5263 else if (*d == 'l') {
5264 if (strEQ(d,"login")) return -KEY_getlogin;
5266 else if (strEQ(d,"c")) return -KEY_getc;
5271 if (strEQ(d,"gt")) return -KEY_gt;
5272 if (strEQ(d,"ge")) return -KEY_ge;
5275 if (strEQ(d,"grep")) return KEY_grep;
5276 if (strEQ(d,"goto")) return KEY_goto;
5277 if (strEQ(d,"glob")) return KEY_glob;
5280 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5285 if (strEQ(d,"hex")) return -KEY_hex;
5288 if (strEQ(d,"INIT")) return KEY_INIT;
5293 if (strEQ(d,"if")) return KEY_if;
5296 if (strEQ(d,"int")) return -KEY_int;
5299 if (strEQ(d,"index")) return -KEY_index;
5300 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5305 if (strEQ(d,"join")) return -KEY_join;
5309 if (strEQ(d,"keys")) return KEY_keys;
5310 if (strEQ(d,"kill")) return -KEY_kill;
5316 if (strEQ(d,"lt")) return -KEY_lt;
5317 if (strEQ(d,"le")) return -KEY_le;
5318 if (strEQ(d,"lc")) return -KEY_lc;
5321 if (strEQ(d,"log")) return -KEY_log;
5324 if (strEQ(d,"last")) return KEY_last;
5325 if (strEQ(d,"link")) return -KEY_link;
5326 if (strEQ(d,"lock")) return -KEY_lock;
5329 if (strEQ(d,"local")) return KEY_local;
5330 if (strEQ(d,"lstat")) return -KEY_lstat;
5333 if (strEQ(d,"length")) return -KEY_length;
5334 if (strEQ(d,"listen")) return -KEY_listen;
5337 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5340 if (strEQ(d,"localtime")) return -KEY_localtime;
5346 case 1: return KEY_m;
5348 if (strEQ(d,"my")) return KEY_my;
5351 if (strEQ(d,"map")) return KEY_map;
5354 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5357 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5358 if (strEQ(d,"msgget")) return -KEY_msgget;
5359 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5360 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5365 if (strEQ(d,"next")) return KEY_next;
5366 if (strEQ(d,"ne")) return -KEY_ne;
5367 if (strEQ(d,"not")) return -KEY_not;
5368 if (strEQ(d,"no")) return KEY_no;
5373 if (strEQ(d,"or")) return -KEY_or;
5376 if (strEQ(d,"ord")) return -KEY_ord;
5377 if (strEQ(d,"oct")) return -KEY_oct;
5378 if (strEQ(d,"our")) return KEY_our;
5381 if (strEQ(d,"open")) return -KEY_open;
5384 if (strEQ(d,"opendir")) return -KEY_opendir;
5391 if (strEQ(d,"pop")) return KEY_pop;
5392 if (strEQ(d,"pos")) return KEY_pos;
5395 if (strEQ(d,"push")) return KEY_push;
5396 if (strEQ(d,"pack")) return -KEY_pack;
5397 if (strEQ(d,"pipe")) return -KEY_pipe;
5400 if (strEQ(d,"print")) return KEY_print;
5403 if (strEQ(d,"printf")) return KEY_printf;
5406 if (strEQ(d,"package")) return KEY_package;
5409 if (strEQ(d,"prototype")) return KEY_prototype;
5414 if (strEQ(d,"q")) return KEY_q;
5415 if (strEQ(d,"qr")) return KEY_qr;
5416 if (strEQ(d,"qq")) return KEY_qq;
5417 if (strEQ(d,"qw")) return KEY_qw;
5418 if (strEQ(d,"qx")) return KEY_qx;
5420 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5425 if (strEQ(d,"ref")) return -KEY_ref;
5428 if (strEQ(d,"read")) return -KEY_read;
5429 if (strEQ(d,"rand")) return -KEY_rand;
5430 if (strEQ(d,"recv")) return -KEY_recv;
5431 if (strEQ(d,"redo")) return KEY_redo;
5434 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5435 if (strEQ(d,"reset")) return -KEY_reset;
5438 if (strEQ(d,"return")) return KEY_return;
5439 if (strEQ(d,"rename")) return -KEY_rename;
5440 if (strEQ(d,"rindex")) return -KEY_rindex;
5443 if (strEQ(d,"require")) return -KEY_require;
5444 if (strEQ(d,"reverse")) return -KEY_reverse;
5445 if (strEQ(d,"readdir")) return -KEY_readdir;
5448 if (strEQ(d,"readlink")) return -KEY_readlink;
5449 if (strEQ(d,"readline")) return -KEY_readline;
5450 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5453 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5459 case 0: return KEY_s;
5461 if (strEQ(d,"scalar")) return KEY_scalar;
5466 if (strEQ(d,"seek")) return -KEY_seek;
5467 if (strEQ(d,"send")) return -KEY_send;
5470 if (strEQ(d,"semop")) return -KEY_semop;
5473 if (strEQ(d,"select")) return -KEY_select;
5474 if (strEQ(d,"semctl")) return -KEY_semctl;
5475 if (strEQ(d,"semget")) return -KEY_semget;
5478 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5479 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5482 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5483 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5486 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5489 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5490 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5491 if (strEQ(d,"setservent")) return -KEY_setservent;
5494 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5495 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5502 if (strEQ(d,"shift")) return KEY_shift;
5505 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5506 if (strEQ(d,"shmget")) return -KEY_shmget;
5509 if (strEQ(d,"shmread")) return -KEY_shmread;
5512 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5513 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5518 if (strEQ(d,"sin")) return -KEY_sin;
5521 if (strEQ(d,"sleep")) return -KEY_sleep;
5524 if (strEQ(d,"sort")) return KEY_sort;
5525 if (strEQ(d,"socket")) return -KEY_socket;
5526 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5529 if (strEQ(d,"split")) return KEY_split;
5530 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5531 if (strEQ(d,"splice")) return KEY_splice;
5534 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5537 if (strEQ(d,"srand")) return -KEY_srand;
5540 if (strEQ(d,"stat")) return -KEY_stat;
5541 if (strEQ(d,"study")) return KEY_study;
5544 if (strEQ(d,"substr")) return -KEY_substr;
5545 if (strEQ(d,"sub")) return KEY_sub;
5550 if (strEQ(d,"system")) return -KEY_system;
5553 if (strEQ(d,"symlink")) return -KEY_symlink;
5554 if (strEQ(d,"syscall")) return -KEY_syscall;
5555 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5556 if (strEQ(d,"sysread")) return -KEY_sysread;
5557 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5560 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5569 if (strEQ(d,"tr")) return KEY_tr;
5572 if (strEQ(d,"tie")) return KEY_tie;
5575 if (strEQ(d,"tell")) return -KEY_tell;
5576 if (strEQ(d,"tied")) return KEY_tied;
5577 if (strEQ(d,"time")) return -KEY_time;
5580 if (strEQ(d,"times")) return -KEY_times;
5583 if (strEQ(d,"telldir")) return -KEY_telldir;
5586 if (strEQ(d,"truncate")) return -KEY_truncate;
5593 if (strEQ(d,"uc")) return -KEY_uc;
5596 if (strEQ(d,"use")) return KEY_use;
5599 if (strEQ(d,"undef")) return KEY_undef;
5600 if (strEQ(d,"until")) return KEY_until;
5601 if (strEQ(d,"untie")) return KEY_untie;
5602 if (strEQ(d,"utime")) return -KEY_utime;
5603 if (strEQ(d,"umask")) return -KEY_umask;
5606 if (strEQ(d,"unless")) return KEY_unless;
5607 if (strEQ(d,"unpack")) return -KEY_unpack;
5608 if (strEQ(d,"unlink")) return -KEY_unlink;
5611 if (strEQ(d,"unshift")) return KEY_unshift;
5612 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5617 if (strEQ(d,"values")) return -KEY_values;
5618 if (strEQ(d,"vec")) return -KEY_vec;
5623 if (strEQ(d,"warn")) return -KEY_warn;
5624 if (strEQ(d,"wait")) return -KEY_wait;
5627 if (strEQ(d,"while")) return KEY_while;
5628 if (strEQ(d,"write")) return -KEY_write;
5631 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5634 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5639 if (len == 1) return -KEY_x;
5640 if (strEQ(d,"xor")) return -KEY_xor;
5643 if (len == 1) return KEY_y;
5652 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5656 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5657 dTHR; /* only for ckWARN */
5658 if (ckWARN(WARN_SYNTAX)) {
5660 for (w = s+2; *w && level; w++) {
5667 for (; *w && isSPACE(*w); w++) ;
5668 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5669 Perl_warner(aTHX_ WARN_SYNTAX,
5670 "%s (...) interpreted as function",name);
5673 while (s < PL_bufend && isSPACE(*s))
5677 while (s < PL_bufend && isSPACE(*s))
5679 if (isIDFIRST_lazy_if(s,UTF)) {
5681 while (isALNUM_lazy_if(s,UTF))
5683 while (s < PL_bufend && isSPACE(*s))
5688 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5692 Perl_croak(aTHX_ "No comma allowed after %s", what);
5697 /* Either returns sv, or mortalizes sv and returns a new SV*.
5698 Best used as sv=new_constant(..., sv, ...).
5699 If s, pv are NULL, calls subroutine with one argument,
5700 and type is used with error messages only. */
5703 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5707 HV *table = GvHV(PL_hintgv); /* ^H */
5711 const char *why1, *why2, *why3;
5713 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5716 why1 = "%^H is not consistent";
5717 why2 = strEQ(key,"charnames")
5718 ? " (missing \"use charnames ...\"?)"
5722 msg = Perl_newSVpvf(aTHX_ "constant(%s): %s%s%s",
5723 (type ? type: "undef"), why1, why2, why3);
5724 yyerror(SvPVX(msg));
5728 cvp = hv_fetch(table, key, strlen(key), FALSE);
5729 if (!cvp || !SvOK(*cvp)) {
5732 why3 = "} is not defined";
5735 sv_2mortal(sv); /* Parent created it permanently */
5738 pv = sv_2mortal(newSVpvn(s, len));
5740 typesv = sv_2mortal(newSVpv(type, 0));
5742 typesv = &PL_sv_undef;
5744 PUSHSTACKi(PERLSI_OVERLOAD);
5757 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5761 /* Check the eval first */
5762 if (!PL_in_eval && SvTRUE(ERRSV)) {
5764 sv_catpv(ERRSV, "Propagated");
5765 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5767 res = SvREFCNT_inc(sv);
5771 (void)SvREFCNT_inc(res);
5780 why1 = "Call to &{$^H{";
5782 why3 = "}} did not return a defined value";
5791 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5793 register char *d = dest;
5794 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5797 Perl_croak(aTHX_ ident_too_long);
5798 if (isALNUM(*s)) /* UTF handled below */
5800 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
5805 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5809 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5810 char *t = s + UTF8SKIP(s);
5811 while (*t & 0x80 && is_utf8_mark((U8*)t))
5813 if (d + (t - s) > e)
5814 Perl_croak(aTHX_ ident_too_long);
5815 Copy(s, d, t - s, char);
5828 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
5838 e = d + destlen - 3; /* two-character token, ending NUL */
5840 while (isDIGIT(*s)) {
5842 Perl_croak(aTHX_ ident_too_long);
5849 Perl_croak(aTHX_ ident_too_long);
5850 if (isALNUM(*s)) /* UTF handled below */
5852 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
5857 else if (*s == ':' && s[1] == ':') {
5861 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5862 char *t = s + UTF8SKIP(s);
5863 while (*t & 0x80 && is_utf8_mark((U8*)t))
5865 if (d + (t - s) > e)
5866 Perl_croak(aTHX_ ident_too_long);
5867 Copy(s, d, t - s, char);
5878 if (PL_lex_state != LEX_NORMAL)
5879 PL_lex_state = LEX_INTERPENDMAYBE;
5882 if (*s == '$' && s[1] &&
5883 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
5896 if (*d == '^' && *s && isCONTROLVAR(*s)) {
5901 if (isSPACE(s[-1])) {
5904 if (!SPACE_OR_TAB(ch)) {
5910 if (isIDFIRST_lazy_if(d,UTF)) {
5914 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
5916 while (e < send && *e & 0x80 && is_utf8_mark((U8*)e))
5919 Copy(s, d, e - s, char);
5924 while ((isALNUM(*s) || *s == ':') && d < e)
5927 Perl_croak(aTHX_ ident_too_long);
5930 while (s < send && SPACE_OR_TAB(*s)) s++;
5931 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
5932 dTHR; /* only for ckWARN */
5933 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
5934 const char *brack = *s == '[' ? "[...]" : "{...}";
5935 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5936 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
5937 funny, dest, brack, funny, dest, brack);
5940 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
5944 /* Handle extended ${^Foo} variables
5945 * 1999-02-27 mjd-perl-patch@plover.com */
5946 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
5950 while (isALNUM(*s) && d < e) {
5954 Perl_croak(aTHX_ ident_too_long);
5959 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
5960 PL_lex_state = LEX_INTERPEND;
5963 if (PL_lex_state == LEX_NORMAL) {
5964 dTHR; /* only for ckWARN */
5965 if (ckWARN(WARN_AMBIGUOUS) &&
5966 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
5968 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5969 "Ambiguous use of %c{%s} resolved to %c%s",
5970 funny, dest, funny, dest);
5975 s = bracket; /* let the parser handle it */
5979 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
5980 PL_lex_state = LEX_INTERPEND;
5985 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
5990 *pmfl |= PMf_GLOBAL;
5992 *pmfl |= PMf_CONTINUE;
5996 *pmfl |= PMf_MULTILINE;
5998 *pmfl |= PMf_SINGLELINE;
6000 *pmfl |= PMf_EXTENDED;
6004 S_scan_pat(pTHX_ char *start, I32 type)
6009 s = scan_str(start,FALSE,FALSE);
6012 SvREFCNT_dec(PL_lex_stuff);
6013 PL_lex_stuff = Nullsv;
6014 Perl_croak(aTHX_ "Search pattern not terminated");
6017 pm = (PMOP*)newPMOP(type, 0);
6018 if (PL_multi_open == '?')
6019 pm->op_pmflags |= PMf_ONCE;
6021 while (*s && strchr("iomsx", *s))
6022 pmflag(&pm->op_pmflags,*s++);
6025 while (*s && strchr("iogcmsx", *s))
6026 pmflag(&pm->op_pmflags,*s++);
6028 pm->op_pmpermflags = pm->op_pmflags;
6030 PL_lex_op = (OP*)pm;
6031 yylval.ival = OP_MATCH;
6036 S_scan_subst(pTHX_ char *start)
6043 yylval.ival = OP_NULL;
6045 s = scan_str(start,FALSE,FALSE);
6049 SvREFCNT_dec(PL_lex_stuff);
6050 PL_lex_stuff = Nullsv;
6051 Perl_croak(aTHX_ "Substitution pattern not terminated");
6054 if (s[-1] == PL_multi_open)
6057 first_start = PL_multi_start;
6058 s = scan_str(s,FALSE,FALSE);
6061 SvREFCNT_dec(PL_lex_stuff);
6062 PL_lex_stuff = Nullsv;
6064 SvREFCNT_dec(PL_lex_repl);
6065 PL_lex_repl = Nullsv;
6066 Perl_croak(aTHX_ "Substitution replacement not terminated");
6068 PL_multi_start = first_start; /* so whole substitution is taken together */
6070 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6076 else if (strchr("iogcmsx", *s))
6077 pmflag(&pm->op_pmflags,*s++);
6084 PL_sublex_info.super_bufptr = s;
6085 PL_sublex_info.super_bufend = PL_bufend;
6087 pm->op_pmflags |= PMf_EVAL;
6088 repl = newSVpvn("",0);
6090 sv_catpv(repl, es ? "eval " : "do ");
6091 sv_catpvn(repl, "{ ", 2);
6092 sv_catsv(repl, PL_lex_repl);
6093 sv_catpvn(repl, " };", 2);
6095 SvREFCNT_dec(PL_lex_repl);
6099 pm->op_pmpermflags = pm->op_pmflags;
6100 PL_lex_op = (OP*)pm;
6101 yylval.ival = OP_SUBST;
6106 S_scan_trans(pTHX_ char *start)
6117 yylval.ival = OP_NULL;
6119 s = scan_str(start,FALSE,FALSE);
6122 SvREFCNT_dec(PL_lex_stuff);
6123 PL_lex_stuff = Nullsv;
6124 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6126 if (s[-1] == PL_multi_open)
6129 s = scan_str(s,FALSE,FALSE);
6132 SvREFCNT_dec(PL_lex_stuff);
6133 PL_lex_stuff = Nullsv;
6135 SvREFCNT_dec(PL_lex_repl);
6136 PL_lex_repl = Nullsv;
6137 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6140 New(803,tbl,256,short);
6141 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6143 complement = del = squash = 0;
6144 while (strchr("cds", *s)) {
6146 complement = OPpTRANS_COMPLEMENT;
6148 del = OPpTRANS_DELETE;
6150 squash = OPpTRANS_SQUASH;
6153 o->op_private = del|squash|complement;
6156 yylval.ival = OP_TRANS;
6161 S_scan_heredoc(pTHX_ register char *s)
6165 I32 op_type = OP_SCALAR;
6172 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6176 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6179 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6180 if (*peek && strchr("`'\"",*peek)) {
6183 s = delimcpy(d, e, s, PL_bufend, term, &len);
6193 if (!isALNUM_lazy_if(s,UTF))
6194 deprecate("bare << to mean <<\"\"");
6195 for (; isALNUM_lazy_if(s,UTF); s++) {
6200 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6201 Perl_croak(aTHX_ "Delimiter for here document is too long");
6204 len = d - PL_tokenbuf;
6205 #ifndef PERL_STRICT_CR
6206 d = strchr(s, '\r');
6210 while (s < PL_bufend) {
6216 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6225 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6230 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6231 herewas = newSVpvn(s,PL_bufend-s);
6233 s--, herewas = newSVpvn(s,d-s);
6234 s += SvCUR(herewas);
6236 tmpstr = NEWSV(87,79);
6237 sv_upgrade(tmpstr, SVt_PVIV);
6242 else if (term == '`') {
6243 op_type = OP_BACKTICK;
6244 SvIVX(tmpstr) = '\\';
6248 PL_multi_start = CopLINE(PL_curcop);
6249 PL_multi_open = PL_multi_close = '<';
6250 term = *PL_tokenbuf;
6251 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6252 char *bufptr = PL_sublex_info.super_bufptr;
6253 char *bufend = PL_sublex_info.super_bufend;
6254 char *olds = s - SvCUR(herewas);
6255 s = strchr(bufptr, '\n');
6259 while (s < bufend &&
6260 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6262 CopLINE_inc(PL_curcop);
6265 CopLINE_set(PL_curcop, PL_multi_start);
6266 missingterm(PL_tokenbuf);
6268 sv_setpvn(herewas,bufptr,d-bufptr+1);
6269 sv_setpvn(tmpstr,d+1,s-d);
6271 sv_catpvn(herewas,s,bufend-s);
6272 (void)strcpy(bufptr,SvPVX(herewas));
6279 while (s < PL_bufend &&
6280 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6282 CopLINE_inc(PL_curcop);
6284 if (s >= PL_bufend) {
6285 CopLINE_set(PL_curcop, PL_multi_start);
6286 missingterm(PL_tokenbuf);
6288 sv_setpvn(tmpstr,d+1,s-d);
6290 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6292 sv_catpvn(herewas,s,PL_bufend-s);
6293 sv_setsv(PL_linestr,herewas);
6294 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6295 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6298 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6299 while (s >= PL_bufend) { /* multiple line string? */
6301 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6302 CopLINE_set(PL_curcop, PL_multi_start);
6303 missingterm(PL_tokenbuf);
6305 CopLINE_inc(PL_curcop);
6306 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6307 #ifndef PERL_STRICT_CR
6308 if (PL_bufend - PL_linestart >= 2) {
6309 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6310 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6312 PL_bufend[-2] = '\n';
6314 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6316 else if (PL_bufend[-1] == '\r')
6317 PL_bufend[-1] = '\n';
6319 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6320 PL_bufend[-1] = '\n';
6322 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6323 SV *sv = NEWSV(88,0);
6325 sv_upgrade(sv, SVt_PVMG);
6326 sv_setsv(sv,PL_linestr);
6327 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6329 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6332 sv_catsv(PL_linestr,herewas);
6333 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6337 sv_catsv(tmpstr,PL_linestr);
6342 PL_multi_end = CopLINE(PL_curcop);
6343 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6344 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6345 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6347 SvREFCNT_dec(herewas);
6348 PL_lex_stuff = tmpstr;
6349 yylval.ival = op_type;
6354 takes: current position in input buffer
6355 returns: new position in input buffer
6356 side-effects: yylval and lex_op are set.
6361 <FH> read from filehandle
6362 <pkg::FH> read from package qualified filehandle
6363 <pkg'FH> read from package qualified filehandle
6364 <$fh> read from filehandle in $fh
6370 S_scan_inputsymbol(pTHX_ char *start)
6372 register char *s = start; /* current position in buffer */
6378 d = PL_tokenbuf; /* start of temp holding space */
6379 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6380 end = strchr(s, '\n');
6383 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6385 /* die if we didn't have space for the contents of the <>,
6386 or if it didn't end, or if we see a newline
6389 if (len >= sizeof PL_tokenbuf)
6390 Perl_croak(aTHX_ "Excessively long <> operator");
6392 Perl_croak(aTHX_ "Unterminated <> operator");
6397 Remember, only scalar variables are interpreted as filehandles by
6398 this code. Anything more complex (e.g., <$fh{$num}>) will be
6399 treated as a glob() call.
6400 This code makes use of the fact that except for the $ at the front,
6401 a scalar variable and a filehandle look the same.
6403 if (*d == '$' && d[1]) d++;
6405 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6406 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6409 /* If we've tried to read what we allow filehandles to look like, and
6410 there's still text left, then it must be a glob() and not a getline.
6411 Use scan_str to pull out the stuff between the <> and treat it
6412 as nothing more than a string.
6415 if (d - PL_tokenbuf != len) {
6416 yylval.ival = OP_GLOB;
6418 s = scan_str(start,FALSE,FALSE);
6420 Perl_croak(aTHX_ "Glob not terminated");
6424 /* we're in a filehandle read situation */
6427 /* turn <> into <ARGV> */
6429 (void)strcpy(d,"ARGV");
6431 /* if <$fh>, create the ops to turn the variable into a
6437 /* try to find it in the pad for this block, otherwise find
6438 add symbol table ops
6440 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6441 OP *o = newOP(OP_PADSV, 0);
6443 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6446 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6447 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6448 newUNOP(OP_RV2SV, 0,
6449 newGVOP(OP_GV, 0, gv)));
6451 PL_lex_op->op_flags |= OPf_SPECIAL;
6452 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6453 yylval.ival = OP_NULL;
6456 /* If it's none of the above, it must be a literal filehandle
6457 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6459 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6460 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6461 yylval.ival = OP_NULL;
6470 takes: start position in buffer
6471 keep_quoted preserve \ on the embedded delimiter(s)
6472 keep_delims preserve the delimiters around the string
6473 returns: position to continue reading from buffer
6474 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6475 updates the read buffer.
6477 This subroutine pulls a string out of the input. It is called for:
6478 q single quotes q(literal text)
6479 ' single quotes 'literal text'
6480 qq double quotes qq(interpolate $here please)
6481 " double quotes "interpolate $here please"
6482 qx backticks qx(/bin/ls -l)
6483 ` backticks `/bin/ls -l`
6484 qw quote words @EXPORT_OK = qw( func() $spam )
6485 m// regexp match m/this/
6486 s/// regexp substitute s/this/that/
6487 tr/// string transliterate tr/this/that/
6488 y/// string transliterate y/this/that/
6489 ($*@) sub prototypes sub foo ($)
6490 (stuff) sub attr parameters sub foo : attr(stuff)
6491 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6493 In most of these cases (all but <>, patterns and transliterate)
6494 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6495 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6496 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6499 It skips whitespace before the string starts, and treats the first
6500 character as the delimiter. If the delimiter is one of ([{< then
6501 the corresponding "close" character )]}> is used as the closing
6502 delimiter. It allows quoting of delimiters, and if the string has
6503 balanced delimiters ([{<>}]) it allows nesting.
6505 The lexer always reads these strings into lex_stuff, except in the
6506 case of the operators which take *two* arguments (s/// and tr///)
6507 when it checks to see if lex_stuff is full (presumably with the 1st
6508 arg to s or tr) and if so puts the string into lex_repl.
6513 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6516 SV *sv; /* scalar value: string */
6517 char *tmps; /* temp string, used for delimiter matching */
6518 register char *s = start; /* current position in the buffer */
6519 register char term; /* terminating character */
6520 register char *to; /* current position in the sv's data */
6521 I32 brackets = 1; /* bracket nesting level */
6522 bool has_utf = FALSE; /* is there any utf8 content? */
6524 /* skip space before the delimiter */
6528 /* mark where we are, in case we need to report errors */
6531 /* after skipping whitespace, the next character is the terminator */
6533 if ((term & 0x80) && UTF)
6536 /* mark where we are */
6537 PL_multi_start = CopLINE(PL_curcop);
6538 PL_multi_open = term;
6540 /* find corresponding closing delimiter */
6541 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6543 PL_multi_close = term;
6545 /* create a new SV to hold the contents. 87 is leak category, I'm
6546 assuming. 79 is the SV's initial length. What a random number. */
6548 sv_upgrade(sv, SVt_PVIV);
6550 (void)SvPOK_only(sv); /* validate pointer */
6552 /* move past delimiter and try to read a complete string */
6554 sv_catpvn(sv, s, 1);
6557 /* extend sv if need be */
6558 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6559 /* set 'to' to the next character in the sv's string */
6560 to = SvPVX(sv)+SvCUR(sv);
6562 /* if open delimiter is the close delimiter read unbridle */
6563 if (PL_multi_open == PL_multi_close) {
6564 for (; s < PL_bufend; s++,to++) {
6565 /* embedded newlines increment the current line number */
6566 if (*s == '\n' && !PL_rsfp)
6567 CopLINE_inc(PL_curcop);
6568 /* handle quoted delimiters */
6569 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6570 if (!keep_quoted && s[1] == term)
6572 /* any other quotes are simply copied straight through */
6576 /* terminate when run out of buffer (the for() condition), or
6577 have found the terminator */
6578 else if (*s == term)
6580 else if (!has_utf && (*s & 0x80) && UTF)
6586 /* if the terminator isn't the same as the start character (e.g.,
6587 matched brackets), we have to allow more in the quoting, and
6588 be prepared for nested brackets.
6591 /* read until we run out of string, or we find the terminator */
6592 for (; s < PL_bufend; s++,to++) {
6593 /* embedded newlines increment the line count */
6594 if (*s == '\n' && !PL_rsfp)
6595 CopLINE_inc(PL_curcop);
6596 /* backslashes can escape the open or closing characters */
6597 if (*s == '\\' && s+1 < PL_bufend) {
6599 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6604 /* allow nested opens and closes */
6605 else if (*s == PL_multi_close && --brackets <= 0)
6607 else if (*s == PL_multi_open)
6609 else if (!has_utf && (*s & 0x80) && UTF)
6614 /* terminate the copied string and update the sv's end-of-string */
6616 SvCUR_set(sv, to - SvPVX(sv));
6619 * this next chunk reads more into the buffer if we're not done yet
6623 break; /* handle case where we are done yet :-) */
6625 #ifndef PERL_STRICT_CR
6626 if (to - SvPVX(sv) >= 2) {
6627 if ((to[-2] == '\r' && to[-1] == '\n') ||
6628 (to[-2] == '\n' && to[-1] == '\r'))
6632 SvCUR_set(sv, to - SvPVX(sv));
6634 else if (to[-1] == '\r')
6637 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6641 /* if we're out of file, or a read fails, bail and reset the current
6642 line marker so we can report where the unterminated string began
6645 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6647 CopLINE_set(PL_curcop, PL_multi_start);
6650 /* we read a line, so increment our line counter */
6651 CopLINE_inc(PL_curcop);
6653 /* update debugger info */
6654 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6655 SV *sv = NEWSV(88,0);
6657 sv_upgrade(sv, SVt_PVMG);
6658 sv_setsv(sv,PL_linestr);
6659 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6662 /* having changed the buffer, we must update PL_bufend */
6663 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6666 /* at this point, we have successfully read the delimited string */
6669 sv_catpvn(sv, s, 1);
6672 PL_multi_end = CopLINE(PL_curcop);
6675 /* if we allocated too much space, give some back */
6676 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6677 SvLEN_set(sv, SvCUR(sv) + 1);
6678 Renew(SvPVX(sv), SvLEN(sv), char);
6681 /* decide whether this is the first or second quoted string we've read
6694 takes: pointer to position in buffer
6695 returns: pointer to new position in buffer
6696 side-effects: builds ops for the constant in yylval.op
6698 Read a number in any of the formats that Perl accepts:
6700 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6701 [\d_]+(\.[\d_]*)?[Ee](\d+)
6703 Underbars (_) are allowed in decimal numbers. If -w is on,
6704 underbars before a decimal point must be at three digit intervals.
6706 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6709 If it reads a number without a decimal point or an exponent, it will
6710 try converting the number to an integer and see if it can do so
6711 without loss of precision.
6715 Perl_scan_num(pTHX_ char *start)
6717 register char *s = start; /* current position in buffer */
6718 register char *d; /* destination in temp buffer */
6719 register char *e; /* end of temp buffer */
6720 NV nv; /* number read, as a double */
6721 SV *sv = Nullsv; /* place to put the converted number */
6722 bool floatit; /* boolean: int or float? */
6723 char *lastub = 0; /* position of last underbar */
6724 static char number_too_long[] = "Number too long";
6726 /* We use the first character to decide what type of number this is */
6730 Perl_croak(aTHX_ "panic: scan_num");
6732 /* if it starts with a 0, it could be an octal number, a decimal in
6733 0.13 disguise, or a hexadecimal number, or a binary number. */
6737 u holds the "number so far"
6738 shift the power of 2 of the base
6739 (hex == 4, octal == 3, binary == 1)
6740 overflowed was the number more than we can hold?
6742 Shift is used when we add a digit. It also serves as an "are
6743 we in octal/hex/binary?" indicator to disallow hex characters
6750 bool overflowed = FALSE;
6751 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6752 static char* bases[5] = { "", "binary", "", "octal",
6754 static char* Bases[5] = { "", "Binary", "", "Octal",
6756 static char *maxima[5] = { "",
6757 "0b11111111111111111111111111111111",
6761 char *base, *Base, *max;
6767 } else if (s[1] == 'b') {
6771 /* check for a decimal in disguise */
6772 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6774 /* so it must be octal */
6778 base = bases[shift];
6779 Base = Bases[shift];
6780 max = maxima[shift];
6782 /* read the rest of the number */
6784 /* x is used in the overflow test,
6785 b is the digit we're adding on. */
6790 /* if we don't mention it, we're done */
6799 /* 8 and 9 are not octal */
6802 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6806 case '2': case '3': case '4':
6807 case '5': case '6': case '7':
6809 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6813 b = *s++ & 15; /* ASCII digit -> value of digit */
6817 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6818 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6819 /* make sure they said 0x */
6824 /* Prepare to put the digit we have onto the end
6825 of the number so far. We check for overflows.
6830 x = u << shift; /* make room for the digit */
6832 if ((x >> shift) != u
6833 && !(PL_hints & HINT_NEW_BINARY)) {
6837 if (ckWARN_d(WARN_OVERFLOW))
6838 Perl_warner(aTHX_ WARN_OVERFLOW,
6839 "Integer overflow in %s number",
6842 u = x | b; /* add the digit to the end */
6845 n *= nvshift[shift];
6846 /* If an NV has not enough bits in its
6847 * mantissa to represent an UV this summing of
6848 * small low-order numbers is a waste of time
6849 * (because the NV cannot preserve the
6850 * low-order bits anyway): we could just
6851 * remember when did we overflow and in the
6852 * end just multiply n by the right
6860 /* if we get here, we had success: make a scalar value from
6867 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
6868 Perl_warner(aTHX_ WARN_PORTABLE,
6869 "%s number > %s non-portable",
6876 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
6877 Perl_warner(aTHX_ WARN_PORTABLE,
6878 "%s number > %s non-portable",
6883 if (PL_hints & HINT_NEW_BINARY)
6884 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
6889 handle decimal numbers.
6890 we're also sent here when we read a 0 as the first digit
6892 case '1': case '2': case '3': case '4': case '5':
6893 case '6': case '7': case '8': case '9': case '.':
6896 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
6899 /* read next group of digits and _ and copy into d */
6900 while (isDIGIT(*s) || *s == '_') {
6901 /* skip underscores, checking for misplaced ones
6905 dTHR; /* only for ckWARN */
6906 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
6907 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6911 /* check for end of fixed-length buffer */
6913 Perl_croak(aTHX_ number_too_long);
6914 /* if we're ok, copy the character */
6919 /* final misplaced underbar check */
6920 if (lastub && s - lastub != 3) {
6922 if (ckWARN(WARN_SYNTAX))
6923 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6926 /* read a decimal portion if there is one. avoid
6927 3..5 being interpreted as the number 3. followed
6930 if (*s == '.' && s[1] != '.') {
6934 /* copy, ignoring underbars, until we run out of
6935 digits. Note: no misplaced underbar checks!
6937 for (; isDIGIT(*s) || *s == '_'; s++) {
6938 /* fixed length buffer check */
6940 Perl_croak(aTHX_ number_too_long);
6944 if (*s == '.' && isDIGIT(s[1])) {
6945 /* oops, it's really a v-string, but without the "v" */
6951 /* read exponent part, if present */
6952 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
6956 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
6957 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
6959 /* allow positive or negative exponent */
6960 if (*s == '+' || *s == '-')
6963 /* read digits of exponent (no underbars :-) */
6964 while (isDIGIT(*s)) {
6966 Perl_croak(aTHX_ number_too_long);
6971 /* terminate the string */
6974 /* make an sv from the string */
6977 #if defined(Strtol) && defined(Strtoul)
6980 strtol/strtoll sets errno to ERANGE if the number is too big
6981 for an integer. We try to do an integer conversion first
6982 if no characters indicating "float" have been found.
6989 if (*PL_tokenbuf == '-')
6990 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
6992 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
6994 floatit = TRUE; /* Probably just too large. */
6995 else if (*PL_tokenbuf == '-')
6997 else if (uv <= IV_MAX)
6998 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7003 nv = Atof(PL_tokenbuf);
7008 No working strtou?ll?.
7010 Unfortunately atol() doesn't do range checks (returning
7011 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7012 everywhere [1], so we cannot use use atol() (or atoll()).
7013 If we could, they would be used, as Atol(), very much like
7014 Strtol() and Strtoul() are used above.
7016 [1] XXX Configure test needed to check for atol()
7017 (and atoll()) overflow behaviour XXX
7021 We need to do this the hard way. */
7023 nv = Atof(PL_tokenbuf);
7025 /* See if we can make do with an integer value without loss of
7026 precision. We use U_V to cast to a UV, because some
7027 compilers have issues. Then we try casting it back and see
7028 if it was the same [1]. We only do this if we know we
7029 specifically read an integer. If floatit is true, then we
7030 don't need to do the conversion at all.
7032 [1] Note that this is lossy if our NVs cannot preserve our
7033 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7034 and NV_PRESERVES_UV_BITS (a number), but in general we really
7035 do hope all such potentially lossy platforms have strtou?ll?
7036 to do a lossless IV/UV conversion.
7038 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7039 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7040 as NV_DIG and NV_MANT_DIG)?
7046 if (!floatit && (NV)uv == nv) {
7048 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7056 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7057 (PL_hints & HINT_NEW_INTEGER) )
7058 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7059 (floatit ? "float" : "integer"),
7063 /* if it starts with a v, it could be a v-string */
7069 while (isDIGIT(*pos) || *pos == '_')
7071 if (!isALPHA(*pos)) {
7073 U8 tmpbuf[UTF8_MAXLEN];
7076 s++; /* get past 'v' */
7079 sv_setpvn(sv, "", 0);
7082 if (*s == '0' && isDIGIT(s[1]))
7083 yyerror("Octal number in vector unsupported");
7086 /* this is atoi() that tolerates underscores */
7089 while (--end >= s) {
7094 rev += (*end - '0') * mult;
7096 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7097 Perl_warner(aTHX_ WARN_OVERFLOW,
7098 "Integer overflow in decimal number");
7101 tmpend = uv_to_utf8(tmpbuf, rev);
7102 utf8 = utf8 || rev > 127;
7103 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7104 if (*pos == '.' && isDIGIT(pos[1]))
7110 while (isDIGIT(*pos) || *pos == '_')
7118 sv_utf8_downgrade(sv, TRUE);
7125 /* make the op for the constant and return */
7128 yylval.opval = newSVOP(OP_CONST, 0, sv);
7130 yylval.opval = Nullop;
7136 S_scan_formline(pTHX_ register char *s)
7141 SV *stuff = newSVpvn("",0);
7142 bool needargs = FALSE;
7145 if (*s == '.' || *s == /*{*/'}') {
7147 #ifdef PERL_STRICT_CR
7148 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7150 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7152 if (*t == '\n' || t == PL_bufend)
7155 if (PL_in_eval && !PL_rsfp) {
7156 eol = strchr(s,'\n');
7161 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7163 for (t = s; t < eol; t++) {
7164 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7166 goto enough; /* ~~ must be first line in formline */
7168 if (*t == '@' || *t == '^')
7171 sv_catpvn(stuff, s, eol-s);
7172 #ifndef PERL_STRICT_CR
7173 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7174 char *end = SvPVX(stuff) + SvCUR(stuff);
7183 s = filter_gets(PL_linestr, PL_rsfp, 0);
7184 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7185 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7188 yyerror("Format not terminated");
7198 PL_lex_state = LEX_NORMAL;
7199 PL_nextval[PL_nexttoke].ival = 0;
7203 PL_lex_state = LEX_FORMLINE;
7204 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7206 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7210 SvREFCNT_dec(stuff);
7211 PL_lex_formbrack = 0;
7222 PL_cshlen = strlen(PL_cshname);
7227 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7230 I32 oldsavestack_ix = PL_savestack_ix;
7231 CV* outsidecv = PL_compcv;
7235 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7237 SAVEI32(PL_subline);
7238 save_item(PL_subname);
7241 SAVESPTR(PL_comppad_name);
7242 SAVESPTR(PL_compcv);
7243 SAVEI32(PL_comppad_name_fill);
7244 SAVEI32(PL_min_intro_pending);
7245 SAVEI32(PL_max_intro_pending);
7246 SAVEI32(PL_pad_reset_pending);
7248 PL_compcv = (CV*)NEWSV(1104,0);
7249 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7250 CvFLAGS(PL_compcv) |= flags;
7252 PL_comppad = newAV();
7253 av_push(PL_comppad, Nullsv);
7254 PL_curpad = AvARRAY(PL_comppad);
7255 PL_comppad_name = newAV();
7256 PL_comppad_name_fill = 0;
7257 PL_min_intro_pending = 0;
7259 PL_subline = CopLINE(PL_curcop);
7261 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7262 PL_curpad[0] = (SV*)newAV();
7263 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7264 #endif /* USE_THREADS */
7266 comppadlist = newAV();
7267 AvREAL_off(comppadlist);
7268 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7269 av_store(comppadlist, 1, (SV*)PL_comppad);
7271 CvPADLIST(PL_compcv) = comppadlist;
7272 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7274 CvOWNER(PL_compcv) = 0;
7275 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7276 MUTEX_INIT(CvMUTEXP(PL_compcv));
7277 #endif /* USE_THREADS */
7279 return oldsavestack_ix;
7283 Perl_yywarn(pTHX_ char *s)
7286 PL_in_eval |= EVAL_WARNONLY;
7288 PL_in_eval &= ~EVAL_WARNONLY;
7293 Perl_yyerror(pTHX_ char *s)
7297 char *context = NULL;
7301 if (!yychar || (yychar == ';' && !PL_rsfp))
7303 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7304 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7305 while (isSPACE(*PL_oldoldbufptr))
7307 context = PL_oldoldbufptr;
7308 contlen = PL_bufptr - PL_oldoldbufptr;
7310 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7311 PL_oldbufptr != PL_bufptr) {
7312 while (isSPACE(*PL_oldbufptr))
7314 context = PL_oldbufptr;
7315 contlen = PL_bufptr - PL_oldbufptr;
7317 else if (yychar > 255)
7318 where = "next token ???";
7319 #ifdef USE_PURE_BISON
7320 /* GNU Bison sets the value -2 */
7321 else if (yychar == -2) {
7323 else if ((yychar & 127) == 127) {
7325 if (PL_lex_state == LEX_NORMAL ||
7326 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7327 where = "at end of line";
7328 else if (PL_lex_inpat)
7329 where = "within pattern";
7331 where = "within string";
7334 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7336 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7337 else if (isPRINT_LC(yychar))
7338 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7340 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7341 where = SvPVX(where_sv);
7343 msg = sv_2mortal(newSVpv(s, 0));
7344 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7345 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7347 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7349 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7350 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7351 Perl_sv_catpvf(aTHX_ msg,
7352 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7353 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7356 if (PL_in_eval & EVAL_WARNONLY)
7357 Perl_warn(aTHX_ "%"SVf, msg);
7360 if (PL_error_count >= 10) {
7361 if (PL_in_eval && SvCUR(ERRSV))
7362 Perl_croak(aTHX_ "%_%s has too many errors.\n",
7363 ERRSV, CopFILE(PL_curcop));
7365 Perl_croak(aTHX_ "%s has too many errors.\n",
7366 CopFILE(PL_curcop));
7369 PL_in_my_stash = Nullhv;
7374 S_swallow_bom(pTHX_ U8 *s)
7377 slen = SvCUR(PL_linestr);
7381 /* UTF-16 little-endian */
7382 #ifndef PERL_NO_UTF16_FILTER
7385 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7386 Perl_croak(aTHX_ "Unsupported script encoding");
7387 #ifndef PERL_NO_UTF16_FILTER
7389 filter_add(utf16rev_textfilter, NULL);
7390 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7391 PL_bufend = (char*)utf16_to_utf8((U16*)s, news,
7392 PL_bufend - (char*)s);
7395 Perl_croak(aTHX_ "Unsupported script encoding");
7400 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7401 #ifndef PERL_NO_UTF16_FILTER
7403 filter_add(utf16_textfilter, NULL);
7404 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7405 PL_bufend = (char*)utf16_to_utf8((U16*)s, news,
7406 PL_bufend - (char*)s);
7409 Perl_croak(aTHX_ "Unsupported script encoding");
7414 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7419 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7420 s[2] == 0xFE && s[3] == 0xFF)
7422 Perl_croak(aTHX_ "Unsupported script encoding");
7434 * Restore a source filter.
7438 restore_rsfp(pTHXo_ void *f)
7440 PerlIO *fp = (PerlIO*)f;
7442 if (PL_rsfp == PerlIO_stdin())
7443 PerlIO_clearerr(PL_rsfp);
7444 else if (PL_rsfp && (PL_rsfp != fp))
7445 PerlIO_close(PL_rsfp);
7449 #ifndef PERL_NO_UTF16_FILTER
7451 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7453 I32 count = FILTER_READ(idx+1, sv, maxlen);
7457 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7458 tend = utf16_to_utf8((U16*)SvPVX(sv), tmps, SvCUR(sv));
7459 sv_usepvn(sv, (char*)tmps, tend - tmps);
7465 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7467 I32 count = FILTER_READ(idx+1, sv, maxlen);
7471 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7472 tend = utf16_to_utf8_reversed((U16*)SvPVX(sv), tmps, SvCUR(sv));
7473 sv_usepvn(sv, (char*)tmps, tend - tmps);