3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "It all comes from here, the stench and the peril." --Frodo
16 * This file is the lexer for Perl. It's closely linked to the
19 * The main routine is yylex(), which returns the next token.
23 #define PERL_IN_TOKE_C
26 #define yychar PL_yychar
27 #define yylval PL_yylval
29 static char ident_too_long[] = "Identifier too long";
30 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
31 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
33 static void restore_rsfp(pTHX_ void *f);
34 #ifndef PERL_NO_UTF16_FILTER
35 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
39 #define XFAKEBRACK 128
42 #ifdef USE_UTF8_SCRIPTS
43 # define UTF (!IN_BYTES)
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
48 /* In variables named $^X, these are the legal values for X.
49 * 1999-02-27 mjd-perl-patch@plover.com */
50 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
52 /* On MacOS, respect nonbreaking spaces */
53 #ifdef MACOS_TRADITIONAL
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
56 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
59 /* LEX_* are values for PL_lex_state, the state of the lexer.
60 * They are arranged oddly so that the guard on the switch statement
61 * can get by with a single comparison (if the compiler is smart enough).
64 /* #define LEX_NOTPARSING 11 is done in perl.h. */
67 #define LEX_INTERPNORMAL 9
68 #define LEX_INTERPCASEMOD 8
69 #define LEX_INTERPPUSH 7
70 #define LEX_INTERPSTART 6
71 #define LEX_INTERPEND 5
72 #define LEX_INTERPENDMAYBE 4
73 #define LEX_INTERPCONCAT 3
74 #define LEX_INTERPCONST 2
75 #define LEX_FORMLINE 1
76 #define LEX_KNOWNEXT 0
84 # define YYMAXLEVEL 100
86 YYSTYPE* yylval_pointer[YYMAXLEVEL];
87 int* yychar_pointer[YYMAXLEVEL];
91 # define yylval (*yylval_pointer[yyactlevel])
92 # define yychar (*yychar_pointer[yyactlevel])
93 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
95 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
100 /* CLINE is a macro that ensures PL_copline has a sane value */
105 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
108 * Convenience functions to return different tokens and prime the
109 * lexer for the next token. They all take an argument.
111 * TOKEN : generic token (used for '(', DOLSHARP, etc)
112 * OPERATOR : generic operator
113 * AOPERATOR : assignment operator
114 * PREBLOCK : beginning the block after an if, while, foreach, ...
115 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
116 * PREREF : *EXPR where EXPR is not a simple identifier
117 * TERM : expression term
118 * LOOPX : loop exiting command (goto, last, dump, etc)
119 * FTST : file test operator
120 * FUN0 : zero-argument function
121 * FUN1 : not used, except for not, which isn't a UNIOP
122 * BOop : bitwise or or xor
124 * SHop : shift operator
125 * PWop : power operator
126 * PMop : pattern-matching operator
127 * Aop : addition-level operator
128 * Mop : multiplication-level operator
129 * Eop : equality-testing operator
130 * Rop : relational operator <= != gt
132 * Also see LOP and lop() below.
135 /* Note that REPORT() and REPORT2() will be expressions that supply
136 * their own trailing comma, not suitable for statements as such. */
137 #ifdef DEBUGGING /* Serve -DT. */
138 # define REPORT(x,retval) tokereport(x,s,(int)retval),
139 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
141 # define REPORT(x,retval)
142 # define REPORT2(x,retval)
145 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
146 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
147 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
148 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
149 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
150 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
151 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
152 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
153 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
154 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
155 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
156 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
157 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
158 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
159 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
160 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
161 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
162 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
163 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
164 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
166 /* This bit of chicanery makes a unary function followed by
167 * a parenthesis into a function with one argument, highest precedence.
168 * The UNIDOR macro is for unary functions that can be followed by the //
169 * operator (such as C<shift // 0>).
171 #define UNI2(f,x) return(yylval.ival = f, \
175 PL_last_uni = PL_oldbufptr, \
176 PL_last_lop_op = f, \
177 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
178 #define UNI(f) UNI2(f,XTERM)
179 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
181 #define UNIBRACK(f) return(yylval.ival = f, \
184 PL_last_uni = PL_oldbufptr, \
185 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
187 /* grandfather return to old style */
188 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
193 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
196 SV* report = newSVpv(thing, 0);
197 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
200 if (s - PL_bufptr > 0)
201 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
203 if (PL_oldbufptr && *PL_oldbufptr)
204 sv_catpv(report, PL_tokenbuf);
206 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
215 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
216 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
220 S_ao(pTHX_ int toketype)
222 if (*PL_bufptr == '=') {
224 if (toketype == ANDAND)
225 yylval.ival = OP_ANDASSIGN;
226 else if (toketype == OROR)
227 yylval.ival = OP_ORASSIGN;
228 else if (toketype == DORDOR)
229 yylval.ival = OP_DORASSIGN;
237 * When Perl expects an operator and finds something else, no_op
238 * prints the warning. It always prints "<something> found where
239 * operator expected. It prints "Missing semicolon on previous line?"
240 * if the surprise occurs at the start of the line. "do you need to
241 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
242 * where the compiler doesn't know if foo is a method call or a function.
243 * It prints "Missing operator before end of line" if there's nothing
244 * after the missing operator, or "... before <...>" if there is something
245 * after the missing operator.
249 S_no_op(pTHX_ char *what, char *s)
251 char *oldbp = PL_bufptr;
252 bool is_first = (PL_oldbufptr == PL_linestart);
258 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
259 if (ckWARN_d(WARN_SYNTAX)) {
261 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
262 "\t(Missing semicolon on previous line?)\n");
263 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
265 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
266 if (t < PL_bufptr && isSPACE(*t))
267 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
268 "\t(Do you need to predeclare %.*s?)\n",
269 t - PL_oldoldbufptr, PL_oldoldbufptr);
273 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
274 "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
282 * Complain about missing quote/regexp/heredoc terminator.
283 * If it's called with (char *)NULL then it cauterizes the line buffer.
284 * If we're in a delimited string and the delimiter is a control
285 * character, it's reformatted into a two-char sequence like ^C.
290 S_missingterm(pTHX_ char *s)
295 char *nl = strrchr(s,'\n');
301 iscntrl(PL_multi_close)
303 PL_multi_close < 32 || PL_multi_close == 127
307 tmpbuf[1] = toCTRL(PL_multi_close);
313 *tmpbuf = (char)PL_multi_close;
317 q = strchr(s,'"') ? '\'' : '"';
318 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
326 Perl_deprecate(pTHX_ char *s)
328 if (ckWARN(WARN_DEPRECATED))
329 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
333 Perl_deprecate_old(pTHX_ char *s)
335 /* This function should NOT be called for any new deprecated warnings */
336 /* Use Perl_deprecate instead */
338 /* It is here to maintain backward compatibility with the pre-5.8 */
339 /* warnings category hierarchy. The "deprecated" category used to */
340 /* live under the "syntax" category. It is now a top-level category */
341 /* in its own right. */
343 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
344 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
345 "Use of %s is deprecated", s);
350 * Deprecate a comma-less variable list.
356 deprecate_old("comma-less variable list");
360 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
361 * utf16-to-utf8-reversed.
364 #ifdef PERL_CR_FILTER
368 register char *s = SvPVX(sv);
369 register char *e = s + SvCUR(sv);
370 /* outer loop optimized to do nothing if there are no CR-LFs */
372 if (*s++ == '\r' && *s == '\n') {
373 /* hit a CR-LF, need to copy the rest */
374 register char *d = s - 1;
377 if (*s == '\r' && s[1] == '\n')
388 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
390 I32 count = FILTER_READ(idx+1, sv, maxlen);
391 if (count > 0 && !maxlen)
399 * Initialize variables. Uses the Perl save_stack to save its state (for
400 * recursive calls to the parser).
404 Perl_lex_start(pTHX_ SV *line)
409 SAVEI32(PL_lex_dojoin);
410 SAVEI32(PL_lex_brackets);
411 SAVEI32(PL_lex_casemods);
412 SAVEI32(PL_lex_starts);
413 SAVEI32(PL_lex_state);
414 SAVEVPTR(PL_lex_inpat);
415 SAVEI32(PL_lex_inwhat);
416 if (PL_lex_state == LEX_KNOWNEXT) {
417 I32 toke = PL_nexttoke;
418 while (--toke >= 0) {
419 SAVEI32(PL_nexttype[toke]);
420 SAVEVPTR(PL_nextval[toke]);
422 SAVEI32(PL_nexttoke);
424 SAVECOPLINE(PL_curcop);
427 SAVEPPTR(PL_oldbufptr);
428 SAVEPPTR(PL_oldoldbufptr);
429 SAVEPPTR(PL_last_lop);
430 SAVEPPTR(PL_last_uni);
431 SAVEPPTR(PL_linestart);
432 SAVESPTR(PL_linestr);
433 SAVEGENERICPV(PL_lex_brackstack);
434 SAVEGENERICPV(PL_lex_casestack);
435 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
436 SAVESPTR(PL_lex_stuff);
437 SAVEI32(PL_lex_defer);
438 SAVEI32(PL_sublex_info.sub_inwhat);
439 SAVESPTR(PL_lex_repl);
441 SAVEINT(PL_lex_expect);
443 PL_lex_state = LEX_NORMAL;
447 New(899, PL_lex_brackstack, 120, char);
448 New(899, PL_lex_casestack, 12, char);
450 *PL_lex_casestack = '\0';
453 PL_lex_stuff = Nullsv;
454 PL_lex_repl = Nullsv;
458 PL_sublex_info.sub_inwhat = 0;
460 if (SvREADONLY(PL_linestr))
461 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
462 s = SvPV(PL_linestr, len);
463 if (!len || s[len-1] != ';') {
464 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
465 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
466 sv_catpvn(PL_linestr, "\n;", 2);
468 SvTEMP_off(PL_linestr);
469 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
470 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
471 PL_last_lop = PL_last_uni = Nullch;
477 * Finalizer for lexing operations. Must be called when the parser is
478 * done with the lexer.
484 PL_doextract = FALSE;
489 * This subroutine has nothing to do with tilting, whether at windmills
490 * or pinball tables. Its name is short for "increment line". It
491 * increments the current line number in CopLINE(PL_curcop) and checks
492 * to see whether the line starts with a comment of the form
493 * # line 500 "foo.pm"
494 * If so, it sets the current line number and file to the values in the comment.
498 S_incline(pTHX_ char *s)
505 CopLINE_inc(PL_curcop);
508 while (SPACE_OR_TAB(*s)) s++;
509 if (strnEQ(s, "line", 4))
513 if (SPACE_OR_TAB(*s))
517 while (SPACE_OR_TAB(*s)) s++;
523 while (SPACE_OR_TAB(*s))
525 if (*s == '"' && (t = strchr(s+1, '"'))) {
530 for (t = s; !isSPACE(*t); t++) ;
533 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
535 if (*e != '\n' && *e != '\0')
536 return; /* false alarm */
541 CopFILE_free(PL_curcop);
542 CopFILE_set(PL_curcop, s);
545 CopLINE_set(PL_curcop, atoi(n)-1);
550 * Called to gobble the appropriate amount and type of whitespace.
551 * Skips comments as well.
555 S_skipspace(pTHX_ register char *s)
557 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
558 while (s < PL_bufend && SPACE_OR_TAB(*s))
564 SSize_t oldprevlen, oldoldprevlen;
565 SSize_t oldloplen = 0, oldunilen = 0;
566 while (s < PL_bufend && isSPACE(*s)) {
567 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
572 if (s < PL_bufend && *s == '#') {
573 while (s < PL_bufend && *s != '\n')
577 if (PL_in_eval && !PL_rsfp) {
584 /* only continue to recharge the buffer if we're at the end
585 * of the buffer, we're not reading from a source filter, and
586 * we're in normal lexing mode
588 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
589 PL_lex_state == LEX_FORMLINE)
592 /* try to recharge the buffer */
593 if ((s = filter_gets(PL_linestr, PL_rsfp,
594 (prevlen = SvCUR(PL_linestr)))) == Nullch)
596 /* end of file. Add on the -p or -n magic */
597 if (PL_minus_n || PL_minus_p) {
598 sv_setpv(PL_linestr,PL_minus_p ?
599 ";}continue{print or die qq(-p destination: $!\\n)" :
601 sv_catpv(PL_linestr,";}");
602 PL_minus_n = PL_minus_p = 0;
605 sv_setpv(PL_linestr,";");
607 /* reset variables for next time we lex */
608 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
610 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
611 PL_last_lop = PL_last_uni = Nullch;
613 /* Close the filehandle. Could be from -P preprocessor,
614 * STDIN, or a regular file. If we were reading code from
615 * STDIN (because the commandline held no -e or filename)
616 * then we don't close it, we reset it so the code can
617 * read from STDIN too.
620 if (PL_preprocess && !PL_in_eval)
621 (void)PerlProc_pclose(PL_rsfp);
622 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
623 PerlIO_clearerr(PL_rsfp);
625 (void)PerlIO_close(PL_rsfp);
630 /* not at end of file, so we only read another line */
631 /* make corresponding updates to old pointers, for yyerror() */
632 oldprevlen = PL_oldbufptr - PL_bufend;
633 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
635 oldunilen = PL_last_uni - PL_bufend;
637 oldloplen = PL_last_lop - PL_bufend;
638 PL_linestart = PL_bufptr = s + prevlen;
639 PL_bufend = s + SvCUR(PL_linestr);
641 PL_oldbufptr = s + oldprevlen;
642 PL_oldoldbufptr = s + oldoldprevlen;
644 PL_last_uni = s + oldunilen;
646 PL_last_lop = s + oldloplen;
649 /* debugger active and we're not compiling the debugger code,
650 * so store the line into the debugger's array of lines
652 if (PERLDB_LINE && PL_curstash != PL_debstash) {
653 SV *sv = NEWSV(85,0);
655 sv_upgrade(sv, SVt_PVMG);
656 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
659 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
666 * Check the unary operators to ensure there's no ambiguity in how they're
667 * used. An ambiguous piece of code would be:
669 * This doesn't mean rand() + 5. Because rand() is a unary operator,
670 * the +5 is its argument.
679 if (PL_oldoldbufptr != PL_last_uni)
681 while (isSPACE(*PL_last_uni))
683 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
684 if ((t = strchr(s, '(')) && t < PL_bufptr)
686 if (ckWARN_d(WARN_AMBIGUOUS)){
689 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
690 "Warning: Use of \"%s\" without parentheses is ambiguous",
697 * LOP : macro to build a list operator. Its behaviour has been replaced
698 * with a subroutine, S_lop() for which LOP is just another name.
701 #define LOP(f,x) return lop(f,x,s)
705 * Build a list operator (or something that might be one). The rules:
706 * - if we have a next token, then it's a list operator [why?]
707 * - if the next thing is an opening paren, then it's a function
708 * - else it's a list operator
712 S_lop(pTHX_ I32 f, int x, char *s)
719 PL_last_lop = PL_oldbufptr;
720 PL_last_lop_op = (OPCODE)f;
734 * When the lexer realizes it knows the next token (for instance,
735 * it is reordering tokens for the parser) then it can call S_force_next
736 * to know what token to return the next time the lexer is called. Caller
737 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
738 * handles the token correctly.
742 S_force_next(pTHX_ I32 type)
744 PL_nexttype[PL_nexttoke] = type;
746 if (PL_lex_state != LEX_KNOWNEXT) {
747 PL_lex_defer = PL_lex_state;
748 PL_lex_expect = PL_expect;
749 PL_lex_state = LEX_KNOWNEXT;
755 * When the lexer knows the next thing is a word (for instance, it has
756 * just seen -> and it knows that the next char is a word char, then
757 * it calls S_force_word to stick the next word into the PL_next lookahead.
760 * char *start : buffer position (must be within PL_linestr)
761 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
762 * int check_keyword : if true, Perl checks to make sure the word isn't
763 * a keyword (do this if the word is a label, e.g. goto FOO)
764 * int allow_pack : if true, : characters will also be allowed (require,
766 * int allow_initial_tick : used by the "sub" lexer only.
770 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
775 start = skipspace(start);
777 if (isIDFIRST_lazy_if(s,UTF) ||
778 (allow_pack && *s == ':') ||
779 (allow_initial_tick && *s == '\'') )
781 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
782 if (check_keyword && keyword(PL_tokenbuf, len))
784 if (token == METHOD) {
789 PL_expect = XOPERATOR;
792 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
793 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
794 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
795 SvUTF8_on(((SVOP*)PL_nextval[PL_nexttoke].opval)->op_sv);
803 * Called when the lexer wants $foo *foo &foo etc, but the program
804 * text only contains the "foo" portion. The first argument is a pointer
805 * to the "foo", and the second argument is the type symbol to prefix.
806 * Forces the next token to be a "WORD".
807 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
811 S_force_ident(pTHX_ register char *s, int kind)
814 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
815 PL_nextval[PL_nexttoke].opval = o;
818 o->op_private = OPpCONST_ENTERED;
819 /* XXX see note in pp_entereval() for why we forgo typo
820 warnings if the symbol must be introduced in an eval.
822 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
823 kind == '$' ? SVt_PV :
824 kind == '@' ? SVt_PVAV :
825 kind == '%' ? SVt_PVHV :
833 Perl_str_to_version(pTHX_ SV *sv)
838 char *start = SvPVx(sv,len);
839 bool utf = SvUTF8(sv) ? TRUE : FALSE;
840 char *end = start + len;
841 while (start < end) {
845 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
850 retval += ((NV)n)/nshift;
859 * Forces the next token to be a version number.
860 * If the next token appears to be an invalid version number, (e.g. "v2b"),
861 * and if "guessing" is TRUE, then no new token is created (and the caller
862 * must use an alternative parsing method).
866 S_force_version(pTHX_ char *s, int guessing)
868 OP *version = Nullop;
877 while (isDIGIT(*d) || *d == '_' || *d == '.')
879 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
881 s = scan_num(s, &yylval);
882 version = yylval.opval;
883 ver = cSVOPx(version)->op_sv;
884 if (SvPOK(ver) && !SvNIOK(ver)) {
885 (void)SvUPGRADE(ver, SVt_PVNV);
886 SvNVX(ver) = str_to_version(ver);
887 SvNOK_on(ver); /* hint that it is a version */
894 /* NOTE: The parser sees the package name and the VERSION swapped */
895 PL_nextval[PL_nexttoke].opval = version;
903 * Tokenize a quoted string passed in as an SV. It finds the next
904 * chunk, up to end of string or a backslash. It may make a new
905 * SV containing that chunk (if HINT_NEW_STRING is on). It also
910 S_tokeq(pTHX_ SV *sv)
921 s = SvPV_force(sv, len);
922 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
925 while (s < send && *s != '\\')
930 if ( PL_hints & HINT_NEW_STRING ) {
931 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
937 if (s + 1 < send && (s[1] == '\\'))
938 s++; /* all that, just for this */
943 SvCUR_set(sv, d - SvPVX(sv));
945 if ( PL_hints & HINT_NEW_STRING )
946 return new_constant(NULL, 0, "q", sv, pv, "q");
951 * Now come three functions related to double-quote context,
952 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
953 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
954 * interact with PL_lex_state, and create fake ( ... ) argument lists
955 * to handle functions and concatenation.
956 * They assume that whoever calls them will be setting up a fake
957 * join call, because each subthing puts a ',' after it. This lets
960 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
962 * (I'm not sure whether the spurious commas at the end of lcfirst's
963 * arguments and join's arguments are created or not).
968 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
970 * Pattern matching will set PL_lex_op to the pattern-matching op to
971 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
973 * OP_CONST and OP_READLINE are easy--just make the new op and return.
975 * Everything else becomes a FUNC.
977 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
978 * had an OP_CONST or OP_READLINE). This just sets us up for a
979 * call to S_sublex_push().
985 register I32 op_type = yylval.ival;
987 if (op_type == OP_NULL) {
988 yylval.opval = PL_lex_op;
992 if (op_type == OP_CONST || op_type == OP_READLINE) {
993 SV *sv = tokeq(PL_lex_stuff);
995 if (SvTYPE(sv) == SVt_PVIV) {
996 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
1002 nsv = newSVpvn(p, len);
1008 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1009 PL_lex_stuff = Nullsv;
1010 /* Allow <FH> // "foo" */
1011 if (op_type == OP_READLINE)
1012 PL_expect = XTERMORDORDOR;
1016 PL_sublex_info.super_state = PL_lex_state;
1017 PL_sublex_info.sub_inwhat = op_type;
1018 PL_sublex_info.sub_op = PL_lex_op;
1019 PL_lex_state = LEX_INTERPPUSH;
1023 yylval.opval = PL_lex_op;
1033 * Create a new scope to save the lexing state. The scope will be
1034 * ended in S_sublex_done. Returns a '(', starting the function arguments
1035 * to the uc, lc, etc. found before.
1036 * Sets PL_lex_state to LEX_INTERPCONCAT.
1044 PL_lex_state = PL_sublex_info.super_state;
1045 SAVEI32(PL_lex_dojoin);
1046 SAVEI32(PL_lex_brackets);
1047 SAVEI32(PL_lex_casemods);
1048 SAVEI32(PL_lex_starts);
1049 SAVEI32(PL_lex_state);
1050 SAVEVPTR(PL_lex_inpat);
1051 SAVEI32(PL_lex_inwhat);
1052 SAVECOPLINE(PL_curcop);
1053 SAVEPPTR(PL_bufptr);
1054 SAVEPPTR(PL_bufend);
1055 SAVEPPTR(PL_oldbufptr);
1056 SAVEPPTR(PL_oldoldbufptr);
1057 SAVEPPTR(PL_last_lop);
1058 SAVEPPTR(PL_last_uni);
1059 SAVEPPTR(PL_linestart);
1060 SAVESPTR(PL_linestr);
1061 SAVEGENERICPV(PL_lex_brackstack);
1062 SAVEGENERICPV(PL_lex_casestack);
1064 PL_linestr = PL_lex_stuff;
1065 PL_lex_stuff = Nullsv;
1067 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1068 = SvPVX(PL_linestr);
1069 PL_bufend += SvCUR(PL_linestr);
1070 PL_last_lop = PL_last_uni = Nullch;
1071 SAVEFREESV(PL_linestr);
1073 PL_lex_dojoin = FALSE;
1074 PL_lex_brackets = 0;
1075 New(899, PL_lex_brackstack, 120, char);
1076 New(899, PL_lex_casestack, 12, char);
1077 PL_lex_casemods = 0;
1078 *PL_lex_casestack = '\0';
1080 PL_lex_state = LEX_INTERPCONCAT;
1081 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1083 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1084 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1085 PL_lex_inpat = PL_sublex_info.sub_op;
1087 PL_lex_inpat = Nullop;
1094 * Restores lexer state after a S_sublex_push.
1100 if (!PL_lex_starts++) {
1101 SV *sv = newSVpvn("",0);
1102 if (SvUTF8(PL_linestr))
1104 PL_expect = XOPERATOR;
1105 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1109 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1110 PL_lex_state = LEX_INTERPCASEMOD;
1114 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1115 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1116 PL_linestr = PL_lex_repl;
1118 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1119 PL_bufend += SvCUR(PL_linestr);
1120 PL_last_lop = PL_last_uni = Nullch;
1121 SAVEFREESV(PL_linestr);
1122 PL_lex_dojoin = FALSE;
1123 PL_lex_brackets = 0;
1124 PL_lex_casemods = 0;
1125 *PL_lex_casestack = '\0';
1127 if (SvEVALED(PL_lex_repl)) {
1128 PL_lex_state = LEX_INTERPNORMAL;
1130 /* we don't clear PL_lex_repl here, so that we can check later
1131 whether this is an evalled subst; that means we rely on the
1132 logic to ensure sublex_done() is called again only via the
1133 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1136 PL_lex_state = LEX_INTERPCONCAT;
1137 PL_lex_repl = Nullsv;
1143 PL_bufend = SvPVX(PL_linestr);
1144 PL_bufend += SvCUR(PL_linestr);
1145 PL_expect = XOPERATOR;
1146 PL_sublex_info.sub_inwhat = 0;
1154 Extracts a pattern, double-quoted string, or transliteration. This
1157 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1158 processing a pattern (PL_lex_inpat is true), a transliteration
1159 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1161 Returns a pointer to the character scanned up to. Iff this is
1162 advanced from the start pointer supplied (ie if anything was
1163 successfully parsed), will leave an OP for the substring scanned
1164 in yylval. Caller must intuit reason for not parsing further
1165 by looking at the next characters herself.
1169 double-quoted style: \r and \n
1170 regexp special ones: \D \s
1172 backrefs: \1 (deprecated in substitution replacements)
1173 case and quoting: \U \Q \E
1174 stops on @ and $, but not for $ as tail anchor
1176 In transliterations:
1177 characters are VERY literal, except for - not at the start or end
1178 of the string, which indicates a range. scan_const expands the
1179 range to the full set of intermediate characters.
1181 In double-quoted strings:
1183 double-quoted style: \r and \n
1185 backrefs: \1 (deprecated)
1186 case and quoting: \U \Q \E
1189 scan_const does *not* construct ops to handle interpolated strings.
1190 It stops processing as soon as it finds an embedded $ or @ variable
1191 and leaves it to the caller to work out what's going on.
1193 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1195 $ in pattern could be $foo or could be tail anchor. Assumption:
1196 it's a tail anchor if $ is the last thing in the string, or if it's
1197 followed by one of ")| \n\t"
1199 \1 (backreferences) are turned into $1
1201 The structure of the code is
1202 while (there's a character to process) {
1203 handle transliteration ranges
1204 skip regexp comments
1205 skip # initiated comments in //x patterns
1206 check for embedded @foo
1207 check for embedded scalars
1209 leave intact backslashes from leave (below)
1210 deprecate \1 in strings and sub replacements
1211 handle string-changing backslashes \l \U \Q \E, etc.
1212 switch (what was escaped) {
1213 handle - in a transliteration (becomes a literal -)
1214 handle \132 octal characters
1215 handle 0x15 hex characters
1216 handle \cV (control V)
1217 handle printf backslashes (\f, \r, \n, etc)
1219 } (end if backslash)
1220 } (end while character to read)
1225 S_scan_const(pTHX_ char *start)
1227 register char *send = PL_bufend; /* end of the constant */
1228 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1229 register char *s = start; /* start of the constant */
1230 register char *d = SvPVX(sv); /* destination for copies */
1231 bool dorange = FALSE; /* are we in a translit range? */
1232 bool didrange = FALSE; /* did we just finish a range? */
1233 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1234 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1237 const char *leaveit = /* set of acceptably-backslashed characters */
1239 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1242 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1243 /* If we are doing a trans and we know we want UTF8 set expectation */
1244 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1245 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1249 while (s < send || dorange) {
1250 /* get transliterations out of the way (they're most literal) */
1251 if (PL_lex_inwhat == OP_TRANS) {
1252 /* expand a range A-Z to the full set of characters. AIE! */
1254 I32 i; /* current expanded character */
1255 I32 min; /* first character in range */
1256 I32 max; /* last character in range */
1259 char *c = (char*)utf8_hop((U8*)d, -1);
1263 *c = (char)UTF_TO_NATIVE(0xff);
1264 /* mark the range as done, and continue */
1270 i = d - SvPVX(sv); /* remember current offset */
1271 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1272 d = SvPVX(sv) + i; /* refresh d after realloc */
1273 d -= 2; /* eat the first char and the - */
1275 min = (U8)*d; /* first char in range */
1276 max = (U8)d[1]; /* last char in range */
1280 "Invalid range \"%c-%c\" in transliteration operator",
1281 (char)min, (char)max);
1285 if ((isLOWER(min) && isLOWER(max)) ||
1286 (isUPPER(min) && isUPPER(max))) {
1288 for (i = min; i <= max; i++)
1290 *d++ = NATIVE_TO_NEED(has_utf8,i);
1292 for (i = min; i <= max; i++)
1294 *d++ = NATIVE_TO_NEED(has_utf8,i);
1299 for (i = min; i <= max; i++)
1302 /* mark the range as done, and continue */
1308 /* range begins (ignore - as first or last char) */
1309 else if (*s == '-' && s+1 < send && s != start) {
1311 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1314 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1326 /* if we get here, we're not doing a transliteration */
1328 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1329 except for the last char, which will be done separately. */
1330 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1332 while (s+1 < send && *s != ')')
1333 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1335 else if (s[2] == '{' /* This should match regcomp.c */
1336 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1339 char *regparse = s + (s[2] == '{' ? 3 : 4);
1342 while (count && (c = *regparse)) {
1343 if (c == '\\' && regparse[1])
1351 if (*regparse != ')')
1352 regparse--; /* Leave one char for continuation. */
1353 while (s < regparse)
1354 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1358 /* likewise skip #-initiated comments in //x patterns */
1359 else if (*s == '#' && PL_lex_inpat &&
1360 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1361 while (s+1 < send && *s != '\n')
1362 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1365 /* check for embedded arrays
1366 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1368 else if (*s == '@' && s[1]
1369 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1372 /* check for embedded scalars. only stop if we're sure it's a
1375 else if (*s == '$') {
1376 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1378 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1379 break; /* in regexp, $ might be tail anchor */
1382 /* End of else if chain - OP_TRANS rejoin rest */
1385 if (*s == '\\' && s+1 < send) {
1388 /* some backslashes we leave behind */
1389 if (*leaveit && *s && strchr(leaveit, *s)) {
1390 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1391 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1395 /* deprecate \1 in strings and substitution replacements */
1396 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1397 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1399 if (ckWARN(WARN_SYNTAX))
1400 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1405 /* string-change backslash escapes */
1406 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1411 /* if we get here, it's either a quoted -, or a digit */
1414 /* quoted - in transliterations */
1416 if (PL_lex_inwhat == OP_TRANS) {
1423 if (ckWARN(WARN_MISC) &&
1426 Perl_warner(aTHX_ packWARN(WARN_MISC),
1427 "Unrecognized escape \\%c passed through",
1429 /* default action is to copy the quoted character */
1430 goto default_action;
1433 /* \132 indicates an octal constant */
1434 case '0': case '1': case '2': case '3':
1435 case '4': case '5': case '6': case '7':
1439 uv = grok_oct(s, &len, &flags, NULL);
1442 goto NUM_ESCAPE_INSERT;
1444 /* \x24 indicates a hex constant */
1448 char* e = strchr(s, '}');
1449 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1450 PERL_SCAN_DISALLOW_PREFIX;
1455 yyerror("Missing right brace on \\x{}");
1459 uv = grok_hex(s, &len, &flags, NULL);
1465 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1466 uv = grok_hex(s, &len, &flags, NULL);
1472 /* Insert oct or hex escaped character.
1473 * There will always enough room in sv since such
1474 * escapes will be longer than any UTF-8 sequence
1475 * they can end up as. */
1477 /* We need to map to chars to ASCII before doing the tests
1480 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1481 if (!has_utf8 && uv > 255) {
1482 /* Might need to recode whatever we have
1483 * accumulated so far if it contains any
1486 * (Can't we keep track of that and avoid
1487 * this rescan? --jhi)
1491 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1492 if (!NATIVE_IS_INVARIANT(*c)) {
1497 STRLEN offset = d - SvPVX(sv);
1499 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1503 while (src >= (U8 *)SvPVX(sv)) {
1504 if (!NATIVE_IS_INVARIANT(*src)) {
1505 U8 ch = NATIVE_TO_ASCII(*src);
1506 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1507 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1517 if (has_utf8 || uv > 255) {
1518 d = (char*)uvchr_to_utf8((U8*)d, uv);
1520 if (PL_lex_inwhat == OP_TRANS &&
1521 PL_sublex_info.sub_op) {
1522 PL_sublex_info.sub_op->op_private |=
1523 (PL_lex_repl ? OPpTRANS_FROM_UTF
1536 /* \N{LATIN SMALL LETTER A} is a named character */
1540 char* e = strchr(s, '}');
1546 yyerror("Missing right brace on \\N{}");
1550 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1552 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1553 PERL_SCAN_DISALLOW_PREFIX;
1556 uv = grok_hex(s, &len, &flags, NULL);
1558 goto NUM_ESCAPE_INSERT;
1560 res = newSVpvn(s + 1, e - s - 1);
1561 res = new_constant( Nullch, 0, "charnames",
1562 res, Nullsv, "\\N{...}" );
1564 sv_utf8_upgrade(res);
1565 str = SvPV(res,len);
1566 #ifdef EBCDIC_NEVER_MIND
1567 /* charnames uses pack U and that has been
1568 * recently changed to do the below uni->native
1569 * mapping, so this would be redundant (and wrong,
1570 * the code point would be doubly converted).
1571 * But leave this in just in case the pack U change
1572 * gets revoked, but the semantics is still
1573 * desireable for charnames. --jhi */
1575 UV uv = utf8_to_uvchr((U8*)str, 0);
1578 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1580 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1581 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1582 str = SvPV(res, len);
1586 if (!has_utf8 && SvUTF8(res)) {
1587 char *ostart = SvPVX(sv);
1588 SvCUR_set(sv, d - ostart);
1591 sv_utf8_upgrade(sv);
1592 /* this just broke our allocation above... */
1593 SvGROW(sv, (STRLEN)(send - start));
1594 d = SvPVX(sv) + SvCUR(sv);
1597 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1598 char *odest = SvPVX(sv);
1600 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1601 d = SvPVX(sv) + (d - odest);
1603 Copy(str, d, len, char);
1610 yyerror("Missing braces on \\N{}");
1613 /* \c is a control character */
1622 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1625 yyerror("Missing control char name in \\c");
1629 /* printf-style backslashes, formfeeds, newlines, etc */
1631 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1634 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1637 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1640 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1643 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1646 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1649 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1655 } /* end if (backslash) */
1658 /* If we started with encoded form, or already know we want it
1659 and then encode the next character */
1660 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1662 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1663 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1666 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1667 STRLEN off = d - SvPVX(sv);
1668 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1670 d = (char*)uvchr_to_utf8((U8*)d, uv);
1674 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1676 } /* while loop to process each character */
1678 /* terminate the string and set up the sv */
1680 SvCUR_set(sv, d - SvPVX(sv));
1681 if (SvCUR(sv) >= SvLEN(sv))
1682 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1685 if (PL_encoding && !has_utf8) {
1686 sv_recode_to_utf8(sv, PL_encoding);
1692 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1693 PL_sublex_info.sub_op->op_private |=
1694 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1698 /* shrink the sv if we allocated more than we used */
1699 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1700 SvLEN_set(sv, SvCUR(sv) + 1);
1701 Renew(SvPVX(sv), SvLEN(sv), char);
1704 /* return the substring (via yylval) only if we parsed anything */
1705 if (s > PL_bufptr) {
1706 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1707 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1709 ( PL_lex_inwhat == OP_TRANS
1711 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1714 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1721 * Returns TRUE if there's more to the expression (e.g., a subscript),
1724 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1726 * ->[ and ->{ return TRUE
1727 * { and [ outside a pattern are always subscripts, so return TRUE
1728 * if we're outside a pattern and it's not { or [, then return FALSE
1729 * if we're in a pattern and the first char is a {
1730 * {4,5} (any digits around the comma) returns FALSE
1731 * if we're in a pattern and the first char is a [
1733 * [SOMETHING] has a funky algorithm to decide whether it's a
1734 * character class or not. It has to deal with things like
1735 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1736 * anything else returns TRUE
1739 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1742 S_intuit_more(pTHX_ register char *s)
1744 if (PL_lex_brackets)
1746 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1748 if (*s != '{' && *s != '[')
1753 /* In a pattern, so maybe we have {n,m}. */
1770 /* On the other hand, maybe we have a character class */
1773 if (*s == ']' || *s == '^')
1776 /* this is terrifying, and it works */
1777 int weight = 2; /* let's weigh the evidence */
1779 unsigned char un_char = 255, last_un_char;
1780 char *send = strchr(s,']');
1781 char tmpbuf[sizeof PL_tokenbuf * 4];
1783 if (!send) /* has to be an expression */
1786 Zero(seen,256,char);
1789 else if (isDIGIT(*s)) {
1791 if (isDIGIT(s[1]) && s[2] == ']')
1797 for (; s < send; s++) {
1798 last_un_char = un_char;
1799 un_char = (unsigned char)*s;
1804 weight -= seen[un_char] * 10;
1805 if (isALNUM_lazy_if(s+1,UTF)) {
1806 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1807 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1812 else if (*s == '$' && s[1] &&
1813 strchr("[#!%*<>()-=",s[1])) {
1814 if (/*{*/ strchr("])} =",s[2]))
1823 if (strchr("wds]",s[1]))
1825 else if (seen['\''] || seen['"'])
1827 else if (strchr("rnftbxcav",s[1]))
1829 else if (isDIGIT(s[1])) {
1831 while (s[1] && isDIGIT(s[1]))
1841 if (strchr("aA01! ",last_un_char))
1843 if (strchr("zZ79~",s[1]))
1845 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1846 weight -= 5; /* cope with negative subscript */
1849 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1850 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1855 if (keyword(tmpbuf, d - tmpbuf))
1858 if (un_char == last_un_char + 1)
1860 weight -= seen[un_char];
1865 if (weight >= 0) /* probably a character class */
1875 * Does all the checking to disambiguate
1877 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1878 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1880 * First argument is the stuff after the first token, e.g. "bar".
1882 * Not a method if bar is a filehandle.
1883 * Not a method if foo is a subroutine prototyped to take a filehandle.
1884 * Not a method if it's really "Foo $bar"
1885 * Method if it's "foo $bar"
1886 * Not a method if it's really "print foo $bar"
1887 * Method if it's really "foo package::" (interpreted as package->foo)
1888 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1889 * Not a method if bar is a filehandle or package, but is quoted with
1894 S_intuit_method(pTHX_ char *start, GV *gv)
1896 char *s = start + (*start == '$');
1897 char tmpbuf[sizeof PL_tokenbuf];
1905 if ((cv = GvCVu(gv))) {
1906 char *proto = SvPVX(cv);
1916 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1917 /* start is the beginning of the possible filehandle/object,
1918 * and s is the end of it
1919 * tmpbuf is a copy of it
1922 if (*start == '$') {
1923 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1928 return *s == '(' ? FUNCMETH : METHOD;
1930 if (!keyword(tmpbuf, len)) {
1931 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1936 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1937 if (indirgv && GvCVu(indirgv))
1939 /* filehandle or package name makes it a method */
1940 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1942 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1943 return 0; /* no assumptions -- "=>" quotes bearword */
1945 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1946 newSVpvn(tmpbuf,len));
1947 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1951 return *s == '(' ? FUNCMETH : METHOD;
1959 * Return a string of Perl code to load the debugger. If PERL5DB
1960 * is set, it will return the contents of that, otherwise a
1961 * compile-time require of perl5db.pl.
1968 char *pdb = PerlEnv_getenv("PERL5DB");
1972 SETERRNO(0,SS_NORMAL);
1973 return "BEGIN { require 'perl5db.pl' }";
1979 /* Encoded script support. filter_add() effectively inserts a
1980 * 'pre-processing' function into the current source input stream.
1981 * Note that the filter function only applies to the current source file
1982 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1984 * The datasv parameter (which may be NULL) can be used to pass
1985 * private data to this instance of the filter. The filter function
1986 * can recover the SV using the FILTER_DATA macro and use it to
1987 * store private buffers and state information.
1989 * The supplied datasv parameter is upgraded to a PVIO type
1990 * and the IoDIRP/IoANY field is used to store the function pointer,
1991 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1992 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1993 * private use must be set using malloc'd pointers.
1997 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
2002 if (!PL_rsfp_filters)
2003 PL_rsfp_filters = newAV();
2005 datasv = NEWSV(255,0);
2006 if (!SvUPGRADE(datasv, SVt_PVIO))
2007 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2008 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2009 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2010 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2011 (void*)funcp, SvPV_nolen(datasv)));
2012 av_unshift(PL_rsfp_filters, 1);
2013 av_store(PL_rsfp_filters, 0, datasv) ;
2018 /* Delete most recently added instance of this filter function. */
2020 Perl_filter_del(pTHX_ filter_t funcp)
2023 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2024 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2026 /* if filter is on top of stack (usual case) just pop it off */
2027 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2028 if (IoANY(datasv) == (void *)funcp) {
2029 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2030 IoANY(datasv) = (void *)NULL;
2031 sv_free(av_pop(PL_rsfp_filters));
2035 /* we need to search for the correct entry and clear it */
2036 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2040 /* Invoke the n'th filter function for the current rsfp. */
2042 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2045 /* 0 = read one text line */
2050 if (!PL_rsfp_filters)
2052 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2053 /* Provide a default input filter to make life easy. */
2054 /* Note that we append to the line. This is handy. */
2055 DEBUG_P(PerlIO_printf(Perl_debug_log,
2056 "filter_read %d: from rsfp\n", idx));
2060 int old_len = SvCUR(buf_sv) ;
2062 /* ensure buf_sv is large enough */
2063 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2064 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2065 if (PerlIO_error(PL_rsfp))
2066 return -1; /* error */
2068 return 0 ; /* end of file */
2070 SvCUR_set(buf_sv, old_len + len) ;
2073 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2074 if (PerlIO_error(PL_rsfp))
2075 return -1; /* error */
2077 return 0 ; /* end of file */
2080 return SvCUR(buf_sv);
2082 /* Skip this filter slot if filter has been deleted */
2083 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2084 DEBUG_P(PerlIO_printf(Perl_debug_log,
2085 "filter_read %d: skipped (filter deleted)\n",
2087 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2089 /* Get function pointer hidden within datasv */
2090 funcp = (filter_t)IoANY(datasv);
2091 DEBUG_P(PerlIO_printf(Perl_debug_log,
2092 "filter_read %d: via function %p (%s)\n",
2093 idx, (void*)funcp, SvPV_nolen(datasv)));
2094 /* Call function. The function is expected to */
2095 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2096 /* Return: <0:error, =0:eof, >0:not eof */
2097 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2101 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2103 #ifdef PERL_CR_FILTER
2104 if (!PL_rsfp_filters) {
2105 filter_add(S_cr_textfilter,NULL);
2108 if (PL_rsfp_filters) {
2111 SvCUR_set(sv, 0); /* start with empty line */
2112 if (FILTER_READ(0, sv, 0) > 0)
2113 return ( SvPVX(sv) ) ;
2118 return (sv_gets(sv, fp, append));
2122 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2126 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2130 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2131 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2133 return GvHV(gv); /* Foo:: */
2136 /* use constant CLASS => 'MyClass' */
2137 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2139 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2140 pkgname = SvPV_nolen(sv);
2144 return gv_stashpv(pkgname, FALSE);
2148 static char* exp_name[] =
2149 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2150 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
2157 Works out what to call the token just pulled out of the input
2158 stream. The yacc parser takes care of taking the ops we return and
2159 stitching them into a tree.
2165 if read an identifier
2166 if we're in a my declaration
2167 croak if they tried to say my($foo::bar)
2168 build the ops for a my() declaration
2169 if it's an access to a my() variable
2170 are we in a sort block?
2171 croak if my($a); $a <=> $b
2172 build ops for access to a my() variable
2173 if in a dq string, and they've said @foo and we can't find @foo
2175 build ops for a bareword
2176 if we already built the token before, use it.
2179 #ifdef USE_PURE_BISON
2181 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2186 yylval_pointer[yyactlevel] = lvalp;
2187 yychar_pointer[yyactlevel] = lcharp;
2188 if (yyactlevel >= YYMAXLEVEL)
2189 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2191 r = Perl_yylex(aTHX);
2201 #pragma segment Perl_yylex
2213 I32 orig_keyword = 0;
2215 /* check if there's an identifier for us to look at */
2216 if (PL_pending_ident)
2217 return S_pending_ident(aTHX);
2219 /* no identifier pending identification */
2221 switch (PL_lex_state) {
2223 case LEX_NORMAL: /* Some compilers will produce faster */
2224 case LEX_INTERPNORMAL: /* code if we comment these out. */
2228 /* when we've already built the next token, just pull it out of the queue */
2231 yylval = PL_nextval[PL_nexttoke];
2233 PL_lex_state = PL_lex_defer;
2234 PL_expect = PL_lex_expect;
2235 PL_lex_defer = LEX_NORMAL;
2237 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2238 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2239 (IV)PL_nexttype[PL_nexttoke]); });
2241 return(PL_nexttype[PL_nexttoke]);
2243 /* interpolated case modifiers like \L \U, including \Q and \E.
2244 when we get here, PL_bufptr is at the \
2246 case LEX_INTERPCASEMOD:
2248 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2249 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2251 /* handle \E or end of string */
2252 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2256 if (PL_lex_casemods) {
2257 oldmod = PL_lex_casestack[--PL_lex_casemods];
2258 PL_lex_casestack[PL_lex_casemods] = '\0';
2260 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2262 PL_lex_state = LEX_INTERPCONCAT;
2266 if (PL_bufptr != PL_bufend)
2268 PL_lex_state = LEX_INTERPCONCAT;
2272 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2273 "### Saw case modifier at '%s'\n", PL_bufptr); });
2275 if (s[1] == '\\' && s[2] == 'E') {
2277 PL_lex_state = LEX_INTERPCONCAT;
2281 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2282 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2283 if (strchr("LU", *s) &&
2284 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2285 PL_lex_casestack[--PL_lex_casemods] = '\0';
2288 if (PL_lex_casemods > 10)
2289 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2290 PL_lex_casestack[PL_lex_casemods++] = *s;
2291 PL_lex_casestack[PL_lex_casemods] = '\0';
2292 PL_lex_state = LEX_INTERPCONCAT;
2293 PL_nextval[PL_nexttoke].ival = 0;
2296 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2298 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2300 PL_nextval[PL_nexttoke].ival = OP_LC;
2302 PL_nextval[PL_nexttoke].ival = OP_UC;
2304 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2306 Perl_croak(aTHX_ "panic: yylex");
2310 if (PL_lex_starts) {
2319 case LEX_INTERPPUSH:
2320 return sublex_push();
2322 case LEX_INTERPSTART:
2323 if (PL_bufptr == PL_bufend)
2324 return sublex_done();
2325 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2326 "### Interpolated variable at '%s'\n", PL_bufptr); });
2328 PL_lex_dojoin = (*PL_bufptr == '@');
2329 PL_lex_state = LEX_INTERPNORMAL;
2330 if (PL_lex_dojoin) {
2331 PL_nextval[PL_nexttoke].ival = 0;
2333 force_ident("\"", '$');
2334 PL_nextval[PL_nexttoke].ival = 0;
2336 PL_nextval[PL_nexttoke].ival = 0;
2338 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2341 if (PL_lex_starts++) {
2347 case LEX_INTERPENDMAYBE:
2348 if (intuit_more(PL_bufptr)) {
2349 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2355 if (PL_lex_dojoin) {
2356 PL_lex_dojoin = FALSE;
2357 PL_lex_state = LEX_INTERPCONCAT;
2360 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2361 && SvEVALED(PL_lex_repl))
2363 if (PL_bufptr != PL_bufend)
2364 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2365 PL_lex_repl = Nullsv;
2368 case LEX_INTERPCONCAT:
2370 if (PL_lex_brackets)
2371 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2373 if (PL_bufptr == PL_bufend)
2374 return sublex_done();
2376 if (SvIVX(PL_linestr) == '\'') {
2377 SV *sv = newSVsv(PL_linestr);
2380 else if ( PL_hints & HINT_NEW_RE )
2381 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2382 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2386 s = scan_const(PL_bufptr);
2388 PL_lex_state = LEX_INTERPCASEMOD;
2390 PL_lex_state = LEX_INTERPSTART;
2393 if (s != PL_bufptr) {
2394 PL_nextval[PL_nexttoke] = yylval;
2397 if (PL_lex_starts++)
2407 PL_lex_state = LEX_NORMAL;
2408 s = scan_formline(PL_bufptr);
2409 if (!PL_lex_formbrack)
2415 PL_oldoldbufptr = PL_oldbufptr;
2418 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2419 exp_name[PL_expect], s);
2425 if (isIDFIRST_lazy_if(s,UTF))
2427 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2430 goto fake_eof; /* emulate EOF on ^D or ^Z */
2435 if (PL_lex_brackets) {
2436 if (PL_lex_formbrack)
2437 yyerror("Format not terminated");
2439 yyerror("Missing right curly or square bracket");
2441 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2442 "### Tokener got EOF\n");
2446 if (s++ < PL_bufend)
2447 goto retry; /* ignore stray nulls */
2450 if (!PL_in_eval && !PL_preambled) {
2451 PL_preambled = TRUE;
2452 sv_setpv(PL_linestr,incl_perldb());
2453 if (SvCUR(PL_linestr))
2454 sv_catpv(PL_linestr,";");
2456 while(AvFILLp(PL_preambleav) >= 0) {
2457 SV *tmpsv = av_shift(PL_preambleav);
2458 sv_catsv(PL_linestr, tmpsv);
2459 sv_catpv(PL_linestr, ";");
2462 sv_free((SV*)PL_preambleav);
2463 PL_preambleav = NULL;
2465 if (PL_minus_n || PL_minus_p) {
2466 sv_catpv(PL_linestr, "LINE: while (<>) {");
2468 sv_catpv(PL_linestr,"chomp;");
2471 if (strchr("/'\"", *PL_splitstr)
2472 && strchr(PL_splitstr + 1, *PL_splitstr))
2473 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2476 s = "'~#\200\1'"; /* surely one char is unused...*/
2477 while (s[1] && strchr(PL_splitstr, *s)) s++;
2479 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2480 "q" + (delim == '\''), delim);
2481 for (s = PL_splitstr; *s; s++) {
2483 sv_catpvn(PL_linestr, "\\", 1);
2484 sv_catpvn(PL_linestr, s, 1);
2486 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2490 sv_catpv(PL_linestr,"our @F=split(' ');");
2493 sv_catpv(PL_linestr, "\n");
2494 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2495 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2496 PL_last_lop = PL_last_uni = Nullch;
2497 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2498 SV *sv = NEWSV(85,0);
2500 sv_upgrade(sv, SVt_PVMG);
2501 sv_setsv(sv,PL_linestr);
2504 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2509 bof = PL_rsfp ? TRUE : FALSE;
2510 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2513 if (PL_preprocess && !PL_in_eval)
2514 (void)PerlProc_pclose(PL_rsfp);
2515 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2516 PerlIO_clearerr(PL_rsfp);
2518 (void)PerlIO_close(PL_rsfp);
2520 PL_doextract = FALSE;
2522 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2523 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2524 sv_catpv(PL_linestr,";}");
2525 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2526 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2527 PL_last_lop = PL_last_uni = Nullch;
2528 PL_minus_n = PL_minus_p = 0;
2531 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2532 PL_last_lop = PL_last_uni = Nullch;
2533 sv_setpv(PL_linestr,"");
2534 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2536 /* if it looks like the start of a BOM, check if it in fact is */
2537 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2538 #ifdef PERLIO_IS_STDIO
2539 # ifdef __GNU_LIBRARY__
2540 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2541 # define FTELL_FOR_PIPE_IS_BROKEN
2545 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2546 # define FTELL_FOR_PIPE_IS_BROKEN
2551 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2552 /* This loses the possibility to detect the bof
2553 * situation on perl -P when the libc5 is being used.
2554 * Workaround? Maybe attach some extra state to PL_rsfp?
2557 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2559 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2562 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2563 s = swallow_bom((U8*)s);
2567 /* Incest with pod. */
2568 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2569 sv_setpv(PL_linestr, "");
2570 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2571 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2572 PL_last_lop = PL_last_uni = Nullch;
2573 PL_doextract = FALSE;
2577 } while (PL_doextract);
2578 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2579 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2580 SV *sv = NEWSV(85,0);
2582 sv_upgrade(sv, SVt_PVMG);
2583 sv_setsv(sv,PL_linestr);
2586 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2588 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2589 PL_last_lop = PL_last_uni = Nullch;
2590 if (CopLINE(PL_curcop) == 1) {
2591 while (s < PL_bufend && isSPACE(*s))
2593 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2597 if (*s == '#' && *(s+1) == '!')
2599 #ifdef ALTERNATE_SHEBANG
2601 static char as[] = ALTERNATE_SHEBANG;
2602 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2603 d = s + (sizeof(as) - 1);
2605 #endif /* ALTERNATE_SHEBANG */
2614 while (*d && !isSPACE(*d))
2618 #ifdef ARG_ZERO_IS_SCRIPT
2619 if (ipathend > ipath) {
2621 * HP-UX (at least) sets argv[0] to the script name,
2622 * which makes $^X incorrect. And Digital UNIX and Linux,
2623 * at least, set argv[0] to the basename of the Perl
2624 * interpreter. So, having found "#!", we'll set it right.
2626 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2627 assert(SvPOK(x) || SvGMAGICAL(x));
2628 if (sv_eq(x, CopFILESV(PL_curcop))) {
2629 sv_setpvn(x, ipath, ipathend - ipath);
2635 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2636 char *lstart = SvPV(x,llen);
2638 bstart += blen - llen;
2639 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2640 sv_setpvn(x, ipath, ipathend - ipath);
2645 TAINT_NOT; /* $^X is always tainted, but that's OK */
2647 #endif /* ARG_ZERO_IS_SCRIPT */
2652 d = instr(s,"perl -");
2654 d = instr(s,"perl");
2656 /* avoid getting into infinite loops when shebang
2657 * line contains "Perl" rather than "perl" */
2659 for (d = ipathend-4; d >= ipath; --d) {
2660 if ((*d == 'p' || *d == 'P')
2661 && !ibcmp(d, "perl", 4))
2671 #ifdef ALTERNATE_SHEBANG
2673 * If the ALTERNATE_SHEBANG on this system starts with a
2674 * character that can be part of a Perl expression, then if
2675 * we see it but not "perl", we're probably looking at the
2676 * start of Perl code, not a request to hand off to some
2677 * other interpreter. Similarly, if "perl" is there, but
2678 * not in the first 'word' of the line, we assume the line
2679 * contains the start of the Perl program.
2681 if (d && *s != '#') {
2683 while (*c && !strchr("; \t\r\n\f\v#", *c))
2686 d = Nullch; /* "perl" not in first word; ignore */
2688 *s = '#'; /* Don't try to parse shebang line */
2690 #endif /* ALTERNATE_SHEBANG */
2691 #ifndef MACOS_TRADITIONAL
2696 !instr(s,"indir") &&
2697 instr(PL_origargv[0],"perl"))
2703 while (s < PL_bufend && isSPACE(*s))
2705 if (s < PL_bufend) {
2706 Newz(899,newargv,PL_origargc+3,char*);
2708 while (s < PL_bufend && !isSPACE(*s))
2711 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2714 newargv = PL_origargv;
2717 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2719 Perl_croak(aTHX_ "Can't exec %s", ipath);
2723 U32 oldpdb = PL_perldb;
2724 bool oldn = PL_minus_n;
2725 bool oldp = PL_minus_p;
2727 while (*d && !isSPACE(*d)) d++;
2728 while (SPACE_OR_TAB(*d)) d++;
2731 bool switches_done = PL_doswitches;
2733 if (*d == 'M' || *d == 'm') {
2735 while (*d && !isSPACE(*d)) d++;
2736 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2739 d = moreswitches(d);
2741 if (PL_doswitches && !switches_done) {
2742 int argc = PL_origargc;
2743 char **argv = PL_origargv;
2746 } while (argc && argv[0][0] == '-' && argv[0][1]);
2747 init_argv_symbols(argc,argv);
2749 if ((PERLDB_LINE && !oldpdb) ||
2750 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2751 /* if we have already added "LINE: while (<>) {",
2752 we must not do it again */
2754 sv_setpv(PL_linestr, "");
2755 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2756 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2757 PL_last_lop = PL_last_uni = Nullch;
2758 PL_preambled = FALSE;
2760 (void)gv_fetchfile(PL_origfilename);
2763 if (PL_doswitches && !switches_done) {
2764 int argc = PL_origargc;
2765 char **argv = PL_origargv;
2768 } while (argc && argv[0][0] == '-' && argv[0][1]);
2769 init_argv_symbols(argc,argv);
2775 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2777 PL_lex_state = LEX_FORMLINE;
2782 #ifdef PERL_STRICT_CR
2783 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2785 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2787 case ' ': case '\t': case '\f': case 013:
2788 #ifdef MACOS_TRADITIONAL
2795 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2796 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2797 /* handle eval qq[#line 1 "foo"\n ...] */
2798 CopLINE_dec(PL_curcop);
2802 while (s < d && *s != '\n')
2806 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2807 Perl_croak(aTHX_ "panic: input overflow");
2809 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2811 PL_lex_state = LEX_FORMLINE;
2821 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2828 while (s < PL_bufend && SPACE_OR_TAB(*s))
2831 if (strnEQ(s,"=>",2)) {
2832 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2833 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2834 "### Saw unary minus before =>, forcing word '%s'\n", s);
2836 OPERATOR('-'); /* unary minus */
2838 PL_last_uni = PL_oldbufptr;
2840 case 'r': ftst = OP_FTEREAD; break;
2841 case 'w': ftst = OP_FTEWRITE; break;
2842 case 'x': ftst = OP_FTEEXEC; break;
2843 case 'o': ftst = OP_FTEOWNED; break;
2844 case 'R': ftst = OP_FTRREAD; break;
2845 case 'W': ftst = OP_FTRWRITE; break;
2846 case 'X': ftst = OP_FTREXEC; break;
2847 case 'O': ftst = OP_FTROWNED; break;
2848 case 'e': ftst = OP_FTIS; break;
2849 case 'z': ftst = OP_FTZERO; break;
2850 case 's': ftst = OP_FTSIZE; break;
2851 case 'f': ftst = OP_FTFILE; break;
2852 case 'd': ftst = OP_FTDIR; break;
2853 case 'l': ftst = OP_FTLINK; break;
2854 case 'p': ftst = OP_FTPIPE; break;
2855 case 'S': ftst = OP_FTSOCK; break;
2856 case 'u': ftst = OP_FTSUID; break;
2857 case 'g': ftst = OP_FTSGID; break;
2858 case 'k': ftst = OP_FTSVTX; break;
2859 case 'b': ftst = OP_FTBLK; break;
2860 case 'c': ftst = OP_FTCHR; break;
2861 case 't': ftst = OP_FTTTY; break;
2862 case 'T': ftst = OP_FTTEXT; break;
2863 case 'B': ftst = OP_FTBINARY; break;
2864 case 'M': case 'A': case 'C':
2865 gv_fetchpv("\024",TRUE, SVt_PV);
2867 case 'M': ftst = OP_FTMTIME; break;
2868 case 'A': ftst = OP_FTATIME; break;
2869 case 'C': ftst = OP_FTCTIME; break;
2877 PL_last_lop_op = (OPCODE)ftst;
2878 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2879 "### Saw file test %c\n", (int)ftst);
2884 /* Assume it was a minus followed by a one-letter named
2885 * subroutine call (or a -bareword), then. */
2886 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2887 "### '-%c' looked like a file test but was not\n",
2896 if (PL_expect == XOPERATOR)
2901 else if (*s == '>') {
2904 if (isIDFIRST_lazy_if(s,UTF)) {
2905 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2913 if (PL_expect == XOPERATOR)
2916 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2918 OPERATOR('-'); /* unary minus */
2925 if (PL_expect == XOPERATOR)
2930 if (PL_expect == XOPERATOR)
2933 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2939 if (PL_expect != XOPERATOR) {
2940 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2941 PL_expect = XOPERATOR;
2942 force_ident(PL_tokenbuf, '*');
2955 if (PL_expect == XOPERATOR) {
2959 PL_tokenbuf[0] = '%';
2960 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2961 if (!PL_tokenbuf[1]) {
2964 PL_pending_ident = '%';
2983 switch (PL_expect) {
2986 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2988 PL_bufptr = s; /* update in case we back off */
2994 PL_expect = XTERMBLOCK;
2998 while (isIDFIRST_lazy_if(s,UTF)) {
2999 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3000 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3001 if (tmp < 0) tmp = -tmp;
3017 d = scan_str(d,TRUE,TRUE);
3019 /* MUST advance bufptr here to avoid bogus
3020 "at end of line" context messages from yyerror().
3022 PL_bufptr = s + len;
3023 yyerror("Unterminated attribute parameter in attribute list");
3026 return 0; /* EOF indicator */
3030 SV *sv = newSVpvn(s, len);
3031 sv_catsv(sv, PL_lex_stuff);
3032 attrs = append_elem(OP_LIST, attrs,
3033 newSVOP(OP_CONST, 0, sv));
3034 SvREFCNT_dec(PL_lex_stuff);
3035 PL_lex_stuff = Nullsv;
3038 if (len == 6 && strnEQ(s, "unique", len)) {
3039 if (PL_in_my == KEY_our)
3041 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3043 ; /* skip to avoid loading attributes.pm */
3046 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3049 /* NOTE: any CV attrs applied here need to be part of
3050 the CVf_BUILTIN_ATTRS define in cv.h! */
3051 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3052 CvLVALUE_on(PL_compcv);
3053 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3054 CvLOCKED_on(PL_compcv);
3055 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3056 CvMETHOD_on(PL_compcv);
3057 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3058 CvASSERTION_on(PL_compcv);
3059 /* After we've set the flags, it could be argued that
3060 we don't need to do the attributes.pm-based setting
3061 process, and shouldn't bother appending recognized
3062 flags. To experiment with that, uncomment the
3063 following "else". (Note that's already been
3064 uncommented. That keeps the above-applied built-in
3065 attributes from being intercepted (and possibly
3066 rejected) by a package's attribute routines, but is
3067 justified by the performance win for the common case
3068 of applying only built-in attributes.) */
3070 attrs = append_elem(OP_LIST, attrs,
3071 newSVOP(OP_CONST, 0,
3075 if (*s == ':' && s[1] != ':')
3078 break; /* require real whitespace or :'s */
3080 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3081 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3082 char q = ((*s == '\'') ? '"' : '\'');
3083 /* If here for an expression, and parsed no attrs, back off. */
3084 if (tmp == '=' && !attrs) {
3088 /* MUST advance bufptr here to avoid bogus "at end of line"
3089 context messages from yyerror().
3093 yyerror("Unterminated attribute list");
3095 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3103 PL_nextval[PL_nexttoke].opval = attrs;
3111 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3112 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3129 if (PL_lex_brackets <= 0)
3130 yyerror("Unmatched right square bracket");
3133 if (PL_lex_state == LEX_INTERPNORMAL) {
3134 if (PL_lex_brackets == 0) {
3135 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3136 PL_lex_state = LEX_INTERPEND;
3143 if (PL_lex_brackets > 100) {
3144 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3146 switch (PL_expect) {
3148 if (PL_lex_formbrack) {
3152 if (PL_oldoldbufptr == PL_last_lop)
3153 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3155 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3156 OPERATOR(HASHBRACK);
3158 while (s < PL_bufend && SPACE_OR_TAB(*s))
3161 PL_tokenbuf[0] = '\0';
3162 if (d < PL_bufend && *d == '-') {
3163 PL_tokenbuf[0] = '-';
3165 while (d < PL_bufend && SPACE_OR_TAB(*d))
3168 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3169 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3171 while (d < PL_bufend && SPACE_OR_TAB(*d))
3174 char minus = (PL_tokenbuf[0] == '-');
3175 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3183 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3188 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3193 if (PL_oldoldbufptr == PL_last_lop)
3194 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3196 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3199 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3201 /* This hack is to get the ${} in the message. */
3203 yyerror("syntax error");
3206 OPERATOR(HASHBRACK);
3208 /* This hack serves to disambiguate a pair of curlies
3209 * as being a block or an anon hash. Normally, expectation
3210 * determines that, but in cases where we're not in a
3211 * position to expect anything in particular (like inside
3212 * eval"") we have to resolve the ambiguity. This code
3213 * covers the case where the first term in the curlies is a
3214 * quoted string. Most other cases need to be explicitly
3215 * disambiguated by prepending a `+' before the opening
3216 * curly in order to force resolution as an anon hash.
3218 * XXX should probably propagate the outer expectation
3219 * into eval"" to rely less on this hack, but that could
3220 * potentially break current behavior of eval"".
3224 if (*s == '\'' || *s == '"' || *s == '`') {
3225 /* common case: get past first string, handling escapes */
3226 for (t++; t < PL_bufend && *t != *s;)
3227 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3231 else if (*s == 'q') {
3234 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3237 /* skip q//-like construct */
3239 char open, close, term;
3242 while (t < PL_bufend && isSPACE(*t))
3244 /* check for q => */
3245 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3246 OPERATOR(HASHBRACK);
3250 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3254 for (t++; t < PL_bufend; t++) {
3255 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3257 else if (*t == open)
3261 for (t++; t < PL_bufend; t++) {
3262 if (*t == '\\' && t+1 < PL_bufend)
3264 else if (*t == close && --brackets <= 0)
3266 else if (*t == open)
3273 /* skip plain q word */
3274 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3277 else if (isALNUM_lazy_if(t,UTF)) {
3279 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3282 while (t < PL_bufend && isSPACE(*t))
3284 /* if comma follows first term, call it an anon hash */
3285 /* XXX it could be a comma expression with loop modifiers */
3286 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3287 || (*t == '=' && t[1] == '>')))
3288 OPERATOR(HASHBRACK);
3289 if (PL_expect == XREF)
3292 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3298 yylval.ival = CopLINE(PL_curcop);
3299 if (isSPACE(*s) || *s == '#')
3300 PL_copline = NOLINE; /* invalidate current command line number */
3305 if (PL_lex_brackets <= 0)
3306 yyerror("Unmatched right curly bracket");
3308 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3309 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3310 PL_lex_formbrack = 0;
3311 if (PL_lex_state == LEX_INTERPNORMAL) {
3312 if (PL_lex_brackets == 0) {
3313 if (PL_expect & XFAKEBRACK) {
3314 PL_expect &= XENUMMASK;
3315 PL_lex_state = LEX_INTERPEND;
3317 return yylex(); /* ignore fake brackets */
3319 if (*s == '-' && s[1] == '>')
3320 PL_lex_state = LEX_INTERPENDMAYBE;
3321 else if (*s != '[' && *s != '{')
3322 PL_lex_state = LEX_INTERPEND;
3325 if (PL_expect & XFAKEBRACK) {
3326 PL_expect &= XENUMMASK;
3328 return yylex(); /* ignore fake brackets */
3338 if (PL_expect == XOPERATOR) {
3339 if (ckWARN(WARN_SEMICOLON)
3340 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3342 CopLINE_dec(PL_curcop);
3343 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3344 CopLINE_inc(PL_curcop);
3349 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3351 PL_expect = XOPERATOR;
3352 force_ident(PL_tokenbuf, '&');
3356 yylval.ival = (OPpENTERSUB_AMPER<<8);
3375 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3376 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3378 if (PL_expect == XSTATE && isALPHA(tmp) &&
3379 (s == PL_linestart+1 || s[-2] == '\n') )
3381 if (PL_in_eval && !PL_rsfp) {
3386 if (strnEQ(s,"=cut",4)) {
3400 PL_doextract = TRUE;
3403 if (PL_lex_brackets < PL_lex_formbrack) {
3405 #ifdef PERL_STRICT_CR
3406 for (t = s; SPACE_OR_TAB(*t); t++) ;
3408 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3410 if (*t == '\n' || *t == '#') {
3428 if (PL_expect != XOPERATOR) {
3429 if (s[1] != '<' && !strchr(s,'>'))
3432 s = scan_heredoc(s);
3434 s = scan_inputsymbol(s);
3435 TERM(sublex_start());
3440 SHop(OP_LEFT_SHIFT);
3454 SHop(OP_RIGHT_SHIFT);
3463 if (PL_expect == XOPERATOR) {
3464 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3467 return ','; /* grandfather non-comma-format format */
3471 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3472 PL_tokenbuf[0] = '@';
3473 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3474 sizeof PL_tokenbuf - 1, FALSE);
3475 if (PL_expect == XOPERATOR)
3476 no_op("Array length", s);
3477 if (!PL_tokenbuf[1])
3479 PL_expect = XOPERATOR;
3480 PL_pending_ident = '#';
3484 PL_tokenbuf[0] = '$';
3485 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3486 sizeof PL_tokenbuf - 1, FALSE);
3487 if (PL_expect == XOPERATOR)
3489 if (!PL_tokenbuf[1]) {
3491 yyerror("Final $ should be \\$ or $name");
3495 /* This kludge not intended to be bulletproof. */
3496 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3497 yylval.opval = newSVOP(OP_CONST, 0,
3498 newSViv(PL_compiling.cop_arybase));
3499 yylval.opval->op_private = OPpCONST_ARYBASE;
3505 if (PL_lex_state == LEX_NORMAL)
3508 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3511 PL_tokenbuf[0] = '@';
3512 if (ckWARN(WARN_SYNTAX)) {
3514 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3517 PL_bufptr = skipspace(PL_bufptr);
3518 while (t < PL_bufend && *t != ']')
3520 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3521 "Multidimensional syntax %.*s not supported",
3522 (t - PL_bufptr) + 1, PL_bufptr);
3526 else if (*s == '{') {
3527 PL_tokenbuf[0] = '%';
3528 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3529 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3531 char tmpbuf[sizeof PL_tokenbuf];
3533 for (t++; isSPACE(*t); t++) ;
3534 if (isIDFIRST_lazy_if(t,UTF)) {
3535 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3536 for (; isSPACE(*t); t++) ;
3537 if (*t == ';' && get_cv(tmpbuf, FALSE))
3538 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3539 "You need to quote \"%s\"", tmpbuf);
3545 PL_expect = XOPERATOR;
3546 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3547 bool islop = (PL_last_lop == PL_oldoldbufptr);
3548 if (!islop || PL_last_lop_op == OP_GREPSTART)
3549 PL_expect = XOPERATOR;
3550 else if (strchr("$@\"'`q", *s))
3551 PL_expect = XTERM; /* e.g. print $fh "foo" */
3552 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3553 PL_expect = XTERM; /* e.g. print $fh &sub */
3554 else if (isIDFIRST_lazy_if(s,UTF)) {
3555 char tmpbuf[sizeof PL_tokenbuf];
3556 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3557 if ((tmp = keyword(tmpbuf, len))) {
3558 /* binary operators exclude handle interpretations */
3570 PL_expect = XTERM; /* e.g. print $fh length() */
3575 PL_expect = XTERM; /* e.g. print $fh subr() */
3578 else if (isDIGIT(*s))
3579 PL_expect = XTERM; /* e.g. print $fh 3 */
3580 else if (*s == '.' && isDIGIT(s[1]))
3581 PL_expect = XTERM; /* e.g. print $fh .3 */
3582 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3583 PL_expect = XTERM; /* e.g. print $fh -1 */
3584 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3585 PL_expect = XTERM; /* e.g. print $fh /.../
3586 XXX except DORDOR operator */
3587 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3588 PL_expect = XTERM; /* print $fh <<"EOF" */
3590 PL_pending_ident = '$';
3594 if (PL_expect == XOPERATOR)
3596 PL_tokenbuf[0] = '@';
3597 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3598 if (!PL_tokenbuf[1]) {
3601 if (PL_lex_state == LEX_NORMAL)
3603 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3605 PL_tokenbuf[0] = '%';
3607 /* Warn about @ where they meant $. */
3608 if (ckWARN(WARN_SYNTAX)) {
3609 if (*s == '[' || *s == '{') {
3611 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3613 if (*t == '}' || *t == ']') {
3615 PL_bufptr = skipspace(PL_bufptr);
3616 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3617 "Scalar value %.*s better written as $%.*s",
3618 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3623 PL_pending_ident = '@';
3626 case '/': /* may be division, defined-or, or pattern */
3627 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3631 case '?': /* may either be conditional or pattern */
3632 if(PL_expect == XOPERATOR) {
3640 /* A // operator. */
3650 /* Disable warning on "study /blah/" */
3651 if (PL_oldoldbufptr == PL_last_uni
3652 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3653 || memNE(PL_last_uni, "study", 5)
3654 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3657 s = scan_pat(s,OP_MATCH);
3658 TERM(sublex_start());
3662 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3663 #ifdef PERL_STRICT_CR
3666 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3668 && (s == PL_linestart || s[-1] == '\n') )
3670 PL_lex_formbrack = 0;
3674 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3680 yylval.ival = OPf_SPECIAL;
3686 if (PL_expect != XOPERATOR)
3691 case '0': case '1': case '2': case '3': case '4':
3692 case '5': case '6': case '7': case '8': case '9':
3693 s = scan_num(s, &yylval);
3694 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3695 "### Saw number in '%s'\n", s);
3697 if (PL_expect == XOPERATOR)
3702 s = scan_str(s,FALSE,FALSE);
3703 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3704 "### Saw string before '%s'\n", s);
3706 if (PL_expect == XOPERATOR) {
3707 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3710 return ','; /* grandfather non-comma-format format */
3716 missingterm((char*)0);
3717 yylval.ival = OP_CONST;
3718 TERM(sublex_start());
3721 s = scan_str(s,FALSE,FALSE);
3722 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3723 "### Saw string before '%s'\n", s);
3725 if (PL_expect == XOPERATOR) {
3726 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3729 return ','; /* grandfather non-comma-format format */
3735 missingterm((char*)0);
3736 yylval.ival = OP_CONST;
3737 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3738 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3739 yylval.ival = OP_STRINGIFY;
3743 TERM(sublex_start());
3746 s = scan_str(s,FALSE,FALSE);
3747 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3748 "### Saw backtick string before '%s'\n", s);
3750 if (PL_expect == XOPERATOR)
3751 no_op("Backticks",s);
3753 missingterm((char*)0);
3754 yylval.ival = OP_BACKTICK;
3756 TERM(sublex_start());
3760 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3761 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3763 if (PL_expect == XOPERATOR)
3764 no_op("Backslash",s);
3768 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3772 while (isDIGIT(*start) || *start == '_')
3774 if (*start == '.' && isDIGIT(start[1])) {
3775 s = scan_num(s, &yylval);
3778 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3779 else if (!isALPHA(*start) && (PL_expect == XTERM
3780 || PL_expect == XREF || PL_expect == XSTATE
3781 || PL_expect == XTERMORDORDOR)) {
3785 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3788 s = scan_num(s, &yylval);
3795 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3835 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3837 /* Some keywords can be followed by any delimiter, including ':' */
3838 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3839 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3840 (PL_tokenbuf[0] == 'q' &&
3841 strchr("qwxr", PL_tokenbuf[1])))));
3843 /* x::* is just a word, unless x is "CORE" */
3844 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3848 while (d < PL_bufend && isSPACE(*d))
3849 d++; /* no comments skipped here, or s### is misparsed */
3851 /* Is this a label? */
3852 if (!tmp && PL_expect == XSTATE
3853 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3855 yylval.pval = savepv(PL_tokenbuf);
3860 /* Check for keywords */
3861 tmp = keyword(PL_tokenbuf, len);
3863 /* Is this a word before a => operator? */
3864 if (*d == '=' && d[1] == '>') {
3866 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3867 yylval.opval->op_private = OPpCONST_BARE;
3868 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3869 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3873 if (tmp < 0) { /* second-class keyword? */
3874 GV *ogv = Nullgv; /* override (winner) */
3875 GV *hgv = Nullgv; /* hidden (loser) */
3876 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3878 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3881 if (GvIMPORTED_CV(gv))
3883 else if (! CvMETHOD(cv))
3887 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3888 (gv = *gvp) != (GV*)&PL_sv_undef &&
3889 GvCVu(gv) && GvIMPORTED_CV(gv))
3896 tmp = 0; /* overridden by import or by GLOBAL */
3899 && -tmp==KEY_lock /* XXX generalizable kludge */
3901 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3903 tmp = 0; /* any sub overrides "weak" keyword */
3905 else { /* no override */
3907 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3908 Perl_warner(aTHX_ packWARN(WARN_MISC),
3909 "dump() better written as CORE::dump()");
3913 if (ckWARN(WARN_AMBIGUOUS) && hgv
3914 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3915 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3916 "Ambiguous call resolved as CORE::%s(), %s",
3917 GvENAME(hgv), "qualify as such or use &");
3924 default: /* not a keyword */
3928 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3930 /* Get the rest if it looks like a package qualifier */
3932 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3934 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3937 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3938 *s == '\'' ? "'" : "::");
3943 if (PL_expect == XOPERATOR) {
3944 if (PL_bufptr == PL_linestart) {
3945 CopLINE_dec(PL_curcop);
3946 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3947 CopLINE_inc(PL_curcop);
3950 no_op("Bareword",s);
3953 /* Look for a subroutine with this name in current package,
3954 unless name is "Foo::", in which case Foo is a bearword
3955 (and a package name). */
3958 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3960 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3961 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3962 "Bareword \"%s\" refers to nonexistent package",
3965 PL_tokenbuf[len] = '\0';
3972 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3975 /* if we saw a global override before, get the right name */
3978 sv = newSVpvn("CORE::GLOBAL::",14);
3979 sv_catpv(sv,PL_tokenbuf);
3982 sv = newSVpv(PL_tokenbuf,0);
3984 /* Presume this is going to be a bareword of some sort. */
3987 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3988 yylval.opval->op_private = OPpCONST_BARE;
3989 /* UTF-8 package name? */
3990 if (UTF && !IN_BYTES &&
3991 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3994 /* And if "Foo::", then that's what it certainly is. */
3999 /* See if it's the indirect object for a list operator. */
4001 if (PL_oldoldbufptr &&
4002 PL_oldoldbufptr < PL_bufptr &&
4003 (PL_oldoldbufptr == PL_last_lop
4004 || PL_oldoldbufptr == PL_last_uni) &&
4005 /* NO SKIPSPACE BEFORE HERE! */
4006 (PL_expect == XREF ||
4007 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4009 bool immediate_paren = *s == '(';
4011 /* (Now we can afford to cross potential line boundary.) */
4014 /* Two barewords in a row may indicate method call. */
4016 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4019 /* If not a declared subroutine, it's an indirect object. */
4020 /* (But it's an indir obj regardless for sort.) */
4022 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4023 ((!gv || !GvCVu(gv)) &&
4024 (PL_last_lop_op != OP_MAPSTART &&
4025 PL_last_lop_op != OP_GREPSTART))))
4027 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4032 PL_expect = XOPERATOR;
4035 /* Is this a word before a => operator? */
4036 if (*s == '=' && s[1] == '>' && !pkgname) {
4038 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4039 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4040 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4044 /* If followed by a paren, it's certainly a subroutine. */
4047 if (gv && GvCVu(gv)) {
4048 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4049 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4054 PL_nextval[PL_nexttoke].opval = yylval.opval;
4055 PL_expect = XOPERATOR;
4061 /* If followed by var or block, call it a method (unless sub) */
4063 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4064 PL_last_lop = PL_oldbufptr;
4065 PL_last_lop_op = OP_METHOD;
4069 /* If followed by a bareword, see if it looks like indir obj. */
4072 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4073 && (tmp = intuit_method(s,gv)))
4076 /* Not a method, so call it a subroutine (if defined) */
4078 if (gv && GvCVu(gv)) {
4080 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4081 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4082 "Ambiguous use of -%s resolved as -&%s()",
4083 PL_tokenbuf, PL_tokenbuf);
4084 /* Check for a constant sub */
4086 if ((sv = cv_const_sv(cv))) {
4088 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4089 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4090 yylval.opval->op_private = 0;
4094 /* Resolve to GV now. */
4095 op_free(yylval.opval);
4096 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4097 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4098 PL_last_lop = PL_oldbufptr;
4099 PL_last_lop_op = OP_ENTERSUB;
4100 /* Is there a prototype? */
4103 char *proto = SvPV((SV*)cv, len);
4106 if (strEQ(proto, "$"))
4108 while (*proto == ';')
4110 if (*proto == '&' && *s == '{') {
4111 sv_setpv(PL_subname, PL_curstash ?
4112 "__ANON__" : "__ANON__::__ANON__");
4116 PL_nextval[PL_nexttoke].opval = yylval.opval;
4122 /* Call it a bare word */
4124 if (PL_hints & HINT_STRICT_SUBS)
4125 yylval.opval->op_private |= OPpCONST_STRICT;
4128 if (ckWARN(WARN_RESERVED)) {
4129 if (lastchar != '-') {
4130 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4131 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4132 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4139 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4140 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4141 "Operator or semicolon missing before %c%s",
4142 lastchar, PL_tokenbuf);
4143 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4144 "Ambiguous use of %c resolved as operator %c",
4145 lastchar, lastchar);
4151 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4152 newSVpv(CopFILE(PL_curcop),0));
4156 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4157 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4160 case KEY___PACKAGE__:
4161 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4163 ? newSVsv(PL_curstname)
4172 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4173 char *pname = "main";
4174 if (PL_tokenbuf[2] == 'D')
4175 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4176 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4179 GvIOp(gv) = newIO();
4180 IoIFP(GvIOp(gv)) = PL_rsfp;
4181 #if defined(HAS_FCNTL) && defined(F_SETFD)
4183 int fd = PerlIO_fileno(PL_rsfp);
4184 fcntl(fd,F_SETFD,fd >= 3);
4187 /* Mark this internal pseudo-handle as clean */
4188 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4190 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4191 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4192 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4194 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4195 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4196 /* if the script was opened in binmode, we need to revert
4197 * it to text mode for compatibility; but only iff it has CRs
4198 * XXX this is a questionable hack at best. */
4199 if (PL_bufend-PL_bufptr > 2
4200 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4203 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4204 loc = PerlIO_tell(PL_rsfp);
4205 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4208 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4210 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4211 #endif /* NETWARE */
4212 #ifdef PERLIO_IS_STDIO /* really? */
4213 # if defined(__BORLANDC__)
4214 /* XXX see note in do_binmode() */
4215 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4219 PerlIO_seek(PL_rsfp, loc, 0);
4223 #ifdef PERLIO_LAYERS
4226 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4227 else if (PL_encoding) {
4234 XPUSHs(PL_encoding);
4236 call_method("name", G_SCALAR);
4240 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4241 Perl_form(aTHX_ ":encoding(%"SVf")",
4259 if (PL_expect == XSTATE) {
4266 if (*s == ':' && s[1] == ':') {
4269 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4270 if (!(tmp = keyword(PL_tokenbuf, len)))
4271 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4285 LOP(OP_ACCEPT,XTERM);
4291 LOP(OP_ATAN2,XTERM);
4297 LOP(OP_BINMODE,XTERM);
4300 LOP(OP_BLESS,XTERM);
4309 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4326 if (!PL_cryptseen) {
4327 PL_cryptseen = TRUE;
4331 LOP(OP_CRYPT,XTERM);
4334 LOP(OP_CHMOD,XTERM);
4337 LOP(OP_CHOWN,XTERM);
4340 LOP(OP_CONNECT,XTERM);
4356 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4360 PL_hints |= HINT_BLOCK_SCOPE;
4370 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4371 LOP(OP_DBMOPEN,XTERM);
4377 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4384 yylval.ival = CopLINE(PL_curcop);
4398 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4399 UNIBRACK(OP_ENTEREVAL);
4417 case KEY_endhostent:
4423 case KEY_endservent:
4426 case KEY_endprotoent:
4437 yylval.ival = CopLINE(PL_curcop);
4439 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4441 if ((PL_bufend - p) >= 3 &&
4442 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4444 else if ((PL_bufend - p) >= 4 &&
4445 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4448 if (isIDFIRST_lazy_if(p,UTF)) {
4449 p = scan_ident(p, PL_bufend,
4450 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4454 Perl_croak(aTHX_ "Missing $ on loop variable");
4459 LOP(OP_FORMLINE,XTERM);
4465 LOP(OP_FCNTL,XTERM);
4471 LOP(OP_FLOCK,XTERM);
4480 LOP(OP_GREPSTART, XREF);
4483 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4498 case KEY_getpriority:
4499 LOP(OP_GETPRIORITY,XTERM);
4501 case KEY_getprotobyname:
4504 case KEY_getprotobynumber:
4505 LOP(OP_GPBYNUMBER,XTERM);
4507 case KEY_getprotoent:
4519 case KEY_getpeername:
4520 UNI(OP_GETPEERNAME);
4522 case KEY_gethostbyname:
4525 case KEY_gethostbyaddr:
4526 LOP(OP_GHBYADDR,XTERM);
4528 case KEY_gethostent:
4531 case KEY_getnetbyname:
4534 case KEY_getnetbyaddr:
4535 LOP(OP_GNBYADDR,XTERM);
4540 case KEY_getservbyname:
4541 LOP(OP_GSBYNAME,XTERM);
4543 case KEY_getservbyport:
4544 LOP(OP_GSBYPORT,XTERM);
4546 case KEY_getservent:
4549 case KEY_getsockname:
4550 UNI(OP_GETSOCKNAME);
4552 case KEY_getsockopt:
4553 LOP(OP_GSOCKOPT,XTERM);
4575 yylval.ival = CopLINE(PL_curcop);
4579 LOP(OP_INDEX,XTERM);
4585 LOP(OP_IOCTL,XTERM);
4597 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4629 LOP(OP_LISTEN,XTERM);
4638 s = scan_pat(s,OP_MATCH);
4639 TERM(sublex_start());
4642 LOP(OP_MAPSTART, XREF);
4645 LOP(OP_MKDIR,XTERM);
4648 LOP(OP_MSGCTL,XTERM);
4651 LOP(OP_MSGGET,XTERM);
4654 LOP(OP_MSGRCV,XTERM);
4657 LOP(OP_MSGSND,XTERM);
4663 if (isIDFIRST_lazy_if(s,UTF)) {
4664 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4665 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4667 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4668 if (!PL_in_my_stash) {
4671 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4679 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4686 if (PL_expect != XSTATE)
4687 yyerror("\"no\" not allowed in expression");
4688 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4689 s = force_version(s, FALSE);
4694 if (*s == '(' || (s = skipspace(s), *s == '('))
4701 if (isIDFIRST_lazy_if(s,UTF)) {
4703 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4705 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4707 && !(t[0] == '=' && t[1] == '>')
4709 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4710 "Precedence problem: open %.*s should be open(%.*s)",
4711 d - s, s, d - s, s);
4717 yylval.ival = OP_OR;
4727 LOP(OP_OPEN_DIR,XTERM);
4730 checkcomma(s,PL_tokenbuf,"filehandle");
4734 checkcomma(s,PL_tokenbuf,"filehandle");
4753 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4757 LOP(OP_PIPE_OP,XTERM);
4760 s = scan_str(s,FALSE,FALSE);
4762 missingterm((char*)0);
4763 yylval.ival = OP_CONST;
4764 TERM(sublex_start());
4770 s = scan_str(s,FALSE,FALSE);
4772 missingterm((char*)0);
4774 if (SvCUR(PL_lex_stuff)) {
4777 d = SvPV_force(PL_lex_stuff, len);
4780 for (; isSPACE(*d) && len; --len, ++d) ;
4783 if (!warned && ckWARN(WARN_QW)) {
4784 for (; !isSPACE(*d) && len; --len, ++d) {
4786 Perl_warner(aTHX_ packWARN(WARN_QW),
4787 "Possible attempt to separate words with commas");
4790 else if (*d == '#') {
4791 Perl_warner(aTHX_ packWARN(WARN_QW),
4792 "Possible attempt to put comments in qw() list");
4798 for (; !isSPACE(*d) && len; --len, ++d) ;
4800 sv = newSVpvn(b, d-b);
4801 if (DO_UTF8(PL_lex_stuff))
4803 words = append_elem(OP_LIST, words,
4804 newSVOP(OP_CONST, 0, tokeq(sv)));
4808 PL_nextval[PL_nexttoke].opval = words;
4813 SvREFCNT_dec(PL_lex_stuff);
4814 PL_lex_stuff = Nullsv;
4820 s = scan_str(s,FALSE,FALSE);
4822 missingterm((char*)0);
4823 yylval.ival = OP_STRINGIFY;
4824 if (SvIVX(PL_lex_stuff) == '\'')
4825 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4826 TERM(sublex_start());
4829 s = scan_pat(s,OP_QR);
4830 TERM(sublex_start());
4833 s = scan_str(s,FALSE,FALSE);
4835 missingterm((char*)0);
4836 yylval.ival = OP_BACKTICK;
4838 TERM(sublex_start());
4846 s = force_version(s, FALSE);
4848 else if (*s != 'v' || !isDIGIT(s[1])
4849 || (s = force_version(s, TRUE), *s == 'v'))
4851 *PL_tokenbuf = '\0';
4852 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4853 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4854 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4856 yyerror("<> should be quotes");
4864 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4868 LOP(OP_RENAME,XTERM);
4877 LOP(OP_RINDEX,XTERM);
4887 UNIDOR(OP_READLINE);
4900 LOP(OP_REVERSE,XTERM);
4903 UNIDOR(OP_READLINK);
4911 TERM(sublex_start());
4913 TOKEN(1); /* force error */
4922 LOP(OP_SELECT,XTERM);
4928 LOP(OP_SEMCTL,XTERM);
4931 LOP(OP_SEMGET,XTERM);
4934 LOP(OP_SEMOP,XTERM);
4940 LOP(OP_SETPGRP,XTERM);
4942 case KEY_setpriority:
4943 LOP(OP_SETPRIORITY,XTERM);
4945 case KEY_sethostent:
4951 case KEY_setservent:
4954 case KEY_setprotoent:
4964 LOP(OP_SEEKDIR,XTERM);
4966 case KEY_setsockopt:
4967 LOP(OP_SSOCKOPT,XTERM);
4973 LOP(OP_SHMCTL,XTERM);
4976 LOP(OP_SHMGET,XTERM);
4979 LOP(OP_SHMREAD,XTERM);
4982 LOP(OP_SHMWRITE,XTERM);
4985 LOP(OP_SHUTDOWN,XTERM);
4994 LOP(OP_SOCKET,XTERM);
4996 case KEY_socketpair:
4997 LOP(OP_SOCKPAIR,XTERM);
5000 checkcomma(s,PL_tokenbuf,"subroutine name");
5002 if (*s == ';' || *s == ')') /* probably a close */
5003 Perl_croak(aTHX_ "sort is now a reserved word");
5005 s = force_word(s,WORD,TRUE,TRUE,FALSE);
5009 LOP(OP_SPLIT,XTERM);
5012 LOP(OP_SPRINTF,XTERM);
5015 LOP(OP_SPLICE,XTERM);
5030 LOP(OP_SUBSTR,XTERM);
5036 char tmpbuf[sizeof PL_tokenbuf];
5037 SSize_t tboffset = 0;
5038 expectation attrful;
5039 bool have_name, have_proto, bad_proto;
5044 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5045 (*s == ':' && s[1] == ':'))
5048 attrful = XATTRBLOCK;
5049 /* remember buffer pos'n for later force_word */
5050 tboffset = s - PL_oldbufptr;
5051 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5052 if (strchr(tmpbuf, ':'))
5053 sv_setpv(PL_subname, tmpbuf);
5055 sv_setsv(PL_subname,PL_curstname);
5056 sv_catpvn(PL_subname,"::",2);
5057 sv_catpvn(PL_subname,tmpbuf,len);
5064 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5065 PL_expect = XTERMBLOCK;
5066 attrful = XATTRTERM;
5067 sv_setpv(PL_subname,"?");
5071 if (key == KEY_format) {
5073 PL_lex_formbrack = PL_lex_brackets + 1;
5075 (void) force_word(PL_oldbufptr + tboffset, WORD,
5080 /* Look for a prototype */
5084 s = scan_str(s,FALSE,FALSE);
5086 Perl_croak(aTHX_ "Prototype not terminated");
5087 /* strip spaces and check for bad characters */
5088 d = SvPVX(PL_lex_stuff);
5091 for (p = d; *p; ++p) {
5094 if (!strchr("$@%*;[]&\\", *p))
5099 if (bad_proto && ckWARN(WARN_SYNTAX))
5100 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5101 "Illegal character in prototype for %"SVf" : %s",
5103 SvCUR(PL_lex_stuff) = tmp;
5111 if (*s == ':' && s[1] != ':')
5112 PL_expect = attrful;
5113 else if (!have_name && *s != '{' && key == KEY_sub)
5114 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5117 PL_nextval[PL_nexttoke].opval =
5118 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5119 PL_lex_stuff = Nullsv;
5123 sv_setpv(PL_subname,
5124 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5127 (void) force_word(PL_oldbufptr + tboffset, WORD,
5136 LOP(OP_SYSTEM,XREF);
5139 LOP(OP_SYMLINK,XTERM);
5142 LOP(OP_SYSCALL,XTERM);
5145 LOP(OP_SYSOPEN,XTERM);
5148 LOP(OP_SYSSEEK,XTERM);
5151 LOP(OP_SYSREAD,XTERM);
5154 LOP(OP_SYSWRITE,XTERM);
5158 TERM(sublex_start());
5179 LOP(OP_TRUNCATE,XTERM);
5191 yylval.ival = CopLINE(PL_curcop);
5195 yylval.ival = CopLINE(PL_curcop);
5199 LOP(OP_UNLINK,XTERM);
5205 LOP(OP_UNPACK,XTERM);
5208 LOP(OP_UTIME,XTERM);
5214 LOP(OP_UNSHIFT,XTERM);
5217 if (PL_expect != XSTATE)
5218 yyerror("\"use\" not allowed in expression");
5220 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5221 s = force_version(s, TRUE);
5222 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5223 PL_nextval[PL_nexttoke].opval = Nullop;
5226 else if (*s == 'v') {
5227 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5228 s = force_version(s, FALSE);
5232 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5233 s = force_version(s, FALSE);
5245 yylval.ival = CopLINE(PL_curcop);
5249 PL_hints |= HINT_BLOCK_SCOPE;
5256 LOP(OP_WAITPID,XTERM);
5265 ctl_l[0] = toCTRL('L');
5267 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5270 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5275 if (PL_expect == XOPERATOR)
5281 yylval.ival = OP_XOR;
5286 TERM(sublex_start());
5291 #pragma segment Main
5295 S_pending_ident(pTHX)
5298 register I32 tmp = 0;
5299 /* pit holds the identifier we read and pending_ident is reset */
5300 char pit = PL_pending_ident;
5301 PL_pending_ident = 0;
5303 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5304 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5306 /* if we're in a my(), we can't allow dynamics here.
5307 $foo'bar has already been turned into $foo::bar, so
5308 just check for colons.
5310 if it's a legal name, the OP is a PADANY.
5313 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5314 if (strchr(PL_tokenbuf,':'))
5315 yyerror(Perl_form(aTHX_ "No package name allowed for "
5316 "variable %s in \"our\"",
5318 tmp = allocmy(PL_tokenbuf);
5321 if (strchr(PL_tokenbuf,':'))
5322 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5324 yylval.opval = newOP(OP_PADANY, 0);
5325 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5331 build the ops for accesses to a my() variable.
5333 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5334 then used in a comparison. This catches most, but not
5335 all cases. For instance, it catches
5336 sort { my($a); $a <=> $b }
5338 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5339 (although why you'd do that is anyone's guess).
5342 if (!strchr(PL_tokenbuf,':')) {
5344 tmp = pad_findmy(PL_tokenbuf);
5345 if (tmp != NOT_IN_PAD) {
5346 /* might be an "our" variable" */
5347 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5348 /* build ops for a bareword */
5349 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5350 sv_catpvn(sym, "::", 2);
5351 sv_catpv(sym, PL_tokenbuf+1);
5352 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5353 yylval.opval->op_private = OPpCONST_ENTERED;
5354 gv_fetchpv(SvPVX(sym),
5356 ? (GV_ADDMULTI | GV_ADDINEVAL)
5359 ((PL_tokenbuf[0] == '$') ? SVt_PV
5360 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5365 /* if it's a sort block and they're naming $a or $b */
5366 if (PL_last_lop_op == OP_SORT &&
5367 PL_tokenbuf[0] == '$' &&
5368 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5371 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5372 d < PL_bufend && *d != '\n';
5375 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5376 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5382 yylval.opval = newOP(OP_PADANY, 0);
5383 yylval.opval->op_targ = tmp;
5389 Whine if they've said @foo in a doublequoted string,
5390 and @foo isn't a variable we can find in the symbol
5393 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5394 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5395 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5396 && ckWARN(WARN_AMBIGUOUS))
5398 /* Downgraded from fatal to warning 20000522 mjd */
5399 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5400 "Possible unintended interpolation of %s in string",
5405 /* build ops for a bareword */
5406 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5407 yylval.opval->op_private = OPpCONST_ENTERED;
5408 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5409 ((PL_tokenbuf[0] == '$') ? SVt_PV
5410 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5416 Perl_keyword(pTHX_ register char *d, I32 len)
5421 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5422 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5423 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5424 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5425 if (strEQ(d,"__END__")) return KEY___END__;
5429 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5434 if (strEQ(d,"and")) return -KEY_and;
5435 if (strEQ(d,"abs")) return -KEY_abs;
5438 if (strEQ(d,"alarm")) return -KEY_alarm;
5439 if (strEQ(d,"atan2")) return -KEY_atan2;
5442 if (strEQ(d,"accept")) return -KEY_accept;
5447 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5450 if (strEQ(d,"bless")) return -KEY_bless;
5451 if (strEQ(d,"bind")) return -KEY_bind;
5452 if (strEQ(d,"binmode")) return -KEY_binmode;
5455 if (strEQ(d,"CORE")) return -KEY_CORE;
5456 if (strEQ(d,"CHECK")) return KEY_CHECK;
5461 if (strEQ(d,"cmp")) return -KEY_cmp;
5462 if (strEQ(d,"chr")) return -KEY_chr;
5463 if (strEQ(d,"cos")) return -KEY_cos;
5466 if (strEQ(d,"chop")) return -KEY_chop;
5469 if (strEQ(d,"close")) return -KEY_close;
5470 if (strEQ(d,"chdir")) return -KEY_chdir;
5471 if (strEQ(d,"chomp")) return -KEY_chomp;
5472 if (strEQ(d,"chmod")) return -KEY_chmod;
5473 if (strEQ(d,"chown")) return -KEY_chown;
5474 if (strEQ(d,"crypt")) return -KEY_crypt;
5477 if (strEQ(d,"chroot")) return -KEY_chroot;
5478 if (strEQ(d,"caller")) return -KEY_caller;
5481 if (strEQ(d,"connect")) return -KEY_connect;
5484 if (strEQ(d,"closedir")) return -KEY_closedir;
5485 if (strEQ(d,"continue")) return -KEY_continue;
5490 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5495 if (strEQ(d,"do")) return KEY_do;
5498 if (strEQ(d,"die")) return -KEY_die;
5501 if (strEQ(d,"dump")) return -KEY_dump;
5504 if (strEQ(d,"delete")) return KEY_delete;
5507 if (strEQ(d,"defined")) return KEY_defined;
5508 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5511 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5516 if (strEQ(d,"END")) return KEY_END;
5521 if (strEQ(d,"eq")) return -KEY_eq;
5524 if (strEQ(d,"eof")) return -KEY_eof;
5525 if (strEQ(d,"err")) return -KEY_err;
5526 if (strEQ(d,"exp")) return -KEY_exp;
5529 if (strEQ(d,"else")) return KEY_else;
5530 if (strEQ(d,"exit")) return -KEY_exit;
5531 if (strEQ(d,"eval")) return KEY_eval;
5532 if (strEQ(d,"exec")) return -KEY_exec;
5533 if (strEQ(d,"each")) return -KEY_each;
5536 if (strEQ(d,"elsif")) return KEY_elsif;
5539 if (strEQ(d,"exists")) return KEY_exists;
5540 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5541 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5542 "elseif should be elsif");
5545 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5546 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5549 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5552 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5553 if (strEQ(d,"endservent")) return -KEY_endservent;
5556 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5563 if (strEQ(d,"for")) return KEY_for;
5566 if (strEQ(d,"fork")) return -KEY_fork;
5569 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5570 if (strEQ(d,"flock")) return -KEY_flock;
5573 if (strEQ(d,"format")) return KEY_format;
5574 if (strEQ(d,"fileno")) return -KEY_fileno;
5577 if (strEQ(d,"foreach")) return KEY_foreach;
5580 if (strEQ(d,"formline")) return -KEY_formline;
5585 if (strnEQ(d,"get",3)) {
5590 if (strEQ(d,"ppid")) return -KEY_getppid;
5591 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5594 if (strEQ(d,"pwent")) return -KEY_getpwent;
5595 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5596 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5599 if (strEQ(d,"peername")) return -KEY_getpeername;
5600 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5601 if (strEQ(d,"priority")) return -KEY_getpriority;
5604 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5607 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5611 else if (*d == 'h') {
5612 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5613 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5614 if (strEQ(d,"hostent")) return -KEY_gethostent;
5616 else if (*d == 'n') {
5617 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5618 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5619 if (strEQ(d,"netent")) return -KEY_getnetent;
5621 else if (*d == 's') {
5622 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5623 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5624 if (strEQ(d,"servent")) return -KEY_getservent;
5625 if (strEQ(d,"sockname")) return -KEY_getsockname;
5626 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5628 else if (*d == 'g') {
5629 if (strEQ(d,"grent")) return -KEY_getgrent;
5630 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5631 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5633 else if (*d == 'l') {
5634 if (strEQ(d,"login")) return -KEY_getlogin;
5636 else if (strEQ(d,"c")) return -KEY_getc;
5641 if (strEQ(d,"gt")) return -KEY_gt;
5642 if (strEQ(d,"ge")) return -KEY_ge;
5645 if (strEQ(d,"grep")) return KEY_grep;
5646 if (strEQ(d,"goto")) return KEY_goto;
5647 if (strEQ(d,"glob")) return KEY_glob;
5650 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5655 if (strEQ(d,"hex")) return -KEY_hex;
5658 if (strEQ(d,"INIT")) return KEY_INIT;
5663 if (strEQ(d,"if")) return KEY_if;
5666 if (strEQ(d,"int")) return -KEY_int;
5669 if (strEQ(d,"index")) return -KEY_index;
5670 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5675 if (strEQ(d,"join")) return -KEY_join;
5679 if (strEQ(d,"keys")) return -KEY_keys;
5680 if (strEQ(d,"kill")) return -KEY_kill;
5686 if (strEQ(d,"lt")) return -KEY_lt;
5687 if (strEQ(d,"le")) return -KEY_le;
5688 if (strEQ(d,"lc")) return -KEY_lc;
5691 if (strEQ(d,"log")) return -KEY_log;
5694 if (strEQ(d,"last")) return KEY_last;
5695 if (strEQ(d,"link")) return -KEY_link;
5696 if (strEQ(d,"lock")) return -KEY_lock;
5699 if (strEQ(d,"local")) return KEY_local;
5700 if (strEQ(d,"lstat")) return -KEY_lstat;
5703 if (strEQ(d,"length")) return -KEY_length;
5704 if (strEQ(d,"listen")) return -KEY_listen;
5707 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5710 if (strEQ(d,"localtime")) return -KEY_localtime;
5716 case 1: return KEY_m;
5718 if (strEQ(d,"my")) return KEY_my;
5721 if (strEQ(d,"map")) return KEY_map;
5724 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5727 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5728 if (strEQ(d,"msgget")) return -KEY_msgget;
5729 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5730 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5735 if (strEQ(d,"next")) return KEY_next;
5736 if (strEQ(d,"ne")) return -KEY_ne;
5737 if (strEQ(d,"not")) return -KEY_not;
5738 if (strEQ(d,"no")) return KEY_no;
5743 if (strEQ(d,"or")) return -KEY_or;
5746 if (strEQ(d,"ord")) return -KEY_ord;
5747 if (strEQ(d,"oct")) return -KEY_oct;
5748 if (strEQ(d,"our")) return KEY_our;
5751 if (strEQ(d,"open")) return -KEY_open;
5754 if (strEQ(d,"opendir")) return -KEY_opendir;
5761 if (strEQ(d,"pop")) return -KEY_pop;
5762 if (strEQ(d,"pos")) return KEY_pos;
5765 if (strEQ(d,"push")) return -KEY_push;
5766 if (strEQ(d,"pack")) return -KEY_pack;
5767 if (strEQ(d,"pipe")) return -KEY_pipe;
5770 if (strEQ(d,"print")) return KEY_print;
5773 if (strEQ(d,"printf")) return KEY_printf;
5776 if (strEQ(d,"package")) return KEY_package;
5779 if (strEQ(d,"prototype")) return KEY_prototype;
5784 if (strEQ(d,"q")) return KEY_q;
5785 if (strEQ(d,"qr")) return KEY_qr;
5786 if (strEQ(d,"qq")) return KEY_qq;
5787 if (strEQ(d,"qw")) return KEY_qw;
5788 if (strEQ(d,"qx")) return KEY_qx;
5790 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5795 if (strEQ(d,"ref")) return -KEY_ref;
5798 if (strEQ(d,"read")) return -KEY_read;
5799 if (strEQ(d,"rand")) return -KEY_rand;
5800 if (strEQ(d,"recv")) return -KEY_recv;
5801 if (strEQ(d,"redo")) return KEY_redo;
5804 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5805 if (strEQ(d,"reset")) return -KEY_reset;
5808 if (strEQ(d,"return")) return KEY_return;
5809 if (strEQ(d,"rename")) return -KEY_rename;
5810 if (strEQ(d,"rindex")) return -KEY_rindex;
5813 if (strEQ(d,"require")) return KEY_require;
5814 if (strEQ(d,"reverse")) return -KEY_reverse;
5815 if (strEQ(d,"readdir")) return -KEY_readdir;
5818 if (strEQ(d,"readlink")) return -KEY_readlink;
5819 if (strEQ(d,"readline")) return -KEY_readline;
5820 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5823 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5829 case 0: return KEY_s;
5831 if (strEQ(d,"scalar")) return KEY_scalar;
5836 if (strEQ(d,"seek")) return -KEY_seek;
5837 if (strEQ(d,"send")) return -KEY_send;
5840 if (strEQ(d,"semop")) return -KEY_semop;
5843 if (strEQ(d,"select")) return -KEY_select;
5844 if (strEQ(d,"semctl")) return -KEY_semctl;
5845 if (strEQ(d,"semget")) return -KEY_semget;
5848 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5849 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5852 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5853 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5856 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5859 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5860 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5861 if (strEQ(d,"setservent")) return -KEY_setservent;
5864 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5865 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5872 if (strEQ(d,"shift")) return -KEY_shift;
5875 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5876 if (strEQ(d,"shmget")) return -KEY_shmget;
5879 if (strEQ(d,"shmread")) return -KEY_shmread;
5882 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5883 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5888 if (strEQ(d,"sin")) return -KEY_sin;
5891 if (strEQ(d,"sleep")) return -KEY_sleep;
5894 if (strEQ(d,"sort")) return KEY_sort;
5895 if (strEQ(d,"socket")) return -KEY_socket;
5896 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5899 if (strEQ(d,"split")) return KEY_split;
5900 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5901 if (strEQ(d,"splice")) return -KEY_splice;
5904 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5907 if (strEQ(d,"srand")) return -KEY_srand;
5910 if (strEQ(d,"stat")) return -KEY_stat;
5911 if (strEQ(d,"study")) return KEY_study;
5914 if (strEQ(d,"substr")) return -KEY_substr;
5915 if (strEQ(d,"sub")) return KEY_sub;
5920 if (strEQ(d,"system")) return -KEY_system;
5923 if (strEQ(d,"symlink")) return -KEY_symlink;
5924 if (strEQ(d,"syscall")) return -KEY_syscall;
5925 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5926 if (strEQ(d,"sysread")) return -KEY_sysread;
5927 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5930 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5939 if (strEQ(d,"tr")) return KEY_tr;
5942 if (strEQ(d,"tie")) return KEY_tie;
5945 if (strEQ(d,"tell")) return -KEY_tell;
5946 if (strEQ(d,"tied")) return KEY_tied;
5947 if (strEQ(d,"time")) return -KEY_time;
5950 if (strEQ(d,"times")) return -KEY_times;
5953 if (strEQ(d,"telldir")) return -KEY_telldir;
5956 if (strEQ(d,"truncate")) return -KEY_truncate;
5963 if (strEQ(d,"uc")) return -KEY_uc;
5966 if (strEQ(d,"use")) return KEY_use;
5969 if (strEQ(d,"undef")) return KEY_undef;
5970 if (strEQ(d,"until")) return KEY_until;
5971 if (strEQ(d,"untie")) return KEY_untie;
5972 if (strEQ(d,"utime")) return -KEY_utime;
5973 if (strEQ(d,"umask")) return -KEY_umask;
5976 if (strEQ(d,"unless")) return KEY_unless;
5977 if (strEQ(d,"unpack")) return -KEY_unpack;
5978 if (strEQ(d,"unlink")) return -KEY_unlink;
5981 if (strEQ(d,"unshift")) return -KEY_unshift;
5982 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5987 if (strEQ(d,"values")) return -KEY_values;
5988 if (strEQ(d,"vec")) return -KEY_vec;
5993 if (strEQ(d,"warn")) return -KEY_warn;
5994 if (strEQ(d,"wait")) return -KEY_wait;
5997 if (strEQ(d,"while")) return KEY_while;
5998 if (strEQ(d,"write")) return -KEY_write;
6001 if (strEQ(d,"waitpid")) return -KEY_waitpid;
6004 if (strEQ(d,"wantarray")) return -KEY_wantarray;
6009 if (len == 1) return -KEY_x;
6010 if (strEQ(d,"xor")) return -KEY_xor;
6013 if (len == 1) return KEY_y;
6022 S_checkcomma(pTHX_ register char *s, char *name, char *what)
6026 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
6027 if (ckWARN(WARN_SYNTAX)) {
6029 for (w = s+2; *w && level; w++) {
6036 for (; *w && isSPACE(*w); w++) ;
6037 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6038 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6039 "%s (...) interpreted as function",name);
6042 while (s < PL_bufend && isSPACE(*s))
6046 while (s < PL_bufend && isSPACE(*s))
6048 if (isIDFIRST_lazy_if(s,UTF)) {
6050 while (isALNUM_lazy_if(s,UTF))
6052 while (s < PL_bufend && isSPACE(*s))
6057 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6061 Perl_croak(aTHX_ "No comma allowed after %s", what);
6066 /* Either returns sv, or mortalizes sv and returns a new SV*.
6067 Best used as sv=new_constant(..., sv, ...).
6068 If s, pv are NULL, calls subroutine with one argument,
6069 and type is used with error messages only. */
6072 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6076 HV *table = GvHV(PL_hintgv); /* ^H */
6080 const char *why1, *why2, *why3;
6082 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6085 why2 = strEQ(key,"charnames")
6086 ? "(possibly a missing \"use charnames ...\")"
6088 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6089 (type ? type: "undef"), why2);
6091 /* This is convoluted and evil ("goto considered harmful")
6092 * but I do not understand the intricacies of all the different
6093 * failure modes of %^H in here. The goal here is to make
6094 * the most probable error message user-friendly. --jhi */
6099 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6100 (type ? type: "undef"), why1, why2, why3);
6102 yyerror(SvPVX(msg));
6106 cvp = hv_fetch(table, key, strlen(key), FALSE);
6107 if (!cvp || !SvOK(*cvp)) {
6110 why3 = "} is not defined";
6113 sv_2mortal(sv); /* Parent created it permanently */
6116 pv = sv_2mortal(newSVpvn(s, len));
6118 typesv = sv_2mortal(newSVpv(type, 0));
6120 typesv = &PL_sv_undef;
6122 PUSHSTACKi(PERLSI_OVERLOAD);
6134 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6138 /* Check the eval first */
6139 if (!PL_in_eval && SvTRUE(ERRSV)) {
6141 sv_catpv(ERRSV, "Propagated");
6142 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6144 res = SvREFCNT_inc(sv);
6148 (void)SvREFCNT_inc(res);
6157 why1 = "Call to &{$^H{";
6159 why3 = "}} did not return a defined value";
6168 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6170 register char *d = dest;
6171 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6174 Perl_croak(aTHX_ ident_too_long);
6175 if (isALNUM(*s)) /* UTF handled below */
6177 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6182 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6186 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6187 char *t = s + UTF8SKIP(s);
6188 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6190 if (d + (t - s) > e)
6191 Perl_croak(aTHX_ ident_too_long);
6192 Copy(s, d, t - s, char);
6205 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6215 e = d + destlen - 3; /* two-character token, ending NUL */
6217 while (isDIGIT(*s)) {
6219 Perl_croak(aTHX_ ident_too_long);
6226 Perl_croak(aTHX_ ident_too_long);
6227 if (isALNUM(*s)) /* UTF handled below */
6229 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6234 else if (*s == ':' && s[1] == ':') {
6238 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6239 char *t = s + UTF8SKIP(s);
6240 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6242 if (d + (t - s) > e)
6243 Perl_croak(aTHX_ ident_too_long);
6244 Copy(s, d, t - s, char);
6255 if (PL_lex_state != LEX_NORMAL)
6256 PL_lex_state = LEX_INTERPENDMAYBE;
6259 if (*s == '$' && s[1] &&
6260 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6273 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6278 if (isSPACE(s[-1])) {
6281 if (!SPACE_OR_TAB(ch)) {
6287 if (isIDFIRST_lazy_if(d,UTF)) {
6291 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6293 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6296 Copy(s, d, e - s, char);
6301 while ((isALNUM(*s) || *s == ':') && d < e)
6304 Perl_croak(aTHX_ ident_too_long);
6307 while (s < send && SPACE_OR_TAB(*s)) s++;
6308 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6309 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6310 const char *brack = *s == '[' ? "[...]" : "{...}";
6311 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6312 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6313 funny, dest, brack, funny, dest, brack);
6316 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6320 /* Handle extended ${^Foo} variables
6321 * 1999-02-27 mjd-perl-patch@plover.com */
6322 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6326 while (isALNUM(*s) && d < e) {
6330 Perl_croak(aTHX_ ident_too_long);
6335 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6336 PL_lex_state = LEX_INTERPEND;
6341 if (PL_lex_state == LEX_NORMAL) {
6342 if (ckWARN(WARN_AMBIGUOUS) &&
6343 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6345 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6346 "Ambiguous use of %c{%s} resolved to %c%s",
6347 funny, dest, funny, dest);
6352 s = bracket; /* let the parser handle it */
6356 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6357 PL_lex_state = LEX_INTERPEND;
6362 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6367 *pmfl |= PMf_GLOBAL;
6369 *pmfl |= PMf_CONTINUE;
6373 *pmfl |= PMf_MULTILINE;
6375 *pmfl |= PMf_SINGLELINE;
6377 *pmfl |= PMf_EXTENDED;
6381 S_scan_pat(pTHX_ char *start, I32 type)
6386 s = scan_str(start,FALSE,FALSE);
6388 Perl_croak(aTHX_ "Search pattern not terminated");
6390 pm = (PMOP*)newPMOP(type, 0);
6391 if (PL_multi_open == '?')
6392 pm->op_pmflags |= PMf_ONCE;
6394 while (*s && strchr("iomsx", *s))
6395 pmflag(&pm->op_pmflags,*s++);
6398 while (*s && strchr("iogcmsx", *s))
6399 pmflag(&pm->op_pmflags,*s++);
6401 /* issue a warning if /c is specified,but /g is not */
6402 if (ckWARN(WARN_REGEXP) &&
6403 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6405 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6408 pm->op_pmpermflags = pm->op_pmflags;
6410 PL_lex_op = (OP*)pm;
6411 yylval.ival = OP_MATCH;
6416 S_scan_subst(pTHX_ char *start)
6423 yylval.ival = OP_NULL;
6425 s = scan_str(start,FALSE,FALSE);
6428 Perl_croak(aTHX_ "Substitution pattern not terminated");
6430 if (s[-1] == PL_multi_open)
6433 first_start = PL_multi_start;
6434 s = scan_str(s,FALSE,FALSE);
6437 SvREFCNT_dec(PL_lex_stuff);
6438 PL_lex_stuff = Nullsv;
6440 Perl_croak(aTHX_ "Substitution replacement not terminated");
6442 PL_multi_start = first_start; /* so whole substitution is taken together */
6444 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6450 else if (strchr("iogcmsx", *s))
6451 pmflag(&pm->op_pmflags,*s++);
6456 /* /c is not meaningful with s/// */
6457 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6459 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6464 PL_sublex_info.super_bufptr = s;
6465 PL_sublex_info.super_bufend = PL_bufend;
6467 pm->op_pmflags |= PMf_EVAL;
6468 repl = newSVpvn("",0);
6470 sv_catpv(repl, es ? "eval " : "do ");
6471 sv_catpvn(repl, "{ ", 2);
6472 sv_catsv(repl, PL_lex_repl);
6473 sv_catpvn(repl, " };", 2);
6475 SvREFCNT_dec(PL_lex_repl);
6479 pm->op_pmpermflags = pm->op_pmflags;
6480 PL_lex_op = (OP*)pm;
6481 yylval.ival = OP_SUBST;
6486 S_scan_trans(pTHX_ char *start)
6495 yylval.ival = OP_NULL;
6497 s = scan_str(start,FALSE,FALSE);
6499 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6500 if (s[-1] == PL_multi_open)
6503 s = scan_str(s,FALSE,FALSE);
6506 SvREFCNT_dec(PL_lex_stuff);
6507 PL_lex_stuff = Nullsv;
6509 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6512 complement = del = squash = 0;
6513 while (strchr("cds", *s)) {
6515 complement = OPpTRANS_COMPLEMENT;
6517 del = OPpTRANS_DELETE;
6519 squash = OPpTRANS_SQUASH;
6523 New(803, tbl, complement&&!del?258:256, short);
6524 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6525 o->op_private &= ~OPpTRANS_ALL;
6526 o->op_private |= del|squash|complement|
6527 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6528 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6531 yylval.ival = OP_TRANS;
6536 S_scan_heredoc(pTHX_ register char *s)
6539 I32 op_type = OP_SCALAR;
6546 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6550 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6553 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6554 if (*peek && strchr("`'\"",*peek)) {
6557 s = delimcpy(d, e, s, PL_bufend, term, &len);
6567 if (!isALNUM_lazy_if(s,UTF))
6568 deprecate_old("bare << to mean <<\"\"");
6569 for (; isALNUM_lazy_if(s,UTF); s++) {
6574 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6575 Perl_croak(aTHX_ "Delimiter for here document is too long");
6578 len = d - PL_tokenbuf;
6579 #ifndef PERL_STRICT_CR
6580 d = strchr(s, '\r');
6584 while (s < PL_bufend) {
6590 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6599 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6604 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6605 herewas = newSVpvn(s,PL_bufend-s);
6607 s--, herewas = newSVpvn(s,d-s);
6608 s += SvCUR(herewas);
6610 tmpstr = NEWSV(87,79);
6611 sv_upgrade(tmpstr, SVt_PVIV);
6616 else if (term == '`') {
6617 op_type = OP_BACKTICK;
6618 SvIVX(tmpstr) = '\\';
6622 PL_multi_start = CopLINE(PL_curcop);
6623 PL_multi_open = PL_multi_close = '<';
6624 term = *PL_tokenbuf;
6625 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6626 char *bufptr = PL_sublex_info.super_bufptr;
6627 char *bufend = PL_sublex_info.super_bufend;
6628 char *olds = s - SvCUR(herewas);
6629 s = strchr(bufptr, '\n');
6633 while (s < bufend &&
6634 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6636 CopLINE_inc(PL_curcop);
6639 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6640 missingterm(PL_tokenbuf);
6642 sv_setpvn(herewas,bufptr,d-bufptr+1);
6643 sv_setpvn(tmpstr,d+1,s-d);
6645 sv_catpvn(herewas,s,bufend-s);
6646 (void)strcpy(bufptr,SvPVX(herewas));
6653 while (s < PL_bufend &&
6654 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6656 CopLINE_inc(PL_curcop);
6658 if (s >= PL_bufend) {
6659 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6660 missingterm(PL_tokenbuf);
6662 sv_setpvn(tmpstr,d+1,s-d);
6664 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6666 sv_catpvn(herewas,s,PL_bufend-s);
6667 sv_setsv(PL_linestr,herewas);
6668 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6669 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6670 PL_last_lop = PL_last_uni = Nullch;
6673 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6674 while (s >= PL_bufend) { /* multiple line string? */
6676 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6677 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6678 missingterm(PL_tokenbuf);
6680 CopLINE_inc(PL_curcop);
6681 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6682 PL_last_lop = PL_last_uni = Nullch;
6683 #ifndef PERL_STRICT_CR
6684 if (PL_bufend - PL_linestart >= 2) {
6685 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6686 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6688 PL_bufend[-2] = '\n';
6690 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6692 else if (PL_bufend[-1] == '\r')
6693 PL_bufend[-1] = '\n';
6695 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6696 PL_bufend[-1] = '\n';
6698 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6699 SV *sv = NEWSV(88,0);
6701 sv_upgrade(sv, SVt_PVMG);
6702 sv_setsv(sv,PL_linestr);
6705 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6707 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6710 sv_catsv(PL_linestr,herewas);
6711 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6715 sv_catsv(tmpstr,PL_linestr);
6720 PL_multi_end = CopLINE(PL_curcop);
6721 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6722 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6723 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6725 SvREFCNT_dec(herewas);
6727 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6729 else if (PL_encoding)
6730 sv_recode_to_utf8(tmpstr, PL_encoding);
6732 PL_lex_stuff = tmpstr;
6733 yylval.ival = op_type;
6738 takes: current position in input buffer
6739 returns: new position in input buffer
6740 side-effects: yylval and lex_op are set.
6745 <FH> read from filehandle
6746 <pkg::FH> read from package qualified filehandle
6747 <pkg'FH> read from package qualified filehandle
6748 <$fh> read from filehandle in $fh
6754 S_scan_inputsymbol(pTHX_ char *start)
6756 register char *s = start; /* current position in buffer */
6762 d = PL_tokenbuf; /* start of temp holding space */
6763 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6764 end = strchr(s, '\n');
6767 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6769 /* die if we didn't have space for the contents of the <>,
6770 or if it didn't end, or if we see a newline
6773 if (len >= sizeof PL_tokenbuf)
6774 Perl_croak(aTHX_ "Excessively long <> operator");
6776 Perl_croak(aTHX_ "Unterminated <> operator");
6781 Remember, only scalar variables are interpreted as filehandles by
6782 this code. Anything more complex (e.g., <$fh{$num}>) will be
6783 treated as a glob() call.
6784 This code makes use of the fact that except for the $ at the front,
6785 a scalar variable and a filehandle look the same.
6787 if (*d == '$' && d[1]) d++;
6789 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6790 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6793 /* If we've tried to read what we allow filehandles to look like, and
6794 there's still text left, then it must be a glob() and not a getline.
6795 Use scan_str to pull out the stuff between the <> and treat it
6796 as nothing more than a string.
6799 if (d - PL_tokenbuf != len) {
6800 yylval.ival = OP_GLOB;
6802 s = scan_str(start,FALSE,FALSE);
6804 Perl_croak(aTHX_ "Glob not terminated");
6808 bool readline_overriden = FALSE;
6809 GV *gv_readline = Nullgv;
6811 /* we're in a filehandle read situation */
6814 /* turn <> into <ARGV> */
6816 (void)strcpy(d,"ARGV");
6818 /* Check whether readline() is overriden */
6819 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6820 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6822 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6823 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6824 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6825 readline_overriden = TRUE;
6827 /* if <$fh>, create the ops to turn the variable into a
6833 /* try to find it in the pad for this block, otherwise find
6834 add symbol table ops
6836 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6837 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6838 SV *sym = sv_2mortal(
6839 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6840 sv_catpvn(sym, "::", 2);
6846 OP *o = newOP(OP_PADSV, 0);
6848 PL_lex_op = readline_overriden
6849 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6850 append_elem(OP_LIST, o,
6851 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6852 : (OP*)newUNOP(OP_READLINE, 0, o);
6861 ? (GV_ADDMULTI | GV_ADDINEVAL)
6864 PL_lex_op = readline_overriden
6865 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6866 append_elem(OP_LIST,
6867 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6868 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6869 : (OP*)newUNOP(OP_READLINE, 0,
6870 newUNOP(OP_RV2SV, 0,
6871 newGVOP(OP_GV, 0, gv)));
6873 if (!readline_overriden)
6874 PL_lex_op->op_flags |= OPf_SPECIAL;
6875 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6876 yylval.ival = OP_NULL;
6879 /* If it's none of the above, it must be a literal filehandle
6880 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6882 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6883 PL_lex_op = readline_overriden
6884 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6885 append_elem(OP_LIST,
6886 newGVOP(OP_GV, 0, gv),
6887 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6888 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6889 yylval.ival = OP_NULL;
6898 takes: start position in buffer
6899 keep_quoted preserve \ on the embedded delimiter(s)
6900 keep_delims preserve the delimiters around the string
6901 returns: position to continue reading from buffer
6902 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6903 updates the read buffer.
6905 This subroutine pulls a string out of the input. It is called for:
6906 q single quotes q(literal text)
6907 ' single quotes 'literal text'
6908 qq double quotes qq(interpolate $here please)
6909 " double quotes "interpolate $here please"
6910 qx backticks qx(/bin/ls -l)
6911 ` backticks `/bin/ls -l`
6912 qw quote words @EXPORT_OK = qw( func() $spam )
6913 m// regexp match m/this/
6914 s/// regexp substitute s/this/that/
6915 tr/// string transliterate tr/this/that/
6916 y/// string transliterate y/this/that/
6917 ($*@) sub prototypes sub foo ($)
6918 (stuff) sub attr parameters sub foo : attr(stuff)
6919 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6921 In most of these cases (all but <>, patterns and transliterate)
6922 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6923 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6924 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6927 It skips whitespace before the string starts, and treats the first
6928 character as the delimiter. If the delimiter is one of ([{< then
6929 the corresponding "close" character )]}> is used as the closing
6930 delimiter. It allows quoting of delimiters, and if the string has
6931 balanced delimiters ([{<>}]) it allows nesting.
6933 On success, the SV with the resulting string is put into lex_stuff or,
6934 if that is already non-NULL, into lex_repl. The second case occurs only
6935 when parsing the RHS of the special constructs s/// and tr/// (y///).
6936 For convenience, the terminating delimiter character is stuffed into
6941 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6943 SV *sv; /* scalar value: string */
6944 char *tmps; /* temp string, used for delimiter matching */
6945 register char *s = start; /* current position in the buffer */
6946 register char term; /* terminating character */
6947 register char *to; /* current position in the sv's data */
6948 I32 brackets = 1; /* bracket nesting level */
6949 bool has_utf8 = FALSE; /* is there any utf8 content? */
6950 I32 termcode; /* terminating char. code */
6951 U8 termstr[UTF8_MAXLEN]; /* terminating string */
6952 STRLEN termlen; /* length of terminating string */
6953 char *last = NULL; /* last position for nesting bracket */
6955 /* skip space before the delimiter */
6959 /* mark where we are, in case we need to report errors */
6962 /* after skipping whitespace, the next character is the terminator */
6965 termcode = termstr[0] = term;
6969 termcode = utf8_to_uvchr((U8*)s, &termlen);
6970 Copy(s, termstr, termlen, U8);
6971 if (!UTF8_IS_INVARIANT(term))
6975 /* mark where we are */
6976 PL_multi_start = CopLINE(PL_curcop);
6977 PL_multi_open = term;
6979 /* find corresponding closing delimiter */
6980 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6981 termcode = termstr[0] = term = tmps[5];
6983 PL_multi_close = term;
6985 /* create a new SV to hold the contents. 87 is leak category, I'm
6986 assuming. 79 is the SV's initial length. What a random number. */
6988 sv_upgrade(sv, SVt_PVIV);
6989 SvIVX(sv) = termcode;
6990 (void)SvPOK_only(sv); /* validate pointer */
6992 /* move past delimiter and try to read a complete string */
6994 sv_catpvn(sv, s, termlen);
6997 if (PL_encoding && !UTF) {
7001 int offset = s - SvPVX(PL_linestr);
7002 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
7003 &offset, (char*)termstr, termlen);
7004 char *ns = SvPVX(PL_linestr) + offset;
7005 char *svlast = SvEND(sv) - 1;
7007 for (; s < ns; s++) {
7008 if (*s == '\n' && !PL_rsfp)
7009 CopLINE_inc(PL_curcop);
7012 goto read_more_line;
7014 /* handle quoted delimiters */
7015 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
7017 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
7019 if ((svlast-1 - t) % 2) {
7023 SvCUR_set(sv, SvCUR(sv) - 1);
7028 if (PL_multi_open == PL_multi_close) {
7035 for (w = t = last; t < svlast; w++, t++) {
7036 /* At here, all closes are "was quoted" one,
7037 so we don't check PL_multi_close. */
7039 if (!keep_quoted && *(t+1) == PL_multi_open)
7044 else if (*t == PL_multi_open)
7052 SvCUR_set(sv, w - SvPVX(sv));
7055 if (--brackets <= 0)
7061 SvCUR_set(sv, SvCUR(sv) - 1);
7067 /* extend sv if need be */
7068 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7069 /* set 'to' to the next character in the sv's string */
7070 to = SvPVX(sv)+SvCUR(sv);
7072 /* if open delimiter is the close delimiter read unbridle */
7073 if (PL_multi_open == PL_multi_close) {
7074 for (; s < PL_bufend; s++,to++) {
7075 /* embedded newlines increment the current line number */
7076 if (*s == '\n' && !PL_rsfp)
7077 CopLINE_inc(PL_curcop);
7078 /* handle quoted delimiters */
7079 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7080 if (!keep_quoted && s[1] == term)
7082 /* any other quotes are simply copied straight through */
7086 /* terminate when run out of buffer (the for() condition), or
7087 have found the terminator */
7088 else if (*s == term) {
7091 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7094 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7100 /* if the terminator isn't the same as the start character (e.g.,
7101 matched brackets), we have to allow more in the quoting, and
7102 be prepared for nested brackets.
7105 /* read until we run out of string, or we find the terminator */
7106 for (; s < PL_bufend; s++,to++) {
7107 /* embedded newlines increment the line count */
7108 if (*s == '\n' && !PL_rsfp)
7109 CopLINE_inc(PL_curcop);
7110 /* backslashes can escape the open or closing characters */
7111 if (*s == '\\' && s+1 < PL_bufend) {
7113 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7118 /* allow nested opens and closes */
7119 else if (*s == PL_multi_close && --brackets <= 0)
7121 else if (*s == PL_multi_open)
7123 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7128 /* terminate the copied string and update the sv's end-of-string */
7130 SvCUR_set(sv, to - SvPVX(sv));
7133 * this next chunk reads more into the buffer if we're not done yet
7137 break; /* handle case where we are done yet :-) */
7139 #ifndef PERL_STRICT_CR
7140 if (to - SvPVX(sv) >= 2) {
7141 if ((to[-2] == '\r' && to[-1] == '\n') ||
7142 (to[-2] == '\n' && to[-1] == '\r'))
7146 SvCUR_set(sv, to - SvPVX(sv));
7148 else if (to[-1] == '\r')
7151 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7156 /* if we're out of file, or a read fails, bail and reset the current
7157 line marker so we can report where the unterminated string began
7160 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7162 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7165 /* we read a line, so increment our line counter */
7166 CopLINE_inc(PL_curcop);
7168 /* update debugger info */
7169 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7170 SV *sv = NEWSV(88,0);
7172 sv_upgrade(sv, SVt_PVMG);
7173 sv_setsv(sv,PL_linestr);
7176 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7179 /* having changed the buffer, we must update PL_bufend */
7180 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7181 PL_last_lop = PL_last_uni = Nullch;
7184 /* at this point, we have successfully read the delimited string */
7186 if (!PL_encoding || UTF) {
7188 sv_catpvn(sv, s, termlen);
7191 if (has_utf8 || PL_encoding)
7194 PL_multi_end = CopLINE(PL_curcop);
7196 /* if we allocated too much space, give some back */
7197 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7198 SvLEN_set(sv, SvCUR(sv) + 1);
7199 Renew(SvPVX(sv), SvLEN(sv), char);
7202 /* decide whether this is the first or second quoted string we've read
7215 takes: pointer to position in buffer
7216 returns: pointer to new position in buffer
7217 side-effects: builds ops for the constant in yylval.op
7219 Read a number in any of the formats that Perl accepts:
7221 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7222 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7225 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7227 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7230 If it reads a number without a decimal point or an exponent, it will
7231 try converting the number to an integer and see if it can do so
7232 without loss of precision.
7236 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7238 register char *s = start; /* current position in buffer */
7239 register char *d; /* destination in temp buffer */
7240 register char *e; /* end of temp buffer */
7241 NV nv; /* number read, as a double */
7242 SV *sv = Nullsv; /* place to put the converted number */
7243 bool floatit; /* boolean: int or float? */
7244 char *lastub = 0; /* position of last underbar */
7245 static char number_too_long[] = "Number too long";
7247 /* We use the first character to decide what type of number this is */
7251 Perl_croak(aTHX_ "panic: scan_num");
7253 /* if it starts with a 0, it could be an octal number, a decimal in
7254 0.13 disguise, or a hexadecimal number, or a binary number. */
7258 u holds the "number so far"
7259 shift the power of 2 of the base
7260 (hex == 4, octal == 3, binary == 1)
7261 overflowed was the number more than we can hold?
7263 Shift is used when we add a digit. It also serves as an "are
7264 we in octal/hex/binary?" indicator to disallow hex characters
7270 bool overflowed = FALSE;
7271 bool just_zero = TRUE; /* just plain 0 or binary number? */
7272 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7273 static char* bases[5] = { "", "binary", "", "octal",
7275 static char* Bases[5] = { "", "Binary", "", "Octal",
7277 static char *maxima[5] = { "",
7278 "0b11111111111111111111111111111111",
7282 char *base, *Base, *max;
7289 } else if (s[1] == 'b') {
7294 /* check for a decimal in disguise */
7295 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7297 /* so it must be octal */
7304 if (ckWARN(WARN_SYNTAX))
7305 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7306 "Misplaced _ in number");
7310 base = bases[shift];
7311 Base = Bases[shift];
7312 max = maxima[shift];
7314 /* read the rest of the number */
7316 /* x is used in the overflow test,
7317 b is the digit we're adding on. */
7322 /* if we don't mention it, we're done */
7326 /* _ are ignored -- but warned about if consecutive */
7328 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7329 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7330 "Misplaced _ in number");
7334 /* 8 and 9 are not octal */
7337 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7341 case '2': case '3': case '4':
7342 case '5': case '6': case '7':
7344 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7348 b = *s++ & 15; /* ASCII digit -> value of digit */
7352 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7353 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7354 /* make sure they said 0x */
7359 /* Prepare to put the digit we have onto the end
7360 of the number so far. We check for overflows.
7366 x = u << shift; /* make room for the digit */
7368 if ((x >> shift) != u
7369 && !(PL_hints & HINT_NEW_BINARY)) {
7372 if (ckWARN_d(WARN_OVERFLOW))
7373 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7374 "Integer overflow in %s number",
7377 u = x | b; /* add the digit to the end */
7380 n *= nvshift[shift];
7381 /* If an NV has not enough bits in its
7382 * mantissa to represent an UV this summing of
7383 * small low-order numbers is a waste of time
7384 * (because the NV cannot preserve the
7385 * low-order bits anyway): we could just
7386 * remember when did we overflow and in the
7387 * end just multiply n by the right
7395 /* if we get here, we had success: make a scalar value from
7400 /* final misplaced underbar check */
7402 if (ckWARN(WARN_SYNTAX))
7403 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7408 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7409 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7410 "%s number > %s non-portable",
7416 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7417 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7418 "%s number > %s non-portable",
7423 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7424 sv = new_constant(start, s - start, "integer",
7426 else if (PL_hints & HINT_NEW_BINARY)
7427 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7432 handle decimal numbers.
7433 we're also sent here when we read a 0 as the first digit
7435 case '1': case '2': case '3': case '4': case '5':
7436 case '6': case '7': case '8': case '9': case '.':
7439 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7442 /* read next group of digits and _ and copy into d */
7443 while (isDIGIT(*s) || *s == '_') {
7444 /* skip underscores, checking for misplaced ones
7448 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7449 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7450 "Misplaced _ in number");
7454 /* check for end of fixed-length buffer */
7456 Perl_croak(aTHX_ number_too_long);
7457 /* if we're ok, copy the character */
7462 /* final misplaced underbar check */
7463 if (lastub && s == lastub + 1) {
7464 if (ckWARN(WARN_SYNTAX))
7465 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7468 /* read a decimal portion if there is one. avoid
7469 3..5 being interpreted as the number 3. followed
7472 if (*s == '.' && s[1] != '.') {
7477 if (ckWARN(WARN_SYNTAX))
7478 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7479 "Misplaced _ in number");
7483 /* copy, ignoring underbars, until we run out of digits.
7485 for (; isDIGIT(*s) || *s == '_'; s++) {
7486 /* fixed length buffer check */
7488 Perl_croak(aTHX_ number_too_long);
7490 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7491 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7492 "Misplaced _ in number");
7498 /* fractional part ending in underbar? */
7500 if (ckWARN(WARN_SYNTAX))
7501 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7502 "Misplaced _ in number");
7504 if (*s == '.' && isDIGIT(s[1])) {
7505 /* oops, it's really a v-string, but without the "v" */
7511 /* read exponent part, if present */
7512 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7516 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7517 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7519 /* stray preinitial _ */
7521 if (ckWARN(WARN_SYNTAX))
7522 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7523 "Misplaced _ in number");
7527 /* allow positive or negative exponent */
7528 if (*s == '+' || *s == '-')
7531 /* stray initial _ */
7533 if (ckWARN(WARN_SYNTAX))
7534 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7535 "Misplaced _ in number");
7539 /* read digits of exponent */
7540 while (isDIGIT(*s) || *s == '_') {
7543 Perl_croak(aTHX_ number_too_long);
7547 if (ckWARN(WARN_SYNTAX) &&
7548 ((lastub && s == lastub + 1) ||
7549 (!isDIGIT(s[1]) && s[1] != '_')))
7550 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7551 "Misplaced _ in number");
7558 /* make an sv from the string */
7562 We try to do an integer conversion first if no characters
7563 indicating "float" have been found.
7568 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7570 if (flags == IS_NUMBER_IN_UV) {
7572 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7575 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7576 if (uv <= (UV) IV_MIN)
7577 sv_setiv(sv, -(IV)uv);
7584 /* terminate the string */
7586 nv = Atof(PL_tokenbuf);
7590 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7591 (PL_hints & HINT_NEW_INTEGER) )
7592 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7593 (floatit ? "float" : "integer"),
7597 /* if it starts with a v, it could be a v-string */
7600 sv = NEWSV(92,5); /* preallocate storage space */
7601 s = scan_vstring(s,sv);
7605 /* make the op for the constant and return */
7608 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7610 lvalp->opval = Nullop;
7616 S_scan_formline(pTHX_ register char *s)
7620 SV *stuff = newSVpvn("",0);
7621 bool needargs = FALSE;
7627 #ifdef PERL_STRICT_CR
7628 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7630 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7632 if (*t == '\n' || t == PL_bufend) {
7637 if (PL_in_eval && !PL_rsfp) {
7638 eol = memchr(s,'\n',PL_bufend-s);
7643 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7645 for (t = s; t < eol; t++) {
7646 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7648 goto enough; /* ~~ must be first line in formline */
7650 if (*t == '@' || *t == '^')
7654 sv_catpvn(stuff, s, eol-s);
7655 #ifndef PERL_STRICT_CR
7656 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7657 char *end = SvPVX(stuff) + SvCUR(stuff);
7669 s = filter_gets(PL_linestr, PL_rsfp, 0);
7670 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7671 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7672 PL_last_lop = PL_last_uni = Nullch;
7684 PL_lex_state = LEX_NORMAL;
7685 PL_nextval[PL_nexttoke].ival = 0;
7689 PL_lex_state = LEX_FORMLINE;
7691 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7693 else if (PL_encoding)
7694 sv_recode_to_utf8(stuff, PL_encoding);
7696 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7698 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7702 SvREFCNT_dec(stuff);
7704 PL_lex_formbrack = 0;
7715 PL_cshlen = strlen(PL_cshname);
7720 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7722 I32 oldsavestack_ix = PL_savestack_ix;
7723 CV* outsidecv = PL_compcv;
7726 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7728 SAVEI32(PL_subline);
7729 save_item(PL_subname);
7730 SAVESPTR(PL_compcv);
7732 PL_compcv = (CV*)NEWSV(1104,0);
7733 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7734 CvFLAGS(PL_compcv) |= flags;
7736 PL_subline = CopLINE(PL_curcop);
7737 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7738 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7739 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7741 return oldsavestack_ix;
7745 #pragma segment Perl_yylex
7748 Perl_yywarn(pTHX_ char *s)
7750 PL_in_eval |= EVAL_WARNONLY;
7752 PL_in_eval &= ~EVAL_WARNONLY;
7757 Perl_yyerror(pTHX_ char *s)
7760 char *context = NULL;
7764 if (!yychar || (yychar == ';' && !PL_rsfp))
7766 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7767 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7770 The code below is removed for NetWare because it abends/crashes on NetWare
7771 when the script has error such as not having the closing quotes like:
7773 Checking of white spaces is anyway done in NetWare code.
7776 while (isSPACE(*PL_oldoldbufptr))
7779 context = PL_oldoldbufptr;
7780 contlen = PL_bufptr - PL_oldoldbufptr;
7782 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7783 PL_oldbufptr != PL_bufptr) {
7786 The code below is removed for NetWare because it abends/crashes on NetWare
7787 when the script has error such as not having the closing quotes like:
7789 Checking of white spaces is anyway done in NetWare code.
7792 while (isSPACE(*PL_oldbufptr))
7795 context = PL_oldbufptr;
7796 contlen = PL_bufptr - PL_oldbufptr;
7798 else if (yychar > 255)
7799 where = "next token ???";
7800 #ifdef USE_PURE_BISON
7801 /* GNU Bison sets the value -2 */
7802 else if (yychar == -2) {
7804 else if ((yychar & 127) == 127) {
7806 if (PL_lex_state == LEX_NORMAL ||
7807 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7808 where = "at end of line";
7809 else if (PL_lex_inpat)
7810 where = "within pattern";
7812 where = "within string";
7815 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7817 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7818 else if (isPRINT_LC(yychar))
7819 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7821 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7822 where = SvPVX(where_sv);
7824 msg = sv_2mortal(newSVpv(s, 0));
7825 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7826 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7828 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7830 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7831 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7832 Perl_sv_catpvf(aTHX_ msg,
7833 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7834 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7837 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7838 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7841 if (PL_error_count >= 10) {
7842 if (PL_in_eval && SvCUR(ERRSV))
7843 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7844 ERRSV, OutCopFILE(PL_curcop));
7846 Perl_croak(aTHX_ "%s has too many errors.\n",
7847 OutCopFILE(PL_curcop));
7850 PL_in_my_stash = Nullhv;
7854 #pragma segment Main
7858 S_swallow_bom(pTHX_ U8 *s)
7861 slen = SvCUR(PL_linestr);
7865 /* UTF-16 little-endian */
7866 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7867 Perl_croak(aTHX_ "Unsupported script encoding");
7868 #ifndef PERL_NO_UTF16_FILTER
7869 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7871 if (PL_bufend > (char*)s) {
7875 filter_add(utf16rev_textfilter, NULL);
7876 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7877 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7878 PL_bufend - (char*)s - 1,
7880 Copy(news, s, newlen, U8);
7881 SvCUR_set(PL_linestr, newlen);
7882 PL_bufend = SvPVX(PL_linestr) + newlen;
7883 news[newlen++] = '\0';
7887 Perl_croak(aTHX_ "Unsupported script encoding");
7892 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7893 #ifndef PERL_NO_UTF16_FILTER
7894 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7896 if (PL_bufend > (char *)s) {
7900 filter_add(utf16_textfilter, NULL);
7901 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7902 PL_bufend = (char*)utf16_to_utf8(s, news,
7903 PL_bufend - (char*)s,
7905 Copy(news, s, newlen, U8);
7906 SvCUR_set(PL_linestr, newlen);
7907 PL_bufend = SvPVX(PL_linestr) + newlen;
7908 news[newlen++] = '\0';
7912 Perl_croak(aTHX_ "Unsupported script encoding");
7917 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7918 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7923 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7924 s[2] == 0xFE && s[3] == 0xFF)
7926 Perl_croak(aTHX_ "Unsupported script encoding");
7934 * Restore a source filter.
7938 restore_rsfp(pTHX_ void *f)
7940 PerlIO *fp = (PerlIO*)f;
7942 if (PL_rsfp == PerlIO_stdin())
7943 PerlIO_clearerr(PL_rsfp);
7944 else if (PL_rsfp && (PL_rsfp != fp))
7945 PerlIO_close(PL_rsfp);
7949 #ifndef PERL_NO_UTF16_FILTER
7951 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7953 I32 count = FILTER_READ(idx+1, sv, maxlen);
7958 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7959 if (!*SvPV_nolen(sv))
7960 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7963 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7964 sv_usepvn(sv, (char*)tmps, tend - tmps);
7970 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7972 I32 count = FILTER_READ(idx+1, sv, maxlen);
7977 if (!*SvPV_nolen(sv))
7978 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7981 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7982 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7983 sv_usepvn(sv, (char*)tmps, tend - tmps);
7990 Returns a pointer to the next character after the parsed
7991 vstring, as well as updating the passed in sv.
7993 Function must be called like
7996 s = scan_vstring(s,sv);
7998 The sv should already be large enough to store the vstring
7999 passed in, for performance reasons.
8004 Perl_scan_vstring(pTHX_ char *s, SV *sv)
8008 if (*pos == 'v') pos++; /* get past 'v' */
8009 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8012 /* this may not be a v-string if followed by => */
8014 while (next < PL_bufend && isSPACE(*next))
8016 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
8017 /* return string not v-string */
8018 sv_setpvn(sv,(char *)s,pos-s);
8023 if (!isALPHA(*pos)) {
8025 U8 tmpbuf[UTF8_MAXLEN+1];
8028 if (*s == 'v') s++; /* get past 'v' */
8030 sv_setpvn(sv, "", 0);
8035 /* this is atoi() that tolerates underscores */
8038 while (--end >= s) {
8043 rev += (*end - '0') * mult;
8045 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8046 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8047 "Integer overflow in decimal number");
8051 if (rev > 0x7FFFFFFF)
8052 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8054 /* Append native character for the rev point */
8055 tmpend = uvchr_to_utf8(tmpbuf, rev);
8056 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8057 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8059 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8065 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8069 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);