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);
2523 bool bof = PL_rsfp ? TRUE : FALSE;
2525 #ifdef PERLIO_IS_STDIO
2526 # ifdef __GNU_LIBRARY__
2527 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2528 # define FTELL_FOR_PIPE_IS_BROKEN
2532 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2533 # define FTELL_FOR_PIPE_IS_BROKEN
2538 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2539 /* This loses the possibility to detect the bof
2540 * situation on perl -P when the libc5 is being used.
2541 * Workaround? Maybe attach some extra state to PL_rsfp?
2544 bof = PerlIO_tell(PL_rsfp) == 0;
2546 bof = PerlIO_tell(PL_rsfp) == 0;
2549 s = filter_gets(PL_linestr, PL_rsfp, 0);
2553 if (PL_preprocess && !PL_in_eval)
2554 (void)PerlProc_pclose(PL_rsfp);
2555 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2556 PerlIO_clearerr(PL_rsfp);
2558 (void)PerlIO_close(PL_rsfp);
2560 PL_doextract = FALSE;
2562 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2563 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2564 sv_catpv(PL_linestr,";}");
2565 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2566 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2567 PL_minus_n = PL_minus_p = 0;
2570 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2571 sv_setpv(PL_linestr,"");
2572 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2574 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2575 s = swallow_bom((U8*)s);
2578 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2579 PL_doextract = FALSE;
2581 /* Incest with pod. */
2582 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2583 sv_setpv(PL_linestr, "");
2584 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2585 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2586 PL_doextract = FALSE;
2590 } while (PL_doextract);
2591 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2592 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2593 SV *sv = NEWSV(85,0);
2595 sv_upgrade(sv, SVt_PVMG);
2596 sv_setsv(sv,PL_linestr);
2597 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2599 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2600 if (CopLINE(PL_curcop) == 1) {
2601 while (s < PL_bufend && isSPACE(*s))
2603 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2607 if (*s == '#' && *(s+1) == '!')
2609 #ifdef ALTERNATE_SHEBANG
2611 static char as[] = ALTERNATE_SHEBANG;
2612 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2613 d = s + (sizeof(as) - 1);
2615 #endif /* ALTERNATE_SHEBANG */
2624 while (*d && !isSPACE(*d))
2628 #ifdef ARG_ZERO_IS_SCRIPT
2629 if (ipathend > ipath) {
2631 * HP-UX (at least) sets argv[0] to the script name,
2632 * which makes $^X incorrect. And Digital UNIX and Linux,
2633 * at least, set argv[0] to the basename of the Perl
2634 * interpreter. So, having found "#!", we'll set it right.
2636 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2637 assert(SvPOK(x) || SvGMAGICAL(x));
2638 if (sv_eq(x, CopFILESV(PL_curcop))) {
2639 sv_setpvn(x, ipath, ipathend - ipath);
2642 TAINT_NOT; /* $^X is always tainted, but that's OK */
2644 #endif /* ARG_ZERO_IS_SCRIPT */
2649 d = instr(s,"perl -");
2651 d = instr(s,"perl");
2653 /* avoid getting into infinite loops when shebang
2654 * line contains "Perl" rather than "perl" */
2656 for (d = ipathend-4; d >= ipath; --d) {
2657 if ((*d == 'p' || *d == 'P')
2658 && !ibcmp(d, "perl", 4))
2668 #ifdef ALTERNATE_SHEBANG
2670 * If the ALTERNATE_SHEBANG on this system starts with a
2671 * character that can be part of a Perl expression, then if
2672 * we see it but not "perl", we're probably looking at the
2673 * start of Perl code, not a request to hand off to some
2674 * other interpreter. Similarly, if "perl" is there, but
2675 * not in the first 'word' of the line, we assume the line
2676 * contains the start of the Perl program.
2678 if (d && *s != '#') {
2680 while (*c && !strchr("; \t\r\n\f\v#", *c))
2683 d = Nullch; /* "perl" not in first word; ignore */
2685 *s = '#'; /* Don't try to parse shebang line */
2687 #endif /* ALTERNATE_SHEBANG */
2688 #ifndef MACOS_TRADITIONAL
2693 !instr(s,"indir") &&
2694 instr(PL_origargv[0],"perl"))
2700 while (s < PL_bufend && isSPACE(*s))
2702 if (s < PL_bufend) {
2703 Newz(899,newargv,PL_origargc+3,char*);
2705 while (s < PL_bufend && !isSPACE(*s))
2708 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2711 newargv = PL_origargv;
2713 PerlProc_execv(ipath, newargv);
2714 Perl_croak(aTHX_ "Can't exec %s", ipath);
2718 U32 oldpdb = PL_perldb;
2719 bool oldn = PL_minus_n;
2720 bool oldp = PL_minus_p;
2722 while (*d && !isSPACE(*d)) d++;
2723 while (SPACE_OR_TAB(*d)) d++;
2727 if (*d == 'M' || *d == 'm') {
2729 while (*d && !isSPACE(*d)) d++;
2730 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2733 d = moreswitches(d);
2735 if ((PERLDB_LINE && !oldpdb) ||
2736 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2737 /* if we have already added "LINE: while (<>) {",
2738 we must not do it again */
2740 sv_setpv(PL_linestr, "");
2741 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2742 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2743 PL_preambled = FALSE;
2745 (void)gv_fetchfile(PL_origfilename);
2752 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2754 PL_lex_state = LEX_FORMLINE;
2759 #ifdef PERL_STRICT_CR
2760 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2762 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2764 case ' ': case '\t': case '\f': case 013:
2765 #ifdef MACOS_TRADITIONAL
2772 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2773 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2774 /* handle eval qq[#line 1 "foo"\n ...] */
2775 CopLINE_dec(PL_curcop);
2779 while (s < d && *s != '\n')
2784 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2786 PL_lex_state = LEX_FORMLINE;
2796 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2801 while (s < PL_bufend && SPACE_OR_TAB(*s))
2804 if (strnEQ(s,"=>",2)) {
2805 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2806 OPERATOR('-'); /* unary minus */
2808 PL_last_uni = PL_oldbufptr;
2809 PL_last_lop_op = OP_FTEREAD; /* good enough */
2811 case 'r': FTST(OP_FTEREAD);
2812 case 'w': FTST(OP_FTEWRITE);
2813 case 'x': FTST(OP_FTEEXEC);
2814 case 'o': FTST(OP_FTEOWNED);
2815 case 'R': FTST(OP_FTRREAD);
2816 case 'W': FTST(OP_FTRWRITE);
2817 case 'X': FTST(OP_FTREXEC);
2818 case 'O': FTST(OP_FTROWNED);
2819 case 'e': FTST(OP_FTIS);
2820 case 'z': FTST(OP_FTZERO);
2821 case 's': FTST(OP_FTSIZE);
2822 case 'f': FTST(OP_FTFILE);
2823 case 'd': FTST(OP_FTDIR);
2824 case 'l': FTST(OP_FTLINK);
2825 case 'p': FTST(OP_FTPIPE);
2826 case 'S': FTST(OP_FTSOCK);
2827 case 'u': FTST(OP_FTSUID);
2828 case 'g': FTST(OP_FTSGID);
2829 case 'k': FTST(OP_FTSVTX);
2830 case 'b': FTST(OP_FTBLK);
2831 case 'c': FTST(OP_FTCHR);
2832 case 't': FTST(OP_FTTTY);
2833 case 'T': FTST(OP_FTTEXT);
2834 case 'B': FTST(OP_FTBINARY);
2835 case 'M': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTMTIME);
2836 case 'A': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTATIME);
2837 case 'C': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTCTIME);
2839 Perl_croak(aTHX_ "Unrecognized file test: -%c", (int)tmp);
2846 if (PL_expect == XOPERATOR)
2851 else if (*s == '>') {
2854 if (isIDFIRST_lazy_if(s,UTF)) {
2855 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2863 if (PL_expect == XOPERATOR)
2866 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2868 OPERATOR('-'); /* unary minus */
2875 if (PL_expect == XOPERATOR)
2880 if (PL_expect == XOPERATOR)
2883 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2889 if (PL_expect != XOPERATOR) {
2890 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2891 PL_expect = XOPERATOR;
2892 force_ident(PL_tokenbuf, '*');
2905 if (PL_expect == XOPERATOR) {
2909 PL_tokenbuf[0] = '%';
2910 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2911 if (!PL_tokenbuf[1]) {
2913 yyerror("Final % should be \\% or %name");
2916 PL_pending_ident = '%';
2935 switch (PL_expect) {
2938 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2940 PL_bufptr = s; /* update in case we back off */
2946 PL_expect = XTERMBLOCK;
2950 while (isIDFIRST_lazy_if(s,UTF)) {
2951 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2952 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2953 if (tmp < 0) tmp = -tmp;
2968 d = scan_str(d,TRUE,TRUE);
2971 SvREFCNT_dec(PL_lex_stuff);
2972 PL_lex_stuff = Nullsv;
2974 /* MUST advance bufptr here to avoid bogus
2975 "at end of line" context messages from yyerror().
2977 PL_bufptr = s + len;
2978 yyerror("Unterminated attribute parameter in attribute list");
2981 return 0; /* EOF indicator */
2985 SV *sv = newSVpvn(s, len);
2986 sv_catsv(sv, PL_lex_stuff);
2987 attrs = append_elem(OP_LIST, attrs,
2988 newSVOP(OP_CONST, 0, sv));
2989 SvREFCNT_dec(PL_lex_stuff);
2990 PL_lex_stuff = Nullsv;
2993 attrs = append_elem(OP_LIST, attrs,
2994 newSVOP(OP_CONST, 0,
2998 if (*s == ':' && s[1] != ':')
3001 break; /* require real whitespace or :'s */
3003 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3004 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3005 char q = ((*s == '\'') ? '"' : '\'');
3006 /* If here for an expression, and parsed no attrs, back off. */
3007 if (tmp == '=' && !attrs) {
3011 /* MUST advance bufptr here to avoid bogus "at end of line"
3012 context messages from yyerror().
3016 yyerror("Unterminated attribute list");
3018 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3026 PL_nextval[PL_nexttoke].opval = attrs;
3034 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3035 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3051 if (PL_lex_brackets <= 0)
3052 yyerror("Unmatched right square bracket");
3055 if (PL_lex_state == LEX_INTERPNORMAL) {
3056 if (PL_lex_brackets == 0) {
3057 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3058 PL_lex_state = LEX_INTERPEND;
3065 if (PL_lex_brackets > 100) {
3066 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3067 if (newlb != PL_lex_brackstack) {
3069 PL_lex_brackstack = newlb;
3072 switch (PL_expect) {
3074 if (PL_lex_formbrack) {
3078 if (PL_oldoldbufptr == PL_last_lop)
3079 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3081 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3082 OPERATOR(HASHBRACK);
3084 while (s < PL_bufend && SPACE_OR_TAB(*s))
3087 PL_tokenbuf[0] = '\0';
3088 if (d < PL_bufend && *d == '-') {
3089 PL_tokenbuf[0] = '-';
3091 while (d < PL_bufend && SPACE_OR_TAB(*d))
3094 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3095 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3097 while (d < PL_bufend && SPACE_OR_TAB(*d))
3100 char minus = (PL_tokenbuf[0] == '-');
3101 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3109 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3114 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3119 if (PL_oldoldbufptr == PL_last_lop)
3120 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3122 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3125 OPERATOR(HASHBRACK);
3126 /* This hack serves to disambiguate a pair of curlies
3127 * as being a block or an anon hash. Normally, expectation
3128 * determines that, but in cases where we're not in a
3129 * position to expect anything in particular (like inside
3130 * eval"") we have to resolve the ambiguity. This code
3131 * covers the case where the first term in the curlies is a
3132 * quoted string. Most other cases need to be explicitly
3133 * disambiguated by prepending a `+' before the opening
3134 * curly in order to force resolution as an anon hash.
3136 * XXX should probably propagate the outer expectation
3137 * into eval"" to rely less on this hack, but that could
3138 * potentially break current behavior of eval"".
3142 if (*s == '\'' || *s == '"' || *s == '`') {
3143 /* common case: get past first string, handling escapes */
3144 for (t++; t < PL_bufend && *t != *s;)
3145 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3149 else if (*s == 'q') {
3152 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3156 char open, close, term;
3159 while (t < PL_bufend && isSPACE(*t))
3163 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3167 for (t++; t < PL_bufend; t++) {
3168 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3170 else if (*t == open)
3174 for (t++; t < PL_bufend; t++) {
3175 if (*t == '\\' && t+1 < PL_bufend)
3177 else if (*t == close && --brackets <= 0)
3179 else if (*t == open)
3185 else if (isALNUM_lazy_if(t,UTF)) {
3187 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3190 while (t < PL_bufend && isSPACE(*t))
3192 /* if comma follows first term, call it an anon hash */
3193 /* XXX it could be a comma expression with loop modifiers */
3194 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3195 || (*t == '=' && t[1] == '>')))
3196 OPERATOR(HASHBRACK);
3197 if (PL_expect == XREF)
3200 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3206 yylval.ival = CopLINE(PL_curcop);
3207 if (isSPACE(*s) || *s == '#')
3208 PL_copline = NOLINE; /* invalidate current command line number */
3213 if (PL_lex_brackets <= 0)
3214 yyerror("Unmatched right curly bracket");
3216 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3217 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3218 PL_lex_formbrack = 0;
3219 if (PL_lex_state == LEX_INTERPNORMAL) {
3220 if (PL_lex_brackets == 0) {
3221 if (PL_expect & XFAKEBRACK) {
3222 PL_expect &= XENUMMASK;
3223 PL_lex_state = LEX_INTERPEND;
3225 return yylex(); /* ignore fake brackets */
3227 if (*s == '-' && s[1] == '>')
3228 PL_lex_state = LEX_INTERPENDMAYBE;
3229 else if (*s != '[' && *s != '{')
3230 PL_lex_state = LEX_INTERPEND;
3233 if (PL_expect & XFAKEBRACK) {
3234 PL_expect &= XENUMMASK;
3236 return yylex(); /* ignore fake brackets */
3246 if (PL_expect == XOPERATOR) {
3247 if (ckWARN(WARN_SEMICOLON)
3248 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3250 CopLINE_dec(PL_curcop);
3251 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3252 CopLINE_inc(PL_curcop);
3257 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3259 PL_expect = XOPERATOR;
3260 force_ident(PL_tokenbuf, '&');
3264 yylval.ival = (OPpENTERSUB_AMPER<<8);
3283 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3284 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3286 if (PL_expect == XSTATE && isALPHA(tmp) &&
3287 (s == PL_linestart+1 || s[-2] == '\n') )
3289 if (PL_in_eval && !PL_rsfp) {
3294 if (strnEQ(s,"=cut",4)) {
3308 PL_doextract = TRUE;
3311 if (PL_lex_brackets < PL_lex_formbrack) {
3313 #ifdef PERL_STRICT_CR
3314 for (t = s; SPACE_OR_TAB(*t); t++) ;
3316 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3318 if (*t == '\n' || *t == '#') {
3336 if (PL_expect != XOPERATOR) {
3337 if (s[1] != '<' && !strchr(s,'>'))
3340 s = scan_heredoc(s);
3342 s = scan_inputsymbol(s);
3343 TERM(sublex_start());
3348 SHop(OP_LEFT_SHIFT);
3362 SHop(OP_RIGHT_SHIFT);
3371 if (PL_expect == XOPERATOR) {
3372 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3375 return ','; /* grandfather non-comma-format format */
3379 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3380 PL_tokenbuf[0] = '@';
3381 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3382 sizeof PL_tokenbuf - 1, FALSE);
3383 if (PL_expect == XOPERATOR)
3384 no_op("Array length", s);
3385 if (!PL_tokenbuf[1])
3387 PL_expect = XOPERATOR;
3388 PL_pending_ident = '#';
3392 PL_tokenbuf[0] = '$';
3393 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3394 sizeof PL_tokenbuf - 1, FALSE);
3395 if (PL_expect == XOPERATOR)
3397 if (!PL_tokenbuf[1]) {
3399 yyerror("Final $ should be \\$ or $name");
3403 /* This kludge not intended to be bulletproof. */
3404 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3405 yylval.opval = newSVOP(OP_CONST, 0,
3406 newSViv(PL_compiling.cop_arybase));
3407 yylval.opval->op_private = OPpCONST_ARYBASE;
3413 if (PL_lex_state == LEX_NORMAL)
3416 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3419 PL_tokenbuf[0] = '@';
3420 if (ckWARN(WARN_SYNTAX)) {
3422 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3425 PL_bufptr = skipspace(PL_bufptr);
3426 while (t < PL_bufend && *t != ']')
3428 Perl_warner(aTHX_ WARN_SYNTAX,
3429 "Multidimensional syntax %.*s not supported",
3430 (t - PL_bufptr) + 1, PL_bufptr);
3434 else if (*s == '{') {
3435 PL_tokenbuf[0] = '%';
3436 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3437 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3439 char tmpbuf[sizeof PL_tokenbuf];
3441 for (t++; isSPACE(*t); t++) ;
3442 if (isIDFIRST_lazy_if(t,UTF)) {
3443 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3444 for (; isSPACE(*t); t++) ;
3445 if (*t == ';' && get_cv(tmpbuf, FALSE))
3446 Perl_warner(aTHX_ WARN_SYNTAX,
3447 "You need to quote \"%s\"", tmpbuf);
3453 PL_expect = XOPERATOR;
3454 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3455 bool islop = (PL_last_lop == PL_oldoldbufptr);
3456 if (!islop || PL_last_lop_op == OP_GREPSTART)
3457 PL_expect = XOPERATOR;
3458 else if (strchr("$@\"'`q", *s))
3459 PL_expect = XTERM; /* e.g. print $fh "foo" */
3460 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3461 PL_expect = XTERM; /* e.g. print $fh &sub */
3462 else if (isIDFIRST_lazy_if(s,UTF)) {
3463 char tmpbuf[sizeof PL_tokenbuf];
3464 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3465 if ((tmp = keyword(tmpbuf, len))) {
3466 /* binary operators exclude handle interpretations */
3478 PL_expect = XTERM; /* e.g. print $fh length() */
3483 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3484 if (gv && GvCVu(gv))
3485 PL_expect = XTERM; /* e.g. print $fh subr() */
3488 else if (isDIGIT(*s))
3489 PL_expect = XTERM; /* e.g. print $fh 3 */
3490 else if (*s == '.' && isDIGIT(s[1]))
3491 PL_expect = XTERM; /* e.g. print $fh .3 */
3492 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3493 PL_expect = XTERM; /* e.g. print $fh -1 */
3494 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3495 PL_expect = XTERM; /* print $fh <<"EOF" */
3497 PL_pending_ident = '$';
3501 if (PL_expect == XOPERATOR)
3503 PL_tokenbuf[0] = '@';
3504 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3505 if (!PL_tokenbuf[1]) {
3507 yyerror("Final @ should be \\@ or @name");
3510 if (PL_lex_state == LEX_NORMAL)
3512 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3514 PL_tokenbuf[0] = '%';
3516 /* Warn about @ where they meant $. */
3517 if (ckWARN(WARN_SYNTAX)) {
3518 if (*s == '[' || *s == '{') {
3520 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3522 if (*t == '}' || *t == ']') {
3524 PL_bufptr = skipspace(PL_bufptr);
3525 Perl_warner(aTHX_ WARN_SYNTAX,
3526 "Scalar value %.*s better written as $%.*s",
3527 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3532 PL_pending_ident = '@';
3535 case '/': /* may either be division or pattern */
3536 case '?': /* may either be conditional or pattern */
3537 if (PL_expect != XOPERATOR) {
3538 /* Disable warning on "study /blah/" */
3539 if (PL_oldoldbufptr == PL_last_uni
3540 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3541 || memNE(PL_last_uni, "study", 5)
3542 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3544 s = scan_pat(s,OP_MATCH);
3545 TERM(sublex_start());
3553 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3554 #ifdef PERL_STRICT_CR
3557 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3559 && (s == PL_linestart || s[-1] == '\n') )
3561 PL_lex_formbrack = 0;
3565 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3571 yylval.ival = OPf_SPECIAL;
3577 if (PL_expect != XOPERATOR)
3582 case '0': case '1': case '2': case '3': case '4':
3583 case '5': case '6': case '7': case '8': case '9':
3584 s = scan_num(s, &yylval);
3585 if (PL_expect == XOPERATOR)
3590 s = scan_str(s,FALSE,FALSE);
3591 if (PL_expect == XOPERATOR) {
3592 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3595 return ','; /* grandfather non-comma-format format */
3601 missingterm((char*)0);
3602 yylval.ival = OP_CONST;
3603 TERM(sublex_start());
3606 s = scan_str(s,FALSE,FALSE);
3607 if (PL_expect == XOPERATOR) {
3608 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3611 return ','; /* grandfather non-comma-format format */
3617 missingterm((char*)0);
3618 yylval.ival = OP_CONST;
3619 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3620 if (*d == '$' || *d == '@' || *d == '\\' || *d & 0x80) {
3621 yylval.ival = OP_STRINGIFY;
3625 TERM(sublex_start());
3628 s = scan_str(s,FALSE,FALSE);
3629 if (PL_expect == XOPERATOR)
3630 no_op("Backticks",s);
3632 missingterm((char*)0);
3633 yylval.ival = OP_BACKTICK;
3635 TERM(sublex_start());
3639 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3640 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3642 if (PL_expect == XOPERATOR)
3643 no_op("Backslash",s);
3647 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3651 while (isDIGIT(*start) || *start == '_')
3653 if (*start == '.' && isDIGIT(start[1])) {
3654 s = scan_num(s, &yylval);
3657 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3658 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF)) {
3662 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3665 s = scan_num(s, &yylval);
3672 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3711 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3713 /* Some keywords can be followed by any delimiter, including ':' */
3714 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3715 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3716 (PL_tokenbuf[0] == 'q' &&
3717 strchr("qwxr", PL_tokenbuf[1])))));
3719 /* x::* is just a word, unless x is "CORE" */
3720 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3724 while (d < PL_bufend && isSPACE(*d))
3725 d++; /* no comments skipped here, or s### is misparsed */
3727 /* Is this a label? */
3728 if (!tmp && PL_expect == XSTATE
3729 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3731 yylval.pval = savepv(PL_tokenbuf);
3736 /* Check for keywords */
3737 tmp = keyword(PL_tokenbuf, len);
3739 /* Is this a word before a => operator? */
3740 if (*d == '=' && d[1] == '>') {
3742 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3743 yylval.opval->op_private = OPpCONST_BARE;
3747 if (tmp < 0) { /* second-class keyword? */
3748 GV *ogv = Nullgv; /* override (winner) */
3749 GV *hgv = Nullgv; /* hidden (loser) */
3750 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3752 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3755 if (GvIMPORTED_CV(gv))
3757 else if (! CvMETHOD(cv))
3761 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3762 (gv = *gvp) != (GV*)&PL_sv_undef &&
3763 GvCVu(gv) && GvIMPORTED_CV(gv))
3769 tmp = 0; /* overridden by import or by GLOBAL */
3772 && -tmp==KEY_lock /* XXX generalizable kludge */
3774 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3776 tmp = 0; /* any sub overrides "weak" keyword */
3778 else { /* no override */
3782 if (ckWARN(WARN_AMBIGUOUS) && hgv
3783 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3784 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3785 "Ambiguous call resolved as CORE::%s(), %s",
3786 GvENAME(hgv), "qualify as such or use &");
3793 default: /* not a keyword */
3796 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3798 /* Get the rest if it looks like a package qualifier */
3800 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3802 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3805 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3806 *s == '\'' ? "'" : "::");
3810 if (PL_expect == XOPERATOR) {
3811 if (PL_bufptr == PL_linestart) {
3812 CopLINE_dec(PL_curcop);
3813 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3814 CopLINE_inc(PL_curcop);
3817 no_op("Bareword",s);
3820 /* Look for a subroutine with this name in current package,
3821 unless name is "Foo::", in which case Foo is a bearword
3822 (and a package name). */
3825 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3827 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3828 Perl_warner(aTHX_ WARN_BAREWORD,
3829 "Bareword \"%s\" refers to nonexistent package",
3832 PL_tokenbuf[len] = '\0';
3839 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3842 /* if we saw a global override before, get the right name */
3845 sv = newSVpvn("CORE::GLOBAL::",14);
3846 sv_catpv(sv,PL_tokenbuf);
3849 sv = newSVpv(PL_tokenbuf,0);
3851 /* Presume this is going to be a bareword of some sort. */
3854 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3855 yylval.opval->op_private = OPpCONST_BARE;
3857 /* And if "Foo::", then that's what it certainly is. */
3862 /* See if it's the indirect object for a list operator. */
3864 if (PL_oldoldbufptr &&
3865 PL_oldoldbufptr < PL_bufptr &&
3866 (PL_oldoldbufptr == PL_last_lop
3867 || PL_oldoldbufptr == PL_last_uni) &&
3868 /* NO SKIPSPACE BEFORE HERE! */
3869 (PL_expect == XREF ||
3870 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3872 bool immediate_paren = *s == '(';
3874 /* (Now we can afford to cross potential line boundary.) */
3877 /* Two barewords in a row may indicate method call. */
3879 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3882 /* If not a declared subroutine, it's an indirect object. */
3883 /* (But it's an indir obj regardless for sort.) */
3885 if ((PL_last_lop_op == OP_SORT ||
3886 (!immediate_paren && (!gv || !GvCVu(gv)))) &&
3887 (PL_last_lop_op != OP_MAPSTART &&
3888 PL_last_lop_op != OP_GREPSTART))
3890 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3896 PL_expect = XOPERATOR;
3899 /* Is this a word before a => operator? */
3900 if (*s == '=' && s[1] == '>') {
3902 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3906 /* If followed by a paren, it's certainly a subroutine. */
3909 if (gv && GvCVu(gv)) {
3910 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3911 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3916 PL_nextval[PL_nexttoke].opval = yylval.opval;
3917 PL_expect = XOPERATOR;
3923 /* If followed by var or block, call it a method (unless sub) */
3925 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3926 PL_last_lop = PL_oldbufptr;
3927 PL_last_lop_op = OP_METHOD;
3931 /* If followed by a bareword, see if it looks like indir obj. */
3933 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3936 /* Not a method, so call it a subroutine (if defined) */
3938 if (gv && GvCVu(gv)) {
3940 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3941 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3942 "Ambiguous use of -%s resolved as -&%s()",
3943 PL_tokenbuf, PL_tokenbuf);
3944 /* Check for a constant sub */
3946 if ((sv = cv_const_sv(cv))) {
3948 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3949 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3950 yylval.opval->op_private = 0;
3954 /* Resolve to GV now. */
3955 op_free(yylval.opval);
3956 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3957 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3958 PL_last_lop = PL_oldbufptr;
3959 PL_last_lop_op = OP_ENTERSUB;
3960 /* Is there a prototype? */
3963 char *proto = SvPV((SV*)cv, len);
3966 if (strEQ(proto, "$"))
3968 if (*proto == '&' && *s == '{') {
3969 sv_setpv(PL_subname,"__ANON__");
3973 PL_nextval[PL_nexttoke].opval = yylval.opval;
3979 /* Call it a bare word */
3981 if (PL_hints & HINT_STRICT_SUBS)
3982 yylval.opval->op_private |= OPpCONST_STRICT;
3985 if (ckWARN(WARN_RESERVED)) {
3986 if (lastchar != '-') {
3987 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
3989 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
3996 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
3997 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3998 "Operator or semicolon missing before %c%s",
3999 lastchar, PL_tokenbuf);
4000 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4001 "Ambiguous use of %c resolved as operator %c",
4002 lastchar, lastchar);
4008 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4009 newSVpv(CopFILE(PL_curcop),0));
4013 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4014 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4017 case KEY___PACKAGE__:
4018 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4020 ? newSVsv(PL_curstname)
4029 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4030 char *pname = "main";
4031 if (PL_tokenbuf[2] == 'D')
4032 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4033 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4036 GvIOp(gv) = newIO();
4037 IoIFP(GvIOp(gv)) = PL_rsfp;
4038 #if defined(HAS_FCNTL) && defined(F_SETFD)
4040 int fd = PerlIO_fileno(PL_rsfp);
4041 fcntl(fd,F_SETFD,fd >= 3);
4044 /* Mark this internal pseudo-handle as clean */
4045 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4047 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4048 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4049 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4051 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4052 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4053 /* if the script was opened in binmode, we need to revert
4054 * it to text mode for compatibility; but only iff it has CRs
4055 * XXX this is a questionable hack at best. */
4056 if (PL_bufend-PL_bufptr > 2
4057 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4060 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4061 loc = PerlIO_tell(PL_rsfp);
4062 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4064 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4065 #if defined(__BORLANDC__)
4066 /* XXX see note in do_binmode() */
4067 ((FILE*)PL_rsfp)->flags |= _F_BIN;
4070 PerlIO_seek(PL_rsfp, loc, 0);
4085 if (PL_expect == XSTATE) {
4092 if (*s == ':' && s[1] == ':') {
4095 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4096 if (!(tmp = keyword(PL_tokenbuf, len)))
4097 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4111 LOP(OP_ACCEPT,XTERM);
4117 LOP(OP_ATAN2,XTERM);
4123 LOP(OP_BINMODE,XTERM);
4126 LOP(OP_BLESS,XTERM);
4135 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4152 if (!PL_cryptseen) {
4153 PL_cryptseen = TRUE;
4157 LOP(OP_CRYPT,XTERM);
4160 if (ckWARN(WARN_CHMOD)) {
4161 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4162 if (*d != '0' && isDIGIT(*d))
4163 Perl_warner(aTHX_ WARN_CHMOD,
4164 "chmod() mode argument is missing initial 0");
4166 LOP(OP_CHMOD,XTERM);
4169 LOP(OP_CHOWN,XTERM);
4172 LOP(OP_CONNECT,XTERM);
4188 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4192 PL_hints |= HINT_BLOCK_SCOPE;
4202 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4203 LOP(OP_DBMOPEN,XTERM);
4209 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4216 yylval.ival = CopLINE(PL_curcop);
4230 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4231 UNIBRACK(OP_ENTEREVAL);
4246 case KEY_endhostent:
4252 case KEY_endservent:
4255 case KEY_endprotoent:
4266 yylval.ival = CopLINE(PL_curcop);
4268 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4270 if ((PL_bufend - p) >= 3 &&
4271 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4273 else if ((PL_bufend - p) >= 4 &&
4274 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4277 if (isIDFIRST_lazy_if(p,UTF)) {
4278 p = scan_ident(p, PL_bufend,
4279 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4283 Perl_croak(aTHX_ "Missing $ on loop variable");
4288 LOP(OP_FORMLINE,XTERM);
4294 LOP(OP_FCNTL,XTERM);
4300 LOP(OP_FLOCK,XTERM);
4309 LOP(OP_GREPSTART, XREF);
4312 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4327 case KEY_getpriority:
4328 LOP(OP_GETPRIORITY,XTERM);
4330 case KEY_getprotobyname:
4333 case KEY_getprotobynumber:
4334 LOP(OP_GPBYNUMBER,XTERM);
4336 case KEY_getprotoent:
4348 case KEY_getpeername:
4349 UNI(OP_GETPEERNAME);
4351 case KEY_gethostbyname:
4354 case KEY_gethostbyaddr:
4355 LOP(OP_GHBYADDR,XTERM);
4357 case KEY_gethostent:
4360 case KEY_getnetbyname:
4363 case KEY_getnetbyaddr:
4364 LOP(OP_GNBYADDR,XTERM);
4369 case KEY_getservbyname:
4370 LOP(OP_GSBYNAME,XTERM);
4372 case KEY_getservbyport:
4373 LOP(OP_GSBYPORT,XTERM);
4375 case KEY_getservent:
4378 case KEY_getsockname:
4379 UNI(OP_GETSOCKNAME);
4381 case KEY_getsockopt:
4382 LOP(OP_GSOCKOPT,XTERM);
4404 yylval.ival = CopLINE(PL_curcop);
4408 LOP(OP_INDEX,XTERM);
4414 LOP(OP_IOCTL,XTERM);
4426 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4458 LOP(OP_LISTEN,XTERM);
4467 s = scan_pat(s,OP_MATCH);
4468 TERM(sublex_start());
4471 LOP(OP_MAPSTART, XREF);
4474 LOP(OP_MKDIR,XTERM);
4477 LOP(OP_MSGCTL,XTERM);
4480 LOP(OP_MSGGET,XTERM);
4483 LOP(OP_MSGRCV,XTERM);
4486 LOP(OP_MSGSND,XTERM);
4492 if (isIDFIRST_lazy_if(s,UTF)) {
4493 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4494 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4496 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4497 if (!PL_in_my_stash) {
4500 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4508 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4515 if (PL_expect != XSTATE)
4516 yyerror("\"no\" not allowed in expression");
4517 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4518 s = force_version(s);
4523 if (*s == '(' || (s = skipspace(s), *s == '('))
4530 if (isIDFIRST_lazy_if(s,UTF)) {
4532 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4534 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4535 Perl_warner(aTHX_ WARN_PRECEDENCE,
4536 "Precedence problem: open %.*s should be open(%.*s)",
4542 yylval.ival = OP_OR;
4552 LOP(OP_OPEN_DIR,XTERM);
4555 checkcomma(s,PL_tokenbuf,"filehandle");
4559 checkcomma(s,PL_tokenbuf,"filehandle");
4578 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4582 LOP(OP_PIPE_OP,XTERM);
4585 s = scan_str(s,FALSE,FALSE);
4587 missingterm((char*)0);
4588 yylval.ival = OP_CONST;
4589 TERM(sublex_start());
4595 s = scan_str(s,FALSE,FALSE);
4597 missingterm((char*)0);
4599 if (SvCUR(PL_lex_stuff)) {
4602 d = SvPV_force(PL_lex_stuff, len);
4604 for (; isSPACE(*d) && len; --len, ++d) ;
4607 if (!warned && ckWARN(WARN_QW)) {
4608 for (; !isSPACE(*d) && len; --len, ++d) {
4610 Perl_warner(aTHX_ WARN_QW,
4611 "Possible attempt to separate words with commas");
4614 else if (*d == '#') {
4615 Perl_warner(aTHX_ WARN_QW,
4616 "Possible attempt to put comments in qw() list");
4622 for (; !isSPACE(*d) && len; --len, ++d) ;
4624 words = append_elem(OP_LIST, words,
4625 newSVOP(OP_CONST, 0, tokeq(newSVpvn(b, d-b))));
4629 PL_nextval[PL_nexttoke].opval = words;
4634 SvREFCNT_dec(PL_lex_stuff);
4635 PL_lex_stuff = Nullsv;
4640 s = scan_str(s,FALSE,FALSE);
4642 missingterm((char*)0);
4643 yylval.ival = OP_STRINGIFY;
4644 if (SvIVX(PL_lex_stuff) == '\'')
4645 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4646 TERM(sublex_start());
4649 s = scan_pat(s,OP_QR);
4650 TERM(sublex_start());
4653 s = scan_str(s,FALSE,FALSE);
4655 missingterm((char*)0);
4656 yylval.ival = OP_BACKTICK;
4658 TERM(sublex_start());
4665 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4666 s = force_version(s);
4669 *PL_tokenbuf = '\0';
4670 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4671 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4672 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4674 yyerror("<> should be quotes");
4682 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4686 LOP(OP_RENAME,XTERM);
4695 LOP(OP_RINDEX,XTERM);
4718 LOP(OP_REVERSE,XTERM);
4729 TERM(sublex_start());
4731 TOKEN(1); /* force error */
4740 LOP(OP_SELECT,XTERM);
4746 LOP(OP_SEMCTL,XTERM);
4749 LOP(OP_SEMGET,XTERM);
4752 LOP(OP_SEMOP,XTERM);
4758 LOP(OP_SETPGRP,XTERM);
4760 case KEY_setpriority:
4761 LOP(OP_SETPRIORITY,XTERM);
4763 case KEY_sethostent:
4769 case KEY_setservent:
4772 case KEY_setprotoent:
4782 LOP(OP_SEEKDIR,XTERM);
4784 case KEY_setsockopt:
4785 LOP(OP_SSOCKOPT,XTERM);
4791 LOP(OP_SHMCTL,XTERM);
4794 LOP(OP_SHMGET,XTERM);
4797 LOP(OP_SHMREAD,XTERM);
4800 LOP(OP_SHMWRITE,XTERM);
4803 LOP(OP_SHUTDOWN,XTERM);
4812 LOP(OP_SOCKET,XTERM);
4814 case KEY_socketpair:
4815 LOP(OP_SOCKPAIR,XTERM);
4818 checkcomma(s,PL_tokenbuf,"subroutine name");
4820 if (*s == ';' || *s == ')') /* probably a close */
4821 Perl_croak(aTHX_ "sort is now a reserved word");
4823 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4827 LOP(OP_SPLIT,XTERM);
4830 LOP(OP_SPRINTF,XTERM);
4833 LOP(OP_SPLICE,XTERM);
4848 LOP(OP_SUBSTR,XTERM);
4854 char tmpbuf[sizeof PL_tokenbuf];
4856 expectation attrful;
4857 bool have_name, have_proto;
4862 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4863 (*s == ':' && s[1] == ':'))
4866 attrful = XATTRBLOCK;
4867 /* remember buffer pos'n for later force_word */
4868 tboffset = s - PL_oldbufptr;
4869 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4870 if (strchr(tmpbuf, ':'))
4871 sv_setpv(PL_subname, tmpbuf);
4873 sv_setsv(PL_subname,PL_curstname);
4874 sv_catpvn(PL_subname,"::",2);
4875 sv_catpvn(PL_subname,tmpbuf,len);
4882 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4883 PL_expect = XTERMBLOCK;
4884 attrful = XATTRTERM;
4885 sv_setpv(PL_subname,"?");
4889 if (key == KEY_format) {
4891 PL_lex_formbrack = PL_lex_brackets + 1;
4893 (void) force_word(PL_oldbufptr + tboffset, WORD,
4898 /* Look for a prototype */
4902 s = scan_str(s,FALSE,FALSE);
4905 SvREFCNT_dec(PL_lex_stuff);
4906 PL_lex_stuff = Nullsv;
4907 Perl_croak(aTHX_ "Prototype not terminated");
4910 d = SvPVX(PL_lex_stuff);
4912 for (p = d; *p; ++p) {
4917 SvCUR(PL_lex_stuff) = tmp;
4925 if (*s == ':' && s[1] != ':')
4926 PL_expect = attrful;
4929 PL_nextval[PL_nexttoke].opval =
4930 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4931 PL_lex_stuff = Nullsv;
4935 sv_setpv(PL_subname,"__ANON__");
4938 (void) force_word(PL_oldbufptr + tboffset, WORD,
4947 LOP(OP_SYSTEM,XREF);
4950 LOP(OP_SYMLINK,XTERM);
4953 LOP(OP_SYSCALL,XTERM);
4956 LOP(OP_SYSOPEN,XTERM);
4959 LOP(OP_SYSSEEK,XTERM);
4962 LOP(OP_SYSREAD,XTERM);
4965 LOP(OP_SYSWRITE,XTERM);
4969 TERM(sublex_start());
4990 LOP(OP_TRUNCATE,XTERM);
5002 yylval.ival = CopLINE(PL_curcop);
5006 yylval.ival = CopLINE(PL_curcop);
5010 LOP(OP_UNLINK,XTERM);
5016 LOP(OP_UNPACK,XTERM);
5019 LOP(OP_UTIME,XTERM);
5022 if (ckWARN(WARN_UMASK)) {
5023 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5024 if (*d != '0' && isDIGIT(*d))
5025 Perl_warner(aTHX_ WARN_UMASK,
5026 "umask: argument is missing initial 0");
5031 LOP(OP_UNSHIFT,XTERM);
5034 if (PL_expect != XSTATE)
5035 yyerror("\"use\" not allowed in expression");
5037 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5038 s = force_version(s);
5039 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5040 PL_nextval[PL_nexttoke].opval = Nullop;
5045 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5046 s = force_version(s);
5058 yylval.ival = CopLINE(PL_curcop);
5062 PL_hints |= HINT_BLOCK_SCOPE;
5069 LOP(OP_WAITPID,XTERM);
5077 static char ctl_l[2];
5079 if (ctl_l[0] == '\0')
5080 ctl_l[0] = toCTRL('L');
5081 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5084 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5089 if (PL_expect == XOPERATOR)
5095 yylval.ival = OP_XOR;
5100 TERM(sublex_start());
5105 #pragma segment Main
5109 Perl_keyword(pTHX_ register char *d, I32 len)
5114 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5115 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5116 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5117 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5118 if (strEQ(d,"__END__")) return KEY___END__;
5122 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5127 if (strEQ(d,"and")) return -KEY_and;
5128 if (strEQ(d,"abs")) return -KEY_abs;
5131 if (strEQ(d,"alarm")) return -KEY_alarm;
5132 if (strEQ(d,"atan2")) return -KEY_atan2;
5135 if (strEQ(d,"accept")) return -KEY_accept;
5140 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5143 if (strEQ(d,"bless")) return -KEY_bless;
5144 if (strEQ(d,"bind")) return -KEY_bind;
5145 if (strEQ(d,"binmode")) return -KEY_binmode;
5148 if (strEQ(d,"CORE")) return -KEY_CORE;
5149 if (strEQ(d,"CHECK")) return KEY_CHECK;
5154 if (strEQ(d,"cmp")) return -KEY_cmp;
5155 if (strEQ(d,"chr")) return -KEY_chr;
5156 if (strEQ(d,"cos")) return -KEY_cos;
5159 if (strEQ(d,"chop")) return -KEY_chop;
5162 if (strEQ(d,"close")) return -KEY_close;
5163 if (strEQ(d,"chdir")) return -KEY_chdir;
5164 if (strEQ(d,"chomp")) return -KEY_chomp;
5165 if (strEQ(d,"chmod")) return -KEY_chmod;
5166 if (strEQ(d,"chown")) return -KEY_chown;
5167 if (strEQ(d,"crypt")) return -KEY_crypt;
5170 if (strEQ(d,"chroot")) return -KEY_chroot;
5171 if (strEQ(d,"caller")) return -KEY_caller;
5174 if (strEQ(d,"connect")) return -KEY_connect;
5177 if (strEQ(d,"closedir")) return -KEY_closedir;
5178 if (strEQ(d,"continue")) return -KEY_continue;
5183 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5188 if (strEQ(d,"do")) return KEY_do;
5191 if (strEQ(d,"die")) return -KEY_die;
5194 if (strEQ(d,"dump")) return -KEY_dump;
5197 if (strEQ(d,"delete")) return KEY_delete;
5200 if (strEQ(d,"defined")) return KEY_defined;
5201 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5204 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5209 if (strEQ(d,"END")) return KEY_END;
5214 if (strEQ(d,"eq")) return -KEY_eq;
5217 if (strEQ(d,"eof")) return -KEY_eof;
5218 if (strEQ(d,"exp")) return -KEY_exp;
5221 if (strEQ(d,"else")) return KEY_else;
5222 if (strEQ(d,"exit")) return -KEY_exit;
5223 if (strEQ(d,"eval")) return KEY_eval;
5224 if (strEQ(d,"exec")) return -KEY_exec;
5225 if (strEQ(d,"each")) return -KEY_each;
5228 if (strEQ(d,"elsif")) return KEY_elsif;
5231 if (strEQ(d,"exists")) return KEY_exists;
5232 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5235 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5236 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5239 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5242 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5243 if (strEQ(d,"endservent")) return -KEY_endservent;
5246 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5253 if (strEQ(d,"for")) return KEY_for;
5256 if (strEQ(d,"fork")) return -KEY_fork;
5259 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5260 if (strEQ(d,"flock")) return -KEY_flock;
5263 if (strEQ(d,"format")) return KEY_format;
5264 if (strEQ(d,"fileno")) return -KEY_fileno;
5267 if (strEQ(d,"foreach")) return KEY_foreach;
5270 if (strEQ(d,"formline")) return -KEY_formline;
5275 if (strnEQ(d,"get",3)) {
5280 if (strEQ(d,"ppid")) return -KEY_getppid;
5281 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5284 if (strEQ(d,"pwent")) return -KEY_getpwent;
5285 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5286 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5289 if (strEQ(d,"peername")) return -KEY_getpeername;
5290 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5291 if (strEQ(d,"priority")) return -KEY_getpriority;
5294 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5297 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5301 else if (*d == 'h') {
5302 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5303 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5304 if (strEQ(d,"hostent")) return -KEY_gethostent;
5306 else if (*d == 'n') {
5307 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5308 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5309 if (strEQ(d,"netent")) return -KEY_getnetent;
5311 else if (*d == 's') {
5312 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5313 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5314 if (strEQ(d,"servent")) return -KEY_getservent;
5315 if (strEQ(d,"sockname")) return -KEY_getsockname;
5316 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5318 else if (*d == 'g') {
5319 if (strEQ(d,"grent")) return -KEY_getgrent;
5320 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5321 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5323 else if (*d == 'l') {
5324 if (strEQ(d,"login")) return -KEY_getlogin;
5326 else if (strEQ(d,"c")) return -KEY_getc;
5331 if (strEQ(d,"gt")) return -KEY_gt;
5332 if (strEQ(d,"ge")) return -KEY_ge;
5335 if (strEQ(d,"grep")) return KEY_grep;
5336 if (strEQ(d,"goto")) return KEY_goto;
5337 if (strEQ(d,"glob")) return KEY_glob;
5340 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5345 if (strEQ(d,"hex")) return -KEY_hex;
5348 if (strEQ(d,"INIT")) return KEY_INIT;
5353 if (strEQ(d,"if")) return KEY_if;
5356 if (strEQ(d,"int")) return -KEY_int;
5359 if (strEQ(d,"index")) return -KEY_index;
5360 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5365 if (strEQ(d,"join")) return -KEY_join;
5369 if (strEQ(d,"keys")) return -KEY_keys;
5370 if (strEQ(d,"kill")) return -KEY_kill;
5376 if (strEQ(d,"lt")) return -KEY_lt;
5377 if (strEQ(d,"le")) return -KEY_le;
5378 if (strEQ(d,"lc")) return -KEY_lc;
5381 if (strEQ(d,"log")) return -KEY_log;
5384 if (strEQ(d,"last")) return KEY_last;
5385 if (strEQ(d,"link")) return -KEY_link;
5386 if (strEQ(d,"lock")) return -KEY_lock;
5389 if (strEQ(d,"local")) return KEY_local;
5390 if (strEQ(d,"lstat")) return -KEY_lstat;
5393 if (strEQ(d,"length")) return -KEY_length;
5394 if (strEQ(d,"listen")) return -KEY_listen;
5397 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5400 if (strEQ(d,"localtime")) return -KEY_localtime;
5406 case 1: return KEY_m;
5408 if (strEQ(d,"my")) return KEY_my;
5411 if (strEQ(d,"map")) return KEY_map;
5414 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5417 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5418 if (strEQ(d,"msgget")) return -KEY_msgget;
5419 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5420 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5425 if (strEQ(d,"next")) return KEY_next;
5426 if (strEQ(d,"ne")) return -KEY_ne;
5427 if (strEQ(d,"not")) return -KEY_not;
5428 if (strEQ(d,"no")) return KEY_no;
5433 if (strEQ(d,"or")) return -KEY_or;
5436 if (strEQ(d,"ord")) return -KEY_ord;
5437 if (strEQ(d,"oct")) return -KEY_oct;
5438 if (strEQ(d,"our")) return KEY_our;
5441 if (strEQ(d,"open")) return -KEY_open;
5444 if (strEQ(d,"opendir")) return -KEY_opendir;
5451 if (strEQ(d,"pop")) return -KEY_pop;
5452 if (strEQ(d,"pos")) return KEY_pos;
5455 if (strEQ(d,"push")) return -KEY_push;
5456 if (strEQ(d,"pack")) return -KEY_pack;
5457 if (strEQ(d,"pipe")) return -KEY_pipe;
5460 if (strEQ(d,"print")) return KEY_print;
5463 if (strEQ(d,"printf")) return KEY_printf;
5466 if (strEQ(d,"package")) return KEY_package;
5469 if (strEQ(d,"prototype")) return KEY_prototype;
5474 if (strEQ(d,"q")) return KEY_q;
5475 if (strEQ(d,"qr")) return KEY_qr;
5476 if (strEQ(d,"qq")) return KEY_qq;
5477 if (strEQ(d,"qw")) return KEY_qw;
5478 if (strEQ(d,"qx")) return KEY_qx;
5480 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5485 if (strEQ(d,"ref")) return -KEY_ref;
5488 if (strEQ(d,"read")) return -KEY_read;
5489 if (strEQ(d,"rand")) return -KEY_rand;
5490 if (strEQ(d,"recv")) return -KEY_recv;
5491 if (strEQ(d,"redo")) return KEY_redo;
5494 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5495 if (strEQ(d,"reset")) return -KEY_reset;
5498 if (strEQ(d,"return")) return KEY_return;
5499 if (strEQ(d,"rename")) return -KEY_rename;
5500 if (strEQ(d,"rindex")) return -KEY_rindex;
5503 if (strEQ(d,"require")) return -KEY_require;
5504 if (strEQ(d,"reverse")) return -KEY_reverse;
5505 if (strEQ(d,"readdir")) return -KEY_readdir;
5508 if (strEQ(d,"readlink")) return -KEY_readlink;
5509 if (strEQ(d,"readline")) return -KEY_readline;
5510 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5513 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5519 case 0: return KEY_s;
5521 if (strEQ(d,"scalar")) return KEY_scalar;
5526 if (strEQ(d,"seek")) return -KEY_seek;
5527 if (strEQ(d,"send")) return -KEY_send;
5530 if (strEQ(d,"semop")) return -KEY_semop;
5533 if (strEQ(d,"select")) return -KEY_select;
5534 if (strEQ(d,"semctl")) return -KEY_semctl;
5535 if (strEQ(d,"semget")) return -KEY_semget;
5538 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5539 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5542 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5543 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5546 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5549 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5550 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5551 if (strEQ(d,"setservent")) return -KEY_setservent;
5554 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5555 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5562 if (strEQ(d,"shift")) return -KEY_shift;
5565 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5566 if (strEQ(d,"shmget")) return -KEY_shmget;
5569 if (strEQ(d,"shmread")) return -KEY_shmread;
5572 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5573 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5578 if (strEQ(d,"sin")) return -KEY_sin;
5581 if (strEQ(d,"sleep")) return -KEY_sleep;
5584 if (strEQ(d,"sort")) return KEY_sort;
5585 if (strEQ(d,"socket")) return -KEY_socket;
5586 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5589 if (strEQ(d,"split")) return KEY_split;
5590 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5591 if (strEQ(d,"splice")) return -KEY_splice;
5594 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5597 if (strEQ(d,"srand")) return -KEY_srand;
5600 if (strEQ(d,"stat")) return -KEY_stat;
5601 if (strEQ(d,"study")) return KEY_study;
5604 if (strEQ(d,"substr")) return -KEY_substr;
5605 if (strEQ(d,"sub")) return KEY_sub;
5610 if (strEQ(d,"system")) return -KEY_system;
5613 if (strEQ(d,"symlink")) return -KEY_symlink;
5614 if (strEQ(d,"syscall")) return -KEY_syscall;
5615 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5616 if (strEQ(d,"sysread")) return -KEY_sysread;
5617 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5620 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5629 if (strEQ(d,"tr")) return KEY_tr;
5632 if (strEQ(d,"tie")) return KEY_tie;
5635 if (strEQ(d,"tell")) return -KEY_tell;
5636 if (strEQ(d,"tied")) return KEY_tied;
5637 if (strEQ(d,"time")) return -KEY_time;
5640 if (strEQ(d,"times")) return -KEY_times;
5643 if (strEQ(d,"telldir")) return -KEY_telldir;
5646 if (strEQ(d,"truncate")) return -KEY_truncate;
5653 if (strEQ(d,"uc")) return -KEY_uc;
5656 if (strEQ(d,"use")) return KEY_use;
5659 if (strEQ(d,"undef")) return KEY_undef;
5660 if (strEQ(d,"until")) return KEY_until;
5661 if (strEQ(d,"untie")) return KEY_untie;
5662 if (strEQ(d,"utime")) return -KEY_utime;
5663 if (strEQ(d,"umask")) return -KEY_umask;
5666 if (strEQ(d,"unless")) return KEY_unless;
5667 if (strEQ(d,"unpack")) return -KEY_unpack;
5668 if (strEQ(d,"unlink")) return -KEY_unlink;
5671 if (strEQ(d,"unshift")) return -KEY_unshift;
5672 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5677 if (strEQ(d,"values")) return -KEY_values;
5678 if (strEQ(d,"vec")) return -KEY_vec;
5683 if (strEQ(d,"warn")) return -KEY_warn;
5684 if (strEQ(d,"wait")) return -KEY_wait;
5687 if (strEQ(d,"while")) return KEY_while;
5688 if (strEQ(d,"write")) return -KEY_write;
5691 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5694 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5699 if (len == 1) return -KEY_x;
5700 if (strEQ(d,"xor")) return -KEY_xor;
5703 if (len == 1) return KEY_y;
5712 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5716 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5717 dTHR; /* only for ckWARN */
5718 if (ckWARN(WARN_SYNTAX)) {
5720 for (w = s+2; *w && level; w++) {
5727 for (; *w && isSPACE(*w); w++) ;
5728 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5729 Perl_warner(aTHX_ WARN_SYNTAX,
5730 "%s (...) interpreted as function",name);
5733 while (s < PL_bufend && isSPACE(*s))
5737 while (s < PL_bufend && isSPACE(*s))
5739 if (isIDFIRST_lazy_if(s,UTF)) {
5741 while (isALNUM_lazy_if(s,UTF))
5743 while (s < PL_bufend && isSPACE(*s))
5748 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5752 Perl_croak(aTHX_ "No comma allowed after %s", what);
5757 /* Either returns sv, or mortalizes sv and returns a new SV*.
5758 Best used as sv=new_constant(..., sv, ...).
5759 If s, pv are NULL, calls subroutine with one argument,
5760 and type is used with error messages only. */
5763 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5767 HV *table = GvHV(PL_hintgv); /* ^H */
5771 const char *why1, *why2, *why3;
5773 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5776 why2 = strEQ(key,"charnames")
5777 ? "(possibly a missing \"use charnames ...\")"
5779 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5780 (type ? type: "undef"), why2);
5782 /* This is convoluted and evil ("goto considered harmful")
5783 * but I do not understand the intricacies of all the different
5784 * failure modes of %^H in here. The goal here is to make
5785 * the most probable error message user-friendly. --jhi */
5790 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5791 (type ? type: "undef"), why1, why2, why3);
5793 yyerror(SvPVX(msg));
5797 cvp = hv_fetch(table, key, strlen(key), FALSE);
5798 if (!cvp || !SvOK(*cvp)) {
5801 why3 = "} is not defined";
5804 sv_2mortal(sv); /* Parent created it permanently */
5807 pv = sv_2mortal(newSVpvn(s, len));
5809 typesv = sv_2mortal(newSVpv(type, 0));
5811 typesv = &PL_sv_undef;
5813 PUSHSTACKi(PERLSI_OVERLOAD);
5825 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5829 /* Check the eval first */
5830 if (!PL_in_eval && SvTRUE(ERRSV)) {
5832 sv_catpv(ERRSV, "Propagated");
5833 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5835 res = SvREFCNT_inc(sv);
5839 (void)SvREFCNT_inc(res);
5848 why1 = "Call to &{$^H{";
5850 why3 = "}} did not return a defined value";
5859 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5861 register char *d = dest;
5862 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5865 Perl_croak(aTHX_ ident_too_long);
5866 if (isALNUM(*s)) /* UTF handled below */
5868 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
5873 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5877 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5878 char *t = s + UTF8SKIP(s);
5879 while (*t & 0x80 && is_utf8_mark((U8*)t))
5881 if (d + (t - s) > e)
5882 Perl_croak(aTHX_ ident_too_long);
5883 Copy(s, d, t - s, char);
5896 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
5906 e = d + destlen - 3; /* two-character token, ending NUL */
5908 while (isDIGIT(*s)) {
5910 Perl_croak(aTHX_ ident_too_long);
5917 Perl_croak(aTHX_ ident_too_long);
5918 if (isALNUM(*s)) /* UTF handled below */
5920 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
5925 else if (*s == ':' && s[1] == ':') {
5929 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5930 char *t = s + UTF8SKIP(s);
5931 while (*t & 0x80 && is_utf8_mark((U8*)t))
5933 if (d + (t - s) > e)
5934 Perl_croak(aTHX_ ident_too_long);
5935 Copy(s, d, t - s, char);
5946 if (PL_lex_state != LEX_NORMAL)
5947 PL_lex_state = LEX_INTERPENDMAYBE;
5950 if (*s == '$' && s[1] &&
5951 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
5964 if (*d == '^' && *s && isCONTROLVAR(*s)) {
5969 if (isSPACE(s[-1])) {
5972 if (!SPACE_OR_TAB(ch)) {
5978 if (isIDFIRST_lazy_if(d,UTF)) {
5982 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
5984 while (e < send && *e & 0x80 && is_utf8_mark((U8*)e))
5987 Copy(s, d, e - s, char);
5992 while ((isALNUM(*s) || *s == ':') && d < e)
5995 Perl_croak(aTHX_ ident_too_long);
5998 while (s < send && SPACE_OR_TAB(*s)) s++;
5999 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6000 dTHR; /* only for ckWARN */
6001 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6002 const char *brack = *s == '[' ? "[...]" : "{...}";
6003 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6004 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6005 funny, dest, brack, funny, dest, brack);
6008 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6012 /* Handle extended ${^Foo} variables
6013 * 1999-02-27 mjd-perl-patch@plover.com */
6014 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6018 while (isALNUM(*s) && d < e) {
6022 Perl_croak(aTHX_ ident_too_long);
6027 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6028 PL_lex_state = LEX_INTERPEND;
6031 if (PL_lex_state == LEX_NORMAL) {
6032 dTHR; /* only for ckWARN */
6033 if (ckWARN(WARN_AMBIGUOUS) &&
6034 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6036 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6037 "Ambiguous use of %c{%s} resolved to %c%s",
6038 funny, dest, funny, dest);
6043 s = bracket; /* let the parser handle it */
6047 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6048 PL_lex_state = LEX_INTERPEND;
6053 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6058 *pmfl |= PMf_GLOBAL;
6060 *pmfl |= PMf_CONTINUE;
6064 *pmfl |= PMf_MULTILINE;
6066 *pmfl |= PMf_SINGLELINE;
6068 *pmfl |= PMf_EXTENDED;
6072 S_scan_pat(pTHX_ char *start, I32 type)
6077 s = scan_str(start,FALSE,FALSE);
6080 SvREFCNT_dec(PL_lex_stuff);
6081 PL_lex_stuff = Nullsv;
6082 Perl_croak(aTHX_ "Search pattern not terminated");
6085 pm = (PMOP*)newPMOP(type, 0);
6086 if (PL_multi_open == '?')
6087 pm->op_pmflags |= PMf_ONCE;
6089 while (*s && strchr("iomsx", *s))
6090 pmflag(&pm->op_pmflags,*s++);
6093 while (*s && strchr("iogcmsx", *s))
6094 pmflag(&pm->op_pmflags,*s++);
6096 pm->op_pmpermflags = pm->op_pmflags;
6098 PL_lex_op = (OP*)pm;
6099 yylval.ival = OP_MATCH;
6104 S_scan_subst(pTHX_ char *start)
6111 yylval.ival = OP_NULL;
6113 s = scan_str(start,FALSE,FALSE);
6117 SvREFCNT_dec(PL_lex_stuff);
6118 PL_lex_stuff = Nullsv;
6119 Perl_croak(aTHX_ "Substitution pattern not terminated");
6122 if (s[-1] == PL_multi_open)
6125 first_start = PL_multi_start;
6126 s = scan_str(s,FALSE,FALSE);
6129 SvREFCNT_dec(PL_lex_stuff);
6130 PL_lex_stuff = Nullsv;
6132 SvREFCNT_dec(PL_lex_repl);
6133 PL_lex_repl = Nullsv;
6134 Perl_croak(aTHX_ "Substitution replacement not terminated");
6136 PL_multi_start = first_start; /* so whole substitution is taken together */
6138 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6144 else if (strchr("iogcmsx", *s))
6145 pmflag(&pm->op_pmflags,*s++);
6152 PL_sublex_info.super_bufptr = s;
6153 PL_sublex_info.super_bufend = PL_bufend;
6155 pm->op_pmflags |= PMf_EVAL;
6156 repl = newSVpvn("",0);
6158 sv_catpv(repl, es ? "eval " : "do ");
6159 sv_catpvn(repl, "{ ", 2);
6160 sv_catsv(repl, PL_lex_repl);
6161 sv_catpvn(repl, " };", 2);
6163 SvREFCNT_dec(PL_lex_repl);
6167 pm->op_pmpermflags = pm->op_pmflags;
6168 PL_lex_op = (OP*)pm;
6169 yylval.ival = OP_SUBST;
6174 S_scan_trans(pTHX_ char *start)
6185 yylval.ival = OP_NULL;
6187 s = scan_str(start,FALSE,FALSE);
6190 SvREFCNT_dec(PL_lex_stuff);
6191 PL_lex_stuff = Nullsv;
6192 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6194 if (s[-1] == PL_multi_open)
6197 s = scan_str(s,FALSE,FALSE);
6200 SvREFCNT_dec(PL_lex_stuff);
6201 PL_lex_stuff = Nullsv;
6203 SvREFCNT_dec(PL_lex_repl);
6204 PL_lex_repl = Nullsv;
6205 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6208 New(803,tbl,256,short);
6209 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6211 complement = del = squash = 0;
6212 while (strchr("cds", *s)) {
6214 complement = OPpTRANS_COMPLEMENT;
6216 del = OPpTRANS_DELETE;
6218 squash = OPpTRANS_SQUASH;
6221 o->op_private = del|squash|complement;
6224 yylval.ival = OP_TRANS;
6229 S_scan_heredoc(pTHX_ register char *s)
6233 I32 op_type = OP_SCALAR;
6240 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6244 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6247 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6248 if (*peek && strchr("`'\"",*peek)) {
6251 s = delimcpy(d, e, s, PL_bufend, term, &len);
6261 if (!isALNUM_lazy_if(s,UTF))
6262 deprecate("bare << to mean <<\"\"");
6263 for (; isALNUM_lazy_if(s,UTF); s++) {
6268 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6269 Perl_croak(aTHX_ "Delimiter for here document is too long");
6272 len = d - PL_tokenbuf;
6273 #ifndef PERL_STRICT_CR
6274 d = strchr(s, '\r');
6278 while (s < PL_bufend) {
6284 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6293 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6298 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6299 herewas = newSVpvn(s,PL_bufend-s);
6301 s--, herewas = newSVpvn(s,d-s);
6302 s += SvCUR(herewas);
6304 tmpstr = NEWSV(87,79);
6305 sv_upgrade(tmpstr, SVt_PVIV);
6310 else if (term == '`') {
6311 op_type = OP_BACKTICK;
6312 SvIVX(tmpstr) = '\\';
6316 PL_multi_start = CopLINE(PL_curcop);
6317 PL_multi_open = PL_multi_close = '<';
6318 term = *PL_tokenbuf;
6319 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6320 char *bufptr = PL_sublex_info.super_bufptr;
6321 char *bufend = PL_sublex_info.super_bufend;
6322 char *olds = s - SvCUR(herewas);
6323 s = strchr(bufptr, '\n');
6327 while (s < bufend &&
6328 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6330 CopLINE_inc(PL_curcop);
6333 CopLINE_set(PL_curcop, PL_multi_start);
6334 missingterm(PL_tokenbuf);
6336 sv_setpvn(herewas,bufptr,d-bufptr+1);
6337 sv_setpvn(tmpstr,d+1,s-d);
6339 sv_catpvn(herewas,s,bufend-s);
6340 (void)strcpy(bufptr,SvPVX(herewas));
6347 while (s < PL_bufend &&
6348 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6350 CopLINE_inc(PL_curcop);
6352 if (s >= PL_bufend) {
6353 CopLINE_set(PL_curcop, PL_multi_start);
6354 missingterm(PL_tokenbuf);
6356 sv_setpvn(tmpstr,d+1,s-d);
6358 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6360 sv_catpvn(herewas,s,PL_bufend-s);
6361 sv_setsv(PL_linestr,herewas);
6362 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6363 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6366 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6367 while (s >= PL_bufend) { /* multiple line string? */
6369 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6370 CopLINE_set(PL_curcop, PL_multi_start);
6371 missingterm(PL_tokenbuf);
6373 CopLINE_inc(PL_curcop);
6374 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6375 #ifndef PERL_STRICT_CR
6376 if (PL_bufend - PL_linestart >= 2) {
6377 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6378 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6380 PL_bufend[-2] = '\n';
6382 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6384 else if (PL_bufend[-1] == '\r')
6385 PL_bufend[-1] = '\n';
6387 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6388 PL_bufend[-1] = '\n';
6390 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6391 SV *sv = NEWSV(88,0);
6393 sv_upgrade(sv, SVt_PVMG);
6394 sv_setsv(sv,PL_linestr);
6395 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6397 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6400 sv_catsv(PL_linestr,herewas);
6401 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6405 sv_catsv(tmpstr,PL_linestr);
6410 PL_multi_end = CopLINE(PL_curcop);
6411 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6412 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6413 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6415 SvREFCNT_dec(herewas);
6416 PL_lex_stuff = tmpstr;
6417 yylval.ival = op_type;
6422 takes: current position in input buffer
6423 returns: new position in input buffer
6424 side-effects: yylval and lex_op are set.
6429 <FH> read from filehandle
6430 <pkg::FH> read from package qualified filehandle
6431 <pkg'FH> read from package qualified filehandle
6432 <$fh> read from filehandle in $fh
6438 S_scan_inputsymbol(pTHX_ char *start)
6440 register char *s = start; /* current position in buffer */
6446 d = PL_tokenbuf; /* start of temp holding space */
6447 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6448 end = strchr(s, '\n');
6451 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6453 /* die if we didn't have space for the contents of the <>,
6454 or if it didn't end, or if we see a newline
6457 if (len >= sizeof PL_tokenbuf)
6458 Perl_croak(aTHX_ "Excessively long <> operator");
6460 Perl_croak(aTHX_ "Unterminated <> operator");
6465 Remember, only scalar variables are interpreted as filehandles by
6466 this code. Anything more complex (e.g., <$fh{$num}>) will be
6467 treated as a glob() call.
6468 This code makes use of the fact that except for the $ at the front,
6469 a scalar variable and a filehandle look the same.
6471 if (*d == '$' && d[1]) d++;
6473 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6474 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6477 /* If we've tried to read what we allow filehandles to look like, and
6478 there's still text left, then it must be a glob() and not a getline.
6479 Use scan_str to pull out the stuff between the <> and treat it
6480 as nothing more than a string.
6483 if (d - PL_tokenbuf != len) {
6484 yylval.ival = OP_GLOB;
6486 s = scan_str(start,FALSE,FALSE);
6488 Perl_croak(aTHX_ "Glob not terminated");
6492 /* we're in a filehandle read situation */
6495 /* turn <> into <ARGV> */
6497 (void)strcpy(d,"ARGV");
6499 /* if <$fh>, create the ops to turn the variable into a
6505 /* try to find it in the pad for this block, otherwise find
6506 add symbol table ops
6508 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6509 OP *o = newOP(OP_PADSV, 0);
6511 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6514 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6515 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6516 newUNOP(OP_RV2SV, 0,
6517 newGVOP(OP_GV, 0, gv)));
6519 PL_lex_op->op_flags |= OPf_SPECIAL;
6520 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6521 yylval.ival = OP_NULL;
6524 /* If it's none of the above, it must be a literal filehandle
6525 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6527 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6528 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6529 yylval.ival = OP_NULL;
6538 takes: start position in buffer
6539 keep_quoted preserve \ on the embedded delimiter(s)
6540 keep_delims preserve the delimiters around the string
6541 returns: position to continue reading from buffer
6542 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6543 updates the read buffer.
6545 This subroutine pulls a string out of the input. It is called for:
6546 q single quotes q(literal text)
6547 ' single quotes 'literal text'
6548 qq double quotes qq(interpolate $here please)
6549 " double quotes "interpolate $here please"
6550 qx backticks qx(/bin/ls -l)
6551 ` backticks `/bin/ls -l`
6552 qw quote words @EXPORT_OK = qw( func() $spam )
6553 m// regexp match m/this/
6554 s/// regexp substitute s/this/that/
6555 tr/// string transliterate tr/this/that/
6556 y/// string transliterate y/this/that/
6557 ($*@) sub prototypes sub foo ($)
6558 (stuff) sub attr parameters sub foo : attr(stuff)
6559 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6561 In most of these cases (all but <>, patterns and transliterate)
6562 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6563 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6564 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6567 It skips whitespace before the string starts, and treats the first
6568 character as the delimiter. If the delimiter is one of ([{< then
6569 the corresponding "close" character )]}> is used as the closing
6570 delimiter. It allows quoting of delimiters, and if the string has
6571 balanced delimiters ([{<>}]) it allows nesting.
6573 The lexer always reads these strings into lex_stuff, except in the
6574 case of the operators which take *two* arguments (s/// and tr///)
6575 when it checks to see if lex_stuff is full (presumably with the 1st
6576 arg to s or tr) and if so puts the string into lex_repl.
6581 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6584 SV *sv; /* scalar value: string */
6585 char *tmps; /* temp string, used for delimiter matching */
6586 register char *s = start; /* current position in the buffer */
6587 register char term; /* terminating character */
6588 register char *to; /* current position in the sv's data */
6589 I32 brackets = 1; /* bracket nesting level */
6590 bool has_utf8 = FALSE; /* is there any utf8 content? */
6592 /* skip space before the delimiter */
6596 /* mark where we are, in case we need to report errors */
6599 /* after skipping whitespace, the next character is the terminator */
6601 if ((term & 0x80) && UTF)
6604 /* mark where we are */
6605 PL_multi_start = CopLINE(PL_curcop);
6606 PL_multi_open = term;
6608 /* find corresponding closing delimiter */
6609 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6611 PL_multi_close = term;
6613 /* create a new SV to hold the contents. 87 is leak category, I'm
6614 assuming. 79 is the SV's initial length. What a random number. */
6616 sv_upgrade(sv, SVt_PVIV);
6618 (void)SvPOK_only(sv); /* validate pointer */
6620 /* move past delimiter and try to read a complete string */
6622 sv_catpvn(sv, s, 1);
6625 /* extend sv if need be */
6626 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6627 /* set 'to' to the next character in the sv's string */
6628 to = SvPVX(sv)+SvCUR(sv);
6630 /* if open delimiter is the close delimiter read unbridle */
6631 if (PL_multi_open == PL_multi_close) {
6632 for (; s < PL_bufend; s++,to++) {
6633 /* embedded newlines increment the current line number */
6634 if (*s == '\n' && !PL_rsfp)
6635 CopLINE_inc(PL_curcop);
6636 /* handle quoted delimiters */
6637 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6638 if (!keep_quoted && s[1] == term)
6640 /* any other quotes are simply copied straight through */
6644 /* terminate when run out of buffer (the for() condition), or
6645 have found the terminator */
6646 else if (*s == term)
6648 else if (!has_utf8 && (*s & 0x80) && UTF)
6654 /* if the terminator isn't the same as the start character (e.g.,
6655 matched brackets), we have to allow more in the quoting, and
6656 be prepared for nested brackets.
6659 /* read until we run out of string, or we find the terminator */
6660 for (; s < PL_bufend; s++,to++) {
6661 /* embedded newlines increment the line count */
6662 if (*s == '\n' && !PL_rsfp)
6663 CopLINE_inc(PL_curcop);
6664 /* backslashes can escape the open or closing characters */
6665 if (*s == '\\' && s+1 < PL_bufend) {
6667 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6672 /* allow nested opens and closes */
6673 else if (*s == PL_multi_close && --brackets <= 0)
6675 else if (*s == PL_multi_open)
6677 else if (!has_utf8 && (*s & 0x80) && UTF)
6682 /* terminate the copied string and update the sv's end-of-string */
6684 SvCUR_set(sv, to - SvPVX(sv));
6687 * this next chunk reads more into the buffer if we're not done yet
6691 break; /* handle case where we are done yet :-) */
6693 #ifndef PERL_STRICT_CR
6694 if (to - SvPVX(sv) >= 2) {
6695 if ((to[-2] == '\r' && to[-1] == '\n') ||
6696 (to[-2] == '\n' && to[-1] == '\r'))
6700 SvCUR_set(sv, to - SvPVX(sv));
6702 else if (to[-1] == '\r')
6705 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6709 /* if we're out of file, or a read fails, bail and reset the current
6710 line marker so we can report where the unterminated string began
6713 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6715 CopLINE_set(PL_curcop, PL_multi_start);
6718 /* we read a line, so increment our line counter */
6719 CopLINE_inc(PL_curcop);
6721 /* update debugger info */
6722 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6723 SV *sv = NEWSV(88,0);
6725 sv_upgrade(sv, SVt_PVMG);
6726 sv_setsv(sv,PL_linestr);
6727 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6730 /* having changed the buffer, we must update PL_bufend */
6731 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6734 /* at this point, we have successfully read the delimited string */
6737 sv_catpvn(sv, s, 1);
6740 PL_multi_end = CopLINE(PL_curcop);
6743 /* if we allocated too much space, give some back */
6744 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6745 SvLEN_set(sv, SvCUR(sv) + 1);
6746 Renew(SvPVX(sv), SvLEN(sv), char);
6749 /* decide whether this is the first or second quoted string we've read
6762 takes: pointer to position in buffer
6763 returns: pointer to new position in buffer
6764 side-effects: builds ops for the constant in yylval.op
6766 Read a number in any of the formats that Perl accepts:
6768 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6769 [\d_]+(\.[\d_]*)?[Ee](\d+)
6771 Underbars (_) are allowed in decimal numbers. If -w is on,
6772 underbars before a decimal point must be at three digit intervals.
6774 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6777 If it reads a number without a decimal point or an exponent, it will
6778 try converting the number to an integer and see if it can do so
6779 without loss of precision.
6783 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6785 register char *s = start; /* current position in buffer */
6786 register char *d; /* destination in temp buffer */
6787 register char *e; /* end of temp buffer */
6788 NV nv; /* number read, as a double */
6789 SV *sv = Nullsv; /* place to put the converted number */
6790 bool floatit; /* boolean: int or float? */
6791 char *lastub = 0; /* position of last underbar */
6792 static char number_too_long[] = "Number too long";
6794 /* We use the first character to decide what type of number this is */
6798 Perl_croak(aTHX_ "panic: scan_num");
6800 /* if it starts with a 0, it could be an octal number, a decimal in
6801 0.13 disguise, or a hexadecimal number, or a binary number. */
6805 u holds the "number so far"
6806 shift the power of 2 of the base
6807 (hex == 4, octal == 3, binary == 1)
6808 overflowed was the number more than we can hold?
6810 Shift is used when we add a digit. It also serves as an "are
6811 we in octal/hex/binary?" indicator to disallow hex characters
6818 bool overflowed = FALSE;
6819 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6820 static char* bases[5] = { "", "binary", "", "octal",
6822 static char* Bases[5] = { "", "Binary", "", "Octal",
6824 static char *maxima[5] = { "",
6825 "0b11111111111111111111111111111111",
6829 char *base, *Base, *max;
6835 } else if (s[1] == 'b') {
6839 /* check for a decimal in disguise */
6840 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6842 /* so it must be octal */
6846 base = bases[shift];
6847 Base = Bases[shift];
6848 max = maxima[shift];
6850 /* read the rest of the number */
6852 /* x is used in the overflow test,
6853 b is the digit we're adding on. */
6858 /* if we don't mention it, we're done */
6867 /* 8 and 9 are not octal */
6870 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6874 case '2': case '3': case '4':
6875 case '5': case '6': case '7':
6877 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6881 b = *s++ & 15; /* ASCII digit -> value of digit */
6885 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6886 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6887 /* make sure they said 0x */
6892 /* Prepare to put the digit we have onto the end
6893 of the number so far. We check for overflows.
6898 x = u << shift; /* make room for the digit */
6900 if ((x >> shift) != u
6901 && !(PL_hints & HINT_NEW_BINARY)) {
6905 if (ckWARN_d(WARN_OVERFLOW))
6906 Perl_warner(aTHX_ WARN_OVERFLOW,
6907 "Integer overflow in %s number",
6910 u = x | b; /* add the digit to the end */
6913 n *= nvshift[shift];
6914 /* If an NV has not enough bits in its
6915 * mantissa to represent an UV this summing of
6916 * small low-order numbers is a waste of time
6917 * (because the NV cannot preserve the
6918 * low-order bits anyway): we could just
6919 * remember when did we overflow and in the
6920 * end just multiply n by the right
6928 /* if we get here, we had success: make a scalar value from
6935 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
6936 Perl_warner(aTHX_ WARN_PORTABLE,
6937 "%s number > %s non-portable",
6944 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
6945 Perl_warner(aTHX_ WARN_PORTABLE,
6946 "%s number > %s non-portable",
6951 if (PL_hints & HINT_NEW_BINARY)
6952 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
6957 handle decimal numbers.
6958 we're also sent here when we read a 0 as the first digit
6960 case '1': case '2': case '3': case '4': case '5':
6961 case '6': case '7': case '8': case '9': case '.':
6964 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
6967 /* read next group of digits and _ and copy into d */
6968 while (isDIGIT(*s) || *s == '_') {
6969 /* skip underscores, checking for misplaced ones
6973 dTHR; /* only for ckWARN */
6974 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
6975 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6979 /* check for end of fixed-length buffer */
6981 Perl_croak(aTHX_ number_too_long);
6982 /* if we're ok, copy the character */
6987 /* final misplaced underbar check */
6988 if (lastub && s - lastub != 3) {
6990 if (ckWARN(WARN_SYNTAX))
6991 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6994 /* read a decimal portion if there is one. avoid
6995 3..5 being interpreted as the number 3. followed
6998 if (*s == '.' && s[1] != '.') {
7002 /* copy, ignoring underbars, until we run out of
7003 digits. Note: no misplaced underbar checks!
7005 for (; isDIGIT(*s) || *s == '_'; s++) {
7006 /* fixed length buffer check */
7008 Perl_croak(aTHX_ number_too_long);
7012 if (*s == '.' && isDIGIT(s[1])) {
7013 /* oops, it's really a v-string, but without the "v" */
7019 /* read exponent part, if present */
7020 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
7024 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7025 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7027 /* allow positive or negative exponent */
7028 if (*s == '+' || *s == '-')
7031 /* read digits of exponent (no underbars :-) */
7032 while (isDIGIT(*s)) {
7034 Perl_croak(aTHX_ number_too_long);
7039 /* terminate the string */
7042 /* make an sv from the string */
7045 #if defined(Strtol) && defined(Strtoul)
7048 strtol/strtoll sets errno to ERANGE if the number is too big
7049 for an integer. We try to do an integer conversion first
7050 if no characters indicating "float" have been found.
7057 if (*PL_tokenbuf == '-')
7058 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7060 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7062 floatit = TRUE; /* Probably just too large. */
7063 else if (*PL_tokenbuf == '-')
7065 else if (uv <= IV_MAX)
7066 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7071 nv = Atof(PL_tokenbuf);
7076 No working strtou?ll?.
7078 Unfortunately atol() doesn't do range checks (returning
7079 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7080 everywhere [1], so we cannot use use atol() (or atoll()).
7081 If we could, they would be used, as Atol(), very much like
7082 Strtol() and Strtoul() are used above.
7084 [1] XXX Configure test needed to check for atol()
7085 (and atoll()) overflow behaviour XXX
7089 We need to do this the hard way. */
7091 nv = Atof(PL_tokenbuf);
7093 /* See if we can make do with an integer value without loss of
7094 precision. We use U_V to cast to a UV, because some
7095 compilers have issues. Then we try casting it back and see
7096 if it was the same [1]. We only do this if we know we
7097 specifically read an integer. If floatit is true, then we
7098 don't need to do the conversion at all.
7100 [1] Note that this is lossy if our NVs cannot preserve our
7101 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7102 and NV_PRESERVES_UV_BITS (a number), but in general we really
7103 do hope all such potentially lossy platforms have strtou?ll?
7104 to do a lossless IV/UV conversion.
7106 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7107 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7108 as NV_DIG and NV_MANT_DIG)?
7114 if (!floatit && (NV)uv == nv) {
7116 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7124 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7125 (PL_hints & HINT_NEW_INTEGER) )
7126 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7127 (floatit ? "float" : "integer"),
7131 /* if it starts with a v, it could be a v-string */
7137 while (isDIGIT(*pos) || *pos == '_')
7139 if (!isALPHA(*pos)) {
7141 U8 tmpbuf[UTF8_MAXLEN];
7144 s++; /* get past 'v' */
7147 sv_setpvn(sv, "", 0);
7150 if (*s == '0' && isDIGIT(s[1]))
7151 yyerror("Octal number in vector unsupported");
7154 /* this is atoi() that tolerates underscores */
7157 while (--end >= s) {
7162 rev += (*end - '0') * mult;
7164 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7165 Perl_warner(aTHX_ WARN_OVERFLOW,
7166 "Integer overflow in decimal number");
7169 tmpend = uv_to_utf8(tmpbuf, rev);
7170 utf8 = utf8 || rev > 127;
7171 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7172 if (*pos == '.' && isDIGIT(pos[1]))
7178 while (isDIGIT(*pos) || *pos == '_')
7186 sv_utf8_downgrade(sv, TRUE);
7193 /* make the op for the constant and return */
7196 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7198 lvalp->opval = Nullop;
7204 S_scan_formline(pTHX_ register char *s)
7209 SV *stuff = newSVpvn("",0);
7210 bool needargs = FALSE;
7213 if (*s == '.' || *s == /*{*/'}') {
7215 #ifdef PERL_STRICT_CR
7216 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7218 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7220 if (*t == '\n' || t == PL_bufend)
7223 if (PL_in_eval && !PL_rsfp) {
7224 eol = strchr(s,'\n');
7229 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7231 for (t = s; t < eol; t++) {
7232 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7234 goto enough; /* ~~ must be first line in formline */
7236 if (*t == '@' || *t == '^')
7239 sv_catpvn(stuff, s, eol-s);
7240 #ifndef PERL_STRICT_CR
7241 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7242 char *end = SvPVX(stuff) + SvCUR(stuff);
7251 s = filter_gets(PL_linestr, PL_rsfp, 0);
7252 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7253 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7256 yyerror("Format not terminated");
7266 PL_lex_state = LEX_NORMAL;
7267 PL_nextval[PL_nexttoke].ival = 0;
7271 PL_lex_state = LEX_FORMLINE;
7272 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7274 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7278 SvREFCNT_dec(stuff);
7279 PL_lex_formbrack = 0;
7290 PL_cshlen = strlen(PL_cshname);
7295 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7298 I32 oldsavestack_ix = PL_savestack_ix;
7299 CV* outsidecv = PL_compcv;
7303 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7305 SAVEI32(PL_subline);
7306 save_item(PL_subname);
7309 SAVESPTR(PL_comppad_name);
7310 SAVESPTR(PL_compcv);
7311 SAVEI32(PL_comppad_name_fill);
7312 SAVEI32(PL_min_intro_pending);
7313 SAVEI32(PL_max_intro_pending);
7314 SAVEI32(PL_pad_reset_pending);
7316 PL_compcv = (CV*)NEWSV(1104,0);
7317 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7318 CvFLAGS(PL_compcv) |= flags;
7320 PL_comppad = newAV();
7321 av_push(PL_comppad, Nullsv);
7322 PL_curpad = AvARRAY(PL_comppad);
7323 PL_comppad_name = newAV();
7324 PL_comppad_name_fill = 0;
7325 PL_min_intro_pending = 0;
7327 PL_subline = CopLINE(PL_curcop);
7329 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7330 PL_curpad[0] = (SV*)newAV();
7331 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7332 #endif /* USE_THREADS */
7334 comppadlist = newAV();
7335 AvREAL_off(comppadlist);
7336 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7337 av_store(comppadlist, 1, (SV*)PL_comppad);
7339 CvPADLIST(PL_compcv) = comppadlist;
7340 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7342 CvOWNER(PL_compcv) = 0;
7343 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7344 MUTEX_INIT(CvMUTEXP(PL_compcv));
7345 #endif /* USE_THREADS */
7347 return oldsavestack_ix;
7351 Perl_yywarn(pTHX_ char *s)
7354 PL_in_eval |= EVAL_WARNONLY;
7356 PL_in_eval &= ~EVAL_WARNONLY;
7361 Perl_yyerror(pTHX_ char *s)
7365 char *context = NULL;
7369 if (!yychar || (yychar == ';' && !PL_rsfp))
7371 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7372 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7373 while (isSPACE(*PL_oldoldbufptr))
7375 context = PL_oldoldbufptr;
7376 contlen = PL_bufptr - PL_oldoldbufptr;
7378 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7379 PL_oldbufptr != PL_bufptr) {
7380 while (isSPACE(*PL_oldbufptr))
7382 context = PL_oldbufptr;
7383 contlen = PL_bufptr - PL_oldbufptr;
7385 else if (yychar > 255)
7386 where = "next token ???";
7387 #ifdef USE_PURE_BISON
7388 /* GNU Bison sets the value -2 */
7389 else if (yychar == -2) {
7391 else if ((yychar & 127) == 127) {
7393 if (PL_lex_state == LEX_NORMAL ||
7394 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7395 where = "at end of line";
7396 else if (PL_lex_inpat)
7397 where = "within pattern";
7399 where = "within string";
7402 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7404 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7405 else if (isPRINT_LC(yychar))
7406 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7408 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7409 where = SvPVX(where_sv);
7411 msg = sv_2mortal(newSVpv(s, 0));
7412 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7413 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7415 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7417 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7418 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7419 Perl_sv_catpvf(aTHX_ msg,
7420 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7421 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7424 if (PL_in_eval & EVAL_WARNONLY)
7425 Perl_warn(aTHX_ "%"SVf, msg);
7428 if (PL_error_count >= 10) {
7429 if (PL_in_eval && SvCUR(ERRSV))
7430 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7431 ERRSV, CopFILE(PL_curcop));
7433 Perl_croak(aTHX_ "%s has too many errors.\n",
7434 CopFILE(PL_curcop));
7437 PL_in_my_stash = Nullhv;
7442 S_swallow_bom(pTHX_ U8 *s)
7445 slen = SvCUR(PL_linestr);
7449 /* UTF-16 little-endian */
7450 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7451 Perl_croak(aTHX_ "Unsupported script encoding");
7452 #ifndef PERL_NO_UTF16_FILTER
7453 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7455 if (PL_bufend > (char*)s) {
7459 filter_add(utf16rev_textfilter, NULL);
7460 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7461 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7462 PL_bufend - (char*)s - 1,
7464 Copy(news, s, newlen, U8);
7465 SvCUR_set(PL_linestr, newlen);
7466 PL_bufend = SvPVX(PL_linestr) + newlen;
7467 news[newlen++] = '\0';
7471 Perl_croak(aTHX_ "Unsupported script encoding");
7476 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7477 #ifndef PERL_NO_UTF16_FILTER
7478 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7480 if (PL_bufend > (char *)s) {
7484 filter_add(utf16_textfilter, NULL);
7485 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7486 PL_bufend = (char*)utf16_to_utf8(s, news,
7487 PL_bufend - (char*)s,
7489 Copy(news, s, newlen, U8);
7490 SvCUR_set(PL_linestr, newlen);
7491 PL_bufend = SvPVX(PL_linestr) + newlen;
7492 news[newlen++] = '\0';
7496 Perl_croak(aTHX_ "Unsupported script encoding");
7501 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7502 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7507 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7508 s[2] == 0xFE && s[3] == 0xFF)
7510 Perl_croak(aTHX_ "Unsupported script encoding");
7522 * Restore a source filter.
7526 restore_rsfp(pTHXo_ void *f)
7528 PerlIO *fp = (PerlIO*)f;
7530 if (PL_rsfp == PerlIO_stdin())
7531 PerlIO_clearerr(PL_rsfp);
7532 else if (PL_rsfp && (PL_rsfp != fp))
7533 PerlIO_close(PL_rsfp);
7537 #ifndef PERL_NO_UTF16_FILTER
7539 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7541 I32 count = FILTER_READ(idx+1, sv, maxlen);
7546 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7547 if (!*SvPV_nolen(sv))
7548 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7551 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7552 sv_usepvn(sv, (char*)tmps, tend - tmps);
7558 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7560 I32 count = FILTER_READ(idx+1, sv, maxlen);
7565 if (!*SvPV_nolen(sv))
7566 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7569 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7570 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7571 sv_usepvn(sv, (char*)tmps, tend - tmps);