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
78 # define YYMAXLEVEL 100
80 YYSTYPE* yylval_pointer[YYMAXLEVEL];
81 int* yychar_pointer[YYMAXLEVEL];
85 # define yylval (*yylval_pointer[yyactlevel])
86 # define yychar (*yychar_pointer[yyactlevel])
87 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
89 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
94 /* CLINE is a macro that ensures PL_copline has a sane value */
99 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
102 * Convenience functions to return different tokens and prime the
103 * lexer for the next token. They all take an argument.
105 * TOKEN : generic token (used for '(', DOLSHARP, etc)
106 * OPERATOR : generic operator
107 * AOPERATOR : assignment operator
108 * PREBLOCK : beginning the block after an if, while, foreach, ...
109 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
110 * PREREF : *EXPR where EXPR is not a simple identifier
111 * TERM : expression term
112 * LOOPX : loop exiting command (goto, last, dump, etc)
113 * FTST : file test operator
114 * FUN0 : zero-argument function
115 * FUN1 : not used, except for not, which isn't a UNIOP
116 * BOop : bitwise or or xor
118 * SHop : shift operator
119 * PWop : power operator
120 * PMop : pattern-matching operator
121 * Aop : addition-level operator
122 * Mop : multiplication-level operator
123 * Eop : equality-testing operator
124 * Rop : relational operator <= != gt
126 * Also see LOP and lop() below.
129 #define TOKEN(retval) return (PL_bufptr = s,(int)retval)
130 #define OPERATOR(retval) return (PL_expect = XTERM,PL_bufptr = s,(int)retval)
131 #define AOPERATOR(retval) return ao((PL_expect = XTERM,PL_bufptr = s,(int)retval))
132 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
133 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
134 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s,(int)retval)
135 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR,PL_bufptr = s,(int)retval)
136 #define LOOPX(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
137 #define FTST(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
138 #define FUN0(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
139 #define FUN1(f) return(yylval.ival = f,PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
140 #define BOop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
141 #define BAop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
142 #define SHop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
143 #define PWop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
144 #define PMop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
145 #define Aop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
146 #define Mop(f) return ao((yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
147 #define Eop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
148 #define Rop(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
150 /* This bit of chicanery makes a unary function followed by
151 * a parenthesis into a function with one argument, highest precedence.
153 #define UNI(f) return(yylval.ival = f, \
156 PL_last_uni = PL_oldbufptr, \
157 PL_last_lop_op = f, \
158 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
160 #define UNIBRACK(f) return(yylval.ival = f, \
162 PL_last_uni = PL_oldbufptr, \
163 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
165 /* grandfather return to old style */
166 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
171 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
172 * into an OP_ANDASSIGN or OP_ORASSIGN
176 S_ao(pTHX_ int toketype)
178 if (*PL_bufptr == '=') {
180 if (toketype == ANDAND)
181 yylval.ival = OP_ANDASSIGN;
182 else if (toketype == OROR)
183 yylval.ival = OP_ORASSIGN;
191 * When Perl expects an operator and finds something else, no_op
192 * prints the warning. It always prints "<something> found where
193 * operator expected. It prints "Missing semicolon on previous line?"
194 * if the surprise occurs at the start of the line. "do you need to
195 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
196 * where the compiler doesn't know if foo is a method call or a function.
197 * It prints "Missing operator before end of line" if there's nothing
198 * after the missing operator, or "... before <...>" if there is something
199 * after the missing operator.
203 S_no_op(pTHX_ char *what, char *s)
205 char *oldbp = PL_bufptr;
206 bool is_first = (PL_oldbufptr == PL_linestart);
212 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
214 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
215 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
217 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
218 if (t < PL_bufptr && isSPACE(*t))
219 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
220 t - PL_oldoldbufptr, PL_oldoldbufptr);
224 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
231 * Complain about missing quote/regexp/heredoc terminator.
232 * If it's called with (char *)NULL then it cauterizes the line buffer.
233 * If we're in a delimited string and the delimiter is a control
234 * character, it's reformatted into a two-char sequence like ^C.
239 S_missingterm(pTHX_ char *s)
244 char *nl = strrchr(s,'\n');
250 iscntrl(PL_multi_close)
252 PL_multi_close < 32 || PL_multi_close == 127
256 tmpbuf[1] = toCTRL(PL_multi_close);
262 *tmpbuf = PL_multi_close;
266 q = strchr(s,'"') ? '\'' : '"';
267 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
275 Perl_deprecate(pTHX_ char *s)
278 if (ckWARN(WARN_DEPRECATED))
279 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
284 * Deprecate a comma-less variable list.
290 deprecate("comma-less variable list");
294 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
295 * utf16-to-utf8-reversed.
298 #ifdef PERL_CR_FILTER
302 register char *s = SvPVX(sv);
303 register char *e = s + SvCUR(sv);
304 /* outer loop optimized to do nothing if there are no CR-LFs */
306 if (*s++ == '\r' && *s == '\n') {
307 /* hit a CR-LF, need to copy the rest */
308 register char *d = s - 1;
311 if (*s == '\r' && s[1] == '\n')
322 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
324 I32 count = FILTER_READ(idx+1, sv, maxlen);
325 if (count > 0 && !maxlen)
333 * Initialize variables. Uses the Perl save_stack to save its state (for
334 * recursive calls to the parser).
338 Perl_lex_start(pTHX_ SV *line)
344 SAVEI32(PL_lex_dojoin);
345 SAVEI32(PL_lex_brackets);
346 SAVEI32(PL_lex_casemods);
347 SAVEI32(PL_lex_starts);
348 SAVEI32(PL_lex_state);
349 SAVEVPTR(PL_lex_inpat);
350 SAVEI32(PL_lex_inwhat);
351 if (PL_lex_state == LEX_KNOWNEXT) {
352 I32 toke = PL_nexttoke;
353 while (--toke >= 0) {
354 SAVEI32(PL_nexttype[toke]);
355 SAVEVPTR(PL_nextval[toke]);
357 SAVEI32(PL_nexttoke);
359 SAVECOPLINE(PL_curcop);
362 SAVEPPTR(PL_oldbufptr);
363 SAVEPPTR(PL_oldoldbufptr);
364 SAVEPPTR(PL_linestart);
365 SAVESPTR(PL_linestr);
366 SAVEPPTR(PL_lex_brackstack);
367 SAVEPPTR(PL_lex_casestack);
368 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
369 SAVESPTR(PL_lex_stuff);
370 SAVEI32(PL_lex_defer);
371 SAVEI32(PL_sublex_info.sub_inwhat);
372 SAVESPTR(PL_lex_repl);
374 SAVEINT(PL_lex_expect);
376 PL_lex_state = LEX_NORMAL;
380 New(899, PL_lex_brackstack, 120, char);
381 New(899, PL_lex_casestack, 12, char);
382 SAVEFREEPV(PL_lex_brackstack);
383 SAVEFREEPV(PL_lex_casestack);
385 *PL_lex_casestack = '\0';
388 PL_lex_stuff = Nullsv;
389 PL_lex_repl = Nullsv;
393 PL_sublex_info.sub_inwhat = 0;
395 if (SvREADONLY(PL_linestr))
396 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
397 s = SvPV(PL_linestr, len);
398 if (len && s[len-1] != ';') {
399 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
400 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
401 sv_catpvn(PL_linestr, "\n;", 2);
403 SvTEMP_off(PL_linestr);
404 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
405 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
407 PL_rs = newSVpvn("\n", 1);
413 * Finalizer for lexing operations. Must be called when the parser is
414 * done with the lexer.
420 PL_doextract = FALSE;
425 * This subroutine has nothing to do with tilting, whether at windmills
426 * or pinball tables. Its name is short for "increment line". It
427 * increments the current line number in CopLINE(PL_curcop) and checks
428 * to see whether the line starts with a comment of the form
429 * # line 500 "foo.pm"
430 * If so, it sets the current line number and file to the values in the comment.
434 S_incline(pTHX_ char *s)
442 CopLINE_inc(PL_curcop);
445 while (SPACE_OR_TAB(*s)) s++;
446 if (strnEQ(s, "line", 4))
450 if (*s == ' ' || *s == '\t')
454 while (SPACE_OR_TAB(*s)) s++;
460 while (SPACE_OR_TAB(*s))
462 if (*s == '"' && (t = strchr(s+1, '"'))) {
467 for (t = s; !isSPACE(*t); t++) ;
470 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
472 if (*e != '\n' && *e != '\0')
473 return; /* false alarm */
479 Safefree(CopFILE(PL_curcop));
481 SvREFCNT_dec(CopFILEGV(PL_curcop));
483 CopFILE_set(PL_curcop, s);
486 CopLINE_set(PL_curcop, atoi(n)-1);
491 * Called to gobble the appropriate amount and type of whitespace.
492 * Skips comments as well.
496 S_skipspace(pTHX_ register char *s)
499 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
500 while (s < PL_bufend && SPACE_OR_TAB(*s))
506 SSize_t oldprevlen, oldoldprevlen;
507 SSize_t oldloplen, oldunilen;
508 while (s < PL_bufend && isSPACE(*s)) {
509 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
514 if (s < PL_bufend && *s == '#') {
515 while (s < PL_bufend && *s != '\n')
519 if (PL_in_eval && !PL_rsfp) {
526 /* only continue to recharge the buffer if we're at the end
527 * of the buffer, we're not reading from a source filter, and
528 * we're in normal lexing mode
530 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
531 PL_lex_state == LEX_FORMLINE)
534 /* try to recharge the buffer */
535 if ((s = filter_gets(PL_linestr, PL_rsfp,
536 (prevlen = SvCUR(PL_linestr)))) == Nullch)
538 /* end of file. Add on the -p or -n magic */
539 if (PL_minus_n || PL_minus_p) {
540 sv_setpv(PL_linestr,PL_minus_p ?
541 ";}continue{print or die qq(-p destination: $!\\n)" :
543 sv_catpv(PL_linestr,";}");
544 PL_minus_n = PL_minus_p = 0;
547 sv_setpv(PL_linestr,";");
549 /* reset variables for next time we lex */
550 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
552 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
554 /* Close the filehandle. Could be from -P preprocessor,
555 * STDIN, or a regular file. If we were reading code from
556 * STDIN (because the commandline held no -e or filename)
557 * then we don't close it, we reset it so the code can
558 * read from STDIN too.
561 if (PL_preprocess && !PL_in_eval)
562 (void)PerlProc_pclose(PL_rsfp);
563 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
564 PerlIO_clearerr(PL_rsfp);
566 (void)PerlIO_close(PL_rsfp);
571 /* not at end of file, so we only read another line */
572 /* make corresponding updates to old pointers, for yyerror() */
573 oldprevlen = PL_oldbufptr - PL_bufend;
574 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
576 oldunilen = PL_last_uni - PL_bufend;
578 oldloplen = PL_last_lop - PL_bufend;
579 PL_linestart = PL_bufptr = s + prevlen;
580 PL_bufend = s + SvCUR(PL_linestr);
582 PL_oldbufptr = s + oldprevlen;
583 PL_oldoldbufptr = s + oldoldprevlen;
585 PL_last_uni = s + oldunilen;
587 PL_last_lop = s + oldloplen;
590 /* debugger active and we're not compiling the debugger code,
591 * so store the line into the debugger's array of lines
593 if (PERLDB_LINE && PL_curstash != PL_debstash) {
594 SV *sv = NEWSV(85,0);
596 sv_upgrade(sv, SVt_PVMG);
597 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
598 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
605 * Check the unary operators to ensure there's no ambiguity in how they're
606 * used. An ambiguous piece of code would be:
608 * This doesn't mean rand() + 5. Because rand() is a unary operator,
609 * the +5 is its argument.
619 if (PL_oldoldbufptr != PL_last_uni)
621 while (isSPACE(*PL_last_uni))
623 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
624 if ((t = strchr(s, '(')) && t < PL_bufptr)
626 if (ckWARN_d(WARN_AMBIGUOUS)){
629 Perl_warner(aTHX_ WARN_AMBIGUOUS,
630 "Warning: Use of \"%s\" without parens is ambiguous",
636 /* workaround to replace the UNI() macro with a function. Only the
637 * hints/uts.sh file mentions this. Other comments elsewhere in the
638 * source indicate Microport Unix might need it too.
644 #define UNI(f) return uni(f,s)
647 S_uni(pTHX_ I32 f, char *s)
652 PL_last_uni = PL_oldbufptr;
663 #endif /* CRIPPLED_CC */
666 * LOP : macro to build a list operator. Its behaviour has been replaced
667 * with a subroutine, S_lop() for which LOP is just another name.
670 #define LOP(f,x) return lop(f,x,s)
674 * Build a list operator (or something that might be one). The rules:
675 * - if we have a next token, then it's a list operator [why?]
676 * - if the next thing is an opening paren, then it's a function
677 * - else it's a list operator
681 S_lop(pTHX_ I32 f, int x, char *s)
688 PL_last_lop = PL_oldbufptr;
703 * When the lexer realizes it knows the next token (for instance,
704 * it is reordering tokens for the parser) then it can call S_force_next
705 * to know what token to return the next time the lexer is called. Caller
706 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
707 * handles the token correctly.
711 S_force_next(pTHX_ I32 type)
713 PL_nexttype[PL_nexttoke] = type;
715 if (PL_lex_state != LEX_KNOWNEXT) {
716 PL_lex_defer = PL_lex_state;
717 PL_lex_expect = PL_expect;
718 PL_lex_state = LEX_KNOWNEXT;
724 * When the lexer knows the next thing is a word (for instance, it has
725 * just seen -> and it knows that the next char is a word char, then
726 * it calls S_force_word to stick the next word into the PL_next lookahead.
729 * char *start : buffer position (must be within PL_linestr)
730 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
731 * int check_keyword : if true, Perl checks to make sure the word isn't
732 * a keyword (do this if the word is a label, e.g. goto FOO)
733 * int allow_pack : if true, : characters will also be allowed (require,
735 * int allow_initial_tick : used by the "sub" lexer only.
739 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
744 start = skipspace(start);
746 if (isIDFIRST_lazy_if(s,UTF) ||
747 (allow_pack && *s == ':') ||
748 (allow_initial_tick && *s == '\'') )
750 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
751 if (check_keyword && keyword(PL_tokenbuf, len))
753 if (token == METHOD) {
758 PL_expect = XOPERATOR;
761 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
762 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
770 * Called when the lexer wants $foo *foo &foo etc, but the program
771 * text only contains the "foo" portion. The first argument is a pointer
772 * to the "foo", and the second argument is the type symbol to prefix.
773 * Forces the next token to be a "WORD".
774 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
778 S_force_ident(pTHX_ register char *s, int kind)
781 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
782 PL_nextval[PL_nexttoke].opval = o;
785 dTHR; /* just for in_eval */
786 o->op_private = OPpCONST_ENTERED;
787 /* XXX see note in pp_entereval() for why we forgo typo
788 warnings if the symbol must be introduced in an eval.
790 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
791 kind == '$' ? SVt_PV :
792 kind == '@' ? SVt_PVAV :
793 kind == '%' ? SVt_PVHV :
801 Perl_str_to_version(pTHX_ SV *sv)
806 char *start = SvPVx(sv,len);
807 bool utf = SvUTF8(sv) ? TRUE : FALSE;
808 char *end = start + len;
809 while (start < end) {
813 n = utf8_to_uv((U8*)start, len, &skip, 0);
818 retval += ((NV)n)/nshift;
827 * Forces the next token to be a version number.
831 S_force_version(pTHX_ char *s)
833 OP *version = Nullop;
842 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
843 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
845 s = scan_num(s, &yylval);
846 version = yylval.opval;
847 ver = cSVOPx(version)->op_sv;
848 if (SvPOK(ver) && !SvNIOK(ver)) {
849 (void)SvUPGRADE(ver, SVt_PVNV);
850 SvNVX(ver) = str_to_version(ver);
851 SvNOK_on(ver); /* hint that it is a version */
856 /* NOTE: The parser sees the package name and the VERSION swapped */
857 PL_nextval[PL_nexttoke].opval = version;
865 * Tokenize a quoted string passed in as an SV. It finds the next
866 * chunk, up to end of string or a backslash. It may make a new
867 * SV containing that chunk (if HINT_NEW_STRING is on). It also
872 S_tokeq(pTHX_ SV *sv)
883 s = SvPV_force(sv, len);
884 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
887 while (s < send && *s != '\\')
892 if ( PL_hints & HINT_NEW_STRING )
893 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
896 if (s + 1 < send && (s[1] == '\\'))
897 s++; /* all that, just for this */
902 SvCUR_set(sv, d - SvPVX(sv));
904 if ( PL_hints & HINT_NEW_STRING )
905 return new_constant(NULL, 0, "q", sv, pv, "q");
910 * Now come three functions related to double-quote context,
911 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
912 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
913 * interact with PL_lex_state, and create fake ( ... ) argument lists
914 * to handle functions and concatenation.
915 * They assume that whoever calls them will be setting up a fake
916 * join call, because each subthing puts a ',' after it. This lets
919 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
921 * (I'm not sure whether the spurious commas at the end of lcfirst's
922 * arguments and join's arguments are created or not).
927 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
929 * Pattern matching will set PL_lex_op to the pattern-matching op to
930 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
932 * OP_CONST and OP_READLINE are easy--just make the new op and return.
934 * Everything else becomes a FUNC.
936 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
937 * had an OP_CONST or OP_READLINE). This just sets us up for a
938 * call to S_sublex_push().
944 register I32 op_type = yylval.ival;
946 if (op_type == OP_NULL) {
947 yylval.opval = PL_lex_op;
951 if (op_type == OP_CONST || op_type == OP_READLINE) {
952 SV *sv = tokeq(PL_lex_stuff);
954 if (SvTYPE(sv) == SVt_PVIV) {
955 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
961 nsv = newSVpvn(p, len);
967 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
968 PL_lex_stuff = Nullsv;
972 PL_sublex_info.super_state = PL_lex_state;
973 PL_sublex_info.sub_inwhat = op_type;
974 PL_sublex_info.sub_op = PL_lex_op;
975 PL_lex_state = LEX_INTERPPUSH;
979 yylval.opval = PL_lex_op;
989 * Create a new scope to save the lexing state. The scope will be
990 * ended in S_sublex_done. Returns a '(', starting the function arguments
991 * to the uc, lc, etc. found before.
992 * Sets PL_lex_state to LEX_INTERPCONCAT.
1001 PL_lex_state = PL_sublex_info.super_state;
1002 SAVEI32(PL_lex_dojoin);
1003 SAVEI32(PL_lex_brackets);
1004 SAVEI32(PL_lex_casemods);
1005 SAVEI32(PL_lex_starts);
1006 SAVEI32(PL_lex_state);
1007 SAVEVPTR(PL_lex_inpat);
1008 SAVEI32(PL_lex_inwhat);
1009 SAVECOPLINE(PL_curcop);
1010 SAVEPPTR(PL_bufptr);
1011 SAVEPPTR(PL_oldbufptr);
1012 SAVEPPTR(PL_oldoldbufptr);
1013 SAVEPPTR(PL_linestart);
1014 SAVESPTR(PL_linestr);
1015 SAVEPPTR(PL_lex_brackstack);
1016 SAVEPPTR(PL_lex_casestack);
1018 PL_linestr = PL_lex_stuff;
1019 PL_lex_stuff = Nullsv;
1021 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1022 = SvPVX(PL_linestr);
1023 PL_bufend += SvCUR(PL_linestr);
1024 SAVEFREESV(PL_linestr);
1026 PL_lex_dojoin = FALSE;
1027 PL_lex_brackets = 0;
1028 New(899, PL_lex_brackstack, 120, char);
1029 New(899, PL_lex_casestack, 12, char);
1030 SAVEFREEPV(PL_lex_brackstack);
1031 SAVEFREEPV(PL_lex_casestack);
1032 PL_lex_casemods = 0;
1033 *PL_lex_casestack = '\0';
1035 PL_lex_state = LEX_INTERPCONCAT;
1036 CopLINE_set(PL_curcop, PL_multi_start);
1038 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1039 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1040 PL_lex_inpat = PL_sublex_info.sub_op;
1042 PL_lex_inpat = Nullop;
1049 * Restores lexer state after a S_sublex_push.
1055 if (!PL_lex_starts++) {
1056 PL_expect = XOPERATOR;
1057 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn("",0));
1061 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1062 PL_lex_state = LEX_INTERPCASEMOD;
1066 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1067 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1068 PL_linestr = PL_lex_repl;
1070 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1071 PL_bufend += SvCUR(PL_linestr);
1072 SAVEFREESV(PL_linestr);
1073 PL_lex_dojoin = FALSE;
1074 PL_lex_brackets = 0;
1075 PL_lex_casemods = 0;
1076 *PL_lex_casestack = '\0';
1078 if (SvEVALED(PL_lex_repl)) {
1079 PL_lex_state = LEX_INTERPNORMAL;
1081 /* we don't clear PL_lex_repl here, so that we can check later
1082 whether this is an evalled subst; that means we rely on the
1083 logic to ensure sublex_done() is called again only via the
1084 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1087 PL_lex_state = LEX_INTERPCONCAT;
1088 PL_lex_repl = Nullsv;
1094 PL_bufend = SvPVX(PL_linestr);
1095 PL_bufend += SvCUR(PL_linestr);
1096 PL_expect = XOPERATOR;
1097 PL_sublex_info.sub_inwhat = 0;
1105 Extracts a pattern, double-quoted string, or transliteration. This
1108 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1109 processing a pattern (PL_lex_inpat is true), a transliteration
1110 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1112 Returns a pointer to the character scanned up to. Iff this is
1113 advanced from the start pointer supplied (ie if anything was
1114 successfully parsed), will leave an OP for the substring scanned
1115 in yylval. Caller must intuit reason for not parsing further
1116 by looking at the next characters herself.
1120 double-quoted style: \r and \n
1121 regexp special ones: \D \s
1123 backrefs: \1 (deprecated in substitution replacements)
1124 case and quoting: \U \Q \E
1125 stops on @ and $, but not for $ as tail anchor
1127 In transliterations:
1128 characters are VERY literal, except for - not at the start or end
1129 of the string, which indicates a range. scan_const expands the
1130 range to the full set of intermediate characters.
1132 In double-quoted strings:
1134 double-quoted style: \r and \n
1136 backrefs: \1 (deprecated)
1137 case and quoting: \U \Q \E
1140 scan_const does *not* construct ops to handle interpolated strings.
1141 It stops processing as soon as it finds an embedded $ or @ variable
1142 and leaves it to the caller to work out what's going on.
1144 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1146 $ in pattern could be $foo or could be tail anchor. Assumption:
1147 it's a tail anchor if $ is the last thing in the string, or if it's
1148 followed by one of ")| \n\t"
1150 \1 (backreferences) are turned into $1
1152 The structure of the code is
1153 while (there's a character to process) {
1154 handle transliteration ranges
1155 skip regexp comments
1156 skip # initiated comments in //x patterns
1157 check for embedded @foo
1158 check for embedded scalars
1160 leave intact backslashes from leave (below)
1161 deprecate \1 in strings and sub replacements
1162 handle string-changing backslashes \l \U \Q \E, etc.
1163 switch (what was escaped) {
1164 handle - in a transliteration (becomes a literal -)
1165 handle \132 octal characters
1166 handle 0x15 hex characters
1167 handle \cV (control V)
1168 handle printf backslashes (\f, \r, \n, etc)
1170 } (end if backslash)
1171 } (end while character to read)
1176 S_scan_const(pTHX_ char *start)
1178 register char *send = PL_bufend; /* end of the constant */
1179 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1180 register char *s = start; /* start of the constant */
1181 register char *d = SvPVX(sv); /* destination for copies */
1182 bool dorange = FALSE; /* are we in a translit range? */
1183 bool didrange = FALSE; /* did we just finish a range? */
1184 bool has_utf8 = FALSE; /* embedded \x{} */
1187 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1188 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1190 I32 this_utf8 = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1191 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1192 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
1194 const char *leaveit = /* set of acceptably-backslashed characters */
1196 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1199 while (s < send || dorange) {
1200 /* get transliterations out of the way (they're most literal) */
1201 if (PL_lex_inwhat == OP_TRANS) {
1202 /* expand a range A-Z to the full set of characters. AIE! */
1204 I32 i; /* current expanded character */
1205 I32 min; /* first character in range */
1206 I32 max; /* last character in range */
1208 i = d - SvPVX(sv); /* remember current offset */
1209 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1210 d = SvPVX(sv) + i; /* refresh d after realloc */
1211 d -= 2; /* eat the first char and the - */
1213 min = (U8)*d; /* first char in range */
1214 max = (U8)d[1]; /* last char in range */
1218 "Invalid [] range \"%c-%c\" in transliteration operator",
1219 (char)min, (char)max);
1223 if ((isLOWER(min) && isLOWER(max)) ||
1224 (isUPPER(min) && isUPPER(max))) {
1226 for (i = min; i <= max; i++)
1230 for (i = min; i <= max; i++)
1237 for (i = min; i <= max; i++)
1240 /* mark the range as done, and continue */
1246 /* range begins (ignore - as first or last char) */
1247 else if (*s == '-' && s+1 < send && s != start) {
1249 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1252 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
1264 /* if we get here, we're not doing a transliteration */
1266 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1267 except for the last char, which will be done separately. */
1268 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1270 while (s < send && *s != ')')
1273 else if (s[2] == '{' /* This should match regcomp.c */
1274 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1277 char *regparse = s + (s[2] == '{' ? 3 : 4);
1280 while (count && (c = *regparse)) {
1281 if (c == '\\' && regparse[1])
1289 if (*regparse != ')') {
1290 regparse--; /* Leave one char for continuation. */
1291 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1293 while (s < regparse)
1298 /* likewise skip #-initiated comments in //x patterns */
1299 else if (*s == '#' && PL_lex_inpat &&
1300 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1301 while (s+1 < send && *s != '\n')
1305 /* check for embedded arrays
1306 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1308 else if (*s == '@' && s[1]
1309 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1312 /* check for embedded scalars. only stop if we're sure it's a
1315 else if (*s == '$') {
1316 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1318 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1319 break; /* in regexp, $ might be tail anchor */
1322 /* (now in tr/// code again) */
1324 if (*s & 0x80 && this_utf8) {
1328 uv = utf8_to_uv((U8*)s, send - s, &len, UTF8_CHECK_ONLY);
1329 if (len == (STRLEN)-1) {
1330 /* Illegal UTF8 (a high-bit byte), make it valid. */
1331 char *old_pvx = SvPVX(sv);
1332 /* need space for one extra char (NOTE: SvCUR() not set here) */
1333 d = SvGROW(sv, SvLEN(sv) + 1) + (d - old_pvx);
1334 d = (char*)uv_to_utf8((U8*)d, (U8)*s++);
1345 if (*s == '\\' && s+1 < send) {
1348 /* some backslashes we leave behind */
1349 if (*leaveit && *s && strchr(leaveit, *s)) {
1355 /* deprecate \1 in strings and substitution replacements */
1356 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1357 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1359 dTHR; /* only for ckWARN */
1360 if (ckWARN(WARN_SYNTAX))
1361 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1366 /* string-change backslash escapes */
1367 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1372 /* if we get here, it's either a quoted -, or a digit */
1375 /* quoted - in transliterations */
1377 if (PL_lex_inwhat == OP_TRANS) {
1385 if (ckWARN(WARN_MISC) && isALNUM(*s))
1386 Perl_warner(aTHX_ WARN_MISC,
1387 "Unrecognized escape \\%c passed through",
1389 /* default action is to copy the quoted character */
1394 /* \132 indicates an octal constant */
1395 case '0': case '1': case '2': case '3':
1396 case '4': case '5': case '6': case '7':
1398 STRLEN len = 0; /* disallow underscores */
1399 uv = (UV)scan_oct(s, 3, &len);
1402 goto NUM_ESCAPE_INSERT;
1404 /* \x24 indicates a hex constant */
1408 char* e = strchr(s, '}');
1410 yyerror("Missing right brace on \\x{}");
1414 STRLEN len = 1; /* allow underscores */
1415 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1422 STRLEN len = 0; /* disallow underscores */
1423 uv = (UV)scan_hex(s, 2, &len);
1429 /* Insert oct or hex escaped character.
1430 * There will always enough room in sv since such escapes will
1431 * be longer than any utf8 sequence they can end up as
1433 if (uv > 127 || has_utf8) {
1434 if (!this_utf8 && !has_utf8 && uv > 255) {
1435 /* might need to recode whatever we have accumulated so far
1436 * if it contains any hibit chars
1440 for (c = SvPVX(sv); c < d; c++) {
1445 char *old_pvx = SvPVX(sv);
1447 d = SvGROW(sv, SvCUR(sv) + hicount + 1) + (d - old_pvx);
1456 uv_to_utf8((U8*)dst, (U8)*src--);
1466 if (has_utf8 || uv > 255) {
1467 d = (char*)uv_to_utf8((U8*)d, uv);
1479 /* \N{latin small letter a} is a named character */
1483 char* e = strchr(s, '}');
1489 yyerror("Missing right brace on \\N{}");
1493 res = newSVpvn(s + 1, e - s - 1);
1494 res = new_constant( Nullch, 0, "charnames",
1495 res, Nullsv, "\\N{...}" );
1496 str = SvPV(res,len);
1497 if (!has_utf8 && SvUTF8(res)) {
1498 char *ostart = SvPVX(sv);
1499 SvCUR_set(sv, d - ostart);
1502 sv_utf8_upgrade(sv);
1503 /* this just broke our allocation above... */
1504 SvGROW(sv, send - start);
1505 d = SvPVX(sv) + SvCUR(sv);
1508 if (len > e - s + 4) {
1509 char *odest = SvPVX(sv);
1511 SvGROW(sv, (SvCUR(sv) + len - (e - s + 4)));
1512 d = SvPVX(sv) + (d - odest);
1514 Copy(str, d, len, char);
1521 yyerror("Missing braces on \\N{}");
1524 /* \c is a control character */
1541 /* printf-style backslashes, formfeeds, newlines, etc */
1559 *d++ = '\047'; /* CP 1047 */
1562 *d++ = '\057'; /* CP 1047 */
1576 } /* end if (backslash) */
1579 } /* while loop to process each character */
1581 /* terminate the string and set up the sv */
1583 SvCUR_set(sv, d - SvPVX(sv));
1588 /* shrink the sv if we allocated more than we used */
1589 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1590 SvLEN_set(sv, SvCUR(sv) + 1);
1591 Renew(SvPVX(sv), SvLEN(sv), char);
1594 /* return the substring (via yylval) only if we parsed anything */
1595 if (s > PL_bufptr) {
1596 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1597 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1599 ( PL_lex_inwhat == OP_TRANS
1601 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1604 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1611 * Returns TRUE if there's more to the expression (e.g., a subscript),
1614 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1616 * ->[ and ->{ return TRUE
1617 * { and [ outside a pattern are always subscripts, so return TRUE
1618 * if we're outside a pattern and it's not { or [, then return FALSE
1619 * if we're in a pattern and the first char is a {
1620 * {4,5} (any digits around the comma) returns FALSE
1621 * if we're in a pattern and the first char is a [
1623 * [SOMETHING] has a funky algorithm to decide whether it's a
1624 * character class or not. It has to deal with things like
1625 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1626 * anything else returns TRUE
1629 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1632 S_intuit_more(pTHX_ register char *s)
1634 if (PL_lex_brackets)
1636 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1638 if (*s != '{' && *s != '[')
1643 /* In a pattern, so maybe we have {n,m}. */
1660 /* On the other hand, maybe we have a character class */
1663 if (*s == ']' || *s == '^')
1666 /* this is terrifying, and it works */
1667 int weight = 2; /* let's weigh the evidence */
1669 unsigned char un_char = 255, last_un_char;
1670 char *send = strchr(s,']');
1671 char tmpbuf[sizeof PL_tokenbuf * 4];
1673 if (!send) /* has to be an expression */
1676 Zero(seen,256,char);
1679 else if (isDIGIT(*s)) {
1681 if (isDIGIT(s[1]) && s[2] == ']')
1687 for (; s < send; s++) {
1688 last_un_char = un_char;
1689 un_char = (unsigned char)*s;
1694 weight -= seen[un_char] * 10;
1695 if (isALNUM_lazy_if(s+1,UTF)) {
1696 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1697 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1702 else if (*s == '$' && s[1] &&
1703 strchr("[#!%*<>()-=",s[1])) {
1704 if (/*{*/ strchr("])} =",s[2]))
1713 if (strchr("wds]",s[1]))
1715 else if (seen['\''] || seen['"'])
1717 else if (strchr("rnftbxcav",s[1]))
1719 else if (isDIGIT(s[1])) {
1721 while (s[1] && isDIGIT(s[1]))
1731 if (strchr("aA01! ",last_un_char))
1733 if (strchr("zZ79~",s[1]))
1735 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1736 weight -= 5; /* cope with negative subscript */
1739 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1740 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1745 if (keyword(tmpbuf, d - tmpbuf))
1748 if (un_char == last_un_char + 1)
1750 weight -= seen[un_char];
1755 if (weight >= 0) /* probably a character class */
1765 * Does all the checking to disambiguate
1767 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1768 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1770 * First argument is the stuff after the first token, e.g. "bar".
1772 * Not a method if bar is a filehandle.
1773 * Not a method if foo is a subroutine prototyped to take a filehandle.
1774 * Not a method if it's really "Foo $bar"
1775 * Method if it's "foo $bar"
1776 * Not a method if it's really "print foo $bar"
1777 * Method if it's really "foo package::" (interpreted as package->foo)
1778 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1779 * Not a method if bar is a filehandle or package, but is quoted with
1784 S_intuit_method(pTHX_ char *start, GV *gv)
1786 char *s = start + (*start == '$');
1787 char tmpbuf[sizeof PL_tokenbuf];
1795 if ((cv = GvCVu(gv))) {
1796 char *proto = SvPVX(cv);
1806 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1807 /* start is the beginning of the possible filehandle/object,
1808 * and s is the end of it
1809 * tmpbuf is a copy of it
1812 if (*start == '$') {
1813 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1818 return *s == '(' ? FUNCMETH : METHOD;
1820 if (!keyword(tmpbuf, len)) {
1821 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1826 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1827 if (indirgv && GvCVu(indirgv))
1829 /* filehandle or package name makes it a method */
1830 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1832 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1833 return 0; /* no assumptions -- "=>" quotes bearword */
1835 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1836 newSVpvn(tmpbuf,len));
1837 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1841 return *s == '(' ? FUNCMETH : METHOD;
1849 * Return a string of Perl code to load the debugger. If PERL5DB
1850 * is set, it will return the contents of that, otherwise a
1851 * compile-time require of perl5db.pl.
1858 char *pdb = PerlEnv_getenv("PERL5DB");
1862 SETERRNO(0,SS$_NORMAL);
1863 return "BEGIN { require 'perl5db.pl' }";
1869 /* Encoded script support. filter_add() effectively inserts a
1870 * 'pre-processing' function into the current source input stream.
1871 * Note that the filter function only applies to the current source file
1872 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1874 * The datasv parameter (which may be NULL) can be used to pass
1875 * private data to this instance of the filter. The filter function
1876 * can recover the SV using the FILTER_DATA macro and use it to
1877 * store private buffers and state information.
1879 * The supplied datasv parameter is upgraded to a PVIO type
1880 * and the IoDIRP/IoANY field is used to store the function pointer,
1881 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1882 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1883 * private use must be set using malloc'd pointers.
1887 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1892 if (!PL_rsfp_filters)
1893 PL_rsfp_filters = newAV();
1895 datasv = NEWSV(255,0);
1896 if (!SvUPGRADE(datasv, SVt_PVIO))
1897 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1898 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1899 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1900 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1901 funcp, SvPV_nolen(datasv)));
1902 av_unshift(PL_rsfp_filters, 1);
1903 av_store(PL_rsfp_filters, 0, datasv) ;
1908 /* Delete most recently added instance of this filter function. */
1910 Perl_filter_del(pTHX_ filter_t funcp)
1913 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1914 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1916 /* if filter is on top of stack (usual case) just pop it off */
1917 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1918 if (IoANY(datasv) == (void *)funcp) {
1919 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1920 IoANY(datasv) = (void *)NULL;
1921 sv_free(av_pop(PL_rsfp_filters));
1925 /* we need to search for the correct entry and clear it */
1926 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1930 /* Invoke the n'th filter function for the current rsfp. */
1932 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1935 /* 0 = read one text line */
1940 if (!PL_rsfp_filters)
1942 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
1943 /* Provide a default input filter to make life easy. */
1944 /* Note that we append to the line. This is handy. */
1945 DEBUG_P(PerlIO_printf(Perl_debug_log,
1946 "filter_read %d: from rsfp\n", idx));
1950 int old_len = SvCUR(buf_sv) ;
1952 /* ensure buf_sv is large enough */
1953 SvGROW(buf_sv, old_len + maxlen) ;
1954 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
1955 if (PerlIO_error(PL_rsfp))
1956 return -1; /* error */
1958 return 0 ; /* end of file */
1960 SvCUR_set(buf_sv, old_len + len) ;
1963 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
1964 if (PerlIO_error(PL_rsfp))
1965 return -1; /* error */
1967 return 0 ; /* end of file */
1970 return SvCUR(buf_sv);
1972 /* Skip this filter slot if filter has been deleted */
1973 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
1974 DEBUG_P(PerlIO_printf(Perl_debug_log,
1975 "filter_read %d: skipped (filter deleted)\n",
1977 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
1979 /* Get function pointer hidden within datasv */
1980 funcp = (filter_t)IoANY(datasv);
1981 DEBUG_P(PerlIO_printf(Perl_debug_log,
1982 "filter_read %d: via function %p (%s)\n",
1983 idx, funcp, SvPV_nolen(datasv)));
1984 /* Call function. The function is expected to */
1985 /* call "FILTER_READ(idx+1, buf_sv)" first. */
1986 /* Return: <0:error, =0:eof, >0:not eof */
1987 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
1991 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
1993 #ifdef PERL_CR_FILTER
1994 if (!PL_rsfp_filters) {
1995 filter_add(S_cr_textfilter,NULL);
1998 if (PL_rsfp_filters) {
2001 SvCUR_set(sv, 0); /* start with empty line */
2002 if (FILTER_READ(0, sv, 0) > 0)
2003 return ( SvPVX(sv) ) ;
2008 return (sv_gets(sv, fp, append));
2012 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2016 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2020 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2021 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2023 return GvHV(gv); /* Foo:: */
2026 /* use constant CLASS => 'MyClass' */
2027 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2029 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2030 pkgname = SvPV_nolen(sv);
2034 return gv_stashpv(pkgname, FALSE);
2038 static char* exp_name[] =
2039 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2040 "ATTRTERM", "TERMBLOCK"
2047 Works out what to call the token just pulled out of the input
2048 stream. The yacc parser takes care of taking the ops we return and
2049 stitching them into a tree.
2055 if read an identifier
2056 if we're in a my declaration
2057 croak if they tried to say my($foo::bar)
2058 build the ops for a my() declaration
2059 if it's an access to a my() variable
2060 are we in a sort block?
2061 croak if my($a); $a <=> $b
2062 build ops for access to a my() variable
2063 if in a dq string, and they've said @foo and we can't find @foo
2065 build ops for a bareword
2066 if we already built the token before, use it.
2069 #ifdef USE_PURE_BISON
2071 #pragma segment Perl_yylex_r
2074 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2079 yylval_pointer[yyactlevel] = lvalp;
2080 yychar_pointer[yyactlevel] = lcharp;
2082 if (yyactlevel >= YYMAXLEVEL)
2083 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2085 r = Perl_yylex(aTHX);
2094 #pragma segment Perl_yylex
2098 #ifdef USE_PURE_BISON
2099 Perl_yylex(pTHX_ YYSTYPE *lvalp, int *lcharp)
2112 /* check if there's an identifier for us to look at */
2113 if (PL_pending_ident) {
2114 /* pit holds the identifier we read and pending_ident is reset */
2115 char pit = PL_pending_ident;
2116 PL_pending_ident = 0;
2118 /* if we're in a my(), we can't allow dynamics here.
2119 $foo'bar has already been turned into $foo::bar, so
2120 just check for colons.
2122 if it's a legal name, the OP is a PADANY.
2125 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2126 if (strchr(PL_tokenbuf,':'))
2127 yyerror(Perl_form(aTHX_ "No package name allowed for "
2128 "variable %s in \"our\"",
2130 tmp = pad_allocmy(PL_tokenbuf);
2133 if (strchr(PL_tokenbuf,':'))
2134 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2136 yylval.opval = newOP(OP_PADANY, 0);
2137 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2143 build the ops for accesses to a my() variable.
2145 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2146 then used in a comparison. This catches most, but not
2147 all cases. For instance, it catches
2148 sort { my($a); $a <=> $b }
2150 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2151 (although why you'd do that is anyone's guess).
2154 if (!strchr(PL_tokenbuf,':')) {
2156 /* Check for single character per-thread SVs */
2157 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2158 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2159 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2161 yylval.opval = newOP(OP_THREADSV, 0);
2162 yylval.opval->op_targ = tmp;
2165 #endif /* USE_THREADS */
2166 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2167 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2168 /* might be an "our" variable" */
2169 if (SvFLAGS(namesv) & SVpad_OUR) {
2170 /* build ops for a bareword */
2171 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2172 sv_catpvn(sym, "::", 2);
2173 sv_catpv(sym, PL_tokenbuf+1);
2174 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2175 yylval.opval->op_private = OPpCONST_ENTERED;
2176 gv_fetchpv(SvPVX(sym),
2178 ? (GV_ADDMULTI | GV_ADDINEVAL)
2181 ((PL_tokenbuf[0] == '$') ? SVt_PV
2182 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2187 /* if it's a sort block and they're naming $a or $b */
2188 if (PL_last_lop_op == OP_SORT &&
2189 PL_tokenbuf[0] == '$' &&
2190 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2193 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2194 d < PL_bufend && *d != '\n';
2197 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2198 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2204 yylval.opval = newOP(OP_PADANY, 0);
2205 yylval.opval->op_targ = tmp;
2211 Whine if they've said @foo in a doublequoted string,
2212 and @foo isn't a variable we can find in the symbol
2215 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2216 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2217 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2218 && ckWARN(WARN_AMBIGUOUS))
2220 /* Downgraded from fatal to warning 20000522 mjd */
2221 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2222 "Possible unintended interpolation of %s in string",
2227 /* build ops for a bareword */
2228 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2229 yylval.opval->op_private = OPpCONST_ENTERED;
2230 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2231 ((PL_tokenbuf[0] == '$') ? SVt_PV
2232 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2237 /* no identifier pending identification */
2239 switch (PL_lex_state) {
2241 case LEX_NORMAL: /* Some compilers will produce faster */
2242 case LEX_INTERPNORMAL: /* code if we comment these out. */
2246 /* when we've already built the next token, just pull it out of the queue */
2249 yylval = PL_nextval[PL_nexttoke];
2251 PL_lex_state = PL_lex_defer;
2252 PL_expect = PL_lex_expect;
2253 PL_lex_defer = LEX_NORMAL;
2255 return(PL_nexttype[PL_nexttoke]);
2257 /* interpolated case modifiers like \L \U, including \Q and \E.
2258 when we get here, PL_bufptr is at the \
2260 case LEX_INTERPCASEMOD:
2262 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2263 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2265 /* handle \E or end of string */
2266 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2270 if (PL_lex_casemods) {
2271 oldmod = PL_lex_casestack[--PL_lex_casemods];
2272 PL_lex_casestack[PL_lex_casemods] = '\0';
2274 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2276 PL_lex_state = LEX_INTERPCONCAT;
2280 if (PL_bufptr != PL_bufend)
2282 PL_lex_state = LEX_INTERPCONCAT;
2287 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2288 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2289 if (strchr("LU", *s) &&
2290 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2292 PL_lex_casestack[--PL_lex_casemods] = '\0';
2295 if (PL_lex_casemods > 10) {
2296 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2297 if (newlb != PL_lex_casestack) {
2299 PL_lex_casestack = newlb;
2302 PL_lex_casestack[PL_lex_casemods++] = *s;
2303 PL_lex_casestack[PL_lex_casemods] = '\0';
2304 PL_lex_state = LEX_INTERPCONCAT;
2305 PL_nextval[PL_nexttoke].ival = 0;
2308 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2310 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2312 PL_nextval[PL_nexttoke].ival = OP_LC;
2314 PL_nextval[PL_nexttoke].ival = OP_UC;
2316 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2318 Perl_croak(aTHX_ "panic: yylex");
2321 if (PL_lex_starts) {
2330 case LEX_INTERPPUSH:
2331 return sublex_push();
2333 case LEX_INTERPSTART:
2334 if (PL_bufptr == PL_bufend)
2335 return sublex_done();
2337 PL_lex_dojoin = (*PL_bufptr == '@');
2338 PL_lex_state = LEX_INTERPNORMAL;
2339 if (PL_lex_dojoin) {
2340 PL_nextval[PL_nexttoke].ival = 0;
2343 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2344 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2345 force_next(PRIVATEREF);
2347 force_ident("\"", '$');
2348 #endif /* USE_THREADS */
2349 PL_nextval[PL_nexttoke].ival = 0;
2351 PL_nextval[PL_nexttoke].ival = 0;
2353 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2356 if (PL_lex_starts++) {
2362 case LEX_INTERPENDMAYBE:
2363 if (intuit_more(PL_bufptr)) {
2364 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2370 if (PL_lex_dojoin) {
2371 PL_lex_dojoin = FALSE;
2372 PL_lex_state = LEX_INTERPCONCAT;
2375 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2376 && SvEVALED(PL_lex_repl))
2378 if (PL_bufptr != PL_bufend)
2379 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2380 PL_lex_repl = Nullsv;
2383 case LEX_INTERPCONCAT:
2385 if (PL_lex_brackets)
2386 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2388 if (PL_bufptr == PL_bufend)
2389 return sublex_done();
2391 if (SvIVX(PL_linestr) == '\'') {
2392 SV *sv = newSVsv(PL_linestr);
2395 else if ( PL_hints & HINT_NEW_RE )
2396 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2397 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2401 s = scan_const(PL_bufptr);
2403 PL_lex_state = LEX_INTERPCASEMOD;
2405 PL_lex_state = LEX_INTERPSTART;
2408 if (s != PL_bufptr) {
2409 PL_nextval[PL_nexttoke] = yylval;
2412 if (PL_lex_starts++)
2422 PL_lex_state = LEX_NORMAL;
2423 s = scan_formline(PL_bufptr);
2424 if (!PL_lex_formbrack)
2430 PL_oldoldbufptr = PL_oldbufptr;
2433 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2434 exp_name[PL_expect], s);
2440 if (isIDFIRST_lazy_if(s,UTF))
2442 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2445 goto fake_eof; /* emulate EOF on ^D or ^Z */
2450 if (PL_lex_brackets)
2451 yyerror("Missing right curly or square bracket");
2454 if (s++ < PL_bufend)
2455 goto retry; /* ignore stray nulls */
2458 if (!PL_in_eval && !PL_preambled) {
2459 PL_preambled = TRUE;
2460 sv_setpv(PL_linestr,incl_perldb());
2461 if (SvCUR(PL_linestr))
2462 sv_catpv(PL_linestr,";");
2464 while(AvFILLp(PL_preambleav) >= 0) {
2465 SV *tmpsv = av_shift(PL_preambleav);
2466 sv_catsv(PL_linestr, tmpsv);
2467 sv_catpv(PL_linestr, ";");
2470 sv_free((SV*)PL_preambleav);
2471 PL_preambleav = NULL;
2473 if (PL_minus_n || PL_minus_p) {
2474 sv_catpv(PL_linestr, "LINE: while (<>) {");
2476 sv_catpv(PL_linestr,"chomp;");
2478 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2480 GvIMPORTED_AV_on(gv);
2482 if (strchr("/'\"", *PL_splitstr)
2483 && strchr(PL_splitstr + 1, *PL_splitstr))
2484 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2487 s = "'~#\200\1'"; /* surely one char is unused...*/
2488 while (s[1] && strchr(PL_splitstr, *s)) s++;
2490 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2491 "q" + (delim == '\''), delim);
2492 for (s = PL_splitstr; *s; s++) {
2494 sv_catpvn(PL_linestr, "\\", 1);
2495 sv_catpvn(PL_linestr, s, 1);
2497 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2501 sv_catpv(PL_linestr,"@F=split(' ');");
2504 sv_catpv(PL_linestr, "\n");
2505 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2506 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2507 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2508 SV *sv = NEWSV(85,0);
2510 sv_upgrade(sv, SVt_PVMG);
2511 sv_setsv(sv,PL_linestr);
2512 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2517 bool bof = PL_rsfp ? TRUE : FALSE;
2519 #ifdef PERLIO_IS_STDIO
2520 # ifdef __GNU_LIBRARY__
2521 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2522 # define FTELL_FOR_PIPE_IS_BROKEN
2526 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2527 # define FTELL_FOR_PIPE_IS_BROKEN
2532 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2533 /* This loses the possibility to detect the bof
2534 * situation on perl -P when the libc5 is being used.
2535 * Workaround? Maybe attach some extra state to PL_rsfp?
2538 bof = PerlIO_tell(PL_rsfp) == 0;
2540 bof = PerlIO_tell(PL_rsfp) == 0;
2543 s = filter_gets(PL_linestr, PL_rsfp, 0);
2547 if (PL_preprocess && !PL_in_eval)
2548 (void)PerlProc_pclose(PL_rsfp);
2549 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2550 PerlIO_clearerr(PL_rsfp);
2552 (void)PerlIO_close(PL_rsfp);
2554 PL_doextract = FALSE;
2556 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2557 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2558 sv_catpv(PL_linestr,";}");
2559 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2560 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2561 PL_minus_n = PL_minus_p = 0;
2564 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2565 sv_setpv(PL_linestr,"");
2566 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2568 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2569 s = swallow_bom((U8*)s);
2572 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2573 PL_doextract = FALSE;
2575 /* Incest with pod. */
2576 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2577 sv_setpv(PL_linestr, "");
2578 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2579 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2580 PL_doextract = FALSE;
2584 } while (PL_doextract);
2585 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2586 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2587 SV *sv = NEWSV(85,0);
2589 sv_upgrade(sv, SVt_PVMG);
2590 sv_setsv(sv,PL_linestr);
2591 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2593 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2594 if (CopLINE(PL_curcop) == 1) {
2595 while (s < PL_bufend && isSPACE(*s))
2597 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2601 if (*s == '#' && *(s+1) == '!')
2603 #ifdef ALTERNATE_SHEBANG
2605 static char as[] = ALTERNATE_SHEBANG;
2606 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2607 d = s + (sizeof(as) - 1);
2609 #endif /* ALTERNATE_SHEBANG */
2618 while (*d && !isSPACE(*d))
2622 #ifdef ARG_ZERO_IS_SCRIPT
2623 if (ipathend > ipath) {
2625 * HP-UX (at least) sets argv[0] to the script name,
2626 * which makes $^X incorrect. And Digital UNIX and Linux,
2627 * at least, set argv[0] to the basename of the Perl
2628 * interpreter. So, having found "#!", we'll set it right.
2630 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2631 assert(SvPOK(x) || SvGMAGICAL(x));
2632 if (sv_eq(x, CopFILESV(PL_curcop))) {
2633 sv_setpvn(x, ipath, ipathend - ipath);
2636 TAINT_NOT; /* $^X is always tainted, but that's OK */
2638 #endif /* ARG_ZERO_IS_SCRIPT */
2643 d = instr(s,"perl -");
2645 d = instr(s,"perl");
2647 /* avoid getting into infinite loops when shebang
2648 * line contains "Perl" rather than "perl" */
2650 for (d = ipathend-4; d >= ipath; --d) {
2651 if ((*d == 'p' || *d == 'P')
2652 && !ibcmp(d, "perl", 4))
2662 #ifdef ALTERNATE_SHEBANG
2664 * If the ALTERNATE_SHEBANG on this system starts with a
2665 * character that can be part of a Perl expression, then if
2666 * we see it but not "perl", we're probably looking at the
2667 * start of Perl code, not a request to hand off to some
2668 * other interpreter. Similarly, if "perl" is there, but
2669 * not in the first 'word' of the line, we assume the line
2670 * contains the start of the Perl program.
2672 if (d && *s != '#') {
2674 while (*c && !strchr("; \t\r\n\f\v#", *c))
2677 d = Nullch; /* "perl" not in first word; ignore */
2679 *s = '#'; /* Don't try to parse shebang line */
2681 #endif /* ALTERNATE_SHEBANG */
2682 #ifndef MACOS_TRADITIONAL
2687 !instr(s,"indir") &&
2688 instr(PL_origargv[0],"perl"))
2694 while (s < PL_bufend && isSPACE(*s))
2696 if (s < PL_bufend) {
2697 Newz(899,newargv,PL_origargc+3,char*);
2699 while (s < PL_bufend && !isSPACE(*s))
2702 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2705 newargv = PL_origargv;
2707 PerlProc_execv(ipath, newargv);
2708 Perl_croak(aTHX_ "Can't exec %s", ipath);
2712 U32 oldpdb = PL_perldb;
2713 bool oldn = PL_minus_n;
2714 bool oldp = PL_minus_p;
2716 while (*d && !isSPACE(*d)) d++;
2717 while (SPACE_OR_TAB(*d)) d++;
2721 if (*d == 'M' || *d == 'm') {
2723 while (*d && !isSPACE(*d)) d++;
2724 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2727 d = moreswitches(d);
2729 if ((PERLDB_LINE && !oldpdb) ||
2730 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2731 /* if we have already added "LINE: while (<>) {",
2732 we must not do it again */
2734 sv_setpv(PL_linestr, "");
2735 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2736 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2737 PL_preambled = FALSE;
2739 (void)gv_fetchfile(PL_origfilename);
2746 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2748 PL_lex_state = LEX_FORMLINE;
2753 #ifdef PERL_STRICT_CR
2754 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2756 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2758 case ' ': case '\t': case '\f': case 013:
2759 #ifdef MACOS_TRADITIONAL
2766 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2767 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2768 /* handle eval qq[#line 1 "foo"\n ...] */
2769 CopLINE_dec(PL_curcop);
2773 while (s < d && *s != '\n')
2778 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2780 PL_lex_state = LEX_FORMLINE;
2790 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2795 while (s < PL_bufend && SPACE_OR_TAB(*s))
2798 if (strnEQ(s,"=>",2)) {
2799 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2800 OPERATOR('-'); /* unary minus */
2802 PL_last_uni = PL_oldbufptr;
2803 PL_last_lop_op = OP_FTEREAD; /* good enough */
2805 case 'r': FTST(OP_FTEREAD);
2806 case 'w': FTST(OP_FTEWRITE);
2807 case 'x': FTST(OP_FTEEXEC);
2808 case 'o': FTST(OP_FTEOWNED);
2809 case 'R': FTST(OP_FTRREAD);
2810 case 'W': FTST(OP_FTRWRITE);
2811 case 'X': FTST(OP_FTREXEC);
2812 case 'O': FTST(OP_FTROWNED);
2813 case 'e': FTST(OP_FTIS);
2814 case 'z': FTST(OP_FTZERO);
2815 case 's': FTST(OP_FTSIZE);
2816 case 'f': FTST(OP_FTFILE);
2817 case 'd': FTST(OP_FTDIR);
2818 case 'l': FTST(OP_FTLINK);
2819 case 'p': FTST(OP_FTPIPE);
2820 case 'S': FTST(OP_FTSOCK);
2821 case 'u': FTST(OP_FTSUID);
2822 case 'g': FTST(OP_FTSGID);
2823 case 'k': FTST(OP_FTSVTX);
2824 case 'b': FTST(OP_FTBLK);
2825 case 'c': FTST(OP_FTCHR);
2826 case 't': FTST(OP_FTTTY);
2827 case 'T': FTST(OP_FTTEXT);
2828 case 'B': FTST(OP_FTBINARY);
2829 case 'M': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTMTIME);
2830 case 'A': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTATIME);
2831 case 'C': gv_fetchpv("\024",TRUE, SVt_PV); FTST(OP_FTCTIME);
2833 Perl_croak(aTHX_ "Unrecognized file test: -%c", (int)tmp);
2840 if (PL_expect == XOPERATOR)
2845 else if (*s == '>') {
2848 if (isIDFIRST_lazy_if(s,UTF)) {
2849 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2857 if (PL_expect == XOPERATOR)
2860 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2862 OPERATOR('-'); /* unary minus */
2869 if (PL_expect == XOPERATOR)
2874 if (PL_expect == XOPERATOR)
2877 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2883 if (PL_expect != XOPERATOR) {
2884 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2885 PL_expect = XOPERATOR;
2886 force_ident(PL_tokenbuf, '*');
2899 if (PL_expect == XOPERATOR) {
2903 PL_tokenbuf[0] = '%';
2904 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2905 if (!PL_tokenbuf[1]) {
2907 yyerror("Final % should be \\% or %name");
2910 PL_pending_ident = '%';
2929 switch (PL_expect) {
2932 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2934 PL_bufptr = s; /* update in case we back off */
2940 PL_expect = XTERMBLOCK;
2944 while (isIDFIRST_lazy_if(s,UTF)) {
2945 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2946 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2947 if (tmp < 0) tmp = -tmp;
2962 d = scan_str(d,TRUE,TRUE);
2965 SvREFCNT_dec(PL_lex_stuff);
2966 PL_lex_stuff = Nullsv;
2968 /* MUST advance bufptr here to avoid bogus
2969 "at end of line" context messages from yyerror().
2971 PL_bufptr = s + len;
2972 yyerror("Unterminated attribute parameter in attribute list");
2975 return 0; /* EOF indicator */
2979 SV *sv = newSVpvn(s, len);
2980 sv_catsv(sv, PL_lex_stuff);
2981 attrs = append_elem(OP_LIST, attrs,
2982 newSVOP(OP_CONST, 0, sv));
2983 SvREFCNT_dec(PL_lex_stuff);
2984 PL_lex_stuff = Nullsv;
2987 attrs = append_elem(OP_LIST, attrs,
2988 newSVOP(OP_CONST, 0,
2992 if (*s == ':' && s[1] != ':')
2995 break; /* require real whitespace or :'s */
2997 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
2998 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
2999 char q = ((*s == '\'') ? '"' : '\'');
3000 /* If here for an expression, and parsed no attrs, back off. */
3001 if (tmp == '=' && !attrs) {
3005 /* MUST advance bufptr here to avoid bogus "at end of line"
3006 context messages from yyerror().
3010 yyerror("Unterminated attribute list");
3012 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3020 PL_nextval[PL_nexttoke].opval = attrs;
3028 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3029 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3045 if (PL_lex_brackets <= 0)
3046 yyerror("Unmatched right square bracket");
3049 if (PL_lex_state == LEX_INTERPNORMAL) {
3050 if (PL_lex_brackets == 0) {
3051 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3052 PL_lex_state = LEX_INTERPEND;
3059 if (PL_lex_brackets > 100) {
3060 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3061 if (newlb != PL_lex_brackstack) {
3063 PL_lex_brackstack = newlb;
3066 switch (PL_expect) {
3068 if (PL_lex_formbrack) {
3072 if (PL_oldoldbufptr == PL_last_lop)
3073 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3075 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3076 OPERATOR(HASHBRACK);
3078 while (s < PL_bufend && SPACE_OR_TAB(*s))
3081 PL_tokenbuf[0] = '\0';
3082 if (d < PL_bufend && *d == '-') {
3083 PL_tokenbuf[0] = '-';
3085 while (d < PL_bufend && SPACE_OR_TAB(*d))
3088 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3089 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3091 while (d < PL_bufend && SPACE_OR_TAB(*d))
3094 char minus = (PL_tokenbuf[0] == '-');
3095 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3103 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3108 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3113 if (PL_oldoldbufptr == PL_last_lop)
3114 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3116 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3119 OPERATOR(HASHBRACK);
3120 /* This hack serves to disambiguate a pair of curlies
3121 * as being a block or an anon hash. Normally, expectation
3122 * determines that, but in cases where we're not in a
3123 * position to expect anything in particular (like inside
3124 * eval"") we have to resolve the ambiguity. This code
3125 * covers the case where the first term in the curlies is a
3126 * quoted string. Most other cases need to be explicitly
3127 * disambiguated by prepending a `+' before the opening
3128 * curly in order to force resolution as an anon hash.
3130 * XXX should probably propagate the outer expectation
3131 * into eval"" to rely less on this hack, but that could
3132 * potentially break current behavior of eval"".
3136 if (*s == '\'' || *s == '"' || *s == '`') {
3137 /* common case: get past first string, handling escapes */
3138 for (t++; t < PL_bufend && *t != *s;)
3139 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3143 else if (*s == 'q') {
3146 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3150 char open, close, term;
3153 while (t < PL_bufend && isSPACE(*t))
3157 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3161 for (t++; t < PL_bufend; t++) {
3162 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3164 else if (*t == open)
3168 for (t++; t < PL_bufend; t++) {
3169 if (*t == '\\' && t+1 < PL_bufend)
3171 else if (*t == close && --brackets <= 0)
3173 else if (*t == open)
3179 else if (isALNUM_lazy_if(t,UTF)) {
3181 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3184 while (t < PL_bufend && isSPACE(*t))
3186 /* if comma follows first term, call it an anon hash */
3187 /* XXX it could be a comma expression with loop modifiers */
3188 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3189 || (*t == '=' && t[1] == '>')))
3190 OPERATOR(HASHBRACK);
3191 if (PL_expect == XREF)
3194 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3200 yylval.ival = CopLINE(PL_curcop);
3201 if (isSPACE(*s) || *s == '#')
3202 PL_copline = NOLINE; /* invalidate current command line number */
3207 if (PL_lex_brackets <= 0)
3208 yyerror("Unmatched right curly bracket");
3210 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3211 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3212 PL_lex_formbrack = 0;
3213 if (PL_lex_state == LEX_INTERPNORMAL) {
3214 if (PL_lex_brackets == 0) {
3215 if (PL_expect & XFAKEBRACK) {
3216 PL_expect &= XENUMMASK;
3217 PL_lex_state = LEX_INTERPEND;
3219 return yylex(); /* ignore fake brackets */
3221 if (*s == '-' && s[1] == '>')
3222 PL_lex_state = LEX_INTERPENDMAYBE;
3223 else if (*s != '[' && *s != '{')
3224 PL_lex_state = LEX_INTERPEND;
3227 if (PL_expect & XFAKEBRACK) {
3228 PL_expect &= XENUMMASK;
3230 return yylex(); /* ignore fake brackets */
3240 if (PL_expect == XOPERATOR) {
3241 if (ckWARN(WARN_SEMICOLON)
3242 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3244 CopLINE_dec(PL_curcop);
3245 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3246 CopLINE_inc(PL_curcop);
3251 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3253 PL_expect = XOPERATOR;
3254 force_ident(PL_tokenbuf, '&');
3258 yylval.ival = (OPpENTERSUB_AMPER<<8);
3277 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3278 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3280 if (PL_expect == XSTATE && isALPHA(tmp) &&
3281 (s == PL_linestart+1 || s[-2] == '\n') )
3283 if (PL_in_eval && !PL_rsfp) {
3288 if (strnEQ(s,"=cut",4)) {
3302 PL_doextract = TRUE;
3305 if (PL_lex_brackets < PL_lex_formbrack) {
3307 #ifdef PERL_STRICT_CR
3308 for (t = s; SPACE_OR_TAB(*t); t++) ;
3310 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3312 if (*t == '\n' || *t == '#') {
3330 if (PL_expect != XOPERATOR) {
3331 if (s[1] != '<' && !strchr(s,'>'))
3334 s = scan_heredoc(s);
3336 s = scan_inputsymbol(s);
3337 TERM(sublex_start());
3342 SHop(OP_LEFT_SHIFT);
3356 SHop(OP_RIGHT_SHIFT);
3365 if (PL_expect == XOPERATOR) {
3366 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3369 return ','; /* grandfather non-comma-format format */
3373 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3374 PL_tokenbuf[0] = '@';
3375 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3376 sizeof PL_tokenbuf - 1, FALSE);
3377 if (PL_expect == XOPERATOR)
3378 no_op("Array length", s);
3379 if (!PL_tokenbuf[1])
3381 PL_expect = XOPERATOR;
3382 PL_pending_ident = '#';
3386 PL_tokenbuf[0] = '$';
3387 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3388 sizeof PL_tokenbuf - 1, FALSE);
3389 if (PL_expect == XOPERATOR)
3391 if (!PL_tokenbuf[1]) {
3393 yyerror("Final $ should be \\$ or $name");
3397 /* This kludge not intended to be bulletproof. */
3398 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3399 yylval.opval = newSVOP(OP_CONST, 0,
3400 newSViv(PL_compiling.cop_arybase));
3401 yylval.opval->op_private = OPpCONST_ARYBASE;
3407 if (PL_lex_state == LEX_NORMAL)
3410 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3413 PL_tokenbuf[0] = '@';
3414 if (ckWARN(WARN_SYNTAX)) {
3416 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3419 PL_bufptr = skipspace(PL_bufptr);
3420 while (t < PL_bufend && *t != ']')
3422 Perl_warner(aTHX_ WARN_SYNTAX,
3423 "Multidimensional syntax %.*s not supported",
3424 (t - PL_bufptr) + 1, PL_bufptr);
3428 else if (*s == '{') {
3429 PL_tokenbuf[0] = '%';
3430 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3431 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3433 char tmpbuf[sizeof PL_tokenbuf];
3435 for (t++; isSPACE(*t); t++) ;
3436 if (isIDFIRST_lazy_if(t,UTF)) {
3437 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3438 for (; isSPACE(*t); t++) ;
3439 if (*t == ';' && get_cv(tmpbuf, FALSE))
3440 Perl_warner(aTHX_ WARN_SYNTAX,
3441 "You need to quote \"%s\"", tmpbuf);
3447 PL_expect = XOPERATOR;
3448 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3449 bool islop = (PL_last_lop == PL_oldoldbufptr);
3450 if (!islop || PL_last_lop_op == OP_GREPSTART)
3451 PL_expect = XOPERATOR;
3452 else if (strchr("$@\"'`q", *s))
3453 PL_expect = XTERM; /* e.g. print $fh "foo" */
3454 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3455 PL_expect = XTERM; /* e.g. print $fh &sub */
3456 else if (isIDFIRST_lazy_if(s,UTF)) {
3457 char tmpbuf[sizeof PL_tokenbuf];
3458 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3459 if ((tmp = keyword(tmpbuf, len))) {
3460 /* binary operators exclude handle interpretations */
3472 PL_expect = XTERM; /* e.g. print $fh length() */
3477 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3478 if (gv && GvCVu(gv))
3479 PL_expect = XTERM; /* e.g. print $fh subr() */
3482 else if (isDIGIT(*s))
3483 PL_expect = XTERM; /* e.g. print $fh 3 */
3484 else if (*s == '.' && isDIGIT(s[1]))
3485 PL_expect = XTERM; /* e.g. print $fh .3 */
3486 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3487 PL_expect = XTERM; /* e.g. print $fh -1 */
3488 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3489 PL_expect = XTERM; /* print $fh <<"EOF" */
3491 PL_pending_ident = '$';
3495 if (PL_expect == XOPERATOR)
3497 PL_tokenbuf[0] = '@';
3498 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3499 if (!PL_tokenbuf[1]) {
3501 yyerror("Final @ should be \\@ or @name");
3504 if (PL_lex_state == LEX_NORMAL)
3506 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3508 PL_tokenbuf[0] = '%';
3510 /* Warn about @ where they meant $. */
3511 if (ckWARN(WARN_SYNTAX)) {
3512 if (*s == '[' || *s == '{') {
3514 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3516 if (*t == '}' || *t == ']') {
3518 PL_bufptr = skipspace(PL_bufptr);
3519 Perl_warner(aTHX_ WARN_SYNTAX,
3520 "Scalar value %.*s better written as $%.*s",
3521 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3526 PL_pending_ident = '@';
3529 case '/': /* may either be division or pattern */
3530 case '?': /* may either be conditional or pattern */
3531 if (PL_expect != XOPERATOR) {
3532 /* Disable warning on "study /blah/" */
3533 if (PL_oldoldbufptr == PL_last_uni
3534 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3535 || memNE(PL_last_uni, "study", 5)
3536 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3538 s = scan_pat(s,OP_MATCH);
3539 TERM(sublex_start());
3547 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3548 #ifdef PERL_STRICT_CR
3551 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3553 && (s == PL_linestart || s[-1] == '\n') )
3555 PL_lex_formbrack = 0;
3559 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3565 yylval.ival = OPf_SPECIAL;
3571 if (PL_expect != XOPERATOR)
3576 case '0': case '1': case '2': case '3': case '4':
3577 case '5': case '6': case '7': case '8': case '9':
3578 s = scan_num(s, &yylval);
3579 if (PL_expect == XOPERATOR)
3584 s = scan_str(s,FALSE,FALSE);
3585 if (PL_expect == XOPERATOR) {
3586 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3589 return ','; /* grandfather non-comma-format format */
3595 missingterm((char*)0);
3596 yylval.ival = OP_CONST;
3597 TERM(sublex_start());
3600 s = scan_str(s,FALSE,FALSE);
3601 if (PL_expect == XOPERATOR) {
3602 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3605 return ','; /* grandfather non-comma-format format */
3611 missingterm((char*)0);
3612 yylval.ival = OP_CONST;
3613 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3614 if (*d == '$' || *d == '@' || *d == '\\' || *d & 0x80) {
3615 yylval.ival = OP_STRINGIFY;
3619 TERM(sublex_start());
3622 s = scan_str(s,FALSE,FALSE);
3623 if (PL_expect == XOPERATOR)
3624 no_op("Backticks",s);
3626 missingterm((char*)0);
3627 yylval.ival = OP_BACKTICK;
3629 TERM(sublex_start());
3633 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3634 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3636 if (PL_expect == XOPERATOR)
3637 no_op("Backslash",s);
3641 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3645 while (isDIGIT(*start) || *start == '_')
3647 if (*start == '.' && isDIGIT(start[1])) {
3648 s = scan_num(s, &yylval);
3651 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3652 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF)) {
3656 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3659 s = scan_num(s, &yylval);
3666 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3705 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3707 /* Some keywords can be followed by any delimiter, including ':' */
3708 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3709 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3710 (PL_tokenbuf[0] == 'q' &&
3711 strchr("qwxr", PL_tokenbuf[1])))));
3713 /* x::* is just a word, unless x is "CORE" */
3714 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3718 while (d < PL_bufend && isSPACE(*d))
3719 d++; /* no comments skipped here, or s### is misparsed */
3721 /* Is this a label? */
3722 if (!tmp && PL_expect == XSTATE
3723 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3725 yylval.pval = savepv(PL_tokenbuf);
3730 /* Check for keywords */
3731 tmp = keyword(PL_tokenbuf, len);
3733 /* Is this a word before a => operator? */
3734 if (*d == '=' && d[1] == '>') {
3736 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3737 yylval.opval->op_private = OPpCONST_BARE;
3741 if (tmp < 0) { /* second-class keyword? */
3742 GV *ogv = Nullgv; /* override (winner) */
3743 GV *hgv = Nullgv; /* hidden (loser) */
3744 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3746 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3749 if (GvIMPORTED_CV(gv))
3751 else if (! CvMETHOD(cv))
3755 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3756 (gv = *gvp) != (GV*)&PL_sv_undef &&
3757 GvCVu(gv) && GvIMPORTED_CV(gv))
3763 tmp = 0; /* overridden by import or by GLOBAL */
3766 && -tmp==KEY_lock /* XXX generalizable kludge */
3768 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3770 tmp = 0; /* any sub overrides "weak" keyword */
3772 else { /* no override */
3776 if (ckWARN(WARN_AMBIGUOUS) && hgv
3777 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3778 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3779 "Ambiguous call resolved as CORE::%s(), %s",
3780 GvENAME(hgv), "qualify as such or use &");
3787 default: /* not a keyword */
3790 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3792 /* Get the rest if it looks like a package qualifier */
3794 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3796 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3799 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3800 *s == '\'' ? "'" : "::");
3804 if (PL_expect == XOPERATOR) {
3805 if (PL_bufptr == PL_linestart) {
3806 CopLINE_dec(PL_curcop);
3807 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3808 CopLINE_inc(PL_curcop);
3811 no_op("Bareword",s);
3814 /* Look for a subroutine with this name in current package,
3815 unless name is "Foo::", in which case Foo is a bearword
3816 (and a package name). */
3819 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3821 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3822 Perl_warner(aTHX_ WARN_BAREWORD,
3823 "Bareword \"%s\" refers to nonexistent package",
3826 PL_tokenbuf[len] = '\0';
3833 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3836 /* if we saw a global override before, get the right name */
3839 sv = newSVpvn("CORE::GLOBAL::",14);
3840 sv_catpv(sv,PL_tokenbuf);
3843 sv = newSVpv(PL_tokenbuf,0);
3845 /* Presume this is going to be a bareword of some sort. */
3848 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3849 yylval.opval->op_private = OPpCONST_BARE;
3851 /* And if "Foo::", then that's what it certainly is. */
3856 /* See if it's the indirect object for a list operator. */
3858 if (PL_oldoldbufptr &&
3859 PL_oldoldbufptr < PL_bufptr &&
3860 (PL_oldoldbufptr == PL_last_lop
3861 || PL_oldoldbufptr == PL_last_uni) &&
3862 /* NO SKIPSPACE BEFORE HERE! */
3863 (PL_expect == XREF ||
3864 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3866 bool immediate_paren = *s == '(';
3868 /* (Now we can afford to cross potential line boundary.) */
3871 /* Two barewords in a row may indicate method call. */
3873 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3876 /* If not a declared subroutine, it's an indirect object. */
3877 /* (But it's an indir obj regardless for sort.) */
3879 if ((PL_last_lop_op == OP_SORT ||
3880 (!immediate_paren && (!gv || !GvCVu(gv)))) &&
3881 (PL_last_lop_op != OP_MAPSTART &&
3882 PL_last_lop_op != OP_GREPSTART))
3884 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3890 PL_expect = XOPERATOR;
3893 /* Is this a word before a => operator? */
3894 if (*s == '=' && s[1] == '>') {
3896 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
3900 /* If followed by a paren, it's certainly a subroutine. */
3903 if (gv && GvCVu(gv)) {
3904 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
3905 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
3910 PL_nextval[PL_nexttoke].opval = yylval.opval;
3911 PL_expect = XOPERATOR;
3917 /* If followed by var or block, call it a method (unless sub) */
3919 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
3920 PL_last_lop = PL_oldbufptr;
3921 PL_last_lop_op = OP_METHOD;
3925 /* If followed by a bareword, see if it looks like indir obj. */
3927 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
3930 /* Not a method, so call it a subroutine (if defined) */
3932 if (gv && GvCVu(gv)) {
3934 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
3935 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3936 "Ambiguous use of -%s resolved as -&%s()",
3937 PL_tokenbuf, PL_tokenbuf);
3938 /* Check for a constant sub */
3940 if ((sv = cv_const_sv(cv))) {
3942 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
3943 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
3944 yylval.opval->op_private = 0;
3948 /* Resolve to GV now. */
3949 op_free(yylval.opval);
3950 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
3951 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
3952 PL_last_lop = PL_oldbufptr;
3953 PL_last_lop_op = OP_ENTERSUB;
3954 /* Is there a prototype? */
3957 char *proto = SvPV((SV*)cv, len);
3960 if (strEQ(proto, "$"))
3962 if (*proto == '&' && *s == '{') {
3963 sv_setpv(PL_subname,"__ANON__");
3967 PL_nextval[PL_nexttoke].opval = yylval.opval;
3973 /* Call it a bare word */
3975 if (PL_hints & HINT_STRICT_SUBS)
3976 yylval.opval->op_private |= OPpCONST_STRICT;
3979 if (ckWARN(WARN_RESERVED)) {
3980 if (lastchar != '-') {
3981 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
3983 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
3990 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
3991 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3992 "Operator or semicolon missing before %c%s",
3993 lastchar, PL_tokenbuf);
3994 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3995 "Ambiguous use of %c resolved as operator %c",
3996 lastchar, lastchar);
4002 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4003 newSVpv(CopFILE(PL_curcop),0));
4007 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4008 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4011 case KEY___PACKAGE__:
4012 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4014 ? newSVsv(PL_curstname)
4023 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4024 char *pname = "main";
4025 if (PL_tokenbuf[2] == 'D')
4026 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4027 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4030 GvIOp(gv) = newIO();
4031 IoIFP(GvIOp(gv)) = PL_rsfp;
4032 #if defined(HAS_FCNTL) && defined(F_SETFD)
4034 int fd = PerlIO_fileno(PL_rsfp);
4035 fcntl(fd,F_SETFD,fd >= 3);
4038 /* Mark this internal pseudo-handle as clean */
4039 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4041 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4042 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4043 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4045 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4046 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4047 /* if the script was opened in binmode, we need to revert
4048 * it to text mode for compatibility; but only iff it has CRs
4049 * XXX this is a questionable hack at best. */
4050 if (PL_bufend-PL_bufptr > 2
4051 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4054 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4055 loc = PerlIO_tell(PL_rsfp);
4056 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4058 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4059 #if defined(__BORLANDC__)
4060 /* XXX see note in do_binmode() */
4061 ((FILE*)PL_rsfp)->flags |= _F_BIN;
4064 PerlIO_seek(PL_rsfp, loc, 0);
4079 if (PL_expect == XSTATE) {
4086 if (*s == ':' && s[1] == ':') {
4089 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4090 if (!(tmp = keyword(PL_tokenbuf, len)))
4091 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4105 LOP(OP_ACCEPT,XTERM);
4111 LOP(OP_ATAN2,XTERM);
4117 LOP(OP_BINMODE,XTERM);
4120 LOP(OP_BLESS,XTERM);
4129 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4146 if (!PL_cryptseen) {
4147 PL_cryptseen = TRUE;
4151 LOP(OP_CRYPT,XTERM);
4154 if (ckWARN(WARN_CHMOD)) {
4155 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4156 if (*d != '0' && isDIGIT(*d))
4157 Perl_warner(aTHX_ WARN_CHMOD,
4158 "chmod() mode argument is missing initial 0");
4160 LOP(OP_CHMOD,XTERM);
4163 LOP(OP_CHOWN,XTERM);
4166 LOP(OP_CONNECT,XTERM);
4182 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4186 PL_hints |= HINT_BLOCK_SCOPE;
4196 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4197 LOP(OP_DBMOPEN,XTERM);
4203 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4210 yylval.ival = CopLINE(PL_curcop);
4224 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4225 UNIBRACK(OP_ENTEREVAL);
4240 case KEY_endhostent:
4246 case KEY_endservent:
4249 case KEY_endprotoent:
4260 yylval.ival = CopLINE(PL_curcop);
4262 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4264 if ((PL_bufend - p) >= 3 &&
4265 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4267 else if ((PL_bufend - p) >= 4 &&
4268 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4271 if (isIDFIRST_lazy_if(p,UTF)) {
4272 p = scan_ident(p, PL_bufend,
4273 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4277 Perl_croak(aTHX_ "Missing $ on loop variable");
4282 LOP(OP_FORMLINE,XTERM);
4288 LOP(OP_FCNTL,XTERM);
4294 LOP(OP_FLOCK,XTERM);
4303 LOP(OP_GREPSTART, XREF);
4306 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4321 case KEY_getpriority:
4322 LOP(OP_GETPRIORITY,XTERM);
4324 case KEY_getprotobyname:
4327 case KEY_getprotobynumber:
4328 LOP(OP_GPBYNUMBER,XTERM);
4330 case KEY_getprotoent:
4342 case KEY_getpeername:
4343 UNI(OP_GETPEERNAME);
4345 case KEY_gethostbyname:
4348 case KEY_gethostbyaddr:
4349 LOP(OP_GHBYADDR,XTERM);
4351 case KEY_gethostent:
4354 case KEY_getnetbyname:
4357 case KEY_getnetbyaddr:
4358 LOP(OP_GNBYADDR,XTERM);
4363 case KEY_getservbyname:
4364 LOP(OP_GSBYNAME,XTERM);
4366 case KEY_getservbyport:
4367 LOP(OP_GSBYPORT,XTERM);
4369 case KEY_getservent:
4372 case KEY_getsockname:
4373 UNI(OP_GETSOCKNAME);
4375 case KEY_getsockopt:
4376 LOP(OP_GSOCKOPT,XTERM);
4398 yylval.ival = CopLINE(PL_curcop);
4402 LOP(OP_INDEX,XTERM);
4408 LOP(OP_IOCTL,XTERM);
4420 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4452 LOP(OP_LISTEN,XTERM);
4461 s = scan_pat(s,OP_MATCH);
4462 TERM(sublex_start());
4465 LOP(OP_MAPSTART, XREF);
4468 LOP(OP_MKDIR,XTERM);
4471 LOP(OP_MSGCTL,XTERM);
4474 LOP(OP_MSGGET,XTERM);
4477 LOP(OP_MSGRCV,XTERM);
4480 LOP(OP_MSGSND,XTERM);
4486 if (isIDFIRST_lazy_if(s,UTF)) {
4487 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4488 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4490 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4491 if (!PL_in_my_stash) {
4494 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4502 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4509 if (PL_expect != XSTATE)
4510 yyerror("\"no\" not allowed in expression");
4511 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4512 s = force_version(s);
4517 if (*s == '(' || (s = skipspace(s), *s == '('))
4524 if (isIDFIRST_lazy_if(s,UTF)) {
4526 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4528 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4529 Perl_warner(aTHX_ WARN_PRECEDENCE,
4530 "Precedence problem: open %.*s should be open(%.*s)",
4536 yylval.ival = OP_OR;
4546 LOP(OP_OPEN_DIR,XTERM);
4549 checkcomma(s,PL_tokenbuf,"filehandle");
4553 checkcomma(s,PL_tokenbuf,"filehandle");
4572 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4576 LOP(OP_PIPE_OP,XTERM);
4579 s = scan_str(s,FALSE,FALSE);
4581 missingterm((char*)0);
4582 yylval.ival = OP_CONST;
4583 TERM(sublex_start());
4589 s = scan_str(s,FALSE,FALSE);
4591 missingterm((char*)0);
4593 if (SvCUR(PL_lex_stuff)) {
4596 d = SvPV_force(PL_lex_stuff, len);
4598 for (; isSPACE(*d) && len; --len, ++d) ;
4601 if (!warned && ckWARN(WARN_QW)) {
4602 for (; !isSPACE(*d) && len; --len, ++d) {
4604 Perl_warner(aTHX_ WARN_QW,
4605 "Possible attempt to separate words with commas");
4608 else if (*d == '#') {
4609 Perl_warner(aTHX_ WARN_QW,
4610 "Possible attempt to put comments in qw() list");
4616 for (; !isSPACE(*d) && len; --len, ++d) ;
4618 words = append_elem(OP_LIST, words,
4619 newSVOP(OP_CONST, 0, tokeq(newSVpvn(b, d-b))));
4623 PL_nextval[PL_nexttoke].opval = words;
4628 SvREFCNT_dec(PL_lex_stuff);
4629 PL_lex_stuff = Nullsv;
4634 s = scan_str(s,FALSE,FALSE);
4636 missingterm((char*)0);
4637 yylval.ival = OP_STRINGIFY;
4638 if (SvIVX(PL_lex_stuff) == '\'')
4639 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4640 TERM(sublex_start());
4643 s = scan_pat(s,OP_QR);
4644 TERM(sublex_start());
4647 s = scan_str(s,FALSE,FALSE);
4649 missingterm((char*)0);
4650 yylval.ival = OP_BACKTICK;
4652 TERM(sublex_start());
4659 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4660 s = force_version(s);
4663 *PL_tokenbuf = '\0';
4664 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4665 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4666 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4668 yyerror("<> should be quotes");
4676 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4680 LOP(OP_RENAME,XTERM);
4689 LOP(OP_RINDEX,XTERM);
4712 LOP(OP_REVERSE,XTERM);
4723 TERM(sublex_start());
4725 TOKEN(1); /* force error */
4734 LOP(OP_SELECT,XTERM);
4740 LOP(OP_SEMCTL,XTERM);
4743 LOP(OP_SEMGET,XTERM);
4746 LOP(OP_SEMOP,XTERM);
4752 LOP(OP_SETPGRP,XTERM);
4754 case KEY_setpriority:
4755 LOP(OP_SETPRIORITY,XTERM);
4757 case KEY_sethostent:
4763 case KEY_setservent:
4766 case KEY_setprotoent:
4776 LOP(OP_SEEKDIR,XTERM);
4778 case KEY_setsockopt:
4779 LOP(OP_SSOCKOPT,XTERM);
4785 LOP(OP_SHMCTL,XTERM);
4788 LOP(OP_SHMGET,XTERM);
4791 LOP(OP_SHMREAD,XTERM);
4794 LOP(OP_SHMWRITE,XTERM);
4797 LOP(OP_SHUTDOWN,XTERM);
4806 LOP(OP_SOCKET,XTERM);
4808 case KEY_socketpair:
4809 LOP(OP_SOCKPAIR,XTERM);
4812 checkcomma(s,PL_tokenbuf,"subroutine name");
4814 if (*s == ';' || *s == ')') /* probably a close */
4815 Perl_croak(aTHX_ "sort is now a reserved word");
4817 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4821 LOP(OP_SPLIT,XTERM);
4824 LOP(OP_SPRINTF,XTERM);
4827 LOP(OP_SPLICE,XTERM);
4842 LOP(OP_SUBSTR,XTERM);
4848 char tmpbuf[sizeof PL_tokenbuf];
4850 expectation attrful;
4851 bool have_name, have_proto;
4856 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4857 (*s == ':' && s[1] == ':'))
4860 attrful = XATTRBLOCK;
4861 /* remember buffer pos'n for later force_word */
4862 tboffset = s - PL_oldbufptr;
4863 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4864 if (strchr(tmpbuf, ':'))
4865 sv_setpv(PL_subname, tmpbuf);
4867 sv_setsv(PL_subname,PL_curstname);
4868 sv_catpvn(PL_subname,"::",2);
4869 sv_catpvn(PL_subname,tmpbuf,len);
4876 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4877 PL_expect = XTERMBLOCK;
4878 attrful = XATTRTERM;
4879 sv_setpv(PL_subname,"?");
4883 if (key == KEY_format) {
4885 PL_lex_formbrack = PL_lex_brackets + 1;
4887 (void) force_word(PL_oldbufptr + tboffset, WORD,
4892 /* Look for a prototype */
4896 s = scan_str(s,FALSE,FALSE);
4899 SvREFCNT_dec(PL_lex_stuff);
4900 PL_lex_stuff = Nullsv;
4901 Perl_croak(aTHX_ "Prototype not terminated");
4904 d = SvPVX(PL_lex_stuff);
4906 for (p = d; *p; ++p) {
4911 SvCUR(PL_lex_stuff) = tmp;
4919 if (*s == ':' && s[1] != ':')
4920 PL_expect = attrful;
4923 PL_nextval[PL_nexttoke].opval =
4924 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
4925 PL_lex_stuff = Nullsv;
4929 sv_setpv(PL_subname,"__ANON__");
4932 (void) force_word(PL_oldbufptr + tboffset, WORD,
4941 LOP(OP_SYSTEM,XREF);
4944 LOP(OP_SYMLINK,XTERM);
4947 LOP(OP_SYSCALL,XTERM);
4950 LOP(OP_SYSOPEN,XTERM);
4953 LOP(OP_SYSSEEK,XTERM);
4956 LOP(OP_SYSREAD,XTERM);
4959 LOP(OP_SYSWRITE,XTERM);
4963 TERM(sublex_start());
4984 LOP(OP_TRUNCATE,XTERM);
4996 yylval.ival = CopLINE(PL_curcop);
5000 yylval.ival = CopLINE(PL_curcop);
5004 LOP(OP_UNLINK,XTERM);
5010 LOP(OP_UNPACK,XTERM);
5013 LOP(OP_UTIME,XTERM);
5016 if (ckWARN(WARN_UMASK)) {
5017 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5018 if (*d != '0' && isDIGIT(*d))
5019 Perl_warner(aTHX_ WARN_UMASK,
5020 "umask: argument is missing initial 0");
5025 LOP(OP_UNSHIFT,XTERM);
5028 if (PL_expect != XSTATE)
5029 yyerror("\"use\" not allowed in expression");
5031 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5032 s = force_version(s);
5033 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5034 PL_nextval[PL_nexttoke].opval = Nullop;
5039 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5040 s = force_version(s);
5052 yylval.ival = CopLINE(PL_curcop);
5056 PL_hints |= HINT_BLOCK_SCOPE;
5063 LOP(OP_WAITPID,XTERM);
5071 static char ctl_l[2];
5073 if (ctl_l[0] == '\0')
5074 ctl_l[0] = toCTRL('L');
5075 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5078 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5083 if (PL_expect == XOPERATOR)
5089 yylval.ival = OP_XOR;
5094 TERM(sublex_start());
5099 #pragma segment Main
5103 Perl_keyword(pTHX_ register char *d, I32 len)
5108 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5109 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5110 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5111 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5112 if (strEQ(d,"__END__")) return KEY___END__;
5116 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5121 if (strEQ(d,"and")) return -KEY_and;
5122 if (strEQ(d,"abs")) return -KEY_abs;
5125 if (strEQ(d,"alarm")) return -KEY_alarm;
5126 if (strEQ(d,"atan2")) return -KEY_atan2;
5129 if (strEQ(d,"accept")) return -KEY_accept;
5134 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5137 if (strEQ(d,"bless")) return -KEY_bless;
5138 if (strEQ(d,"bind")) return -KEY_bind;
5139 if (strEQ(d,"binmode")) return -KEY_binmode;
5142 if (strEQ(d,"CORE")) return -KEY_CORE;
5143 if (strEQ(d,"CHECK")) return KEY_CHECK;
5148 if (strEQ(d,"cmp")) return -KEY_cmp;
5149 if (strEQ(d,"chr")) return -KEY_chr;
5150 if (strEQ(d,"cos")) return -KEY_cos;
5153 if (strEQ(d,"chop")) return -KEY_chop;
5156 if (strEQ(d,"close")) return -KEY_close;
5157 if (strEQ(d,"chdir")) return -KEY_chdir;
5158 if (strEQ(d,"chomp")) return -KEY_chomp;
5159 if (strEQ(d,"chmod")) return -KEY_chmod;
5160 if (strEQ(d,"chown")) return -KEY_chown;
5161 if (strEQ(d,"crypt")) return -KEY_crypt;
5164 if (strEQ(d,"chroot")) return -KEY_chroot;
5165 if (strEQ(d,"caller")) return -KEY_caller;
5168 if (strEQ(d,"connect")) return -KEY_connect;
5171 if (strEQ(d,"closedir")) return -KEY_closedir;
5172 if (strEQ(d,"continue")) return -KEY_continue;
5177 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5182 if (strEQ(d,"do")) return KEY_do;
5185 if (strEQ(d,"die")) return -KEY_die;
5188 if (strEQ(d,"dump")) return -KEY_dump;
5191 if (strEQ(d,"delete")) return KEY_delete;
5194 if (strEQ(d,"defined")) return KEY_defined;
5195 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5198 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5203 if (strEQ(d,"END")) return KEY_END;
5208 if (strEQ(d,"eq")) return -KEY_eq;
5211 if (strEQ(d,"eof")) return -KEY_eof;
5212 if (strEQ(d,"exp")) return -KEY_exp;
5215 if (strEQ(d,"else")) return KEY_else;
5216 if (strEQ(d,"exit")) return -KEY_exit;
5217 if (strEQ(d,"eval")) return KEY_eval;
5218 if (strEQ(d,"exec")) return -KEY_exec;
5219 if (strEQ(d,"each")) return -KEY_each;
5222 if (strEQ(d,"elsif")) return KEY_elsif;
5225 if (strEQ(d,"exists")) return KEY_exists;
5226 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5229 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5230 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5233 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5236 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5237 if (strEQ(d,"endservent")) return -KEY_endservent;
5240 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5247 if (strEQ(d,"for")) return KEY_for;
5250 if (strEQ(d,"fork")) return -KEY_fork;
5253 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5254 if (strEQ(d,"flock")) return -KEY_flock;
5257 if (strEQ(d,"format")) return KEY_format;
5258 if (strEQ(d,"fileno")) return -KEY_fileno;
5261 if (strEQ(d,"foreach")) return KEY_foreach;
5264 if (strEQ(d,"formline")) return -KEY_formline;
5269 if (strnEQ(d,"get",3)) {
5274 if (strEQ(d,"ppid")) return -KEY_getppid;
5275 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5278 if (strEQ(d,"pwent")) return -KEY_getpwent;
5279 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5280 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5283 if (strEQ(d,"peername")) return -KEY_getpeername;
5284 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5285 if (strEQ(d,"priority")) return -KEY_getpriority;
5288 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5291 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5295 else if (*d == 'h') {
5296 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5297 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5298 if (strEQ(d,"hostent")) return -KEY_gethostent;
5300 else if (*d == 'n') {
5301 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5302 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5303 if (strEQ(d,"netent")) return -KEY_getnetent;
5305 else if (*d == 's') {
5306 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5307 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5308 if (strEQ(d,"servent")) return -KEY_getservent;
5309 if (strEQ(d,"sockname")) return -KEY_getsockname;
5310 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5312 else if (*d == 'g') {
5313 if (strEQ(d,"grent")) return -KEY_getgrent;
5314 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5315 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5317 else if (*d == 'l') {
5318 if (strEQ(d,"login")) return -KEY_getlogin;
5320 else if (strEQ(d,"c")) return -KEY_getc;
5325 if (strEQ(d,"gt")) return -KEY_gt;
5326 if (strEQ(d,"ge")) return -KEY_ge;
5329 if (strEQ(d,"grep")) return KEY_grep;
5330 if (strEQ(d,"goto")) return KEY_goto;
5331 if (strEQ(d,"glob")) return KEY_glob;
5334 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5339 if (strEQ(d,"hex")) return -KEY_hex;
5342 if (strEQ(d,"INIT")) return KEY_INIT;
5347 if (strEQ(d,"if")) return KEY_if;
5350 if (strEQ(d,"int")) return -KEY_int;
5353 if (strEQ(d,"index")) return -KEY_index;
5354 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5359 if (strEQ(d,"join")) return -KEY_join;
5363 if (strEQ(d,"keys")) return -KEY_keys;
5364 if (strEQ(d,"kill")) return -KEY_kill;
5370 if (strEQ(d,"lt")) return -KEY_lt;
5371 if (strEQ(d,"le")) return -KEY_le;
5372 if (strEQ(d,"lc")) return -KEY_lc;
5375 if (strEQ(d,"log")) return -KEY_log;
5378 if (strEQ(d,"last")) return KEY_last;
5379 if (strEQ(d,"link")) return -KEY_link;
5380 if (strEQ(d,"lock")) return -KEY_lock;
5383 if (strEQ(d,"local")) return KEY_local;
5384 if (strEQ(d,"lstat")) return -KEY_lstat;
5387 if (strEQ(d,"length")) return -KEY_length;
5388 if (strEQ(d,"listen")) return -KEY_listen;
5391 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5394 if (strEQ(d,"localtime")) return -KEY_localtime;
5400 case 1: return KEY_m;
5402 if (strEQ(d,"my")) return KEY_my;
5405 if (strEQ(d,"map")) return KEY_map;
5408 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5411 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5412 if (strEQ(d,"msgget")) return -KEY_msgget;
5413 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5414 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5419 if (strEQ(d,"next")) return KEY_next;
5420 if (strEQ(d,"ne")) return -KEY_ne;
5421 if (strEQ(d,"not")) return -KEY_not;
5422 if (strEQ(d,"no")) return KEY_no;
5427 if (strEQ(d,"or")) return -KEY_or;
5430 if (strEQ(d,"ord")) return -KEY_ord;
5431 if (strEQ(d,"oct")) return -KEY_oct;
5432 if (strEQ(d,"our")) return KEY_our;
5435 if (strEQ(d,"open")) return -KEY_open;
5438 if (strEQ(d,"opendir")) return -KEY_opendir;
5445 if (strEQ(d,"pop")) return -KEY_pop;
5446 if (strEQ(d,"pos")) return KEY_pos;
5449 if (strEQ(d,"push")) return -KEY_push;
5450 if (strEQ(d,"pack")) return -KEY_pack;
5451 if (strEQ(d,"pipe")) return -KEY_pipe;
5454 if (strEQ(d,"print")) return KEY_print;
5457 if (strEQ(d,"printf")) return KEY_printf;
5460 if (strEQ(d,"package")) return KEY_package;
5463 if (strEQ(d,"prototype")) return KEY_prototype;
5468 if (strEQ(d,"q")) return KEY_q;
5469 if (strEQ(d,"qr")) return KEY_qr;
5470 if (strEQ(d,"qq")) return KEY_qq;
5471 if (strEQ(d,"qw")) return KEY_qw;
5472 if (strEQ(d,"qx")) return KEY_qx;
5474 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5479 if (strEQ(d,"ref")) return -KEY_ref;
5482 if (strEQ(d,"read")) return -KEY_read;
5483 if (strEQ(d,"rand")) return -KEY_rand;
5484 if (strEQ(d,"recv")) return -KEY_recv;
5485 if (strEQ(d,"redo")) return KEY_redo;
5488 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5489 if (strEQ(d,"reset")) return -KEY_reset;
5492 if (strEQ(d,"return")) return KEY_return;
5493 if (strEQ(d,"rename")) return -KEY_rename;
5494 if (strEQ(d,"rindex")) return -KEY_rindex;
5497 if (strEQ(d,"require")) return -KEY_require;
5498 if (strEQ(d,"reverse")) return -KEY_reverse;
5499 if (strEQ(d,"readdir")) return -KEY_readdir;
5502 if (strEQ(d,"readlink")) return -KEY_readlink;
5503 if (strEQ(d,"readline")) return -KEY_readline;
5504 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5507 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5513 case 0: return KEY_s;
5515 if (strEQ(d,"scalar")) return KEY_scalar;
5520 if (strEQ(d,"seek")) return -KEY_seek;
5521 if (strEQ(d,"send")) return -KEY_send;
5524 if (strEQ(d,"semop")) return -KEY_semop;
5527 if (strEQ(d,"select")) return -KEY_select;
5528 if (strEQ(d,"semctl")) return -KEY_semctl;
5529 if (strEQ(d,"semget")) return -KEY_semget;
5532 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5533 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5536 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5537 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5540 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5543 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5544 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5545 if (strEQ(d,"setservent")) return -KEY_setservent;
5548 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5549 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5556 if (strEQ(d,"shift")) return -KEY_shift;
5559 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5560 if (strEQ(d,"shmget")) return -KEY_shmget;
5563 if (strEQ(d,"shmread")) return -KEY_shmread;
5566 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5567 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5572 if (strEQ(d,"sin")) return -KEY_sin;
5575 if (strEQ(d,"sleep")) return -KEY_sleep;
5578 if (strEQ(d,"sort")) return KEY_sort;
5579 if (strEQ(d,"socket")) return -KEY_socket;
5580 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5583 if (strEQ(d,"split")) return KEY_split;
5584 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5585 if (strEQ(d,"splice")) return -KEY_splice;
5588 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5591 if (strEQ(d,"srand")) return -KEY_srand;
5594 if (strEQ(d,"stat")) return -KEY_stat;
5595 if (strEQ(d,"study")) return KEY_study;
5598 if (strEQ(d,"substr")) return -KEY_substr;
5599 if (strEQ(d,"sub")) return KEY_sub;
5604 if (strEQ(d,"system")) return -KEY_system;
5607 if (strEQ(d,"symlink")) return -KEY_symlink;
5608 if (strEQ(d,"syscall")) return -KEY_syscall;
5609 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5610 if (strEQ(d,"sysread")) return -KEY_sysread;
5611 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5614 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5623 if (strEQ(d,"tr")) return KEY_tr;
5626 if (strEQ(d,"tie")) return KEY_tie;
5629 if (strEQ(d,"tell")) return -KEY_tell;
5630 if (strEQ(d,"tied")) return KEY_tied;
5631 if (strEQ(d,"time")) return -KEY_time;
5634 if (strEQ(d,"times")) return -KEY_times;
5637 if (strEQ(d,"telldir")) return -KEY_telldir;
5640 if (strEQ(d,"truncate")) return -KEY_truncate;
5647 if (strEQ(d,"uc")) return -KEY_uc;
5650 if (strEQ(d,"use")) return KEY_use;
5653 if (strEQ(d,"undef")) return KEY_undef;
5654 if (strEQ(d,"until")) return KEY_until;
5655 if (strEQ(d,"untie")) return KEY_untie;
5656 if (strEQ(d,"utime")) return -KEY_utime;
5657 if (strEQ(d,"umask")) return -KEY_umask;
5660 if (strEQ(d,"unless")) return KEY_unless;
5661 if (strEQ(d,"unpack")) return -KEY_unpack;
5662 if (strEQ(d,"unlink")) return -KEY_unlink;
5665 if (strEQ(d,"unshift")) return -KEY_unshift;
5666 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5671 if (strEQ(d,"values")) return -KEY_values;
5672 if (strEQ(d,"vec")) return -KEY_vec;
5677 if (strEQ(d,"warn")) return -KEY_warn;
5678 if (strEQ(d,"wait")) return -KEY_wait;
5681 if (strEQ(d,"while")) return KEY_while;
5682 if (strEQ(d,"write")) return -KEY_write;
5685 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5688 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5693 if (len == 1) return -KEY_x;
5694 if (strEQ(d,"xor")) return -KEY_xor;
5697 if (len == 1) return KEY_y;
5706 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5710 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5711 dTHR; /* only for ckWARN */
5712 if (ckWARN(WARN_SYNTAX)) {
5714 for (w = s+2; *w && level; w++) {
5721 for (; *w && isSPACE(*w); w++) ;
5722 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5723 Perl_warner(aTHX_ WARN_SYNTAX,
5724 "%s (...) interpreted as function",name);
5727 while (s < PL_bufend && isSPACE(*s))
5731 while (s < PL_bufend && isSPACE(*s))
5733 if (isIDFIRST_lazy_if(s,UTF)) {
5735 while (isALNUM_lazy_if(s,UTF))
5737 while (s < PL_bufend && isSPACE(*s))
5742 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5746 Perl_croak(aTHX_ "No comma allowed after %s", what);
5751 /* Either returns sv, or mortalizes sv and returns a new SV*.
5752 Best used as sv=new_constant(..., sv, ...).
5753 If s, pv are NULL, calls subroutine with one argument,
5754 and type is used with error messages only. */
5757 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5761 HV *table = GvHV(PL_hintgv); /* ^H */
5765 const char *why1, *why2, *why3;
5767 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5770 why2 = strEQ(key,"charnames")
5771 ? "(possibly a missing \"use charnames ...\")"
5773 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5774 (type ? type: "undef"), why2);
5776 /* This is convoluted and evil ("goto considered harmful")
5777 * but I do not understand the intricacies of all the different
5778 * failure modes of %^H in here. The goal here is to make
5779 * the most probable error message user-friendly. --jhi */
5784 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5785 (type ? type: "undef"), why1, why2, why3);
5787 yyerror(SvPVX(msg));
5791 cvp = hv_fetch(table, key, strlen(key), FALSE);
5792 if (!cvp || !SvOK(*cvp)) {
5795 why3 = "} is not defined";
5798 sv_2mortal(sv); /* Parent created it permanently */
5801 pv = sv_2mortal(newSVpvn(s, len));
5803 typesv = sv_2mortal(newSVpv(type, 0));
5805 typesv = &PL_sv_undef;
5807 PUSHSTACKi(PERLSI_OVERLOAD);
5819 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5823 /* Check the eval first */
5824 if (!PL_in_eval && SvTRUE(ERRSV)) {
5826 sv_catpv(ERRSV, "Propagated");
5827 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5829 res = SvREFCNT_inc(sv);
5833 (void)SvREFCNT_inc(res);
5842 why1 = "Call to &{$^H{";
5844 why3 = "}} did not return a defined value";
5853 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5855 register char *d = dest;
5856 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5859 Perl_croak(aTHX_ ident_too_long);
5860 if (isALNUM(*s)) /* UTF handled below */
5862 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
5867 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5871 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5872 char *t = s + UTF8SKIP(s);
5873 while (*t & 0x80 && is_utf8_mark((U8*)t))
5875 if (d + (t - s) > e)
5876 Perl_croak(aTHX_ ident_too_long);
5877 Copy(s, d, t - s, char);
5890 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
5900 e = d + destlen - 3; /* two-character token, ending NUL */
5902 while (isDIGIT(*s)) {
5904 Perl_croak(aTHX_ ident_too_long);
5911 Perl_croak(aTHX_ ident_too_long);
5912 if (isALNUM(*s)) /* UTF handled below */
5914 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
5919 else if (*s == ':' && s[1] == ':') {
5923 else if (UTF && *(U8*)s >= 0xc0 && isALNUM_utf8((U8*)s)) {
5924 char *t = s + UTF8SKIP(s);
5925 while (*t & 0x80 && is_utf8_mark((U8*)t))
5927 if (d + (t - s) > e)
5928 Perl_croak(aTHX_ ident_too_long);
5929 Copy(s, d, t - s, char);
5940 if (PL_lex_state != LEX_NORMAL)
5941 PL_lex_state = LEX_INTERPENDMAYBE;
5944 if (*s == '$' && s[1] &&
5945 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
5958 if (*d == '^' && *s && isCONTROLVAR(*s)) {
5963 if (isSPACE(s[-1])) {
5966 if (!SPACE_OR_TAB(ch)) {
5972 if (isIDFIRST_lazy_if(d,UTF)) {
5976 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
5978 while (e < send && *e & 0x80 && is_utf8_mark((U8*)e))
5981 Copy(s, d, e - s, char);
5986 while ((isALNUM(*s) || *s == ':') && d < e)
5989 Perl_croak(aTHX_ ident_too_long);
5992 while (s < send && SPACE_OR_TAB(*s)) s++;
5993 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
5994 dTHR; /* only for ckWARN */
5995 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
5996 const char *brack = *s == '[' ? "[...]" : "{...}";
5997 Perl_warner(aTHX_ WARN_AMBIGUOUS,
5998 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
5999 funny, dest, brack, funny, dest, brack);
6002 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6006 /* Handle extended ${^Foo} variables
6007 * 1999-02-27 mjd-perl-patch@plover.com */
6008 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6012 while (isALNUM(*s) && d < e) {
6016 Perl_croak(aTHX_ ident_too_long);
6021 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6022 PL_lex_state = LEX_INTERPEND;
6025 if (PL_lex_state == LEX_NORMAL) {
6026 dTHR; /* only for ckWARN */
6027 if (ckWARN(WARN_AMBIGUOUS) &&
6028 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6030 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6031 "Ambiguous use of %c{%s} resolved to %c%s",
6032 funny, dest, funny, dest);
6037 s = bracket; /* let the parser handle it */
6041 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6042 PL_lex_state = LEX_INTERPEND;
6047 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6052 *pmfl |= PMf_GLOBAL;
6054 *pmfl |= PMf_CONTINUE;
6058 *pmfl |= PMf_MULTILINE;
6060 *pmfl |= PMf_SINGLELINE;
6062 *pmfl |= PMf_EXTENDED;
6066 S_scan_pat(pTHX_ char *start, I32 type)
6071 s = scan_str(start,FALSE,FALSE);
6074 SvREFCNT_dec(PL_lex_stuff);
6075 PL_lex_stuff = Nullsv;
6076 Perl_croak(aTHX_ "Search pattern not terminated");
6079 pm = (PMOP*)newPMOP(type, 0);
6080 if (PL_multi_open == '?')
6081 pm->op_pmflags |= PMf_ONCE;
6083 while (*s && strchr("iomsx", *s))
6084 pmflag(&pm->op_pmflags,*s++);
6087 while (*s && strchr("iogcmsx", *s))
6088 pmflag(&pm->op_pmflags,*s++);
6090 pm->op_pmpermflags = pm->op_pmflags;
6092 PL_lex_op = (OP*)pm;
6093 yylval.ival = OP_MATCH;
6098 S_scan_subst(pTHX_ char *start)
6105 yylval.ival = OP_NULL;
6107 s = scan_str(start,FALSE,FALSE);
6111 SvREFCNT_dec(PL_lex_stuff);
6112 PL_lex_stuff = Nullsv;
6113 Perl_croak(aTHX_ "Substitution pattern not terminated");
6116 if (s[-1] == PL_multi_open)
6119 first_start = PL_multi_start;
6120 s = scan_str(s,FALSE,FALSE);
6123 SvREFCNT_dec(PL_lex_stuff);
6124 PL_lex_stuff = Nullsv;
6126 SvREFCNT_dec(PL_lex_repl);
6127 PL_lex_repl = Nullsv;
6128 Perl_croak(aTHX_ "Substitution replacement not terminated");
6130 PL_multi_start = first_start; /* so whole substitution is taken together */
6132 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6138 else if (strchr("iogcmsx", *s))
6139 pmflag(&pm->op_pmflags,*s++);
6146 PL_sublex_info.super_bufptr = s;
6147 PL_sublex_info.super_bufend = PL_bufend;
6149 pm->op_pmflags |= PMf_EVAL;
6150 repl = newSVpvn("",0);
6152 sv_catpv(repl, es ? "eval " : "do ");
6153 sv_catpvn(repl, "{ ", 2);
6154 sv_catsv(repl, PL_lex_repl);
6155 sv_catpvn(repl, " };", 2);
6157 SvREFCNT_dec(PL_lex_repl);
6161 pm->op_pmpermflags = pm->op_pmflags;
6162 PL_lex_op = (OP*)pm;
6163 yylval.ival = OP_SUBST;
6168 S_scan_trans(pTHX_ char *start)
6179 yylval.ival = OP_NULL;
6181 s = scan_str(start,FALSE,FALSE);
6184 SvREFCNT_dec(PL_lex_stuff);
6185 PL_lex_stuff = Nullsv;
6186 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6188 if (s[-1] == PL_multi_open)
6191 s = scan_str(s,FALSE,FALSE);
6194 SvREFCNT_dec(PL_lex_stuff);
6195 PL_lex_stuff = Nullsv;
6197 SvREFCNT_dec(PL_lex_repl);
6198 PL_lex_repl = Nullsv;
6199 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6202 New(803,tbl,256,short);
6203 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6205 complement = del = squash = 0;
6206 while (strchr("cds", *s)) {
6208 complement = OPpTRANS_COMPLEMENT;
6210 del = OPpTRANS_DELETE;
6212 squash = OPpTRANS_SQUASH;
6215 o->op_private = del|squash|complement;
6218 yylval.ival = OP_TRANS;
6223 S_scan_heredoc(pTHX_ register char *s)
6227 I32 op_type = OP_SCALAR;
6234 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6238 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6241 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6242 if (*peek && strchr("`'\"",*peek)) {
6245 s = delimcpy(d, e, s, PL_bufend, term, &len);
6255 if (!isALNUM_lazy_if(s,UTF))
6256 deprecate("bare << to mean <<\"\"");
6257 for (; isALNUM_lazy_if(s,UTF); s++) {
6262 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6263 Perl_croak(aTHX_ "Delimiter for here document is too long");
6266 len = d - PL_tokenbuf;
6267 #ifndef PERL_STRICT_CR
6268 d = strchr(s, '\r');
6272 while (s < PL_bufend) {
6278 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6287 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6292 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6293 herewas = newSVpvn(s,PL_bufend-s);
6295 s--, herewas = newSVpvn(s,d-s);
6296 s += SvCUR(herewas);
6298 tmpstr = NEWSV(87,79);
6299 sv_upgrade(tmpstr, SVt_PVIV);
6304 else if (term == '`') {
6305 op_type = OP_BACKTICK;
6306 SvIVX(tmpstr) = '\\';
6310 PL_multi_start = CopLINE(PL_curcop);
6311 PL_multi_open = PL_multi_close = '<';
6312 term = *PL_tokenbuf;
6313 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6314 char *bufptr = PL_sublex_info.super_bufptr;
6315 char *bufend = PL_sublex_info.super_bufend;
6316 char *olds = s - SvCUR(herewas);
6317 s = strchr(bufptr, '\n');
6321 while (s < bufend &&
6322 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6324 CopLINE_inc(PL_curcop);
6327 CopLINE_set(PL_curcop, PL_multi_start);
6328 missingterm(PL_tokenbuf);
6330 sv_setpvn(herewas,bufptr,d-bufptr+1);
6331 sv_setpvn(tmpstr,d+1,s-d);
6333 sv_catpvn(herewas,s,bufend-s);
6334 (void)strcpy(bufptr,SvPVX(herewas));
6341 while (s < PL_bufend &&
6342 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6344 CopLINE_inc(PL_curcop);
6346 if (s >= PL_bufend) {
6347 CopLINE_set(PL_curcop, PL_multi_start);
6348 missingterm(PL_tokenbuf);
6350 sv_setpvn(tmpstr,d+1,s-d);
6352 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6354 sv_catpvn(herewas,s,PL_bufend-s);
6355 sv_setsv(PL_linestr,herewas);
6356 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6357 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6360 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6361 while (s >= PL_bufend) { /* multiple line string? */
6363 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6364 CopLINE_set(PL_curcop, PL_multi_start);
6365 missingterm(PL_tokenbuf);
6367 CopLINE_inc(PL_curcop);
6368 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6369 #ifndef PERL_STRICT_CR
6370 if (PL_bufend - PL_linestart >= 2) {
6371 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6372 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6374 PL_bufend[-2] = '\n';
6376 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6378 else if (PL_bufend[-1] == '\r')
6379 PL_bufend[-1] = '\n';
6381 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6382 PL_bufend[-1] = '\n';
6384 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6385 SV *sv = NEWSV(88,0);
6387 sv_upgrade(sv, SVt_PVMG);
6388 sv_setsv(sv,PL_linestr);
6389 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6391 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6394 sv_catsv(PL_linestr,herewas);
6395 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6399 sv_catsv(tmpstr,PL_linestr);
6404 PL_multi_end = CopLINE(PL_curcop);
6405 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6406 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6407 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6409 SvREFCNT_dec(herewas);
6410 PL_lex_stuff = tmpstr;
6411 yylval.ival = op_type;
6416 takes: current position in input buffer
6417 returns: new position in input buffer
6418 side-effects: yylval and lex_op are set.
6423 <FH> read from filehandle
6424 <pkg::FH> read from package qualified filehandle
6425 <pkg'FH> read from package qualified filehandle
6426 <$fh> read from filehandle in $fh
6432 S_scan_inputsymbol(pTHX_ char *start)
6434 register char *s = start; /* current position in buffer */
6440 d = PL_tokenbuf; /* start of temp holding space */
6441 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6442 end = strchr(s, '\n');
6445 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6447 /* die if we didn't have space for the contents of the <>,
6448 or if it didn't end, or if we see a newline
6451 if (len >= sizeof PL_tokenbuf)
6452 Perl_croak(aTHX_ "Excessively long <> operator");
6454 Perl_croak(aTHX_ "Unterminated <> operator");
6459 Remember, only scalar variables are interpreted as filehandles by
6460 this code. Anything more complex (e.g., <$fh{$num}>) will be
6461 treated as a glob() call.
6462 This code makes use of the fact that except for the $ at the front,
6463 a scalar variable and a filehandle look the same.
6465 if (*d == '$' && d[1]) d++;
6467 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6468 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6471 /* If we've tried to read what we allow filehandles to look like, and
6472 there's still text left, then it must be a glob() and not a getline.
6473 Use scan_str to pull out the stuff between the <> and treat it
6474 as nothing more than a string.
6477 if (d - PL_tokenbuf != len) {
6478 yylval.ival = OP_GLOB;
6480 s = scan_str(start,FALSE,FALSE);
6482 Perl_croak(aTHX_ "Glob not terminated");
6486 /* we're in a filehandle read situation */
6489 /* turn <> into <ARGV> */
6491 (void)strcpy(d,"ARGV");
6493 /* if <$fh>, create the ops to turn the variable into a
6499 /* try to find it in the pad for this block, otherwise find
6500 add symbol table ops
6502 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6503 OP *o = newOP(OP_PADSV, 0);
6505 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6508 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6509 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6510 newUNOP(OP_RV2SV, 0,
6511 newGVOP(OP_GV, 0, gv)));
6513 PL_lex_op->op_flags |= OPf_SPECIAL;
6514 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6515 yylval.ival = OP_NULL;
6518 /* If it's none of the above, it must be a literal filehandle
6519 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6521 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6522 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6523 yylval.ival = OP_NULL;
6532 takes: start position in buffer
6533 keep_quoted preserve \ on the embedded delimiter(s)
6534 keep_delims preserve the delimiters around the string
6535 returns: position to continue reading from buffer
6536 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6537 updates the read buffer.
6539 This subroutine pulls a string out of the input. It is called for:
6540 q single quotes q(literal text)
6541 ' single quotes 'literal text'
6542 qq double quotes qq(interpolate $here please)
6543 " double quotes "interpolate $here please"
6544 qx backticks qx(/bin/ls -l)
6545 ` backticks `/bin/ls -l`
6546 qw quote words @EXPORT_OK = qw( func() $spam )
6547 m// regexp match m/this/
6548 s/// regexp substitute s/this/that/
6549 tr/// string transliterate tr/this/that/
6550 y/// string transliterate y/this/that/
6551 ($*@) sub prototypes sub foo ($)
6552 (stuff) sub attr parameters sub foo : attr(stuff)
6553 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6555 In most of these cases (all but <>, patterns and transliterate)
6556 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6557 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6558 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6561 It skips whitespace before the string starts, and treats the first
6562 character as the delimiter. If the delimiter is one of ([{< then
6563 the corresponding "close" character )]}> is used as the closing
6564 delimiter. It allows quoting of delimiters, and if the string has
6565 balanced delimiters ([{<>}]) it allows nesting.
6567 The lexer always reads these strings into lex_stuff, except in the
6568 case of the operators which take *two* arguments (s/// and tr///)
6569 when it checks to see if lex_stuff is full (presumably with the 1st
6570 arg to s or tr) and if so puts the string into lex_repl.
6575 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6578 SV *sv; /* scalar value: string */
6579 char *tmps; /* temp string, used for delimiter matching */
6580 register char *s = start; /* current position in the buffer */
6581 register char term; /* terminating character */
6582 register char *to; /* current position in the sv's data */
6583 I32 brackets = 1; /* bracket nesting level */
6584 bool has_utf8 = FALSE; /* is there any utf8 content? */
6586 /* skip space before the delimiter */
6590 /* mark where we are, in case we need to report errors */
6593 /* after skipping whitespace, the next character is the terminator */
6595 if ((term & 0x80) && UTF)
6598 /* mark where we are */
6599 PL_multi_start = CopLINE(PL_curcop);
6600 PL_multi_open = term;
6602 /* find corresponding closing delimiter */
6603 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6605 PL_multi_close = term;
6607 /* create a new SV to hold the contents. 87 is leak category, I'm
6608 assuming. 79 is the SV's initial length. What a random number. */
6610 sv_upgrade(sv, SVt_PVIV);
6612 (void)SvPOK_only(sv); /* validate pointer */
6614 /* move past delimiter and try to read a complete string */
6616 sv_catpvn(sv, s, 1);
6619 /* extend sv if need be */
6620 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6621 /* set 'to' to the next character in the sv's string */
6622 to = SvPVX(sv)+SvCUR(sv);
6624 /* if open delimiter is the close delimiter read unbridle */
6625 if (PL_multi_open == PL_multi_close) {
6626 for (; s < PL_bufend; s++,to++) {
6627 /* embedded newlines increment the current line number */
6628 if (*s == '\n' && !PL_rsfp)
6629 CopLINE_inc(PL_curcop);
6630 /* handle quoted delimiters */
6631 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6632 if (!keep_quoted && s[1] == term)
6634 /* any other quotes are simply copied straight through */
6638 /* terminate when run out of buffer (the for() condition), or
6639 have found the terminator */
6640 else if (*s == term)
6642 else if (!has_utf8 && (*s & 0x80) && UTF)
6648 /* if the terminator isn't the same as the start character (e.g.,
6649 matched brackets), we have to allow more in the quoting, and
6650 be prepared for nested brackets.
6653 /* read until we run out of string, or we find the terminator */
6654 for (; s < PL_bufend; s++,to++) {
6655 /* embedded newlines increment the line count */
6656 if (*s == '\n' && !PL_rsfp)
6657 CopLINE_inc(PL_curcop);
6658 /* backslashes can escape the open or closing characters */
6659 if (*s == '\\' && s+1 < PL_bufend) {
6661 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6666 /* allow nested opens and closes */
6667 else if (*s == PL_multi_close && --brackets <= 0)
6669 else if (*s == PL_multi_open)
6671 else if (!has_utf8 && (*s & 0x80) && UTF)
6676 /* terminate the copied string and update the sv's end-of-string */
6678 SvCUR_set(sv, to - SvPVX(sv));
6681 * this next chunk reads more into the buffer if we're not done yet
6685 break; /* handle case where we are done yet :-) */
6687 #ifndef PERL_STRICT_CR
6688 if (to - SvPVX(sv) >= 2) {
6689 if ((to[-2] == '\r' && to[-1] == '\n') ||
6690 (to[-2] == '\n' && to[-1] == '\r'))
6694 SvCUR_set(sv, to - SvPVX(sv));
6696 else if (to[-1] == '\r')
6699 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6703 /* if we're out of file, or a read fails, bail and reset the current
6704 line marker so we can report where the unterminated string began
6707 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6709 CopLINE_set(PL_curcop, PL_multi_start);
6712 /* we read a line, so increment our line counter */
6713 CopLINE_inc(PL_curcop);
6715 /* update debugger info */
6716 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6717 SV *sv = NEWSV(88,0);
6719 sv_upgrade(sv, SVt_PVMG);
6720 sv_setsv(sv,PL_linestr);
6721 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6724 /* having changed the buffer, we must update PL_bufend */
6725 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6728 /* at this point, we have successfully read the delimited string */
6731 sv_catpvn(sv, s, 1);
6734 PL_multi_end = CopLINE(PL_curcop);
6737 /* if we allocated too much space, give some back */
6738 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6739 SvLEN_set(sv, SvCUR(sv) + 1);
6740 Renew(SvPVX(sv), SvLEN(sv), char);
6743 /* decide whether this is the first or second quoted string we've read
6756 takes: pointer to position in buffer
6757 returns: pointer to new position in buffer
6758 side-effects: builds ops for the constant in yylval.op
6760 Read a number in any of the formats that Perl accepts:
6762 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6763 [\d_]+(\.[\d_]*)?[Ee](\d+)
6765 Underbars (_) are allowed in decimal numbers. If -w is on,
6766 underbars before a decimal point must be at three digit intervals.
6768 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6771 If it reads a number without a decimal point or an exponent, it will
6772 try converting the number to an integer and see if it can do so
6773 without loss of precision.
6777 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6779 register char *s = start; /* current position in buffer */
6780 register char *d; /* destination in temp buffer */
6781 register char *e; /* end of temp buffer */
6782 NV nv; /* number read, as a double */
6783 SV *sv = Nullsv; /* place to put the converted number */
6784 bool floatit; /* boolean: int or float? */
6785 char *lastub = 0; /* position of last underbar */
6786 static char number_too_long[] = "Number too long";
6788 /* We use the first character to decide what type of number this is */
6792 Perl_croak(aTHX_ "panic: scan_num");
6794 /* if it starts with a 0, it could be an octal number, a decimal in
6795 0.13 disguise, or a hexadecimal number, or a binary number. */
6799 u holds the "number so far"
6800 shift the power of 2 of the base
6801 (hex == 4, octal == 3, binary == 1)
6802 overflowed was the number more than we can hold?
6804 Shift is used when we add a digit. It also serves as an "are
6805 we in octal/hex/binary?" indicator to disallow hex characters
6812 bool overflowed = FALSE;
6813 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6814 static char* bases[5] = { "", "binary", "", "octal",
6816 static char* Bases[5] = { "", "Binary", "", "Octal",
6818 static char *maxima[5] = { "",
6819 "0b11111111111111111111111111111111",
6823 char *base, *Base, *max;
6829 } else if (s[1] == 'b') {
6833 /* check for a decimal in disguise */
6834 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6836 /* so it must be octal */
6840 base = bases[shift];
6841 Base = Bases[shift];
6842 max = maxima[shift];
6844 /* read the rest of the number */
6846 /* x is used in the overflow test,
6847 b is the digit we're adding on. */
6852 /* if we don't mention it, we're done */
6861 /* 8 and 9 are not octal */
6864 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6868 case '2': case '3': case '4':
6869 case '5': case '6': case '7':
6871 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6875 b = *s++ & 15; /* ASCII digit -> value of digit */
6879 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6880 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6881 /* make sure they said 0x */
6886 /* Prepare to put the digit we have onto the end
6887 of the number so far. We check for overflows.
6892 x = u << shift; /* make room for the digit */
6894 if ((x >> shift) != u
6895 && !(PL_hints & HINT_NEW_BINARY)) {
6899 if (ckWARN_d(WARN_OVERFLOW))
6900 Perl_warner(aTHX_ WARN_OVERFLOW,
6901 "Integer overflow in %s number",
6904 u = x | b; /* add the digit to the end */
6907 n *= nvshift[shift];
6908 /* If an NV has not enough bits in its
6909 * mantissa to represent an UV this summing of
6910 * small low-order numbers is a waste of time
6911 * (because the NV cannot preserve the
6912 * low-order bits anyway): we could just
6913 * remember when did we overflow and in the
6914 * end just multiply n by the right
6922 /* if we get here, we had success: make a scalar value from
6929 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
6930 Perl_warner(aTHX_ WARN_PORTABLE,
6931 "%s number > %s non-portable",
6938 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
6939 Perl_warner(aTHX_ WARN_PORTABLE,
6940 "%s number > %s non-portable",
6945 if (PL_hints & HINT_NEW_BINARY)
6946 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
6951 handle decimal numbers.
6952 we're also sent here when we read a 0 as the first digit
6954 case '1': case '2': case '3': case '4': case '5':
6955 case '6': case '7': case '8': case '9': case '.':
6958 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
6961 /* read next group of digits and _ and copy into d */
6962 while (isDIGIT(*s) || *s == '_') {
6963 /* skip underscores, checking for misplaced ones
6967 dTHR; /* only for ckWARN */
6968 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
6969 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6973 /* check for end of fixed-length buffer */
6975 Perl_croak(aTHX_ number_too_long);
6976 /* if we're ok, copy the character */
6981 /* final misplaced underbar check */
6982 if (lastub && s - lastub != 3) {
6984 if (ckWARN(WARN_SYNTAX))
6985 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
6988 /* read a decimal portion if there is one. avoid
6989 3..5 being interpreted as the number 3. followed
6992 if (*s == '.' && s[1] != '.') {
6996 /* copy, ignoring underbars, until we run out of
6997 digits. Note: no misplaced underbar checks!
6999 for (; isDIGIT(*s) || *s == '_'; s++) {
7000 /* fixed length buffer check */
7002 Perl_croak(aTHX_ number_too_long);
7006 if (*s == '.' && isDIGIT(s[1])) {
7007 /* oops, it's really a v-string, but without the "v" */
7013 /* read exponent part, if present */
7014 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
7018 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7019 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7021 /* allow positive or negative exponent */
7022 if (*s == '+' || *s == '-')
7025 /* read digits of exponent (no underbars :-) */
7026 while (isDIGIT(*s)) {
7028 Perl_croak(aTHX_ number_too_long);
7033 /* terminate the string */
7036 /* make an sv from the string */
7039 #if defined(Strtol) && defined(Strtoul)
7042 strtol/strtoll sets errno to ERANGE if the number is too big
7043 for an integer. We try to do an integer conversion first
7044 if no characters indicating "float" have been found.
7051 if (*PL_tokenbuf == '-')
7052 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7054 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7056 floatit = TRUE; /* Probably just too large. */
7057 else if (*PL_tokenbuf == '-')
7059 else if (uv <= IV_MAX)
7060 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7065 nv = Atof(PL_tokenbuf);
7070 No working strtou?ll?.
7072 Unfortunately atol() doesn't do range checks (returning
7073 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7074 everywhere [1], so we cannot use use atol() (or atoll()).
7075 If we could, they would be used, as Atol(), very much like
7076 Strtol() and Strtoul() are used above.
7078 [1] XXX Configure test needed to check for atol()
7079 (and atoll()) overflow behaviour XXX
7083 We need to do this the hard way. */
7085 nv = Atof(PL_tokenbuf);
7087 /* See if we can make do with an integer value without loss of
7088 precision. We use U_V to cast to a UV, because some
7089 compilers have issues. Then we try casting it back and see
7090 if it was the same [1]. We only do this if we know we
7091 specifically read an integer. If floatit is true, then we
7092 don't need to do the conversion at all.
7094 [1] Note that this is lossy if our NVs cannot preserve our
7095 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7096 and NV_PRESERVES_UV_BITS (a number), but in general we really
7097 do hope all such potentially lossy platforms have strtou?ll?
7098 to do a lossless IV/UV conversion.
7100 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7101 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7102 as NV_DIG and NV_MANT_DIG)?
7108 if (!floatit && (NV)uv == nv) {
7110 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7118 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7119 (PL_hints & HINT_NEW_INTEGER) )
7120 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7121 (floatit ? "float" : "integer"),
7125 /* if it starts with a v, it could be a v-string */
7131 while (isDIGIT(*pos) || *pos == '_')
7133 if (!isALPHA(*pos)) {
7135 U8 tmpbuf[UTF8_MAXLEN];
7138 s++; /* get past 'v' */
7141 sv_setpvn(sv, "", 0);
7144 if (*s == '0' && isDIGIT(s[1]))
7145 yyerror("Octal number in vector unsupported");
7148 /* this is atoi() that tolerates underscores */
7151 while (--end >= s) {
7156 rev += (*end - '0') * mult;
7158 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7159 Perl_warner(aTHX_ WARN_OVERFLOW,
7160 "Integer overflow in decimal number");
7163 tmpend = uv_to_utf8(tmpbuf, rev);
7164 utf8 = utf8 || rev > 127;
7165 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7166 if (*pos == '.' && isDIGIT(pos[1]))
7172 while (isDIGIT(*pos) || *pos == '_')
7180 sv_utf8_downgrade(sv, TRUE);
7187 /* make the op for the constant and return */
7190 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7192 lvalp->opval = Nullop;
7198 S_scan_formline(pTHX_ register char *s)
7203 SV *stuff = newSVpvn("",0);
7204 bool needargs = FALSE;
7207 if (*s == '.' || *s == /*{*/'}') {
7209 #ifdef PERL_STRICT_CR
7210 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7212 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7214 if (*t == '\n' || t == PL_bufend)
7217 if (PL_in_eval && !PL_rsfp) {
7218 eol = strchr(s,'\n');
7223 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7225 for (t = s; t < eol; t++) {
7226 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7228 goto enough; /* ~~ must be first line in formline */
7230 if (*t == '@' || *t == '^')
7233 sv_catpvn(stuff, s, eol-s);
7234 #ifndef PERL_STRICT_CR
7235 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7236 char *end = SvPVX(stuff) + SvCUR(stuff);
7245 s = filter_gets(PL_linestr, PL_rsfp, 0);
7246 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7247 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7250 yyerror("Format not terminated");
7260 PL_lex_state = LEX_NORMAL;
7261 PL_nextval[PL_nexttoke].ival = 0;
7265 PL_lex_state = LEX_FORMLINE;
7266 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7268 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7272 SvREFCNT_dec(stuff);
7273 PL_lex_formbrack = 0;
7284 PL_cshlen = strlen(PL_cshname);
7289 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7292 I32 oldsavestack_ix = PL_savestack_ix;
7293 CV* outsidecv = PL_compcv;
7297 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7299 SAVEI32(PL_subline);
7300 save_item(PL_subname);
7303 SAVESPTR(PL_comppad_name);
7304 SAVESPTR(PL_compcv);
7305 SAVEI32(PL_comppad_name_fill);
7306 SAVEI32(PL_min_intro_pending);
7307 SAVEI32(PL_max_intro_pending);
7308 SAVEI32(PL_pad_reset_pending);
7310 PL_compcv = (CV*)NEWSV(1104,0);
7311 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7312 CvFLAGS(PL_compcv) |= flags;
7314 PL_comppad = newAV();
7315 av_push(PL_comppad, Nullsv);
7316 PL_curpad = AvARRAY(PL_comppad);
7317 PL_comppad_name = newAV();
7318 PL_comppad_name_fill = 0;
7319 PL_min_intro_pending = 0;
7321 PL_subline = CopLINE(PL_curcop);
7323 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7324 PL_curpad[0] = (SV*)newAV();
7325 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7326 #endif /* USE_THREADS */
7328 comppadlist = newAV();
7329 AvREAL_off(comppadlist);
7330 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7331 av_store(comppadlist, 1, (SV*)PL_comppad);
7333 CvPADLIST(PL_compcv) = comppadlist;
7334 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7336 CvOWNER(PL_compcv) = 0;
7337 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7338 MUTEX_INIT(CvMUTEXP(PL_compcv));
7339 #endif /* USE_THREADS */
7341 return oldsavestack_ix;
7345 Perl_yywarn(pTHX_ char *s)
7348 PL_in_eval |= EVAL_WARNONLY;
7350 PL_in_eval &= ~EVAL_WARNONLY;
7355 Perl_yyerror(pTHX_ char *s)
7359 char *context = NULL;
7363 if (!yychar || (yychar == ';' && !PL_rsfp))
7365 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7366 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7367 while (isSPACE(*PL_oldoldbufptr))
7369 context = PL_oldoldbufptr;
7370 contlen = PL_bufptr - PL_oldoldbufptr;
7372 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7373 PL_oldbufptr != PL_bufptr) {
7374 while (isSPACE(*PL_oldbufptr))
7376 context = PL_oldbufptr;
7377 contlen = PL_bufptr - PL_oldbufptr;
7379 else if (yychar > 255)
7380 where = "next token ???";
7381 #ifdef USE_PURE_BISON
7382 /* GNU Bison sets the value -2 */
7383 else if (yychar == -2) {
7385 else if ((yychar & 127) == 127) {
7387 if (PL_lex_state == LEX_NORMAL ||
7388 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7389 where = "at end of line";
7390 else if (PL_lex_inpat)
7391 where = "within pattern";
7393 where = "within string";
7396 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7398 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7399 else if (isPRINT_LC(yychar))
7400 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7402 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7403 where = SvPVX(where_sv);
7405 msg = sv_2mortal(newSVpv(s, 0));
7406 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7407 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7409 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7411 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7412 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7413 Perl_sv_catpvf(aTHX_ msg,
7414 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7415 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7418 if (PL_in_eval & EVAL_WARNONLY)
7419 Perl_warn(aTHX_ "%"SVf, msg);
7422 if (PL_error_count >= 10) {
7423 if (PL_in_eval && SvCUR(ERRSV))
7424 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7425 ERRSV, CopFILE(PL_curcop));
7427 Perl_croak(aTHX_ "%s has too many errors.\n",
7428 CopFILE(PL_curcop));
7431 PL_in_my_stash = Nullhv;
7436 S_swallow_bom(pTHX_ U8 *s)
7439 slen = SvCUR(PL_linestr);
7443 /* UTF-16 little-endian */
7444 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7445 Perl_croak(aTHX_ "Unsupported script encoding");
7446 #ifndef PERL_NO_UTF16_FILTER
7447 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7449 if (PL_bufend > (char*)s) {
7453 filter_add(utf16rev_textfilter, NULL);
7454 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7455 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7456 PL_bufend - (char*)s - 1,
7458 Copy(news, s, newlen, U8);
7459 SvCUR_set(PL_linestr, newlen);
7460 PL_bufend = SvPVX(PL_linestr) + newlen;
7461 news[newlen++] = '\0';
7465 Perl_croak(aTHX_ "Unsupported script encoding");
7470 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7471 #ifndef PERL_NO_UTF16_FILTER
7472 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7474 if (PL_bufend > (char *)s) {
7478 filter_add(utf16_textfilter, NULL);
7479 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7480 PL_bufend = (char*)utf16_to_utf8(s, news,
7481 PL_bufend - (char*)s,
7483 Copy(news, s, newlen, U8);
7484 SvCUR_set(PL_linestr, newlen);
7485 PL_bufend = SvPVX(PL_linestr) + newlen;
7486 news[newlen++] = '\0';
7490 Perl_croak(aTHX_ "Unsupported script encoding");
7495 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7496 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7501 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7502 s[2] == 0xFE && s[3] == 0xFF)
7504 Perl_croak(aTHX_ "Unsupported script encoding");
7516 * Restore a source filter.
7520 restore_rsfp(pTHXo_ void *f)
7522 PerlIO *fp = (PerlIO*)f;
7524 if (PL_rsfp == PerlIO_stdin())
7525 PerlIO_clearerr(PL_rsfp);
7526 else if (PL_rsfp && (PL_rsfp != fp))
7527 PerlIO_close(PL_rsfp);
7531 #ifndef PERL_NO_UTF16_FILTER
7533 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7535 I32 count = FILTER_READ(idx+1, sv, maxlen);
7540 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7541 if (!*SvPV_nolen(sv))
7542 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7545 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7546 sv_usepvn(sv, (char*)tmps, tend - tmps);
7552 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7554 I32 count = FILTER_READ(idx+1, sv, maxlen);
7559 if (!*SvPV_nolen(sv))
7560 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7563 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7564 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7565 sv_usepvn(sv, (char*)tmps, tend - tmps);