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() */
84 # define YYMAXLEVEL 100
86 YYSTYPE* yylval_pointer[YYMAXLEVEL];
87 int* yychar_pointer[YYMAXLEVEL];
91 # define yylval (*yylval_pointer[yyactlevel])
92 # define yychar (*yychar_pointer[yyactlevel])
93 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
95 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
100 /* CLINE is a macro that ensures PL_copline has a sane value */
105 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
108 * Convenience functions to return different tokens and prime the
109 * lexer for the next token. They all take an argument.
111 * TOKEN : generic token (used for '(', DOLSHARP, etc)
112 * OPERATOR : generic operator
113 * AOPERATOR : assignment operator
114 * PREBLOCK : beginning the block after an if, while, foreach, ...
115 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
116 * PREREF : *EXPR where EXPR is not a simple identifier
117 * TERM : expression term
118 * LOOPX : loop exiting command (goto, last, dump, etc)
119 * FTST : file test operator
120 * FUN0 : zero-argument function
121 * FUN1 : not used, except for not, which isn't a UNIOP
122 * BOop : bitwise or or xor
124 * SHop : shift operator
125 * PWop : power operator
126 * PMop : pattern-matching operator
127 * Aop : addition-level operator
128 * Mop : multiplication-level operator
129 * Eop : equality-testing operator
130 * Rop : relational operator <= != gt
132 * Also see LOP and lop() below.
135 #define TOKEN(retval) return (PL_bufptr = s,(int)retval)
136 #define OPERATOR(retval) return (PL_expect = XTERM,PL_bufptr = s,(int)retval)
137 #define AOPERATOR(retval) return ao((PL_expect = XTERM,PL_bufptr = s,(int)retval))
138 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
139 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
140 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s,(int)retval)
141 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR,PL_bufptr = s,(int)retval)
142 #define LOOPX(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
143 #define FTST(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
144 #define FUN0(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
145 #define FUN1(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
146 #define BOop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
147 #define BAop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
148 #define SHop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
149 #define PWop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
150 #define PMop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
151 #define Aop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
152 #define Mop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
153 #define Eop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
154 #define Rop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
156 /* This bit of chicanery makes a unary function followed by
157 * a parenthesis into a function with one argument, highest precedence.
159 #define UNI(f) return(yylval.ival = f, \
162 PL_last_uni = PL_oldbufptr, \
163 PL_last_lop_op = f, \
164 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
166 #define UNIBRACK(f) return(yylval.ival = f, \
168 PL_last_uni = PL_oldbufptr, \
169 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
171 /* grandfather return to old style */
172 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
177 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
178 * into an OP_ANDASSIGN or OP_ORASSIGN
182 S_ao(pTHX_ int toketype)
184 if (*PL_bufptr == '=') {
186 if (toketype == ANDAND)
187 yylval.ival = OP_ANDASSIGN;
188 else if (toketype == OROR)
189 yylval.ival = OP_ORASSIGN;
197 * When Perl expects an operator and finds something else, no_op
198 * prints the warning. It always prints "<something> found where
199 * operator expected. It prints "Missing semicolon on previous line?"
200 * if the surprise occurs at the start of the line. "do you need to
201 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
202 * where the compiler doesn't know if foo is a method call or a function.
203 * It prints "Missing operator before end of line" if there's nothing
204 * after the missing operator, or "... before <...>" if there is something
205 * after the missing operator.
209 S_no_op(pTHX_ char *what, char *s)
211 char *oldbp = PL_bufptr;
212 bool is_first = (PL_oldbufptr == PL_linestart);
218 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
220 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
221 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
223 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
224 if (t < PL_bufptr && isSPACE(*t))
225 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
226 t - PL_oldoldbufptr, PL_oldoldbufptr);
230 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
237 * Complain about missing quote/regexp/heredoc terminator.
238 * If it's called with (char *)NULL then it cauterizes the line buffer.
239 * If we're in a delimited string and the delimiter is a control
240 * character, it's reformatted into a two-char sequence like ^C.
245 S_missingterm(pTHX_ char *s)
250 char *nl = strrchr(s,'\n');
256 iscntrl(PL_multi_close)
258 PL_multi_close < 32 || PL_multi_close == 127
262 tmpbuf[1] = toCTRL(PL_multi_close);
268 *tmpbuf = PL_multi_close;
272 q = strchr(s,'"') ? '\'' : '"';
273 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
281 Perl_deprecate(pTHX_ char *s)
284 if (ckWARN(WARN_DEPRECATED))
285 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
290 * Deprecate a comma-less variable list.
296 deprecate("comma-less variable list");
300 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
301 * utf16-to-utf8-reversed.
304 #ifdef PERL_CR_FILTER
308 register char *s = SvPVX(sv);
309 register char *e = s + SvCUR(sv);
310 /* outer loop optimized to do nothing if there are no CR-LFs */
312 if (*s++ == '\r' && *s == '\n') {
313 /* hit a CR-LF, need to copy the rest */
314 register char *d = s - 1;
317 if (*s == '\r' && s[1] == '\n')
328 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
330 I32 count = FILTER_READ(idx+1, sv, maxlen);
331 if (count > 0 && !maxlen)
339 * Initialize variables. Uses the Perl save_stack to save its state (for
340 * recursive calls to the parser).
344 Perl_lex_start(pTHX_ SV *line)
350 SAVEI32(PL_lex_dojoin);
351 SAVEI32(PL_lex_brackets);
352 SAVEI32(PL_lex_casemods);
353 SAVEI32(PL_lex_starts);
354 SAVEI32(PL_lex_state);
355 SAVEVPTR(PL_lex_inpat);
356 SAVEI32(PL_lex_inwhat);
357 if (PL_lex_state == LEX_KNOWNEXT) {
358 I32 toke = PL_nexttoke;
359 while (--toke >= 0) {
360 SAVEI32(PL_nexttype[toke]);
361 SAVEVPTR(PL_nextval[toke]);
363 SAVEI32(PL_nexttoke);
365 SAVECOPLINE(PL_curcop);
368 SAVEPPTR(PL_oldbufptr);
369 SAVEPPTR(PL_oldoldbufptr);
370 SAVEPPTR(PL_linestart);
371 SAVESPTR(PL_linestr);
372 SAVEPPTR(PL_lex_brackstack);
373 SAVEPPTR(PL_lex_casestack);
374 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
375 SAVESPTR(PL_lex_stuff);
376 SAVEI32(PL_lex_defer);
377 SAVEI32(PL_sublex_info.sub_inwhat);
378 SAVESPTR(PL_lex_repl);
380 SAVEINT(PL_lex_expect);
382 PL_lex_state = LEX_NORMAL;
386 New(899, PL_lex_brackstack, 120, char);
387 New(899, PL_lex_casestack, 12, char);
388 SAVEFREEPV(PL_lex_brackstack);
389 SAVEFREEPV(PL_lex_casestack);
391 *PL_lex_casestack = '\0';
394 PL_lex_stuff = Nullsv;
395 PL_lex_repl = Nullsv;
399 PL_sublex_info.sub_inwhat = 0;
401 if (SvREADONLY(PL_linestr))
402 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
403 s = SvPV(PL_linestr, len);
404 if (len && s[len-1] != ';') {
405 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
406 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
407 sv_catpvn(PL_linestr, "\n;", 2);
409 SvTEMP_off(PL_linestr);
410 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
411 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
413 PL_rs = newSVpvn("\n", 1);
419 * Finalizer for lexing operations. Must be called when the parser is
420 * done with the lexer.
426 PL_doextract = FALSE;
431 * This subroutine has nothing to do with tilting, whether at windmills
432 * or pinball tables. Its name is short for "increment line". It
433 * increments the current line number in CopLINE(PL_curcop) and checks
434 * to see whether the line starts with a comment of the form
435 * # line 500 "foo.pm"
436 * If so, it sets the current line number and file to the values in the comment.
440 S_incline(pTHX_ char *s)
448 CopLINE_inc(PL_curcop);
451 while (SPACE_OR_TAB(*s)) s++;
452 if (strnEQ(s, "line", 4))
456 if (*s == ' ' || *s == '\t')
460 while (SPACE_OR_TAB(*s)) s++;
466 while (SPACE_OR_TAB(*s))
468 if (*s == '"' && (t = strchr(s+1, '"'))) {
473 for (t = s; !isSPACE(*t); t++) ;
476 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
478 if (*e != '\n' && *e != '\0')
479 return; /* false alarm */
485 Safefree(CopFILE(PL_curcop));
487 SvREFCNT_dec(CopFILEGV(PL_curcop));
489 CopFILE_set(PL_curcop, s);
492 CopLINE_set(PL_curcop, atoi(n)-1);
497 * Called to gobble the appropriate amount and type of whitespace.
498 * Skips comments as well.
502 S_skipspace(pTHX_ register char *s)
505 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
506 while (s < PL_bufend && SPACE_OR_TAB(*s))
512 SSize_t oldprevlen, oldoldprevlen;
513 SSize_t oldloplen, oldunilen;
514 while (s < PL_bufend && isSPACE(*s)) {
515 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
520 if (s < PL_bufend && *s == '#') {
521 while (s < PL_bufend && *s != '\n')
525 if (PL_in_eval && !PL_rsfp) {
532 /* only continue to recharge the buffer if we're at the end
533 * of the buffer, we're not reading from a source filter, and
534 * we're in normal lexing mode
536 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
537 PL_lex_state == LEX_FORMLINE)
540 /* try to recharge the buffer */
541 if ((s = filter_gets(PL_linestr, PL_rsfp,
542 (prevlen = SvCUR(PL_linestr)))) == Nullch)
544 /* end of file. Add on the -p or -n magic */
545 if (PL_minus_n || PL_minus_p) {
546 sv_setpv(PL_linestr,PL_minus_p ?
547 ";}continue{print or die qq(-p destination: $!\\n)" :
549 sv_catpv(PL_linestr,";}");
550 PL_minus_n = PL_minus_p = 0;
553 sv_setpv(PL_linestr,";");
555 /* reset variables for next time we lex */
556 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
558 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
560 /* Close the filehandle. Could be from -P preprocessor,
561 * STDIN, or a regular file. If we were reading code from
562 * STDIN (because the commandline held no -e or filename)
563 * then we don't close it, we reset it so the code can
564 * read from STDIN too.
567 if (PL_preprocess && !PL_in_eval)
568 (void)PerlProc_pclose(PL_rsfp);
569 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
570 PerlIO_clearerr(PL_rsfp);
572 (void)PerlIO_close(PL_rsfp);
577 /* not at end of file, so we only read another line */
578 /* make corresponding updates to old pointers, for yyerror() */
579 oldprevlen = PL_oldbufptr - PL_bufend;
580 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
582 oldunilen = PL_last_uni - PL_bufend;
584 oldloplen = PL_last_lop - PL_bufend;
585 PL_linestart = PL_bufptr = s + prevlen;
586 PL_bufend = s + SvCUR(PL_linestr);
588 PL_oldbufptr = s + oldprevlen;
589 PL_oldoldbufptr = s + oldoldprevlen;
591 PL_last_uni = s + oldunilen;
593 PL_last_lop = s + oldloplen;
596 /* debugger active and we're not compiling the debugger code,
597 * so store the line into the debugger's array of lines
599 if (PERLDB_LINE && PL_curstash != PL_debstash) {
600 SV *sv = NEWSV(85,0);
602 sv_upgrade(sv, SVt_PVMG);
603 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
604 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
611 * Check the unary operators to ensure there's no ambiguity in how they're
612 * used. An ambiguous piece of code would be:
614 * This doesn't mean rand() + 5. Because rand() is a unary operator,
615 * the +5 is its argument.
625 if (PL_oldoldbufptr != PL_last_uni)
627 while (isSPACE(*PL_last_uni))
629 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
630 if ((t = strchr(s, '(')) && t < PL_bufptr)
632 if (ckWARN_d(WARN_AMBIGUOUS)){
635 Perl_warner(aTHX_ WARN_AMBIGUOUS,
636 "Warning: Use of \"%s\" without parens is ambiguous",
642 /* workaround to replace the UNI() macro with a function. Only the
643 * hints/uts.sh file mentions this. Other comments elsewhere in the
644 * source indicate Microport Unix might need it too.
650 #define UNI(f) return uni(f,s)
653 S_uni(pTHX_ I32 f, char *s)
658 PL_last_uni = PL_oldbufptr;
669 #endif /* CRIPPLED_CC */
672 * LOP : macro to build a list operator. Its behaviour has been replaced
673 * with a subroutine, S_lop() for which LOP is just another name.
676 #define LOP(f,x) return lop(f,x,s)
680 * Build a list operator (or something that might be one). The rules:
681 * - if we have a next token, then it's a list operator [why?]
682 * - if the next thing is an opening paren, then it's a function
683 * - else it's a list operator
687 S_lop(pTHX_ I32 f, int x, char *s)
694 PL_last_lop = PL_oldbufptr;
709 * When the lexer realizes it knows the next token (for instance,
710 * it is reordering tokens for the parser) then it can call S_force_next
711 * to know what token to return the next time the lexer is called. Caller
712 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
713 * handles the token correctly.
717 S_force_next(pTHX_ I32 type)
719 PL_nexttype[PL_nexttoke] = type;
721 if (PL_lex_state != LEX_KNOWNEXT) {
722 PL_lex_defer = PL_lex_state;
723 PL_lex_expect = PL_expect;
724 PL_lex_state = LEX_KNOWNEXT;
730 * When the lexer knows the next thing is a word (for instance, it has
731 * just seen -> and it knows that the next char is a word char, then
732 * it calls S_force_word to stick the next word into the PL_next lookahead.
735 * char *start : buffer position (must be within PL_linestr)
736 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
737 * int check_keyword : if true, Perl checks to make sure the word isn't
738 * a keyword (do this if the word is a label, e.g. goto FOO)
739 * int allow_pack : if true, : characters will also be allowed (require,
741 * int allow_initial_tick : used by the "sub" lexer only.
745 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
750 start = skipspace(start);
752 if (isIDFIRST_lazy_if(s,UTF) ||
753 (allow_pack && *s == ':') ||
754 (allow_initial_tick && *s == '\'') )
756 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
757 if (check_keyword && keyword(PL_tokenbuf, len))
759 if (token == METHOD) {
764 PL_expect = XOPERATOR;
767 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
768 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
776 * Called when the lexer wants $foo *foo &foo etc, but the program
777 * text only contains the "foo" portion. The first argument is a pointer
778 * to the "foo", and the second argument is the type symbol to prefix.
779 * Forces the next token to be a "WORD".
780 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
784 S_force_ident(pTHX_ register char *s, int kind)
787 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
788 PL_nextval[PL_nexttoke].opval = o;
791 dTHR; /* just for in_eval */
792 o->op_private = OPpCONST_ENTERED;
793 /* XXX see note in pp_entereval() for why we forgo typo
794 warnings if the symbol must be introduced in an eval.
796 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
797 kind == '$' ? SVt_PV :
798 kind == '@' ? SVt_PVAV :
799 kind == '%' ? SVt_PVHV :
807 Perl_str_to_version(pTHX_ SV *sv)
812 char *start = SvPVx(sv,len);
813 bool utf = SvUTF8(sv) ? TRUE : FALSE;
814 char *end = start + len;
815 while (start < end) {
819 n = utf8_to_uv((U8*)start, len, &skip, 0);
824 retval += ((NV)n)/nshift;
833 * Forces the next token to be a version number.
837 S_force_version(pTHX_ char *s)
839 OP *version = Nullop;
848 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
849 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
851 s = scan_num(s, &yylval);
852 version = yylval.opval;
853 ver = cSVOPx(version)->op_sv;
854 if (SvPOK(ver) && !SvNIOK(ver)) {
855 (void)SvUPGRADE(ver, SVt_PVNV);
856 SvNVX(ver) = str_to_version(ver);
857 SvNOK_on(ver); /* hint that it is a version */
862 /* NOTE: The parser sees the package name and the VERSION swapped */
863 PL_nextval[PL_nexttoke].opval = version;
871 * Tokenize a quoted string passed in as an SV. It finds the next
872 * chunk, up to end of string or a backslash. It may make a new
873 * SV containing that chunk (if HINT_NEW_STRING is on). It also
878 S_tokeq(pTHX_ SV *sv)
889 s = SvPV_force(sv, len);
890 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
893 while (s < send && *s != '\\')
898 if ( PL_hints & HINT_NEW_STRING )
899 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
902 if (s + 1 < send && (s[1] == '\\'))
903 s++; /* all that, just for this */
908 SvCUR_set(sv, d - SvPVX(sv));
910 if ( PL_hints & HINT_NEW_STRING )
911 return new_constant(NULL, 0, "q", sv, pv, "q");
916 * Now come three functions related to double-quote context,
917 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
918 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
919 * interact with PL_lex_state, and create fake ( ... ) argument lists
920 * to handle functions and concatenation.
921 * They assume that whoever calls them will be setting up a fake
922 * join call, because each subthing puts a ',' after it. This lets
925 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
927 * (I'm not sure whether the spurious commas at the end of lcfirst's
928 * arguments and join's arguments are created or not).
933 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
935 * Pattern matching will set PL_lex_op to the pattern-matching op to
936 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
938 * OP_CONST and OP_READLINE are easy--just make the new op and return.
940 * Everything else becomes a FUNC.
942 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
943 * had an OP_CONST or OP_READLINE). This just sets us up for a
944 * call to S_sublex_push().
950 register I32 op_type = yylval.ival;
952 if (op_type == OP_NULL) {
953 yylval.opval = PL_lex_op;
957 if (op_type == OP_CONST || op_type == OP_READLINE) {
958 SV *sv = tokeq(PL_lex_stuff);
960 if (SvTYPE(sv) == SVt_PVIV) {
961 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
967 nsv = newSVpvn(p, len);
973 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
974 PL_lex_stuff = Nullsv;
978 PL_sublex_info.super_state = PL_lex_state;
979 PL_sublex_info.sub_inwhat = op_type;
980 PL_sublex_info.sub_op = PL_lex_op;
981 PL_lex_state = LEX_INTERPPUSH;
985 yylval.opval = PL_lex_op;
995 * Create a new scope to save the lexing state. The scope will be
996 * ended in S_sublex_done. Returns a '(', starting the function arguments
997 * to the uc, lc, etc. found before.
998 * Sets PL_lex_state to LEX_INTERPCONCAT.
1007 PL_lex_state = PL_sublex_info.super_state;
1008 SAVEI32(PL_lex_dojoin);
1009 SAVEI32(PL_lex_brackets);
1010 SAVEI32(PL_lex_casemods);
1011 SAVEI32(PL_lex_starts);
1012 SAVEI32(PL_lex_state);
1013 SAVEVPTR(PL_lex_inpat);
1014 SAVEI32(PL_lex_inwhat);
1015 SAVECOPLINE(PL_curcop);
1016 SAVEPPTR(PL_bufptr);
1017 SAVEPPTR(PL_oldbufptr);
1018 SAVEPPTR(PL_oldoldbufptr);
1019 SAVEPPTR(PL_linestart);
1020 SAVESPTR(PL_linestr);
1021 SAVEPPTR(PL_lex_brackstack);
1022 SAVEPPTR(PL_lex_casestack);
1024 PL_linestr = PL_lex_stuff;
1025 PL_lex_stuff = Nullsv;
1027 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1028 = SvPVX(PL_linestr);
1029 PL_bufend += SvCUR(PL_linestr);
1030 SAVEFREESV(PL_linestr);
1032 PL_lex_dojoin = FALSE;
1033 PL_lex_brackets = 0;
1034 New(899, PL_lex_brackstack, 120, char);
1035 New(899, PL_lex_casestack, 12, char);
1036 SAVEFREEPV(PL_lex_brackstack);
1037 SAVEFREEPV(PL_lex_casestack);
1038 PL_lex_casemods = 0;
1039 *PL_lex_casestack = '\0';
1041 PL_lex_state = LEX_INTERPCONCAT;
1042 CopLINE_set(PL_curcop, PL_multi_start);
1044 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1045 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1046 PL_lex_inpat = PL_sublex_info.sub_op;
1048 PL_lex_inpat = Nullop;
1055 * Restores lexer state after a S_sublex_push.
1061 if (!PL_lex_starts++) {
1062 PL_expect = XOPERATOR;
1063 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn("",0));
1067 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1068 PL_lex_state = LEX_INTERPCASEMOD;
1072 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1073 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1074 PL_linestr = PL_lex_repl;
1076 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1077 PL_bufend += SvCUR(PL_linestr);
1078 SAVEFREESV(PL_linestr);
1079 PL_lex_dojoin = FALSE;
1080 PL_lex_brackets = 0;
1081 PL_lex_casemods = 0;
1082 *PL_lex_casestack = '\0';
1084 if (SvEVALED(PL_lex_repl)) {
1085 PL_lex_state = LEX_INTERPNORMAL;
1087 /* we don't clear PL_lex_repl here, so that we can check later
1088 whether this is an evalled subst; that means we rely on the
1089 logic to ensure sublex_done() is called again only via the
1090 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1093 PL_lex_state = LEX_INTERPCONCAT;
1094 PL_lex_repl = Nullsv;
1100 PL_bufend = SvPVX(PL_linestr);
1101 PL_bufend += SvCUR(PL_linestr);
1102 PL_expect = XOPERATOR;
1103 PL_sublex_info.sub_inwhat = 0;
1111 Extracts a pattern, double-quoted string, or transliteration. This
1114 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1115 processing a pattern (PL_lex_inpat is true), a transliteration
1116 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1118 Returns a pointer to the character scanned up to. Iff this is
1119 advanced from the start pointer supplied (ie if anything was
1120 successfully parsed), will leave an OP for the substring scanned
1121 in yylval. Caller must intuit reason for not parsing further
1122 by looking at the next characters herself.
1126 double-quoted style: \r and \n
1127 regexp special ones: \D \s
1129 backrefs: \1 (deprecated in substitution replacements)
1130 case and quoting: \U \Q \E
1131 stops on @ and $, but not for $ as tail anchor
1133 In transliterations:
1134 characters are VERY literal, except for - not at the start or end
1135 of the string, which indicates a range. scan_const expands the
1136 range to the full set of intermediate characters.
1138 In double-quoted strings:
1140 double-quoted style: \r and \n
1142 backrefs: \1 (deprecated)
1143 case and quoting: \U \Q \E
1146 scan_const does *not* construct ops to handle interpolated strings.
1147 It stops processing as soon as it finds an embedded $ or @ variable
1148 and leaves it to the caller to work out what's going on.
1150 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1152 $ in pattern could be $foo or could be tail anchor. Assumption:
1153 it's a tail anchor if $ is the last thing in the string, or if it's
1154 followed by one of ")| \n\t"
1156 \1 (backreferences) are turned into $1
1158 The structure of the code is
1159 while (there's a character to process) {
1160 handle transliteration ranges
1161 skip regexp comments
1162 skip # initiated comments in //x patterns
1163 check for embedded @foo
1164 check for embedded scalars
1166 leave intact backslashes from leave (below)
1167 deprecate \1 in strings and sub replacements
1168 handle string-changing backslashes \l \U \Q \E, etc.
1169 switch (what was escaped) {
1170 handle - in a transliteration (becomes a literal -)
1171 handle \132 octal characters
1172 handle 0x15 hex characters
1173 handle \cV (control V)
1174 handle printf backslashes (\f, \r, \n, etc)
1176 } (end if backslash)
1177 } (end while character to read)
1182 S_scan_const(pTHX_ char *start)
1184 register char *send = PL_bufend; /* end of the constant */
1185 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1186 register char *s = start; /* start of the constant */
1187 register char *d = SvPVX(sv); /* destination for copies */
1188 bool dorange = FALSE; /* are we in a translit range? */
1189 bool didrange = FALSE; /* did we just finish a range? */
1190 bool has_utf8 = FALSE; /* embedded \x{} */
1193 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1194 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1196 I32 this_utf8 = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1197 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1198 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
1200 const char *leaveit = /* set of acceptably-backslashed characters */
1202 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1205 while (s < send || dorange) {
1206 /* get transliterations out of the way (they're most literal) */
1207 if (PL_lex_inwhat == OP_TRANS) {
1208 /* expand a range A-Z to the full set of characters. AIE! */
1210 I32 i; /* current expanded character */
1211 I32 min; /* first character in range */
1212 I32 max; /* last character in range */
1214 i = d - SvPVX(sv); /* remember current offset */
1215 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1216 d = SvPVX(sv) + i; /* refresh d after realloc */
1217 d -= 2; /* eat the first char and the - */
1219 min = (U8)*d; /* first char in range */
1220 max = (U8)d[1]; /* last char in range */
1224 "Invalid [] range \"%c-%c\" in transliteration operator",
1225 (char)min, (char)max);
1229 if ((isLOWER(min) && isLOWER(max)) ||
1230 (isUPPER(min) && isUPPER(max))) {
1232 for (i = min; i <= max; i++)
1236 for (i = min; i <= max; i++)
1243 for (i = min; i <= max; i++)
1246 /* mark the range as done, and continue */
1252 /* range begins (ignore - as first or last char) */
1253 else if (*s == '-' && s+1 < send && s != start) {
1255 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1258 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
1270 /* if we get here, we're not doing a transliteration */
1272 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1273 except for the last char, which will be done separately. */
1274 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1276 while (s < send && *s != ')')
1279 else if (s[2] == '{' /* This should match regcomp.c */
1280 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1283 char *regparse = s + (s[2] == '{' ? 3 : 4);
1286 while (count && (c = *regparse)) {
1287 if (c == '\\' && regparse[1])
1295 if (*regparse != ')') {
1296 regparse--; /* Leave one char for continuation. */
1297 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1299 while (s < regparse)
1304 /* likewise skip #-initiated comments in //x patterns */
1305 else if (*s == '#' && PL_lex_inpat &&
1306 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1307 while (s+1 < send && *s != '\n')
1311 /* check for embedded arrays
1312 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1314 else if (*s == '@' && s[1]
1315 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1318 /* check for embedded scalars. only stop if we're sure it's a
1321 else if (*s == '$') {
1322 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1324 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1325 break; /* in regexp, $ might be tail anchor */
1328 /* (now in tr/// code again) */
1330 if (*s & 0x80 && this_utf8) {
1334 uv = utf8_to_uv((U8*)s, send - s, &len, UTF8_CHECK_ONLY);
1336 /* Illegal UTF8 (a high-bit byte), make it valid. */
1337 char *old_pvx = SvPVX(sv);
1338 /* need space for one extra char (NOTE: SvCUR() not set here) */
1339 d = SvGROW(sv, SvLEN(sv) + 1) + (d - old_pvx);
1340 d = (char*)uv_to_utf8((U8*)d, (U8)*s++);
1351 if (*s == '\\' && s+1 < send) {
1354 /* some backslashes we leave behind */
1355 if (*leaveit && *s && strchr(leaveit, *s)) {
1361 /* deprecate \1 in strings and substitution replacements */
1362 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1363 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1365 dTHR; /* only for ckWARN */
1366 if (ckWARN(WARN_SYNTAX))
1367 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1372 /* string-change backslash escapes */
1373 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1378 /* if we get here, it's either a quoted -, or a digit */
1381 /* quoted - in transliterations */
1383 if (PL_lex_inwhat == OP_TRANS) {
1391 if (ckWARN(WARN_MISC) && isALNUM(*s))
1392 Perl_warner(aTHX_ WARN_MISC,
1393 "Unrecognized escape \\%c passed through",
1395 /* default action is to copy the quoted character */
1400 /* \132 indicates an octal constant */
1401 case '0': case '1': case '2': case '3':
1402 case '4': case '5': case '6': case '7':
1404 STRLEN len = 0; /* disallow underscores */
1405 uv = (UV)scan_oct(s, 3, &len);
1408 goto NUM_ESCAPE_INSERT;
1410 /* \x24 indicates a hex constant */
1414 char* e = strchr(s, '}');
1416 yyerror("Missing right brace on \\x{}");
1420 STRLEN len = 1; /* allow underscores */
1421 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1428 STRLEN len = 0; /* disallow underscores */
1429 uv = (UV)scan_hex(s, 2, &len);
1435 /* Insert oct or hex escaped character.
1436 * There will always enough room in sv since such escapes will
1437 * be longer than any utf8 sequence they can end up as
1439 if (uv > 127 || has_utf8) {
1440 if (!this_utf8 && !has_utf8 && uv > 255) {
1441 /* might need to recode whatever we have accumulated so far
1442 * if it contains any hibit chars
1446 for (c = SvPVX(sv); c < d; c++) {
1451 char *old_pvx = SvPVX(sv);
1453 d = SvGROW(sv, SvCUR(sv) + hicount + 1) + (d - old_pvx);
1462 uv_to_utf8((U8*)dst, (U8)*src--);
1472 if (has_utf8 || uv > 255) {
1473 d = (char*)uv_to_utf8((U8*)d, uv);
1485 /* \N{latin small letter a} is a named character */
1489 char* e = strchr(s, '}');
1495 yyerror("Missing right brace on \\N{}");
1499 res = newSVpvn(s + 1, e - s - 1);
1500 res = new_constant( Nullch, 0, "charnames",
1501 res, Nullsv, "\\N{...}" );
1502 str = SvPV(res,len);
1503 if (!has_utf8 && SvUTF8(res)) {
1504 char *ostart = SvPVX(sv);
1505 SvCUR_set(sv, d - ostart);
1508 sv_utf8_upgrade(sv);
1509 /* this just broke our allocation above... */
1510 SvGROW(sv, send - start);
1511 d = SvPVX(sv) + SvCUR(sv);
1514 if (len > e - s + 4) {
1515 char *odest = SvPVX(sv);
1517 SvGROW(sv, (SvCUR(sv) + len - (e - s + 4)));
1518 d = SvPVX(sv) + (d - odest);
1520 Copy(str, d, len, char);
1527 yyerror("Missing braces on \\N{}");
1530 /* \c is a control character */
1547 /* printf-style backslashes, formfeeds, newlines, etc */
1565 *d++ = '\047'; /* CP 1047 */
1568 *d++ = '\057'; /* CP 1047 */
1582 } /* end if (backslash) */
1585 } /* while loop to process each character */
1587 /* terminate the string and set up the sv */
1589 SvCUR_set(sv, d - SvPVX(sv));
1594 /* shrink the sv if we allocated more than we used */
1595 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1596 SvLEN_set(sv, SvCUR(sv) + 1);
1597 Renew(SvPVX(sv), SvLEN(sv), char);
1600 /* return the substring (via yylval) only if we parsed anything */
1601 if (s > PL_bufptr) {
1602 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1603 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1605 ( PL_lex_inwhat == OP_TRANS
1607 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1610 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1617 * Returns TRUE if there's more to the expression (e.g., a subscript),
1620 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1622 * ->[ and ->{ return TRUE
1623 * { and [ outside a pattern are always subscripts, so return TRUE
1624 * if we're outside a pattern and it's not { or [, then return FALSE
1625 * if we're in a pattern and the first char is a {
1626 * {4,5} (any digits around the comma) returns FALSE
1627 * if we're in a pattern and the first char is a [
1629 * [SOMETHING] has a funky algorithm to decide whether it's a
1630 * character class or not. It has to deal with things like
1631 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1632 * anything else returns TRUE
1635 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1638 S_intuit_more(pTHX_ register char *s)
1640 if (PL_lex_brackets)
1642 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1644 if (*s != '{' && *s != '[')
1649 /* In a pattern, so maybe we have {n,m}. */
1666 /* On the other hand, maybe we have a character class */
1669 if (*s == ']' || *s == '^')
1672 /* this is terrifying, and it works */
1673 int weight = 2; /* let's weigh the evidence */
1675 unsigned char un_char = 255, last_un_char;
1676 char *send = strchr(s,']');
1677 char tmpbuf[sizeof PL_tokenbuf * 4];
1679 if (!send) /* has to be an expression */
1682 Zero(seen,256,char);
1685 else if (isDIGIT(*s)) {
1687 if (isDIGIT(s[1]) && s[2] == ']')
1693 for (; s < send; s++) {
1694 last_un_char = un_char;
1695 un_char = (unsigned char)*s;
1700 weight -= seen[un_char] * 10;
1701 if (isALNUM_lazy_if(s+1,UTF)) {
1702 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1703 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1708 else if (*s == '$' && s[1] &&
1709 strchr("[#!%*<>()-=",s[1])) {
1710 if (/*{*/ strchr("])} =",s[2]))
1719 if (strchr("wds]",s[1]))
1721 else if (seen['\''] || seen['"'])
1723 else if (strchr("rnftbxcav",s[1]))
1725 else if (isDIGIT(s[1])) {
1727 while (s[1] && isDIGIT(s[1]))
1737 if (strchr("aA01! ",last_un_char))
1739 if (strchr("zZ79~",s[1]))
1741 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1742 weight -= 5; /* cope with negative subscript */
1745 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1746 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1751 if (keyword(tmpbuf, d - tmpbuf))
1754 if (un_char == last_un_char + 1)
1756 weight -= seen[un_char];
1761 if (weight >= 0) /* probably a character class */
1771 * Does all the checking to disambiguate
1773 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1774 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1776 * First argument is the stuff after the first token, e.g. "bar".
1778 * Not a method if bar is a filehandle.
1779 * Not a method if foo is a subroutine prototyped to take a filehandle.
1780 * Not a method if it's really "Foo $bar"
1781 * Method if it's "foo $bar"
1782 * Not a method if it's really "print foo $bar"
1783 * Method if it's really "foo package::" (interpreted as package->foo)
1784 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1785 * Not a method if bar is a filehandle or package, but is quoted with
1790 S_intuit_method(pTHX_ char *start, GV *gv)
1792 char *s = start + (*start == '$');
1793 char tmpbuf[sizeof PL_tokenbuf];
1801 if ((cv = GvCVu(gv))) {
1802 char *proto = SvPVX(cv);
1812 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1813 /* start is the beginning of the possible filehandle/object,
1814 * and s is the end of it
1815 * tmpbuf is a copy of it
1818 if (*start == '$') {
1819 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1824 return *s == '(' ? FUNCMETH : METHOD;
1826 if (!keyword(tmpbuf, len)) {
1827 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1832 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1833 if (indirgv && GvCVu(indirgv))
1835 /* filehandle or package name makes it a method */
1836 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1838 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1839 return 0; /* no assumptions -- "=>" quotes bearword */
1841 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1842 newSVpvn(tmpbuf,len));
1843 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1847 return *s == '(' ? FUNCMETH : METHOD;
1855 * Return a string of Perl code to load the debugger. If PERL5DB
1856 * is set, it will return the contents of that, otherwise a
1857 * compile-time require of perl5db.pl.
1864 char *pdb = PerlEnv_getenv("PERL5DB");
1868 SETERRNO(0,SS$_NORMAL);
1869 return "BEGIN { require 'perl5db.pl' }";
1875 /* Encoded script support. filter_add() effectively inserts a
1876 * 'pre-processing' function into the current source input stream.
1877 * Note that the filter function only applies to the current source file
1878 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1880 * The datasv parameter (which may be NULL) can be used to pass
1881 * private data to this instance of the filter. The filter function
1882 * can recover the SV using the FILTER_DATA macro and use it to
1883 * store private buffers and state information.
1885 * The supplied datasv parameter is upgraded to a PVIO type
1886 * and the IoDIRP/IoANY field is used to store the function pointer,
1887 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1888 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1889 * private use must be set using malloc'd pointers.
1893 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1898 if (!PL_rsfp_filters)
1899 PL_rsfp_filters = newAV();
1901 datasv = NEWSV(255,0);
1902 if (!SvUPGRADE(datasv, SVt_PVIO))
1903 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1904 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1905 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1906 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1907 funcp, SvPV_nolen(datasv)));
1908 av_unshift(PL_rsfp_filters, 1);
1909 av_store(PL_rsfp_filters, 0, datasv) ;
1914 /* Delete most recently added instance of this filter function. */
1916 Perl_filter_del(pTHX_ filter_t funcp)
1919 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1920 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1922 /* if filter is on top of stack (usual case) just pop it off */
1923 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1924 if (IoANY(datasv) == (void *)funcp) {
1925 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1926 IoANY(datasv) = (void *)NULL;
1927 sv_free(av_pop(PL_rsfp_filters));
1931 /* we need to search for the correct entry and clear it */
1932 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1936 /* Invoke the n'th filter function for the current rsfp. */
1938 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1941 /* 0 = read one text line */
1946 if (!PL_rsfp_filters)
1948 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
1949 /* Provide a default input filter to make life easy. */
1950 /* Note that we append to the line. This is handy. */
1951 DEBUG_P(PerlIO_printf(Perl_debug_log,
1952 "filter_read %d: from rsfp\n", idx));
1956 int old_len = SvCUR(buf_sv) ;
1958 /* ensure buf_sv is large enough */
1959 SvGROW(buf_sv, old_len + maxlen) ;
1960 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
1961 if (PerlIO_error(PL_rsfp))
1962 return -1; /* error */
1964 return 0 ; /* end of file */
1966 SvCUR_set(buf_sv, old_len + len) ;
1969 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
1970 if (PerlIO_error(PL_rsfp))
1971 return -1; /* error */
1973 return 0 ; /* end of file */
1976 return SvCUR(buf_sv);
1978 /* Skip this filter slot if filter has been deleted */
1979 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
1980 DEBUG_P(PerlIO_printf(Perl_debug_log,
1981 "filter_read %d: skipped (filter deleted)\n",
1983 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
1985 /* Get function pointer hidden within datasv */
1986 funcp = (filter_t)IoANY(datasv);
1987 DEBUG_P(PerlIO_printf(Perl_debug_log,
1988 "filter_read %d: via function %p (%s)\n",
1989 idx, funcp, SvPV_nolen(datasv)));
1990 /* Call function. The function is expected to */
1991 /* call "FILTER_READ(idx+1, buf_sv)" first. */
1992 /* Return: <0:error, =0:eof, >0:not eof */
1993 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
1997 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
1999 #ifdef PERL_CR_FILTER
2000 if (!PL_rsfp_filters) {
2001 filter_add(S_cr_textfilter,NULL);
2004 if (PL_rsfp_filters) {
2007 SvCUR_set(sv, 0); /* start with empty line */
2008 if (FILTER_READ(0, sv, 0) > 0)
2009 return ( SvPVX(sv) ) ;
2014 return (sv_gets(sv, fp, append));
2018 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2022 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2026 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2027 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2029 return GvHV(gv); /* Foo:: */
2032 /* use constant CLASS => 'MyClass' */
2033 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2035 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2036 pkgname = SvPV_nolen(sv);
2040 return gv_stashpv(pkgname, FALSE);
2044 static char* exp_name[] =
2045 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2046 "ATTRTERM", "TERMBLOCK"
2053 Works out what to call the token just pulled out of the input
2054 stream. The yacc parser takes care of taking the ops we return and
2055 stitching them into a tree.
2061 if read an identifier
2062 if we're in a my declaration
2063 croak if they tried to say my($foo::bar)
2064 build the ops for a my() declaration
2065 if it's an access to a my() variable
2066 are we in a sort block?
2067 croak if my($a); $a <=> $b
2068 build ops for access to a my() variable
2069 if in a dq string, and they've said @foo and we can't find @foo
2071 build ops for a bareword
2072 if we already built the token before, use it.
2075 #ifdef USE_PURE_BISON
2077 #pragma segment Perl_yylex_r
2080 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2085 yylval_pointer[yyactlevel] = lvalp;
2086 yychar_pointer[yyactlevel] = lcharp;
2088 if (yyactlevel >= YYMAXLEVEL)
2089 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2091 r = Perl_yylex(aTHX);
2100 #pragma segment Perl_yylex
2104 #ifdef USE_PURE_BISON
2105 Perl_yylex(pTHX_ YYSTYPE *lvalp, int *lcharp)
2118 /* check if there's an identifier for us to look at */
2119 if (PL_pending_ident) {
2120 /* pit holds the identifier we read and pending_ident is reset */
2121 char pit = PL_pending_ident;
2122 PL_pending_ident = 0;
2124 /* if we're in a my(), we can't allow dynamics here.
2125 $foo'bar has already been turned into $foo::bar, so
2126 just check for colons.
2128 if it's a legal name, the OP is a PADANY.
2131 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2132 if (strchr(PL_tokenbuf,':'))
2133 yyerror(Perl_form(aTHX_ "No package name allowed for "
2134 "variable %s in \"our\"",
2136 tmp = pad_allocmy(PL_tokenbuf);
2139 if (strchr(PL_tokenbuf,':'))
2140 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2142 yylval.opval = newOP(OP_PADANY, 0);
2143 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2149 build the ops for accesses to a my() variable.
2151 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2152 then used in a comparison. This catches most, but not
2153 all cases. For instance, it catches
2154 sort { my($a); $a <=> $b }
2156 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2157 (although why you'd do that is anyone's guess).
2160 if (!strchr(PL_tokenbuf,':')) {
2162 /* Check for single character per-thread SVs */
2163 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2164 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2165 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2167 yylval.opval = newOP(OP_THREADSV, 0);
2168 yylval.opval->op_targ = tmp;
2171 #endif /* USE_THREADS */
2172 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2173 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2174 /* might be an "our" variable" */
2175 if (SvFLAGS(namesv) & SVpad_OUR) {
2176 /* build ops for a bareword */
2177 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2178 sv_catpvn(sym, "::", 2);
2179 sv_catpv(sym, PL_tokenbuf+1);
2180 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2181 yylval.opval->op_private = OPpCONST_ENTERED;
2182 gv_fetchpv(SvPVX(sym),
2184 ? (GV_ADDMULTI | GV_ADDINEVAL)
2187 ((PL_tokenbuf[0] == '$') ? SVt_PV
2188 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2193 /* if it's a sort block and they're naming $a or $b */
2194 if (PL_last_lop_op == OP_SORT &&
2195 PL_tokenbuf[0] == '$' &&
2196 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2199 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2200 d < PL_bufend && *d != '\n';
2203 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2204 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2210 yylval.opval = newOP(OP_PADANY, 0);
2211 yylval.opval->op_targ = tmp;
2217 Whine if they've said @foo in a doublequoted string,
2218 and @foo isn't a variable we can find in the symbol
2221 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2222 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2223 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2224 && ckWARN(WARN_AMBIGUOUS))
2226 /* Downgraded from fatal to warning 20000522 mjd */
2227 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2228 "Possible unintended interpolation of %s in string",
2233 /* build ops for a bareword */
2234 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2235 yylval.opval->op_private = OPpCONST_ENTERED;
2236 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2237 ((PL_tokenbuf[0] == '$') ? SVt_PV
2238 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2243 /* no identifier pending identification */
2245 switch (PL_lex_state) {
2247 case LEX_NORMAL: /* Some compilers will produce faster */
2248 case LEX_INTERPNORMAL: /* code if we comment these out. */
2252 /* when we've already built the next token, just pull it out of the queue */
2255 yylval = PL_nextval[PL_nexttoke];
2257 PL_lex_state = PL_lex_defer;
2258 PL_expect = PL_lex_expect;
2259 PL_lex_defer = LEX_NORMAL;
2261 return(PL_nexttype[PL_nexttoke]);
2263 /* interpolated case modifiers like \L \U, including \Q and \E.
2264 when we get here, PL_bufptr is at the \
2266 case LEX_INTERPCASEMOD:
2268 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2269 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2271 /* handle \E or end of string */
2272 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2276 if (PL_lex_casemods) {
2277 oldmod = PL_lex_casestack[--PL_lex_casemods];
2278 PL_lex_casestack[PL_lex_casemods] = '\0';
2280 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2282 PL_lex_state = LEX_INTERPCONCAT;
2286 if (PL_bufptr != PL_bufend)
2288 PL_lex_state = LEX_INTERPCONCAT;
2293 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2294 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2295 if (strchr("LU", *s) &&
2296 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2298 PL_lex_casestack[--PL_lex_casemods] = '\0';
2301 if (PL_lex_casemods > 10) {
2302 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2303 if (newlb != PL_lex_casestack) {
2305 PL_lex_casestack = newlb;
2308 PL_lex_casestack[PL_lex_casemods++] = *s;
2309 PL_lex_casestack[PL_lex_casemods] = '\0';
2310 PL_lex_state = LEX_INTERPCONCAT;
2311 PL_nextval[PL_nexttoke].ival = 0;
2314 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2316 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2318 PL_nextval[PL_nexttoke].ival = OP_LC;
2320 PL_nextval[PL_nexttoke].ival = OP_UC;
2322 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2324 Perl_croak(aTHX_ "panic: yylex");
2327 if (PL_lex_starts) {
2336 case LEX_INTERPPUSH:
2337 return sublex_push();
2339 case LEX_INTERPSTART:
2340 if (PL_bufptr == PL_bufend)
2341 return sublex_done();
2343 PL_lex_dojoin = (*PL_bufptr == '@');
2344 PL_lex_state = LEX_INTERPNORMAL;
2345 if (PL_lex_dojoin) {
2346 PL_nextval[PL_nexttoke].ival = 0;
2349 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2350 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2351 force_next(PRIVATEREF);
2353 force_ident("\"", '$');
2354 #endif /* USE_THREADS */
2355 PL_nextval[PL_nexttoke].ival = 0;
2357 PL_nextval[PL_nexttoke].ival = 0;
2359 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2362 if (PL_lex_starts++) {
2368 case LEX_INTERPENDMAYBE:
2369 if (intuit_more(PL_bufptr)) {
2370 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2376 if (PL_lex_dojoin) {
2377 PL_lex_dojoin = FALSE;
2378 PL_lex_state = LEX_INTERPCONCAT;
2381 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2382 && SvEVALED(PL_lex_repl))
2384 if (PL_bufptr != PL_bufend)
2385 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2386 PL_lex_repl = Nullsv;
2389 case LEX_INTERPCONCAT:
2391 if (PL_lex_brackets)
2392 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2394 if (PL_bufptr == PL_bufend)
2395 return sublex_done();
2397 if (SvIVX(PL_linestr) == '\'') {
2398 SV *sv = newSVsv(PL_linestr);
2401 else if ( PL_hints & HINT_NEW_RE )
2402 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2403 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2407 s = scan_const(PL_bufptr);
2409 PL_lex_state = LEX_INTERPCASEMOD;
2411 PL_lex_state = LEX_INTERPSTART;
2414 if (s != PL_bufptr) {
2415 PL_nextval[PL_nexttoke] = yylval;
2418 if (PL_lex_starts++)
2428 PL_lex_state = LEX_NORMAL;
2429 s = scan_formline(PL_bufptr);
2430 if (!PL_lex_formbrack)
2436 PL_oldoldbufptr = PL_oldbufptr;
2439 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2440 exp_name[PL_expect], s);
2446 if (isIDFIRST_lazy_if(s,UTF))
2448 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2451 goto fake_eof; /* emulate EOF on ^D or ^Z */
2456 if (PL_lex_brackets)
2457 yyerror("Missing right curly or square bracket");
2460 if (s++ < PL_bufend)
2461 goto retry; /* ignore stray nulls */
2464 if (!PL_in_eval && !PL_preambled) {
2465 PL_preambled = TRUE;
2466 sv_setpv(PL_linestr,incl_perldb());
2467 if (SvCUR(PL_linestr))
2468 sv_catpv(PL_linestr,";");
2470 while(AvFILLp(PL_preambleav) >= 0) {
2471 SV *tmpsv = av_shift(PL_preambleav);
2472 sv_catsv(PL_linestr, tmpsv);
2473 sv_catpv(PL_linestr, ";");
2476 sv_free((SV*)PL_preambleav);
2477 PL_preambleav = NULL;
2479 if (PL_minus_n || PL_minus_p) {
2480 sv_catpv(PL_linestr, "LINE: while (<>) {");
2482 sv_catpv(PL_linestr,"chomp;");
2484 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2486 GvIMPORTED_AV_on(gv);
2488 if (strchr("/'\"", *PL_splitstr)
2489 && strchr(PL_splitstr + 1, *PL_splitstr))
2490 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2493 s = "'~#\200\1'"; /* surely one char is unused...*/
2494 while (s[1] && strchr(PL_splitstr, *s)) s++;
2496 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2497 "q" + (delim == '\''), delim);
2498 for (s = PL_splitstr; *s; s++) {
2500 sv_catpvn(PL_linestr, "\\", 1);
2501 sv_catpvn(PL_linestr, s, 1);
2503 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2507 sv_catpv(PL_linestr,"@F=split(' ');");
2510 sv_catpv(PL_linestr, "\n");
2511 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2512 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2513 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2514 SV *sv = NEWSV(85,0);
2516 sv_upgrade(sv, SVt_PVMG);
2517 sv_setsv(sv,PL_linestr);
2518 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2524 bof = PL_rsfp && (PerlIO_tell(PL_rsfp) == 0); /* *Before* read! */
2525 s = filter_gets(PL_linestr, PL_rsfp, 0);
2529 if (PL_preprocess && !PL_in_eval)
2530 (void)PerlProc_pclose(PL_rsfp);
2531 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2532 PerlIO_clearerr(PL_rsfp);
2534 (void)PerlIO_close(PL_rsfp);
2536 PL_doextract = FALSE;
2538 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2539 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2540 sv_catpv(PL_linestr,";}");
2541 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2542 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2543 PL_minus_n = PL_minus_p = 0;
2546 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2547 sv_setpv(PL_linestr,"");
2548 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2550 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2551 s = swallow_bom((U8*)s);
2554 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2555 PL_doextract = FALSE;
2557 /* Incest with pod. */
2558 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2559 sv_setpv(PL_linestr, "");
2560 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2561 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2562 PL_doextract = FALSE;
2566 } while (PL_doextract);
2567 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2568 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2569 SV *sv = NEWSV(85,0);
2571 sv_upgrade(sv, SVt_PVMG);
2572 sv_setsv(sv,PL_linestr);
2573 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2575 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2576 if (CopLINE(PL_curcop) == 1) {
2577 while (s < PL_bufend && isSPACE(*s))
2579 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2583 if (*s == '#' && *(s+1) == '!')
2585 #ifdef ALTERNATE_SHEBANG
2587 static char as[] = ALTERNATE_SHEBANG;
2588 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2589 d = s + (sizeof(as) - 1);
2591 #endif /* ALTERNATE_SHEBANG */
2600 while (*d && !isSPACE(*d))
2604 #ifdef ARG_ZERO_IS_SCRIPT
2605 if (ipathend > ipath) {
2607 * HP-UX (at least) sets argv[0] to the script name,
2608 * which makes $^X incorrect. And Digital UNIX and Linux,
2609 * at least, set argv[0] to the basename of the Perl
2610 * interpreter. So, having found "#!", we'll set it right.
2612 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2613 assert(SvPOK(x) || SvGMAGICAL(x));
2614 if (sv_eq(x, CopFILESV(PL_curcop))) {
2615 sv_setpvn(x, ipath, ipathend - ipath);
2618 TAINT_NOT; /* $^X is always tainted, but that's OK */
2620 #endif /* ARG_ZERO_IS_SCRIPT */
2625 d = instr(s,"perl -");
2627 d = instr(s,"perl");
2629 /* avoid getting into infinite loops when shebang
2630 * line contains "Perl" rather than "perl" */
2632 for (d = ipathend-4; d >= ipath; --d) {
2633 if ((*d == 'p' || *d == 'P')
2634 && !ibcmp(d, "perl", 4))
2644 #ifdef ALTERNATE_SHEBANG
2646 * If the ALTERNATE_SHEBANG on this system starts with a
2647 * character that can be part of a Perl expression, then if
2648 * we see it but not "perl", we're probably looking at the
2649 * start of Perl code, not a request to hand off to some
2650 * other interpreter. Similarly, if "perl" is there, but
2651 * not in the first 'word' of the line, we assume the line
2652 * contains the start of the Perl program.
2654 if (d && *s != '#') {
2656 while (*c && !strchr("; \t\r\n\f\v#", *c))
2659 d = Nullch; /* "perl" not in first word; ignore */
2661 *s = '#'; /* Don't try to parse shebang line */
2663 #endif /* ALTERNATE_SHEBANG */
2664 #ifndef MACOS_TRADITIONAL
2669 !instr(s,"indir") &&
2670 instr(PL_origargv[0],"perl"))
2676 while (s < PL_bufend && isSPACE(*s))
2678 if (s < PL_bufend) {
2679 Newz(899,newargv,PL_origargc+3,char*);
2681 while (s < PL_bufend && !isSPACE(*s))
2684 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2687 newargv = PL_origargv;
2689 PerlProc_execv(ipath, newargv);
2690 Perl_croak(aTHX_ "Can't exec %s", ipath);
2694 U32 oldpdb = PL_perldb;
2695 bool oldn = PL_minus_n;
2696 bool oldp = PL_minus_p;
2698 while (*d && !isSPACE(*d)) d++;
2699 while (SPACE_OR_TAB(*d)) d++;
2703 if (*d == 'M' || *d == 'm') {
2705 while (*d && !isSPACE(*d)) d++;
2706 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2709 d = moreswitches(d);
2711 if ((PERLDB_LINE && !oldpdb) ||
2712 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2713 /* if we have already added "LINE: while (<>) {",
2714 we must not do it again */
2716 sv_setpv(PL_linestr, "");
2717 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2718 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2719 PL_preambled = FALSE;
2721 (void)gv_fetchfile(PL_origfilename);
2728 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2730 PL_lex_state = LEX_FORMLINE;
2735 #ifdef PERL_STRICT_CR
2736 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2738 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2740 case ' ': case '\t': case '\f': case 013:
2741 #ifdef MACOS_TRADITIONAL
2748 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2749 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2750 /* handle eval qq[#line 1 "foo"\n ...] */
2751 CopLINE_dec(PL_curcop);
2755 while (s < d && *s != '\n')
2760 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2762 PL_lex_state = LEX_FORMLINE;
2772 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2777 while (s < PL_bufend && SPACE_OR_TAB(*s))
2780 if (strnEQ(s,"=>",2)) {
2781 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2782 OPERATOR('-'); /* unary minus */
2784 PL_last_uni = PL_oldbufptr;
2785 PL_last_lop_op = OP_FTEREAD; /* good enough */
2787 case 'r': FTST(OP_FTEREAD);
2788 case 'w': FTST(OP_FTEWRITE);
2789 case 'x': FTST(OP_FTEEXEC);
2790 case 'o': FTST(OP_FTEOWNED);
2791 case 'R': FTST(OP_FTRREAD);
2792 case 'W': FTST(OP_FTRWRITE);
2793 case 'X': FTST(OP_FTREXEC);
2794 case 'O': FTST(OP_FTROWNED);
2795 case 'e': FTST(OP_FTIS);
2796 case 'z': FTST(OP_FTZERO);
2797 case 's': FTST(OP_FTSIZE);
2798 case 'f': FTST(OP_FTFILE);
2799 case 'd': FTST(OP_FTDIR);
2800 case 'l': FTST(OP_FTLINK);
2801 case 'p': FTST(OP_FTPIPE);
2802 case 'S': FTST(OP_FTSOCK);
2803 case 'u': FTST(OP_FTSUID);
2804 case 'g': FTST(OP_FTSGID);
2805 case 'k': FTST(OP_FTSVTX);
2806 case 'b': FTST(OP_FTBLK);
2807 case 'c': FTST(OP_FTCHR);
2808 case 't': FTST(OP_FTTTY);
2809 case 'T': FTST(OP_FTTEXT);
2810 case 'B': FTST(OP_FTBINARY);
2811 case 'M': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTMTIME);
2812 case 'A': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTATIME);
2813 case 'C': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTCTIME);
2815 Perl_croak(aTHX_ "Unrecognized file test: -%c", (int)tmp);
2822 if (PL_expect == XOPERATOR)
2827 else if (*s == '>') {
2830 if (isIDFIRST_lazy_if(s,UTF)) {
2831 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2839 if (PL_expect == XOPERATOR)
2842 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2844 OPERATOR('-'); /* unary minus */
2851 if (PL_expect == XOPERATOR)
2856 if (PL_expect == XOPERATOR)
2859 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2865 if (PL_expect != XOPERATOR) {
2866 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2867 PL_expect = XOPERATOR;
2868 force_ident(PL_tokenbuf, '*');
2881 if (PL_expect == XOPERATOR) {
2885 PL_tokenbuf[0] = '%';
2886 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2887 if (!PL_tokenbuf[1]) {
2889 yyerror("Final % should be \\% or %name");
2892 PL_pending_ident = '%';
2911 switch (PL_expect) {
2914 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2916 PL_bufptr = s; /* update in case we back off */
2922 PL_expect = XTERMBLOCK;
2926 while (isIDFIRST_lazy_if(s,UTF)) {
2927 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2928 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2929 if (tmp < 0) tmp = -tmp;
2944 d = scan_str(d,TRUE,TRUE);
2947 SvREFCNT_dec(PL_lex_stuff);
2948 PL_lex_stuff = Nullsv;
2950 /* MUST advance bufptr here to avoid bogus
2951 "at end of line" context messages from yyerror().
2953 PL_bufptr = s + len;
2954 yyerror("Unterminated attribute parameter in attribute list");
2957 return 0; /* EOF indicator */
2961 SV *sv = newSVpvn(s, len);
2962 sv_catsv(sv, PL_lex_stuff);
2963 attrs = append_elem(OP_LIST, attrs,
2964 newSVOP(OP_CONST, 0, sv));
2965 SvREFCNT_dec(PL_lex_stuff);
2966 PL_lex_stuff = Nullsv;
2969 attrs = append_elem(OP_LIST, attrs,
2970 newSVOP(OP_CONST, 0,
2974 if (*s == ':' && s[1] != ':')
2977 break; /* require real whitespace or :'s */
2979 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
2980 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
2981 char q = ((*s == '\'') ? '"' : '\'');
2982 /* If here for an expression, and parsed no attrs, back off. */
2983 if (tmp == '=' && !attrs) {
2987 /* MUST advance bufptr here to avoid bogus "at end of line"
2988 context messages from yyerror().
2992 yyerror("Unterminated attribute list");
2994 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3002 PL_nextval[PL_nexttoke].opval = attrs;
3010 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3011 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3027 if (PL_lex_brackets <= 0)
3028 yyerror("Unmatched right square bracket");
3031 if (PL_lex_state == LEX_INTERPNORMAL) {
3032 if (PL_lex_brackets == 0) {
3033 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3034 PL_lex_state = LEX_INTERPEND;
3041 if (PL_lex_brackets > 100) {
3042 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3043 if (newlb != PL_lex_brackstack) {
3045 PL_lex_brackstack = newlb;
3048 switch (PL_expect) {
3050 if (PL_lex_formbrack) {
3054 if (PL_oldoldbufptr == PL_last_lop)
3055 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3057 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3058 OPERATOR(HASHBRACK);
3060 while (s < PL_bufend && SPACE_OR_TAB(*s))
3063 PL_tokenbuf[0] = '\0';
3064 if (d < PL_bufend && *d == '-') {
3065 PL_tokenbuf[0] = '-';
3067 while (d < PL_bufend && SPACE_OR_TAB(*d))
3070 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3071 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3073 while (d < PL_bufend && SPACE_OR_TAB(*d))
3076 char minus = (PL_tokenbuf[0] == '-');
3077 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3085 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3090 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3095 if (PL_oldoldbufptr == PL_last_lop)
3096 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3098 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3101 OPERATOR(HASHBRACK);
3102 /* This hack serves to disambiguate a pair of curlies
3103 * as being a block or an anon hash. Normally, expectation
3104 * determines that, but in cases where we're not in a
3105 * position to expect anything in particular (like inside
3106 * eval"") we have to resolve the ambiguity. This code
3107 * covers the case where the first term in the curlies is a
3108 * quoted string. Most other cases need to be explicitly
3109 * disambiguated by prepending a `+' before the opening
3110 * curly in order to force resolution as an anon hash.
3112 * XXX should probably propagate the outer expectation
3113 * into eval"" to rely less on this hack, but that could
3114 * potentially break current behavior of eval"".
3118 if (*s == '\'' || *s == '"' || *s == '`') {
3119 /* common case: get past first string, handling escapes */
3120 for (t++; t < PL_bufend && *t != *s;)
3121 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3125 else if (*s == 'q') {
3128 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3132 char open, close, term;
3135 while (t < PL_bufend && isSPACE(*t))
3139 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3143 for (t++; t < PL_bufend; t++) {
3144 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3146 else if (*t == open)
3150 for (t++; t < PL_bufend; t++) {
3151 if (*t == '\\' && t+1 < PL_bufend)
3153 else if (*t == close && --brackets <= 0)
3155 else if (*t == open)
3161 else if (isALNUM_lazy_if(t,UTF)) {
3163 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3166 while (t < PL_bufend && isSPACE(*t))
3168 /* if comma follows first term, call it an anon hash */
3169 /* XXX it could be a comma expression with loop modifiers */
3170 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3171 || (*t == '=' && t[1] == '>')))
3172 OPERATOR(HASHBRACK);
3173 if (PL_expect == XREF)
3176 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3182 yylval.ival = CopLINE(PL_curcop);
3183 if (isSPACE(*s) || *s == '#')
3184 PL_copline = NOLINE; /* invalidate current command line number */
3189 if (PL_lex_brackets <= 0)
3190 yyerror("Unmatched right curly bracket");
3192 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3193 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3194 PL_lex_formbrack = 0;
3195 if (PL_lex_state == LEX_INTERPNORMAL) {
3196 if (PL_lex_brackets == 0) {
3197 if (PL_expect & XFAKEBRACK) {
3198 PL_expect &= XENUMMASK;
3199 PL_lex_state = LEX_INTERPEND;
3201 return yylex(); /* ignore fake brackets */
3203 if (*s == '-' && s[1] == '>')
3204 PL_lex_state = LEX_INTERPENDMAYBE;
3205 else if (*s != '[' && *s != '{')
3206 PL_lex_state = LEX_INTERPEND;
3209 if (PL_expect & XFAKEBRACK) {
3210 PL_expect &= XENUMMASK;
3212 return yylex(); /* ignore fake brackets */
3222 if (PL_expect == XOPERATOR) {
3223 if (ckWARN(WARN_SEMICOLON)
3224 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3226 CopLINE_dec(PL_curcop);
3227 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3228 CopLINE_inc(PL_curcop);
3233 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3235 PL_expect = XOPERATOR;
3236 force_ident(PL_tokenbuf, '&');
3240 yylval.ival = (OPpENTERSUB_AMPER<<8);
3259 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3260 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3262 if (PL_expect == XSTATE && isALPHA(tmp) &&
3263 (s == PL_linestart+1 || s[-2] == '\n') )
3265 if (PL_in_eval && !PL_rsfp) {
3270 if (strnEQ(s,"=cut",4)) {
3284 PL_doextract = TRUE;
3287 if (PL_lex_brackets < PL_lex_formbrack) {
3289 #ifdef PERL_STRICT_CR
3290 for (t = s; SPACE_OR_TAB(*t); t++) ;
3292 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3294 if (*t == '\n' || *t == '#') {
3312 if (PL_expect != XOPERATOR) {
3313 if (s[1] != '<' && !strchr(s,'>'))
3316 s = scan_heredoc(s);
3318 s = scan_inputsymbol(s);
3319 TERM(sublex_start());
3324 SHop(OP_LEFT_SHIFT);
3338 SHop(OP_RIGHT_SHIFT);
3347 if (PL_expect == XOPERATOR) {
3348 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3351 return ','; /* grandfather non-comma-format format */
3355 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3356 PL_tokenbuf[0] = '@';
3357 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3358 sizeof PL_tokenbuf - 1, FALSE);
3359 if (PL_expect == XOPERATOR)
3360 no_op("Array length", s);
3361 if (!PL_tokenbuf[1])
3363 PL_expect = XOPERATOR;
3364 PL_pending_ident = '#';
3368 PL_tokenbuf[0] = '$';
3369 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3370 sizeof PL_tokenbuf - 1, FALSE);
3371 if (PL_expect == XOPERATOR)
3373 if (!PL_tokenbuf[1]) {
3375 yyerror("Final $ should be \\$ or $name");
3379 /* This kludge not intended to be bulletproof. */
3380 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3381 yylval.opval = newSVOP(OP_CONST, 0,
3382 newSViv(PL_compiling.cop_arybase));
3383 yylval.opval->op_private = OPpCONST_ARYBASE;
3389 if (PL_lex_state == LEX_NORMAL)
3392 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3395 PL_tokenbuf[0] = '@';
3396 if (ckWARN(WARN_SYNTAX)) {
3398 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3401 PL_bufptr = skipspace(PL_bufptr);
3402 while (t < PL_bufend && *t != ']')
3404 Perl_warner(aTHX_ WARN_SYNTAX,
3405 "Multidimensional syntax %.*s not supported",
3406 (t - PL_bufptr) + 1, PL_bufptr);
3410 else if (*s == '{') {
3411 PL_tokenbuf[0] = '%';
3412 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3413 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3415 char tmpbuf[sizeof PL_tokenbuf];
3417 for (t++; isSPACE(*t); t++) ;
3418 if (isIDFIRST_lazy_if(t,UTF)) {
3419 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3420 for (; isSPACE(*t); t++) ;
3421 if (*t == ';' && get_cv(tmpbuf, FALSE))
3422 Perl_warner(aTHX_ WARN_SYNTAX,
3423 "You need to quote \"%s\"", tmpbuf);
3429 PL_expect = XOPERATOR;
3430 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3431 bool islop = (PL_last_lop == PL_oldoldbufptr);
3432 if (!islop || PL_last_lop_op == OP_GREPSTART)
3433 PL_expect = XOPERATOR;
3434 else if (strchr("$@\"'`q", *s))
3435 PL_expect = XTERM; /* e.g. print $fh "foo" */
3436 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3437 PL_expect = XTERM; /* e.g. print $fh &sub */
3438 else if (isIDFIRST_lazy_if(s,UTF)) {
3439 char tmpbuf[sizeof PL_tokenbuf];
3440 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3441 if ((tmp = keyword(tmpbuf, len))) {
3442 /* binary operators exclude handle interpretations */
3454 PL_expect = XTERM; /* e.g. print $fh length() */
3459 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3460 if (gv && GvCVu(gv))
3461 PL_expect = XTERM; /* e.g. print $fh subr() */
3464 else if (isDIGIT(*s))
3465 PL_expect = XTERM; /* e.g. print $fh 3 */
3466 else if (*s == '.' && isDIGIT(s[1]))
3467 PL_expect = XTERM; /* e.g. print $fh .3 */
3468 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3469 PL_expect = XTERM; /* e.g. print $fh -1 */
3470 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3471 PL_expect = XTERM; /* print $fh <<"EOF" */
3473 PL_pending_ident = '$';
3477 if (PL_expect == XOPERATOR)
3479 PL_tokenbuf[0] = '@';
3480 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3481 if (!PL_tokenbuf[1]) {
3483 yyerror("Final @ should be \\@ or @name");
3486 if (PL_lex_state == LEX_NORMAL)
3488 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3490 PL_tokenbuf[0] = '%';
3492 /* Warn about @ where they meant $. */
3493 if (ckWARN(WARN_SYNTAX)) {
3494 if (*s == '[' || *s == '{') {
3496 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3498 if (*t == '}' || *t == ']') {
3500 PL_bufptr = skipspace(PL_bufptr);
3501 Perl_warner(aTHX_ WARN_SYNTAX,
3502 "Scalar value %.*s better written as $%.*s",
3503 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3508 PL_pending_ident = '@';
3511 case '/': /* may either be division or pattern */
3512 case '?': /* may either be conditional or pattern */
3513 if (PL_expect != XOPERATOR) {
3514 /* Disable warning on "study /blah/" */
3515 if (PL_oldoldbufptr == PL_last_uni
3516 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3517 || memNE(PL_last_uni, "study", 5)
3518 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3520 s = scan_pat(s,OP_MATCH);
3521 TERM(sublex_start());
3529 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3530 #ifdef PERL_STRICT_CR
3533 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3535 && (s == PL_linestart || s[-1] == '\n') )
3537 PL_lex_formbrack = 0;
3541 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3547 yylval.ival = OPf_SPECIAL;
3553 if (PL_expect != XOPERATOR)
3558 case '0': case '1': case '2': case '3': case '4':
3559 case '5': case '6': case '7': case '8': case '9':
3560 s = scan_num(s, &yylval);
3561 if (PL_expect == XOPERATOR)
3566 s = scan_str(s,FALSE,FALSE);
3567 if (PL_expect == XOPERATOR) {
3568 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3571 return ','; /* grandfather non-comma-format format */
3577 missingterm((char*)0);
3578 yylval.ival = OP_CONST;
3579 TERM(sublex_start());
3582 s = scan_str(s,FALSE,FALSE);
3583 if (PL_expect == XOPERATOR) {
3584 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3587 return ','; /* grandfather non-comma-format format */
3593 missingterm((char*)0);
3594 yylval.ival = OP_CONST;
3595 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3596 if (*d == '$' || *d == '@' || *d == '\\' || *d & 0x80) {
3597 yylval.ival = OP_STRINGIFY;
3601 TERM(sublex_start());
3604 s = scan_str(s,FALSE,FALSE);
3605 if (PL_expect == XOPERATOR)
3606 no_op("Backticks",s);
3608 missingterm((char*)0);
3609 yylval.ival = OP_BACKTICK;
3611 TERM(sublex_start());
3615 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3616 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3618 if (PL_expect == XOPERATOR)
3619 no_op("Backslash",s);
3623 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3627 while (isDIGIT(*start) || *start == '_')
3629 if (*start == '.' && isDIGIT(start[1])) {
3630 s = scan_num(s, &yylval);
3633 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3634 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF)) {
3638 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3641 s = scan_num(s, &yylval);
3648 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3687 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3689 /* Some keywords can be followed by any delimiter, including ':' */
3690 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3691 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3692 (PL_tokenbuf[0] == 'q' &&
3693 strchr("qwxr", PL_tokenbuf[1])))));
3695 /* x::* is just a word, unless x is "CORE" */
3696 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3700 while (d < PL_bufend && isSPACE(*d))
3701 d++; /* no comments skipped here, or s### is misparsed */
3703 /* Is this a label? */
3704 if (!tmp && PL_expect == XSTATE
3705 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3707 yylval.pval = savepv(PL_tokenbuf);
3712 /* Check for keywords */
3713 tmp = keyword(PL_tokenbuf, len);
3715 /* Is this a word before a => operator? */
3716 if (*d == '=' && d[1] == '>') {
3718 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3719 yylval.opval->op_private = OPpCONST_BARE;
3723 if (tmp < 0) { /* second-class keyword? */
3724 GV *ogv = Nullgv; /* override (winner) */
3725 GV *hgv = Nullgv; /* hidden (loser) */
3726 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3728 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3731 if (GvIMPORTED_CV(gv))
3733 else if (! CvMETHOD(cv))
3737 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3738 (gv = *gvp) != (GV*)&PL_sv_undef &&
3739 GvCVu(gv) && GvIMPORTED_CV(gv))
3745 tmp = 0; /* overridden by import or by GLOBAL */
3748 && -tmp==KEY_lock /* XXX generalizable kludge */
3750 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3752 tmp = 0; /* any sub overrides "weak" keyword */
3754 else { /* no override */
3758 if (ckWARN(WARN_AMBIGUOUS) && hgv
3759 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3760 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3761 "Ambiguous call resolved as CORE::%s(), %s",
3762 GvENAME(hgv), "qualify as such or use &");
3769 default: /* not a keyword */
3772 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3774 /* Get the rest if it looks like a package qualifier */
3776 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3778 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3781 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3782 *s == '\'' ? "'" : "::");
3786 if (PL_expect == XOPERATOR) {
3787 if (PL_bufptr == PL_linestart) {
3788 CopLINE_dec(PL_curcop);
3789 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3790 CopLINE_inc(PL_curcop);
3793 no_op("Bareword",s);
3796 /* Look for a subroutine with this name in current package,
3797 unless name is "Foo::", in which case Foo is a bearword
3798 (and a package name). */
3801 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3803 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3804 Perl_warner(aTHX_ WARN_BAREWORD,
3805 "Bareword \"%s\" refers to nonexistent package",
3808 PL_tokenbuf[len] = '\0';
3815 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3818 /* if we saw a global override before, get the right name */
3821 sv = newSVpvn("CORE::GLOBAL::",14);
3822 sv_catpv(sv,PL_tokenbuf);
3825 sv = newSVpv(PL_tokenbuf,0);
3827 /* Presume this is going to be a bareword of some sort. */
3830 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3831 yylval.opval->op_private = OPpCONST_BARE;
3833 /* And if "Foo::", then that's what it certainly is. */
3838 /* See if it's the indirect object for a list operator. */
3840 if (PL_oldoldbufptr &&
3841 PL_oldoldbufptr < PL_bufptr &&
3842 (PL_oldoldbufptr == PL_last_lop
3843 || PL_oldoldbufptr == PL_last_uni) &&
3844 /* NO SKIPSPACE BEFORE HERE! */
3845 (PL_expect == XREF ||
3846 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3848 bool immediate_paren = *s == '(';
3850 /* (Now we can afford to cross potential line boundary.) */
3853 /* Two barewords in a row may indicate method call. */
3855 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3858 /* If not a declared subroutine, it's an indirect object. */
3859 /* (But it's an indir obj regardless for sort.) */
3861 if ((PL_last_lop_op == OP_SORT ||
3862 (!immediate_paren && (!gv || !GvCVu(gv)))) &&
3863 (PL_last_lop_op != OP_MAPSTART &&
3864 PL_last_lop_op != OP_GREPSTART))
3866 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3872 PL_expect = XOPERATOR;
3875 /* Is this a word before a => operator? */
3876 if (*s == '=' && s[1] == '>') {
3878 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3882 /* If followed by a paren, it's certainly a subroutine. */
3885 if (gv && GvCVu(gv)) {
3886 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3887 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3892 PL_nextval[PL_nexttoke].opval = yylval.opval;
3893 PL_expect = XOPERATOR;
3899 /* If followed by var or block, call it a method (unless sub) */
3901 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3902 PL_last_lop = PL_oldbufptr;
3903 PL_last_lop_op = OP_METHOD;
3907 /* If followed by a bareword, see if it looks like indir obj. */
3909 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3912 /* Not a method, so call it a subroutine (if defined) */
3914 if (gv && GvCVu(gv)) {
3916 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3917 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3918 "Ambiguous use of -%s resolved as -&%s()",
3919 PL_tokenbuf, PL_tokenbuf);
3920 /* Check for a constant sub */
3922 if ((sv = cv_const_sv(cv))) {
3924 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3925 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3926 yylval.opval->op_private = 0;
3930 /* Resolve to GV now. */
3931 op_free(yylval.opval);
3932 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3933 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3934 PL_last_lop = PL_oldbufptr;
3935 PL_last_lop_op = OP_ENTERSUB;
3936 /* Is there a prototype? */
3939 char *proto = SvPV((SV*)cv, len);
3942 if (strEQ(proto, "$"))
3944 if (*proto == '&' && *s == '{') {
3945 sv_setpv(PL_subname,"__ANON__");
3949 PL_nextval[PL_nexttoke].opval = yylval.opval;
3955 /* Call it a bare word */
3957 if (PL_hints & HINT_STRICT_SUBS)
3958 yylval.opval->op_private |= OPpCONST_STRICT;
3961 if (ckWARN(WARN_RESERVED)) {
3962 if (lastchar != '-') {
3963 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
3965 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
3972 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
3973 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3974 "Operator or semicolon missing before %c%s",
3975 lastchar, PL_tokenbuf);
3976 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3977 "Ambiguous use of %c resolved as operator %c",
3978 lastchar, lastchar);
3984 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3985 newSVpv(CopFILE(PL_curcop),0));
3989 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3990 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
3993 case KEY___PACKAGE__:
3994 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
3996 ? newSVsv(PL_curstname)
4005 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4006 char *pname = "main";
4007 if (PL_tokenbuf[2] == 'D')
4008 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4009 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4012 GvIOp(gv) = newIO();
4013 IoIFP(GvIOp(gv)) = PL_rsfp;
4014 #if defined(HAS_FCNTL) && defined(F_SETFD)
4016 int fd = PerlIO_fileno(PL_rsfp);
4017 fcntl(fd,F_SETFD,fd >= 3);
4020 /* Mark this internal pseudo-handle as clean */
4021 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4023 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4024 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4025 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4027 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4028 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4029 /* if the script was opened in binmode, we need to revert
4030 * it to text mode for compatibility; but only iff it has CRs
4031 * XXX this is a questionable hack at best. */
4032 if (PL_bufend-PL_bufptr > 2
4033 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4036 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4037 loc = PerlIO_tell(PL_rsfp);
4038 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4040 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4041 #if defined(__BORLANDC__)
4042 /* XXX see note in do_binmode() */
4043 ((FILE*)PL_rsfp)->flags |= _F_BIN;
4046 PerlIO_seek(PL_rsfp, loc, 0);
4061 if (PL_expect == XSTATE) {
4068 if (*s == ':' && s[1] == ':') {
4071 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4072 if (!(tmp = keyword(PL_tokenbuf, len)))
4073 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4087 LOP(OP_ACCEPT,XTERM);
4093 LOP(OP_ATAN2,XTERM);
4099 LOP(OP_BINMODE,XTERM);
4102 LOP(OP_BLESS,XTERM);
4111 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4128 if (!PL_cryptseen) {
4129 PL_cryptseen = TRUE;
4133 LOP(OP_CRYPT,XTERM);
4136 if (ckWARN(WARN_CHMOD)) {
4137 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4138 if (*d != '0' && isDIGIT(*d))
4139 Perl_warner(aTHX_ WARN_CHMOD,
4140 "chmod() mode argument is missing initial 0");
4142 LOP(OP_CHMOD,XTERM);
4145 LOP(OP_CHOWN,XTERM);
4148 LOP(OP_CONNECT,XTERM);
4164 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4168 PL_hints |= HINT_BLOCK_SCOPE;
4178 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4179 LOP(OP_DBMOPEN,XTERM);
4185 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4192 yylval.ival = CopLINE(PL_curcop);
4206 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4207 UNIBRACK(OP_ENTEREVAL);
4222 case KEY_endhostent:
4228 case KEY_endservent:
4231 case KEY_endprotoent:
4242 yylval.ival = CopLINE(PL_curcop);
4244 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4246 if ((PL_bufend - p) >= 3 &&
4247 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4249 else if ((PL_bufend - p) >= 4 &&
4250 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4253 if (isIDFIRST_lazy_if(p,UTF)) {
4254 p = scan_ident(p, PL_bufend,
4255 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4259 Perl_croak(aTHX_ "Missing $ on loop variable");
4264 LOP(OP_FORMLINE,XTERM);
4270 LOP(OP_FCNTL,XTERM);
4276 LOP(OP_FLOCK,XTERM);
4285 LOP(OP_GREPSTART, XREF);
4288 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4303 case KEY_getpriority:
4304 LOP(OP_GETPRIORITY,XTERM);
4306 case KEY_getprotobyname:
4309 case KEY_getprotobynumber:
4310 LOP(OP_GPBYNUMBER,XTERM);
4312 case KEY_getprotoent:
4324 case KEY_getpeername:
4325 UNI(OP_GETPEERNAME);
4327 case KEY_gethostbyname:
4330 case KEY_gethostbyaddr:
4331 LOP(OP_GHBYADDR,XTERM);
4333 case KEY_gethostent:
4336 case KEY_getnetbyname:
4339 case KEY_getnetbyaddr:
4340 LOP(OP_GNBYADDR,XTERM);
4345 case KEY_getservbyname:
4346 LOP(OP_GSBYNAME,XTERM);
4348 case KEY_getservbyport:
4349 LOP(OP_GSBYPORT,XTERM);
4351 case KEY_getservent:
4354 case KEY_getsockname:
4355 UNI(OP_GETSOCKNAME);
4357 case KEY_getsockopt:
4358 LOP(OP_GSOCKOPT,XTERM);
4380 yylval.ival = CopLINE(PL_curcop);
4384 LOP(OP_INDEX,XTERM);
4390 LOP(OP_IOCTL,XTERM);
4402 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4434 LOP(OP_LISTEN,XTERM);
4443 s = scan_pat(s,OP_MATCH);
4444 TERM(sublex_start());
4447 LOP(OP_MAPSTART, XREF);
4450 LOP(OP_MKDIR,XTERM);
4453 LOP(OP_MSGCTL,XTERM);
4456 LOP(OP_MSGGET,XTERM);
4459 LOP(OP_MSGRCV,XTERM);
4462 LOP(OP_MSGSND,XTERM);
4468 if (isIDFIRST_lazy_if(s,UTF)) {
4469 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4470 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4472 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4473 if (!PL_in_my_stash) {
4476 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4484 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4491 if (PL_expect != XSTATE)
4492 yyerror("\"no\" not allowed in expression");
4493 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4494 s = force_version(s);
4499 if (*s == '(' || (s = skipspace(s), *s == '('))
4506 if (isIDFIRST_lazy_if(s,UTF)) {
4508 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4510 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4511 Perl_warner(aTHX_ WARN_PRECEDENCE,
4512 "Precedence problem: open %.*s should be open(%.*s)",
4518 yylval.ival = OP_OR;
4528 LOP(OP_OPEN_DIR,XTERM);
4531 checkcomma(s,PL_tokenbuf,"filehandle");
4535 checkcomma(s,PL_tokenbuf,"filehandle");
4554 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4558 LOP(OP_PIPE_OP,XTERM);
4561 s = scan_str(s,FALSE,FALSE);
4563 missingterm((char*)0);
4564 yylval.ival = OP_CONST;
4565 TERM(sublex_start());
4571 s = scan_str(s,FALSE,FALSE);
4573 missingterm((char*)0);
4575 if (SvCUR(PL_lex_stuff)) {
4578 d = SvPV_force(PL_lex_stuff, len);
4580 for (; isSPACE(*d) && len; --len, ++d) ;
4583 if (!warned && ckWARN(WARN_QW)) {
4584 for (; !isSPACE(*d) && len; --len, ++d) {
4586 Perl_warner(aTHX_ WARN_QW,
4587 "Possible attempt to separate words with commas");
4590 else if (*d == '#') {
4591 Perl_warner(aTHX_ WARN_QW,
4592 "Possible attempt to put comments in qw() list");
4598 for (; !isSPACE(*d) && len; --len, ++d) ;
4600 words = append_elem(OP_LIST, words,
4601 newSVOP(OP_CONST, 0, tokeq(newSVpvn(b, d-b))));
4605 PL_nextval[PL_nexttoke].opval = words;
4610 SvREFCNT_dec(PL_lex_stuff);
4611 PL_lex_stuff = Nullsv;
4616 s = scan_str(s,FALSE,FALSE);
4618 missingterm((char*)0);
4619 yylval.ival = OP_STRINGIFY;
4620 if (SvIVX(PL_lex_stuff) == '\'')
4621 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4622 TERM(sublex_start());
4625 s = scan_pat(s,OP_QR);
4626 TERM(sublex_start());
4629 s = scan_str(s,FALSE,FALSE);
4631 missingterm((char*)0);
4632 yylval.ival = OP_BACKTICK;
4634 TERM(sublex_start());
4641 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4642 s = force_version(s);
4645 *PL_tokenbuf = '\0';
4646 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4647 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4648 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4650 yyerror("<> should be quotes");
4658 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4662 LOP(OP_RENAME,XTERM);
4671 LOP(OP_RINDEX,XTERM);
4694 LOP(OP_REVERSE,XTERM);
4705 TERM(sublex_start());
4707 TOKEN(1); /* force error */
4716 LOP(OP_SELECT,XTERM);
4722 LOP(OP_SEMCTL,XTERM);
4725 LOP(OP_SEMGET,XTERM);
4728 LOP(OP_SEMOP,XTERM);
4734 LOP(OP_SETPGRP,XTERM);
4736 case KEY_setpriority:
4737 LOP(OP_SETPRIORITY,XTERM);
4739 case KEY_sethostent:
4745 case KEY_setservent:
4748 case KEY_setprotoent:
4758 LOP(OP_SEEKDIR,XTERM);
4760 case KEY_setsockopt:
4761 LOP(OP_SSOCKOPT,XTERM);
4767 LOP(OP_SHMCTL,XTERM);
4770 LOP(OP_SHMGET,XTERM);
4773 LOP(OP_SHMREAD,XTERM);
4776 LOP(OP_SHMWRITE,XTERM);
4779 LOP(OP_SHUTDOWN,XTERM);
4788 LOP(OP_SOCKET,XTERM);
4790 case KEY_socketpair:
4791 LOP(OP_SOCKPAIR,XTERM);
4794 checkcomma(s,PL_tokenbuf,"subroutine name");
4796 if (*s == ';' || *s == ')') /* probably a close */
4797 Perl_croak(aTHX_ "sort is now a reserved word");
4799 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4803 LOP(OP_SPLIT,XTERM);
4806 LOP(OP_SPRINTF,XTERM);
4809 LOP(OP_SPLICE,XTERM);
4824 LOP(OP_SUBSTR,XTERM);
4830 char tmpbuf[sizeof PL_tokenbuf];
4832 expectation attrful;
4833 bool have_name, have_proto;
4838 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4839 (*s == ':' && s[1] == ':'))
4842 attrful = XATTRBLOCK;
4843 /* remember buffer pos'n for later force_word */
4844 tboffset = s - PL_oldbufptr;
4845 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4846 if (strchr(tmpbuf, ':'))
4847 sv_setpv(PL_subname, tmpbuf);
4849 sv_setsv(PL_subname,PL_curstname);
4850 sv_catpvn(PL_subname,"::",2);
4851 sv_catpvn(PL_subname,tmpbuf,len);
4858 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4859 PL_expect = XTERMBLOCK;
4860 attrful = XATTRTERM;
4861 sv_setpv(PL_subname,"?");
4865 if (key == KEY_format) {
4867 PL_lex_formbrack = PL_lex_brackets + 1;
4869 (void) force_word(PL_oldbufptr + tboffset, WORD,
4874 /* Look for a prototype */
4878 s = scan_str(s,FALSE,FALSE);
4881 SvREFCNT_dec(PL_lex_stuff);
4882 PL_lex_stuff = Nullsv;
4883 Perl_croak(aTHX_ "Prototype not terminated");
4886 d = SvPVX(PL_lex_stuff);
4888 for (p = d; *p; ++p) {
4893 SvCUR(PL_lex_stuff) = tmp;
4901 if (*s == ':' && s[1] != ':')
4902 PL_expect = attrful;
4905 PL_nextval[PL_nexttoke].opval =
4906 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4907 PL_lex_stuff = Nullsv;
4911 sv_setpv(PL_subname,"__ANON__");
4914 (void) force_word(PL_oldbufptr + tboffset, WORD,
4923 LOP(OP_SYSTEM,XREF);
4926 LOP(OP_SYMLINK,XTERM);
4929 LOP(OP_SYSCALL,XTERM);
4932 LOP(OP_SYSOPEN,XTERM);
4935 LOP(OP_SYSSEEK,XTERM);
4938 LOP(OP_SYSREAD,XTERM);
4941 LOP(OP_SYSWRITE,XTERM);
4945 TERM(sublex_start());
4966 LOP(OP_TRUNCATE,XTERM);
4978 yylval.ival = CopLINE(PL_curcop);
4982 yylval.ival = CopLINE(PL_curcop);
4986 LOP(OP_UNLINK,XTERM);
4992 LOP(OP_UNPACK,XTERM);
4995 LOP(OP_UTIME,XTERM);
4998 if (ckWARN(WARN_UMASK)) {
4999 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5000 if (*d != '0' && isDIGIT(*d))
5001 Perl_warner(aTHX_ WARN_UMASK,
5002 "umask: argument is missing initial 0");
5007 LOP(OP_UNSHIFT,XTERM);
5010 if (PL_expect != XSTATE)
5011 yyerror("\"use\" not allowed in expression");
5013 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5014 s = force_version(s);
5015 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5016 PL_nextval[PL_nexttoke].opval = Nullop;
5021 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5022 s = force_version(s);
5034 yylval.ival = CopLINE(PL_curcop);
5038 PL_hints |= HINT_BLOCK_SCOPE;
5045 LOP(OP_WAITPID,XTERM);
5053 static char ctl_l[2];
5055 if (ctl_l[0] == '\0')
5056 ctl_l[0] = toCTRL('L');
5057 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5060 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5065 if (PL_expect == XOPERATOR)
5071 yylval.ival = OP_XOR;
5076 TERM(sublex_start());
5081 #pragma segment Main
5085 Perl_keyword(pTHX_ register char *d, I32 len)
5090 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5091 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5092 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5093 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5094 if (strEQ(d,"__END__")) return KEY___END__;
5098 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5103 if (strEQ(d,"and")) return -KEY_and;
5104 if (strEQ(d,"abs")) return -KEY_abs;
5107 if (strEQ(d,"alarm")) return -KEY_alarm;
5108 if (strEQ(d,"atan2")) return -KEY_atan2;
5111 if (strEQ(d,"accept")) return -KEY_accept;
5116 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5119 if (strEQ(d,"bless")) return -KEY_bless;
5120 if (strEQ(d,"bind")) return -KEY_bind;
5121 if (strEQ(d,"binmode")) return -KEY_binmode;
5124 if (strEQ(d,"CORE")) return -KEY_CORE;
5125 if (strEQ(d,"CHECK")) return KEY_CHECK;
5130 if (strEQ(d,"cmp")) return -KEY_cmp;
5131 if (strEQ(d,"chr")) return -KEY_chr;
5132 if (strEQ(d,"cos")) return -KEY_cos;
5135 if (strEQ(d,"chop")) return -KEY_chop;
5138 if (strEQ(d,"close")) return -KEY_close;
5139 if (strEQ(d,"chdir")) return -KEY_chdir;
5140 if (strEQ(d,"chomp")) return -KEY_chomp;
5141 if (strEQ(d,"chmod")) return -KEY_chmod;
5142 if (strEQ(d,"chown")) return -KEY_chown;
5143 if (strEQ(d,"crypt")) return -KEY_crypt;
5146 if (strEQ(d,"chroot")) return -KEY_chroot;
5147 if (strEQ(d,"caller")) return -KEY_caller;
5150 if (strEQ(d,"connect")) return -KEY_connect;
5153 if (strEQ(d,"closedir")) return -KEY_closedir;
5154 if (strEQ(d,"continue")) return -KEY_continue;
5159 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5164 if (strEQ(d,"do")) return KEY_do;
5167 if (strEQ(d,"die")) return -KEY_die;
5170 if (strEQ(d,"dump")) return -KEY_dump;
5173 if (strEQ(d,"delete")) return KEY_delete;
5176 if (strEQ(d,"defined")) return KEY_defined;
5177 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5180 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5185 if (strEQ(d,"END")) return KEY_END;
5190 if (strEQ(d,"eq")) return -KEY_eq;
5193 if (strEQ(d,"eof")) return -KEY_eof;
5194 if (strEQ(d,"exp")) return -KEY_exp;
5197 if (strEQ(d,"else")) return KEY_else;
5198 if (strEQ(d,"exit")) return -KEY_exit;
5199 if (strEQ(d,"eval")) return KEY_eval;
5200 if (strEQ(d,"exec")) return -KEY_exec;
5201 if (strEQ(d,"each")) return KEY_each;
5204 if (strEQ(d,"elsif")) return KEY_elsif;
5207 if (strEQ(d,"exists")) return KEY_exists;
5208 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5211 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5212 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5215 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5218 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5219 if (strEQ(d,"endservent")) return -KEY_endservent;
5222 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5229 if (strEQ(d,"for")) return KEY_for;
5232 if (strEQ(d,"fork")) return -KEY_fork;
5235 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5236 if (strEQ(d,"flock")) return -KEY_flock;
5239 if (strEQ(d,"format")) return KEY_format;
5240 if (strEQ(d,"fileno")) return -KEY_fileno;
5243 if (strEQ(d,"foreach")) return KEY_foreach;
5246 if (strEQ(d,"formline")) return -KEY_formline;
5251 if (strnEQ(d,"get",3)) {
5256 if (strEQ(d,"ppid")) return -KEY_getppid;
5257 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5260 if (strEQ(d,"pwent")) return -KEY_getpwent;
5261 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5262 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5265 if (strEQ(d,"peername")) return -KEY_getpeername;
5266 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5267 if (strEQ(d,"priority")) return -KEY_getpriority;
5270 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5273 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5277 else if (*d == 'h') {
5278 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5279 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5280 if (strEQ(d,"hostent")) return -KEY_gethostent;
5282 else if (*d == 'n') {
5283 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5284 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5285 if (strEQ(d,"netent")) return -KEY_getnetent;
5287 else if (*d == 's') {
5288 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5289 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5290 if (strEQ(d,"servent")) return -KEY_getservent;
5291 if (strEQ(d,"sockname")) return -KEY_getsockname;
5292 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5294 else if (*d == 'g') {
5295 if (strEQ(d,"grent")) return -KEY_getgrent;
5296 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5297 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5299 else if (*d == 'l') {
5300 if (strEQ(d,"login")) return -KEY_getlogin;
5302 else if (strEQ(d,"c")) return -KEY_getc;
5307 if (strEQ(d,"gt")) return -KEY_gt;
5308 if (strEQ(d,"ge")) return -KEY_ge;
5311 if (strEQ(d,"grep")) return KEY_grep;
5312 if (strEQ(d,"goto")) return KEY_goto;
5313 if (strEQ(d,"glob")) return KEY_glob;
5316 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5321 if (strEQ(d,"hex")) return -KEY_hex;
5324 if (strEQ(d,"INIT")) return KEY_INIT;
5329 if (strEQ(d,"if")) return KEY_if;
5332 if (strEQ(d,"int")) return -KEY_int;
5335 if (strEQ(d,"index")) return -KEY_index;
5336 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5341 if (strEQ(d,"join")) return -KEY_join;
5345 if (strEQ(d,"keys")) return KEY_keys;
5346 if (strEQ(d,"kill")) return -KEY_kill;
5352 if (strEQ(d,"lt")) return -KEY_lt;
5353 if (strEQ(d,"le")) return -KEY_le;
5354 if (strEQ(d,"lc")) return -KEY_lc;
5357 if (strEQ(d,"log")) return -KEY_log;
5360 if (strEQ(d,"last")) return KEY_last;
5361 if (strEQ(d,"link")) return -KEY_link;
5362 if (strEQ(d,"lock")) return -KEY_lock;
5365 if (strEQ(d,"local")) return KEY_local;
5366 if (strEQ(d,"lstat")) return -KEY_lstat;
5369 if (strEQ(d,"length")) return -KEY_length;
5370 if (strEQ(d,"listen")) return -KEY_listen;
5373 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5376 if (strEQ(d,"localtime")) return -KEY_localtime;
5382 case 1: return KEY_m;
5384 if (strEQ(d,"my")) return KEY_my;
5387 if (strEQ(d,"map")) return KEY_map;
5390 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5393 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5394 if (strEQ(d,"msgget")) return -KEY_msgget;
5395 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5396 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5401 if (strEQ(d,"next")) return KEY_next;
5402 if (strEQ(d,"ne")) return -KEY_ne;
5403 if (strEQ(d,"not")) return -KEY_not;
5404 if (strEQ(d,"no")) return KEY_no;
5409 if (strEQ(d,"or")) return -KEY_or;
5412 if (strEQ(d,"ord")) return -KEY_ord;
5413 if (strEQ(d,"oct")) return -KEY_oct;
5414 if (strEQ(d,"our")) return KEY_our;
5417 if (strEQ(d,"open")) return -KEY_open;
5420 if (strEQ(d,"opendir")) return -KEY_opendir;
5427 if (strEQ(d,"pop")) return KEY_pop;
5428 if (strEQ(d,"pos")) return KEY_pos;
5431 if (strEQ(d,"push")) return KEY_push;
5432 if (strEQ(d,"pack")) return -KEY_pack;
5433 if (strEQ(d,"pipe")) return -KEY_pipe;
5436 if (strEQ(d,"print")) return KEY_print;
5439 if (strEQ(d,"printf")) return KEY_printf;
5442 if (strEQ(d,"package")) return KEY_package;
5445 if (strEQ(d,"prototype")) return KEY_prototype;
5450 if (strEQ(d,"q")) return KEY_q;
5451 if (strEQ(d,"qr")) return KEY_qr;
5452 if (strEQ(d,"qq")) return KEY_qq;
5453 if (strEQ(d,"qw")) return KEY_qw;
5454 if (strEQ(d,"qx")) return KEY_qx;
5456 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5461 if (strEQ(d,"ref")) return -KEY_ref;
5464 if (strEQ(d,"read")) return -KEY_read;
5465 if (strEQ(d,"rand")) return -KEY_rand;
5466 if (strEQ(d,"recv")) return -KEY_recv;
5467 if (strEQ(d,"redo")) return KEY_redo;
5470 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5471 if (strEQ(d,"reset")) return -KEY_reset;
5474 if (strEQ(d,"return")) return KEY_return;
5475 if (strEQ(d,"rename")) return -KEY_rename;
5476 if (strEQ(d,"rindex")) return -KEY_rindex;
5479 if (strEQ(d,"require")) return -KEY_require;
5480 if (strEQ(d,"reverse")) return -KEY_reverse;
5481 if (strEQ(d,"readdir")) return -KEY_readdir;
5484 if (strEQ(d,"readlink")) return -KEY_readlink;
5485 if (strEQ(d,"readline")) return -KEY_readline;
5486 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5489 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5495 case 0: return KEY_s;
5497 if (strEQ(d,"scalar")) return KEY_scalar;
5502 if (strEQ(d,"seek")) return -KEY_seek;
5503 if (strEQ(d,"send")) return -KEY_send;
5506 if (strEQ(d,"semop")) return -KEY_semop;
5509 if (strEQ(d,"select")) return -KEY_select;
5510 if (strEQ(d,"semctl")) return -KEY_semctl;
5511 if (strEQ(d,"semget")) return -KEY_semget;
5514 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5515 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5518 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5519 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5522 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5525 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5526 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5527 if (strEQ(d,"setservent")) return -KEY_setservent;
5530 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5531 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5538 if (strEQ(d,"shift")) return KEY_shift;
5541 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5542 if (strEQ(d,"shmget")) return -KEY_shmget;
5545 if (strEQ(d,"shmread")) return -KEY_shmread;
5548 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5549 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5554 if (strEQ(d,"sin")) return -KEY_sin;
5557 if (strEQ(d,"sleep")) return -KEY_sleep;
5560 if (strEQ(d,"sort")) return KEY_sort;
5561 if (strEQ(d,"socket")) return -KEY_socket;
5562 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5565 if (strEQ(d,"split")) return KEY_split;
5566 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5567 if (strEQ(d,"splice")) return KEY_splice;
5570 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5573 if (strEQ(d,"srand")) return -KEY_srand;
5576 if (strEQ(d,"stat")) return -KEY_stat;
5577 if (strEQ(d,"study")) return KEY_study;
5580 if (strEQ(d,"substr")) return -KEY_substr;
5581 if (strEQ(d,"sub")) return KEY_sub;
5586 if (strEQ(d,"system")) return -KEY_system;
5589 if (strEQ(d,"symlink")) return -KEY_symlink;
5590 if (strEQ(d,"syscall")) return -KEY_syscall;
5591 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5592 if (strEQ(d,"sysread")) return -KEY_sysread;
5593 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5596 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5605 if (strEQ(d,"tr")) return KEY_tr;
5608 if (strEQ(d,"tie")) return KEY_tie;
5611 if (strEQ(d,"tell")) return -KEY_tell;
5612 if (strEQ(d,"tied")) return KEY_tied;
5613 if (strEQ(d,"time")) return -KEY_time;
5616 if (strEQ(d,"times")) return -KEY_times;
5619 if (strEQ(d,"telldir")) return -KEY_telldir;
5622 if (strEQ(d,"truncate")) return -KEY_truncate;
5629 if (strEQ(d,"uc")) return -KEY_uc;
5632 if (strEQ(d,"use")) return KEY_use;
5635 if (strEQ(d,"undef")) return KEY_undef;
5636 if (strEQ(d,"until")) return KEY_until;
5637 if (strEQ(d,"untie")) return KEY_untie;
5638 if (strEQ(d,"utime")) return -KEY_utime;
5639 if (strEQ(d,"umask")) return -KEY_umask;
5642 if (strEQ(d,"unless")) return KEY_unless;
5643 if (strEQ(d,"unpack")) return -KEY_unpack;
5644 if (strEQ(d,"unlink")) return -KEY_unlink;
5647 if (strEQ(d,"unshift")) return KEY_unshift;
5648 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5653 if (strEQ(d,"values")) return -KEY_values;
5654 if (strEQ(d,"vec")) return -KEY_vec;
5659 if (strEQ(d,"warn")) return -KEY_warn;
5660 if (strEQ(d,"wait")) return -KEY_wait;
5663 if (strEQ(d,"while")) return KEY_while;
5664 if (strEQ(d,"write")) return -KEY_write;
5667 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5670 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5675 if (len == 1) return -KEY_x;
5676 if (strEQ(d,"xor")) return -KEY_xor;
5679 if (len == 1) return KEY_y;
5688 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5692 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5693 dTHR; /* only for ckWARN */
5694 if (ckWARN(WARN_SYNTAX)) {
5696 for (w = s+2; *w && level; w++) {
5703 for (; *w && isSPACE(*w); w++) ;
5704 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5705 Perl_warner(aTHX_ WARN_SYNTAX,
5706 "%s (...) interpreted as function",name);
5709 while (s < PL_bufend && isSPACE(*s))
5713 while (s < PL_bufend && isSPACE(*s))
5715 if (isIDFIRST_lazy_if(s,UTF)) {
5717 while (isALNUM_lazy_if(s,UTF))
5719 while (s < PL_bufend && isSPACE(*s))
5724 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5728 Perl_croak(aTHX_ "No comma allowed after %s", what);
5733 /* Either returns sv, or mortalizes sv and returns a new SV*.
5734 Best used as sv=new_constant(..., sv, ...).
5735 If s, pv are NULL, calls subroutine with one argument,
5736 and type is used with error messages only. */
5739 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5743 HV *table = GvHV(PL_hintgv); /* ^H */
5747 const char *why1, *why2, *why3;
5749 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5752 why2 = strEQ(key,"charnames")
5753 ? "(possibly a missing \"use charnames ...\")"
5755 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5756 (type ? type: "undef"), why2);
5758 /* This is convoluted and evil ("goto considered harmful")
5759 * but I do not understand the intricacies of all the different
5760 * failure modes of %^H in here. The goal here is to make
5761 * the most probable error message user-friendly. --jhi */
5766 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5767 (type ? type: "undef"), why1, why2, why3);
5769 yyerror(SvPVX(msg));
5773 cvp = hv_fetch(table, key, strlen(key), FALSE);
5774 if (!cvp || !SvOK(*cvp)) {
5777 why3 = "} is not defined";
5780 sv_2mortal(sv); /* Parent created it permanently */
5783 pv = sv_2mortal(newSVpvn(s, len));
5785 typesv = sv_2mortal(newSVpv(type, 0));
5787 typesv = &PL_sv_undef;
5789 PUSHSTACKi(PERLSI_OVERLOAD);
5801 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5805 /* Check the eval first */
5806 if (!PL_in_eval && SvTRUE(ERRSV)) {
5808 sv_catpv(ERRSV, "Propagated");
5809 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5811 res = SvREFCNT_inc(sv);
5815 (void)SvREFCNT_inc(res);
5824 why1 = "Call to &{$^H{";
5826 why3 = "}} did not return a defined value";
5835 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5837 register char *d = dest;
5838 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5841 Perl_croak(aTHX_ ident_too_long);
5842 if (isALNUM(*s)) /* UTF handled below */
5844 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
5849 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5853 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5854 char *t = s + UTF8SKIP(s);
5855 while (*t & 0x80 && is_utf8_mark((U8*)t))
5857 if (d + (t - s) > e)
5858 Perl_croak(aTHX_ ident_too_long);
5859 Copy(s, d, t - s, char);
5872 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
5882 e = d + destlen - 3; /* two-character token, ending NUL */
5884 while (isDIGIT(*s)) {
5886 Perl_croak(aTHX_ ident_too_long);
5893 Perl_croak(aTHX_ ident_too_long);
5894 if (isALNUM(*s)) /* UTF handled below */
5896 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
5901 else if (*s == ':' && s[1] == ':') {
5905 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5906 char *t = s + UTF8SKIP(s);
5907 while (*t & 0x80 && is_utf8_mark((U8*)t))
5909 if (d + (t - s) > e)
5910 Perl_croak(aTHX_ ident_too_long);
5911 Copy(s, d, t - s, char);
5922 if (PL_lex_state != LEX_NORMAL)
5923 PL_lex_state = LEX_INTERPENDMAYBE;
5926 if (*s == '$' && s[1] &&
5927 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
5940 if (*d == '^' && *s && isCONTROLVAR(*s)) {
5945 if (isSPACE(s[-1])) {
5948 if (!SPACE_OR_TAB(ch)) {
5954 if (isIDFIRST_lazy_if(d,UTF)) {
5958 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
5960 while (e < send && *e & 0x80 && is_utf8_mark((U8*)e))
5963 Copy(s, d, e - s, char);
5968 while ((isALNUM(*s) || *s == ':') && d < e)
5971 Perl_croak(aTHX_ ident_too_long);
5974 while (s < send && SPACE_OR_TAB(*s)) s++;
5975 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
5976 dTHR; /* only for ckWARN */
5977 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
5978 const char *brack = *s == '[' ? "[...]" : "{...}";
5979 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5980 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
5981 funny, dest, brack, funny, dest, brack);
5984 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
5988 /* Handle extended ${^Foo} variables
5989 * 1999-02-27 mjd-perl-patch@plover.com */
5990 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
5994 while (isALNUM(*s) && d < e) {
5998 Perl_croak(aTHX_ ident_too_long);
6003 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6004 PL_lex_state = LEX_INTERPEND;
6007 if (PL_lex_state == LEX_NORMAL) {
6008 dTHR; /* only for ckWARN */
6009 if (ckWARN(WARN_AMBIGUOUS) &&
6010 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6012 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6013 "Ambiguous use of %c{%s} resolved to %c%s",
6014 funny, dest, funny, dest);
6019 s = bracket; /* let the parser handle it */
6023 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6024 PL_lex_state = LEX_INTERPEND;
6029 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6034 *pmfl |= PMf_GLOBAL;
6036 *pmfl |= PMf_CONTINUE;
6040 *pmfl |= PMf_MULTILINE;
6042 *pmfl |= PMf_SINGLELINE;
6044 *pmfl |= PMf_EXTENDED;
6048 S_scan_pat(pTHX_ char *start, I32 type)
6053 s = scan_str(start,FALSE,FALSE);
6056 SvREFCNT_dec(PL_lex_stuff);
6057 PL_lex_stuff = Nullsv;
6058 Perl_croak(aTHX_ "Search pattern not terminated");
6061 pm = (PMOP*)newPMOP(type, 0);
6062 if (PL_multi_open == '?')
6063 pm->op_pmflags |= PMf_ONCE;
6065 while (*s && strchr("iomsx", *s))
6066 pmflag(&pm->op_pmflags,*s++);
6069 while (*s && strchr("iogcmsx", *s))
6070 pmflag(&pm->op_pmflags,*s++);
6072 pm->op_pmpermflags = pm->op_pmflags;
6074 PL_lex_op = (OP*)pm;
6075 yylval.ival = OP_MATCH;
6080 S_scan_subst(pTHX_ char *start)
6087 yylval.ival = OP_NULL;
6089 s = scan_str(start,FALSE,FALSE);
6093 SvREFCNT_dec(PL_lex_stuff);
6094 PL_lex_stuff = Nullsv;
6095 Perl_croak(aTHX_ "Substitution pattern not terminated");
6098 if (s[-1] == PL_multi_open)
6101 first_start = PL_multi_start;
6102 s = scan_str(s,FALSE,FALSE);
6105 SvREFCNT_dec(PL_lex_stuff);
6106 PL_lex_stuff = Nullsv;
6108 SvREFCNT_dec(PL_lex_repl);
6109 PL_lex_repl = Nullsv;
6110 Perl_croak(aTHX_ "Substitution replacement not terminated");
6112 PL_multi_start = first_start; /* so whole substitution is taken together */
6114 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6120 else if (strchr("iogcmsx", *s))
6121 pmflag(&pm->op_pmflags,*s++);
6128 PL_sublex_info.super_bufptr = s;
6129 PL_sublex_info.super_bufend = PL_bufend;
6131 pm->op_pmflags |= PMf_EVAL;
6132 repl = newSVpvn("",0);
6134 sv_catpv(repl, es ? "eval " : "do ");
6135 sv_catpvn(repl, "{ ", 2);
6136 sv_catsv(repl, PL_lex_repl);
6137 sv_catpvn(repl, " };", 2);
6139 SvREFCNT_dec(PL_lex_repl);
6143 pm->op_pmpermflags = pm->op_pmflags;
6144 PL_lex_op = (OP*)pm;
6145 yylval.ival = OP_SUBST;
6150 S_scan_trans(pTHX_ char *start)
6161 yylval.ival = OP_NULL;
6163 s = scan_str(start,FALSE,FALSE);
6166 SvREFCNT_dec(PL_lex_stuff);
6167 PL_lex_stuff = Nullsv;
6168 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6170 if (s[-1] == PL_multi_open)
6173 s = scan_str(s,FALSE,FALSE);
6176 SvREFCNT_dec(PL_lex_stuff);
6177 PL_lex_stuff = Nullsv;
6179 SvREFCNT_dec(PL_lex_repl);
6180 PL_lex_repl = Nullsv;
6181 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6184 New(803,tbl,256,short);
6185 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6187 complement = del = squash = 0;
6188 while (strchr("cds", *s)) {
6190 complement = OPpTRANS_COMPLEMENT;
6192 del = OPpTRANS_DELETE;
6194 squash = OPpTRANS_SQUASH;
6197 o->op_private = del|squash|complement;
6200 yylval.ival = OP_TRANS;
6205 S_scan_heredoc(pTHX_ register char *s)
6209 I32 op_type = OP_SCALAR;
6216 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6220 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6223 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6224 if (*peek && strchr("`'\"",*peek)) {
6227 s = delimcpy(d, e, s, PL_bufend, term, &len);
6237 if (!isALNUM_lazy_if(s,UTF))
6238 deprecate("bare << to mean <<\"\"");
6239 for (; isALNUM_lazy_if(s,UTF); s++) {
6244 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6245 Perl_croak(aTHX_ "Delimiter for here document is too long");
6248 len = d - PL_tokenbuf;
6249 #ifndef PERL_STRICT_CR
6250 d = strchr(s, '\r');
6254 while (s < PL_bufend) {
6260 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6269 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6274 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6275 herewas = newSVpvn(s,PL_bufend-s);
6277 s--, herewas = newSVpvn(s,d-s);
6278 s += SvCUR(herewas);
6280 tmpstr = NEWSV(87,79);
6281 sv_upgrade(tmpstr, SVt_PVIV);
6286 else if (term == '`') {
6287 op_type = OP_BACKTICK;
6288 SvIVX(tmpstr) = '\\';
6292 PL_multi_start = CopLINE(PL_curcop);
6293 PL_multi_open = PL_multi_close = '<';
6294 term = *PL_tokenbuf;
6295 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6296 char *bufptr = PL_sublex_info.super_bufptr;
6297 char *bufend = PL_sublex_info.super_bufend;
6298 char *olds = s - SvCUR(herewas);
6299 s = strchr(bufptr, '\n');
6303 while (s < bufend &&
6304 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6306 CopLINE_inc(PL_curcop);
6309 CopLINE_set(PL_curcop, PL_multi_start);
6310 missingterm(PL_tokenbuf);
6312 sv_setpvn(herewas,bufptr,d-bufptr+1);
6313 sv_setpvn(tmpstr,d+1,s-d);
6315 sv_catpvn(herewas,s,bufend-s);
6316 (void)strcpy(bufptr,SvPVX(herewas));
6323 while (s < PL_bufend &&
6324 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6326 CopLINE_inc(PL_curcop);
6328 if (s >= PL_bufend) {
6329 CopLINE_set(PL_curcop, PL_multi_start);
6330 missingterm(PL_tokenbuf);
6332 sv_setpvn(tmpstr,d+1,s-d);
6334 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6336 sv_catpvn(herewas,s,PL_bufend-s);
6337 sv_setsv(PL_linestr,herewas);
6338 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6339 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6342 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6343 while (s >= PL_bufend) { /* multiple line string? */
6345 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6346 CopLINE_set(PL_curcop, PL_multi_start);
6347 missingterm(PL_tokenbuf);
6349 CopLINE_inc(PL_curcop);
6350 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6351 #ifndef PERL_STRICT_CR
6352 if (PL_bufend - PL_linestart >= 2) {
6353 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6354 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6356 PL_bufend[-2] = '\n';
6358 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6360 else if (PL_bufend[-1] == '\r')
6361 PL_bufend[-1] = '\n';
6363 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6364 PL_bufend[-1] = '\n';
6366 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6367 SV *sv = NEWSV(88,0);
6369 sv_upgrade(sv, SVt_PVMG);
6370 sv_setsv(sv,PL_linestr);
6371 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6373 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6376 sv_catsv(PL_linestr,herewas);
6377 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6381 sv_catsv(tmpstr,PL_linestr);
6386 PL_multi_end = CopLINE(PL_curcop);
6387 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6388 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6389 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6391 SvREFCNT_dec(herewas);
6392 PL_lex_stuff = tmpstr;
6393 yylval.ival = op_type;
6398 takes: current position in input buffer
6399 returns: new position in input buffer
6400 side-effects: yylval and lex_op are set.
6405 <FH> read from filehandle
6406 <pkg::FH> read from package qualified filehandle
6407 <pkg'FH> read from package qualified filehandle
6408 <$fh> read from filehandle in $fh
6414 S_scan_inputsymbol(pTHX_ char *start)
6416 register char *s = start; /* current position in buffer */
6422 d = PL_tokenbuf; /* start of temp holding space */
6423 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6424 end = strchr(s, '\n');
6427 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6429 /* die if we didn't have space for the contents of the <>,
6430 or if it didn't end, or if we see a newline
6433 if (len >= sizeof PL_tokenbuf)
6434 Perl_croak(aTHX_ "Excessively long <> operator");
6436 Perl_croak(aTHX_ "Unterminated <> operator");
6441 Remember, only scalar variables are interpreted as filehandles by
6442 this code. Anything more complex (e.g., <$fh{$num}>) will be
6443 treated as a glob() call.
6444 This code makes use of the fact that except for the $ at the front,
6445 a scalar variable and a filehandle look the same.
6447 if (*d == '$' && d[1]) d++;
6449 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6450 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6453 /* If we've tried to read what we allow filehandles to look like, and
6454 there's still text left, then it must be a glob() and not a getline.
6455 Use scan_str to pull out the stuff between the <> and treat it
6456 as nothing more than a string.
6459 if (d - PL_tokenbuf != len) {
6460 yylval.ival = OP_GLOB;
6462 s = scan_str(start,FALSE,FALSE);
6464 Perl_croak(aTHX_ "Glob not terminated");
6468 /* we're in a filehandle read situation */
6471 /* turn <> into <ARGV> */
6473 (void)strcpy(d,"ARGV");
6475 /* if <$fh>, create the ops to turn the variable into a
6481 /* try to find it in the pad for this block, otherwise find
6482 add symbol table ops
6484 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6485 OP *o = newOP(OP_PADSV, 0);
6487 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6490 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6491 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6492 newUNOP(OP_RV2SV, 0,
6493 newGVOP(OP_GV, 0, gv)));
6495 PL_lex_op->op_flags |= OPf_SPECIAL;
6496 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6497 yylval.ival = OP_NULL;
6500 /* If it's none of the above, it must be a literal filehandle
6501 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6503 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6504 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6505 yylval.ival = OP_NULL;
6514 takes: start position in buffer
6515 keep_quoted preserve \ on the embedded delimiter(s)
6516 keep_delims preserve the delimiters around the string
6517 returns: position to continue reading from buffer
6518 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6519 updates the read buffer.
6521 This subroutine pulls a string out of the input. It is called for:
6522 q single quotes q(literal text)
6523 ' single quotes 'literal text'
6524 qq double quotes qq(interpolate $here please)
6525 " double quotes "interpolate $here please"
6526 qx backticks qx(/bin/ls -l)
6527 ` backticks `/bin/ls -l`
6528 qw quote words @EXPORT_OK = qw( func() $spam )
6529 m// regexp match m/this/
6530 s/// regexp substitute s/this/that/
6531 tr/// string transliterate tr/this/that/
6532 y/// string transliterate y/this/that/
6533 ($*@) sub prototypes sub foo ($)
6534 (stuff) sub attr parameters sub foo : attr(stuff)
6535 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6537 In most of these cases (all but <>, patterns and transliterate)
6538 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6539 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6540 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6543 It skips whitespace before the string starts, and treats the first
6544 character as the delimiter. If the delimiter is one of ([{< then
6545 the corresponding "close" character )]}> is used as the closing
6546 delimiter. It allows quoting of delimiters, and if the string has
6547 balanced delimiters ([{<>}]) it allows nesting.
6549 The lexer always reads these strings into lex_stuff, except in the
6550 case of the operators which take *two* arguments (s/// and tr///)
6551 when it checks to see if lex_stuff is full (presumably with the 1st
6552 arg to s or tr) and if so puts the string into lex_repl.
6557 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6560 SV *sv; /* scalar value: string */
6561 char *tmps; /* temp string, used for delimiter matching */
6562 register char *s = start; /* current position in the buffer */
6563 register char term; /* terminating character */
6564 register char *to; /* current position in the sv's data */
6565 I32 brackets = 1; /* bracket nesting level */
6566 bool has_utf8 = FALSE; /* is there any utf8 content? */
6568 /* skip space before the delimiter */
6572 /* mark where we are, in case we need to report errors */
6575 /* after skipping whitespace, the next character is the terminator */
6577 if ((term & 0x80) && UTF)
6580 /* mark where we are */
6581 PL_multi_start = CopLINE(PL_curcop);
6582 PL_multi_open = term;
6584 /* find corresponding closing delimiter */
6585 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6587 PL_multi_close = term;
6589 /* create a new SV to hold the contents. 87 is leak category, I'm
6590 assuming. 79 is the SV's initial length. What a random number. */
6592 sv_upgrade(sv, SVt_PVIV);
6594 (void)SvPOK_only(sv); /* validate pointer */
6596 /* move past delimiter and try to read a complete string */
6598 sv_catpvn(sv, s, 1);
6601 /* extend sv if need be */
6602 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6603 /* set 'to' to the next character in the sv's string */
6604 to = SvPVX(sv)+SvCUR(sv);
6606 /* if open delimiter is the close delimiter read unbridle */
6607 if (PL_multi_open == PL_multi_close) {
6608 for (; s < PL_bufend; s++,to++) {
6609 /* embedded newlines increment the current line number */
6610 if (*s == '\n' && !PL_rsfp)
6611 CopLINE_inc(PL_curcop);
6612 /* handle quoted delimiters */
6613 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6614 if (!keep_quoted && s[1] == term)
6616 /* any other quotes are simply copied straight through */
6620 /* terminate when run out of buffer (the for() condition), or
6621 have found the terminator */
6622 else if (*s == term)
6624 else if (!has_utf8 && (*s & 0x80) && UTF)
6630 /* if the terminator isn't the same as the start character (e.g.,
6631 matched brackets), we have to allow more in the quoting, and
6632 be prepared for nested brackets.
6635 /* read until we run out of string, or we find the terminator */
6636 for (; s < PL_bufend; s++,to++) {
6637 /* embedded newlines increment the line count */
6638 if (*s == '\n' && !PL_rsfp)
6639 CopLINE_inc(PL_curcop);
6640 /* backslashes can escape the open or closing characters */
6641 if (*s == '\\' && s+1 < PL_bufend) {
6643 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6648 /* allow nested opens and closes */
6649 else if (*s == PL_multi_close && --brackets <= 0)
6651 else if (*s == PL_multi_open)
6653 else if (!has_utf8 && (*s & 0x80) && UTF)
6658 /* terminate the copied string and update the sv's end-of-string */
6660 SvCUR_set(sv, to - SvPVX(sv));
6663 * this next chunk reads more into the buffer if we're not done yet
6667 break; /* handle case where we are done yet :-) */
6669 #ifndef PERL_STRICT_CR
6670 if (to - SvPVX(sv) >= 2) {
6671 if ((to[-2] == '\r' && to[-1] == '\n') ||
6672 (to[-2] == '\n' && to[-1] == '\r'))
6676 SvCUR_set(sv, to - SvPVX(sv));
6678 else if (to[-1] == '\r')
6681 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6685 /* if we're out of file, or a read fails, bail and reset the current
6686 line marker so we can report where the unterminated string began
6689 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6691 CopLINE_set(PL_curcop, PL_multi_start);
6694 /* we read a line, so increment our line counter */
6695 CopLINE_inc(PL_curcop);
6697 /* update debugger info */
6698 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6699 SV *sv = NEWSV(88,0);
6701 sv_upgrade(sv, SVt_PVMG);
6702 sv_setsv(sv,PL_linestr);
6703 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6706 /* having changed the buffer, we must update PL_bufend */
6707 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6710 /* at this point, we have successfully read the delimited string */
6713 sv_catpvn(sv, s, 1);
6716 PL_multi_end = CopLINE(PL_curcop);
6719 /* if we allocated too much space, give some back */
6720 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6721 SvLEN_set(sv, SvCUR(sv) + 1);
6722 Renew(SvPVX(sv), SvLEN(sv), char);
6725 /* decide whether this is the first or second quoted string we've read
6738 takes: pointer to position in buffer
6739 returns: pointer to new position in buffer
6740 side-effects: builds ops for the constant in yylval.op
6742 Read a number in any of the formats that Perl accepts:
6744 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6745 [\d_]+(\.[\d_]*)?[Ee](\d+)
6747 Underbars (_) are allowed in decimal numbers. If -w is on,
6748 underbars before a decimal point must be at three digit intervals.
6750 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6753 If it reads a number without a decimal point or an exponent, it will
6754 try converting the number to an integer and see if it can do so
6755 without loss of precision.
6759 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6761 register char *s = start; /* current position in buffer */
6762 register char *d; /* destination in temp buffer */
6763 register char *e; /* end of temp buffer */
6764 NV nv; /* number read, as a double */
6765 SV *sv = Nullsv; /* place to put the converted number */
6766 bool floatit; /* boolean: int or float? */
6767 char *lastub = 0; /* position of last underbar */
6768 static char number_too_long[] = "Number too long";
6770 /* We use the first character to decide what type of number this is */
6774 Perl_croak(aTHX_ "panic: scan_num");
6776 /* if it starts with a 0, it could be an octal number, a decimal in
6777 0.13 disguise, or a hexadecimal number, or a binary number. */
6781 u holds the "number so far"
6782 shift the power of 2 of the base
6783 (hex == 4, octal == 3, binary == 1)
6784 overflowed was the number more than we can hold?
6786 Shift is used when we add a digit. It also serves as an "are
6787 we in octal/hex/binary?" indicator to disallow hex characters
6794 bool overflowed = FALSE;
6795 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6796 static char* bases[5] = { "", "binary", "", "octal",
6798 static char* Bases[5] = { "", "Binary", "", "Octal",
6800 static char *maxima[5] = { "",
6801 "0b11111111111111111111111111111111",
6805 char *base, *Base, *max;
6811 } else if (s[1] == 'b') {
6815 /* check for a decimal in disguise */
6816 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6818 /* so it must be octal */
6822 base = bases[shift];
6823 Base = Bases[shift];
6824 max = maxima[shift];
6826 /* read the rest of the number */
6828 /* x is used in the overflow test,
6829 b is the digit we're adding on. */
6834 /* if we don't mention it, we're done */
6843 /* 8 and 9 are not octal */
6846 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6850 case '2': case '3': case '4':
6851 case '5': case '6': case '7':
6853 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6857 b = *s++ & 15; /* ASCII digit -> value of digit */
6861 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6862 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6863 /* make sure they said 0x */
6868 /* Prepare to put the digit we have onto the end
6869 of the number so far. We check for overflows.
6874 x = u << shift; /* make room for the digit */
6876 if ((x >> shift) != u
6877 && !(PL_hints & HINT_NEW_BINARY)) {
6881 if (ckWARN_d(WARN_OVERFLOW))
6882 Perl_warner(aTHX_ WARN_OVERFLOW,
6883 "Integer overflow in %s number",
6886 u = x | b; /* add the digit to the end */
6889 n *= nvshift[shift];
6890 /* If an NV has not enough bits in its
6891 * mantissa to represent an UV this summing of
6892 * small low-order numbers is a waste of time
6893 * (because the NV cannot preserve the
6894 * low-order bits anyway): we could just
6895 * remember when did we overflow and in the
6896 * end just multiply n by the right
6904 /* if we get here, we had success: make a scalar value from
6911 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
6912 Perl_warner(aTHX_ WARN_PORTABLE,
6913 "%s number > %s non-portable",
6920 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
6921 Perl_warner(aTHX_ WARN_PORTABLE,
6922 "%s number > %s non-portable",
6927 if (PL_hints & HINT_NEW_BINARY)
6928 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
6933 handle decimal numbers.
6934 we're also sent here when we read a 0 as the first digit
6936 case '1': case '2': case '3': case '4': case '5':
6937 case '6': case '7': case '8': case '9': case '.':
6940 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
6943 /* read next group of digits and _ and copy into d */
6944 while (isDIGIT(*s) || *s == '_') {
6945 /* skip underscores, checking for misplaced ones
6949 dTHR; /* only for ckWARN */
6950 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
6951 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6955 /* check for end of fixed-length buffer */
6957 Perl_croak(aTHX_ number_too_long);
6958 /* if we're ok, copy the character */
6963 /* final misplaced underbar check */
6964 if (lastub && s - lastub != 3) {
6966 if (ckWARN(WARN_SYNTAX))
6967 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6970 /* read a decimal portion if there is one. avoid
6971 3..5 being interpreted as the number 3. followed
6974 if (*s == '.' && s[1] != '.') {
6978 /* copy, ignoring underbars, until we run out of
6979 digits. Note: no misplaced underbar checks!
6981 for (; isDIGIT(*s) || *s == '_'; s++) {
6982 /* fixed length buffer check */
6984 Perl_croak(aTHX_ number_too_long);
6988 if (*s == '.' && isDIGIT(s[1])) {
6989 /* oops, it's really a v-string, but without the "v" */
6995 /* read exponent part, if present */
6996 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
7000 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7001 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7003 /* allow positive or negative exponent */
7004 if (*s == '+' || *s == '-')
7007 /* read digits of exponent (no underbars :-) */
7008 while (isDIGIT(*s)) {
7010 Perl_croak(aTHX_ number_too_long);
7015 /* terminate the string */
7018 /* make an sv from the string */
7021 #if defined(Strtol) && defined(Strtoul)
7024 strtol/strtoll sets errno to ERANGE if the number is too big
7025 for an integer. We try to do an integer conversion first
7026 if no characters indicating "float" have been found.
7033 if (*PL_tokenbuf == '-')
7034 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7036 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7038 floatit = TRUE; /* Probably just too large. */
7039 else if (*PL_tokenbuf == '-')
7041 else if (uv <= IV_MAX)
7042 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7047 nv = Atof(PL_tokenbuf);
7052 No working strtou?ll?.
7054 Unfortunately atol() doesn't do range checks (returning
7055 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7056 everywhere [1], so we cannot use use atol() (or atoll()).
7057 If we could, they would be used, as Atol(), very much like
7058 Strtol() and Strtoul() are used above.
7060 [1] XXX Configure test needed to check for atol()
7061 (and atoll()) overflow behaviour XXX
7065 We need to do this the hard way. */
7067 nv = Atof(PL_tokenbuf);
7069 /* See if we can make do with an integer value without loss of
7070 precision. We use U_V to cast to a UV, because some
7071 compilers have issues. Then we try casting it back and see
7072 if it was the same [1]. We only do this if we know we
7073 specifically read an integer. If floatit is true, then we
7074 don't need to do the conversion at all.
7076 [1] Note that this is lossy if our NVs cannot preserve our
7077 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7078 and NV_PRESERVES_UV_BITS (a number), but in general we really
7079 do hope all such potentially lossy platforms have strtou?ll?
7080 to do a lossless IV/UV conversion.
7082 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7083 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7084 as NV_DIG and NV_MANT_DIG)?
7090 if (!floatit && (NV)uv == nv) {
7092 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7100 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7101 (PL_hints & HINT_NEW_INTEGER) )
7102 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7103 (floatit ? "float" : "integer"),
7107 /* if it starts with a v, it could be a v-string */
7113 while (isDIGIT(*pos) || *pos == '_')
7115 if (!isALPHA(*pos)) {
7117 U8 tmpbuf[UTF8_MAXLEN];
7120 s++; /* get past 'v' */
7123 sv_setpvn(sv, "", 0);
7126 if (*s == '0' && isDIGIT(s[1]))
7127 yyerror("Octal number in vector unsupported");
7130 /* this is atoi() that tolerates underscores */
7133 while (--end >= s) {
7138 rev += (*end - '0') * mult;
7140 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7141 Perl_warner(aTHX_ WARN_OVERFLOW,
7142 "Integer overflow in decimal number");
7145 tmpend = uv_to_utf8(tmpbuf, rev);
7146 utf8 = utf8 || rev > 127;
7147 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7148 if (*pos == '.' && isDIGIT(pos[1]))
7154 while (isDIGIT(*pos) || *pos == '_')
7162 sv_utf8_downgrade(sv, TRUE);
7169 /* make the op for the constant and return */
7172 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7174 lvalp->opval = Nullop;
7180 S_scan_formline(pTHX_ register char *s)
7185 SV *stuff = newSVpvn("",0);
7186 bool needargs = FALSE;
7189 if (*s == '.' || *s == /*{*/'}') {
7191 #ifdef PERL_STRICT_CR
7192 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7194 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7196 if (*t == '\n' || t == PL_bufend)
7199 if (PL_in_eval && !PL_rsfp) {
7200 eol = strchr(s,'\n');
7205 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7207 for (t = s; t < eol; t++) {
7208 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7210 goto enough; /* ~~ must be first line in formline */
7212 if (*t == '@' || *t == '^')
7215 sv_catpvn(stuff, s, eol-s);
7216 #ifndef PERL_STRICT_CR
7217 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7218 char *end = SvPVX(stuff) + SvCUR(stuff);
7227 s = filter_gets(PL_linestr, PL_rsfp, 0);
7228 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7229 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7232 yyerror("Format not terminated");
7242 PL_lex_state = LEX_NORMAL;
7243 PL_nextval[PL_nexttoke].ival = 0;
7247 PL_lex_state = LEX_FORMLINE;
7248 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7250 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7254 SvREFCNT_dec(stuff);
7255 PL_lex_formbrack = 0;
7266 PL_cshlen = strlen(PL_cshname);
7271 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7274 I32 oldsavestack_ix = PL_savestack_ix;
7275 CV* outsidecv = PL_compcv;
7279 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7281 SAVEI32(PL_subline);
7282 save_item(PL_subname);
7285 SAVESPTR(PL_comppad_name);
7286 SAVESPTR(PL_compcv);
7287 SAVEI32(PL_comppad_name_fill);
7288 SAVEI32(PL_min_intro_pending);
7289 SAVEI32(PL_max_intro_pending);
7290 SAVEI32(PL_pad_reset_pending);
7292 PL_compcv = (CV*)NEWSV(1104,0);
7293 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7294 CvFLAGS(PL_compcv) |= flags;
7296 PL_comppad = newAV();
7297 av_push(PL_comppad, Nullsv);
7298 PL_curpad = AvARRAY(PL_comppad);
7299 PL_comppad_name = newAV();
7300 PL_comppad_name_fill = 0;
7301 PL_min_intro_pending = 0;
7303 PL_subline = CopLINE(PL_curcop);
7305 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7306 PL_curpad[0] = (SV*)newAV();
7307 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7308 #endif /* USE_THREADS */
7310 comppadlist = newAV();
7311 AvREAL_off(comppadlist);
7312 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7313 av_store(comppadlist, 1, (SV*)PL_comppad);
7315 CvPADLIST(PL_compcv) = comppadlist;
7316 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7318 CvOWNER(PL_compcv) = 0;
7319 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7320 MUTEX_INIT(CvMUTEXP(PL_compcv));
7321 #endif /* USE_THREADS */
7323 return oldsavestack_ix;
7327 Perl_yywarn(pTHX_ char *s)
7330 PL_in_eval |= EVAL_WARNONLY;
7332 PL_in_eval &= ~EVAL_WARNONLY;
7337 Perl_yyerror(pTHX_ char *s)
7341 char *context = NULL;
7345 if (!yychar || (yychar == ';' && !PL_rsfp))
7347 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7348 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7349 while (isSPACE(*PL_oldoldbufptr))
7351 context = PL_oldoldbufptr;
7352 contlen = PL_bufptr - PL_oldoldbufptr;
7354 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7355 PL_oldbufptr != PL_bufptr) {
7356 while (isSPACE(*PL_oldbufptr))
7358 context = PL_oldbufptr;
7359 contlen = PL_bufptr - PL_oldbufptr;
7361 else if (yychar > 255)
7362 where = "next token ???";
7363 #ifdef USE_PURE_BISON
7364 /* GNU Bison sets the value -2 */
7365 else if (yychar == -2) {
7367 else if ((yychar & 127) == 127) {
7369 if (PL_lex_state == LEX_NORMAL ||
7370 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7371 where = "at end of line";
7372 else if (PL_lex_inpat)
7373 where = "within pattern";
7375 where = "within string";
7378 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7380 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7381 else if (isPRINT_LC(yychar))
7382 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7384 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7385 where = SvPVX(where_sv);
7387 msg = sv_2mortal(newSVpv(s, 0));
7388 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7389 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7391 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7393 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7394 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7395 Perl_sv_catpvf(aTHX_ msg,
7396 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7397 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7400 if (PL_in_eval & EVAL_WARNONLY)
7401 Perl_warn(aTHX_ "%"SVf, msg);
7404 if (PL_error_count >= 10) {
7405 if (PL_in_eval && SvCUR(ERRSV))
7406 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7407 ERRSV, CopFILE(PL_curcop));
7409 Perl_croak(aTHX_ "%s has too many errors.\n",
7410 CopFILE(PL_curcop));
7413 PL_in_my_stash = Nullhv;
7418 S_swallow_bom(pTHX_ U8 *s)
7421 slen = SvCUR(PL_linestr);
7425 /* UTF-16 little-endian */
7426 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7427 Perl_croak(aTHX_ "Unsupported script encoding");
7428 #ifndef PERL_NO_UTF16_FILTER
7429 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7431 if (PL_bufend > (char*)s) {
7435 filter_add(utf16rev_textfilter, NULL);
7436 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7437 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7438 PL_bufend - (char*)s - 1,
7440 Copy(news, s, newlen, U8);
7441 SvCUR_set(PL_linestr, newlen);
7442 PL_bufend = SvPVX(PL_linestr) + newlen;
7443 news[newlen++] = '\0';
7447 Perl_croak(aTHX_ "Unsupported script encoding");
7452 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7453 #ifndef PERL_NO_UTF16_FILTER
7454 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7456 if (PL_bufend > (char *)s) {
7460 filter_add(utf16_textfilter, NULL);
7461 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7462 PL_bufend = (char*)utf16_to_utf8(s, news,
7463 PL_bufend - (char*)s,
7465 Copy(news, s, newlen, U8);
7466 SvCUR_set(PL_linestr, newlen);
7467 PL_bufend = SvPVX(PL_linestr) + newlen;
7468 news[newlen++] = '\0';
7472 Perl_croak(aTHX_ "Unsupported script encoding");
7477 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7478 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7483 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7484 s[2] == 0xFE && s[3] == 0xFF)
7486 Perl_croak(aTHX_ "Unsupported script encoding");
7498 * Restore a source filter.
7502 restore_rsfp(pTHXo_ void *f)
7504 PerlIO *fp = (PerlIO*)f;
7506 if (PL_rsfp == PerlIO_stdin())
7507 PerlIO_clearerr(PL_rsfp);
7508 else if (PL_rsfp && (PL_rsfp != fp))
7509 PerlIO_close(PL_rsfp);
7513 #ifndef PERL_NO_UTF16_FILTER
7515 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7517 I32 count = FILTER_READ(idx+1, sv, maxlen);
7522 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7523 if (!*SvPV_nolen(sv))
7524 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7527 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7528 sv_usepvn(sv, (char*)tmps, tend - tmps);
7534 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7536 I32 count = FILTER_READ(idx+1, sv, maxlen);
7541 if (!*SvPV_nolen(sv))
7542 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7545 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7546 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7547 sv_usepvn(sv, (char*)tmps, tend - tmps);