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);
2193 if (r >= 0 && r < 255) {
2194 r = NATIVE_TO_ASCII(r);
2206 #pragma segment Perl_yylex
2218 I32 orig_keyword = 0;
2220 /* check if there's an identifier for us to look at */
2221 if (PL_pending_ident)
2222 return S_pending_ident(aTHX);
2224 /* no identifier pending identification */
2226 switch (PL_lex_state) {
2228 case LEX_NORMAL: /* Some compilers will produce faster */
2229 case LEX_INTERPNORMAL: /* code if we comment these out. */
2233 /* when we've already built the next token, just pull it out of the queue */
2236 yylval = PL_nextval[PL_nexttoke];
2238 PL_lex_state = PL_lex_defer;
2239 PL_expect = PL_lex_expect;
2240 PL_lex_defer = LEX_NORMAL;
2242 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2243 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2244 (IV)PL_nexttype[PL_nexttoke]); });
2246 return(PL_nexttype[PL_nexttoke]);
2248 /* interpolated case modifiers like \L \U, including \Q and \E.
2249 when we get here, PL_bufptr is at the \
2251 case LEX_INTERPCASEMOD:
2253 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2254 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2256 /* handle \E or end of string */
2257 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2261 if (PL_lex_casemods) {
2262 oldmod = PL_lex_casestack[--PL_lex_casemods];
2263 PL_lex_casestack[PL_lex_casemods] = '\0';
2265 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2267 PL_lex_state = LEX_INTERPCONCAT;
2271 if (PL_bufptr != PL_bufend)
2273 PL_lex_state = LEX_INTERPCONCAT;
2277 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2278 "### Saw case modifier at '%s'\n", PL_bufptr); });
2280 if (s[1] == '\\' && s[2] == 'E') {
2282 PL_lex_state = LEX_INTERPCONCAT;
2286 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2287 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2288 if (strchr("LU", *s) &&
2289 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2290 PL_lex_casestack[--PL_lex_casemods] = '\0';
2293 if (PL_lex_casemods > 10)
2294 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2295 PL_lex_casestack[PL_lex_casemods++] = *s;
2296 PL_lex_casestack[PL_lex_casemods] = '\0';
2297 PL_lex_state = LEX_INTERPCONCAT;
2298 PL_nextval[PL_nexttoke].ival = 0;
2301 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2303 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2305 PL_nextval[PL_nexttoke].ival = OP_LC;
2307 PL_nextval[PL_nexttoke].ival = OP_UC;
2309 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2311 Perl_croak(aTHX_ "panic: yylex");
2315 if (PL_lex_starts) {
2324 case LEX_INTERPPUSH:
2325 return sublex_push();
2327 case LEX_INTERPSTART:
2328 if (PL_bufptr == PL_bufend)
2329 return sublex_done();
2330 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2331 "### Interpolated variable at '%s'\n", PL_bufptr); });
2333 PL_lex_dojoin = (*PL_bufptr == '@');
2334 PL_lex_state = LEX_INTERPNORMAL;
2335 if (PL_lex_dojoin) {
2336 PL_nextval[PL_nexttoke].ival = 0;
2338 force_ident("\"", '$');
2339 PL_nextval[PL_nexttoke].ival = 0;
2341 PL_nextval[PL_nexttoke].ival = 0;
2343 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2346 if (PL_lex_starts++) {
2352 case LEX_INTERPENDMAYBE:
2353 if (intuit_more(PL_bufptr)) {
2354 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2360 if (PL_lex_dojoin) {
2361 PL_lex_dojoin = FALSE;
2362 PL_lex_state = LEX_INTERPCONCAT;
2365 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2366 && SvEVALED(PL_lex_repl))
2368 if (PL_bufptr != PL_bufend)
2369 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2370 PL_lex_repl = Nullsv;
2373 case LEX_INTERPCONCAT:
2375 if (PL_lex_brackets)
2376 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2378 if (PL_bufptr == PL_bufend)
2379 return sublex_done();
2381 if (SvIVX(PL_linestr) == '\'') {
2382 SV *sv = newSVsv(PL_linestr);
2385 else if ( PL_hints & HINT_NEW_RE )
2386 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2387 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2391 s = scan_const(PL_bufptr);
2393 PL_lex_state = LEX_INTERPCASEMOD;
2395 PL_lex_state = LEX_INTERPSTART;
2398 if (s != PL_bufptr) {
2399 PL_nextval[PL_nexttoke] = yylval;
2402 if (PL_lex_starts++)
2412 PL_lex_state = LEX_NORMAL;
2413 s = scan_formline(PL_bufptr);
2414 if (!PL_lex_formbrack)
2420 PL_oldoldbufptr = PL_oldbufptr;
2423 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2424 exp_name[PL_expect], s);
2430 if (isIDFIRST_lazy_if(s,UTF))
2432 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2435 goto fake_eof; /* emulate EOF on ^D or ^Z */
2440 if (PL_lex_brackets) {
2441 if (PL_lex_formbrack)
2442 yyerror("Format not terminated");
2444 yyerror("Missing right curly or square bracket");
2446 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2447 "### Tokener got EOF\n");
2451 if (s++ < PL_bufend)
2452 goto retry; /* ignore stray nulls */
2455 if (!PL_in_eval && !PL_preambled) {
2456 PL_preambled = TRUE;
2457 sv_setpv(PL_linestr,incl_perldb());
2458 if (SvCUR(PL_linestr))
2459 sv_catpv(PL_linestr,";");
2461 while(AvFILLp(PL_preambleav) >= 0) {
2462 SV *tmpsv = av_shift(PL_preambleav);
2463 sv_catsv(PL_linestr, tmpsv);
2464 sv_catpv(PL_linestr, ";");
2467 sv_free((SV*)PL_preambleav);
2468 PL_preambleav = NULL;
2470 if (PL_minus_n || PL_minus_p) {
2471 sv_catpv(PL_linestr, "LINE: while (<>) {");
2473 sv_catpv(PL_linestr,"chomp;");
2476 if (strchr("/'\"", *PL_splitstr)
2477 && strchr(PL_splitstr + 1, *PL_splitstr))
2478 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2481 s = "'~#\200\1'"; /* surely one char is unused...*/
2482 while (s[1] && strchr(PL_splitstr, *s)) s++;
2484 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2485 "q" + (delim == '\''), delim);
2486 for (s = PL_splitstr; *s; s++) {
2488 sv_catpvn(PL_linestr, "\\", 1);
2489 sv_catpvn(PL_linestr, s, 1);
2491 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2495 sv_catpv(PL_linestr,"our @F=split(' ');");
2498 sv_catpv(PL_linestr, "\n");
2499 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2500 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2501 PL_last_lop = PL_last_uni = Nullch;
2502 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2503 SV *sv = NEWSV(85,0);
2505 sv_upgrade(sv, SVt_PVMG);
2506 sv_setsv(sv,PL_linestr);
2509 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2514 bof = PL_rsfp ? TRUE : FALSE;
2515 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2518 if (PL_preprocess && !PL_in_eval)
2519 (void)PerlProc_pclose(PL_rsfp);
2520 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2521 PerlIO_clearerr(PL_rsfp);
2523 (void)PerlIO_close(PL_rsfp);
2525 PL_doextract = FALSE;
2527 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2528 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2529 sv_catpv(PL_linestr,";}");
2530 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2531 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2532 PL_last_lop = PL_last_uni = Nullch;
2533 PL_minus_n = PL_minus_p = 0;
2536 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2537 PL_last_lop = PL_last_uni = Nullch;
2538 sv_setpv(PL_linestr,"");
2539 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2541 /* if it looks like the start of a BOM, check if it in fact is */
2542 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2543 #ifdef PERLIO_IS_STDIO
2544 # ifdef __GNU_LIBRARY__
2545 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2546 # define FTELL_FOR_PIPE_IS_BROKEN
2550 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2551 # define FTELL_FOR_PIPE_IS_BROKEN
2556 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2557 /* This loses the possibility to detect the bof
2558 * situation on perl -P when the libc5 is being used.
2559 * Workaround? Maybe attach some extra state to PL_rsfp?
2562 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2564 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2567 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2568 s = swallow_bom((U8*)s);
2572 /* Incest with pod. */
2573 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2574 sv_setpv(PL_linestr, "");
2575 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2576 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2577 PL_last_lop = PL_last_uni = Nullch;
2578 PL_doextract = FALSE;
2582 } while (PL_doextract);
2583 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2584 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2585 SV *sv = NEWSV(85,0);
2587 sv_upgrade(sv, SVt_PVMG);
2588 sv_setsv(sv,PL_linestr);
2591 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2593 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2594 PL_last_lop = PL_last_uni = Nullch;
2595 if (CopLINE(PL_curcop) == 1) {
2596 while (s < PL_bufend && isSPACE(*s))
2598 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2602 if (*s == '#' && *(s+1) == '!')
2604 #ifdef ALTERNATE_SHEBANG
2606 static char as[] = ALTERNATE_SHEBANG;
2607 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2608 d = s + (sizeof(as) - 1);
2610 #endif /* ALTERNATE_SHEBANG */
2619 while (*d && !isSPACE(*d))
2623 #ifdef ARG_ZERO_IS_SCRIPT
2624 if (ipathend > ipath) {
2626 * HP-UX (at least) sets argv[0] to the script name,
2627 * which makes $^X incorrect. And Digital UNIX and Linux,
2628 * at least, set argv[0] to the basename of the Perl
2629 * interpreter. So, having found "#!", we'll set it right.
2631 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2632 assert(SvPOK(x) || SvGMAGICAL(x));
2633 if (sv_eq(x, CopFILESV(PL_curcop))) {
2634 sv_setpvn(x, ipath, ipathend - ipath);
2640 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2641 char *lstart = SvPV(x,llen);
2643 bstart += blen - llen;
2644 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2645 sv_setpvn(x, ipath, ipathend - ipath);
2650 TAINT_NOT; /* $^X is always tainted, but that's OK */
2652 #endif /* ARG_ZERO_IS_SCRIPT */
2657 d = instr(s,"perl -");
2659 d = instr(s,"perl");
2661 /* avoid getting into infinite loops when shebang
2662 * line contains "Perl" rather than "perl" */
2664 for (d = ipathend-4; d >= ipath; --d) {
2665 if ((*d == 'p' || *d == 'P')
2666 && !ibcmp(d, "perl", 4))
2676 #ifdef ALTERNATE_SHEBANG
2678 * If the ALTERNATE_SHEBANG on this system starts with a
2679 * character that can be part of a Perl expression, then if
2680 * we see it but not "perl", we're probably looking at the
2681 * start of Perl code, not a request to hand off to some
2682 * other interpreter. Similarly, if "perl" is there, but
2683 * not in the first 'word' of the line, we assume the line
2684 * contains the start of the Perl program.
2686 if (d && *s != '#') {
2688 while (*c && !strchr("; \t\r\n\f\v#", *c))
2691 d = Nullch; /* "perl" not in first word; ignore */
2693 *s = '#'; /* Don't try to parse shebang line */
2695 #endif /* ALTERNATE_SHEBANG */
2696 #ifndef MACOS_TRADITIONAL
2701 !instr(s,"indir") &&
2702 instr(PL_origargv[0],"perl"))
2708 while (s < PL_bufend && isSPACE(*s))
2710 if (s < PL_bufend) {
2711 Newz(899,newargv,PL_origargc+3,char*);
2713 while (s < PL_bufend && !isSPACE(*s))
2716 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2719 newargv = PL_origargv;
2722 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2724 Perl_croak(aTHX_ "Can't exec %s", ipath);
2728 U32 oldpdb = PL_perldb;
2729 bool oldn = PL_minus_n;
2730 bool oldp = PL_minus_p;
2732 while (*d && !isSPACE(*d)) d++;
2733 while (SPACE_OR_TAB(*d)) d++;
2736 bool switches_done = PL_doswitches;
2738 if (*d == 'M' || *d == 'm') {
2740 while (*d && !isSPACE(*d)) d++;
2741 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2744 d = moreswitches(d);
2746 if (PL_doswitches && !switches_done) {
2747 int argc = PL_origargc;
2748 char **argv = PL_origargv;
2751 } while (argc && argv[0][0] == '-' && argv[0][1]);
2752 init_argv_symbols(argc,argv);
2754 if ((PERLDB_LINE && !oldpdb) ||
2755 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2756 /* if we have already added "LINE: while (<>) {",
2757 we must not do it again */
2759 sv_setpv(PL_linestr, "");
2760 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2761 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2762 PL_last_lop = PL_last_uni = Nullch;
2763 PL_preambled = FALSE;
2765 (void)gv_fetchfile(PL_origfilename);
2768 if (PL_doswitches && !switches_done) {
2769 int argc = PL_origargc;
2770 char **argv = PL_origargv;
2773 } while (argc && argv[0][0] == '-' && argv[0][1]);
2774 init_argv_symbols(argc,argv);
2780 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2782 PL_lex_state = LEX_FORMLINE;
2787 #ifdef PERL_STRICT_CR
2788 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2790 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2792 case ' ': case '\t': case '\f': case 013:
2793 #ifdef MACOS_TRADITIONAL
2800 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2801 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2802 /* handle eval qq[#line 1 "foo"\n ...] */
2803 CopLINE_dec(PL_curcop);
2807 while (s < d && *s != '\n')
2811 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2812 Perl_croak(aTHX_ "panic: input overflow");
2814 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2816 PL_lex_state = LEX_FORMLINE;
2826 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2833 while (s < PL_bufend && SPACE_OR_TAB(*s))
2836 if (strnEQ(s,"=>",2)) {
2837 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2838 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2839 "### Saw unary minus before =>, forcing word '%s'\n", s);
2841 OPERATOR('-'); /* unary minus */
2843 PL_last_uni = PL_oldbufptr;
2845 case 'r': ftst = OP_FTEREAD; break;
2846 case 'w': ftst = OP_FTEWRITE; break;
2847 case 'x': ftst = OP_FTEEXEC; break;
2848 case 'o': ftst = OP_FTEOWNED; break;
2849 case 'R': ftst = OP_FTRREAD; break;
2850 case 'W': ftst = OP_FTRWRITE; break;
2851 case 'X': ftst = OP_FTREXEC; break;
2852 case 'O': ftst = OP_FTROWNED; break;
2853 case 'e': ftst = OP_FTIS; break;
2854 case 'z': ftst = OP_FTZERO; break;
2855 case 's': ftst = OP_FTSIZE; break;
2856 case 'f': ftst = OP_FTFILE; break;
2857 case 'd': ftst = OP_FTDIR; break;
2858 case 'l': ftst = OP_FTLINK; break;
2859 case 'p': ftst = OP_FTPIPE; break;
2860 case 'S': ftst = OP_FTSOCK; break;
2861 case 'u': ftst = OP_FTSUID; break;
2862 case 'g': ftst = OP_FTSGID; break;
2863 case 'k': ftst = OP_FTSVTX; break;
2864 case 'b': ftst = OP_FTBLK; break;
2865 case 'c': ftst = OP_FTCHR; break;
2866 case 't': ftst = OP_FTTTY; break;
2867 case 'T': ftst = OP_FTTEXT; break;
2868 case 'B': ftst = OP_FTBINARY; break;
2869 case 'M': case 'A': case 'C':
2870 gv_fetchpv("\024",TRUE, SVt_PV);
2872 case 'M': ftst = OP_FTMTIME; break;
2873 case 'A': ftst = OP_FTATIME; break;
2874 case 'C': ftst = OP_FTCTIME; break;
2882 PL_last_lop_op = (OPCODE)ftst;
2883 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2884 "### Saw file test %c\n", (int)ftst);
2889 /* Assume it was a minus followed by a one-letter named
2890 * subroutine call (or a -bareword), then. */
2891 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2892 "### '-%c' looked like a file test but was not\n",
2901 if (PL_expect == XOPERATOR)
2906 else if (*s == '>') {
2909 if (isIDFIRST_lazy_if(s,UTF)) {
2910 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2918 if (PL_expect == XOPERATOR)
2921 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2923 OPERATOR('-'); /* unary minus */
2930 if (PL_expect == XOPERATOR)
2935 if (PL_expect == XOPERATOR)
2938 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2944 if (PL_expect != XOPERATOR) {
2945 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2946 PL_expect = XOPERATOR;
2947 force_ident(PL_tokenbuf, '*');
2960 if (PL_expect == XOPERATOR) {
2964 PL_tokenbuf[0] = '%';
2965 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2966 if (!PL_tokenbuf[1]) {
2969 PL_pending_ident = '%';
2988 switch (PL_expect) {
2991 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2993 PL_bufptr = s; /* update in case we back off */
2999 PL_expect = XTERMBLOCK;
3003 while (isIDFIRST_lazy_if(s,UTF)) {
3004 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3005 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3006 if (tmp < 0) tmp = -tmp;
3022 d = scan_str(d,TRUE,TRUE);
3024 /* MUST advance bufptr here to avoid bogus
3025 "at end of line" context messages from yyerror().
3027 PL_bufptr = s + len;
3028 yyerror("Unterminated attribute parameter in attribute list");
3031 return 0; /* EOF indicator */
3035 SV *sv = newSVpvn(s, len);
3036 sv_catsv(sv, PL_lex_stuff);
3037 attrs = append_elem(OP_LIST, attrs,
3038 newSVOP(OP_CONST, 0, sv));
3039 SvREFCNT_dec(PL_lex_stuff);
3040 PL_lex_stuff = Nullsv;
3043 if (len == 6 && strnEQ(s, "unique", len)) {
3044 if (PL_in_my == KEY_our)
3046 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3048 ; /* skip to avoid loading attributes.pm */
3051 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3054 /* NOTE: any CV attrs applied here need to be part of
3055 the CVf_BUILTIN_ATTRS define in cv.h! */
3056 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3057 CvLVALUE_on(PL_compcv);
3058 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3059 CvLOCKED_on(PL_compcv);
3060 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3061 CvMETHOD_on(PL_compcv);
3062 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3063 CvASSERTION_on(PL_compcv);
3064 /* After we've set the flags, it could be argued that
3065 we don't need to do the attributes.pm-based setting
3066 process, and shouldn't bother appending recognized
3067 flags. To experiment with that, uncomment the
3068 following "else". (Note that's already been
3069 uncommented. That keeps the above-applied built-in
3070 attributes from being intercepted (and possibly
3071 rejected) by a package's attribute routines, but is
3072 justified by the performance win for the common case
3073 of applying only built-in attributes.) */
3075 attrs = append_elem(OP_LIST, attrs,
3076 newSVOP(OP_CONST, 0,
3080 if (*s == ':' && s[1] != ':')
3083 break; /* require real whitespace or :'s */
3085 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3086 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3087 char q = ((*s == '\'') ? '"' : '\'');
3088 /* If here for an expression, and parsed no attrs, back off. */
3089 if (tmp == '=' && !attrs) {
3093 /* MUST advance bufptr here to avoid bogus "at end of line"
3094 context messages from yyerror().
3098 yyerror("Unterminated attribute list");
3100 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3108 PL_nextval[PL_nexttoke].opval = attrs;
3116 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3117 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3134 if (PL_lex_brackets <= 0)
3135 yyerror("Unmatched right square bracket");
3138 if (PL_lex_state == LEX_INTERPNORMAL) {
3139 if (PL_lex_brackets == 0) {
3140 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3141 PL_lex_state = LEX_INTERPEND;
3148 if (PL_lex_brackets > 100) {
3149 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3151 switch (PL_expect) {
3153 if (PL_lex_formbrack) {
3157 if (PL_oldoldbufptr == PL_last_lop)
3158 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3160 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3161 OPERATOR(HASHBRACK);
3163 while (s < PL_bufend && SPACE_OR_TAB(*s))
3166 PL_tokenbuf[0] = '\0';
3167 if (d < PL_bufend && *d == '-') {
3168 PL_tokenbuf[0] = '-';
3170 while (d < PL_bufend && SPACE_OR_TAB(*d))
3173 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3174 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3176 while (d < PL_bufend && SPACE_OR_TAB(*d))
3179 char minus = (PL_tokenbuf[0] == '-');
3180 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3188 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3193 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3198 if (PL_oldoldbufptr == PL_last_lop)
3199 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3201 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3204 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3206 /* This hack is to get the ${} in the message. */
3208 yyerror("syntax error");
3211 OPERATOR(HASHBRACK);
3213 /* This hack serves to disambiguate a pair of curlies
3214 * as being a block or an anon hash. Normally, expectation
3215 * determines that, but in cases where we're not in a
3216 * position to expect anything in particular (like inside
3217 * eval"") we have to resolve the ambiguity. This code
3218 * covers the case where the first term in the curlies is a
3219 * quoted string. Most other cases need to be explicitly
3220 * disambiguated by prepending a `+' before the opening
3221 * curly in order to force resolution as an anon hash.
3223 * XXX should probably propagate the outer expectation
3224 * into eval"" to rely less on this hack, but that could
3225 * potentially break current behavior of eval"".
3229 if (*s == '\'' || *s == '"' || *s == '`') {
3230 /* common case: get past first string, handling escapes */
3231 for (t++; t < PL_bufend && *t != *s;)
3232 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3236 else if (*s == 'q') {
3239 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3242 /* skip q//-like construct */
3244 char open, close, term;
3247 while (t < PL_bufend && isSPACE(*t))
3249 /* check for q => */
3250 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3251 OPERATOR(HASHBRACK);
3255 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3259 for (t++; t < PL_bufend; t++) {
3260 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3262 else if (*t == open)
3266 for (t++; t < PL_bufend; t++) {
3267 if (*t == '\\' && t+1 < PL_bufend)
3269 else if (*t == close && --brackets <= 0)
3271 else if (*t == open)
3278 /* skip plain q word */
3279 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3282 else if (isALNUM_lazy_if(t,UTF)) {
3284 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3287 while (t < PL_bufend && isSPACE(*t))
3289 /* if comma follows first term, call it an anon hash */
3290 /* XXX it could be a comma expression with loop modifiers */
3291 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3292 || (*t == '=' && t[1] == '>')))
3293 OPERATOR(HASHBRACK);
3294 if (PL_expect == XREF)
3297 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3303 yylval.ival = CopLINE(PL_curcop);
3304 if (isSPACE(*s) || *s == '#')
3305 PL_copline = NOLINE; /* invalidate current command line number */
3310 if (PL_lex_brackets <= 0)
3311 yyerror("Unmatched right curly bracket");
3313 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3314 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3315 PL_lex_formbrack = 0;
3316 if (PL_lex_state == LEX_INTERPNORMAL) {
3317 if (PL_lex_brackets == 0) {
3318 if (PL_expect & XFAKEBRACK) {
3319 PL_expect &= XENUMMASK;
3320 PL_lex_state = LEX_INTERPEND;
3322 return yylex(); /* ignore fake brackets */
3324 if (*s == '-' && s[1] == '>')
3325 PL_lex_state = LEX_INTERPENDMAYBE;
3326 else if (*s != '[' && *s != '{')
3327 PL_lex_state = LEX_INTERPEND;
3330 if (PL_expect & XFAKEBRACK) {
3331 PL_expect &= XENUMMASK;
3333 return yylex(); /* ignore fake brackets */
3343 if (PL_expect == XOPERATOR) {
3344 if (ckWARN(WARN_SEMICOLON)
3345 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3347 CopLINE_dec(PL_curcop);
3348 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3349 CopLINE_inc(PL_curcop);
3354 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3356 PL_expect = XOPERATOR;
3357 force_ident(PL_tokenbuf, '&');
3361 yylval.ival = (OPpENTERSUB_AMPER<<8);
3380 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3381 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3383 if (PL_expect == XSTATE && isALPHA(tmp) &&
3384 (s == PL_linestart+1 || s[-2] == '\n') )
3386 if (PL_in_eval && !PL_rsfp) {
3391 if (strnEQ(s,"=cut",4)) {
3405 PL_doextract = TRUE;
3408 if (PL_lex_brackets < PL_lex_formbrack) {
3410 #ifdef PERL_STRICT_CR
3411 for (t = s; SPACE_OR_TAB(*t); t++) ;
3413 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3415 if (*t == '\n' || *t == '#') {
3433 if (PL_expect != XOPERATOR) {
3434 if (s[1] != '<' && !strchr(s,'>'))
3437 s = scan_heredoc(s);
3439 s = scan_inputsymbol(s);
3440 TERM(sublex_start());
3445 SHop(OP_LEFT_SHIFT);
3459 SHop(OP_RIGHT_SHIFT);
3468 if (PL_expect == XOPERATOR) {
3469 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3472 return ','; /* grandfather non-comma-format format */
3476 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3477 PL_tokenbuf[0] = '@';
3478 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3479 sizeof PL_tokenbuf - 1, FALSE);
3480 if (PL_expect == XOPERATOR)
3481 no_op("Array length", s);
3482 if (!PL_tokenbuf[1])
3484 PL_expect = XOPERATOR;
3485 PL_pending_ident = '#';
3489 PL_tokenbuf[0] = '$';
3490 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3491 sizeof PL_tokenbuf - 1, FALSE);
3492 if (PL_expect == XOPERATOR)
3494 if (!PL_tokenbuf[1]) {
3496 yyerror("Final $ should be \\$ or $name");
3500 /* This kludge not intended to be bulletproof. */
3501 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3502 yylval.opval = newSVOP(OP_CONST, 0,
3503 newSViv(PL_compiling.cop_arybase));
3504 yylval.opval->op_private = OPpCONST_ARYBASE;
3510 if (PL_lex_state == LEX_NORMAL)
3513 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3516 PL_tokenbuf[0] = '@';
3517 if (ckWARN(WARN_SYNTAX)) {
3519 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3522 PL_bufptr = skipspace(PL_bufptr);
3523 while (t < PL_bufend && *t != ']')
3525 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3526 "Multidimensional syntax %.*s not supported",
3527 (t - PL_bufptr) + 1, PL_bufptr);
3531 else if (*s == '{') {
3532 PL_tokenbuf[0] = '%';
3533 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3534 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3536 char tmpbuf[sizeof PL_tokenbuf];
3538 for (t++; isSPACE(*t); t++) ;
3539 if (isIDFIRST_lazy_if(t,UTF)) {
3540 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3541 for (; isSPACE(*t); t++) ;
3542 if (*t == ';' && get_cv(tmpbuf, FALSE))
3543 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3544 "You need to quote \"%s\"", tmpbuf);
3550 PL_expect = XOPERATOR;
3551 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3552 bool islop = (PL_last_lop == PL_oldoldbufptr);
3553 if (!islop || PL_last_lop_op == OP_GREPSTART)
3554 PL_expect = XOPERATOR;
3555 else if (strchr("$@\"'`q", *s))
3556 PL_expect = XTERM; /* e.g. print $fh "foo" */
3557 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3558 PL_expect = XTERM; /* e.g. print $fh &sub */
3559 else if (isIDFIRST_lazy_if(s,UTF)) {
3560 char tmpbuf[sizeof PL_tokenbuf];
3561 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3562 if ((tmp = keyword(tmpbuf, len))) {
3563 /* binary operators exclude handle interpretations */
3575 PL_expect = XTERM; /* e.g. print $fh length() */
3580 PL_expect = XTERM; /* e.g. print $fh subr() */
3583 else if (isDIGIT(*s))
3584 PL_expect = XTERM; /* e.g. print $fh 3 */
3585 else if (*s == '.' && isDIGIT(s[1]))
3586 PL_expect = XTERM; /* e.g. print $fh .3 */
3587 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3588 PL_expect = XTERM; /* e.g. print $fh -1 */
3589 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3590 PL_expect = XTERM; /* e.g. print $fh /.../
3591 XXX except DORDOR operator */
3592 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3593 PL_expect = XTERM; /* print $fh <<"EOF" */
3595 PL_pending_ident = '$';
3599 if (PL_expect == XOPERATOR)
3601 PL_tokenbuf[0] = '@';
3602 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3603 if (!PL_tokenbuf[1]) {
3606 if (PL_lex_state == LEX_NORMAL)
3608 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3610 PL_tokenbuf[0] = '%';
3612 /* Warn about @ where they meant $. */
3613 if (ckWARN(WARN_SYNTAX)) {
3614 if (*s == '[' || *s == '{') {
3616 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3618 if (*t == '}' || *t == ']') {
3620 PL_bufptr = skipspace(PL_bufptr);
3621 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3622 "Scalar value %.*s better written as $%.*s",
3623 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3628 PL_pending_ident = '@';
3631 case '/': /* may be division, defined-or, or pattern */
3632 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3636 case '?': /* may either be conditional or pattern */
3637 if(PL_expect == XOPERATOR) {
3645 /* A // operator. */
3655 /* Disable warning on "study /blah/" */
3656 if (PL_oldoldbufptr == PL_last_uni
3657 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3658 || memNE(PL_last_uni, "study", 5)
3659 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3662 s = scan_pat(s,OP_MATCH);
3663 TERM(sublex_start());
3667 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3668 #ifdef PERL_STRICT_CR
3671 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3673 && (s == PL_linestart || s[-1] == '\n') )
3675 PL_lex_formbrack = 0;
3679 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3685 yylval.ival = OPf_SPECIAL;
3691 if (PL_expect != XOPERATOR)
3696 case '0': case '1': case '2': case '3': case '4':
3697 case '5': case '6': case '7': case '8': case '9':
3698 s = scan_num(s, &yylval);
3699 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3700 "### Saw number in '%s'\n", s);
3702 if (PL_expect == XOPERATOR)
3707 s = scan_str(s,FALSE,FALSE);
3708 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3709 "### Saw string before '%s'\n", s);
3711 if (PL_expect == XOPERATOR) {
3712 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3715 return ','; /* grandfather non-comma-format format */
3721 missingterm((char*)0);
3722 yylval.ival = OP_CONST;
3723 TERM(sublex_start());
3726 s = scan_str(s,FALSE,FALSE);
3727 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3728 "### Saw string before '%s'\n", s);
3730 if (PL_expect == XOPERATOR) {
3731 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3734 return ','; /* grandfather non-comma-format format */
3740 missingterm((char*)0);
3741 yylval.ival = OP_CONST;
3742 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3743 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3744 yylval.ival = OP_STRINGIFY;
3748 TERM(sublex_start());
3751 s = scan_str(s,FALSE,FALSE);
3752 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3753 "### Saw backtick string before '%s'\n", s);
3755 if (PL_expect == XOPERATOR)
3756 no_op("Backticks",s);
3758 missingterm((char*)0);
3759 yylval.ival = OP_BACKTICK;
3761 TERM(sublex_start());
3765 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3766 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3768 if (PL_expect == XOPERATOR)
3769 no_op("Backslash",s);
3773 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3777 while (isDIGIT(*start) || *start == '_')
3779 if (*start == '.' && isDIGIT(start[1])) {
3780 s = scan_num(s, &yylval);
3783 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3784 else if (!isALPHA(*start) && (PL_expect == XTERM
3785 || PL_expect == XREF || PL_expect == XSTATE
3786 || PL_expect == XTERMORDORDOR)) {
3790 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3793 s = scan_num(s, &yylval);
3800 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3840 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3842 /* Some keywords can be followed by any delimiter, including ':' */
3843 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3844 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3845 (PL_tokenbuf[0] == 'q' &&
3846 strchr("qwxr", PL_tokenbuf[1])))));
3848 /* x::* is just a word, unless x is "CORE" */
3849 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3853 while (d < PL_bufend && isSPACE(*d))
3854 d++; /* no comments skipped here, or s### is misparsed */
3856 /* Is this a label? */
3857 if (!tmp && PL_expect == XSTATE
3858 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3860 yylval.pval = savepv(PL_tokenbuf);
3865 /* Check for keywords */
3866 tmp = keyword(PL_tokenbuf, len);
3868 /* Is this a word before a => operator? */
3869 if (*d == '=' && d[1] == '>') {
3871 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3872 yylval.opval->op_private = OPpCONST_BARE;
3873 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3874 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3878 if (tmp < 0) { /* second-class keyword? */
3879 GV *ogv = Nullgv; /* override (winner) */
3880 GV *hgv = Nullgv; /* hidden (loser) */
3881 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3883 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3886 if (GvIMPORTED_CV(gv))
3888 else if (! CvMETHOD(cv))
3892 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3893 (gv = *gvp) != (GV*)&PL_sv_undef &&
3894 GvCVu(gv) && GvIMPORTED_CV(gv))
3901 tmp = 0; /* overridden by import or by GLOBAL */
3904 && -tmp==KEY_lock /* XXX generalizable kludge */
3906 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3908 tmp = 0; /* any sub overrides "weak" keyword */
3910 else { /* no override */
3912 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3913 Perl_warner(aTHX_ packWARN(WARN_MISC),
3914 "dump() better written as CORE::dump()");
3918 if (ckWARN(WARN_AMBIGUOUS) && hgv
3919 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3920 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3921 "Ambiguous call resolved as CORE::%s(), %s",
3922 GvENAME(hgv), "qualify as such or use &");
3929 default: /* not a keyword */
3933 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3935 /* Get the rest if it looks like a package qualifier */
3937 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3939 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3942 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3943 *s == '\'' ? "'" : "::");
3948 if (PL_expect == XOPERATOR) {
3949 if (PL_bufptr == PL_linestart) {
3950 CopLINE_dec(PL_curcop);
3951 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3952 CopLINE_inc(PL_curcop);
3955 no_op("Bareword",s);
3958 /* Look for a subroutine with this name in current package,
3959 unless name is "Foo::", in which case Foo is a bearword
3960 (and a package name). */
3963 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3965 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3966 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3967 "Bareword \"%s\" refers to nonexistent package",
3970 PL_tokenbuf[len] = '\0';
3977 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3980 /* if we saw a global override before, get the right name */
3983 sv = newSVpvn("CORE::GLOBAL::",14);
3984 sv_catpv(sv,PL_tokenbuf);
3987 sv = newSVpv(PL_tokenbuf,0);
3989 /* Presume this is going to be a bareword of some sort. */
3992 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3993 yylval.opval->op_private = OPpCONST_BARE;
3994 /* UTF-8 package name? */
3995 if (UTF && !IN_BYTES &&
3996 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3999 /* And if "Foo::", then that's what it certainly is. */
4004 /* See if it's the indirect object for a list operator. */
4006 if (PL_oldoldbufptr &&
4007 PL_oldoldbufptr < PL_bufptr &&
4008 (PL_oldoldbufptr == PL_last_lop
4009 || PL_oldoldbufptr == PL_last_uni) &&
4010 /* NO SKIPSPACE BEFORE HERE! */
4011 (PL_expect == XREF ||
4012 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
4014 bool immediate_paren = *s == '(';
4016 /* (Now we can afford to cross potential line boundary.) */
4019 /* Two barewords in a row may indicate method call. */
4021 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
4024 /* If not a declared subroutine, it's an indirect object. */
4025 /* (But it's an indir obj regardless for sort.) */
4027 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4028 ((!gv || !GvCVu(gv)) &&
4029 (PL_last_lop_op != OP_MAPSTART &&
4030 PL_last_lop_op != OP_GREPSTART))))
4032 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4037 PL_expect = XOPERATOR;
4040 /* Is this a word before a => operator? */
4041 if (*s == '=' && s[1] == '>' && !pkgname) {
4043 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4044 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4045 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4049 /* If followed by a paren, it's certainly a subroutine. */
4052 if (gv && GvCVu(gv)) {
4053 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4054 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4059 PL_nextval[PL_nexttoke].opval = yylval.opval;
4060 PL_expect = XOPERATOR;
4066 /* If followed by var or block, call it a method (unless sub) */
4068 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4069 PL_last_lop = PL_oldbufptr;
4070 PL_last_lop_op = OP_METHOD;
4074 /* If followed by a bareword, see if it looks like indir obj. */
4077 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4078 && (tmp = intuit_method(s,gv)))
4081 /* Not a method, so call it a subroutine (if defined) */
4083 if (gv && GvCVu(gv)) {
4085 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4086 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4087 "Ambiguous use of -%s resolved as -&%s()",
4088 PL_tokenbuf, PL_tokenbuf);
4089 /* Check for a constant sub */
4091 if ((sv = cv_const_sv(cv))) {
4093 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4094 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4095 yylval.opval->op_private = 0;
4099 /* Resolve to GV now. */
4100 op_free(yylval.opval);
4101 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4102 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4103 PL_last_lop = PL_oldbufptr;
4104 PL_last_lop_op = OP_ENTERSUB;
4105 /* Is there a prototype? */
4108 char *proto = SvPV((SV*)cv, len);
4111 if (strEQ(proto, "$"))
4113 while (*proto == ';')
4115 if (*proto == '&' && *s == '{') {
4116 sv_setpv(PL_subname, PL_curstash ?
4117 "__ANON__" : "__ANON__::__ANON__");
4121 PL_nextval[PL_nexttoke].opval = yylval.opval;
4127 /* Call it a bare word */
4129 if (PL_hints & HINT_STRICT_SUBS)
4130 yylval.opval->op_private |= OPpCONST_STRICT;
4133 if (ckWARN(WARN_RESERVED)) {
4134 if (lastchar != '-') {
4135 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4136 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4137 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4144 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4145 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4146 "Operator or semicolon missing before %c%s",
4147 lastchar, PL_tokenbuf);
4148 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4149 "Ambiguous use of %c resolved as operator %c",
4150 lastchar, lastchar);
4156 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4157 newSVpv(CopFILE(PL_curcop),0));
4161 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4162 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4165 case KEY___PACKAGE__:
4166 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4168 ? newSVsv(PL_curstname)
4177 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4178 char *pname = "main";
4179 if (PL_tokenbuf[2] == 'D')
4180 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4181 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4184 GvIOp(gv) = newIO();
4185 IoIFP(GvIOp(gv)) = PL_rsfp;
4186 #if defined(HAS_FCNTL) && defined(F_SETFD)
4188 int fd = PerlIO_fileno(PL_rsfp);
4189 fcntl(fd,F_SETFD,fd >= 3);
4192 /* Mark this internal pseudo-handle as clean */
4193 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4195 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4196 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4197 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4199 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4200 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4201 /* if the script was opened in binmode, we need to revert
4202 * it to text mode for compatibility; but only iff it has CRs
4203 * XXX this is a questionable hack at best. */
4204 if (PL_bufend-PL_bufptr > 2
4205 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4208 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4209 loc = PerlIO_tell(PL_rsfp);
4210 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4213 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4215 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4216 #endif /* NETWARE */
4217 #ifdef PERLIO_IS_STDIO /* really? */
4218 # if defined(__BORLANDC__)
4219 /* XXX see note in do_binmode() */
4220 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4224 PerlIO_seek(PL_rsfp, loc, 0);
4228 #ifdef PERLIO_LAYERS
4231 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4232 else if (PL_encoding) {
4239 XPUSHs(PL_encoding);
4241 call_method("name", G_SCALAR);
4245 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4246 Perl_form(aTHX_ ":encoding(%"SVf")",
4264 if (PL_expect == XSTATE) {
4271 if (*s == ':' && s[1] == ':') {
4274 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4275 if (!(tmp = keyword(PL_tokenbuf, len)))
4276 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4290 LOP(OP_ACCEPT,XTERM);
4296 LOP(OP_ATAN2,XTERM);
4302 LOP(OP_BINMODE,XTERM);
4305 LOP(OP_BLESS,XTERM);
4314 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4331 if (!PL_cryptseen) {
4332 PL_cryptseen = TRUE;
4336 LOP(OP_CRYPT,XTERM);
4339 LOP(OP_CHMOD,XTERM);
4342 LOP(OP_CHOWN,XTERM);
4345 LOP(OP_CONNECT,XTERM);
4361 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4365 PL_hints |= HINT_BLOCK_SCOPE;
4375 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4376 LOP(OP_DBMOPEN,XTERM);
4382 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4389 yylval.ival = CopLINE(PL_curcop);
4403 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4404 UNIBRACK(OP_ENTEREVAL);
4422 case KEY_endhostent:
4428 case KEY_endservent:
4431 case KEY_endprotoent:
4442 yylval.ival = CopLINE(PL_curcop);
4444 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4446 if ((PL_bufend - p) >= 3 &&
4447 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4449 else if ((PL_bufend - p) >= 4 &&
4450 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4453 if (isIDFIRST_lazy_if(p,UTF)) {
4454 p = scan_ident(p, PL_bufend,
4455 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4459 Perl_croak(aTHX_ "Missing $ on loop variable");
4464 LOP(OP_FORMLINE,XTERM);
4470 LOP(OP_FCNTL,XTERM);
4476 LOP(OP_FLOCK,XTERM);
4485 LOP(OP_GREPSTART, XREF);
4488 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4503 case KEY_getpriority:
4504 LOP(OP_GETPRIORITY,XTERM);
4506 case KEY_getprotobyname:
4509 case KEY_getprotobynumber:
4510 LOP(OP_GPBYNUMBER,XTERM);
4512 case KEY_getprotoent:
4524 case KEY_getpeername:
4525 UNI(OP_GETPEERNAME);
4527 case KEY_gethostbyname:
4530 case KEY_gethostbyaddr:
4531 LOP(OP_GHBYADDR,XTERM);
4533 case KEY_gethostent:
4536 case KEY_getnetbyname:
4539 case KEY_getnetbyaddr:
4540 LOP(OP_GNBYADDR,XTERM);
4545 case KEY_getservbyname:
4546 LOP(OP_GSBYNAME,XTERM);
4548 case KEY_getservbyport:
4549 LOP(OP_GSBYPORT,XTERM);
4551 case KEY_getservent:
4554 case KEY_getsockname:
4555 UNI(OP_GETSOCKNAME);
4557 case KEY_getsockopt:
4558 LOP(OP_GSOCKOPT,XTERM);
4580 yylval.ival = CopLINE(PL_curcop);
4584 LOP(OP_INDEX,XTERM);
4590 LOP(OP_IOCTL,XTERM);
4602 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4634 LOP(OP_LISTEN,XTERM);
4643 s = scan_pat(s,OP_MATCH);
4644 TERM(sublex_start());
4647 LOP(OP_MAPSTART, XREF);
4650 LOP(OP_MKDIR,XTERM);
4653 LOP(OP_MSGCTL,XTERM);
4656 LOP(OP_MSGGET,XTERM);
4659 LOP(OP_MSGRCV,XTERM);
4662 LOP(OP_MSGSND,XTERM);
4668 if (isIDFIRST_lazy_if(s,UTF)) {
4669 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4670 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4672 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4673 if (!PL_in_my_stash) {
4676 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4684 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4691 if (PL_expect != XSTATE)
4692 yyerror("\"no\" not allowed in expression");
4693 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4694 s = force_version(s, FALSE);
4699 if (*s == '(' || (s = skipspace(s), *s == '('))
4706 if (isIDFIRST_lazy_if(s,UTF)) {
4708 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4710 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4712 && !(t[0] == '=' && t[1] == '>')
4714 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4715 "Precedence problem: open %.*s should be open(%.*s)",
4716 d - s, s, d - s, s);
4722 yylval.ival = OP_OR;
4732 LOP(OP_OPEN_DIR,XTERM);
4735 checkcomma(s,PL_tokenbuf,"filehandle");
4739 checkcomma(s,PL_tokenbuf,"filehandle");
4758 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4762 LOP(OP_PIPE_OP,XTERM);
4765 s = scan_str(s,FALSE,FALSE);
4767 missingterm((char*)0);
4768 yylval.ival = OP_CONST;
4769 TERM(sublex_start());
4775 s = scan_str(s,FALSE,FALSE);
4777 missingterm((char*)0);
4779 if (SvCUR(PL_lex_stuff)) {
4782 d = SvPV_force(PL_lex_stuff, len);
4785 for (; isSPACE(*d) && len; --len, ++d) ;
4788 if (!warned && ckWARN(WARN_QW)) {
4789 for (; !isSPACE(*d) && len; --len, ++d) {
4791 Perl_warner(aTHX_ packWARN(WARN_QW),
4792 "Possible attempt to separate words with commas");
4795 else if (*d == '#') {
4796 Perl_warner(aTHX_ packWARN(WARN_QW),
4797 "Possible attempt to put comments in qw() list");
4803 for (; !isSPACE(*d) && len; --len, ++d) ;
4805 sv = newSVpvn(b, d-b);
4806 if (DO_UTF8(PL_lex_stuff))
4808 words = append_elem(OP_LIST, words,
4809 newSVOP(OP_CONST, 0, tokeq(sv)));
4813 PL_nextval[PL_nexttoke].opval = words;
4818 SvREFCNT_dec(PL_lex_stuff);
4819 PL_lex_stuff = Nullsv;
4825 s = scan_str(s,FALSE,FALSE);
4827 missingterm((char*)0);
4828 yylval.ival = OP_STRINGIFY;
4829 if (SvIVX(PL_lex_stuff) == '\'')
4830 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4831 TERM(sublex_start());
4834 s = scan_pat(s,OP_QR);
4835 TERM(sublex_start());
4838 s = scan_str(s,FALSE,FALSE);
4840 missingterm((char*)0);
4841 yylval.ival = OP_BACKTICK;
4843 TERM(sublex_start());
4851 s = force_version(s, FALSE);
4853 else if (*s != 'v' || !isDIGIT(s[1])
4854 || (s = force_version(s, TRUE), *s == 'v'))
4856 *PL_tokenbuf = '\0';
4857 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4858 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4859 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4861 yyerror("<> should be quotes");
4869 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4873 LOP(OP_RENAME,XTERM);
4882 LOP(OP_RINDEX,XTERM);
4892 UNIDOR(OP_READLINE);
4905 LOP(OP_REVERSE,XTERM);
4908 UNIDOR(OP_READLINK);
4916 TERM(sublex_start());
4918 TOKEN(1); /* force error */
4927 LOP(OP_SELECT,XTERM);
4933 LOP(OP_SEMCTL,XTERM);
4936 LOP(OP_SEMGET,XTERM);
4939 LOP(OP_SEMOP,XTERM);
4945 LOP(OP_SETPGRP,XTERM);
4947 case KEY_setpriority:
4948 LOP(OP_SETPRIORITY,XTERM);
4950 case KEY_sethostent:
4956 case KEY_setservent:
4959 case KEY_setprotoent:
4969 LOP(OP_SEEKDIR,XTERM);
4971 case KEY_setsockopt:
4972 LOP(OP_SSOCKOPT,XTERM);
4978 LOP(OP_SHMCTL,XTERM);
4981 LOP(OP_SHMGET,XTERM);
4984 LOP(OP_SHMREAD,XTERM);
4987 LOP(OP_SHMWRITE,XTERM);
4990 LOP(OP_SHUTDOWN,XTERM);
4999 LOP(OP_SOCKET,XTERM);
5001 case KEY_socketpair:
5002 LOP(OP_SOCKPAIR,XTERM);
5005 checkcomma(s,PL_tokenbuf,"subroutine name");
5007 if (*s == ';' || *s == ')') /* probably a close */
5008 Perl_croak(aTHX_ "sort is now a reserved word");
5010 s = force_word(s,WORD,TRUE,TRUE,FALSE);
5014 LOP(OP_SPLIT,XTERM);
5017 LOP(OP_SPRINTF,XTERM);
5020 LOP(OP_SPLICE,XTERM);
5035 LOP(OP_SUBSTR,XTERM);
5041 char tmpbuf[sizeof PL_tokenbuf];
5042 SSize_t tboffset = 0;
5043 expectation attrful;
5044 bool have_name, have_proto, bad_proto;
5049 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5050 (*s == ':' && s[1] == ':'))
5053 attrful = XATTRBLOCK;
5054 /* remember buffer pos'n for later force_word */
5055 tboffset = s - PL_oldbufptr;
5056 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5057 if (strchr(tmpbuf, ':'))
5058 sv_setpv(PL_subname, tmpbuf);
5060 sv_setsv(PL_subname,PL_curstname);
5061 sv_catpvn(PL_subname,"::",2);
5062 sv_catpvn(PL_subname,tmpbuf,len);
5069 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5070 PL_expect = XTERMBLOCK;
5071 attrful = XATTRTERM;
5072 sv_setpv(PL_subname,"?");
5076 if (key == KEY_format) {
5078 PL_lex_formbrack = PL_lex_brackets + 1;
5080 (void) force_word(PL_oldbufptr + tboffset, WORD,
5085 /* Look for a prototype */
5089 s = scan_str(s,FALSE,FALSE);
5091 Perl_croak(aTHX_ "Prototype not terminated");
5092 /* strip spaces and check for bad characters */
5093 d = SvPVX(PL_lex_stuff);
5096 for (p = d; *p; ++p) {
5099 if (!strchr("$@%*;[]&\\", *p))
5104 if (bad_proto && ckWARN(WARN_SYNTAX))
5105 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5106 "Illegal character in prototype for %"SVf" : %s",
5108 SvCUR(PL_lex_stuff) = tmp;
5116 if (*s == ':' && s[1] != ':')
5117 PL_expect = attrful;
5118 else if (!have_name && *s != '{' && key == KEY_sub)
5119 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5122 PL_nextval[PL_nexttoke].opval =
5123 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5124 PL_lex_stuff = Nullsv;
5128 sv_setpv(PL_subname,
5129 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5132 (void) force_word(PL_oldbufptr + tboffset, WORD,
5141 LOP(OP_SYSTEM,XREF);
5144 LOP(OP_SYMLINK,XTERM);
5147 LOP(OP_SYSCALL,XTERM);
5150 LOP(OP_SYSOPEN,XTERM);
5153 LOP(OP_SYSSEEK,XTERM);
5156 LOP(OP_SYSREAD,XTERM);
5159 LOP(OP_SYSWRITE,XTERM);
5163 TERM(sublex_start());
5184 LOP(OP_TRUNCATE,XTERM);
5196 yylval.ival = CopLINE(PL_curcop);
5200 yylval.ival = CopLINE(PL_curcop);
5204 LOP(OP_UNLINK,XTERM);
5210 LOP(OP_UNPACK,XTERM);
5213 LOP(OP_UTIME,XTERM);
5219 LOP(OP_UNSHIFT,XTERM);
5222 if (PL_expect != XSTATE)
5223 yyerror("\"use\" not allowed in expression");
5225 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5226 s = force_version(s, TRUE);
5227 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5228 PL_nextval[PL_nexttoke].opval = Nullop;
5231 else if (*s == 'v') {
5232 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5233 s = force_version(s, FALSE);
5237 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5238 s = force_version(s, FALSE);
5250 yylval.ival = CopLINE(PL_curcop);
5254 PL_hints |= HINT_BLOCK_SCOPE;
5261 LOP(OP_WAITPID,XTERM);
5270 ctl_l[0] = toCTRL('L');
5272 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5275 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5280 if (PL_expect == XOPERATOR)
5286 yylval.ival = OP_XOR;
5291 TERM(sublex_start());
5296 #pragma segment Main
5300 S_pending_ident(pTHX)
5303 register I32 tmp = 0;
5304 /* pit holds the identifier we read and pending_ident is reset */
5305 char pit = PL_pending_ident;
5306 PL_pending_ident = 0;
5308 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5309 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5311 /* if we're in a my(), we can't allow dynamics here.
5312 $foo'bar has already been turned into $foo::bar, so
5313 just check for colons.
5315 if it's a legal name, the OP is a PADANY.
5318 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5319 if (strchr(PL_tokenbuf,':'))
5320 yyerror(Perl_form(aTHX_ "No package name allowed for "
5321 "variable %s in \"our\"",
5323 tmp = allocmy(PL_tokenbuf);
5326 if (strchr(PL_tokenbuf,':'))
5327 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5329 yylval.opval = newOP(OP_PADANY, 0);
5330 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5336 build the ops for accesses to a my() variable.
5338 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5339 then used in a comparison. This catches most, but not
5340 all cases. For instance, it catches
5341 sort { my($a); $a <=> $b }
5343 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5344 (although why you'd do that is anyone's guess).
5347 if (!strchr(PL_tokenbuf,':')) {
5349 tmp = pad_findmy(PL_tokenbuf);
5350 if (tmp != NOT_IN_PAD) {
5351 /* might be an "our" variable" */
5352 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5353 /* build ops for a bareword */
5354 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5355 sv_catpvn(sym, "::", 2);
5356 sv_catpv(sym, PL_tokenbuf+1);
5357 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5358 yylval.opval->op_private = OPpCONST_ENTERED;
5359 gv_fetchpv(SvPVX(sym),
5361 ? (GV_ADDMULTI | GV_ADDINEVAL)
5364 ((PL_tokenbuf[0] == '$') ? SVt_PV
5365 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5370 /* if it's a sort block and they're naming $a or $b */
5371 if (PL_last_lop_op == OP_SORT &&
5372 PL_tokenbuf[0] == '$' &&
5373 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5376 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5377 d < PL_bufend && *d != '\n';
5380 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5381 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5387 yylval.opval = newOP(OP_PADANY, 0);
5388 yylval.opval->op_targ = tmp;
5394 Whine if they've said @foo in a doublequoted string,
5395 and @foo isn't a variable we can find in the symbol
5398 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5399 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5400 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5401 && ckWARN(WARN_AMBIGUOUS))
5403 /* Downgraded from fatal to warning 20000522 mjd */
5404 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5405 "Possible unintended interpolation of %s in string",
5410 /* build ops for a bareword */
5411 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5412 yylval.opval->op_private = OPpCONST_ENTERED;
5413 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5414 ((PL_tokenbuf[0] == '$') ? SVt_PV
5415 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5421 Perl_keyword(pTHX_ register char *d, I32 len)
5426 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5427 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5428 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5429 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5430 if (strEQ(d,"__END__")) return KEY___END__;
5434 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5439 if (strEQ(d,"and")) return -KEY_and;
5440 if (strEQ(d,"abs")) return -KEY_abs;
5443 if (strEQ(d,"alarm")) return -KEY_alarm;
5444 if (strEQ(d,"atan2")) return -KEY_atan2;
5447 if (strEQ(d,"accept")) return -KEY_accept;
5452 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5455 if (strEQ(d,"bless")) return -KEY_bless;
5456 if (strEQ(d,"bind")) return -KEY_bind;
5457 if (strEQ(d,"binmode")) return -KEY_binmode;
5460 if (strEQ(d,"CORE")) return -KEY_CORE;
5461 if (strEQ(d,"CHECK")) return KEY_CHECK;
5466 if (strEQ(d,"cmp")) return -KEY_cmp;
5467 if (strEQ(d,"chr")) return -KEY_chr;
5468 if (strEQ(d,"cos")) return -KEY_cos;
5471 if (strEQ(d,"chop")) return -KEY_chop;
5474 if (strEQ(d,"close")) return -KEY_close;
5475 if (strEQ(d,"chdir")) return -KEY_chdir;
5476 if (strEQ(d,"chomp")) return -KEY_chomp;
5477 if (strEQ(d,"chmod")) return -KEY_chmod;
5478 if (strEQ(d,"chown")) return -KEY_chown;
5479 if (strEQ(d,"crypt")) return -KEY_crypt;
5482 if (strEQ(d,"chroot")) return -KEY_chroot;
5483 if (strEQ(d,"caller")) return -KEY_caller;
5486 if (strEQ(d,"connect")) return -KEY_connect;
5489 if (strEQ(d,"closedir")) return -KEY_closedir;
5490 if (strEQ(d,"continue")) return -KEY_continue;
5495 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5500 if (strEQ(d,"do")) return KEY_do;
5503 if (strEQ(d,"die")) return -KEY_die;
5506 if (strEQ(d,"dump")) return -KEY_dump;
5509 if (strEQ(d,"delete")) return KEY_delete;
5512 if (strEQ(d,"defined")) return KEY_defined;
5513 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5516 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5521 if (strEQ(d,"END")) return KEY_END;
5526 if (strEQ(d,"eq")) return -KEY_eq;
5529 if (strEQ(d,"eof")) return -KEY_eof;
5530 if (strEQ(d,"err")) return -KEY_err;
5531 if (strEQ(d,"exp")) return -KEY_exp;
5534 if (strEQ(d,"else")) return KEY_else;
5535 if (strEQ(d,"exit")) return -KEY_exit;
5536 if (strEQ(d,"eval")) return KEY_eval;
5537 if (strEQ(d,"exec")) return -KEY_exec;
5538 if (strEQ(d,"each")) return -KEY_each;
5541 if (strEQ(d,"elsif")) return KEY_elsif;
5544 if (strEQ(d,"exists")) return KEY_exists;
5545 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5546 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5547 "elseif should be elsif");
5550 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5551 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5554 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5557 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5558 if (strEQ(d,"endservent")) return -KEY_endservent;
5561 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5568 if (strEQ(d,"for")) return KEY_for;
5571 if (strEQ(d,"fork")) return -KEY_fork;
5574 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5575 if (strEQ(d,"flock")) return -KEY_flock;
5578 if (strEQ(d,"format")) return KEY_format;
5579 if (strEQ(d,"fileno")) return -KEY_fileno;
5582 if (strEQ(d,"foreach")) return KEY_foreach;
5585 if (strEQ(d,"formline")) return -KEY_formline;
5590 if (strnEQ(d,"get",3)) {
5595 if (strEQ(d,"ppid")) return -KEY_getppid;
5596 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5599 if (strEQ(d,"pwent")) return -KEY_getpwent;
5600 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5601 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5604 if (strEQ(d,"peername")) return -KEY_getpeername;
5605 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5606 if (strEQ(d,"priority")) return -KEY_getpriority;
5609 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5612 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5616 else if (*d == 'h') {
5617 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5618 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5619 if (strEQ(d,"hostent")) return -KEY_gethostent;
5621 else if (*d == 'n') {
5622 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5623 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5624 if (strEQ(d,"netent")) return -KEY_getnetent;
5626 else if (*d == 's') {
5627 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5628 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5629 if (strEQ(d,"servent")) return -KEY_getservent;
5630 if (strEQ(d,"sockname")) return -KEY_getsockname;
5631 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5633 else if (*d == 'g') {
5634 if (strEQ(d,"grent")) return -KEY_getgrent;
5635 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5636 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5638 else if (*d == 'l') {
5639 if (strEQ(d,"login")) return -KEY_getlogin;
5641 else if (strEQ(d,"c")) return -KEY_getc;
5646 if (strEQ(d,"gt")) return -KEY_gt;
5647 if (strEQ(d,"ge")) return -KEY_ge;
5650 if (strEQ(d,"grep")) return KEY_grep;
5651 if (strEQ(d,"goto")) return KEY_goto;
5652 if (strEQ(d,"glob")) return KEY_glob;
5655 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5660 if (strEQ(d,"hex")) return -KEY_hex;
5663 if (strEQ(d,"INIT")) return KEY_INIT;
5668 if (strEQ(d,"if")) return KEY_if;
5671 if (strEQ(d,"int")) return -KEY_int;
5674 if (strEQ(d,"index")) return -KEY_index;
5675 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5680 if (strEQ(d,"join")) return -KEY_join;
5684 if (strEQ(d,"keys")) return -KEY_keys;
5685 if (strEQ(d,"kill")) return -KEY_kill;
5691 if (strEQ(d,"lt")) return -KEY_lt;
5692 if (strEQ(d,"le")) return -KEY_le;
5693 if (strEQ(d,"lc")) return -KEY_lc;
5696 if (strEQ(d,"log")) return -KEY_log;
5699 if (strEQ(d,"last")) return KEY_last;
5700 if (strEQ(d,"link")) return -KEY_link;
5701 if (strEQ(d,"lock")) return -KEY_lock;
5704 if (strEQ(d,"local")) return KEY_local;
5705 if (strEQ(d,"lstat")) return -KEY_lstat;
5708 if (strEQ(d,"length")) return -KEY_length;
5709 if (strEQ(d,"listen")) return -KEY_listen;
5712 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5715 if (strEQ(d,"localtime")) return -KEY_localtime;
5721 case 1: return KEY_m;
5723 if (strEQ(d,"my")) return KEY_my;
5726 if (strEQ(d,"map")) return KEY_map;
5729 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5732 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5733 if (strEQ(d,"msgget")) return -KEY_msgget;
5734 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5735 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5740 if (strEQ(d,"next")) return KEY_next;
5741 if (strEQ(d,"ne")) return -KEY_ne;
5742 if (strEQ(d,"not")) return -KEY_not;
5743 if (strEQ(d,"no")) return KEY_no;
5748 if (strEQ(d,"or")) return -KEY_or;
5751 if (strEQ(d,"ord")) return -KEY_ord;
5752 if (strEQ(d,"oct")) return -KEY_oct;
5753 if (strEQ(d,"our")) return KEY_our;
5756 if (strEQ(d,"open")) return -KEY_open;
5759 if (strEQ(d,"opendir")) return -KEY_opendir;
5766 if (strEQ(d,"pop")) return -KEY_pop;
5767 if (strEQ(d,"pos")) return KEY_pos;
5770 if (strEQ(d,"push")) return -KEY_push;
5771 if (strEQ(d,"pack")) return -KEY_pack;
5772 if (strEQ(d,"pipe")) return -KEY_pipe;
5775 if (strEQ(d,"print")) return KEY_print;
5778 if (strEQ(d,"printf")) return KEY_printf;
5781 if (strEQ(d,"package")) return KEY_package;
5784 if (strEQ(d,"prototype")) return KEY_prototype;
5789 if (strEQ(d,"q")) return KEY_q;
5790 if (strEQ(d,"qr")) return KEY_qr;
5791 if (strEQ(d,"qq")) return KEY_qq;
5792 if (strEQ(d,"qw")) return KEY_qw;
5793 if (strEQ(d,"qx")) return KEY_qx;
5795 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5800 if (strEQ(d,"ref")) return -KEY_ref;
5803 if (strEQ(d,"read")) return -KEY_read;
5804 if (strEQ(d,"rand")) return -KEY_rand;
5805 if (strEQ(d,"recv")) return -KEY_recv;
5806 if (strEQ(d,"redo")) return KEY_redo;
5809 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5810 if (strEQ(d,"reset")) return -KEY_reset;
5813 if (strEQ(d,"return")) return KEY_return;
5814 if (strEQ(d,"rename")) return -KEY_rename;
5815 if (strEQ(d,"rindex")) return -KEY_rindex;
5818 if (strEQ(d,"require")) return KEY_require;
5819 if (strEQ(d,"reverse")) return -KEY_reverse;
5820 if (strEQ(d,"readdir")) return -KEY_readdir;
5823 if (strEQ(d,"readlink")) return -KEY_readlink;
5824 if (strEQ(d,"readline")) return -KEY_readline;
5825 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5828 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5834 case 0: return KEY_s;
5836 if (strEQ(d,"scalar")) return KEY_scalar;
5841 if (strEQ(d,"seek")) return -KEY_seek;
5842 if (strEQ(d,"send")) return -KEY_send;
5845 if (strEQ(d,"semop")) return -KEY_semop;
5848 if (strEQ(d,"select")) return -KEY_select;
5849 if (strEQ(d,"semctl")) return -KEY_semctl;
5850 if (strEQ(d,"semget")) return -KEY_semget;
5853 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5854 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5857 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5858 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5861 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5864 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5865 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5866 if (strEQ(d,"setservent")) return -KEY_setservent;
5869 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5870 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5877 if (strEQ(d,"shift")) return -KEY_shift;
5880 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5881 if (strEQ(d,"shmget")) return -KEY_shmget;
5884 if (strEQ(d,"shmread")) return -KEY_shmread;
5887 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5888 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5893 if (strEQ(d,"sin")) return -KEY_sin;
5896 if (strEQ(d,"sleep")) return -KEY_sleep;
5899 if (strEQ(d,"sort")) return KEY_sort;
5900 if (strEQ(d,"socket")) return -KEY_socket;
5901 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5904 if (strEQ(d,"split")) return KEY_split;
5905 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5906 if (strEQ(d,"splice")) return -KEY_splice;
5909 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5912 if (strEQ(d,"srand")) return -KEY_srand;
5915 if (strEQ(d,"stat")) return -KEY_stat;
5916 if (strEQ(d,"study")) return KEY_study;
5919 if (strEQ(d,"substr")) return -KEY_substr;
5920 if (strEQ(d,"sub")) return KEY_sub;
5925 if (strEQ(d,"system")) return -KEY_system;
5928 if (strEQ(d,"symlink")) return -KEY_symlink;
5929 if (strEQ(d,"syscall")) return -KEY_syscall;
5930 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5931 if (strEQ(d,"sysread")) return -KEY_sysread;
5932 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5935 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5944 if (strEQ(d,"tr")) return KEY_tr;
5947 if (strEQ(d,"tie")) return KEY_tie;
5950 if (strEQ(d,"tell")) return -KEY_tell;
5951 if (strEQ(d,"tied")) return KEY_tied;
5952 if (strEQ(d,"time")) return -KEY_time;
5955 if (strEQ(d,"times")) return -KEY_times;
5958 if (strEQ(d,"telldir")) return -KEY_telldir;
5961 if (strEQ(d,"truncate")) return -KEY_truncate;
5968 if (strEQ(d,"uc")) return -KEY_uc;
5971 if (strEQ(d,"use")) return KEY_use;
5974 if (strEQ(d,"undef")) return KEY_undef;
5975 if (strEQ(d,"until")) return KEY_until;
5976 if (strEQ(d,"untie")) return KEY_untie;
5977 if (strEQ(d,"utime")) return -KEY_utime;
5978 if (strEQ(d,"umask")) return -KEY_umask;
5981 if (strEQ(d,"unless")) return KEY_unless;
5982 if (strEQ(d,"unpack")) return -KEY_unpack;
5983 if (strEQ(d,"unlink")) return -KEY_unlink;
5986 if (strEQ(d,"unshift")) return -KEY_unshift;
5987 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5992 if (strEQ(d,"values")) return -KEY_values;
5993 if (strEQ(d,"vec")) return -KEY_vec;
5998 if (strEQ(d,"warn")) return -KEY_warn;
5999 if (strEQ(d,"wait")) return -KEY_wait;
6002 if (strEQ(d,"while")) return KEY_while;
6003 if (strEQ(d,"write")) return -KEY_write;
6006 if (strEQ(d,"waitpid")) return -KEY_waitpid;
6009 if (strEQ(d,"wantarray")) return -KEY_wantarray;
6014 if (len == 1) return -KEY_x;
6015 if (strEQ(d,"xor")) return -KEY_xor;
6018 if (len == 1) return KEY_y;
6027 S_checkcomma(pTHX_ register char *s, char *name, char *what)
6031 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
6032 if (ckWARN(WARN_SYNTAX)) {
6034 for (w = s+2; *w && level; w++) {
6041 for (; *w && isSPACE(*w); w++) ;
6042 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6043 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6044 "%s (...) interpreted as function",name);
6047 while (s < PL_bufend && isSPACE(*s))
6051 while (s < PL_bufend && isSPACE(*s))
6053 if (isIDFIRST_lazy_if(s,UTF)) {
6055 while (isALNUM_lazy_if(s,UTF))
6057 while (s < PL_bufend && isSPACE(*s))
6062 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6066 Perl_croak(aTHX_ "No comma allowed after %s", what);
6071 /* Either returns sv, or mortalizes sv and returns a new SV*.
6072 Best used as sv=new_constant(..., sv, ...).
6073 If s, pv are NULL, calls subroutine with one argument,
6074 and type is used with error messages only. */
6077 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6081 HV *table = GvHV(PL_hintgv); /* ^H */
6085 const char *why1, *why2, *why3;
6087 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6090 why2 = strEQ(key,"charnames")
6091 ? "(possibly a missing \"use charnames ...\")"
6093 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6094 (type ? type: "undef"), why2);
6096 /* This is convoluted and evil ("goto considered harmful")
6097 * but I do not understand the intricacies of all the different
6098 * failure modes of %^H in here. The goal here is to make
6099 * the most probable error message user-friendly. --jhi */
6104 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6105 (type ? type: "undef"), why1, why2, why3);
6107 yyerror(SvPVX(msg));
6111 cvp = hv_fetch(table, key, strlen(key), FALSE);
6112 if (!cvp || !SvOK(*cvp)) {
6115 why3 = "} is not defined";
6118 sv_2mortal(sv); /* Parent created it permanently */
6121 pv = sv_2mortal(newSVpvn(s, len));
6123 typesv = sv_2mortal(newSVpv(type, 0));
6125 typesv = &PL_sv_undef;
6127 PUSHSTACKi(PERLSI_OVERLOAD);
6139 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6143 /* Check the eval first */
6144 if (!PL_in_eval && SvTRUE(ERRSV)) {
6146 sv_catpv(ERRSV, "Propagated");
6147 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6149 res = SvREFCNT_inc(sv);
6153 (void)SvREFCNT_inc(res);
6162 why1 = "Call to &{$^H{";
6164 why3 = "}} did not return a defined value";
6173 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6175 register char *d = dest;
6176 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6179 Perl_croak(aTHX_ ident_too_long);
6180 if (isALNUM(*s)) /* UTF handled below */
6182 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6187 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6191 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6192 char *t = s + UTF8SKIP(s);
6193 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6195 if (d + (t - s) > e)
6196 Perl_croak(aTHX_ ident_too_long);
6197 Copy(s, d, t - s, char);
6210 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6220 e = d + destlen - 3; /* two-character token, ending NUL */
6222 while (isDIGIT(*s)) {
6224 Perl_croak(aTHX_ ident_too_long);
6231 Perl_croak(aTHX_ ident_too_long);
6232 if (isALNUM(*s)) /* UTF handled below */
6234 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6239 else if (*s == ':' && s[1] == ':') {
6243 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6244 char *t = s + UTF8SKIP(s);
6245 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6247 if (d + (t - s) > e)
6248 Perl_croak(aTHX_ ident_too_long);
6249 Copy(s, d, t - s, char);
6260 if (PL_lex_state != LEX_NORMAL)
6261 PL_lex_state = LEX_INTERPENDMAYBE;
6264 if (*s == '$' && s[1] &&
6265 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6278 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6283 if (isSPACE(s[-1])) {
6286 if (!SPACE_OR_TAB(ch)) {
6292 if (isIDFIRST_lazy_if(d,UTF)) {
6296 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6298 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6301 Copy(s, d, e - s, char);
6306 while ((isALNUM(*s) || *s == ':') && d < e)
6309 Perl_croak(aTHX_ ident_too_long);
6312 while (s < send && SPACE_OR_TAB(*s)) s++;
6313 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6314 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6315 const char *brack = *s == '[' ? "[...]" : "{...}";
6316 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6317 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6318 funny, dest, brack, funny, dest, brack);
6321 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6325 /* Handle extended ${^Foo} variables
6326 * 1999-02-27 mjd-perl-patch@plover.com */
6327 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6331 while (isALNUM(*s) && d < e) {
6335 Perl_croak(aTHX_ ident_too_long);
6340 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6341 PL_lex_state = LEX_INTERPEND;
6346 if (PL_lex_state == LEX_NORMAL) {
6347 if (ckWARN(WARN_AMBIGUOUS) &&
6348 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6350 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6351 "Ambiguous use of %c{%s} resolved to %c%s",
6352 funny, dest, funny, dest);
6357 s = bracket; /* let the parser handle it */
6361 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6362 PL_lex_state = LEX_INTERPEND;
6367 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6372 *pmfl |= PMf_GLOBAL;
6374 *pmfl |= PMf_CONTINUE;
6378 *pmfl |= PMf_MULTILINE;
6380 *pmfl |= PMf_SINGLELINE;
6382 *pmfl |= PMf_EXTENDED;
6386 S_scan_pat(pTHX_ char *start, I32 type)
6391 s = scan_str(start,FALSE,FALSE);
6393 Perl_croak(aTHX_ "Search pattern not terminated");
6395 pm = (PMOP*)newPMOP(type, 0);
6396 if (PL_multi_open == '?')
6397 pm->op_pmflags |= PMf_ONCE;
6399 while (*s && strchr("iomsx", *s))
6400 pmflag(&pm->op_pmflags,*s++);
6403 while (*s && strchr("iogcmsx", *s))
6404 pmflag(&pm->op_pmflags,*s++);
6406 /* issue a warning if /c is specified,but /g is not */
6407 if (ckWARN(WARN_REGEXP) &&
6408 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6410 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6413 pm->op_pmpermflags = pm->op_pmflags;
6415 PL_lex_op = (OP*)pm;
6416 yylval.ival = OP_MATCH;
6421 S_scan_subst(pTHX_ char *start)
6428 yylval.ival = OP_NULL;
6430 s = scan_str(start,FALSE,FALSE);
6433 Perl_croak(aTHX_ "Substitution pattern not terminated");
6435 if (s[-1] == PL_multi_open)
6438 first_start = PL_multi_start;
6439 s = scan_str(s,FALSE,FALSE);
6442 SvREFCNT_dec(PL_lex_stuff);
6443 PL_lex_stuff = Nullsv;
6445 Perl_croak(aTHX_ "Substitution replacement not terminated");
6447 PL_multi_start = first_start; /* so whole substitution is taken together */
6449 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6455 else if (strchr("iogcmsx", *s))
6456 pmflag(&pm->op_pmflags,*s++);
6461 /* /c is not meaningful with s/// */
6462 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6464 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6469 PL_sublex_info.super_bufptr = s;
6470 PL_sublex_info.super_bufend = PL_bufend;
6472 pm->op_pmflags |= PMf_EVAL;
6473 repl = newSVpvn("",0);
6475 sv_catpv(repl, es ? "eval " : "do ");
6476 sv_catpvn(repl, "{ ", 2);
6477 sv_catsv(repl, PL_lex_repl);
6478 sv_catpvn(repl, " };", 2);
6480 SvREFCNT_dec(PL_lex_repl);
6484 pm->op_pmpermflags = pm->op_pmflags;
6485 PL_lex_op = (OP*)pm;
6486 yylval.ival = OP_SUBST;
6491 S_scan_trans(pTHX_ char *start)
6500 yylval.ival = OP_NULL;
6502 s = scan_str(start,FALSE,FALSE);
6504 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6505 if (s[-1] == PL_multi_open)
6508 s = scan_str(s,FALSE,FALSE);
6511 SvREFCNT_dec(PL_lex_stuff);
6512 PL_lex_stuff = Nullsv;
6514 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6517 complement = del = squash = 0;
6518 while (strchr("cds", *s)) {
6520 complement = OPpTRANS_COMPLEMENT;
6522 del = OPpTRANS_DELETE;
6524 squash = OPpTRANS_SQUASH;
6528 New(803, tbl, complement&&!del?258:256, short);
6529 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6530 o->op_private &= ~OPpTRANS_ALL;
6531 o->op_private |= del|squash|complement|
6532 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6533 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6536 yylval.ival = OP_TRANS;
6541 S_scan_heredoc(pTHX_ register char *s)
6544 I32 op_type = OP_SCALAR;
6551 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6555 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6558 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6559 if (*peek && strchr("`'\"",*peek)) {
6562 s = delimcpy(d, e, s, PL_bufend, term, &len);
6572 if (!isALNUM_lazy_if(s,UTF))
6573 deprecate_old("bare << to mean <<\"\"");
6574 for (; isALNUM_lazy_if(s,UTF); s++) {
6579 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6580 Perl_croak(aTHX_ "Delimiter for here document is too long");
6583 len = d - PL_tokenbuf;
6584 #ifndef PERL_STRICT_CR
6585 d = strchr(s, '\r');
6589 while (s < PL_bufend) {
6595 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6604 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6609 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6610 herewas = newSVpvn(s,PL_bufend-s);
6612 s--, herewas = newSVpvn(s,d-s);
6613 s += SvCUR(herewas);
6615 tmpstr = NEWSV(87,79);
6616 sv_upgrade(tmpstr, SVt_PVIV);
6621 else if (term == '`') {
6622 op_type = OP_BACKTICK;
6623 SvIVX(tmpstr) = '\\';
6627 PL_multi_start = CopLINE(PL_curcop);
6628 PL_multi_open = PL_multi_close = '<';
6629 term = *PL_tokenbuf;
6630 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6631 char *bufptr = PL_sublex_info.super_bufptr;
6632 char *bufend = PL_sublex_info.super_bufend;
6633 char *olds = s - SvCUR(herewas);
6634 s = strchr(bufptr, '\n');
6638 while (s < bufend &&
6639 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6641 CopLINE_inc(PL_curcop);
6644 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6645 missingterm(PL_tokenbuf);
6647 sv_setpvn(herewas,bufptr,d-bufptr+1);
6648 sv_setpvn(tmpstr,d+1,s-d);
6650 sv_catpvn(herewas,s,bufend-s);
6651 (void)strcpy(bufptr,SvPVX(herewas));
6658 while (s < PL_bufend &&
6659 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6661 CopLINE_inc(PL_curcop);
6663 if (s >= PL_bufend) {
6664 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6665 missingterm(PL_tokenbuf);
6667 sv_setpvn(tmpstr,d+1,s-d);
6669 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6671 sv_catpvn(herewas,s,PL_bufend-s);
6672 sv_setsv(PL_linestr,herewas);
6673 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6674 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6675 PL_last_lop = PL_last_uni = Nullch;
6678 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6679 while (s >= PL_bufend) { /* multiple line string? */
6681 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6682 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6683 missingterm(PL_tokenbuf);
6685 CopLINE_inc(PL_curcop);
6686 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6687 PL_last_lop = PL_last_uni = Nullch;
6688 #ifndef PERL_STRICT_CR
6689 if (PL_bufend - PL_linestart >= 2) {
6690 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6691 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6693 PL_bufend[-2] = '\n';
6695 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6697 else if (PL_bufend[-1] == '\r')
6698 PL_bufend[-1] = '\n';
6700 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6701 PL_bufend[-1] = '\n';
6703 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6704 SV *sv = NEWSV(88,0);
6706 sv_upgrade(sv, SVt_PVMG);
6707 sv_setsv(sv,PL_linestr);
6710 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6712 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6715 sv_catsv(PL_linestr,herewas);
6716 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6720 sv_catsv(tmpstr,PL_linestr);
6725 PL_multi_end = CopLINE(PL_curcop);
6726 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6727 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6728 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6730 SvREFCNT_dec(herewas);
6732 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6734 else if (PL_encoding)
6735 sv_recode_to_utf8(tmpstr, PL_encoding);
6737 PL_lex_stuff = tmpstr;
6738 yylval.ival = op_type;
6743 takes: current position in input buffer
6744 returns: new position in input buffer
6745 side-effects: yylval and lex_op are set.
6750 <FH> read from filehandle
6751 <pkg::FH> read from package qualified filehandle
6752 <pkg'FH> read from package qualified filehandle
6753 <$fh> read from filehandle in $fh
6759 S_scan_inputsymbol(pTHX_ char *start)
6761 register char *s = start; /* current position in buffer */
6767 d = PL_tokenbuf; /* start of temp holding space */
6768 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6769 end = strchr(s, '\n');
6772 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6774 /* die if we didn't have space for the contents of the <>,
6775 or if it didn't end, or if we see a newline
6778 if (len >= sizeof PL_tokenbuf)
6779 Perl_croak(aTHX_ "Excessively long <> operator");
6781 Perl_croak(aTHX_ "Unterminated <> operator");
6786 Remember, only scalar variables are interpreted as filehandles by
6787 this code. Anything more complex (e.g., <$fh{$num}>) will be
6788 treated as a glob() call.
6789 This code makes use of the fact that except for the $ at the front,
6790 a scalar variable and a filehandle look the same.
6792 if (*d == '$' && d[1]) d++;
6794 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6795 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6798 /* If we've tried to read what we allow filehandles to look like, and
6799 there's still text left, then it must be a glob() and not a getline.
6800 Use scan_str to pull out the stuff between the <> and treat it
6801 as nothing more than a string.
6804 if (d - PL_tokenbuf != len) {
6805 yylval.ival = OP_GLOB;
6807 s = scan_str(start,FALSE,FALSE);
6809 Perl_croak(aTHX_ "Glob not terminated");
6813 bool readline_overriden = FALSE;
6814 GV *gv_readline = Nullgv;
6816 /* we're in a filehandle read situation */
6819 /* turn <> into <ARGV> */
6821 (void)strcpy(d,"ARGV");
6823 /* Check whether readline() is overriden */
6824 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6825 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6827 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6828 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6829 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6830 readline_overriden = TRUE;
6832 /* if <$fh>, create the ops to turn the variable into a
6838 /* try to find it in the pad for this block, otherwise find
6839 add symbol table ops
6841 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6842 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6843 SV *sym = sv_2mortal(
6844 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6845 sv_catpvn(sym, "::", 2);
6851 OP *o = newOP(OP_PADSV, 0);
6853 PL_lex_op = readline_overriden
6854 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6855 append_elem(OP_LIST, o,
6856 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6857 : (OP*)newUNOP(OP_READLINE, 0, o);
6866 ? (GV_ADDMULTI | GV_ADDINEVAL)
6869 PL_lex_op = readline_overriden
6870 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6871 append_elem(OP_LIST,
6872 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6873 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6874 : (OP*)newUNOP(OP_READLINE, 0,
6875 newUNOP(OP_RV2SV, 0,
6876 newGVOP(OP_GV, 0, gv)));
6878 if (!readline_overriden)
6879 PL_lex_op->op_flags |= OPf_SPECIAL;
6880 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6881 yylval.ival = OP_NULL;
6884 /* If it's none of the above, it must be a literal filehandle
6885 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6887 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6888 PL_lex_op = readline_overriden
6889 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6890 append_elem(OP_LIST,
6891 newGVOP(OP_GV, 0, gv),
6892 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6893 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6894 yylval.ival = OP_NULL;
6903 takes: start position in buffer
6904 keep_quoted preserve \ on the embedded delimiter(s)
6905 keep_delims preserve the delimiters around the string
6906 returns: position to continue reading from buffer
6907 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6908 updates the read buffer.
6910 This subroutine pulls a string out of the input. It is called for:
6911 q single quotes q(literal text)
6912 ' single quotes 'literal text'
6913 qq double quotes qq(interpolate $here please)
6914 " double quotes "interpolate $here please"
6915 qx backticks qx(/bin/ls -l)
6916 ` backticks `/bin/ls -l`
6917 qw quote words @EXPORT_OK = qw( func() $spam )
6918 m// regexp match m/this/
6919 s/// regexp substitute s/this/that/
6920 tr/// string transliterate tr/this/that/
6921 y/// string transliterate y/this/that/
6922 ($*@) sub prototypes sub foo ($)
6923 (stuff) sub attr parameters sub foo : attr(stuff)
6924 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6926 In most of these cases (all but <>, patterns and transliterate)
6927 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6928 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6929 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6932 It skips whitespace before the string starts, and treats the first
6933 character as the delimiter. If the delimiter is one of ([{< then
6934 the corresponding "close" character )]}> is used as the closing
6935 delimiter. It allows quoting of delimiters, and if the string has
6936 balanced delimiters ([{<>}]) it allows nesting.
6938 On success, the SV with the resulting string is put into lex_stuff or,
6939 if that is already non-NULL, into lex_repl. The second case occurs only
6940 when parsing the RHS of the special constructs s/// and tr/// (y///).
6941 For convenience, the terminating delimiter character is stuffed into
6946 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6948 SV *sv; /* scalar value: string */
6949 char *tmps; /* temp string, used for delimiter matching */
6950 register char *s = start; /* current position in the buffer */
6951 register char term; /* terminating character */
6952 register char *to; /* current position in the sv's data */
6953 I32 brackets = 1; /* bracket nesting level */
6954 bool has_utf8 = FALSE; /* is there any utf8 content? */
6955 I32 termcode; /* terminating char. code */
6956 U8 termstr[UTF8_MAXLEN]; /* terminating string */
6957 STRLEN termlen; /* length of terminating string */
6958 char *last = NULL; /* last position for nesting bracket */
6960 /* skip space before the delimiter */
6964 /* mark where we are, in case we need to report errors */
6967 /* after skipping whitespace, the next character is the terminator */
6970 termcode = termstr[0] = term;
6974 termcode = utf8_to_uvchr((U8*)s, &termlen);
6975 Copy(s, termstr, termlen, U8);
6976 if (!UTF8_IS_INVARIANT(term))
6980 /* mark where we are */
6981 PL_multi_start = CopLINE(PL_curcop);
6982 PL_multi_open = term;
6984 /* find corresponding closing delimiter */
6985 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6986 termcode = termstr[0] = term = tmps[5];
6988 PL_multi_close = term;
6990 /* create a new SV to hold the contents. 87 is leak category, I'm
6991 assuming. 79 is the SV's initial length. What a random number. */
6993 sv_upgrade(sv, SVt_PVIV);
6994 SvIVX(sv) = termcode;
6995 (void)SvPOK_only(sv); /* validate pointer */
6997 /* move past delimiter and try to read a complete string */
6999 sv_catpvn(sv, s, termlen);
7002 if (PL_encoding && !UTF) {
7006 int offset = s - SvPVX(PL_linestr);
7007 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
7008 &offset, (char*)termstr, termlen);
7009 char *ns = SvPVX(PL_linestr) + offset;
7010 char *svlast = SvEND(sv) - 1;
7012 for (; s < ns; s++) {
7013 if (*s == '\n' && !PL_rsfp)
7014 CopLINE_inc(PL_curcop);
7017 goto read_more_line;
7019 /* handle quoted delimiters */
7020 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
7022 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
7024 if ((svlast-1 - t) % 2) {
7028 SvCUR_set(sv, SvCUR(sv) - 1);
7033 if (PL_multi_open == PL_multi_close) {
7040 for (w = t = last; t < svlast; w++, t++) {
7041 /* At here, all closes are "was quoted" one,
7042 so we don't check PL_multi_close. */
7044 if (!keep_quoted && *(t+1) == PL_multi_open)
7049 else if (*t == PL_multi_open)
7057 SvCUR_set(sv, w - SvPVX(sv));
7060 if (--brackets <= 0)
7066 SvCUR_set(sv, SvCUR(sv) - 1);
7072 /* extend sv if need be */
7073 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7074 /* set 'to' to the next character in the sv's string */
7075 to = SvPVX(sv)+SvCUR(sv);
7077 /* if open delimiter is the close delimiter read unbridle */
7078 if (PL_multi_open == PL_multi_close) {
7079 for (; s < PL_bufend; s++,to++) {
7080 /* embedded newlines increment the current line number */
7081 if (*s == '\n' && !PL_rsfp)
7082 CopLINE_inc(PL_curcop);
7083 /* handle quoted delimiters */
7084 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7085 if (!keep_quoted && s[1] == term)
7087 /* any other quotes are simply copied straight through */
7091 /* terminate when run out of buffer (the for() condition), or
7092 have found the terminator */
7093 else if (*s == term) {
7096 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7099 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7105 /* if the terminator isn't the same as the start character (e.g.,
7106 matched brackets), we have to allow more in the quoting, and
7107 be prepared for nested brackets.
7110 /* read until we run out of string, or we find the terminator */
7111 for (; s < PL_bufend; s++,to++) {
7112 /* embedded newlines increment the line count */
7113 if (*s == '\n' && !PL_rsfp)
7114 CopLINE_inc(PL_curcop);
7115 /* backslashes can escape the open or closing characters */
7116 if (*s == '\\' && s+1 < PL_bufend) {
7118 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7123 /* allow nested opens and closes */
7124 else if (*s == PL_multi_close && --brackets <= 0)
7126 else if (*s == PL_multi_open)
7128 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7133 /* terminate the copied string and update the sv's end-of-string */
7135 SvCUR_set(sv, to - SvPVX(sv));
7138 * this next chunk reads more into the buffer if we're not done yet
7142 break; /* handle case where we are done yet :-) */
7144 #ifndef PERL_STRICT_CR
7145 if (to - SvPVX(sv) >= 2) {
7146 if ((to[-2] == '\r' && to[-1] == '\n') ||
7147 (to[-2] == '\n' && to[-1] == '\r'))
7151 SvCUR_set(sv, to - SvPVX(sv));
7153 else if (to[-1] == '\r')
7156 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7161 /* if we're out of file, or a read fails, bail and reset the current
7162 line marker so we can report where the unterminated string began
7165 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7167 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7170 /* we read a line, so increment our line counter */
7171 CopLINE_inc(PL_curcop);
7173 /* update debugger info */
7174 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7175 SV *sv = NEWSV(88,0);
7177 sv_upgrade(sv, SVt_PVMG);
7178 sv_setsv(sv,PL_linestr);
7181 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7184 /* having changed the buffer, we must update PL_bufend */
7185 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7186 PL_last_lop = PL_last_uni = Nullch;
7189 /* at this point, we have successfully read the delimited string */
7191 if (!PL_encoding || UTF) {
7193 sv_catpvn(sv, s, termlen);
7196 if (has_utf8 || PL_encoding)
7199 PL_multi_end = CopLINE(PL_curcop);
7201 /* if we allocated too much space, give some back */
7202 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7203 SvLEN_set(sv, SvCUR(sv) + 1);
7204 Renew(SvPVX(sv), SvLEN(sv), char);
7207 /* decide whether this is the first or second quoted string we've read
7220 takes: pointer to position in buffer
7221 returns: pointer to new position in buffer
7222 side-effects: builds ops for the constant in yylval.op
7224 Read a number in any of the formats that Perl accepts:
7226 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7227 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7230 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7232 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7235 If it reads a number without a decimal point or an exponent, it will
7236 try converting the number to an integer and see if it can do so
7237 without loss of precision.
7241 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7243 register char *s = start; /* current position in buffer */
7244 register char *d; /* destination in temp buffer */
7245 register char *e; /* end of temp buffer */
7246 NV nv; /* number read, as a double */
7247 SV *sv = Nullsv; /* place to put the converted number */
7248 bool floatit; /* boolean: int or float? */
7249 char *lastub = 0; /* position of last underbar */
7250 static char number_too_long[] = "Number too long";
7252 /* We use the first character to decide what type of number this is */
7256 Perl_croak(aTHX_ "panic: scan_num");
7258 /* if it starts with a 0, it could be an octal number, a decimal in
7259 0.13 disguise, or a hexadecimal number, or a binary number. */
7263 u holds the "number so far"
7264 shift the power of 2 of the base
7265 (hex == 4, octal == 3, binary == 1)
7266 overflowed was the number more than we can hold?
7268 Shift is used when we add a digit. It also serves as an "are
7269 we in octal/hex/binary?" indicator to disallow hex characters
7275 bool overflowed = FALSE;
7276 bool just_zero = TRUE; /* just plain 0 or binary number? */
7277 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7278 static char* bases[5] = { "", "binary", "", "octal",
7280 static char* Bases[5] = { "", "Binary", "", "Octal",
7282 static char *maxima[5] = { "",
7283 "0b11111111111111111111111111111111",
7287 char *base, *Base, *max;
7294 } else if (s[1] == 'b') {
7299 /* check for a decimal in disguise */
7300 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7302 /* so it must be octal */
7309 if (ckWARN(WARN_SYNTAX))
7310 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7311 "Misplaced _ in number");
7315 base = bases[shift];
7316 Base = Bases[shift];
7317 max = maxima[shift];
7319 /* read the rest of the number */
7321 /* x is used in the overflow test,
7322 b is the digit we're adding on. */
7327 /* if we don't mention it, we're done */
7331 /* _ are ignored -- but warned about if consecutive */
7333 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7334 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7335 "Misplaced _ in number");
7339 /* 8 and 9 are not octal */
7342 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7346 case '2': case '3': case '4':
7347 case '5': case '6': case '7':
7349 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7353 b = *s++ & 15; /* ASCII digit -> value of digit */
7357 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7358 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7359 /* make sure they said 0x */
7364 /* Prepare to put the digit we have onto the end
7365 of the number so far. We check for overflows.
7371 x = u << shift; /* make room for the digit */
7373 if ((x >> shift) != u
7374 && !(PL_hints & HINT_NEW_BINARY)) {
7377 if (ckWARN_d(WARN_OVERFLOW))
7378 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7379 "Integer overflow in %s number",
7382 u = x | b; /* add the digit to the end */
7385 n *= nvshift[shift];
7386 /* If an NV has not enough bits in its
7387 * mantissa to represent an UV this summing of
7388 * small low-order numbers is a waste of time
7389 * (because the NV cannot preserve the
7390 * low-order bits anyway): we could just
7391 * remember when did we overflow and in the
7392 * end just multiply n by the right
7400 /* if we get here, we had success: make a scalar value from
7405 /* final misplaced underbar check */
7407 if (ckWARN(WARN_SYNTAX))
7408 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7413 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7414 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7415 "%s number > %s non-portable",
7421 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7422 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7423 "%s number > %s non-portable",
7428 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7429 sv = new_constant(start, s - start, "integer",
7431 else if (PL_hints & HINT_NEW_BINARY)
7432 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7437 handle decimal numbers.
7438 we're also sent here when we read a 0 as the first digit
7440 case '1': case '2': case '3': case '4': case '5':
7441 case '6': case '7': case '8': case '9': case '.':
7444 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7447 /* read next group of digits and _ and copy into d */
7448 while (isDIGIT(*s) || *s == '_') {
7449 /* skip underscores, checking for misplaced ones
7453 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7454 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7455 "Misplaced _ in number");
7459 /* check for end of fixed-length buffer */
7461 Perl_croak(aTHX_ number_too_long);
7462 /* if we're ok, copy the character */
7467 /* final misplaced underbar check */
7468 if (lastub && s == lastub + 1) {
7469 if (ckWARN(WARN_SYNTAX))
7470 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7473 /* read a decimal portion if there is one. avoid
7474 3..5 being interpreted as the number 3. followed
7477 if (*s == '.' && s[1] != '.') {
7482 if (ckWARN(WARN_SYNTAX))
7483 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7484 "Misplaced _ in number");
7488 /* copy, ignoring underbars, until we run out of digits.
7490 for (; isDIGIT(*s) || *s == '_'; s++) {
7491 /* fixed length buffer check */
7493 Perl_croak(aTHX_ number_too_long);
7495 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7496 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7497 "Misplaced _ in number");
7503 /* fractional part ending in underbar? */
7505 if (ckWARN(WARN_SYNTAX))
7506 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7507 "Misplaced _ in number");
7509 if (*s == '.' && isDIGIT(s[1])) {
7510 /* oops, it's really a v-string, but without the "v" */
7516 /* read exponent part, if present */
7517 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7521 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7522 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7524 /* stray preinitial _ */
7526 if (ckWARN(WARN_SYNTAX))
7527 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7528 "Misplaced _ in number");
7532 /* allow positive or negative exponent */
7533 if (*s == '+' || *s == '-')
7536 /* stray initial _ */
7538 if (ckWARN(WARN_SYNTAX))
7539 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7540 "Misplaced _ in number");
7544 /* read digits of exponent */
7545 while (isDIGIT(*s) || *s == '_') {
7548 Perl_croak(aTHX_ number_too_long);
7552 if (ckWARN(WARN_SYNTAX) &&
7553 ((lastub && s == lastub + 1) ||
7554 (!isDIGIT(s[1]) && s[1] != '_')))
7555 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7556 "Misplaced _ in number");
7563 /* make an sv from the string */
7567 We try to do an integer conversion first if no characters
7568 indicating "float" have been found.
7573 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7575 if (flags == IS_NUMBER_IN_UV) {
7577 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7580 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7581 if (uv <= (UV) IV_MIN)
7582 sv_setiv(sv, -(IV)uv);
7589 /* terminate the string */
7591 nv = Atof(PL_tokenbuf);
7595 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7596 (PL_hints & HINT_NEW_INTEGER) )
7597 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7598 (floatit ? "float" : "integer"),
7602 /* if it starts with a v, it could be a v-string */
7605 sv = NEWSV(92,5); /* preallocate storage space */
7606 s = scan_vstring(s,sv);
7610 /* make the op for the constant and return */
7613 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7615 lvalp->opval = Nullop;
7621 S_scan_formline(pTHX_ register char *s)
7625 SV *stuff = newSVpvn("",0);
7626 bool needargs = FALSE;
7632 #ifdef PERL_STRICT_CR
7633 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7635 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7637 if (*t == '\n' || t == PL_bufend) {
7642 if (PL_in_eval && !PL_rsfp) {
7643 eol = memchr(s,'\n',PL_bufend-s);
7648 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7650 for (t = s; t < eol; t++) {
7651 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7653 goto enough; /* ~~ must be first line in formline */
7655 if (*t == '@' || *t == '^')
7659 sv_catpvn(stuff, s, eol-s);
7660 #ifndef PERL_STRICT_CR
7661 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7662 char *end = SvPVX(stuff) + SvCUR(stuff);
7674 s = filter_gets(PL_linestr, PL_rsfp, 0);
7675 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7676 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7677 PL_last_lop = PL_last_uni = Nullch;
7689 PL_lex_state = LEX_NORMAL;
7690 PL_nextval[PL_nexttoke].ival = 0;
7694 PL_lex_state = LEX_FORMLINE;
7696 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7698 else if (PL_encoding)
7699 sv_recode_to_utf8(stuff, PL_encoding);
7701 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7703 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7707 SvREFCNT_dec(stuff);
7709 PL_lex_formbrack = 0;
7720 PL_cshlen = strlen(PL_cshname);
7725 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7727 I32 oldsavestack_ix = PL_savestack_ix;
7728 CV* outsidecv = PL_compcv;
7731 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7733 SAVEI32(PL_subline);
7734 save_item(PL_subname);
7735 SAVESPTR(PL_compcv);
7737 PL_compcv = (CV*)NEWSV(1104,0);
7738 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7739 CvFLAGS(PL_compcv) |= flags;
7741 PL_subline = CopLINE(PL_curcop);
7742 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7743 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7744 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7746 return oldsavestack_ix;
7750 #pragma segment Perl_yylex
7753 Perl_yywarn(pTHX_ char *s)
7755 PL_in_eval |= EVAL_WARNONLY;
7757 PL_in_eval &= ~EVAL_WARNONLY;
7762 Perl_yyerror(pTHX_ char *s)
7765 char *context = NULL;
7769 if (!yychar || (yychar == ';' && !PL_rsfp))
7771 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7772 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7775 The code below is removed for NetWare because it abends/crashes on NetWare
7776 when the script has error such as not having the closing quotes like:
7778 Checking of white spaces is anyway done in NetWare code.
7781 while (isSPACE(*PL_oldoldbufptr))
7784 context = PL_oldoldbufptr;
7785 contlen = PL_bufptr - PL_oldoldbufptr;
7787 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7788 PL_oldbufptr != PL_bufptr) {
7791 The code below is removed for NetWare because it abends/crashes on NetWare
7792 when the script has error such as not having the closing quotes like:
7794 Checking of white spaces is anyway done in NetWare code.
7797 while (isSPACE(*PL_oldbufptr))
7800 context = PL_oldbufptr;
7801 contlen = PL_bufptr - PL_oldbufptr;
7803 else if (yychar > 255)
7804 where = "next token ???";
7805 #ifdef USE_PURE_BISON
7806 /* GNU Bison sets the value -2 */
7807 else if (yychar == -2) {
7809 else if ((yychar & 127) == 127) {
7811 if (PL_lex_state == LEX_NORMAL ||
7812 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7813 where = "at end of line";
7814 else if (PL_lex_inpat)
7815 where = "within pattern";
7817 where = "within string";
7820 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7822 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7823 else if (isPRINT_LC(yychar))
7824 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7826 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7827 where = SvPVX(where_sv);
7829 msg = sv_2mortal(newSVpv(s, 0));
7830 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7831 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7833 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7835 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7836 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7837 Perl_sv_catpvf(aTHX_ msg,
7838 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7839 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7842 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7843 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7846 if (PL_error_count >= 10) {
7847 if (PL_in_eval && SvCUR(ERRSV))
7848 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7849 ERRSV, OutCopFILE(PL_curcop));
7851 Perl_croak(aTHX_ "%s has too many errors.\n",
7852 OutCopFILE(PL_curcop));
7855 PL_in_my_stash = Nullhv;
7859 #pragma segment Main
7863 S_swallow_bom(pTHX_ U8 *s)
7866 slen = SvCUR(PL_linestr);
7870 /* UTF-16 little-endian */
7871 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7872 Perl_croak(aTHX_ "Unsupported script encoding");
7873 #ifndef PERL_NO_UTF16_FILTER
7874 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7876 if (PL_bufend > (char*)s) {
7880 filter_add(utf16rev_textfilter, NULL);
7881 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7882 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7883 PL_bufend - (char*)s - 1,
7885 Copy(news, s, newlen, U8);
7886 SvCUR_set(PL_linestr, newlen);
7887 PL_bufend = SvPVX(PL_linestr) + newlen;
7888 news[newlen++] = '\0';
7892 Perl_croak(aTHX_ "Unsupported script encoding");
7897 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7898 #ifndef PERL_NO_UTF16_FILTER
7899 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7901 if (PL_bufend > (char *)s) {
7905 filter_add(utf16_textfilter, NULL);
7906 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7907 PL_bufend = (char*)utf16_to_utf8(s, news,
7908 PL_bufend - (char*)s,
7910 Copy(news, s, newlen, U8);
7911 SvCUR_set(PL_linestr, newlen);
7912 PL_bufend = SvPVX(PL_linestr) + newlen;
7913 news[newlen++] = '\0';
7917 Perl_croak(aTHX_ "Unsupported script encoding");
7922 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7923 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7928 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7929 s[2] == 0xFE && s[3] == 0xFF)
7931 Perl_croak(aTHX_ "Unsupported script encoding");
7939 * Restore a source filter.
7943 restore_rsfp(pTHX_ void *f)
7945 PerlIO *fp = (PerlIO*)f;
7947 if (PL_rsfp == PerlIO_stdin())
7948 PerlIO_clearerr(PL_rsfp);
7949 else if (PL_rsfp && (PL_rsfp != fp))
7950 PerlIO_close(PL_rsfp);
7954 #ifndef PERL_NO_UTF16_FILTER
7956 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7958 I32 count = FILTER_READ(idx+1, sv, maxlen);
7963 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7964 if (!*SvPV_nolen(sv))
7965 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7968 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7969 sv_usepvn(sv, (char*)tmps, tend - tmps);
7975 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7977 I32 count = FILTER_READ(idx+1, sv, maxlen);
7982 if (!*SvPV_nolen(sv))
7983 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7986 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7987 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7988 sv_usepvn(sv, (char*)tmps, tend - tmps);
7995 Returns a pointer to the next character after the parsed
7996 vstring, as well as updating the passed in sv.
7998 Function must be called like
8001 s = scan_vstring(s,sv);
8003 The sv should already be large enough to store the vstring
8004 passed in, for performance reasons.
8009 Perl_scan_vstring(pTHX_ char *s, SV *sv)
8013 if (*pos == 'v') pos++; /* get past 'v' */
8014 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8017 /* this may not be a v-string if followed by => */
8019 while (next < PL_bufend && isSPACE(*next))
8021 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
8022 /* return string not v-string */
8023 sv_setpvn(sv,(char *)s,pos-s);
8028 if (!isALPHA(*pos)) {
8030 U8 tmpbuf[UTF8_MAXLEN+1];
8033 if (*s == 'v') s++; /* get past 'v' */
8035 sv_setpvn(sv, "", 0);
8040 /* this is atoi() that tolerates underscores */
8043 while (--end >= s) {
8048 rev += (*end - '0') * mult;
8050 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8051 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8052 "Integer overflow in decimal number");
8056 if (rev > 0x7FFFFFFF)
8057 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8059 /* Append native character for the rev point */
8060 tmpend = uvchr_to_utf8(tmpbuf, rev);
8061 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8062 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8064 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8070 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8074 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);