3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
29 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
30 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
32 static void restore_rsfp(pTHX_ void *f);
33 #ifndef PERL_NO_UTF16_FILTER
34 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
35 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
38 #define XFAKEBRACK 128
41 #ifdef USE_UTF8_SCRIPTS
42 # define UTF (!IN_BYTES)
44 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
47 /* In variables named $^X, these are the legal values for X.
48 * 1999-02-27 mjd-perl-patch@plover.com */
49 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
51 /* On MacOS, respect nonbreaking spaces */
52 #ifdef MACOS_TRADITIONAL
53 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
58 /* LEX_* are values for PL_lex_state, the state of the lexer.
59 * They are arranged oddly so that the guard on the switch statement
60 * can get by with a single comparison (if the compiler is smart enough).
63 /* #define LEX_NOTPARSING 11 is done in perl.h. */
66 #define LEX_INTERPNORMAL 9
67 #define LEX_INTERPCASEMOD 8
68 #define LEX_INTERPPUSH 7
69 #define LEX_INTERPSTART 6
70 #define LEX_INTERPEND 5
71 #define LEX_INTERPENDMAYBE 4
72 #define LEX_INTERPCONCAT 3
73 #define LEX_INTERPCONST 2
74 #define LEX_FORMLINE 1
75 #define LEX_KNOWNEXT 0
83 # define YYMAXLEVEL 100
85 YYSTYPE* yylval_pointer[YYMAXLEVEL];
86 int* yychar_pointer[YYMAXLEVEL];
90 # define yylval (*yylval_pointer[yyactlevel])
91 # define yychar (*yychar_pointer[yyactlevel])
92 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
94 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
99 /* CLINE is a macro that ensures PL_copline has a sane value */
104 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
107 * Convenience functions to return different tokens and prime the
108 * lexer for the next token. They all take an argument.
110 * TOKEN : generic token (used for '(', DOLSHARP, etc)
111 * OPERATOR : generic operator
112 * AOPERATOR : assignment operator
113 * PREBLOCK : beginning the block after an if, while, foreach, ...
114 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
115 * PREREF : *EXPR where EXPR is not a simple identifier
116 * TERM : expression term
117 * LOOPX : loop exiting command (goto, last, dump, etc)
118 * FTST : file test operator
119 * FUN0 : zero-argument function
120 * FUN1 : not used, except for not, which isn't a UNIOP
121 * BOop : bitwise or or xor
123 * SHop : shift operator
124 * PWop : power operator
125 * PMop : pattern-matching operator
126 * Aop : addition-level operator
127 * Mop : multiplication-level operator
128 * Eop : equality-testing operator
129 * Rop : relational operator <= != gt
131 * Also see LOP and lop() below.
134 /* Note that REPORT() and REPORT2() will be expressions that supply
135 * their own trailing comma, not suitable for statements as such. */
136 #ifdef DEBUGGING /* Serve -DT. */
137 # define REPORT(x,retval) tokereport(x,s,(int)retval),
138 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
140 # define REPORT(x,retval)
141 # define REPORT2(x,retval)
144 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
145 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
146 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
147 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
148 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
149 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
150 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
151 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
152 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
153 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
154 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
155 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
156 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
157 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
158 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
159 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
160 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
161 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
162 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
163 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
165 /* This bit of chicanery makes a unary function followed by
166 * a parenthesis into a function with one argument, highest precedence.
167 * The UNIDOR macro is for unary functions that can be followed by the //
168 * operator (such as C<shift // 0>).
170 #define UNI2(f,x) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
177 #define UNI(f) UNI2(f,XTERM)
178 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
180 #define UNIBRACK(f) return(yylval.ival = f, \
183 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
186 /* grandfather return to old style */
187 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
195 SV* report = newSVpv(thing, 0);
196 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
199 if (s - PL_bufptr > 0)
200 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
202 if (PL_oldbufptr && *PL_oldbufptr)
203 sv_catpv(report, PL_tokenbuf);
205 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
214 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
215 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
219 S_ao(pTHX_ int toketype)
221 if (*PL_bufptr == '=') {
223 if (toketype == ANDAND)
224 yylval.ival = OP_ANDASSIGN;
225 else if (toketype == OROR)
226 yylval.ival = OP_ORASSIGN;
227 else if (toketype == DORDOR)
228 yylval.ival = OP_DORASSIGN;
236 * When Perl expects an operator and finds something else, no_op
237 * prints the warning. It always prints "<something> found where
238 * operator expected. It prints "Missing semicolon on previous line?"
239 * if the surprise occurs at the start of the line. "do you need to
240 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
241 * where the compiler doesn't know if foo is a method call or a function.
242 * It prints "Missing operator before end of line" if there's nothing
243 * after the missing operator, or "... before <...>" if there is something
244 * after the missing operator.
248 S_no_op(pTHX_ char *what, char *s)
250 char *oldbp = PL_bufptr;
251 bool is_first = (PL_oldbufptr == PL_linestart);
257 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
259 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
260 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
262 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
263 if (t < PL_bufptr && isSPACE(*t))
264 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
265 t - PL_oldoldbufptr, PL_oldoldbufptr);
269 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
276 * Complain about missing quote/regexp/heredoc terminator.
277 * If it's called with (char *)NULL then it cauterizes the line buffer.
278 * If we're in a delimited string and the delimiter is a control
279 * character, it's reformatted into a two-char sequence like ^C.
284 S_missingterm(pTHX_ char *s)
289 char *nl = strrchr(s,'\n');
295 iscntrl(PL_multi_close)
297 PL_multi_close < 32 || PL_multi_close == 127
301 tmpbuf[1] = toCTRL(PL_multi_close);
307 *tmpbuf = (char)PL_multi_close;
311 q = strchr(s,'"') ? '\'' : '"';
312 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
320 Perl_deprecate(pTHX_ char *s)
322 if (ckWARN(WARN_DEPRECATED))
323 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
327 Perl_deprecate_old(pTHX_ char *s)
329 /* This function should NOT be called for any new deprecated warnings */
330 /* Use Perl_deprecate instead */
332 /* It is here to maintain backward compatibility with the pre-5.8 */
333 /* warnings category hierarchy. The "deprecated" category used to */
334 /* live under the "syntax" category. It is now a top-level category */
335 /* in its own right. */
337 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
338 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
339 "Use of %s is deprecated", s);
344 * Deprecate a comma-less variable list.
350 deprecate_old("comma-less variable list");
354 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
355 * utf16-to-utf8-reversed.
358 #ifdef PERL_CR_FILTER
362 register char *s = SvPVX(sv);
363 register char *e = s + SvCUR(sv);
364 /* outer loop optimized to do nothing if there are no CR-LFs */
366 if (*s++ == '\r' && *s == '\n') {
367 /* hit a CR-LF, need to copy the rest */
368 register char *d = s - 1;
371 if (*s == '\r' && s[1] == '\n')
382 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
384 I32 count = FILTER_READ(idx+1, sv, maxlen);
385 if (count > 0 && !maxlen)
393 * Initialize variables. Uses the Perl save_stack to save its state (for
394 * recursive calls to the parser).
398 Perl_lex_start(pTHX_ SV *line)
403 SAVEI32(PL_lex_dojoin);
404 SAVEI32(PL_lex_brackets);
405 SAVEI32(PL_lex_casemods);
406 SAVEI32(PL_lex_starts);
407 SAVEI32(PL_lex_state);
408 SAVEVPTR(PL_lex_inpat);
409 SAVEI32(PL_lex_inwhat);
410 if (PL_lex_state == LEX_KNOWNEXT) {
411 I32 toke = PL_nexttoke;
412 while (--toke >= 0) {
413 SAVEI32(PL_nexttype[toke]);
414 SAVEVPTR(PL_nextval[toke]);
416 SAVEI32(PL_nexttoke);
418 SAVECOPLINE(PL_curcop);
421 SAVEPPTR(PL_oldbufptr);
422 SAVEPPTR(PL_oldoldbufptr);
423 SAVEPPTR(PL_last_lop);
424 SAVEPPTR(PL_last_uni);
425 SAVEPPTR(PL_linestart);
426 SAVESPTR(PL_linestr);
427 SAVEGENERICPV(PL_lex_brackstack);
428 SAVEGENERICPV(PL_lex_casestack);
429 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
430 SAVESPTR(PL_lex_stuff);
431 SAVEI32(PL_lex_defer);
432 SAVEI32(PL_sublex_info.sub_inwhat);
433 SAVESPTR(PL_lex_repl);
435 SAVEINT(PL_lex_expect);
437 PL_lex_state = LEX_NORMAL;
441 New(899, PL_lex_brackstack, 120, char);
442 New(899, PL_lex_casestack, 12, char);
444 *PL_lex_casestack = '\0';
447 PL_lex_stuff = Nullsv;
448 PL_lex_repl = Nullsv;
452 PL_sublex_info.sub_inwhat = 0;
454 if (SvREADONLY(PL_linestr))
455 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
456 s = SvPV(PL_linestr, len);
457 if (!len || s[len-1] != ';') {
458 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
459 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
460 sv_catpvn(PL_linestr, "\n;", 2);
462 SvTEMP_off(PL_linestr);
463 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
464 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
465 PL_last_lop = PL_last_uni = Nullch;
471 * Finalizer for lexing operations. Must be called when the parser is
472 * done with the lexer.
478 PL_doextract = FALSE;
483 * This subroutine has nothing to do with tilting, whether at windmills
484 * or pinball tables. Its name is short for "increment line". It
485 * increments the current line number in CopLINE(PL_curcop) and checks
486 * to see whether the line starts with a comment of the form
487 * # line 500 "foo.pm"
488 * If so, it sets the current line number and file to the values in the comment.
492 S_incline(pTHX_ char *s)
499 CopLINE_inc(PL_curcop);
502 while (SPACE_OR_TAB(*s)) s++;
503 if (strnEQ(s, "line", 4))
507 if (SPACE_OR_TAB(*s))
511 while (SPACE_OR_TAB(*s)) s++;
517 while (SPACE_OR_TAB(*s))
519 if (*s == '"' && (t = strchr(s+1, '"'))) {
524 for (t = s; !isSPACE(*t); t++) ;
527 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
529 if (*e != '\n' && *e != '\0')
530 return; /* false alarm */
535 CopFILE_free(PL_curcop);
536 CopFILE_set(PL_curcop, s);
539 CopLINE_set(PL_curcop, atoi(n)-1);
544 * Called to gobble the appropriate amount and type of whitespace.
545 * Skips comments as well.
549 S_skipspace(pTHX_ register char *s)
551 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
552 while (s < PL_bufend && SPACE_OR_TAB(*s))
558 SSize_t oldprevlen, oldoldprevlen;
559 SSize_t oldloplen = 0, oldunilen = 0;
560 while (s < PL_bufend && isSPACE(*s)) {
561 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
566 if (s < PL_bufend && *s == '#') {
567 while (s < PL_bufend && *s != '\n')
571 if (PL_in_eval && !PL_rsfp) {
578 /* only continue to recharge the buffer if we're at the end
579 * of the buffer, we're not reading from a source filter, and
580 * we're in normal lexing mode
582 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
583 PL_lex_state == LEX_FORMLINE)
586 /* try to recharge the buffer */
587 if ((s = filter_gets(PL_linestr, PL_rsfp,
588 (prevlen = SvCUR(PL_linestr)))) == Nullch)
590 /* end of file. Add on the -p or -n magic */
591 if (PL_minus_n || PL_minus_p) {
592 sv_setpv(PL_linestr,PL_minus_p ?
593 ";}continue{print or die qq(-p destination: $!\\n)" :
595 sv_catpv(PL_linestr,";}");
596 PL_minus_n = PL_minus_p = 0;
599 sv_setpv(PL_linestr,";");
601 /* reset variables for next time we lex */
602 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
604 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
605 PL_last_lop = PL_last_uni = Nullch;
607 /* Close the filehandle. Could be from -P preprocessor,
608 * STDIN, or a regular file. If we were reading code from
609 * STDIN (because the commandline held no -e or filename)
610 * then we don't close it, we reset it so the code can
611 * read from STDIN too.
614 if (PL_preprocess && !PL_in_eval)
615 (void)PerlProc_pclose(PL_rsfp);
616 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
617 PerlIO_clearerr(PL_rsfp);
619 (void)PerlIO_close(PL_rsfp);
624 /* not at end of file, so we only read another line */
625 /* make corresponding updates to old pointers, for yyerror() */
626 oldprevlen = PL_oldbufptr - PL_bufend;
627 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
629 oldunilen = PL_last_uni - PL_bufend;
631 oldloplen = PL_last_lop - PL_bufend;
632 PL_linestart = PL_bufptr = s + prevlen;
633 PL_bufend = s + SvCUR(PL_linestr);
635 PL_oldbufptr = s + oldprevlen;
636 PL_oldoldbufptr = s + oldoldprevlen;
638 PL_last_uni = s + oldunilen;
640 PL_last_lop = s + oldloplen;
643 /* debugger active and we're not compiling the debugger code,
644 * so store the line into the debugger's array of lines
646 if (PERLDB_LINE && PL_curstash != PL_debstash) {
647 SV *sv = NEWSV(85,0);
649 sv_upgrade(sv, SVt_PVMG);
650 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
653 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
660 * Check the unary operators to ensure there's no ambiguity in how they're
661 * used. An ambiguous piece of code would be:
663 * This doesn't mean rand() + 5. Because rand() is a unary operator,
664 * the +5 is its argument.
673 if (PL_oldoldbufptr != PL_last_uni)
675 while (isSPACE(*PL_last_uni))
677 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
678 if ((t = strchr(s, '(')) && t < PL_bufptr)
680 if (ckWARN_d(WARN_AMBIGUOUS)){
683 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
684 "Warning: Use of \"%s\" without parens is ambiguous",
691 * LOP : macro to build a list operator. Its behaviour has been replaced
692 * with a subroutine, S_lop() for which LOP is just another name.
695 #define LOP(f,x) return lop(f,x,s)
699 * Build a list operator (or something that might be one). The rules:
700 * - if we have a next token, then it's a list operator [why?]
701 * - if the next thing is an opening paren, then it's a function
702 * - else it's a list operator
706 S_lop(pTHX_ I32 f, int x, char *s)
713 PL_last_lop = PL_oldbufptr;
714 PL_last_lop_op = (OPCODE)f;
728 * When the lexer realizes it knows the next token (for instance,
729 * it is reordering tokens for the parser) then it can call S_force_next
730 * to know what token to return the next time the lexer is called. Caller
731 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
732 * handles the token correctly.
736 S_force_next(pTHX_ I32 type)
738 PL_nexttype[PL_nexttoke] = type;
740 if (PL_lex_state != LEX_KNOWNEXT) {
741 PL_lex_defer = PL_lex_state;
742 PL_lex_expect = PL_expect;
743 PL_lex_state = LEX_KNOWNEXT;
749 * When the lexer knows the next thing is a word (for instance, it has
750 * just seen -> and it knows that the next char is a word char, then
751 * it calls S_force_word to stick the next word into the PL_next lookahead.
754 * char *start : buffer position (must be within PL_linestr)
755 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
756 * int check_keyword : if true, Perl checks to make sure the word isn't
757 * a keyword (do this if the word is a label, e.g. goto FOO)
758 * int allow_pack : if true, : characters will also be allowed (require,
760 * int allow_initial_tick : used by the "sub" lexer only.
764 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
769 start = skipspace(start);
771 if (isIDFIRST_lazy_if(s,UTF) ||
772 (allow_pack && *s == ':') ||
773 (allow_initial_tick && *s == '\'') )
775 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
776 if (check_keyword && keyword(PL_tokenbuf, len))
778 if (token == METHOD) {
783 PL_expect = XOPERATOR;
786 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
787 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
795 * Called when the lexer wants $foo *foo &foo etc, but the program
796 * text only contains the "foo" portion. The first argument is a pointer
797 * to the "foo", and the second argument is the type symbol to prefix.
798 * Forces the next token to be a "WORD".
799 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
803 S_force_ident(pTHX_ register char *s, int kind)
806 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
807 PL_nextval[PL_nexttoke].opval = o;
810 o->op_private = OPpCONST_ENTERED;
811 /* XXX see note in pp_entereval() for why we forgo typo
812 warnings if the symbol must be introduced in an eval.
814 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
815 kind == '$' ? SVt_PV :
816 kind == '@' ? SVt_PVAV :
817 kind == '%' ? SVt_PVHV :
825 Perl_str_to_version(pTHX_ SV *sv)
830 char *start = SvPVx(sv,len);
831 bool utf = SvUTF8(sv) ? TRUE : FALSE;
832 char *end = start + len;
833 while (start < end) {
837 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
842 retval += ((NV)n)/nshift;
851 * Forces the next token to be a version number.
852 * If the next token appears to be an invalid version number, (e.g. "v2b"),
853 * and if "guessing" is TRUE, then no new token is created (and the caller
854 * must use an alternative parsing method).
858 S_force_version(pTHX_ char *s, int guessing)
860 OP *version = Nullop;
869 while (isDIGIT(*d) || *d == '_' || *d == '.')
871 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
873 s = scan_num(s, &yylval);
874 version = yylval.opval;
875 ver = cSVOPx(version)->op_sv;
876 if (SvPOK(ver) && !SvNIOK(ver)) {
877 (void)SvUPGRADE(ver, SVt_PVNV);
878 SvNVX(ver) = str_to_version(ver);
879 SvNOK_on(ver); /* hint that it is a version */
886 /* NOTE: The parser sees the package name and the VERSION swapped */
887 PL_nextval[PL_nexttoke].opval = version;
895 * Tokenize a quoted string passed in as an SV. It finds the next
896 * chunk, up to end of string or a backslash. It may make a new
897 * SV containing that chunk (if HINT_NEW_STRING is on). It also
902 S_tokeq(pTHX_ SV *sv)
913 s = SvPV_force(sv, len);
914 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
917 while (s < send && *s != '\\')
922 if ( PL_hints & HINT_NEW_STRING ) {
923 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
929 if (s + 1 < send && (s[1] == '\\'))
930 s++; /* all that, just for this */
935 SvCUR_set(sv, d - SvPVX(sv));
937 if ( PL_hints & HINT_NEW_STRING )
938 return new_constant(NULL, 0, "q", sv, pv, "q");
943 * Now come three functions related to double-quote context,
944 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
945 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
946 * interact with PL_lex_state, and create fake ( ... ) argument lists
947 * to handle functions and concatenation.
948 * They assume that whoever calls them will be setting up a fake
949 * join call, because each subthing puts a ',' after it. This lets
952 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
954 * (I'm not sure whether the spurious commas at the end of lcfirst's
955 * arguments and join's arguments are created or not).
960 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
962 * Pattern matching will set PL_lex_op to the pattern-matching op to
963 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
965 * OP_CONST and OP_READLINE are easy--just make the new op and return.
967 * Everything else becomes a FUNC.
969 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
970 * had an OP_CONST or OP_READLINE). This just sets us up for a
971 * call to S_sublex_push().
977 register I32 op_type = yylval.ival;
979 if (op_type == OP_NULL) {
980 yylval.opval = PL_lex_op;
984 if (op_type == OP_CONST || op_type == OP_READLINE) {
985 SV *sv = tokeq(PL_lex_stuff);
987 if (SvTYPE(sv) == SVt_PVIV) {
988 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
994 nsv = newSVpvn(p, len);
1000 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1001 PL_lex_stuff = Nullsv;
1002 /* Allow <FH> // "foo" */
1003 if (op_type == OP_READLINE)
1004 PL_expect = XTERMORDORDOR;
1008 PL_sublex_info.super_state = PL_lex_state;
1009 PL_sublex_info.sub_inwhat = op_type;
1010 PL_sublex_info.sub_op = PL_lex_op;
1011 PL_lex_state = LEX_INTERPPUSH;
1015 yylval.opval = PL_lex_op;
1025 * Create a new scope to save the lexing state. The scope will be
1026 * ended in S_sublex_done. Returns a '(', starting the function arguments
1027 * to the uc, lc, etc. found before.
1028 * Sets PL_lex_state to LEX_INTERPCONCAT.
1036 PL_lex_state = PL_sublex_info.super_state;
1037 SAVEI32(PL_lex_dojoin);
1038 SAVEI32(PL_lex_brackets);
1039 SAVEI32(PL_lex_casemods);
1040 SAVEI32(PL_lex_starts);
1041 SAVEI32(PL_lex_state);
1042 SAVEVPTR(PL_lex_inpat);
1043 SAVEI32(PL_lex_inwhat);
1044 SAVECOPLINE(PL_curcop);
1045 SAVEPPTR(PL_bufptr);
1046 SAVEPPTR(PL_bufend);
1047 SAVEPPTR(PL_oldbufptr);
1048 SAVEPPTR(PL_oldoldbufptr);
1049 SAVEPPTR(PL_last_lop);
1050 SAVEPPTR(PL_last_uni);
1051 SAVEPPTR(PL_linestart);
1052 SAVESPTR(PL_linestr);
1053 SAVEGENERICPV(PL_lex_brackstack);
1054 SAVEGENERICPV(PL_lex_casestack);
1056 PL_linestr = PL_lex_stuff;
1057 PL_lex_stuff = Nullsv;
1059 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1060 = SvPVX(PL_linestr);
1061 PL_bufend += SvCUR(PL_linestr);
1062 PL_last_lop = PL_last_uni = Nullch;
1063 SAVEFREESV(PL_linestr);
1065 PL_lex_dojoin = FALSE;
1066 PL_lex_brackets = 0;
1067 New(899, PL_lex_brackstack, 120, char);
1068 New(899, PL_lex_casestack, 12, char);
1069 PL_lex_casemods = 0;
1070 *PL_lex_casestack = '\0';
1072 PL_lex_state = LEX_INTERPCONCAT;
1073 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1075 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1076 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1077 PL_lex_inpat = PL_sublex_info.sub_op;
1079 PL_lex_inpat = Nullop;
1086 * Restores lexer state after a S_sublex_push.
1092 if (!PL_lex_starts++) {
1093 SV *sv = newSVpvn("",0);
1094 if (SvUTF8(PL_linestr))
1096 PL_expect = XOPERATOR;
1097 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1101 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1102 PL_lex_state = LEX_INTERPCASEMOD;
1106 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1107 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1108 PL_linestr = PL_lex_repl;
1110 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1111 PL_bufend += SvCUR(PL_linestr);
1112 PL_last_lop = PL_last_uni = Nullch;
1113 SAVEFREESV(PL_linestr);
1114 PL_lex_dojoin = FALSE;
1115 PL_lex_brackets = 0;
1116 PL_lex_casemods = 0;
1117 *PL_lex_casestack = '\0';
1119 if (SvEVALED(PL_lex_repl)) {
1120 PL_lex_state = LEX_INTERPNORMAL;
1122 /* we don't clear PL_lex_repl here, so that we can check later
1123 whether this is an evalled subst; that means we rely on the
1124 logic to ensure sublex_done() is called again only via the
1125 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1128 PL_lex_state = LEX_INTERPCONCAT;
1129 PL_lex_repl = Nullsv;
1135 PL_bufend = SvPVX(PL_linestr);
1136 PL_bufend += SvCUR(PL_linestr);
1137 PL_expect = XOPERATOR;
1138 PL_sublex_info.sub_inwhat = 0;
1146 Extracts a pattern, double-quoted string, or transliteration. This
1149 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1150 processing a pattern (PL_lex_inpat is true), a transliteration
1151 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1153 Returns a pointer to the character scanned up to. Iff this is
1154 advanced from the start pointer supplied (ie if anything was
1155 successfully parsed), will leave an OP for the substring scanned
1156 in yylval. Caller must intuit reason for not parsing further
1157 by looking at the next characters herself.
1161 double-quoted style: \r and \n
1162 regexp special ones: \D \s
1164 backrefs: \1 (deprecated in substitution replacements)
1165 case and quoting: \U \Q \E
1166 stops on @ and $, but not for $ as tail anchor
1168 In transliterations:
1169 characters are VERY literal, except for - not at the start or end
1170 of the string, which indicates a range. scan_const expands the
1171 range to the full set of intermediate characters.
1173 In double-quoted strings:
1175 double-quoted style: \r and \n
1177 backrefs: \1 (deprecated)
1178 case and quoting: \U \Q \E
1181 scan_const does *not* construct ops to handle interpolated strings.
1182 It stops processing as soon as it finds an embedded $ or @ variable
1183 and leaves it to the caller to work out what's going on.
1185 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1187 $ in pattern could be $foo or could be tail anchor. Assumption:
1188 it's a tail anchor if $ is the last thing in the string, or if it's
1189 followed by one of ")| \n\t"
1191 \1 (backreferences) are turned into $1
1193 The structure of the code is
1194 while (there's a character to process) {
1195 handle transliteration ranges
1196 skip regexp comments
1197 skip # initiated comments in //x patterns
1198 check for embedded @foo
1199 check for embedded scalars
1201 leave intact backslashes from leave (below)
1202 deprecate \1 in strings and sub replacements
1203 handle string-changing backslashes \l \U \Q \E, etc.
1204 switch (what was escaped) {
1205 handle - in a transliteration (becomes a literal -)
1206 handle \132 octal characters
1207 handle 0x15 hex characters
1208 handle \cV (control V)
1209 handle printf backslashes (\f, \r, \n, etc)
1211 } (end if backslash)
1212 } (end while character to read)
1217 S_scan_const(pTHX_ char *start)
1219 register char *send = PL_bufend; /* end of the constant */
1220 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1221 register char *s = start; /* start of the constant */
1222 register char *d = SvPVX(sv); /* destination for copies */
1223 bool dorange = FALSE; /* are we in a translit range? */
1224 bool didrange = FALSE; /* did we just finish a range? */
1225 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1226 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1229 const char *leaveit = /* set of acceptably-backslashed characters */
1231 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1234 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1235 /* If we are doing a trans and we know we want UTF8 set expectation */
1236 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1237 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1241 while (s < send || dorange) {
1242 /* get transliterations out of the way (they're most literal) */
1243 if (PL_lex_inwhat == OP_TRANS) {
1244 /* expand a range A-Z to the full set of characters. AIE! */
1246 I32 i; /* current expanded character */
1247 I32 min; /* first character in range */
1248 I32 max; /* last character in range */
1251 char *c = (char*)utf8_hop((U8*)d, -1);
1255 *c = (char)UTF_TO_NATIVE(0xff);
1256 /* mark the range as done, and continue */
1262 i = d - SvPVX(sv); /* remember current offset */
1263 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1264 d = SvPVX(sv) + i; /* refresh d after realloc */
1265 d -= 2; /* eat the first char and the - */
1267 min = (U8)*d; /* first char in range */
1268 max = (U8)d[1]; /* last char in range */
1272 "Invalid range \"%c-%c\" in transliteration operator",
1273 (char)min, (char)max);
1277 if ((isLOWER(min) && isLOWER(max)) ||
1278 (isUPPER(min) && isUPPER(max))) {
1280 for (i = min; i <= max; i++)
1282 *d++ = NATIVE_TO_NEED(has_utf8,i);
1284 for (i = min; i <= max; i++)
1286 *d++ = NATIVE_TO_NEED(has_utf8,i);
1291 for (i = min; i <= max; i++)
1294 /* mark the range as done, and continue */
1300 /* range begins (ignore - as first or last char) */
1301 else if (*s == '-' && s+1 < send && s != start) {
1303 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1306 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1318 /* if we get here, we're not doing a transliteration */
1320 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1321 except for the last char, which will be done separately. */
1322 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1324 while (s < send && *s != ')')
1325 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1327 else if (s[2] == '{' /* This should match regcomp.c */
1328 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1331 char *regparse = s + (s[2] == '{' ? 3 : 4);
1334 while (count && (c = *regparse)) {
1335 if (c == '\\' && regparse[1])
1343 if (*regparse != ')') {
1344 regparse--; /* Leave one char for continuation. */
1345 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1347 while (s < regparse)
1348 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1352 /* likewise skip #-initiated comments in //x patterns */
1353 else if (*s == '#' && PL_lex_inpat &&
1354 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1355 while (s+1 < send && *s != '\n')
1356 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1359 /* check for embedded arrays
1360 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1362 else if (*s == '@' && s[1]
1363 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1366 /* check for embedded scalars. only stop if we're sure it's a
1369 else if (*s == '$') {
1370 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1372 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1373 break; /* in regexp, $ might be tail anchor */
1376 /* End of else if chain - OP_TRANS rejoin rest */
1379 if (*s == '\\' && s+1 < send) {
1382 /* some backslashes we leave behind */
1383 if (*leaveit && *s && strchr(leaveit, *s)) {
1384 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1385 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1389 /* deprecate \1 in strings and substitution replacements */
1390 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1391 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1393 if (ckWARN(WARN_SYNTAX))
1394 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1399 /* string-change backslash escapes */
1400 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1405 /* if we get here, it's either a quoted -, or a digit */
1408 /* quoted - in transliterations */
1410 if (PL_lex_inwhat == OP_TRANS) {
1417 if (ckWARN(WARN_MISC) &&
1420 Perl_warner(aTHX_ packWARN(WARN_MISC),
1421 "Unrecognized escape \\%c passed through",
1423 /* default action is to copy the quoted character */
1424 goto default_action;
1427 /* \132 indicates an octal constant */
1428 case '0': case '1': case '2': case '3':
1429 case '4': case '5': case '6': case '7':
1433 uv = grok_oct(s, &len, &flags, NULL);
1436 goto NUM_ESCAPE_INSERT;
1438 /* \x24 indicates a hex constant */
1442 char* e = strchr(s, '}');
1443 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1444 PERL_SCAN_DISALLOW_PREFIX;
1449 yyerror("Missing right brace on \\x{}");
1453 uv = grok_hex(s, &len, &flags, NULL);
1459 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1460 uv = grok_hex(s, &len, &flags, NULL);
1466 /* Insert oct or hex escaped character.
1467 * There will always enough room in sv since such
1468 * escapes will be longer than any UTF-8 sequence
1469 * they can end up as. */
1471 /* We need to map to chars to ASCII before doing the tests
1474 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1475 if (!has_utf8 && uv > 255) {
1476 /* Might need to recode whatever we have
1477 * accumulated so far if it contains any
1480 * (Can't we keep track of that and avoid
1481 * this rescan? --jhi)
1485 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1486 if (!NATIVE_IS_INVARIANT(*c)) {
1491 STRLEN offset = d - SvPVX(sv);
1493 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1497 while (src >= (U8 *)SvPVX(sv)) {
1498 if (!NATIVE_IS_INVARIANT(*src)) {
1499 U8 ch = NATIVE_TO_ASCII(*src);
1500 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1501 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1511 if (has_utf8 || uv > 255) {
1512 d = (char*)uvchr_to_utf8((U8*)d, uv);
1514 if (PL_lex_inwhat == OP_TRANS &&
1515 PL_sublex_info.sub_op) {
1516 PL_sublex_info.sub_op->op_private |=
1517 (PL_lex_repl ? OPpTRANS_FROM_UTF
1530 /* \N{LATIN SMALL LETTER A} is a named character */
1534 char* e = strchr(s, '}');
1540 yyerror("Missing right brace on \\N{}");
1544 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1546 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1547 PERL_SCAN_DISALLOW_PREFIX;
1550 uv = grok_hex(s, &len, &flags, NULL);
1552 goto NUM_ESCAPE_INSERT;
1554 res = newSVpvn(s + 1, e - s - 1);
1555 res = new_constant( Nullch, 0, "charnames",
1556 res, Nullsv, "\\N{...}" );
1558 sv_utf8_upgrade(res);
1559 str = SvPV(res,len);
1560 #ifdef EBCDIC_NEVER_MIND
1561 /* charnames uses pack U and that has been
1562 * recently changed to do the below uni->native
1563 * mapping, so this would be redundant (and wrong,
1564 * the code point would be doubly converted).
1565 * But leave this in just in case the pack U change
1566 * gets revoked, but the semantics is still
1567 * desireable for charnames. --jhi */
1569 UV uv = utf8_to_uvchr((U8*)str, 0);
1572 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1574 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1575 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1576 str = SvPV(res, len);
1580 if (!has_utf8 && SvUTF8(res)) {
1581 char *ostart = SvPVX(sv);
1582 SvCUR_set(sv, d - ostart);
1585 sv_utf8_upgrade(sv);
1586 /* this just broke our allocation above... */
1587 SvGROW(sv, (STRLEN)(send - start));
1588 d = SvPVX(sv) + SvCUR(sv);
1591 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1592 char *odest = SvPVX(sv);
1594 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1595 d = SvPVX(sv) + (d - odest);
1597 Copy(str, d, len, char);
1604 yyerror("Missing braces on \\N{}");
1607 /* \c is a control character */
1616 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1619 yyerror("Missing control char name in \\c");
1623 /* printf-style backslashes, formfeeds, newlines, etc */
1625 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1628 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1631 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1634 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1637 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1640 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1643 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1649 } /* end if (backslash) */
1652 /* If we started with encoded form, or already know we want it
1653 and then encode the next character */
1654 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1656 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1657 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1660 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1661 STRLEN off = d - SvPVX(sv);
1662 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1664 d = (char*)uvchr_to_utf8((U8*)d, uv);
1668 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1670 } /* while loop to process each character */
1672 /* terminate the string and set up the sv */
1674 SvCUR_set(sv, d - SvPVX(sv));
1675 if (SvCUR(sv) >= SvLEN(sv))
1676 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1679 if (PL_encoding && !has_utf8) {
1680 sv_recode_to_utf8(sv, PL_encoding);
1686 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1687 PL_sublex_info.sub_op->op_private |=
1688 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1692 /* shrink the sv if we allocated more than we used */
1693 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1694 SvLEN_set(sv, SvCUR(sv) + 1);
1695 Renew(SvPVX(sv), SvLEN(sv), char);
1698 /* return the substring (via yylval) only if we parsed anything */
1699 if (s > PL_bufptr) {
1700 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1701 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1703 ( PL_lex_inwhat == OP_TRANS
1705 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1708 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1715 * Returns TRUE if there's more to the expression (e.g., a subscript),
1718 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1720 * ->[ and ->{ return TRUE
1721 * { and [ outside a pattern are always subscripts, so return TRUE
1722 * if we're outside a pattern and it's not { or [, then return FALSE
1723 * if we're in a pattern and the first char is a {
1724 * {4,5} (any digits around the comma) returns FALSE
1725 * if we're in a pattern and the first char is a [
1727 * [SOMETHING] has a funky algorithm to decide whether it's a
1728 * character class or not. It has to deal with things like
1729 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1730 * anything else returns TRUE
1733 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1736 S_intuit_more(pTHX_ register char *s)
1738 if (PL_lex_brackets)
1740 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1742 if (*s != '{' && *s != '[')
1747 /* In a pattern, so maybe we have {n,m}. */
1764 /* On the other hand, maybe we have a character class */
1767 if (*s == ']' || *s == '^')
1770 /* this is terrifying, and it works */
1771 int weight = 2; /* let's weigh the evidence */
1773 unsigned char un_char = 255, last_un_char;
1774 char *send = strchr(s,']');
1775 char tmpbuf[sizeof PL_tokenbuf * 4];
1777 if (!send) /* has to be an expression */
1780 Zero(seen,256,char);
1783 else if (isDIGIT(*s)) {
1785 if (isDIGIT(s[1]) && s[2] == ']')
1791 for (; s < send; s++) {
1792 last_un_char = un_char;
1793 un_char = (unsigned char)*s;
1798 weight -= seen[un_char] * 10;
1799 if (isALNUM_lazy_if(s+1,UTF)) {
1800 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1801 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1806 else if (*s == '$' && s[1] &&
1807 strchr("[#!%*<>()-=",s[1])) {
1808 if (/*{*/ strchr("])} =",s[2]))
1817 if (strchr("wds]",s[1]))
1819 else if (seen['\''] || seen['"'])
1821 else if (strchr("rnftbxcav",s[1]))
1823 else if (isDIGIT(s[1])) {
1825 while (s[1] && isDIGIT(s[1]))
1835 if (strchr("aA01! ",last_un_char))
1837 if (strchr("zZ79~",s[1]))
1839 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1840 weight -= 5; /* cope with negative subscript */
1843 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1844 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1849 if (keyword(tmpbuf, d - tmpbuf))
1852 if (un_char == last_un_char + 1)
1854 weight -= seen[un_char];
1859 if (weight >= 0) /* probably a character class */
1869 * Does all the checking to disambiguate
1871 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1872 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1874 * First argument is the stuff after the first token, e.g. "bar".
1876 * Not a method if bar is a filehandle.
1877 * Not a method if foo is a subroutine prototyped to take a filehandle.
1878 * Not a method if it's really "Foo $bar"
1879 * Method if it's "foo $bar"
1880 * Not a method if it's really "print foo $bar"
1881 * Method if it's really "foo package::" (interpreted as package->foo)
1882 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1883 * Not a method if bar is a filehandle or package, but is quoted with
1888 S_intuit_method(pTHX_ char *start, GV *gv)
1890 char *s = start + (*start == '$');
1891 char tmpbuf[sizeof PL_tokenbuf];
1899 if ((cv = GvCVu(gv))) {
1900 char *proto = SvPVX(cv);
1910 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1911 /* start is the beginning of the possible filehandle/object,
1912 * and s is the end of it
1913 * tmpbuf is a copy of it
1916 if (*start == '$') {
1917 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1922 return *s == '(' ? FUNCMETH : METHOD;
1924 if (!keyword(tmpbuf, len)) {
1925 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1930 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1931 if (indirgv && GvCVu(indirgv))
1933 /* filehandle or package name makes it a method */
1934 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1936 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1937 return 0; /* no assumptions -- "=>" quotes bearword */
1939 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1940 newSVpvn(tmpbuf,len));
1941 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1945 return *s == '(' ? FUNCMETH : METHOD;
1953 * Return a string of Perl code to load the debugger. If PERL5DB
1954 * is set, it will return the contents of that, otherwise a
1955 * compile-time require of perl5db.pl.
1962 char *pdb = PerlEnv_getenv("PERL5DB");
1966 SETERRNO(0,SS_NORMAL);
1967 return "BEGIN { require 'perl5db.pl' }";
1973 /* Encoded script support. filter_add() effectively inserts a
1974 * 'pre-processing' function into the current source input stream.
1975 * Note that the filter function only applies to the current source file
1976 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1978 * The datasv parameter (which may be NULL) can be used to pass
1979 * private data to this instance of the filter. The filter function
1980 * can recover the SV using the FILTER_DATA macro and use it to
1981 * store private buffers and state information.
1983 * The supplied datasv parameter is upgraded to a PVIO type
1984 * and the IoDIRP/IoANY field is used to store the function pointer,
1985 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1986 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1987 * private use must be set using malloc'd pointers.
1991 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1996 if (!PL_rsfp_filters)
1997 PL_rsfp_filters = newAV();
1999 datasv = NEWSV(255,0);
2000 if (!SvUPGRADE(datasv, SVt_PVIO))
2001 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2002 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2003 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2004 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2005 (void*)funcp, SvPV_nolen(datasv)));
2006 av_unshift(PL_rsfp_filters, 1);
2007 av_store(PL_rsfp_filters, 0, datasv) ;
2012 /* Delete most recently added instance of this filter function. */
2014 Perl_filter_del(pTHX_ filter_t funcp)
2017 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2018 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2020 /* if filter is on top of stack (usual case) just pop it off */
2021 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2022 if (IoANY(datasv) == (void *)funcp) {
2023 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2024 IoANY(datasv) = (void *)NULL;
2025 sv_free(av_pop(PL_rsfp_filters));
2029 /* we need to search for the correct entry and clear it */
2030 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2034 /* Invoke the n'th filter function for the current rsfp. */
2036 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2039 /* 0 = read one text line */
2044 if (!PL_rsfp_filters)
2046 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2047 /* Provide a default input filter to make life easy. */
2048 /* Note that we append to the line. This is handy. */
2049 DEBUG_P(PerlIO_printf(Perl_debug_log,
2050 "filter_read %d: from rsfp\n", idx));
2054 int old_len = SvCUR(buf_sv) ;
2056 /* ensure buf_sv is large enough */
2057 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2058 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2059 if (PerlIO_error(PL_rsfp))
2060 return -1; /* error */
2062 return 0 ; /* end of file */
2064 SvCUR_set(buf_sv, old_len + len) ;
2067 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2068 if (PerlIO_error(PL_rsfp))
2069 return -1; /* error */
2071 return 0 ; /* end of file */
2074 return SvCUR(buf_sv);
2076 /* Skip this filter slot if filter has been deleted */
2077 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2078 DEBUG_P(PerlIO_printf(Perl_debug_log,
2079 "filter_read %d: skipped (filter deleted)\n",
2081 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2083 /* Get function pointer hidden within datasv */
2084 funcp = (filter_t)IoANY(datasv);
2085 DEBUG_P(PerlIO_printf(Perl_debug_log,
2086 "filter_read %d: via function %p (%s)\n",
2087 idx, (void*)funcp, SvPV_nolen(datasv)));
2088 /* Call function. The function is expected to */
2089 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2090 /* Return: <0:error, =0:eof, >0:not eof */
2091 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2095 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2097 #ifdef PERL_CR_FILTER
2098 if (!PL_rsfp_filters) {
2099 filter_add(S_cr_textfilter,NULL);
2102 if (PL_rsfp_filters) {
2105 SvCUR_set(sv, 0); /* start with empty line */
2106 if (FILTER_READ(0, sv, 0) > 0)
2107 return ( SvPVX(sv) ) ;
2112 return (sv_gets(sv, fp, append));
2116 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2120 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2124 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2125 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2127 return GvHV(gv); /* Foo:: */
2130 /* use constant CLASS => 'MyClass' */
2131 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2133 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2134 pkgname = SvPV_nolen(sv);
2138 return gv_stashpv(pkgname, FALSE);
2142 static char* exp_name[] =
2143 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2144 "ATTRTERM", "TERMBLOCK"
2151 Works out what to call the token just pulled out of the input
2152 stream. The yacc parser takes care of taking the ops we return and
2153 stitching them into a tree.
2159 if read an identifier
2160 if we're in a my declaration
2161 croak if they tried to say my($foo::bar)
2162 build the ops for a my() declaration
2163 if it's an access to a my() variable
2164 are we in a sort block?
2165 croak if my($a); $a <=> $b
2166 build ops for access to a my() variable
2167 if in a dq string, and they've said @foo and we can't find @foo
2169 build ops for a bareword
2170 if we already built the token before, use it.
2173 #ifdef USE_PURE_BISON
2175 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2180 yylval_pointer[yyactlevel] = lvalp;
2181 yychar_pointer[yyactlevel] = lcharp;
2182 if (yyactlevel >= YYMAXLEVEL)
2183 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2185 r = Perl_yylex(aTHX);
2195 #pragma segment Perl_yylex
2207 I32 orig_keyword = 0;
2209 /* check if there's an identifier for us to look at */
2210 if (PL_pending_ident)
2211 return S_pending_ident(aTHX);
2213 /* no identifier pending identification */
2215 switch (PL_lex_state) {
2217 case LEX_NORMAL: /* Some compilers will produce faster */
2218 case LEX_INTERPNORMAL: /* code if we comment these out. */
2222 /* when we've already built the next token, just pull it out of the queue */
2225 yylval = PL_nextval[PL_nexttoke];
2227 PL_lex_state = PL_lex_defer;
2228 PL_expect = PL_lex_expect;
2229 PL_lex_defer = LEX_NORMAL;
2231 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2232 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2233 (IV)PL_nexttype[PL_nexttoke]); });
2235 return(PL_nexttype[PL_nexttoke]);
2237 /* interpolated case modifiers like \L \U, including \Q and \E.
2238 when we get here, PL_bufptr is at the \
2240 case LEX_INTERPCASEMOD:
2242 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2243 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2245 /* handle \E or end of string */
2246 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2250 if (PL_lex_casemods) {
2251 oldmod = PL_lex_casestack[--PL_lex_casemods];
2252 PL_lex_casestack[PL_lex_casemods] = '\0';
2254 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2256 PL_lex_state = LEX_INTERPCONCAT;
2260 if (PL_bufptr != PL_bufend)
2262 PL_lex_state = LEX_INTERPCONCAT;
2266 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2267 "### Saw case modifier at '%s'\n", PL_bufptr); });
2269 if (s[1] == '\\' && s[2] == 'E') {
2271 PL_lex_state = LEX_INTERPCONCAT;
2275 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2276 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2277 if (strchr("LU", *s) &&
2278 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2279 PL_lex_casestack[--PL_lex_casemods] = '\0';
2282 if (PL_lex_casemods > 10)
2283 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2284 PL_lex_casestack[PL_lex_casemods++] = *s;
2285 PL_lex_casestack[PL_lex_casemods] = '\0';
2286 PL_lex_state = LEX_INTERPCONCAT;
2287 PL_nextval[PL_nexttoke].ival = 0;
2290 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2292 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2294 PL_nextval[PL_nexttoke].ival = OP_LC;
2296 PL_nextval[PL_nexttoke].ival = OP_UC;
2298 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2300 Perl_croak(aTHX_ "panic: yylex");
2304 if (PL_lex_starts) {
2313 case LEX_INTERPPUSH:
2314 return sublex_push();
2316 case LEX_INTERPSTART:
2317 if (PL_bufptr == PL_bufend)
2318 return sublex_done();
2319 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2320 "### Interpolated variable at '%s'\n", PL_bufptr); });
2322 PL_lex_dojoin = (*PL_bufptr == '@');
2323 PL_lex_state = LEX_INTERPNORMAL;
2324 if (PL_lex_dojoin) {
2325 PL_nextval[PL_nexttoke].ival = 0;
2327 force_ident("\"", '$');
2328 PL_nextval[PL_nexttoke].ival = 0;
2330 PL_nextval[PL_nexttoke].ival = 0;
2332 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2335 if (PL_lex_starts++) {
2341 case LEX_INTERPENDMAYBE:
2342 if (intuit_more(PL_bufptr)) {
2343 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2349 if (PL_lex_dojoin) {
2350 PL_lex_dojoin = FALSE;
2351 PL_lex_state = LEX_INTERPCONCAT;
2354 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2355 && SvEVALED(PL_lex_repl))
2357 if (PL_bufptr != PL_bufend)
2358 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2359 PL_lex_repl = Nullsv;
2362 case LEX_INTERPCONCAT:
2364 if (PL_lex_brackets)
2365 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2367 if (PL_bufptr == PL_bufend)
2368 return sublex_done();
2370 if (SvIVX(PL_linestr) == '\'') {
2371 SV *sv = newSVsv(PL_linestr);
2374 else if ( PL_hints & HINT_NEW_RE )
2375 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2376 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2380 s = scan_const(PL_bufptr);
2382 PL_lex_state = LEX_INTERPCASEMOD;
2384 PL_lex_state = LEX_INTERPSTART;
2387 if (s != PL_bufptr) {
2388 PL_nextval[PL_nexttoke] = yylval;
2391 if (PL_lex_starts++)
2401 PL_lex_state = LEX_NORMAL;
2402 s = scan_formline(PL_bufptr);
2403 if (!PL_lex_formbrack)
2409 PL_oldoldbufptr = PL_oldbufptr;
2412 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2413 exp_name[PL_expect], s);
2419 if (isIDFIRST_lazy_if(s,UTF))
2421 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2424 goto fake_eof; /* emulate EOF on ^D or ^Z */
2429 if (PL_lex_brackets)
2430 yyerror("Missing right curly or square bracket");
2431 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2432 "### Tokener got EOF\n");
2436 if (s++ < PL_bufend)
2437 goto retry; /* ignore stray nulls */
2440 if (!PL_in_eval && !PL_preambled) {
2441 PL_preambled = TRUE;
2442 sv_setpv(PL_linestr,incl_perldb());
2443 if (SvCUR(PL_linestr))
2444 sv_catpv(PL_linestr,";");
2446 while(AvFILLp(PL_preambleav) >= 0) {
2447 SV *tmpsv = av_shift(PL_preambleav);
2448 sv_catsv(PL_linestr, tmpsv);
2449 sv_catpv(PL_linestr, ";");
2452 sv_free((SV*)PL_preambleav);
2453 PL_preambleav = NULL;
2455 if (PL_minus_n || PL_minus_p) {
2456 sv_catpv(PL_linestr, "LINE: while (<>) {");
2458 sv_catpv(PL_linestr,"chomp;");
2461 if (strchr("/'\"", *PL_splitstr)
2462 && strchr(PL_splitstr + 1, *PL_splitstr))
2463 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2466 s = "'~#\200\1'"; /* surely one char is unused...*/
2467 while (s[1] && strchr(PL_splitstr, *s)) s++;
2469 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2470 "q" + (delim == '\''), delim);
2471 for (s = PL_splitstr; *s; s++) {
2473 sv_catpvn(PL_linestr, "\\", 1);
2474 sv_catpvn(PL_linestr, s, 1);
2476 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2480 sv_catpv(PL_linestr,"our @F=split(' ');");
2483 sv_catpv(PL_linestr, "\n");
2484 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2485 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2486 PL_last_lop = PL_last_uni = Nullch;
2487 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2488 SV *sv = NEWSV(85,0);
2490 sv_upgrade(sv, SVt_PVMG);
2491 sv_setsv(sv,PL_linestr);
2494 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2499 bof = PL_rsfp ? TRUE : FALSE;
2500 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2503 if (PL_preprocess && !PL_in_eval)
2504 (void)PerlProc_pclose(PL_rsfp);
2505 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2506 PerlIO_clearerr(PL_rsfp);
2508 (void)PerlIO_close(PL_rsfp);
2510 PL_doextract = FALSE;
2512 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2513 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2514 sv_catpv(PL_linestr,";}");
2515 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2516 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2517 PL_last_lop = PL_last_uni = Nullch;
2518 PL_minus_n = PL_minus_p = 0;
2521 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2522 PL_last_lop = PL_last_uni = Nullch;
2523 sv_setpv(PL_linestr,"");
2524 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2526 /* if it looks like the start of a BOM, check if it in fact is */
2527 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2528 #ifdef PERLIO_IS_STDIO
2529 # ifdef __GNU_LIBRARY__
2530 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2531 # define FTELL_FOR_PIPE_IS_BROKEN
2535 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2536 # define FTELL_FOR_PIPE_IS_BROKEN
2541 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2542 /* This loses the possibility to detect the bof
2543 * situation on perl -P when the libc5 is being used.
2544 * Workaround? Maybe attach some extra state to PL_rsfp?
2547 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2549 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2552 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2553 s = swallow_bom((U8*)s);
2557 /* Incest with pod. */
2558 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2559 sv_setpv(PL_linestr, "");
2560 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2561 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2562 PL_last_lop = PL_last_uni = Nullch;
2563 PL_doextract = FALSE;
2567 } while (PL_doextract);
2568 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2569 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2570 SV *sv = NEWSV(85,0);
2572 sv_upgrade(sv, SVt_PVMG);
2573 sv_setsv(sv,PL_linestr);
2576 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2578 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2579 PL_last_lop = PL_last_uni = Nullch;
2580 if (CopLINE(PL_curcop) == 1) {
2581 while (s < PL_bufend && isSPACE(*s))
2583 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2587 if (*s == '#' && *(s+1) == '!')
2589 #ifdef ALTERNATE_SHEBANG
2591 static char as[] = ALTERNATE_SHEBANG;
2592 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2593 d = s + (sizeof(as) - 1);
2595 #endif /* ALTERNATE_SHEBANG */
2604 while (*d && !isSPACE(*d))
2608 #ifdef ARG_ZERO_IS_SCRIPT
2609 if (ipathend > ipath) {
2611 * HP-UX (at least) sets argv[0] to the script name,
2612 * which makes $^X incorrect. And Digital UNIX and Linux,
2613 * at least, set argv[0] to the basename of the Perl
2614 * interpreter. So, having found "#!", we'll set it right.
2616 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2617 assert(SvPOK(x) || SvGMAGICAL(x));
2618 if (sv_eq(x, CopFILESV(PL_curcop))) {
2619 sv_setpvn(x, ipath, ipathend - ipath);
2625 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2626 char *lstart = SvPV(x,llen);
2628 bstart += blen - llen;
2629 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2630 sv_setpvn(x, ipath, ipathend - ipath);
2635 TAINT_NOT; /* $^X is always tainted, but that's OK */
2637 #endif /* ARG_ZERO_IS_SCRIPT */
2642 d = instr(s,"perl -");
2644 d = instr(s,"perl");
2646 /* avoid getting into infinite loops when shebang
2647 * line contains "Perl" rather than "perl" */
2649 for (d = ipathend-4; d >= ipath; --d) {
2650 if ((*d == 'p' || *d == 'P')
2651 && !ibcmp(d, "perl", 4))
2661 #ifdef ALTERNATE_SHEBANG
2663 * If the ALTERNATE_SHEBANG on this system starts with a
2664 * character that can be part of a Perl expression, then if
2665 * we see it but not "perl", we're probably looking at the
2666 * start of Perl code, not a request to hand off to some
2667 * other interpreter. Similarly, if "perl" is there, but
2668 * not in the first 'word' of the line, we assume the line
2669 * contains the start of the Perl program.
2671 if (d && *s != '#') {
2673 while (*c && !strchr("; \t\r\n\f\v#", *c))
2676 d = Nullch; /* "perl" not in first word; ignore */
2678 *s = '#'; /* Don't try to parse shebang line */
2680 #endif /* ALTERNATE_SHEBANG */
2681 #ifndef MACOS_TRADITIONAL
2686 !instr(s,"indir") &&
2687 instr(PL_origargv[0],"perl"))
2693 while (s < PL_bufend && isSPACE(*s))
2695 if (s < PL_bufend) {
2696 Newz(899,newargv,PL_origargc+3,char*);
2698 while (s < PL_bufend && !isSPACE(*s))
2701 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2704 newargv = PL_origargv;
2706 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2707 Perl_croak(aTHX_ "Can't exec %s", ipath);
2711 U32 oldpdb = PL_perldb;
2712 bool oldn = PL_minus_n;
2713 bool oldp = PL_minus_p;
2715 while (*d && !isSPACE(*d)) d++;
2716 while (SPACE_OR_TAB(*d)) d++;
2719 bool switches_done = PL_doswitches;
2721 if (*d == 'M' || *d == 'm') {
2723 while (*d && !isSPACE(*d)) d++;
2724 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2727 d = moreswitches(d);
2729 if ((PERLDB_LINE && !oldpdb) ||
2730 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2731 /* if we have already added "LINE: while (<>) {",
2732 we must not do it again */
2734 sv_setpv(PL_linestr, "");
2735 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2736 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2737 PL_last_lop = PL_last_uni = Nullch;
2738 PL_preambled = FALSE;
2740 (void)gv_fetchfile(PL_origfilename);
2743 if (PL_doswitches && !switches_done) {
2744 int argc = PL_origargc;
2745 char **argv = PL_origargv;
2748 } while (argc && argv[0][0] == '-' && argv[0][1]);
2749 init_argv_symbols(argc,argv);
2755 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2757 PL_lex_state = LEX_FORMLINE;
2762 #ifdef PERL_STRICT_CR
2763 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2765 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2767 case ' ': case '\t': case '\f': case 013:
2768 #ifdef MACOS_TRADITIONAL
2775 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2776 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2777 /* handle eval qq[#line 1 "foo"\n ...] */
2778 CopLINE_dec(PL_curcop);
2782 while (s < d && *s != '\n')
2786 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2787 Perl_croak(aTHX_ "panic: input overflow");
2789 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2791 PL_lex_state = LEX_FORMLINE;
2801 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2808 while (s < PL_bufend && SPACE_OR_TAB(*s))
2811 if (strnEQ(s,"=>",2)) {
2812 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2813 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2814 "### Saw unary minus before =>, forcing word '%s'\n", s);
2816 OPERATOR('-'); /* unary minus */
2818 PL_last_uni = PL_oldbufptr;
2820 case 'r': ftst = OP_FTEREAD; break;
2821 case 'w': ftst = OP_FTEWRITE; break;
2822 case 'x': ftst = OP_FTEEXEC; break;
2823 case 'o': ftst = OP_FTEOWNED; break;
2824 case 'R': ftst = OP_FTRREAD; break;
2825 case 'W': ftst = OP_FTRWRITE; break;
2826 case 'X': ftst = OP_FTREXEC; break;
2827 case 'O': ftst = OP_FTROWNED; break;
2828 case 'e': ftst = OP_FTIS; break;
2829 case 'z': ftst = OP_FTZERO; break;
2830 case 's': ftst = OP_FTSIZE; break;
2831 case 'f': ftst = OP_FTFILE; break;
2832 case 'd': ftst = OP_FTDIR; break;
2833 case 'l': ftst = OP_FTLINK; break;
2834 case 'p': ftst = OP_FTPIPE; break;
2835 case 'S': ftst = OP_FTSOCK; break;
2836 case 'u': ftst = OP_FTSUID; break;
2837 case 'g': ftst = OP_FTSGID; break;
2838 case 'k': ftst = OP_FTSVTX; break;
2839 case 'b': ftst = OP_FTBLK; break;
2840 case 'c': ftst = OP_FTCHR; break;
2841 case 't': ftst = OP_FTTTY; break;
2842 case 'T': ftst = OP_FTTEXT; break;
2843 case 'B': ftst = OP_FTBINARY; break;
2844 case 'M': case 'A': case 'C':
2845 gv_fetchpv("\024",TRUE, SVt_PV);
2847 case 'M': ftst = OP_FTMTIME; break;
2848 case 'A': ftst = OP_FTATIME; break;
2849 case 'C': ftst = OP_FTCTIME; break;
2857 PL_last_lop_op = (OPCODE)ftst;
2858 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2859 "### Saw file test %c\n", (int)ftst);
2864 /* Assume it was a minus followed by a one-letter named
2865 * subroutine call (or a -bareword), then. */
2866 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2867 "### %c looked like a file test but was not\n",
2876 if (PL_expect == XOPERATOR)
2881 else if (*s == '>') {
2884 if (isIDFIRST_lazy_if(s,UTF)) {
2885 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2893 if (PL_expect == XOPERATOR)
2896 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2898 OPERATOR('-'); /* unary minus */
2905 if (PL_expect == XOPERATOR)
2910 if (PL_expect == XOPERATOR)
2913 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2919 if (PL_expect != XOPERATOR) {
2920 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2921 PL_expect = XOPERATOR;
2922 force_ident(PL_tokenbuf, '*');
2935 if (PL_expect == XOPERATOR) {
2939 PL_tokenbuf[0] = '%';
2940 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2941 if (!PL_tokenbuf[1]) {
2943 yyerror("Final % should be \\% or %name");
2946 PL_pending_ident = '%';
2965 switch (PL_expect) {
2968 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2970 PL_bufptr = s; /* update in case we back off */
2976 PL_expect = XTERMBLOCK;
2980 while (isIDFIRST_lazy_if(s,UTF)) {
2981 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2982 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2983 if (tmp < 0) tmp = -tmp;
2999 d = scan_str(d,TRUE,TRUE);
3001 /* MUST advance bufptr here to avoid bogus
3002 "at end of line" context messages from yyerror().
3004 PL_bufptr = s + len;
3005 yyerror("Unterminated attribute parameter in attribute list");
3008 return 0; /* EOF indicator */
3012 SV *sv = newSVpvn(s, len);
3013 sv_catsv(sv, PL_lex_stuff);
3014 attrs = append_elem(OP_LIST, attrs,
3015 newSVOP(OP_CONST, 0, sv));
3016 SvREFCNT_dec(PL_lex_stuff);
3017 PL_lex_stuff = Nullsv;
3020 /* NOTE: any CV attrs applied here need to be part of
3021 the CVf_BUILTIN_ATTRS define in cv.h! */
3022 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3023 CvLVALUE_on(PL_compcv);
3024 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3025 CvLOCKED_on(PL_compcv);
3026 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3027 CvMETHOD_on(PL_compcv);
3029 else if (PL_in_my == KEY_our && len == 6 &&
3030 strnEQ(s, "unique", len))
3031 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3033 /* After we've set the flags, it could be argued that
3034 we don't need to do the attributes.pm-based setting
3035 process, and shouldn't bother appending recognized
3036 flags. To experiment with that, uncomment the
3037 following "else". (Note that's already been
3038 uncommented. That keeps the above-applied built-in
3039 attributes from being intercepted (and possibly
3040 rejected) by a package's attribute routines, but is
3041 justified by the performance win for the common case
3042 of applying only built-in attributes.) */
3044 attrs = append_elem(OP_LIST, attrs,
3045 newSVOP(OP_CONST, 0,
3049 if (*s == ':' && s[1] != ':')
3052 break; /* require real whitespace or :'s */
3054 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3055 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3056 char q = ((*s == '\'') ? '"' : '\'');
3057 /* If here for an expression, and parsed no attrs, back off. */
3058 if (tmp == '=' && !attrs) {
3062 /* MUST advance bufptr here to avoid bogus "at end of line"
3063 context messages from yyerror().
3067 yyerror("Unterminated attribute list");
3069 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3077 PL_nextval[PL_nexttoke].opval = attrs;
3085 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3086 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3102 if (PL_lex_brackets <= 0)
3103 yyerror("Unmatched right square bracket");
3106 if (PL_lex_state == LEX_INTERPNORMAL) {
3107 if (PL_lex_brackets == 0) {
3108 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3109 PL_lex_state = LEX_INTERPEND;
3116 if (PL_lex_brackets > 100) {
3117 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3119 switch (PL_expect) {
3121 if (PL_lex_formbrack) {
3125 if (PL_oldoldbufptr == PL_last_lop)
3126 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3128 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3129 OPERATOR(HASHBRACK);
3131 while (s < PL_bufend && SPACE_OR_TAB(*s))
3134 PL_tokenbuf[0] = '\0';
3135 if (d < PL_bufend && *d == '-') {
3136 PL_tokenbuf[0] = '-';
3138 while (d < PL_bufend && SPACE_OR_TAB(*d))
3141 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3142 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3144 while (d < PL_bufend && SPACE_OR_TAB(*d))
3147 char minus = (PL_tokenbuf[0] == '-');
3148 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3156 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3161 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3166 if (PL_oldoldbufptr == PL_last_lop)
3167 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3169 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3172 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3174 /* This hack is to get the ${} in the message. */
3176 yyerror("syntax error");
3179 OPERATOR(HASHBRACK);
3181 /* This hack serves to disambiguate a pair of curlies
3182 * as being a block or an anon hash. Normally, expectation
3183 * determines that, but in cases where we're not in a
3184 * position to expect anything in particular (like inside
3185 * eval"") we have to resolve the ambiguity. This code
3186 * covers the case where the first term in the curlies is a
3187 * quoted string. Most other cases need to be explicitly
3188 * disambiguated by prepending a `+' before the opening
3189 * curly in order to force resolution as an anon hash.
3191 * XXX should probably propagate the outer expectation
3192 * into eval"" to rely less on this hack, but that could
3193 * potentially break current behavior of eval"".
3197 if (*s == '\'' || *s == '"' || *s == '`') {
3198 /* common case: get past first string, handling escapes */
3199 for (t++; t < PL_bufend && *t != *s;)
3200 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3204 else if (*s == 'q') {
3207 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3211 char open, close, term;
3214 while (t < PL_bufend && isSPACE(*t))
3218 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3222 for (t++; t < PL_bufend; t++) {
3223 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3225 else if (*t == open)
3229 for (t++; t < PL_bufend; t++) {
3230 if (*t == '\\' && t+1 < PL_bufend)
3232 else if (*t == close && --brackets <= 0)
3234 else if (*t == open)
3240 else if (isALNUM_lazy_if(t,UTF)) {
3242 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3245 while (t < PL_bufend && isSPACE(*t))
3247 /* if comma follows first term, call it an anon hash */
3248 /* XXX it could be a comma expression with loop modifiers */
3249 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3250 || (*t == '=' && t[1] == '>')))
3251 OPERATOR(HASHBRACK);
3252 if (PL_expect == XREF)
3255 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3261 yylval.ival = CopLINE(PL_curcop);
3262 if (isSPACE(*s) || *s == '#')
3263 PL_copline = NOLINE; /* invalidate current command line number */
3268 if (PL_lex_brackets <= 0)
3269 yyerror("Unmatched right curly bracket");
3271 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3272 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3273 PL_lex_formbrack = 0;
3274 if (PL_lex_state == LEX_INTERPNORMAL) {
3275 if (PL_lex_brackets == 0) {
3276 if (PL_expect & XFAKEBRACK) {
3277 PL_expect &= XENUMMASK;
3278 PL_lex_state = LEX_INTERPEND;
3280 return yylex(); /* ignore fake brackets */
3282 if (*s == '-' && s[1] == '>')
3283 PL_lex_state = LEX_INTERPENDMAYBE;
3284 else if (*s != '[' && *s != '{')
3285 PL_lex_state = LEX_INTERPEND;
3288 if (PL_expect & XFAKEBRACK) {
3289 PL_expect &= XENUMMASK;
3291 return yylex(); /* ignore fake brackets */
3301 if (PL_expect == XOPERATOR) {
3302 if (ckWARN(WARN_SEMICOLON)
3303 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3305 CopLINE_dec(PL_curcop);
3306 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3307 CopLINE_inc(PL_curcop);
3312 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3314 PL_expect = XOPERATOR;
3315 force_ident(PL_tokenbuf, '&');
3319 yylval.ival = (OPpENTERSUB_AMPER<<8);
3338 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3339 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3341 if (PL_expect == XSTATE && isALPHA(tmp) &&
3342 (s == PL_linestart+1 || s[-2] == '\n') )
3344 if (PL_in_eval && !PL_rsfp) {
3349 if (strnEQ(s,"=cut",4)) {
3363 PL_doextract = TRUE;
3366 if (PL_lex_brackets < PL_lex_formbrack) {
3368 #ifdef PERL_STRICT_CR
3369 for (t = s; SPACE_OR_TAB(*t); t++) ;
3371 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3373 if (*t == '\n' || *t == '#') {
3391 if (PL_expect != XOPERATOR) {
3392 if (s[1] != '<' && !strchr(s,'>'))
3395 s = scan_heredoc(s);
3397 s = scan_inputsymbol(s);
3398 TERM(sublex_start());
3403 SHop(OP_LEFT_SHIFT);
3417 SHop(OP_RIGHT_SHIFT);
3426 if (PL_expect == XOPERATOR) {
3427 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3430 return ','; /* grandfather non-comma-format format */
3434 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3435 PL_tokenbuf[0] = '@';
3436 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3437 sizeof PL_tokenbuf - 1, FALSE);
3438 if (PL_expect == XOPERATOR)
3439 no_op("Array length", s);
3440 if (!PL_tokenbuf[1])
3442 PL_expect = XOPERATOR;
3443 PL_pending_ident = '#';
3447 PL_tokenbuf[0] = '$';
3448 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3449 sizeof PL_tokenbuf - 1, FALSE);
3450 if (PL_expect == XOPERATOR)
3452 if (!PL_tokenbuf[1]) {
3454 yyerror("Final $ should be \\$ or $name");
3458 /* This kludge not intended to be bulletproof. */
3459 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3460 yylval.opval = newSVOP(OP_CONST, 0,
3461 newSViv(PL_compiling.cop_arybase));
3462 yylval.opval->op_private = OPpCONST_ARYBASE;
3468 if (PL_lex_state == LEX_NORMAL)
3471 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3474 PL_tokenbuf[0] = '@';
3475 if (ckWARN(WARN_SYNTAX)) {
3477 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3480 PL_bufptr = skipspace(PL_bufptr);
3481 while (t < PL_bufend && *t != ']')
3483 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3484 "Multidimensional syntax %.*s not supported",
3485 (t - PL_bufptr) + 1, PL_bufptr);
3489 else if (*s == '{') {
3490 PL_tokenbuf[0] = '%';
3491 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3492 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3494 char tmpbuf[sizeof PL_tokenbuf];
3496 for (t++; isSPACE(*t); t++) ;
3497 if (isIDFIRST_lazy_if(t,UTF)) {
3498 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3499 for (; isSPACE(*t); t++) ;
3500 if (*t == ';' && get_cv(tmpbuf, FALSE))
3501 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3502 "You need to quote \"%s\"", tmpbuf);
3508 PL_expect = XOPERATOR;
3509 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3510 bool islop = (PL_last_lop == PL_oldoldbufptr);
3511 if (!islop || PL_last_lop_op == OP_GREPSTART)
3512 PL_expect = XOPERATOR;
3513 else if (strchr("$@\"'`q", *s))
3514 PL_expect = XTERM; /* e.g. print $fh "foo" */
3515 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3516 PL_expect = XTERM; /* e.g. print $fh &sub */
3517 else if (isIDFIRST_lazy_if(s,UTF)) {
3518 char tmpbuf[sizeof PL_tokenbuf];
3519 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3520 if ((tmp = keyword(tmpbuf, len))) {
3521 /* binary operators exclude handle interpretations */
3533 PL_expect = XTERM; /* e.g. print $fh length() */
3538 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3539 if (gv && GvCVu(gv))
3540 PL_expect = XTERM; /* e.g. print $fh subr() */
3543 else if (isDIGIT(*s))
3544 PL_expect = XTERM; /* e.g. print $fh 3 */
3545 else if (*s == '.' && isDIGIT(s[1]))
3546 PL_expect = XTERM; /* e.g. print $fh .3 */
3547 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3548 PL_expect = XTERM; /* e.g. print $fh -1 */
3549 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3550 PL_expect = XTERM; /* e.g. print $fh /.../
3551 XXX except DORDOR operator */
3552 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3553 PL_expect = XTERM; /* print $fh <<"EOF" */
3555 PL_pending_ident = '$';
3559 if (PL_expect == XOPERATOR)
3561 PL_tokenbuf[0] = '@';
3562 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3563 if (!PL_tokenbuf[1]) {
3565 yyerror("Final @ should be \\@ or @name");
3568 if (PL_lex_state == LEX_NORMAL)
3570 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3572 PL_tokenbuf[0] = '%';
3574 /* Warn about @ where they meant $. */
3575 if (ckWARN(WARN_SYNTAX)) {
3576 if (*s == '[' || *s == '{') {
3578 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3580 if (*t == '}' || *t == ']') {
3582 PL_bufptr = skipspace(PL_bufptr);
3583 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3584 "Scalar value %.*s better written as $%.*s",
3585 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3590 PL_pending_ident = '@';
3593 case '/': /* may be division, defined-or, or pattern */
3594 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3598 case '?': /* may either be conditional or pattern */
3599 if(PL_expect == XOPERATOR) {
3607 /* A // operator. */
3617 /* Disable warning on "study /blah/" */
3618 if (PL_oldoldbufptr == PL_last_uni
3619 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3620 || memNE(PL_last_uni, "study", 5)
3621 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3624 s = scan_pat(s,OP_MATCH);
3625 TERM(sublex_start());
3629 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3630 #ifdef PERL_STRICT_CR
3633 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3635 && (s == PL_linestart || s[-1] == '\n') )
3637 PL_lex_formbrack = 0;
3641 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3647 yylval.ival = OPf_SPECIAL;
3653 if (PL_expect != XOPERATOR)
3658 case '0': case '1': case '2': case '3': case '4':
3659 case '5': case '6': case '7': case '8': case '9':
3660 s = scan_num(s, &yylval);
3661 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3662 "### Saw number in '%s'\n", s);
3664 if (PL_expect == XOPERATOR)
3669 s = scan_str(s,FALSE,FALSE);
3670 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3671 "### Saw string before '%s'\n", s);
3673 if (PL_expect == XOPERATOR) {
3674 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3677 return ','; /* grandfather non-comma-format format */
3683 missingterm((char*)0);
3684 yylval.ival = OP_CONST;
3685 TERM(sublex_start());
3688 s = scan_str(s,FALSE,FALSE);
3689 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3690 "### Saw string before '%s'\n", s);
3692 if (PL_expect == XOPERATOR) {
3693 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3696 return ','; /* grandfather non-comma-format format */
3702 missingterm((char*)0);
3703 yylval.ival = OP_CONST;
3704 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3705 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3706 yylval.ival = OP_STRINGIFY;
3710 TERM(sublex_start());
3713 s = scan_str(s,FALSE,FALSE);
3714 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3715 "### Saw backtick string before '%s'\n", s);
3717 if (PL_expect == XOPERATOR)
3718 no_op("Backticks",s);
3720 missingterm((char*)0);
3721 yylval.ival = OP_BACKTICK;
3723 TERM(sublex_start());
3727 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3728 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3730 if (PL_expect == XOPERATOR)
3731 no_op("Backslash",s);
3735 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3739 while (isDIGIT(*start) || *start == '_')
3741 if (*start == '.' && isDIGIT(start[1])) {
3742 s = scan_num(s, &yylval);
3745 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3746 else if (!isALPHA(*start) && (PL_expect == XTERM
3747 || PL_expect == XREF || PL_expect == XSTATE
3748 || PL_expect == XTERMORDORDOR)) {
3752 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3755 s = scan_num(s, &yylval);
3762 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3802 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3804 /* Some keywords can be followed by any delimiter, including ':' */
3805 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3806 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3807 (PL_tokenbuf[0] == 'q' &&
3808 strchr("qwxr", PL_tokenbuf[1])))));
3810 /* x::* is just a word, unless x is "CORE" */
3811 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3815 while (d < PL_bufend && isSPACE(*d))
3816 d++; /* no comments skipped here, or s### is misparsed */
3818 /* Is this a label? */
3819 if (!tmp && PL_expect == XSTATE
3820 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3822 yylval.pval = savepv(PL_tokenbuf);
3827 /* Check for keywords */
3828 tmp = keyword(PL_tokenbuf, len);
3830 /* Is this a word before a => operator? */
3831 if (*d == '=' && d[1] == '>') {
3833 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3834 yylval.opval->op_private = OPpCONST_BARE;
3835 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3836 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3840 if (tmp < 0) { /* second-class keyword? */
3841 GV *ogv = Nullgv; /* override (winner) */
3842 GV *hgv = Nullgv; /* hidden (loser) */
3843 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3845 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3848 if (GvIMPORTED_CV(gv))
3850 else if (! CvMETHOD(cv))
3854 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3855 (gv = *gvp) != (GV*)&PL_sv_undef &&
3856 GvCVu(gv) && GvIMPORTED_CV(gv))
3863 tmp = 0; /* overridden by import or by GLOBAL */
3866 && -tmp==KEY_lock /* XXX generalizable kludge */
3868 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3870 tmp = 0; /* any sub overrides "weak" keyword */
3872 else { /* no override */
3874 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3875 Perl_warner(aTHX_ packWARN(WARN_MISC),
3876 "dump() better written as CORE::dump()");
3880 if (ckWARN(WARN_AMBIGUOUS) && hgv
3881 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3882 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3883 "Ambiguous call resolved as CORE::%s(), %s",
3884 GvENAME(hgv), "qualify as such or use &");
3891 default: /* not a keyword */
3895 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3897 /* Get the rest if it looks like a package qualifier */
3899 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3901 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3904 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3905 *s == '\'' ? "'" : "::");
3910 if (PL_expect == XOPERATOR) {
3911 if (PL_bufptr == PL_linestart) {
3912 CopLINE_dec(PL_curcop);
3913 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3914 CopLINE_inc(PL_curcop);
3917 no_op("Bareword",s);
3920 /* Look for a subroutine with this name in current package,
3921 unless name is "Foo::", in which case Foo is a bearword
3922 (and a package name). */
3925 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3927 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3928 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3929 "Bareword \"%s\" refers to nonexistent package",
3932 PL_tokenbuf[len] = '\0';
3939 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3942 /* if we saw a global override before, get the right name */
3945 sv = newSVpvn("CORE::GLOBAL::",14);
3946 sv_catpv(sv,PL_tokenbuf);
3949 sv = newSVpv(PL_tokenbuf,0);
3951 /* Presume this is going to be a bareword of some sort. */
3954 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3955 yylval.opval->op_private = OPpCONST_BARE;
3956 /* UTF-8 package name? */
3957 if (UTF && !IN_BYTES &&
3958 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3961 /* And if "Foo::", then that's what it certainly is. */
3966 /* See if it's the indirect object for a list operator. */
3968 if (PL_oldoldbufptr &&
3969 PL_oldoldbufptr < PL_bufptr &&
3970 (PL_oldoldbufptr == PL_last_lop
3971 || PL_oldoldbufptr == PL_last_uni) &&
3972 /* NO SKIPSPACE BEFORE HERE! */
3973 (PL_expect == XREF ||
3974 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3976 bool immediate_paren = *s == '(';
3978 /* (Now we can afford to cross potential line boundary.) */
3981 /* Two barewords in a row may indicate method call. */
3983 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3986 /* If not a declared subroutine, it's an indirect object. */
3987 /* (But it's an indir obj regardless for sort.) */
3989 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3990 ((!gv || !GvCVu(gv)) &&
3991 (PL_last_lop_op != OP_MAPSTART &&
3992 PL_last_lop_op != OP_GREPSTART))))
3994 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3999 PL_expect = XOPERATOR;
4002 /* Is this a word before a => operator? */
4003 if (*s == '=' && s[1] == '>' && !pkgname) {
4005 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4006 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4007 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4011 /* If followed by a paren, it's certainly a subroutine. */
4014 if (gv && GvCVu(gv)) {
4015 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4016 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4021 PL_nextval[PL_nexttoke].opval = yylval.opval;
4022 PL_expect = XOPERATOR;
4028 /* If followed by var or block, call it a method (unless sub) */
4030 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4031 PL_last_lop = PL_oldbufptr;
4032 PL_last_lop_op = OP_METHOD;
4036 /* If followed by a bareword, see if it looks like indir obj. */
4039 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4040 && (tmp = intuit_method(s,gv)))
4043 /* Not a method, so call it a subroutine (if defined) */
4045 if (gv && GvCVu(gv)) {
4047 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4048 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4049 "Ambiguous use of -%s resolved as -&%s()",
4050 PL_tokenbuf, PL_tokenbuf);
4051 /* Check for a constant sub */
4053 if ((sv = cv_const_sv(cv))) {
4055 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4056 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4057 yylval.opval->op_private = 0;
4061 /* Resolve to GV now. */
4062 op_free(yylval.opval);
4063 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4064 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4065 PL_last_lop = PL_oldbufptr;
4066 PL_last_lop_op = OP_ENTERSUB;
4067 /* Is there a prototype? */
4070 char *proto = SvPV((SV*)cv, len);
4073 if (strEQ(proto, "$"))
4075 if (*proto == '&' && *s == '{') {
4076 sv_setpv(PL_subname, PL_curstash ?
4077 "__ANON__" : "__ANON__::__ANON__");
4081 PL_nextval[PL_nexttoke].opval = yylval.opval;
4087 /* Call it a bare word */
4089 if (PL_hints & HINT_STRICT_SUBS)
4090 yylval.opval->op_private |= OPpCONST_STRICT;
4093 if (ckWARN(WARN_RESERVED)) {
4094 if (lastchar != '-') {
4095 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4096 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4097 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4104 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4105 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4106 "Operator or semicolon missing before %c%s",
4107 lastchar, PL_tokenbuf);
4108 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4109 "Ambiguous use of %c resolved as operator %c",
4110 lastchar, lastchar);
4116 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4117 newSVpv(CopFILE(PL_curcop),0));
4121 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4122 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4125 case KEY___PACKAGE__:
4126 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4128 ? newSVsv(PL_curstname)
4137 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4138 char *pname = "main";
4139 if (PL_tokenbuf[2] == 'D')
4140 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4141 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4144 GvIOp(gv) = newIO();
4145 IoIFP(GvIOp(gv)) = PL_rsfp;
4146 #if defined(HAS_FCNTL) && defined(F_SETFD)
4148 int fd = PerlIO_fileno(PL_rsfp);
4149 fcntl(fd,F_SETFD,fd >= 3);
4152 /* Mark this internal pseudo-handle as clean */
4153 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4155 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4156 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4157 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4159 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4160 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4161 /* if the script was opened in binmode, we need to revert
4162 * it to text mode for compatibility; but only iff it has CRs
4163 * XXX this is a questionable hack at best. */
4164 if (PL_bufend-PL_bufptr > 2
4165 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4168 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4169 loc = PerlIO_tell(PL_rsfp);
4170 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4173 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4175 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4176 #endif /* NETWARE */
4177 #ifdef PERLIO_IS_STDIO /* really? */
4178 # if defined(__BORLANDC__)
4179 /* XXX see note in do_binmode() */
4180 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4184 PerlIO_seek(PL_rsfp, loc, 0);
4188 #ifdef PERLIO_LAYERS
4189 if (UTF && !IN_BYTES)
4190 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4203 if (PL_expect == XSTATE) {
4210 if (*s == ':' && s[1] == ':') {
4213 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4214 if (!(tmp = keyword(PL_tokenbuf, len)))
4215 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4229 LOP(OP_ACCEPT,XTERM);
4235 LOP(OP_ATAN2,XTERM);
4241 LOP(OP_BINMODE,XTERM);
4244 LOP(OP_BLESS,XTERM);
4253 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4270 if (!PL_cryptseen) {
4271 PL_cryptseen = TRUE;
4275 LOP(OP_CRYPT,XTERM);
4278 LOP(OP_CHMOD,XTERM);
4281 LOP(OP_CHOWN,XTERM);
4284 LOP(OP_CONNECT,XTERM);
4300 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4304 PL_hints |= HINT_BLOCK_SCOPE;
4314 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4315 LOP(OP_DBMOPEN,XTERM);
4321 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4328 yylval.ival = CopLINE(PL_curcop);
4342 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4343 UNIBRACK(OP_ENTEREVAL);
4361 case KEY_endhostent:
4367 case KEY_endservent:
4370 case KEY_endprotoent:
4381 yylval.ival = CopLINE(PL_curcop);
4383 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4385 if ((PL_bufend - p) >= 3 &&
4386 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4388 else if ((PL_bufend - p) >= 4 &&
4389 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4392 if (isIDFIRST_lazy_if(p,UTF)) {
4393 p = scan_ident(p, PL_bufend,
4394 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4398 Perl_croak(aTHX_ "Missing $ on loop variable");
4403 LOP(OP_FORMLINE,XTERM);
4409 LOP(OP_FCNTL,XTERM);
4415 LOP(OP_FLOCK,XTERM);
4424 LOP(OP_GREPSTART, XREF);
4427 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4442 case KEY_getpriority:
4443 LOP(OP_GETPRIORITY,XTERM);
4445 case KEY_getprotobyname:
4448 case KEY_getprotobynumber:
4449 LOP(OP_GPBYNUMBER,XTERM);
4451 case KEY_getprotoent:
4463 case KEY_getpeername:
4464 UNI(OP_GETPEERNAME);
4466 case KEY_gethostbyname:
4469 case KEY_gethostbyaddr:
4470 LOP(OP_GHBYADDR,XTERM);
4472 case KEY_gethostent:
4475 case KEY_getnetbyname:
4478 case KEY_getnetbyaddr:
4479 LOP(OP_GNBYADDR,XTERM);
4484 case KEY_getservbyname:
4485 LOP(OP_GSBYNAME,XTERM);
4487 case KEY_getservbyport:
4488 LOP(OP_GSBYPORT,XTERM);
4490 case KEY_getservent:
4493 case KEY_getsockname:
4494 UNI(OP_GETSOCKNAME);
4496 case KEY_getsockopt:
4497 LOP(OP_GSOCKOPT,XTERM);
4519 yylval.ival = CopLINE(PL_curcop);
4523 LOP(OP_INDEX,XTERM);
4529 LOP(OP_IOCTL,XTERM);
4541 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4573 LOP(OP_LISTEN,XTERM);
4582 s = scan_pat(s,OP_MATCH);
4583 TERM(sublex_start());
4586 LOP(OP_MAPSTART, XREF);
4589 LOP(OP_MKDIR,XTERM);
4592 LOP(OP_MSGCTL,XTERM);
4595 LOP(OP_MSGGET,XTERM);
4598 LOP(OP_MSGRCV,XTERM);
4601 LOP(OP_MSGSND,XTERM);
4607 if (isIDFIRST_lazy_if(s,UTF)) {
4608 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4609 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4611 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4612 if (!PL_in_my_stash) {
4615 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4623 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4630 if (PL_expect != XSTATE)
4631 yyerror("\"no\" not allowed in expression");
4632 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4633 s = force_version(s, FALSE);
4638 if (*s == '(' || (s = skipspace(s), *s == '('))
4645 if (isIDFIRST_lazy_if(s,UTF)) {
4647 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4649 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4651 && !(t[0] == '=' && t[1] == '>')
4653 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4654 "Precedence problem: open %.*s should be open(%.*s)",
4655 d - s, s, d - s, s);
4661 yylval.ival = OP_OR;
4671 LOP(OP_OPEN_DIR,XTERM);
4674 checkcomma(s,PL_tokenbuf,"filehandle");
4678 checkcomma(s,PL_tokenbuf,"filehandle");
4697 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4701 LOP(OP_PIPE_OP,XTERM);
4704 s = scan_str(s,FALSE,FALSE);
4706 missingterm((char*)0);
4707 yylval.ival = OP_CONST;
4708 TERM(sublex_start());
4714 s = scan_str(s,FALSE,FALSE);
4716 missingterm((char*)0);
4718 if (SvCUR(PL_lex_stuff)) {
4721 d = SvPV_force(PL_lex_stuff, len);
4724 for (; isSPACE(*d) && len; --len, ++d) ;
4727 if (!warned && ckWARN(WARN_QW)) {
4728 for (; !isSPACE(*d) && len; --len, ++d) {
4730 Perl_warner(aTHX_ packWARN(WARN_QW),
4731 "Possible attempt to separate words with commas");
4734 else if (*d == '#') {
4735 Perl_warner(aTHX_ packWARN(WARN_QW),
4736 "Possible attempt to put comments in qw() list");
4742 for (; !isSPACE(*d) && len; --len, ++d) ;
4744 sv = newSVpvn(b, d-b);
4745 if (DO_UTF8(PL_lex_stuff))
4747 words = append_elem(OP_LIST, words,
4748 newSVOP(OP_CONST, 0, tokeq(sv)));
4752 PL_nextval[PL_nexttoke].opval = words;
4757 SvREFCNT_dec(PL_lex_stuff);
4758 PL_lex_stuff = Nullsv;
4764 s = scan_str(s,FALSE,FALSE);
4766 missingterm((char*)0);
4767 yylval.ival = OP_STRINGIFY;
4768 if (SvIVX(PL_lex_stuff) == '\'')
4769 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4770 TERM(sublex_start());
4773 s = scan_pat(s,OP_QR);
4774 TERM(sublex_start());
4777 s = scan_str(s,FALSE,FALSE);
4779 missingterm((char*)0);
4780 yylval.ival = OP_BACKTICK;
4782 TERM(sublex_start());
4790 s = force_version(s, FALSE);
4792 else if (*s != 'v' || !isDIGIT(s[1])
4793 || (s = force_version(s, TRUE), *s == 'v'))
4795 *PL_tokenbuf = '\0';
4796 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4797 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4798 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4800 yyerror("<> should be quotes");
4808 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4812 LOP(OP_RENAME,XTERM);
4821 LOP(OP_RINDEX,XTERM);
4831 UNIDOR(OP_READLINE);
4844 LOP(OP_REVERSE,XTERM);
4847 UNIDOR(OP_READLINK);
4855 TERM(sublex_start());
4857 TOKEN(1); /* force error */
4866 LOP(OP_SELECT,XTERM);
4872 LOP(OP_SEMCTL,XTERM);
4875 LOP(OP_SEMGET,XTERM);
4878 LOP(OP_SEMOP,XTERM);
4884 LOP(OP_SETPGRP,XTERM);
4886 case KEY_setpriority:
4887 LOP(OP_SETPRIORITY,XTERM);
4889 case KEY_sethostent:
4895 case KEY_setservent:
4898 case KEY_setprotoent:
4908 LOP(OP_SEEKDIR,XTERM);
4910 case KEY_setsockopt:
4911 LOP(OP_SSOCKOPT,XTERM);
4917 LOP(OP_SHMCTL,XTERM);
4920 LOP(OP_SHMGET,XTERM);
4923 LOP(OP_SHMREAD,XTERM);
4926 LOP(OP_SHMWRITE,XTERM);
4929 LOP(OP_SHUTDOWN,XTERM);
4938 LOP(OP_SOCKET,XTERM);
4940 case KEY_socketpair:
4941 LOP(OP_SOCKPAIR,XTERM);
4944 checkcomma(s,PL_tokenbuf,"subroutine name");
4946 if (*s == ';' || *s == ')') /* probably a close */
4947 Perl_croak(aTHX_ "sort is now a reserved word");
4949 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4953 LOP(OP_SPLIT,XTERM);
4956 LOP(OP_SPRINTF,XTERM);
4959 LOP(OP_SPLICE,XTERM);
4974 LOP(OP_SUBSTR,XTERM);
4980 char tmpbuf[sizeof PL_tokenbuf];
4981 SSize_t tboffset = 0;
4982 expectation attrful;
4983 bool have_name, have_proto, bad_proto;
4988 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4989 (*s == ':' && s[1] == ':'))
4992 attrful = XATTRBLOCK;
4993 /* remember buffer pos'n for later force_word */
4994 tboffset = s - PL_oldbufptr;
4995 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4996 if (strchr(tmpbuf, ':'))
4997 sv_setpv(PL_subname, tmpbuf);
4999 sv_setsv(PL_subname,PL_curstname);
5000 sv_catpvn(PL_subname,"::",2);
5001 sv_catpvn(PL_subname,tmpbuf,len);
5008 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5009 PL_expect = XTERMBLOCK;
5010 attrful = XATTRTERM;
5011 sv_setpv(PL_subname,"?");
5015 if (key == KEY_format) {
5017 PL_lex_formbrack = PL_lex_brackets + 1;
5019 (void) force_word(PL_oldbufptr + tboffset, WORD,
5024 /* Look for a prototype */
5028 s = scan_str(s,FALSE,FALSE);
5030 Perl_croak(aTHX_ "Prototype not terminated");
5031 /* strip spaces and check for bad characters */
5032 d = SvPVX(PL_lex_stuff);
5035 for (p = d; *p; ++p) {
5038 if (!strchr("$@%*;[]&\\", *p))
5043 if (bad_proto && ckWARN(WARN_SYNTAX))
5044 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5045 "Illegal character in prototype for %"SVf" : %s",
5047 SvCUR(PL_lex_stuff) = tmp;
5055 if (*s == ':' && s[1] != ':')
5056 PL_expect = attrful;
5057 else if (!have_name && *s != '{' && key == KEY_sub)
5058 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5061 PL_nextval[PL_nexttoke].opval =
5062 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5063 PL_lex_stuff = Nullsv;
5067 sv_setpv(PL_subname,
5068 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5071 (void) force_word(PL_oldbufptr + tboffset, WORD,
5080 LOP(OP_SYSTEM,XREF);
5083 LOP(OP_SYMLINK,XTERM);
5086 LOP(OP_SYSCALL,XTERM);
5089 LOP(OP_SYSOPEN,XTERM);
5092 LOP(OP_SYSSEEK,XTERM);
5095 LOP(OP_SYSREAD,XTERM);
5098 LOP(OP_SYSWRITE,XTERM);
5102 TERM(sublex_start());
5123 LOP(OP_TRUNCATE,XTERM);
5135 yylval.ival = CopLINE(PL_curcop);
5139 yylval.ival = CopLINE(PL_curcop);
5143 LOP(OP_UNLINK,XTERM);
5149 LOP(OP_UNPACK,XTERM);
5152 LOP(OP_UTIME,XTERM);
5158 LOP(OP_UNSHIFT,XTERM);
5161 if (PL_expect != XSTATE)
5162 yyerror("\"use\" not allowed in expression");
5164 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5165 s = force_version(s, TRUE);
5166 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5167 PL_nextval[PL_nexttoke].opval = Nullop;
5170 else if (*s == 'v') {
5171 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5172 s = force_version(s, FALSE);
5176 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5177 s = force_version(s, FALSE);
5189 yylval.ival = CopLINE(PL_curcop);
5193 PL_hints |= HINT_BLOCK_SCOPE;
5200 LOP(OP_WAITPID,XTERM);
5209 ctl_l[0] = toCTRL('L');
5211 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5214 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5219 if (PL_expect == XOPERATOR)
5225 yylval.ival = OP_XOR;
5230 TERM(sublex_start());
5235 #pragma segment Main
5239 S_pending_ident(pTHX)
5243 /* pit holds the identifier we read and pending_ident is reset */
5244 char pit = PL_pending_ident;
5245 PL_pending_ident = 0;
5247 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5248 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5250 /* if we're in a my(), we can't allow dynamics here.
5251 $foo'bar has already been turned into $foo::bar, so
5252 just check for colons.
5254 if it's a legal name, the OP is a PADANY.
5257 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5258 if (strchr(PL_tokenbuf,':'))
5259 yyerror(Perl_form(aTHX_ "No package name allowed for "
5260 "variable %s in \"our\"",
5262 tmp = allocmy(PL_tokenbuf);
5265 if (strchr(PL_tokenbuf,':'))
5266 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5268 yylval.opval = newOP(OP_PADANY, 0);
5269 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5275 build the ops for accesses to a my() variable.
5277 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5278 then used in a comparison. This catches most, but not
5279 all cases. For instance, it catches
5280 sort { my($a); $a <=> $b }
5282 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5283 (although why you'd do that is anyone's guess).
5286 if (!strchr(PL_tokenbuf,':')) {
5288 tmp = pad_findmy(PL_tokenbuf);
5289 if (tmp != NOT_IN_PAD) {
5290 /* might be an "our" variable" */
5291 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5292 /* build ops for a bareword */
5293 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5294 sv_catpvn(sym, "::", 2);
5295 sv_catpv(sym, PL_tokenbuf+1);
5296 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5297 yylval.opval->op_private = OPpCONST_ENTERED;
5298 gv_fetchpv(SvPVX(sym),
5300 ? (GV_ADDMULTI | GV_ADDINEVAL)
5303 ((PL_tokenbuf[0] == '$') ? SVt_PV
5304 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5309 /* if it's a sort block and they're naming $a or $b */
5310 if (PL_last_lop_op == OP_SORT &&
5311 PL_tokenbuf[0] == '$' &&
5312 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5315 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5316 d < PL_bufend && *d != '\n';
5319 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5320 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5326 yylval.opval = newOP(OP_PADANY, 0);
5327 yylval.opval->op_targ = tmp;
5333 Whine if they've said @foo in a doublequoted string,
5334 and @foo isn't a variable we can find in the symbol
5337 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5338 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5339 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5340 && ckWARN(WARN_AMBIGUOUS))
5342 /* Downgraded from fatal to warning 20000522 mjd */
5343 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5344 "Possible unintended interpolation of %s in string",
5349 /* build ops for a bareword */
5350 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5351 yylval.opval->op_private = OPpCONST_ENTERED;
5352 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5353 ((PL_tokenbuf[0] == '$') ? SVt_PV
5354 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5360 Perl_keyword(pTHX_ register char *d, I32 len)
5365 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5366 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5367 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5368 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5369 if (strEQ(d,"__END__")) return KEY___END__;
5373 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5378 if (strEQ(d,"and")) return -KEY_and;
5379 if (strEQ(d,"abs")) return -KEY_abs;
5382 if (strEQ(d,"alarm")) return -KEY_alarm;
5383 if (strEQ(d,"atan2")) return -KEY_atan2;
5386 if (strEQ(d,"accept")) return -KEY_accept;
5391 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5394 if (strEQ(d,"bless")) return -KEY_bless;
5395 if (strEQ(d,"bind")) return -KEY_bind;
5396 if (strEQ(d,"binmode")) return -KEY_binmode;
5399 if (strEQ(d,"CORE")) return -KEY_CORE;
5400 if (strEQ(d,"CHECK")) return KEY_CHECK;
5405 if (strEQ(d,"cmp")) return -KEY_cmp;
5406 if (strEQ(d,"chr")) return -KEY_chr;
5407 if (strEQ(d,"cos")) return -KEY_cos;
5410 if (strEQ(d,"chop")) return -KEY_chop;
5413 if (strEQ(d,"close")) return -KEY_close;
5414 if (strEQ(d,"chdir")) return -KEY_chdir;
5415 if (strEQ(d,"chomp")) return -KEY_chomp;
5416 if (strEQ(d,"chmod")) return -KEY_chmod;
5417 if (strEQ(d,"chown")) return -KEY_chown;
5418 if (strEQ(d,"crypt")) return -KEY_crypt;
5421 if (strEQ(d,"chroot")) return -KEY_chroot;
5422 if (strEQ(d,"caller")) return -KEY_caller;
5425 if (strEQ(d,"connect")) return -KEY_connect;
5428 if (strEQ(d,"closedir")) return -KEY_closedir;
5429 if (strEQ(d,"continue")) return -KEY_continue;
5434 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5439 if (strEQ(d,"do")) return KEY_do;
5442 if (strEQ(d,"die")) return -KEY_die;
5445 if (strEQ(d,"dump")) return -KEY_dump;
5448 if (strEQ(d,"delete")) return KEY_delete;
5451 if (strEQ(d,"defined")) return KEY_defined;
5452 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5455 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5460 if (strEQ(d,"END")) return KEY_END;
5465 if (strEQ(d,"eq")) return -KEY_eq;
5468 if (strEQ(d,"eof")) return -KEY_eof;
5469 if (strEQ(d,"err")) return -KEY_err;
5470 if (strEQ(d,"exp")) return -KEY_exp;
5473 if (strEQ(d,"else")) return KEY_else;
5474 if (strEQ(d,"exit")) return -KEY_exit;
5475 if (strEQ(d,"eval")) return KEY_eval;
5476 if (strEQ(d,"exec")) return -KEY_exec;
5477 if (strEQ(d,"each")) return -KEY_each;
5480 if (strEQ(d,"elsif")) return KEY_elsif;
5483 if (strEQ(d,"exists")) return KEY_exists;
5484 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5487 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5488 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5491 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5494 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5495 if (strEQ(d,"endservent")) return -KEY_endservent;
5498 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5505 if (strEQ(d,"for")) return KEY_for;
5508 if (strEQ(d,"fork")) return -KEY_fork;
5511 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5512 if (strEQ(d,"flock")) return -KEY_flock;
5515 if (strEQ(d,"format")) return KEY_format;
5516 if (strEQ(d,"fileno")) return -KEY_fileno;
5519 if (strEQ(d,"foreach")) return KEY_foreach;
5522 if (strEQ(d,"formline")) return -KEY_formline;
5527 if (strnEQ(d,"get",3)) {
5532 if (strEQ(d,"ppid")) return -KEY_getppid;
5533 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5536 if (strEQ(d,"pwent")) return -KEY_getpwent;
5537 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5538 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5541 if (strEQ(d,"peername")) return -KEY_getpeername;
5542 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5543 if (strEQ(d,"priority")) return -KEY_getpriority;
5546 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5549 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5553 else if (*d == 'h') {
5554 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5555 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5556 if (strEQ(d,"hostent")) return -KEY_gethostent;
5558 else if (*d == 'n') {
5559 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5560 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5561 if (strEQ(d,"netent")) return -KEY_getnetent;
5563 else if (*d == 's') {
5564 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5565 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5566 if (strEQ(d,"servent")) return -KEY_getservent;
5567 if (strEQ(d,"sockname")) return -KEY_getsockname;
5568 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5570 else if (*d == 'g') {
5571 if (strEQ(d,"grent")) return -KEY_getgrent;
5572 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5573 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5575 else if (*d == 'l') {
5576 if (strEQ(d,"login")) return -KEY_getlogin;
5578 else if (strEQ(d,"c")) return -KEY_getc;
5583 if (strEQ(d,"gt")) return -KEY_gt;
5584 if (strEQ(d,"ge")) return -KEY_ge;
5587 if (strEQ(d,"grep")) return KEY_grep;
5588 if (strEQ(d,"goto")) return KEY_goto;
5589 if (strEQ(d,"glob")) return KEY_glob;
5592 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5597 if (strEQ(d,"hex")) return -KEY_hex;
5600 if (strEQ(d,"INIT")) return KEY_INIT;
5605 if (strEQ(d,"if")) return KEY_if;
5608 if (strEQ(d,"int")) return -KEY_int;
5611 if (strEQ(d,"index")) return -KEY_index;
5612 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5617 if (strEQ(d,"join")) return -KEY_join;
5621 if (strEQ(d,"keys")) return -KEY_keys;
5622 if (strEQ(d,"kill")) return -KEY_kill;
5628 if (strEQ(d,"lt")) return -KEY_lt;
5629 if (strEQ(d,"le")) return -KEY_le;
5630 if (strEQ(d,"lc")) return -KEY_lc;
5633 if (strEQ(d,"log")) return -KEY_log;
5636 if (strEQ(d,"last")) return KEY_last;
5637 if (strEQ(d,"link")) return -KEY_link;
5638 if (strEQ(d,"lock")) return -KEY_lock;
5641 if (strEQ(d,"local")) return KEY_local;
5642 if (strEQ(d,"lstat")) return -KEY_lstat;
5645 if (strEQ(d,"length")) return -KEY_length;
5646 if (strEQ(d,"listen")) return -KEY_listen;
5649 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5652 if (strEQ(d,"localtime")) return -KEY_localtime;
5658 case 1: return KEY_m;
5660 if (strEQ(d,"my")) return KEY_my;
5663 if (strEQ(d,"map")) return KEY_map;
5666 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5669 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5670 if (strEQ(d,"msgget")) return -KEY_msgget;
5671 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5672 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5677 if (strEQ(d,"next")) return KEY_next;
5678 if (strEQ(d,"ne")) return -KEY_ne;
5679 if (strEQ(d,"not")) return -KEY_not;
5680 if (strEQ(d,"no")) return KEY_no;
5685 if (strEQ(d,"or")) return -KEY_or;
5688 if (strEQ(d,"ord")) return -KEY_ord;
5689 if (strEQ(d,"oct")) return -KEY_oct;
5690 if (strEQ(d,"our")) return KEY_our;
5693 if (strEQ(d,"open")) return -KEY_open;
5696 if (strEQ(d,"opendir")) return -KEY_opendir;
5703 if (strEQ(d,"pop")) return -KEY_pop;
5704 if (strEQ(d,"pos")) return KEY_pos;
5707 if (strEQ(d,"push")) return -KEY_push;
5708 if (strEQ(d,"pack")) return -KEY_pack;
5709 if (strEQ(d,"pipe")) return -KEY_pipe;
5712 if (strEQ(d,"print")) return KEY_print;
5715 if (strEQ(d,"printf")) return KEY_printf;
5718 if (strEQ(d,"package")) return KEY_package;
5721 if (strEQ(d,"prototype")) return KEY_prototype;
5726 if (strEQ(d,"q")) return KEY_q;
5727 if (strEQ(d,"qr")) return KEY_qr;
5728 if (strEQ(d,"qq")) return KEY_qq;
5729 if (strEQ(d,"qw")) return KEY_qw;
5730 if (strEQ(d,"qx")) return KEY_qx;
5732 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5737 if (strEQ(d,"ref")) return -KEY_ref;
5740 if (strEQ(d,"read")) return -KEY_read;
5741 if (strEQ(d,"rand")) return -KEY_rand;
5742 if (strEQ(d,"recv")) return -KEY_recv;
5743 if (strEQ(d,"redo")) return KEY_redo;
5746 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5747 if (strEQ(d,"reset")) return -KEY_reset;
5750 if (strEQ(d,"return")) return KEY_return;
5751 if (strEQ(d,"rename")) return -KEY_rename;
5752 if (strEQ(d,"rindex")) return -KEY_rindex;
5755 if (strEQ(d,"require")) return KEY_require;
5756 if (strEQ(d,"reverse")) return -KEY_reverse;
5757 if (strEQ(d,"readdir")) return -KEY_readdir;
5760 if (strEQ(d,"readlink")) return -KEY_readlink;
5761 if (strEQ(d,"readline")) return -KEY_readline;
5762 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5765 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5771 case 0: return KEY_s;
5773 if (strEQ(d,"scalar")) return KEY_scalar;
5778 if (strEQ(d,"seek")) return -KEY_seek;
5779 if (strEQ(d,"send")) return -KEY_send;
5782 if (strEQ(d,"semop")) return -KEY_semop;
5785 if (strEQ(d,"select")) return -KEY_select;
5786 if (strEQ(d,"semctl")) return -KEY_semctl;
5787 if (strEQ(d,"semget")) return -KEY_semget;
5790 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5791 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5794 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5795 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5798 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5801 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5802 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5803 if (strEQ(d,"setservent")) return -KEY_setservent;
5806 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5807 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5814 if (strEQ(d,"shift")) return -KEY_shift;
5817 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5818 if (strEQ(d,"shmget")) return -KEY_shmget;
5821 if (strEQ(d,"shmread")) return -KEY_shmread;
5824 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5825 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5830 if (strEQ(d,"sin")) return -KEY_sin;
5833 if (strEQ(d,"sleep")) return -KEY_sleep;
5836 if (strEQ(d,"sort")) return KEY_sort;
5837 if (strEQ(d,"socket")) return -KEY_socket;
5838 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5841 if (strEQ(d,"split")) return KEY_split;
5842 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5843 if (strEQ(d,"splice")) return -KEY_splice;
5846 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5849 if (strEQ(d,"srand")) return -KEY_srand;
5852 if (strEQ(d,"stat")) return -KEY_stat;
5853 if (strEQ(d,"study")) return KEY_study;
5856 if (strEQ(d,"substr")) return -KEY_substr;
5857 if (strEQ(d,"sub")) return KEY_sub;
5862 if (strEQ(d,"system")) return -KEY_system;
5865 if (strEQ(d,"symlink")) return -KEY_symlink;
5866 if (strEQ(d,"syscall")) return -KEY_syscall;
5867 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5868 if (strEQ(d,"sysread")) return -KEY_sysread;
5869 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5872 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5881 if (strEQ(d,"tr")) return KEY_tr;
5884 if (strEQ(d,"tie")) return KEY_tie;
5887 if (strEQ(d,"tell")) return -KEY_tell;
5888 if (strEQ(d,"tied")) return KEY_tied;
5889 if (strEQ(d,"time")) return -KEY_time;
5892 if (strEQ(d,"times")) return -KEY_times;
5895 if (strEQ(d,"telldir")) return -KEY_telldir;
5898 if (strEQ(d,"truncate")) return -KEY_truncate;
5905 if (strEQ(d,"uc")) return -KEY_uc;
5908 if (strEQ(d,"use")) return KEY_use;
5911 if (strEQ(d,"undef")) return KEY_undef;
5912 if (strEQ(d,"until")) return KEY_until;
5913 if (strEQ(d,"untie")) return KEY_untie;
5914 if (strEQ(d,"utime")) return -KEY_utime;
5915 if (strEQ(d,"umask")) return -KEY_umask;
5918 if (strEQ(d,"unless")) return KEY_unless;
5919 if (strEQ(d,"unpack")) return -KEY_unpack;
5920 if (strEQ(d,"unlink")) return -KEY_unlink;
5923 if (strEQ(d,"unshift")) return -KEY_unshift;
5924 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5929 if (strEQ(d,"values")) return -KEY_values;
5930 if (strEQ(d,"vec")) return -KEY_vec;
5935 if (strEQ(d,"warn")) return -KEY_warn;
5936 if (strEQ(d,"wait")) return -KEY_wait;
5939 if (strEQ(d,"while")) return KEY_while;
5940 if (strEQ(d,"write")) return -KEY_write;
5943 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5946 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5951 if (len == 1) return -KEY_x;
5952 if (strEQ(d,"xor")) return -KEY_xor;
5955 if (len == 1) return KEY_y;
5964 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5968 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5969 if (ckWARN(WARN_SYNTAX)) {
5971 for (w = s+2; *w && level; w++) {
5978 for (; *w && isSPACE(*w); w++) ;
5979 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5980 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5981 "%s (...) interpreted as function",name);
5984 while (s < PL_bufend && isSPACE(*s))
5988 while (s < PL_bufend && isSPACE(*s))
5990 if (isIDFIRST_lazy_if(s,UTF)) {
5992 while (isALNUM_lazy_if(s,UTF))
5994 while (s < PL_bufend && isSPACE(*s))
5999 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6003 Perl_croak(aTHX_ "No comma allowed after %s", what);
6008 /* Either returns sv, or mortalizes sv and returns a new SV*.
6009 Best used as sv=new_constant(..., sv, ...).
6010 If s, pv are NULL, calls subroutine with one argument,
6011 and type is used with error messages only. */
6014 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6018 HV *table = GvHV(PL_hintgv); /* ^H */
6022 const char *why1, *why2, *why3;
6024 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6027 why2 = strEQ(key,"charnames")
6028 ? "(possibly a missing \"use charnames ...\")"
6030 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6031 (type ? type: "undef"), why2);
6033 /* This is convoluted and evil ("goto considered harmful")
6034 * but I do not understand the intricacies of all the different
6035 * failure modes of %^H in here. The goal here is to make
6036 * the most probable error message user-friendly. --jhi */
6041 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6042 (type ? type: "undef"), why1, why2, why3);
6044 yyerror(SvPVX(msg));
6048 cvp = hv_fetch(table, key, strlen(key), FALSE);
6049 if (!cvp || !SvOK(*cvp)) {
6052 why3 = "} is not defined";
6055 sv_2mortal(sv); /* Parent created it permanently */
6058 pv = sv_2mortal(newSVpvn(s, len));
6060 typesv = sv_2mortal(newSVpv(type, 0));
6062 typesv = &PL_sv_undef;
6064 PUSHSTACKi(PERLSI_OVERLOAD);
6076 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6080 /* Check the eval first */
6081 if (!PL_in_eval && SvTRUE(ERRSV)) {
6083 sv_catpv(ERRSV, "Propagated");
6084 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6086 res = SvREFCNT_inc(sv);
6090 (void)SvREFCNT_inc(res);
6099 why1 = "Call to &{$^H{";
6101 why3 = "}} did not return a defined value";
6110 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6112 register char *d = dest;
6113 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6116 Perl_croak(aTHX_ ident_too_long);
6117 if (isALNUM(*s)) /* UTF handled below */
6119 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6124 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6128 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6129 char *t = s + UTF8SKIP(s);
6130 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6132 if (d + (t - s) > e)
6133 Perl_croak(aTHX_ ident_too_long);
6134 Copy(s, d, t - s, char);
6147 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6157 e = d + destlen - 3; /* two-character token, ending NUL */
6159 while (isDIGIT(*s)) {
6161 Perl_croak(aTHX_ ident_too_long);
6168 Perl_croak(aTHX_ ident_too_long);
6169 if (isALNUM(*s)) /* UTF handled below */
6171 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6176 else if (*s == ':' && s[1] == ':') {
6180 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6181 char *t = s + UTF8SKIP(s);
6182 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6184 if (d + (t - s) > e)
6185 Perl_croak(aTHX_ ident_too_long);
6186 Copy(s, d, t - s, char);
6197 if (PL_lex_state != LEX_NORMAL)
6198 PL_lex_state = LEX_INTERPENDMAYBE;
6201 if (*s == '$' && s[1] &&
6202 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6215 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6220 if (isSPACE(s[-1])) {
6223 if (!SPACE_OR_TAB(ch)) {
6229 if (isIDFIRST_lazy_if(d,UTF)) {
6233 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6235 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6238 Copy(s, d, e - s, char);
6243 while ((isALNUM(*s) || *s == ':') && d < e)
6246 Perl_croak(aTHX_ ident_too_long);
6249 while (s < send && SPACE_OR_TAB(*s)) s++;
6250 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6251 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6252 const char *brack = *s == '[' ? "[...]" : "{...}";
6253 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6254 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6255 funny, dest, brack, funny, dest, brack);
6258 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6262 /* Handle extended ${^Foo} variables
6263 * 1999-02-27 mjd-perl-patch@plover.com */
6264 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6268 while (isALNUM(*s) && d < e) {
6272 Perl_croak(aTHX_ ident_too_long);
6277 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6278 PL_lex_state = LEX_INTERPEND;
6281 if (PL_lex_state == LEX_NORMAL) {
6282 if (ckWARN(WARN_AMBIGUOUS) &&
6283 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6285 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6286 "Ambiguous use of %c{%s} resolved to %c%s",
6287 funny, dest, funny, dest);
6292 s = bracket; /* let the parser handle it */
6296 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6297 PL_lex_state = LEX_INTERPEND;
6302 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6307 *pmfl |= PMf_GLOBAL;
6309 *pmfl |= PMf_CONTINUE;
6313 *pmfl |= PMf_MULTILINE;
6315 *pmfl |= PMf_SINGLELINE;
6317 *pmfl |= PMf_EXTENDED;
6321 S_scan_pat(pTHX_ char *start, I32 type)
6326 s = scan_str(start,FALSE,FALSE);
6328 Perl_croak(aTHX_ "Search pattern not terminated");
6330 pm = (PMOP*)newPMOP(type, 0);
6331 if (PL_multi_open == '?')
6332 pm->op_pmflags |= PMf_ONCE;
6334 while (*s && strchr("iomsx", *s))
6335 pmflag(&pm->op_pmflags,*s++);
6338 while (*s && strchr("iogcmsx", *s))
6339 pmflag(&pm->op_pmflags,*s++);
6341 /* issue a warning if /c is specified,but /g is not */
6342 if (ckWARN(WARN_REGEXP) &&
6343 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6345 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6348 pm->op_pmpermflags = pm->op_pmflags;
6350 PL_lex_op = (OP*)pm;
6351 yylval.ival = OP_MATCH;
6356 S_scan_subst(pTHX_ char *start)
6363 yylval.ival = OP_NULL;
6365 s = scan_str(start,FALSE,FALSE);
6368 Perl_croak(aTHX_ "Substitution pattern not terminated");
6370 if (s[-1] == PL_multi_open)
6373 first_start = PL_multi_start;
6374 s = scan_str(s,FALSE,FALSE);
6377 SvREFCNT_dec(PL_lex_stuff);
6378 PL_lex_stuff = Nullsv;
6380 Perl_croak(aTHX_ "Substitution replacement not terminated");
6382 PL_multi_start = first_start; /* so whole substitution is taken together */
6384 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6390 else if (strchr("iogcmsx", *s))
6391 pmflag(&pm->op_pmflags,*s++);
6396 /* /c is not meaningful with s/// */
6397 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6399 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6404 PL_sublex_info.super_bufptr = s;
6405 PL_sublex_info.super_bufend = PL_bufend;
6407 pm->op_pmflags |= PMf_EVAL;
6408 repl = newSVpvn("",0);
6410 sv_catpv(repl, es ? "eval " : "do ");
6411 sv_catpvn(repl, "{ ", 2);
6412 sv_catsv(repl, PL_lex_repl);
6413 sv_catpvn(repl, " };", 2);
6415 SvREFCNT_dec(PL_lex_repl);
6419 pm->op_pmpermflags = pm->op_pmflags;
6420 PL_lex_op = (OP*)pm;
6421 yylval.ival = OP_SUBST;
6426 S_scan_trans(pTHX_ char *start)
6435 yylval.ival = OP_NULL;
6437 s = scan_str(start,FALSE,FALSE);
6439 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6440 if (s[-1] == PL_multi_open)
6443 s = scan_str(s,FALSE,FALSE);
6446 SvREFCNT_dec(PL_lex_stuff);
6447 PL_lex_stuff = Nullsv;
6449 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6452 complement = del = squash = 0;
6453 while (strchr("cds", *s)) {
6455 complement = OPpTRANS_COMPLEMENT;
6457 del = OPpTRANS_DELETE;
6459 squash = OPpTRANS_SQUASH;
6463 New(803, tbl, complement&&!del?258:256, short);
6464 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6465 o->op_private = del|squash|complement|
6466 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6467 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6470 yylval.ival = OP_TRANS;
6475 S_scan_heredoc(pTHX_ register char *s)
6478 I32 op_type = OP_SCALAR;
6485 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6489 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6492 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6493 if (*peek && strchr("`'\"",*peek)) {
6496 s = delimcpy(d, e, s, PL_bufend, term, &len);
6506 if (!isALNUM_lazy_if(s,UTF))
6507 deprecate_old("bare << to mean <<\"\"");
6508 for (; isALNUM_lazy_if(s,UTF); s++) {
6513 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6514 Perl_croak(aTHX_ "Delimiter for here document is too long");
6517 len = d - PL_tokenbuf;
6518 #ifndef PERL_STRICT_CR
6519 d = strchr(s, '\r');
6523 while (s < PL_bufend) {
6529 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6538 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6543 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6544 herewas = newSVpvn(s,PL_bufend-s);
6546 s--, herewas = newSVpvn(s,d-s);
6547 s += SvCUR(herewas);
6549 tmpstr = NEWSV(87,79);
6550 sv_upgrade(tmpstr, SVt_PVIV);
6555 else if (term == '`') {
6556 op_type = OP_BACKTICK;
6557 SvIVX(tmpstr) = '\\';
6561 PL_multi_start = CopLINE(PL_curcop);
6562 PL_multi_open = PL_multi_close = '<';
6563 term = *PL_tokenbuf;
6564 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6565 char *bufptr = PL_sublex_info.super_bufptr;
6566 char *bufend = PL_sublex_info.super_bufend;
6567 char *olds = s - SvCUR(herewas);
6568 s = strchr(bufptr, '\n');
6572 while (s < bufend &&
6573 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6575 CopLINE_inc(PL_curcop);
6578 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6579 missingterm(PL_tokenbuf);
6581 sv_setpvn(herewas,bufptr,d-bufptr+1);
6582 sv_setpvn(tmpstr,d+1,s-d);
6584 sv_catpvn(herewas,s,bufend-s);
6585 (void)strcpy(bufptr,SvPVX(herewas));
6592 while (s < PL_bufend &&
6593 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6595 CopLINE_inc(PL_curcop);
6597 if (s >= PL_bufend) {
6598 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6599 missingterm(PL_tokenbuf);
6601 sv_setpvn(tmpstr,d+1,s-d);
6603 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6605 sv_catpvn(herewas,s,PL_bufend-s);
6606 sv_setsv(PL_linestr,herewas);
6607 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6608 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6609 PL_last_lop = PL_last_uni = Nullch;
6612 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6613 while (s >= PL_bufend) { /* multiple line string? */
6615 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6616 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6617 missingterm(PL_tokenbuf);
6619 CopLINE_inc(PL_curcop);
6620 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6621 PL_last_lop = PL_last_uni = Nullch;
6622 #ifndef PERL_STRICT_CR
6623 if (PL_bufend - PL_linestart >= 2) {
6624 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6625 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6627 PL_bufend[-2] = '\n';
6629 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6631 else if (PL_bufend[-1] == '\r')
6632 PL_bufend[-1] = '\n';
6634 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6635 PL_bufend[-1] = '\n';
6637 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6638 SV *sv = NEWSV(88,0);
6640 sv_upgrade(sv, SVt_PVMG);
6641 sv_setsv(sv,PL_linestr);
6644 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6646 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6649 sv_catsv(PL_linestr,herewas);
6650 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6654 sv_catsv(tmpstr,PL_linestr);
6659 PL_multi_end = CopLINE(PL_curcop);
6660 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6661 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6662 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6664 SvREFCNT_dec(herewas);
6665 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6667 PL_lex_stuff = tmpstr;
6668 yylval.ival = op_type;
6673 takes: current position in input buffer
6674 returns: new position in input buffer
6675 side-effects: yylval and lex_op are set.
6680 <FH> read from filehandle
6681 <pkg::FH> read from package qualified filehandle
6682 <pkg'FH> read from package qualified filehandle
6683 <$fh> read from filehandle in $fh
6689 S_scan_inputsymbol(pTHX_ char *start)
6691 register char *s = start; /* current position in buffer */
6697 d = PL_tokenbuf; /* start of temp holding space */
6698 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6699 end = strchr(s, '\n');
6702 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6704 /* die if we didn't have space for the contents of the <>,
6705 or if it didn't end, or if we see a newline
6708 if (len >= sizeof PL_tokenbuf)
6709 Perl_croak(aTHX_ "Excessively long <> operator");
6711 Perl_croak(aTHX_ "Unterminated <> operator");
6716 Remember, only scalar variables are interpreted as filehandles by
6717 this code. Anything more complex (e.g., <$fh{$num}>) will be
6718 treated as a glob() call.
6719 This code makes use of the fact that except for the $ at the front,
6720 a scalar variable and a filehandle look the same.
6722 if (*d == '$' && d[1]) d++;
6724 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6725 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6728 /* If we've tried to read what we allow filehandles to look like, and
6729 there's still text left, then it must be a glob() and not a getline.
6730 Use scan_str to pull out the stuff between the <> and treat it
6731 as nothing more than a string.
6734 if (d - PL_tokenbuf != len) {
6735 yylval.ival = OP_GLOB;
6737 s = scan_str(start,FALSE,FALSE);
6739 Perl_croak(aTHX_ "Glob not terminated");
6743 bool readline_overriden = FALSE;
6744 GV *gv_readline = Nullgv;
6746 /* we're in a filehandle read situation */
6749 /* turn <> into <ARGV> */
6751 (void)strcpy(d,"ARGV");
6753 /* Check whether readline() is overriden */
6754 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6755 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6757 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6758 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6759 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6760 readline_overriden = TRUE;
6762 /* if <$fh>, create the ops to turn the variable into a
6768 /* try to find it in the pad for this block, otherwise find
6769 add symbol table ops
6771 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6772 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6773 SV *sym = sv_2mortal(
6774 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6775 sv_catpvn(sym, "::", 2);
6781 OP *o = newOP(OP_PADSV, 0);
6783 PL_lex_op = readline_overriden
6784 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6785 append_elem(OP_LIST, o,
6786 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6787 : (OP*)newUNOP(OP_READLINE, 0, o);
6796 ? (GV_ADDMULTI | GV_ADDINEVAL)
6799 PL_lex_op = readline_overriden
6800 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6801 append_elem(OP_LIST,
6802 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6803 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6804 : (OP*)newUNOP(OP_READLINE, 0,
6805 newUNOP(OP_RV2SV, 0,
6806 newGVOP(OP_GV, 0, gv)));
6808 if (!readline_overriden)
6809 PL_lex_op->op_flags |= OPf_SPECIAL;
6810 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6811 yylval.ival = OP_NULL;
6814 /* If it's none of the above, it must be a literal filehandle
6815 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6817 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6818 PL_lex_op = readline_overriden
6819 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6820 append_elem(OP_LIST,
6821 newGVOP(OP_GV, 0, gv),
6822 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6823 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6824 yylval.ival = OP_NULL;
6833 takes: start position in buffer
6834 keep_quoted preserve \ on the embedded delimiter(s)
6835 keep_delims preserve the delimiters around the string
6836 returns: position to continue reading from buffer
6837 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6838 updates the read buffer.
6840 This subroutine pulls a string out of the input. It is called for:
6841 q single quotes q(literal text)
6842 ' single quotes 'literal text'
6843 qq double quotes qq(interpolate $here please)
6844 " double quotes "interpolate $here please"
6845 qx backticks qx(/bin/ls -l)
6846 ` backticks `/bin/ls -l`
6847 qw quote words @EXPORT_OK = qw( func() $spam )
6848 m// regexp match m/this/
6849 s/// regexp substitute s/this/that/
6850 tr/// string transliterate tr/this/that/
6851 y/// string transliterate y/this/that/
6852 ($*@) sub prototypes sub foo ($)
6853 (stuff) sub attr parameters sub foo : attr(stuff)
6854 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6856 In most of these cases (all but <>, patterns and transliterate)
6857 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6858 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6859 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6862 It skips whitespace before the string starts, and treats the first
6863 character as the delimiter. If the delimiter is one of ([{< then
6864 the corresponding "close" character )]}> is used as the closing
6865 delimiter. It allows quoting of delimiters, and if the string has
6866 balanced delimiters ([{<>}]) it allows nesting.
6868 On success, the SV with the resulting string is put into lex_stuff or,
6869 if that is already non-NULL, into lex_repl. The second case occurs only
6870 when parsing the RHS of the special constructs s/// and tr/// (y///).
6871 For convenience, the terminating delimiter character is stuffed into
6876 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6878 SV *sv; /* scalar value: string */
6879 char *tmps; /* temp string, used for delimiter matching */
6880 register char *s = start; /* current position in the buffer */
6881 register char term; /* terminating character */
6882 register char *to; /* current position in the sv's data */
6883 I32 brackets = 1; /* bracket nesting level */
6884 bool has_utf8 = FALSE; /* is there any utf8 content? */
6885 I32 termcode; /* terminating char. code */
6886 U8 termstr[UTF8_MAXLEN]; /* terminating string */
6887 STRLEN termlen; /* length of terminating string */
6888 char *last = NULL; /* last position for nesting bracket */
6890 /* skip space before the delimiter */
6894 /* mark where we are, in case we need to report errors */
6897 /* after skipping whitespace, the next character is the terminator */
6900 termcode = termstr[0] = term;
6904 termcode = utf8_to_uvchr((U8*)s, &termlen);
6905 Copy(s, termstr, termlen, U8);
6906 if (!UTF8_IS_INVARIANT(term))
6910 /* mark where we are */
6911 PL_multi_start = CopLINE(PL_curcop);
6912 PL_multi_open = term;
6914 /* find corresponding closing delimiter */
6915 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6916 termcode = termstr[0] = term = tmps[5];
6918 PL_multi_close = term;
6920 /* create a new SV to hold the contents. 87 is leak category, I'm
6921 assuming. 79 is the SV's initial length. What a random number. */
6923 sv_upgrade(sv, SVt_PVIV);
6924 SvIVX(sv) = termcode;
6925 (void)SvPOK_only(sv); /* validate pointer */
6927 /* move past delimiter and try to read a complete string */
6929 sv_catpvn(sv, s, termlen);
6932 if (PL_encoding && !UTF) {
6936 int offset = s - SvPVX(PL_linestr);
6937 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
6938 &offset, (char*)termstr, termlen);
6939 char *ns = SvPVX(PL_linestr) + offset;
6940 char *svlast = SvEND(sv) - 1;
6942 for (; s < ns; s++) {
6943 if (*s == '\n' && !PL_rsfp)
6944 CopLINE_inc(PL_curcop);
6947 goto read_more_line;
6949 /* handle quoted delimiters */
6950 if (*(svlast-1) == '\\') {
6952 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
6954 if ((svlast-1 - t) % 2) {
6958 SvCUR_set(sv, SvCUR(sv) - 1);
6963 if (PL_multi_open == PL_multi_close) {
6970 for (w = t = last; t < svlast; w++, t++) {
6971 /* At here, all closes are "was quoted" one,
6972 so we don't check PL_multi_close. */
6974 if (!keep_quoted && *(t+1) == PL_multi_open)
6979 else if (*t == PL_multi_open)
6987 SvCUR_set(sv, w - SvPVX(sv));
6990 if (--brackets <= 0)
6996 SvCUR_set(sv, SvCUR(sv) - 1);
7002 /* extend sv if need be */
7003 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7004 /* set 'to' to the next character in the sv's string */
7005 to = SvPVX(sv)+SvCUR(sv);
7007 /* if open delimiter is the close delimiter read unbridle */
7008 if (PL_multi_open == PL_multi_close) {
7009 for (; s < PL_bufend; s++,to++) {
7010 /* embedded newlines increment the current line number */
7011 if (*s == '\n' && !PL_rsfp)
7012 CopLINE_inc(PL_curcop);
7013 /* handle quoted delimiters */
7014 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7015 if (!keep_quoted && s[1] == term)
7017 /* any other quotes are simply copied straight through */
7021 /* terminate when run out of buffer (the for() condition), or
7022 have found the terminator */
7023 else if (*s == term) {
7026 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7029 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7035 /* if the terminator isn't the same as the start character (e.g.,
7036 matched brackets), we have to allow more in the quoting, and
7037 be prepared for nested brackets.
7040 /* read until we run out of string, or we find the terminator */
7041 for (; s < PL_bufend; s++,to++) {
7042 /* embedded newlines increment the line count */
7043 if (*s == '\n' && !PL_rsfp)
7044 CopLINE_inc(PL_curcop);
7045 /* backslashes can escape the open or closing characters */
7046 if (*s == '\\' && s+1 < PL_bufend) {
7048 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7053 /* allow nested opens and closes */
7054 else if (*s == PL_multi_close && --brackets <= 0)
7056 else if (*s == PL_multi_open)
7058 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7063 /* terminate the copied string and update the sv's end-of-string */
7065 SvCUR_set(sv, to - SvPVX(sv));
7068 * this next chunk reads more into the buffer if we're not done yet
7072 break; /* handle case where we are done yet :-) */
7074 #ifndef PERL_STRICT_CR
7075 if (to - SvPVX(sv) >= 2) {
7076 if ((to[-2] == '\r' && to[-1] == '\n') ||
7077 (to[-2] == '\n' && to[-1] == '\r'))
7081 SvCUR_set(sv, to - SvPVX(sv));
7083 else if (to[-1] == '\r')
7086 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7091 /* if we're out of file, or a read fails, bail and reset the current
7092 line marker so we can report where the unterminated string began
7095 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7097 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7100 /* we read a line, so increment our line counter */
7101 CopLINE_inc(PL_curcop);
7103 /* update debugger info */
7104 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7105 SV *sv = NEWSV(88,0);
7107 sv_upgrade(sv, SVt_PVMG);
7108 sv_setsv(sv,PL_linestr);
7111 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7114 /* having changed the buffer, we must update PL_bufend */
7115 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7116 PL_last_lop = PL_last_uni = Nullch;
7119 /* at this point, we have successfully read the delimited string */
7121 if (!PL_encoding || UTF) {
7123 sv_catpvn(sv, s, termlen);
7126 if (has_utf8 || PL_encoding)
7129 PL_multi_end = CopLINE(PL_curcop);
7131 /* if we allocated too much space, give some back */
7132 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7133 SvLEN_set(sv, SvCUR(sv) + 1);
7134 Renew(SvPVX(sv), SvLEN(sv), char);
7137 /* decide whether this is the first or second quoted string we've read
7150 takes: pointer to position in buffer
7151 returns: pointer to new position in buffer
7152 side-effects: builds ops for the constant in yylval.op
7154 Read a number in any of the formats that Perl accepts:
7156 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7157 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7160 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7162 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7165 If it reads a number without a decimal point or an exponent, it will
7166 try converting the number to an integer and see if it can do so
7167 without loss of precision.
7171 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7173 register char *s = start; /* current position in buffer */
7174 register char *d; /* destination in temp buffer */
7175 register char *e; /* end of temp buffer */
7176 NV nv; /* number read, as a double */
7177 SV *sv = Nullsv; /* place to put the converted number */
7178 bool floatit; /* boolean: int or float? */
7179 char *lastub = 0; /* position of last underbar */
7180 static char number_too_long[] = "Number too long";
7182 /* We use the first character to decide what type of number this is */
7186 Perl_croak(aTHX_ "panic: scan_num");
7188 /* if it starts with a 0, it could be an octal number, a decimal in
7189 0.13 disguise, or a hexadecimal number, or a binary number. */
7193 u holds the "number so far"
7194 shift the power of 2 of the base
7195 (hex == 4, octal == 3, binary == 1)
7196 overflowed was the number more than we can hold?
7198 Shift is used when we add a digit. It also serves as an "are
7199 we in octal/hex/binary?" indicator to disallow hex characters
7205 bool overflowed = FALSE;
7206 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7207 static char* bases[5] = { "", "binary", "", "octal",
7209 static char* Bases[5] = { "", "Binary", "", "Octal",
7211 static char *maxima[5] = { "",
7212 "0b11111111111111111111111111111111",
7216 char *base, *Base, *max;
7222 } else if (s[1] == 'b') {
7226 /* check for a decimal in disguise */
7227 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7229 /* so it must be octal */
7236 if (ckWARN(WARN_SYNTAX))
7237 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7238 "Misplaced _ in number");
7242 base = bases[shift];
7243 Base = Bases[shift];
7244 max = maxima[shift];
7246 /* read the rest of the number */
7248 /* x is used in the overflow test,
7249 b is the digit we're adding on. */
7254 /* if we don't mention it, we're done */
7258 /* _ are ignored -- but warned about if consecutive */
7260 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7261 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7262 "Misplaced _ in number");
7266 /* 8 and 9 are not octal */
7269 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7273 case '2': case '3': case '4':
7274 case '5': case '6': case '7':
7276 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7280 b = *s++ & 15; /* ASCII digit -> value of digit */
7284 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7285 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7286 /* make sure they said 0x */
7291 /* Prepare to put the digit we have onto the end
7292 of the number so far. We check for overflows.
7297 x = u << shift; /* make room for the digit */
7299 if ((x >> shift) != u
7300 && !(PL_hints & HINT_NEW_BINARY)) {
7303 if (ckWARN_d(WARN_OVERFLOW))
7304 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7305 "Integer overflow in %s number",
7308 u = x | b; /* add the digit to the end */
7311 n *= nvshift[shift];
7312 /* If an NV has not enough bits in its
7313 * mantissa to represent an UV this summing of
7314 * small low-order numbers is a waste of time
7315 * (because the NV cannot preserve the
7316 * low-order bits anyway): we could just
7317 * remember when did we overflow and in the
7318 * end just multiply n by the right
7326 /* if we get here, we had success: make a scalar value from
7331 /* final misplaced underbar check */
7333 if (ckWARN(WARN_SYNTAX))
7334 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7339 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7340 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7341 "%s number > %s non-portable",
7347 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7348 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7349 "%s number > %s non-portable",
7354 if (PL_hints & HINT_NEW_BINARY)
7355 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7360 handle decimal numbers.
7361 we're also sent here when we read a 0 as the first digit
7363 case '1': case '2': case '3': case '4': case '5':
7364 case '6': case '7': case '8': case '9': case '.':
7367 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7370 /* read next group of digits and _ and copy into d */
7371 while (isDIGIT(*s) || *s == '_') {
7372 /* skip underscores, checking for misplaced ones
7376 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7377 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7378 "Misplaced _ in number");
7382 /* check for end of fixed-length buffer */
7384 Perl_croak(aTHX_ number_too_long);
7385 /* if we're ok, copy the character */
7390 /* final misplaced underbar check */
7391 if (lastub && s == lastub + 1) {
7392 if (ckWARN(WARN_SYNTAX))
7393 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7396 /* read a decimal portion if there is one. avoid
7397 3..5 being interpreted as the number 3. followed
7400 if (*s == '.' && s[1] != '.') {
7405 if (ckWARN(WARN_SYNTAX))
7406 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7407 "Misplaced _ in number");
7411 /* copy, ignoring underbars, until we run out of digits.
7413 for (; isDIGIT(*s) || *s == '_'; s++) {
7414 /* fixed length buffer check */
7416 Perl_croak(aTHX_ number_too_long);
7418 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7419 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7420 "Misplaced _ in number");
7426 /* fractional part ending in underbar? */
7428 if (ckWARN(WARN_SYNTAX))
7429 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7430 "Misplaced _ in number");
7432 if (*s == '.' && isDIGIT(s[1])) {
7433 /* oops, it's really a v-string, but without the "v" */
7439 /* read exponent part, if present */
7440 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7444 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7445 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7447 /* stray preinitial _ */
7449 if (ckWARN(WARN_SYNTAX))
7450 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7451 "Misplaced _ in number");
7455 /* allow positive or negative exponent */
7456 if (*s == '+' || *s == '-')
7459 /* stray initial _ */
7461 if (ckWARN(WARN_SYNTAX))
7462 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7463 "Misplaced _ in number");
7467 /* read digits of exponent */
7468 while (isDIGIT(*s) || *s == '_') {
7471 Perl_croak(aTHX_ number_too_long);
7475 if (ckWARN(WARN_SYNTAX) &&
7476 ((lastub && s == lastub + 1) ||
7477 (!isDIGIT(s[1]) && s[1] != '_')))
7478 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7479 "Misplaced _ in number");
7486 /* make an sv from the string */
7490 We try to do an integer conversion first if no characters
7491 indicating "float" have been found.
7496 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7498 if (flags == IS_NUMBER_IN_UV) {
7500 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7503 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7504 if (uv <= (UV) IV_MIN)
7505 sv_setiv(sv, -(IV)uv);
7512 /* terminate the string */
7514 nv = Atof(PL_tokenbuf);
7518 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7519 (PL_hints & HINT_NEW_INTEGER) )
7520 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7521 (floatit ? "float" : "integer"),
7525 /* if it starts with a v, it could be a v-string */
7528 sv = NEWSV(92,5); /* preallocate storage space */
7529 s = scan_vstring(s,sv);
7533 /* make the op for the constant and return */
7536 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7538 lvalp->opval = Nullop;
7544 S_scan_formline(pTHX_ register char *s)
7548 SV *stuff = newSVpvn("",0);
7549 bool needargs = FALSE;
7552 if (*s == '.' || *s == /*{*/'}') {
7554 #ifdef PERL_STRICT_CR
7555 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7557 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7559 if (*t == '\n' || t == PL_bufend)
7562 if (PL_in_eval && !PL_rsfp) {
7563 eol = strchr(s,'\n');
7568 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7570 for (t = s; t < eol; t++) {
7571 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7573 goto enough; /* ~~ must be first line in formline */
7575 if (*t == '@' || *t == '^')
7579 sv_catpvn(stuff, s, eol-s);
7580 #ifndef PERL_STRICT_CR
7581 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7582 char *end = SvPVX(stuff) + SvCUR(stuff);
7594 s = filter_gets(PL_linestr, PL_rsfp, 0);
7595 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7596 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7597 PL_last_lop = PL_last_uni = Nullch;
7600 yyerror("Format not terminated");
7610 PL_lex_state = LEX_NORMAL;
7611 PL_nextval[PL_nexttoke].ival = 0;
7615 PL_lex_state = LEX_FORMLINE;
7616 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7618 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7622 SvREFCNT_dec(stuff);
7623 PL_lex_formbrack = 0;
7634 PL_cshlen = strlen(PL_cshname);
7639 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7641 I32 oldsavestack_ix = PL_savestack_ix;
7642 CV* outsidecv = PL_compcv;
7645 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7647 SAVEI32(PL_subline);
7648 save_item(PL_subname);
7649 SAVESPTR(PL_compcv);
7651 PL_compcv = (CV*)NEWSV(1104,0);
7652 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7653 CvFLAGS(PL_compcv) |= flags;
7655 PL_subline = CopLINE(PL_curcop);
7656 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7657 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7658 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7660 return oldsavestack_ix;
7664 #pragma segment Perl_yylex
7667 Perl_yywarn(pTHX_ char *s)
7669 PL_in_eval |= EVAL_WARNONLY;
7671 PL_in_eval &= ~EVAL_WARNONLY;
7676 Perl_yyerror(pTHX_ char *s)
7679 char *context = NULL;
7683 if (!yychar || (yychar == ';' && !PL_rsfp))
7685 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7686 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7689 The code below is removed for NetWare because it abends/crashes on NetWare
7690 when the script has error such as not having the closing quotes like:
7692 Checking of white spaces is anyway done in NetWare code.
7695 while (isSPACE(*PL_oldoldbufptr))
7698 context = PL_oldoldbufptr;
7699 contlen = PL_bufptr - PL_oldoldbufptr;
7701 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7702 PL_oldbufptr != PL_bufptr) {
7705 The code below is removed for NetWare because it abends/crashes on NetWare
7706 when the script has error such as not having the closing quotes like:
7708 Checking of white spaces is anyway done in NetWare code.
7711 while (isSPACE(*PL_oldbufptr))
7714 context = PL_oldbufptr;
7715 contlen = PL_bufptr - PL_oldbufptr;
7717 else if (yychar > 255)
7718 where = "next token ???";
7719 #ifdef USE_PURE_BISON
7720 /* GNU Bison sets the value -2 */
7721 else if (yychar == -2) {
7723 else if ((yychar & 127) == 127) {
7725 if (PL_lex_state == LEX_NORMAL ||
7726 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7727 where = "at end of line";
7728 else if (PL_lex_inpat)
7729 where = "within pattern";
7731 where = "within string";
7734 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7736 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7737 else if (isPRINT_LC(yychar))
7738 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7740 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7741 where = SvPVX(where_sv);
7743 msg = sv_2mortal(newSVpv(s, 0));
7744 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7745 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7747 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7749 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7750 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7751 Perl_sv_catpvf(aTHX_ msg,
7752 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7753 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7756 if (PL_in_eval & EVAL_WARNONLY)
7757 Perl_warn(aTHX_ "%"SVf, msg);
7760 if (PL_error_count >= 10) {
7761 if (PL_in_eval && SvCUR(ERRSV))
7762 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7763 ERRSV, OutCopFILE(PL_curcop));
7765 Perl_croak(aTHX_ "%s has too many errors.\n",
7766 OutCopFILE(PL_curcop));
7769 PL_in_my_stash = Nullhv;
7773 #pragma segment Main
7777 S_swallow_bom(pTHX_ U8 *s)
7780 slen = SvCUR(PL_linestr);
7784 /* UTF-16 little-endian */
7785 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7786 Perl_croak(aTHX_ "Unsupported script encoding");
7787 #ifndef PERL_NO_UTF16_FILTER
7788 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7790 if (PL_bufend > (char*)s) {
7794 filter_add(utf16rev_textfilter, NULL);
7795 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7796 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7797 PL_bufend - (char*)s - 1,
7799 Copy(news, s, newlen, U8);
7800 SvCUR_set(PL_linestr, newlen);
7801 PL_bufend = SvPVX(PL_linestr) + newlen;
7802 news[newlen++] = '\0';
7806 Perl_croak(aTHX_ "Unsupported script encoding");
7811 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7812 #ifndef PERL_NO_UTF16_FILTER
7813 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7815 if (PL_bufend > (char *)s) {
7819 filter_add(utf16_textfilter, NULL);
7820 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7821 PL_bufend = (char*)utf16_to_utf8(s, news,
7822 PL_bufend - (char*)s,
7824 Copy(news, s, newlen, U8);
7825 SvCUR_set(PL_linestr, newlen);
7826 PL_bufend = SvPVX(PL_linestr) + newlen;
7827 news[newlen++] = '\0';
7831 Perl_croak(aTHX_ "Unsupported script encoding");
7836 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7837 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7842 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7843 s[2] == 0xFE && s[3] == 0xFF)
7845 Perl_croak(aTHX_ "Unsupported script encoding");
7853 * Restore a source filter.
7857 restore_rsfp(pTHX_ void *f)
7859 PerlIO *fp = (PerlIO*)f;
7861 if (PL_rsfp == PerlIO_stdin())
7862 PerlIO_clearerr(PL_rsfp);
7863 else if (PL_rsfp && (PL_rsfp != fp))
7864 PerlIO_close(PL_rsfp);
7868 #ifndef PERL_NO_UTF16_FILTER
7870 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7872 I32 count = FILTER_READ(idx+1, sv, maxlen);
7877 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7878 if (!*SvPV_nolen(sv))
7879 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7882 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7883 sv_usepvn(sv, (char*)tmps, tend - tmps);
7889 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7891 I32 count = FILTER_READ(idx+1, sv, maxlen);
7896 if (!*SvPV_nolen(sv))
7897 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7900 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7901 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7902 sv_usepvn(sv, (char*)tmps, tend - tmps);