3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "It all comes from here, the stench and the peril." --Frodo
16 * This file is the lexer for Perl. It's closely linked to the
19 * The main routine is yylex(), which returns the next token.
23 #define PERL_IN_TOKE_C
26 #define yychar (*PL_yycharp)
27 #define yylval (*PL_yylvalp)
29 static char ident_too_long[] = "Identifier too long";
30 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
31 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
33 static void restore_rsfp(pTHX_ void *f);
34 #ifndef PERL_NO_UTF16_FILTER
35 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
36 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
39 #define XFAKEBRACK 128
42 #ifdef USE_UTF8_SCRIPTS
43 # define UTF (!IN_BYTES)
45 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
48 /* In variables named $^X, these are the legal values for X.
49 * 1999-02-27 mjd-perl-patch@plover.com */
50 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
52 /* On MacOS, respect nonbreaking spaces */
53 #ifdef MACOS_TRADITIONAL
54 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
56 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
59 /* LEX_* are values for PL_lex_state, the state of the lexer.
60 * They are arranged oddly so that the guard on the switch statement
61 * can get by with a single comparison (if the compiler is smart enough).
64 /* #define LEX_NOTPARSING 11 is done in perl.h. */
67 #define LEX_INTERPNORMAL 9
68 #define LEX_INTERPCASEMOD 8
69 #define LEX_INTERPPUSH 7
70 #define LEX_INTERPSTART 6
71 #define LEX_INTERPEND 5
72 #define LEX_INTERPENDMAYBE 4
73 #define LEX_INTERPCONCAT 3
74 #define LEX_INTERPCONST 2
75 #define LEX_FORMLINE 1
76 #define LEX_KNOWNEXT 0
84 /* CLINE is a macro that ensures PL_copline has a sane value */
89 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
92 * Convenience functions to return different tokens and prime the
93 * lexer for the next token. They all take an argument.
95 * TOKEN : generic token (used for '(', DOLSHARP, etc)
96 * OPERATOR : generic operator
97 * AOPERATOR : assignment operator
98 * PREBLOCK : beginning the block after an if, while, foreach, ...
99 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
100 * PREREF : *EXPR where EXPR is not a simple identifier
101 * TERM : expression term
102 * LOOPX : loop exiting command (goto, last, dump, etc)
103 * FTST : file test operator
104 * FUN0 : zero-argument function
105 * FUN1 : not used, except for not, which isn't a UNIOP
106 * BOop : bitwise or or xor
108 * SHop : shift operator
109 * PWop : power operator
110 * PMop : pattern-matching operator
111 * Aop : addition-level operator
112 * Mop : multiplication-level operator
113 * Eop : equality-testing operator
114 * Rop : relational operator <= != gt
116 * Also see LOP and lop() below.
119 /* Note that REPORT() and REPORT2() will be expressions that supply
120 * their own trailing comma, not suitable for statements as such. */
121 #ifdef DEBUGGING /* Serve -DT. */
122 # define REPORT(x,retval) tokereport(x,s,(int)retval),
123 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
125 # define REPORT(x,retval)
126 # define REPORT2(x,retval)
129 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
130 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
131 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
132 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
133 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
134 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
135 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
136 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
137 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
138 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
139 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
140 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
141 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
142 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
143 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
144 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
145 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
146 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
147 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
148 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
150 /* This bit of chicanery makes a unary function followed by
151 * a parenthesis into a function with one argument, highest precedence.
152 * The UNIDOR macro is for unary functions that can be followed by the //
153 * operator (such as C<shift // 0>).
155 #define UNI2(f,x) return(yylval.ival = f, \
159 PL_last_uni = PL_oldbufptr, \
160 PL_last_lop_op = f, \
161 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
162 #define UNI(f) UNI2(f,XTERM)
163 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
165 #define UNIBRACK(f) return(yylval.ival = f, \
168 PL_last_uni = PL_oldbufptr, \
169 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
171 /* grandfather return to old style */
172 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
177 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
180 SV* report = newSVpv(thing, 0);
181 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
184 if (s - PL_bufptr > 0)
185 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
187 if (PL_oldbufptr && *PL_oldbufptr)
188 sv_catpv(report, PL_tokenbuf);
190 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
199 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
200 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
204 S_ao(pTHX_ int toketype)
206 if (*PL_bufptr == '=') {
208 if (toketype == ANDAND)
209 yylval.ival = OP_ANDASSIGN;
210 else if (toketype == OROR)
211 yylval.ival = OP_ORASSIGN;
212 else if (toketype == DORDOR)
213 yylval.ival = OP_DORASSIGN;
221 * When Perl expects an operator and finds something else, no_op
222 * prints the warning. It always prints "<something> found where
223 * operator expected. It prints "Missing semicolon on previous line?"
224 * if the surprise occurs at the start of the line. "do you need to
225 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
226 * where the compiler doesn't know if foo is a method call or a function.
227 * It prints "Missing operator before end of line" if there's nothing
228 * after the missing operator, or "... before <...>" if there is something
229 * after the missing operator.
233 S_no_op(pTHX_ char *what, char *s)
235 char *oldbp = PL_bufptr;
236 bool is_first = (PL_oldbufptr == PL_linestart);
242 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
243 if (ckWARN_d(WARN_SYNTAX)) {
245 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
246 "\t(Missing semicolon on previous line?)\n");
247 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
249 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
250 if (t < PL_bufptr && isSPACE(*t))
251 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
252 "\t(Do you need to predeclare %.*s?)\n",
253 t - PL_oldoldbufptr, PL_oldoldbufptr);
257 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
258 "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
266 * Complain about missing quote/regexp/heredoc terminator.
267 * If it's called with (char *)NULL then it cauterizes the line buffer.
268 * If we're in a delimited string and the delimiter is a control
269 * character, it's reformatted into a two-char sequence like ^C.
274 S_missingterm(pTHX_ char *s)
279 char *nl = strrchr(s,'\n');
285 iscntrl(PL_multi_close)
287 PL_multi_close < 32 || PL_multi_close == 127
291 tmpbuf[1] = toCTRL(PL_multi_close);
297 *tmpbuf = (char)PL_multi_close;
301 q = strchr(s,'"') ? '\'' : '"';
302 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
310 Perl_deprecate(pTHX_ char *s)
312 if (ckWARN(WARN_DEPRECATED))
313 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
317 Perl_deprecate_old(pTHX_ char *s)
319 /* This function should NOT be called for any new deprecated warnings */
320 /* Use Perl_deprecate instead */
322 /* It is here to maintain backward compatibility with the pre-5.8 */
323 /* warnings category hierarchy. The "deprecated" category used to */
324 /* live under the "syntax" category. It is now a top-level category */
325 /* in its own right. */
327 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
328 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
329 "Use of %s is deprecated", s);
334 * Deprecate a comma-less variable list.
340 deprecate_old("comma-less variable list");
344 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
345 * utf16-to-utf8-reversed.
348 #ifdef PERL_CR_FILTER
352 register char *s = SvPVX(sv);
353 register char *e = s + SvCUR(sv);
354 /* outer loop optimized to do nothing if there are no CR-LFs */
356 if (*s++ == '\r' && *s == '\n') {
357 /* hit a CR-LF, need to copy the rest */
358 register char *d = s - 1;
361 if (*s == '\r' && s[1] == '\n')
372 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
374 I32 count = FILTER_READ(idx+1, sv, maxlen);
375 if (count > 0 && !maxlen)
383 * Initialize variables. Uses the Perl save_stack to save its state (for
384 * recursive calls to the parser).
388 Perl_lex_start(pTHX_ SV *line)
393 SAVEI32(PL_lex_dojoin);
394 SAVEI32(PL_lex_brackets);
395 SAVEI32(PL_lex_casemods);
396 SAVEI32(PL_lex_starts);
397 SAVEI32(PL_lex_state);
398 SAVEVPTR(PL_lex_inpat);
399 SAVEI32(PL_lex_inwhat);
400 if (PL_lex_state == LEX_KNOWNEXT) {
401 I32 toke = PL_nexttoke;
402 while (--toke >= 0) {
403 SAVEI32(PL_nexttype[toke]);
404 SAVEVPTR(PL_nextval[toke]);
406 SAVEI32(PL_nexttoke);
408 SAVECOPLINE(PL_curcop);
411 SAVEPPTR(PL_oldbufptr);
412 SAVEPPTR(PL_oldoldbufptr);
413 SAVEPPTR(PL_last_lop);
414 SAVEPPTR(PL_last_uni);
415 SAVEPPTR(PL_linestart);
416 SAVESPTR(PL_linestr);
417 SAVEGENERICPV(PL_lex_brackstack);
418 SAVEGENERICPV(PL_lex_casestack);
419 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
420 SAVESPTR(PL_lex_stuff);
421 SAVEI32(PL_lex_defer);
422 SAVEI32(PL_sublex_info.sub_inwhat);
423 SAVESPTR(PL_lex_repl);
425 SAVEINT(PL_lex_expect);
427 PL_lex_state = LEX_NORMAL;
431 New(899, PL_lex_brackstack, 120, char);
432 New(899, PL_lex_casestack, 12, char);
434 *PL_lex_casestack = '\0';
437 PL_lex_stuff = Nullsv;
438 PL_lex_repl = Nullsv;
442 PL_sublex_info.sub_inwhat = 0;
444 if (SvREADONLY(PL_linestr))
445 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
446 s = SvPV(PL_linestr, len);
447 if (!len || s[len-1] != ';') {
448 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
449 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
450 sv_catpvn(PL_linestr, "\n;", 2);
452 SvTEMP_off(PL_linestr);
453 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
454 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
455 PL_last_lop = PL_last_uni = Nullch;
461 * Finalizer for lexing operations. Must be called when the parser is
462 * done with the lexer.
468 PL_doextract = FALSE;
473 * This subroutine has nothing to do with tilting, whether at windmills
474 * or pinball tables. Its name is short for "increment line". It
475 * increments the current line number in CopLINE(PL_curcop) and checks
476 * to see whether the line starts with a comment of the form
477 * # line 500 "foo.pm"
478 * If so, it sets the current line number and file to the values in the comment.
482 S_incline(pTHX_ char *s)
489 CopLINE_inc(PL_curcop);
492 while (SPACE_OR_TAB(*s)) s++;
493 if (strnEQ(s, "line", 4))
497 if (SPACE_OR_TAB(*s))
501 while (SPACE_OR_TAB(*s)) s++;
507 while (SPACE_OR_TAB(*s))
509 if (*s == '"' && (t = strchr(s+1, '"'))) {
514 for (t = s; !isSPACE(*t); t++) ;
517 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
519 if (*e != '\n' && *e != '\0')
520 return; /* false alarm */
525 CopFILE_free(PL_curcop);
526 CopFILE_set(PL_curcop, s);
529 CopLINE_set(PL_curcop, atoi(n)-1);
534 * Called to gobble the appropriate amount and type of whitespace.
535 * Skips comments as well.
539 S_skipspace(pTHX_ register char *s)
541 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
542 while (s < PL_bufend && SPACE_OR_TAB(*s))
548 SSize_t oldprevlen, oldoldprevlen;
549 SSize_t oldloplen = 0, oldunilen = 0;
550 while (s < PL_bufend && isSPACE(*s)) {
551 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
556 if (s < PL_bufend && *s == '#') {
557 while (s < PL_bufend && *s != '\n')
561 if (PL_in_eval && !PL_rsfp) {
568 /* only continue to recharge the buffer if we're at the end
569 * of the buffer, we're not reading from a source filter, and
570 * we're in normal lexing mode
572 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
573 PL_lex_state == LEX_FORMLINE)
576 /* try to recharge the buffer */
577 if ((s = filter_gets(PL_linestr, PL_rsfp,
578 (prevlen = SvCUR(PL_linestr)))) == Nullch)
580 /* end of file. Add on the -p or -n magic */
581 if (PL_minus_n || PL_minus_p) {
582 sv_setpv(PL_linestr,PL_minus_p ?
583 ";}continue{print or die qq(-p destination: $!\\n)" :
585 sv_catpv(PL_linestr,";}");
586 PL_minus_n = PL_minus_p = 0;
589 sv_setpv(PL_linestr,";");
591 /* reset variables for next time we lex */
592 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
594 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
595 PL_last_lop = PL_last_uni = Nullch;
597 /* Close the filehandle. Could be from -P preprocessor,
598 * STDIN, or a regular file. If we were reading code from
599 * STDIN (because the commandline held no -e or filename)
600 * then we don't close it, we reset it so the code can
601 * read from STDIN too.
604 if (PL_preprocess && !PL_in_eval)
605 (void)PerlProc_pclose(PL_rsfp);
606 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
607 PerlIO_clearerr(PL_rsfp);
609 (void)PerlIO_close(PL_rsfp);
614 /* not at end of file, so we only read another line */
615 /* make corresponding updates to old pointers, for yyerror() */
616 oldprevlen = PL_oldbufptr - PL_bufend;
617 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
619 oldunilen = PL_last_uni - PL_bufend;
621 oldloplen = PL_last_lop - PL_bufend;
622 PL_linestart = PL_bufptr = s + prevlen;
623 PL_bufend = s + SvCUR(PL_linestr);
625 PL_oldbufptr = s + oldprevlen;
626 PL_oldoldbufptr = s + oldoldprevlen;
628 PL_last_uni = s + oldunilen;
630 PL_last_lop = s + oldloplen;
633 /* debugger active and we're not compiling the debugger code,
634 * so store the line into the debugger's array of lines
636 if (PERLDB_LINE && PL_curstash != PL_debstash) {
637 SV *sv = NEWSV(85,0);
639 sv_upgrade(sv, SVt_PVMG);
640 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
643 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
650 * Check the unary operators to ensure there's no ambiguity in how they're
651 * used. An ambiguous piece of code would be:
653 * This doesn't mean rand() + 5. Because rand() is a unary operator,
654 * the +5 is its argument.
663 if (PL_oldoldbufptr != PL_last_uni)
665 while (isSPACE(*PL_last_uni))
667 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
668 if ((t = strchr(s, '(')) && t < PL_bufptr)
670 if (ckWARN_d(WARN_AMBIGUOUS)){
673 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
674 "Warning: Use of \"%s\" without parentheses is ambiguous",
681 * LOP : macro to build a list operator. Its behaviour has been replaced
682 * with a subroutine, S_lop() for which LOP is just another name.
685 #define LOP(f,x) return lop(f,x,s)
689 * Build a list operator (or something that might be one). The rules:
690 * - if we have a next token, then it's a list operator [why?]
691 * - if the next thing is an opening paren, then it's a function
692 * - else it's a list operator
696 S_lop(pTHX_ I32 f, int x, char *s)
703 PL_last_lop = PL_oldbufptr;
704 PL_last_lop_op = (OPCODE)f;
718 * When the lexer realizes it knows the next token (for instance,
719 * it is reordering tokens for the parser) then it can call S_force_next
720 * to know what token to return the next time the lexer is called. Caller
721 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
722 * handles the token correctly.
726 S_force_next(pTHX_ I32 type)
728 PL_nexttype[PL_nexttoke] = type;
730 if (PL_lex_state != LEX_KNOWNEXT) {
731 PL_lex_defer = PL_lex_state;
732 PL_lex_expect = PL_expect;
733 PL_lex_state = LEX_KNOWNEXT;
739 * When the lexer knows the next thing is a word (for instance, it has
740 * just seen -> and it knows that the next char is a word char, then
741 * it calls S_force_word to stick the next word into the PL_next lookahead.
744 * char *start : buffer position (must be within PL_linestr)
745 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
746 * int check_keyword : if true, Perl checks to make sure the word isn't
747 * a keyword (do this if the word is a label, e.g. goto FOO)
748 * int allow_pack : if true, : characters will also be allowed (require,
750 * int allow_initial_tick : used by the "sub" lexer only.
754 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
759 start = skipspace(start);
761 if (isIDFIRST_lazy_if(s,UTF) ||
762 (allow_pack && *s == ':') ||
763 (allow_initial_tick && *s == '\'') )
765 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
766 if (check_keyword && keyword(PL_tokenbuf, len))
768 if (token == METHOD) {
773 PL_expect = XOPERATOR;
776 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
777 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
778 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
779 SvUTF8_on(((SVOP*)PL_nextval[PL_nexttoke].opval)->op_sv);
787 * Called when the lexer wants $foo *foo &foo etc, but the program
788 * text only contains the "foo" portion. The first argument is a pointer
789 * to the "foo", and the second argument is the type symbol to prefix.
790 * Forces the next token to be a "WORD".
791 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
795 S_force_ident(pTHX_ register char *s, int kind)
798 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
799 PL_nextval[PL_nexttoke].opval = o;
802 o->op_private = OPpCONST_ENTERED;
803 /* XXX see note in pp_entereval() for why we forgo typo
804 warnings if the symbol must be introduced in an eval.
806 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
807 kind == '$' ? SVt_PV :
808 kind == '@' ? SVt_PVAV :
809 kind == '%' ? SVt_PVHV :
817 Perl_str_to_version(pTHX_ SV *sv)
822 char *start = SvPVx(sv,len);
823 bool utf = SvUTF8(sv) ? TRUE : FALSE;
824 char *end = start + len;
825 while (start < end) {
829 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
834 retval += ((NV)n)/nshift;
843 * Forces the next token to be a version number.
844 * If the next token appears to be an invalid version number, (e.g. "v2b"),
845 * and if "guessing" is TRUE, then no new token is created (and the caller
846 * must use an alternative parsing method).
850 S_force_version(pTHX_ char *s, int guessing)
852 OP *version = Nullop;
861 while (isDIGIT(*d) || *d == '_' || *d == '.')
863 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
865 s = scan_num(s, &yylval);
866 version = yylval.opval;
867 ver = cSVOPx(version)->op_sv;
868 if (SvPOK(ver) && !SvNIOK(ver)) {
869 (void)SvUPGRADE(ver, SVt_PVNV);
870 SvNVX(ver) = str_to_version(ver);
871 SvNOK_on(ver); /* hint that it is a version */
878 /* NOTE: The parser sees the package name and the VERSION swapped */
879 PL_nextval[PL_nexttoke].opval = version;
887 * Tokenize a quoted string passed in as an SV. It finds the next
888 * chunk, up to end of string or a backslash. It may make a new
889 * SV containing that chunk (if HINT_NEW_STRING is on). It also
894 S_tokeq(pTHX_ SV *sv)
905 s = SvPV_force(sv, len);
906 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
909 while (s < send && *s != '\\')
914 if ( PL_hints & HINT_NEW_STRING ) {
915 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
921 if (s + 1 < send && (s[1] == '\\'))
922 s++; /* all that, just for this */
927 SvCUR_set(sv, d - SvPVX(sv));
929 if ( PL_hints & HINT_NEW_STRING )
930 return new_constant(NULL, 0, "q", sv, pv, "q");
935 * Now come three functions related to double-quote context,
936 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
937 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
938 * interact with PL_lex_state, and create fake ( ... ) argument lists
939 * to handle functions and concatenation.
940 * They assume that whoever calls them will be setting up a fake
941 * join call, because each subthing puts a ',' after it. This lets
944 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
946 * (I'm not sure whether the spurious commas at the end of lcfirst's
947 * arguments and join's arguments are created or not).
952 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
954 * Pattern matching will set PL_lex_op to the pattern-matching op to
955 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
957 * OP_CONST and OP_READLINE are easy--just make the new op and return.
959 * Everything else becomes a FUNC.
961 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
962 * had an OP_CONST or OP_READLINE). This just sets us up for a
963 * call to S_sublex_push().
969 register I32 op_type = yylval.ival;
971 if (op_type == OP_NULL) {
972 yylval.opval = PL_lex_op;
976 if (op_type == OP_CONST || op_type == OP_READLINE) {
977 SV *sv = tokeq(PL_lex_stuff);
979 if (SvTYPE(sv) == SVt_PVIV) {
980 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
986 nsv = newSVpvn(p, len);
992 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
993 PL_lex_stuff = Nullsv;
994 /* Allow <FH> // "foo" */
995 if (op_type == OP_READLINE)
996 PL_expect = XTERMORDORDOR;
1000 PL_sublex_info.super_state = PL_lex_state;
1001 PL_sublex_info.sub_inwhat = op_type;
1002 PL_sublex_info.sub_op = PL_lex_op;
1003 PL_lex_state = LEX_INTERPPUSH;
1007 yylval.opval = PL_lex_op;
1017 * Create a new scope to save the lexing state. The scope will be
1018 * ended in S_sublex_done. Returns a '(', starting the function arguments
1019 * to the uc, lc, etc. found before.
1020 * Sets PL_lex_state to LEX_INTERPCONCAT.
1028 PL_lex_state = PL_sublex_info.super_state;
1029 SAVEI32(PL_lex_dojoin);
1030 SAVEI32(PL_lex_brackets);
1031 SAVEI32(PL_lex_casemods);
1032 SAVEI32(PL_lex_starts);
1033 SAVEI32(PL_lex_state);
1034 SAVEVPTR(PL_lex_inpat);
1035 SAVEI32(PL_lex_inwhat);
1036 SAVECOPLINE(PL_curcop);
1037 SAVEPPTR(PL_bufptr);
1038 SAVEPPTR(PL_bufend);
1039 SAVEPPTR(PL_oldbufptr);
1040 SAVEPPTR(PL_oldoldbufptr);
1041 SAVEPPTR(PL_last_lop);
1042 SAVEPPTR(PL_last_uni);
1043 SAVEPPTR(PL_linestart);
1044 SAVESPTR(PL_linestr);
1045 SAVEGENERICPV(PL_lex_brackstack);
1046 SAVEGENERICPV(PL_lex_casestack);
1048 PL_linestr = PL_lex_stuff;
1049 PL_lex_stuff = Nullsv;
1051 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1052 = SvPVX(PL_linestr);
1053 PL_bufend += SvCUR(PL_linestr);
1054 PL_last_lop = PL_last_uni = Nullch;
1055 SAVEFREESV(PL_linestr);
1057 PL_lex_dojoin = FALSE;
1058 PL_lex_brackets = 0;
1059 New(899, PL_lex_brackstack, 120, char);
1060 New(899, PL_lex_casestack, 12, char);
1061 PL_lex_casemods = 0;
1062 *PL_lex_casestack = '\0';
1064 PL_lex_state = LEX_INTERPCONCAT;
1065 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1067 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1068 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1069 PL_lex_inpat = PL_sublex_info.sub_op;
1071 PL_lex_inpat = Nullop;
1078 * Restores lexer state after a S_sublex_push.
1084 if (!PL_lex_starts++) {
1085 SV *sv = newSVpvn("",0);
1086 if (SvUTF8(PL_linestr))
1088 PL_expect = XOPERATOR;
1089 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1093 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1094 PL_lex_state = LEX_INTERPCASEMOD;
1098 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1099 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1100 PL_linestr = PL_lex_repl;
1102 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1103 PL_bufend += SvCUR(PL_linestr);
1104 PL_last_lop = PL_last_uni = Nullch;
1105 SAVEFREESV(PL_linestr);
1106 PL_lex_dojoin = FALSE;
1107 PL_lex_brackets = 0;
1108 PL_lex_casemods = 0;
1109 *PL_lex_casestack = '\0';
1111 if (SvEVALED(PL_lex_repl)) {
1112 PL_lex_state = LEX_INTERPNORMAL;
1114 /* we don't clear PL_lex_repl here, so that we can check later
1115 whether this is an evalled subst; that means we rely on the
1116 logic to ensure sublex_done() is called again only via the
1117 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1120 PL_lex_state = LEX_INTERPCONCAT;
1121 PL_lex_repl = Nullsv;
1127 PL_bufend = SvPVX(PL_linestr);
1128 PL_bufend += SvCUR(PL_linestr);
1129 PL_expect = XOPERATOR;
1130 PL_sublex_info.sub_inwhat = 0;
1138 Extracts a pattern, double-quoted string, or transliteration. This
1141 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1142 processing a pattern (PL_lex_inpat is true), a transliteration
1143 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1145 Returns a pointer to the character scanned up to. Iff this is
1146 advanced from the start pointer supplied (ie if anything was
1147 successfully parsed), will leave an OP for the substring scanned
1148 in yylval. Caller must intuit reason for not parsing further
1149 by looking at the next characters herself.
1153 double-quoted style: \r and \n
1154 regexp special ones: \D \s
1156 backrefs: \1 (deprecated in substitution replacements)
1157 case and quoting: \U \Q \E
1158 stops on @ and $, but not for $ as tail anchor
1160 In transliterations:
1161 characters are VERY literal, except for - not at the start or end
1162 of the string, which indicates a range. scan_const expands the
1163 range to the full set of intermediate characters.
1165 In double-quoted strings:
1167 double-quoted style: \r and \n
1169 backrefs: \1 (deprecated)
1170 case and quoting: \U \Q \E
1173 scan_const does *not* construct ops to handle interpolated strings.
1174 It stops processing as soon as it finds an embedded $ or @ variable
1175 and leaves it to the caller to work out what's going on.
1177 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1179 $ in pattern could be $foo or could be tail anchor. Assumption:
1180 it's a tail anchor if $ is the last thing in the string, or if it's
1181 followed by one of ")| \n\t"
1183 \1 (backreferences) are turned into $1
1185 The structure of the code is
1186 while (there's a character to process) {
1187 handle transliteration ranges
1188 skip regexp comments
1189 skip # initiated comments in //x patterns
1190 check for embedded @foo
1191 check for embedded scalars
1193 leave intact backslashes from leave (below)
1194 deprecate \1 in strings and sub replacements
1195 handle string-changing backslashes \l \U \Q \E, etc.
1196 switch (what was escaped) {
1197 handle - in a transliteration (becomes a literal -)
1198 handle \132 octal characters
1199 handle 0x15 hex characters
1200 handle \cV (control V)
1201 handle printf backslashes (\f, \r, \n, etc)
1203 } (end if backslash)
1204 } (end while character to read)
1209 S_scan_const(pTHX_ char *start)
1211 register char *send = PL_bufend; /* end of the constant */
1212 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1213 register char *s = start; /* start of the constant */
1214 register char *d = SvPVX(sv); /* destination for copies */
1215 bool dorange = FALSE; /* are we in a translit range? */
1216 bool didrange = FALSE; /* did we just finish a range? */
1217 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1218 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1221 const char *leaveit = /* set of acceptably-backslashed characters */
1223 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1226 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1227 /* If we are doing a trans and we know we want UTF8 set expectation */
1228 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1229 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1233 while (s < send || dorange) {
1234 /* get transliterations out of the way (they're most literal) */
1235 if (PL_lex_inwhat == OP_TRANS) {
1236 /* expand a range A-Z to the full set of characters. AIE! */
1238 I32 i; /* current expanded character */
1239 I32 min; /* first character in range */
1240 I32 max; /* last character in range */
1243 char *c = (char*)utf8_hop((U8*)d, -1);
1247 *c = (char)UTF_TO_NATIVE(0xff);
1248 /* mark the range as done, and continue */
1254 i = d - SvPVX(sv); /* remember current offset */
1255 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1256 d = SvPVX(sv) + i; /* refresh d after realloc */
1257 d -= 2; /* eat the first char and the - */
1259 min = (U8)*d; /* first char in range */
1260 max = (U8)d[1]; /* last char in range */
1264 "Invalid range \"%c-%c\" in transliteration operator",
1265 (char)min, (char)max);
1269 if ((isLOWER(min) && isLOWER(max)) ||
1270 (isUPPER(min) && isUPPER(max))) {
1272 for (i = min; i <= max; i++)
1274 *d++ = NATIVE_TO_NEED(has_utf8,i);
1276 for (i = min; i <= max; i++)
1278 *d++ = NATIVE_TO_NEED(has_utf8,i);
1283 for (i = min; i <= max; i++)
1286 /* mark the range as done, and continue */
1292 /* range begins (ignore - as first or last char) */
1293 else if (*s == '-' && s+1 < send && s != start) {
1295 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1298 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1310 /* if we get here, we're not doing a transliteration */
1312 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1313 except for the last char, which will be done separately. */
1314 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1316 while (s+1 < send && *s != ')')
1317 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1319 else if (s[2] == '{' /* This should match regcomp.c */
1320 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1323 char *regparse = s + (s[2] == '{' ? 3 : 4);
1326 while (count && (c = *regparse)) {
1327 if (c == '\\' && regparse[1])
1335 if (*regparse != ')')
1336 regparse--; /* Leave one char for continuation. */
1337 while (s < regparse)
1338 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1342 /* likewise skip #-initiated comments in //x patterns */
1343 else if (*s == '#' && PL_lex_inpat &&
1344 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1345 while (s+1 < send && *s != '\n')
1346 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1349 /* check for embedded arrays
1350 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1352 else if (*s == '@' && s[1]
1353 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1356 /* check for embedded scalars. only stop if we're sure it's a
1359 else if (*s == '$') {
1360 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1362 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1363 break; /* in regexp, $ might be tail anchor */
1366 /* End of else if chain - OP_TRANS rejoin rest */
1369 if (*s == '\\' && s+1 < send) {
1372 /* some backslashes we leave behind */
1373 if (*leaveit && *s && strchr(leaveit, *s)) {
1374 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1375 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1379 /* deprecate \1 in strings and substitution replacements */
1380 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1381 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1383 if (ckWARN(WARN_SYNTAX))
1384 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1389 /* string-change backslash escapes */
1390 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1395 /* if we get here, it's either a quoted -, or a digit */
1398 /* quoted - in transliterations */
1400 if (PL_lex_inwhat == OP_TRANS) {
1407 if (ckWARN(WARN_MISC) &&
1410 Perl_warner(aTHX_ packWARN(WARN_MISC),
1411 "Unrecognized escape \\%c passed through",
1413 /* default action is to copy the quoted character */
1414 goto default_action;
1417 /* \132 indicates an octal constant */
1418 case '0': case '1': case '2': case '3':
1419 case '4': case '5': case '6': case '7':
1423 uv = grok_oct(s, &len, &flags, NULL);
1426 goto NUM_ESCAPE_INSERT;
1428 /* \x24 indicates a hex constant */
1432 char* e = strchr(s, '}');
1433 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1434 PERL_SCAN_DISALLOW_PREFIX;
1439 yyerror("Missing right brace on \\x{}");
1443 uv = grok_hex(s, &len, &flags, NULL);
1449 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1450 uv = grok_hex(s, &len, &flags, NULL);
1456 /* Insert oct or hex escaped character.
1457 * There will always enough room in sv since such
1458 * escapes will be longer than any UTF-8 sequence
1459 * they can end up as. */
1461 /* We need to map to chars to ASCII before doing the tests
1464 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1465 if (!has_utf8 && uv > 255) {
1466 /* Might need to recode whatever we have
1467 * accumulated so far if it contains any
1470 * (Can't we keep track of that and avoid
1471 * this rescan? --jhi)
1475 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1476 if (!NATIVE_IS_INVARIANT(*c)) {
1481 STRLEN offset = d - SvPVX(sv);
1483 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1487 while (src >= (U8 *)SvPVX(sv)) {
1488 if (!NATIVE_IS_INVARIANT(*src)) {
1489 U8 ch = NATIVE_TO_ASCII(*src);
1490 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1491 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1501 if (has_utf8 || uv > 255) {
1502 d = (char*)uvchr_to_utf8((U8*)d, uv);
1504 if (PL_lex_inwhat == OP_TRANS &&
1505 PL_sublex_info.sub_op) {
1506 PL_sublex_info.sub_op->op_private |=
1507 (PL_lex_repl ? OPpTRANS_FROM_UTF
1520 /* \N{LATIN SMALL LETTER A} is a named character */
1524 char* e = strchr(s, '}');
1530 yyerror("Missing right brace on \\N{}");
1534 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1536 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1537 PERL_SCAN_DISALLOW_PREFIX;
1540 uv = grok_hex(s, &len, &flags, NULL);
1542 goto NUM_ESCAPE_INSERT;
1544 res = newSVpvn(s + 1, e - s - 1);
1545 res = new_constant( Nullch, 0, "charnames",
1546 res, Nullsv, "\\N{...}" );
1548 sv_utf8_upgrade(res);
1549 str = SvPV(res,len);
1550 #ifdef EBCDIC_NEVER_MIND
1551 /* charnames uses pack U and that has been
1552 * recently changed to do the below uni->native
1553 * mapping, so this would be redundant (and wrong,
1554 * the code point would be doubly converted).
1555 * But leave this in just in case the pack U change
1556 * gets revoked, but the semantics is still
1557 * desireable for charnames. --jhi */
1559 UV uv = utf8_to_uvchr((U8*)str, 0);
1562 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1564 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1565 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1566 str = SvPV(res, len);
1570 if (!has_utf8 && SvUTF8(res)) {
1571 char *ostart = SvPVX(sv);
1572 SvCUR_set(sv, d - ostart);
1575 sv_utf8_upgrade(sv);
1576 /* this just broke our allocation above... */
1577 SvGROW(sv, (STRLEN)(send - start));
1578 d = SvPVX(sv) + SvCUR(sv);
1581 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1582 char *odest = SvPVX(sv);
1584 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1585 d = SvPVX(sv) + (d - odest);
1587 Copy(str, d, len, char);
1594 yyerror("Missing braces on \\N{}");
1597 /* \c is a control character */
1606 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1609 yyerror("Missing control char name in \\c");
1613 /* printf-style backslashes, formfeeds, newlines, etc */
1615 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1618 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1621 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1624 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1627 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1630 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1633 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1639 } /* end if (backslash) */
1642 /* If we started with encoded form, or already know we want it
1643 and then encode the next character */
1644 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1646 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1647 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1650 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1651 STRLEN off = d - SvPVX(sv);
1652 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1654 d = (char*)uvchr_to_utf8((U8*)d, uv);
1658 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1660 } /* while loop to process each character */
1662 /* terminate the string and set up the sv */
1664 SvCUR_set(sv, d - SvPVX(sv));
1665 if (SvCUR(sv) >= SvLEN(sv))
1666 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1669 if (PL_encoding && !has_utf8) {
1670 sv_recode_to_utf8(sv, PL_encoding);
1676 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1677 PL_sublex_info.sub_op->op_private |=
1678 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1682 /* shrink the sv if we allocated more than we used */
1683 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1684 SvLEN_set(sv, SvCUR(sv) + 1);
1685 Renew(SvPVX(sv), SvLEN(sv), char);
1688 /* return the substring (via yylval) only if we parsed anything */
1689 if (s > PL_bufptr) {
1690 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1691 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1693 ( PL_lex_inwhat == OP_TRANS
1695 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1698 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1705 * Returns TRUE if there's more to the expression (e.g., a subscript),
1708 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1710 * ->[ and ->{ return TRUE
1711 * { and [ outside a pattern are always subscripts, so return TRUE
1712 * if we're outside a pattern and it's not { or [, then return FALSE
1713 * if we're in a pattern and the first char is a {
1714 * {4,5} (any digits around the comma) returns FALSE
1715 * if we're in a pattern and the first char is a [
1717 * [SOMETHING] has a funky algorithm to decide whether it's a
1718 * character class or not. It has to deal with things like
1719 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1720 * anything else returns TRUE
1723 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1726 S_intuit_more(pTHX_ register char *s)
1728 if (PL_lex_brackets)
1730 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1732 if (*s != '{' && *s != '[')
1737 /* In a pattern, so maybe we have {n,m}. */
1754 /* On the other hand, maybe we have a character class */
1757 if (*s == ']' || *s == '^')
1760 /* this is terrifying, and it works */
1761 int weight = 2; /* let's weigh the evidence */
1763 unsigned char un_char = 255, last_un_char;
1764 char *send = strchr(s,']');
1765 char tmpbuf[sizeof PL_tokenbuf * 4];
1767 if (!send) /* has to be an expression */
1770 Zero(seen,256,char);
1773 else if (isDIGIT(*s)) {
1775 if (isDIGIT(s[1]) && s[2] == ']')
1781 for (; s < send; s++) {
1782 last_un_char = un_char;
1783 un_char = (unsigned char)*s;
1788 weight -= seen[un_char] * 10;
1789 if (isALNUM_lazy_if(s+1,UTF)) {
1790 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1791 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1796 else if (*s == '$' && s[1] &&
1797 strchr("[#!%*<>()-=",s[1])) {
1798 if (/*{*/ strchr("])} =",s[2]))
1807 if (strchr("wds]",s[1]))
1809 else if (seen['\''] || seen['"'])
1811 else if (strchr("rnftbxcav",s[1]))
1813 else if (isDIGIT(s[1])) {
1815 while (s[1] && isDIGIT(s[1]))
1825 if (strchr("aA01! ",last_un_char))
1827 if (strchr("zZ79~",s[1]))
1829 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1830 weight -= 5; /* cope with negative subscript */
1833 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1834 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1839 if (keyword(tmpbuf, d - tmpbuf))
1842 if (un_char == last_un_char + 1)
1844 weight -= seen[un_char];
1849 if (weight >= 0) /* probably a character class */
1859 * Does all the checking to disambiguate
1861 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1862 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1864 * First argument is the stuff after the first token, e.g. "bar".
1866 * Not a method if bar is a filehandle.
1867 * Not a method if foo is a subroutine prototyped to take a filehandle.
1868 * Not a method if it's really "Foo $bar"
1869 * Method if it's "foo $bar"
1870 * Not a method if it's really "print foo $bar"
1871 * Method if it's really "foo package::" (interpreted as package->foo)
1872 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1873 * Not a method if bar is a filehandle or package, but is quoted with
1878 S_intuit_method(pTHX_ char *start, GV *gv)
1880 char *s = start + (*start == '$');
1881 char tmpbuf[sizeof PL_tokenbuf];
1889 if ((cv = GvCVu(gv))) {
1890 char *proto = SvPVX(cv);
1900 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1901 /* start is the beginning of the possible filehandle/object,
1902 * and s is the end of it
1903 * tmpbuf is a copy of it
1906 if (*start == '$') {
1907 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1912 return *s == '(' ? FUNCMETH : METHOD;
1914 if (!keyword(tmpbuf, len)) {
1915 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1920 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1921 if (indirgv && GvCVu(indirgv))
1923 /* filehandle or package name makes it a method */
1924 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1926 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1927 return 0; /* no assumptions -- "=>" quotes bearword */
1929 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1930 newSVpvn(tmpbuf,len));
1931 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1935 return *s == '(' ? FUNCMETH : METHOD;
1943 * Return a string of Perl code to load the debugger. If PERL5DB
1944 * is set, it will return the contents of that, otherwise a
1945 * compile-time require of perl5db.pl.
1952 char *pdb = PerlEnv_getenv("PERL5DB");
1956 SETERRNO(0,SS_NORMAL);
1957 return "BEGIN { require 'perl5db.pl' }";
1963 /* Encoded script support. filter_add() effectively inserts a
1964 * 'pre-processing' function into the current source input stream.
1965 * Note that the filter function only applies to the current source file
1966 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1968 * The datasv parameter (which may be NULL) can be used to pass
1969 * private data to this instance of the filter. The filter function
1970 * can recover the SV using the FILTER_DATA macro and use it to
1971 * store private buffers and state information.
1973 * The supplied datasv parameter is upgraded to a PVIO type
1974 * and the IoDIRP/IoANY field is used to store the function pointer,
1975 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1976 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1977 * private use must be set using malloc'd pointers.
1981 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1986 if (!PL_rsfp_filters)
1987 PL_rsfp_filters = newAV();
1989 datasv = NEWSV(255,0);
1990 if (!SvUPGRADE(datasv, SVt_PVIO))
1991 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1992 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1993 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1994 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1995 (void*)funcp, SvPV_nolen(datasv)));
1996 av_unshift(PL_rsfp_filters, 1);
1997 av_store(PL_rsfp_filters, 0, datasv) ;
2002 /* Delete most recently added instance of this filter function. */
2004 Perl_filter_del(pTHX_ filter_t funcp)
2007 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2008 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2010 /* if filter is on top of stack (usual case) just pop it off */
2011 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2012 if (IoANY(datasv) == (void *)funcp) {
2013 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2014 IoANY(datasv) = (void *)NULL;
2015 sv_free(av_pop(PL_rsfp_filters));
2019 /* we need to search for the correct entry and clear it */
2020 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2024 /* Invoke the n'th filter function for the current rsfp. */
2026 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2029 /* 0 = read one text line */
2034 if (!PL_rsfp_filters)
2036 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2037 /* Provide a default input filter to make life easy. */
2038 /* Note that we append to the line. This is handy. */
2039 DEBUG_P(PerlIO_printf(Perl_debug_log,
2040 "filter_read %d: from rsfp\n", idx));
2044 int old_len = SvCUR(buf_sv) ;
2046 /* ensure buf_sv is large enough */
2047 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2048 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2049 if (PerlIO_error(PL_rsfp))
2050 return -1; /* error */
2052 return 0 ; /* end of file */
2054 SvCUR_set(buf_sv, old_len + len) ;
2057 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2058 if (PerlIO_error(PL_rsfp))
2059 return -1; /* error */
2061 return 0 ; /* end of file */
2064 return SvCUR(buf_sv);
2066 /* Skip this filter slot if filter has been deleted */
2067 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2068 DEBUG_P(PerlIO_printf(Perl_debug_log,
2069 "filter_read %d: skipped (filter deleted)\n",
2071 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2073 /* Get function pointer hidden within datasv */
2074 funcp = (filter_t)IoANY(datasv);
2075 DEBUG_P(PerlIO_printf(Perl_debug_log,
2076 "filter_read %d: via function %p (%s)\n",
2077 idx, (void*)funcp, SvPV_nolen(datasv)));
2078 /* Call function. The function is expected to */
2079 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2080 /* Return: <0:error, =0:eof, >0:not eof */
2081 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2085 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2087 #ifdef PERL_CR_FILTER
2088 if (!PL_rsfp_filters) {
2089 filter_add(S_cr_textfilter,NULL);
2092 if (PL_rsfp_filters) {
2095 SvCUR_set(sv, 0); /* start with empty line */
2096 if (FILTER_READ(0, sv, 0) > 0)
2097 return ( SvPVX(sv) ) ;
2102 return (sv_gets(sv, fp, append));
2106 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2110 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2114 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2115 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2117 return GvHV(gv); /* Foo:: */
2120 /* use constant CLASS => 'MyClass' */
2121 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2123 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2124 pkgname = SvPV_nolen(sv);
2128 return gv_stashpv(pkgname, FALSE);
2132 static char* exp_name[] =
2133 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2134 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
2141 Works out what to call the token just pulled out of the input
2142 stream. The yacc parser takes care of taking the ops we return and
2143 stitching them into a tree.
2149 if read an identifier
2150 if we're in a my declaration
2151 croak if they tried to say my($foo::bar)
2152 build the ops for a my() declaration
2153 if it's an access to a my() variable
2154 are we in a sort block?
2155 croak if my($a); $a <=> $b
2156 build ops for access to a my() variable
2157 if in a dq string, and they've said @foo and we can't find @foo
2159 build ops for a bareword
2160 if we already built the token before, use it.
2165 #pragma segment Perl_yylex
2177 I32 orig_keyword = 0;
2179 /* check if there's an identifier for us to look at */
2180 if (PL_pending_ident)
2181 return S_pending_ident(aTHX);
2183 /* no identifier pending identification */
2185 switch (PL_lex_state) {
2187 case LEX_NORMAL: /* Some compilers will produce faster */
2188 case LEX_INTERPNORMAL: /* code if we comment these out. */
2192 /* when we've already built the next token, just pull it out of the queue */
2195 yylval = PL_nextval[PL_nexttoke];
2197 PL_lex_state = PL_lex_defer;
2198 PL_expect = PL_lex_expect;
2199 PL_lex_defer = LEX_NORMAL;
2201 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2202 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2203 (IV)PL_nexttype[PL_nexttoke]); });
2205 return(PL_nexttype[PL_nexttoke]);
2207 /* interpolated case modifiers like \L \U, including \Q and \E.
2208 when we get here, PL_bufptr is at the \
2210 case LEX_INTERPCASEMOD:
2212 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2213 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2215 /* handle \E or end of string */
2216 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2220 if (PL_lex_casemods) {
2221 oldmod = PL_lex_casestack[--PL_lex_casemods];
2222 PL_lex_casestack[PL_lex_casemods] = '\0';
2224 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2226 PL_lex_state = LEX_INTERPCONCAT;
2230 if (PL_bufptr != PL_bufend)
2232 PL_lex_state = LEX_INTERPCONCAT;
2236 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2237 "### Saw case modifier at '%s'\n", PL_bufptr); });
2239 if (s[1] == '\\' && s[2] == 'E') {
2241 PL_lex_state = LEX_INTERPCONCAT;
2245 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2246 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2247 if (strchr("LU", *s) &&
2248 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
2249 PL_lex_casestack[--PL_lex_casemods] = '\0';
2252 if (PL_lex_casemods > 10)
2253 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2254 PL_lex_casestack[PL_lex_casemods++] = *s;
2255 PL_lex_casestack[PL_lex_casemods] = '\0';
2256 PL_lex_state = LEX_INTERPCONCAT;
2257 PL_nextval[PL_nexttoke].ival = 0;
2260 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2262 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2264 PL_nextval[PL_nexttoke].ival = OP_LC;
2266 PL_nextval[PL_nexttoke].ival = OP_UC;
2268 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2270 Perl_croak(aTHX_ "panic: yylex");
2274 if (PL_lex_starts) {
2283 case LEX_INTERPPUSH:
2284 return sublex_push();
2286 case LEX_INTERPSTART:
2287 if (PL_bufptr == PL_bufend)
2288 return sublex_done();
2289 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2290 "### Interpolated variable at '%s'\n", PL_bufptr); });
2292 PL_lex_dojoin = (*PL_bufptr == '@');
2293 PL_lex_state = LEX_INTERPNORMAL;
2294 if (PL_lex_dojoin) {
2295 PL_nextval[PL_nexttoke].ival = 0;
2297 force_ident("\"", '$');
2298 PL_nextval[PL_nexttoke].ival = 0;
2300 PL_nextval[PL_nexttoke].ival = 0;
2302 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2305 if (PL_lex_starts++) {
2311 case LEX_INTERPENDMAYBE:
2312 if (intuit_more(PL_bufptr)) {
2313 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2319 if (PL_lex_dojoin) {
2320 PL_lex_dojoin = FALSE;
2321 PL_lex_state = LEX_INTERPCONCAT;
2324 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2325 && SvEVALED(PL_lex_repl))
2327 if (PL_bufptr != PL_bufend)
2328 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2329 PL_lex_repl = Nullsv;
2332 case LEX_INTERPCONCAT:
2334 if (PL_lex_brackets)
2335 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2337 if (PL_bufptr == PL_bufend)
2338 return sublex_done();
2340 if (SvIVX(PL_linestr) == '\'') {
2341 SV *sv = newSVsv(PL_linestr);
2344 else if ( PL_hints & HINT_NEW_RE )
2345 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2346 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2350 s = scan_const(PL_bufptr);
2352 PL_lex_state = LEX_INTERPCASEMOD;
2354 PL_lex_state = LEX_INTERPSTART;
2357 if (s != PL_bufptr) {
2358 PL_nextval[PL_nexttoke] = yylval;
2361 if (PL_lex_starts++)
2371 PL_lex_state = LEX_NORMAL;
2372 s = scan_formline(PL_bufptr);
2373 if (!PL_lex_formbrack)
2379 PL_oldoldbufptr = PL_oldbufptr;
2382 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2383 exp_name[PL_expect], s);
2389 if (isIDFIRST_lazy_if(s,UTF))
2391 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2394 goto fake_eof; /* emulate EOF on ^D or ^Z */
2399 if (PL_lex_brackets) {
2400 if (PL_lex_formbrack)
2401 yyerror("Format not terminated");
2403 yyerror("Missing right curly or square bracket");
2405 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2406 "### Tokener got EOF\n");
2410 if (s++ < PL_bufend)
2411 goto retry; /* ignore stray nulls */
2414 if (!PL_in_eval && !PL_preambled) {
2415 PL_preambled = TRUE;
2416 sv_setpv(PL_linestr,incl_perldb());
2417 if (SvCUR(PL_linestr))
2418 sv_catpv(PL_linestr,";");
2420 while(AvFILLp(PL_preambleav) >= 0) {
2421 SV *tmpsv = av_shift(PL_preambleav);
2422 sv_catsv(PL_linestr, tmpsv);
2423 sv_catpv(PL_linestr, ";");
2426 sv_free((SV*)PL_preambleav);
2427 PL_preambleav = NULL;
2429 if (PL_minus_n || PL_minus_p) {
2430 sv_catpv(PL_linestr, "LINE: while (<>) {");
2432 sv_catpv(PL_linestr,"chomp;");
2435 if (strchr("/'\"", *PL_splitstr)
2436 && strchr(PL_splitstr + 1, *PL_splitstr))
2437 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2440 s = "'~#\200\1'"; /* surely one char is unused...*/
2441 while (s[1] && strchr(PL_splitstr, *s)) s++;
2443 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2444 "q" + (delim == '\''), delim);
2445 for (s = PL_splitstr; *s; s++) {
2447 sv_catpvn(PL_linestr, "\\", 1);
2448 sv_catpvn(PL_linestr, s, 1);
2450 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2454 sv_catpv(PL_linestr,"our @F=split(' ');");
2457 sv_catpv(PL_linestr, "\n");
2458 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2459 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2460 PL_last_lop = PL_last_uni = Nullch;
2461 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2462 SV *sv = NEWSV(85,0);
2464 sv_upgrade(sv, SVt_PVMG);
2465 sv_setsv(sv,PL_linestr);
2468 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2473 bof = PL_rsfp ? TRUE : FALSE;
2474 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2477 if (PL_preprocess && !PL_in_eval)
2478 (void)PerlProc_pclose(PL_rsfp);
2479 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2480 PerlIO_clearerr(PL_rsfp);
2482 (void)PerlIO_close(PL_rsfp);
2484 PL_doextract = FALSE;
2486 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2487 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2488 sv_catpv(PL_linestr,";}");
2489 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2490 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2491 PL_last_lop = PL_last_uni = Nullch;
2492 PL_minus_n = PL_minus_p = 0;
2495 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2496 PL_last_lop = PL_last_uni = Nullch;
2497 sv_setpv(PL_linestr,"");
2498 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2500 /* if it looks like the start of a BOM, check if it in fact is */
2501 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2502 #ifdef PERLIO_IS_STDIO
2503 # ifdef __GNU_LIBRARY__
2504 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2505 # define FTELL_FOR_PIPE_IS_BROKEN
2509 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2510 # define FTELL_FOR_PIPE_IS_BROKEN
2515 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2516 /* This loses the possibility to detect the bof
2517 * situation on perl -P when the libc5 is being used.
2518 * Workaround? Maybe attach some extra state to PL_rsfp?
2521 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2523 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2526 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2527 s = swallow_bom((U8*)s);
2531 /* Incest with pod. */
2532 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2533 sv_setpv(PL_linestr, "");
2534 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2535 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2536 PL_last_lop = PL_last_uni = Nullch;
2537 PL_doextract = FALSE;
2541 } while (PL_doextract);
2542 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2543 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2544 SV *sv = NEWSV(85,0);
2546 sv_upgrade(sv, SVt_PVMG);
2547 sv_setsv(sv,PL_linestr);
2550 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2552 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2553 PL_last_lop = PL_last_uni = Nullch;
2554 if (CopLINE(PL_curcop) == 1) {
2555 while (s < PL_bufend && isSPACE(*s))
2557 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2561 if (*s == '#' && *(s+1) == '!')
2563 #ifdef ALTERNATE_SHEBANG
2565 static char as[] = ALTERNATE_SHEBANG;
2566 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2567 d = s + (sizeof(as) - 1);
2569 #endif /* ALTERNATE_SHEBANG */
2578 while (*d && !isSPACE(*d))
2582 #ifdef ARG_ZERO_IS_SCRIPT
2583 if (ipathend > ipath) {
2585 * HP-UX (at least) sets argv[0] to the script name,
2586 * which makes $^X incorrect. And Digital UNIX and Linux,
2587 * at least, set argv[0] to the basename of the Perl
2588 * interpreter. So, having found "#!", we'll set it right.
2590 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2591 assert(SvPOK(x) || SvGMAGICAL(x));
2592 if (sv_eq(x, CopFILESV(PL_curcop))) {
2593 sv_setpvn(x, ipath, ipathend - ipath);
2599 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2600 char *lstart = SvPV(x,llen);
2602 bstart += blen - llen;
2603 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2604 sv_setpvn(x, ipath, ipathend - ipath);
2609 TAINT_NOT; /* $^X is always tainted, but that's OK */
2611 #endif /* ARG_ZERO_IS_SCRIPT */
2616 d = instr(s,"perl -");
2618 d = instr(s,"perl");
2620 /* avoid getting into infinite loops when shebang
2621 * line contains "Perl" rather than "perl" */
2623 for (d = ipathend-4; d >= ipath; --d) {
2624 if ((*d == 'p' || *d == 'P')
2625 && !ibcmp(d, "perl", 4))
2635 #ifdef ALTERNATE_SHEBANG
2637 * If the ALTERNATE_SHEBANG on this system starts with a
2638 * character that can be part of a Perl expression, then if
2639 * we see it but not "perl", we're probably looking at the
2640 * start of Perl code, not a request to hand off to some
2641 * other interpreter. Similarly, if "perl" is there, but
2642 * not in the first 'word' of the line, we assume the line
2643 * contains the start of the Perl program.
2645 if (d && *s != '#') {
2647 while (*c && !strchr("; \t\r\n\f\v#", *c))
2650 d = Nullch; /* "perl" not in first word; ignore */
2652 *s = '#'; /* Don't try to parse shebang line */
2654 #endif /* ALTERNATE_SHEBANG */
2655 #ifndef MACOS_TRADITIONAL
2660 !instr(s,"indir") &&
2661 instr(PL_origargv[0],"perl"))
2667 while (s < PL_bufend && isSPACE(*s))
2669 if (s < PL_bufend) {
2670 Newz(899,newargv,PL_origargc+3,char*);
2672 while (s < PL_bufend && !isSPACE(*s))
2675 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2678 newargv = PL_origargv;
2681 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2683 Perl_croak(aTHX_ "Can't exec %s", ipath);
2687 U32 oldpdb = PL_perldb;
2688 bool oldn = PL_minus_n;
2689 bool oldp = PL_minus_p;
2691 while (*d && !isSPACE(*d)) d++;
2692 while (SPACE_OR_TAB(*d)) d++;
2695 bool switches_done = PL_doswitches;
2697 if (*d == 'M' || *d == 'm') {
2699 while (*d && !isSPACE(*d)) d++;
2700 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2703 d = moreswitches(d);
2705 if (PL_doswitches && !switches_done) {
2706 int argc = PL_origargc;
2707 char **argv = PL_origargv;
2710 } while (argc && argv[0][0] == '-' && argv[0][1]);
2711 init_argv_symbols(argc,argv);
2713 if ((PERLDB_LINE && !oldpdb) ||
2714 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2715 /* if we have already added "LINE: while (<>) {",
2716 we must not do it again */
2718 sv_setpv(PL_linestr, "");
2719 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2720 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2721 PL_last_lop = PL_last_uni = Nullch;
2722 PL_preambled = FALSE;
2724 (void)gv_fetchfile(PL_origfilename);
2727 if (PL_doswitches && !switches_done) {
2728 int argc = PL_origargc;
2729 char **argv = PL_origargv;
2732 } while (argc && argv[0][0] == '-' && argv[0][1]);
2733 init_argv_symbols(argc,argv);
2739 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2741 PL_lex_state = LEX_FORMLINE;
2746 #ifdef PERL_STRICT_CR
2747 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2749 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2751 case ' ': case '\t': case '\f': case 013:
2752 #ifdef MACOS_TRADITIONAL
2759 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2760 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2761 /* handle eval qq[#line 1 "foo"\n ...] */
2762 CopLINE_dec(PL_curcop);
2766 while (s < d && *s != '\n')
2770 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2771 Perl_croak(aTHX_ "panic: input overflow");
2773 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2775 PL_lex_state = LEX_FORMLINE;
2785 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2792 while (s < PL_bufend && SPACE_OR_TAB(*s))
2795 if (strnEQ(s,"=>",2)) {
2796 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2797 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2798 "### Saw unary minus before =>, forcing word '%s'\n", s);
2800 OPERATOR('-'); /* unary minus */
2802 PL_last_uni = PL_oldbufptr;
2804 case 'r': ftst = OP_FTEREAD; break;
2805 case 'w': ftst = OP_FTEWRITE; break;
2806 case 'x': ftst = OP_FTEEXEC; break;
2807 case 'o': ftst = OP_FTEOWNED; break;
2808 case 'R': ftst = OP_FTRREAD; break;
2809 case 'W': ftst = OP_FTRWRITE; break;
2810 case 'X': ftst = OP_FTREXEC; break;
2811 case 'O': ftst = OP_FTROWNED; break;
2812 case 'e': ftst = OP_FTIS; break;
2813 case 'z': ftst = OP_FTZERO; break;
2814 case 's': ftst = OP_FTSIZE; break;
2815 case 'f': ftst = OP_FTFILE; break;
2816 case 'd': ftst = OP_FTDIR; break;
2817 case 'l': ftst = OP_FTLINK; break;
2818 case 'p': ftst = OP_FTPIPE; break;
2819 case 'S': ftst = OP_FTSOCK; break;
2820 case 'u': ftst = OP_FTSUID; break;
2821 case 'g': ftst = OP_FTSGID; break;
2822 case 'k': ftst = OP_FTSVTX; break;
2823 case 'b': ftst = OP_FTBLK; break;
2824 case 'c': ftst = OP_FTCHR; break;
2825 case 't': ftst = OP_FTTTY; break;
2826 case 'T': ftst = OP_FTTEXT; break;
2827 case 'B': ftst = OP_FTBINARY; break;
2828 case 'M': case 'A': case 'C':
2829 gv_fetchpv("\024",TRUE, SVt_PV);
2831 case 'M': ftst = OP_FTMTIME; break;
2832 case 'A': ftst = OP_FTATIME; break;
2833 case 'C': ftst = OP_FTCTIME; break;
2841 PL_last_lop_op = (OPCODE)ftst;
2842 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2843 "### Saw file test %c\n", (int)ftst);
2848 /* Assume it was a minus followed by a one-letter named
2849 * subroutine call (or a -bareword), then. */
2850 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2851 "### '-%c' looked like a file test but was not\n",
2860 if (PL_expect == XOPERATOR)
2865 else if (*s == '>') {
2868 if (isIDFIRST_lazy_if(s,UTF)) {
2869 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2877 if (PL_expect == XOPERATOR)
2880 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2882 OPERATOR('-'); /* unary minus */
2889 if (PL_expect == XOPERATOR)
2894 if (PL_expect == XOPERATOR)
2897 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2903 if (PL_expect != XOPERATOR) {
2904 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2905 PL_expect = XOPERATOR;
2906 force_ident(PL_tokenbuf, '*');
2919 if (PL_expect == XOPERATOR) {
2923 PL_tokenbuf[0] = '%';
2924 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2925 if (!PL_tokenbuf[1]) {
2928 PL_pending_ident = '%';
2947 switch (PL_expect) {
2950 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2952 PL_bufptr = s; /* update in case we back off */
2958 PL_expect = XTERMBLOCK;
2962 while (isIDFIRST_lazy_if(s,UTF)) {
2963 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2964 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2965 if (tmp < 0) tmp = -tmp;
2981 d = scan_str(d,TRUE,TRUE);
2983 /* MUST advance bufptr here to avoid bogus
2984 "at end of line" context messages from yyerror().
2986 PL_bufptr = s + len;
2987 yyerror("Unterminated attribute parameter in attribute list");
2990 return 0; /* EOF indicator */
2994 SV *sv = newSVpvn(s, len);
2995 sv_catsv(sv, PL_lex_stuff);
2996 attrs = append_elem(OP_LIST, attrs,
2997 newSVOP(OP_CONST, 0, sv));
2998 SvREFCNT_dec(PL_lex_stuff);
2999 PL_lex_stuff = Nullsv;
3002 if (len == 6 && strnEQ(s, "unique", len)) {
3003 if (PL_in_my == KEY_our)
3005 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3007 ; /* skip to avoid loading attributes.pm */
3010 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
3013 /* NOTE: any CV attrs applied here need to be part of
3014 the CVf_BUILTIN_ATTRS define in cv.h! */
3015 else if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3016 CvLVALUE_on(PL_compcv);
3017 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3018 CvLOCKED_on(PL_compcv);
3019 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3020 CvMETHOD_on(PL_compcv);
3021 else if (!PL_in_my && len == 9 && strnEQ(s, "assertion", len))
3022 CvASSERTION_on(PL_compcv);
3023 /* After we've set the flags, it could be argued that
3024 we don't need to do the attributes.pm-based setting
3025 process, and shouldn't bother appending recognized
3026 flags. To experiment with that, uncomment the
3027 following "else". (Note that's already been
3028 uncommented. That keeps the above-applied built-in
3029 attributes from being intercepted (and possibly
3030 rejected) by a package's attribute routines, but is
3031 justified by the performance win for the common case
3032 of applying only built-in attributes.) */
3034 attrs = append_elem(OP_LIST, attrs,
3035 newSVOP(OP_CONST, 0,
3039 if (*s == ':' && s[1] != ':')
3042 break; /* require real whitespace or :'s */
3044 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3045 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3046 char q = ((*s == '\'') ? '"' : '\'');
3047 /* If here for an expression, and parsed no attrs, back off. */
3048 if (tmp == '=' && !attrs) {
3052 /* MUST advance bufptr here to avoid bogus "at end of line"
3053 context messages from yyerror().
3057 yyerror("Unterminated attribute list");
3059 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3067 PL_nextval[PL_nexttoke].opval = attrs;
3075 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3076 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3093 if (PL_lex_brackets <= 0)
3094 yyerror("Unmatched right square bracket");
3097 if (PL_lex_state == LEX_INTERPNORMAL) {
3098 if (PL_lex_brackets == 0) {
3099 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3100 PL_lex_state = LEX_INTERPEND;
3107 if (PL_lex_brackets > 100) {
3108 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
3110 switch (PL_expect) {
3112 if (PL_lex_formbrack) {
3116 if (PL_oldoldbufptr == PL_last_lop)
3117 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3119 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3120 OPERATOR(HASHBRACK);
3122 while (s < PL_bufend && SPACE_OR_TAB(*s))
3125 PL_tokenbuf[0] = '\0';
3126 if (d < PL_bufend && *d == '-') {
3127 PL_tokenbuf[0] = '-';
3129 while (d < PL_bufend && SPACE_OR_TAB(*d))
3132 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3133 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3135 while (d < PL_bufend && SPACE_OR_TAB(*d))
3138 char minus = (PL_tokenbuf[0] == '-');
3139 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3147 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3152 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3157 if (PL_oldoldbufptr == PL_last_lop)
3158 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3160 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3163 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3165 /* This hack is to get the ${} in the message. */
3167 yyerror("syntax error");
3170 OPERATOR(HASHBRACK);
3172 /* This hack serves to disambiguate a pair of curlies
3173 * as being a block or an anon hash. Normally, expectation
3174 * determines that, but in cases where we're not in a
3175 * position to expect anything in particular (like inside
3176 * eval"") we have to resolve the ambiguity. This code
3177 * covers the case where the first term in the curlies is a
3178 * quoted string. Most other cases need to be explicitly
3179 * disambiguated by prepending a `+' before the opening
3180 * curly in order to force resolution as an anon hash.
3182 * XXX should probably propagate the outer expectation
3183 * into eval"" to rely less on this hack, but that could
3184 * potentially break current behavior of eval"".
3188 if (*s == '\'' || *s == '"' || *s == '`') {
3189 /* common case: get past first string, handling escapes */
3190 for (t++; t < PL_bufend && *t != *s;)
3191 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3195 else if (*s == 'q') {
3198 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3201 /* skip q//-like construct */
3203 char open, close, term;
3206 while (t < PL_bufend && isSPACE(*t))
3208 /* check for q => */
3209 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
3210 OPERATOR(HASHBRACK);
3214 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3218 for (t++; t < PL_bufend; t++) {
3219 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3221 else if (*t == open)
3225 for (t++; t < PL_bufend; t++) {
3226 if (*t == '\\' && t+1 < PL_bufend)
3228 else if (*t == close && --brackets <= 0)
3230 else if (*t == open)
3237 /* skip plain q word */
3238 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3241 else if (isALNUM_lazy_if(t,UTF)) {
3243 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3246 while (t < PL_bufend && isSPACE(*t))
3248 /* if comma follows first term, call it an anon hash */
3249 /* XXX it could be a comma expression with loop modifiers */
3250 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3251 || (*t == '=' && t[1] == '>')))
3252 OPERATOR(HASHBRACK);
3253 if (PL_expect == XREF)
3256 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3262 yylval.ival = CopLINE(PL_curcop);
3263 if (isSPACE(*s) || *s == '#')
3264 PL_copline = NOLINE; /* invalidate current command line number */
3269 if (PL_lex_brackets <= 0)
3270 yyerror("Unmatched right curly bracket");
3272 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3273 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3274 PL_lex_formbrack = 0;
3275 if (PL_lex_state == LEX_INTERPNORMAL) {
3276 if (PL_lex_brackets == 0) {
3277 if (PL_expect & XFAKEBRACK) {
3278 PL_expect &= XENUMMASK;
3279 PL_lex_state = LEX_INTERPEND;
3281 return yylex(); /* ignore fake brackets */
3283 if (*s == '-' && s[1] == '>')
3284 PL_lex_state = LEX_INTERPENDMAYBE;
3285 else if (*s != '[' && *s != '{')
3286 PL_lex_state = LEX_INTERPEND;
3289 if (PL_expect & XFAKEBRACK) {
3290 PL_expect &= XENUMMASK;
3292 return yylex(); /* ignore fake brackets */
3302 if (PL_expect == XOPERATOR) {
3303 if (ckWARN(WARN_SEMICOLON)
3304 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3306 CopLINE_dec(PL_curcop);
3307 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3308 CopLINE_inc(PL_curcop);
3313 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3315 PL_expect = XOPERATOR;
3316 force_ident(PL_tokenbuf, '&');
3320 yylval.ival = (OPpENTERSUB_AMPER<<8);
3339 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3340 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3342 if (PL_expect == XSTATE && isALPHA(tmp) &&
3343 (s == PL_linestart+1 || s[-2] == '\n') )
3345 if (PL_in_eval && !PL_rsfp) {
3350 if (strnEQ(s,"=cut",4)) {
3364 PL_doextract = TRUE;
3367 if (PL_lex_brackets < PL_lex_formbrack) {
3369 #ifdef PERL_STRICT_CR
3370 for (t = s; SPACE_OR_TAB(*t); t++) ;
3372 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3374 if (*t == '\n' || *t == '#') {
3392 if (PL_expect != XOPERATOR) {
3393 if (s[1] != '<' && !strchr(s,'>'))
3396 s = scan_heredoc(s);
3398 s = scan_inputsymbol(s);
3399 TERM(sublex_start());
3404 SHop(OP_LEFT_SHIFT);
3418 SHop(OP_RIGHT_SHIFT);
3427 if (PL_expect == XOPERATOR) {
3428 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3431 return ','; /* grandfather non-comma-format format */
3435 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3436 PL_tokenbuf[0] = '@';
3437 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3438 sizeof PL_tokenbuf - 1, FALSE);
3439 if (PL_expect == XOPERATOR)
3440 no_op("Array length", s);
3441 if (!PL_tokenbuf[1])
3443 PL_expect = XOPERATOR;
3444 PL_pending_ident = '#';
3448 PL_tokenbuf[0] = '$';
3449 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3450 sizeof PL_tokenbuf - 1, FALSE);
3451 if (PL_expect == XOPERATOR)
3453 if (!PL_tokenbuf[1]) {
3455 yyerror("Final $ should be \\$ or $name");
3459 /* This kludge not intended to be bulletproof. */
3460 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3461 yylval.opval = newSVOP(OP_CONST, 0,
3462 newSViv(PL_compiling.cop_arybase));
3463 yylval.opval->op_private = OPpCONST_ARYBASE;
3469 if (PL_lex_state == LEX_NORMAL)
3472 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3475 PL_tokenbuf[0] = '@';
3476 if (ckWARN(WARN_SYNTAX)) {
3478 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3481 PL_bufptr = skipspace(PL_bufptr);
3482 while (t < PL_bufend && *t != ']')
3484 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3485 "Multidimensional syntax %.*s not supported",
3486 (t - PL_bufptr) + 1, PL_bufptr);
3490 else if (*s == '{') {
3491 PL_tokenbuf[0] = '%';
3492 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3493 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3495 char tmpbuf[sizeof PL_tokenbuf];
3497 for (t++; isSPACE(*t); t++) ;
3498 if (isIDFIRST_lazy_if(t,UTF)) {
3499 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3500 for (; isSPACE(*t); t++) ;
3501 if (*t == ';' && get_cv(tmpbuf, FALSE))
3502 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3503 "You need to quote \"%s\"", tmpbuf);
3509 PL_expect = XOPERATOR;
3510 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3511 bool islop = (PL_last_lop == PL_oldoldbufptr);
3512 if (!islop || PL_last_lop_op == OP_GREPSTART)
3513 PL_expect = XOPERATOR;
3514 else if (strchr("$@\"'`q", *s))
3515 PL_expect = XTERM; /* e.g. print $fh "foo" */
3516 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3517 PL_expect = XTERM; /* e.g. print $fh &sub */
3518 else if (isIDFIRST_lazy_if(s,UTF)) {
3519 char tmpbuf[sizeof PL_tokenbuf];
3520 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3521 if ((tmp = keyword(tmpbuf, len))) {
3522 /* binary operators exclude handle interpretations */
3534 PL_expect = XTERM; /* e.g. print $fh length() */
3539 PL_expect = XTERM; /* e.g. print $fh subr() */
3542 else if (isDIGIT(*s))
3543 PL_expect = XTERM; /* e.g. print $fh 3 */
3544 else if (*s == '.' && isDIGIT(s[1]))
3545 PL_expect = XTERM; /* e.g. print $fh .3 */
3546 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3547 PL_expect = XTERM; /* e.g. print $fh -1 */
3548 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '=' && s[1] != '/')
3549 PL_expect = XTERM; /* e.g. print $fh /.../
3550 XXX except DORDOR operator */
3551 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3552 PL_expect = XTERM; /* print $fh <<"EOF" */
3554 PL_pending_ident = '$';
3558 if (PL_expect == XOPERATOR)
3560 PL_tokenbuf[0] = '@';
3561 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3562 if (!PL_tokenbuf[1]) {
3565 if (PL_lex_state == LEX_NORMAL)
3567 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3569 PL_tokenbuf[0] = '%';
3571 /* Warn about @ where they meant $. */
3572 if (ckWARN(WARN_SYNTAX)) {
3573 if (*s == '[' || *s == '{') {
3575 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3577 if (*t == '}' || *t == ']') {
3579 PL_bufptr = skipspace(PL_bufptr);
3580 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3581 "Scalar value %.*s better written as $%.*s",
3582 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3587 PL_pending_ident = '@';
3590 case '/': /* may be division, defined-or, or pattern */
3591 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3595 case '?': /* may either be conditional or pattern */
3596 if(PL_expect == XOPERATOR) {
3604 /* A // operator. */
3614 /* Disable warning on "study /blah/" */
3615 if (PL_oldoldbufptr == PL_last_uni
3616 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3617 || memNE(PL_last_uni, "study", 5)
3618 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3621 s = scan_pat(s,OP_MATCH);
3622 TERM(sublex_start());
3626 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3627 #ifdef PERL_STRICT_CR
3630 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3632 && (s == PL_linestart || s[-1] == '\n') )
3634 PL_lex_formbrack = 0;
3638 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3644 yylval.ival = OPf_SPECIAL;
3650 if (PL_expect != XOPERATOR)
3655 case '0': case '1': case '2': case '3': case '4':
3656 case '5': case '6': case '7': case '8': case '9':
3657 s = scan_num(s, &yylval);
3658 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3659 "### Saw number in '%s'\n", s);
3661 if (PL_expect == XOPERATOR)
3666 s = scan_str(s,FALSE,FALSE);
3667 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3668 "### Saw string before '%s'\n", s);
3670 if (PL_expect == XOPERATOR) {
3671 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3674 return ','; /* grandfather non-comma-format format */
3680 missingterm((char*)0);
3681 yylval.ival = OP_CONST;
3682 TERM(sublex_start());
3685 s = scan_str(s,FALSE,FALSE);
3686 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3687 "### Saw string before '%s'\n", s);
3689 if (PL_expect == XOPERATOR) {
3690 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3693 return ','; /* grandfather non-comma-format format */
3699 missingterm((char*)0);
3700 yylval.ival = OP_CONST;
3701 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3702 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3703 yylval.ival = OP_STRINGIFY;
3707 TERM(sublex_start());
3710 s = scan_str(s,FALSE,FALSE);
3711 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3712 "### Saw backtick string before '%s'\n", s);
3714 if (PL_expect == XOPERATOR)
3715 no_op("Backticks",s);
3717 missingterm((char*)0);
3718 yylval.ival = OP_BACKTICK;
3720 TERM(sublex_start());
3724 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3725 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3727 if (PL_expect == XOPERATOR)
3728 no_op("Backslash",s);
3732 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3736 while (isDIGIT(*start) || *start == '_')
3738 if (*start == '.' && isDIGIT(start[1])) {
3739 s = scan_num(s, &yylval);
3742 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3743 else if (!isALPHA(*start) && (PL_expect == XTERM
3744 || PL_expect == XREF || PL_expect == XSTATE
3745 || PL_expect == XTERMORDORDOR)) {
3749 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3752 s = scan_num(s, &yylval);
3759 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3799 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3801 /* Some keywords can be followed by any delimiter, including ':' */
3802 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3803 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3804 (PL_tokenbuf[0] == 'q' &&
3805 strchr("qwxr", PL_tokenbuf[1])))));
3807 /* x::* is just a word, unless x is "CORE" */
3808 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3812 while (d < PL_bufend && isSPACE(*d))
3813 d++; /* no comments skipped here, or s### is misparsed */
3815 /* Is this a label? */
3816 if (!tmp && PL_expect == XSTATE
3817 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3819 yylval.pval = savepv(PL_tokenbuf);
3824 /* Check for keywords */
3825 tmp = keyword(PL_tokenbuf, len);
3827 /* Is this a word before a => operator? */
3828 if (*d == '=' && d[1] == '>') {
3830 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3831 yylval.opval->op_private = OPpCONST_BARE;
3832 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3833 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3837 if (tmp < 0) { /* second-class keyword? */
3838 GV *ogv = Nullgv; /* override (winner) */
3839 GV *hgv = Nullgv; /* hidden (loser) */
3840 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3842 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3845 if (GvIMPORTED_CV(gv))
3847 else if (! CvMETHOD(cv))
3851 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3852 (gv = *gvp) != (GV*)&PL_sv_undef &&
3853 GvCVu(gv) && GvIMPORTED_CV(gv))
3860 tmp = 0; /* overridden by import or by GLOBAL */
3863 && -tmp==KEY_lock /* XXX generalizable kludge */
3865 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3867 tmp = 0; /* any sub overrides "weak" keyword */
3869 else { /* no override */
3871 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3872 Perl_warner(aTHX_ packWARN(WARN_MISC),
3873 "dump() better written as CORE::dump()");
3877 if (ckWARN(WARN_AMBIGUOUS) && hgv
3878 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3879 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3880 "Ambiguous call resolved as CORE::%s(), %s",
3881 GvENAME(hgv), "qualify as such or use &");
3888 default: /* not a keyword */
3892 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3894 /* Get the rest if it looks like a package qualifier */
3896 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3898 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3901 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3902 *s == '\'' ? "'" : "::");
3907 if (PL_expect == XOPERATOR) {
3908 if (PL_bufptr == PL_linestart) {
3909 CopLINE_dec(PL_curcop);
3910 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3911 CopLINE_inc(PL_curcop);
3914 no_op("Bareword",s);
3917 /* Look for a subroutine with this name in current package,
3918 unless name is "Foo::", in which case Foo is a bearword
3919 (and a package name). */
3922 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3924 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3925 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3926 "Bareword \"%s\" refers to nonexistent package",
3929 PL_tokenbuf[len] = '\0';
3936 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3939 /* if we saw a global override before, get the right name */
3942 sv = newSVpvn("CORE::GLOBAL::",14);
3943 sv_catpv(sv,PL_tokenbuf);
3946 sv = newSVpv(PL_tokenbuf,0);
3948 /* Presume this is going to be a bareword of some sort. */
3951 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3952 yylval.opval->op_private = OPpCONST_BARE;
3953 /* UTF-8 package name? */
3954 if (UTF && !IN_BYTES &&
3955 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3958 /* And if "Foo::", then that's what it certainly is. */
3963 /* See if it's the indirect object for a list operator. */
3965 if (PL_oldoldbufptr &&
3966 PL_oldoldbufptr < PL_bufptr &&
3967 (PL_oldoldbufptr == PL_last_lop
3968 || PL_oldoldbufptr == PL_last_uni) &&
3969 /* NO SKIPSPACE BEFORE HERE! */
3970 (PL_expect == XREF ||
3971 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3973 bool immediate_paren = *s == '(';
3975 /* (Now we can afford to cross potential line boundary.) */
3978 /* Two barewords in a row may indicate method call. */
3980 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3983 /* If not a declared subroutine, it's an indirect object. */
3984 /* (But it's an indir obj regardless for sort.) */
3986 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3987 ((!gv || !GvCVu(gv)) &&
3988 (PL_last_lop_op != OP_MAPSTART &&
3989 PL_last_lop_op != OP_GREPSTART))))
3991 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3996 PL_expect = XOPERATOR;
3999 /* Is this a word before a => operator? */
4000 if (*s == '=' && s[1] == '>' && !pkgname) {
4002 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4003 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4004 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4008 /* If followed by a paren, it's certainly a subroutine. */
4011 if (gv && GvCVu(gv)) {
4012 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4013 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4018 PL_nextval[PL_nexttoke].opval = yylval.opval;
4019 PL_expect = XOPERATOR;
4025 /* If followed by var or block, call it a method (unless sub) */
4027 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4028 PL_last_lop = PL_oldbufptr;
4029 PL_last_lop_op = OP_METHOD;
4033 /* If followed by a bareword, see if it looks like indir obj. */
4036 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
4037 && (tmp = intuit_method(s,gv)))
4040 /* Not a method, so call it a subroutine (if defined) */
4042 if (gv && GvCVu(gv)) {
4044 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4045 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4046 "Ambiguous use of -%s resolved as -&%s()",
4047 PL_tokenbuf, PL_tokenbuf);
4048 /* Check for a constant sub */
4050 if ((sv = cv_const_sv(cv))) {
4052 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4053 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4054 yylval.opval->op_private = 0;
4058 /* Resolve to GV now. */
4059 op_free(yylval.opval);
4060 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4061 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4062 PL_last_lop = PL_oldbufptr;
4063 PL_last_lop_op = OP_ENTERSUB;
4064 /* Is there a prototype? */
4067 char *proto = SvPV((SV*)cv, len);
4070 if (strEQ(proto, "$"))
4072 while (*proto == ';')
4074 if (*proto == '&' && *s == '{') {
4075 sv_setpv(PL_subname, PL_curstash ?
4076 "__ANON__" : "__ANON__::__ANON__");
4080 PL_nextval[PL_nexttoke].opval = yylval.opval;
4086 /* Call it a bare word */
4088 if (PL_hints & HINT_STRICT_SUBS)
4089 yylval.opval->op_private |= OPpCONST_STRICT;
4092 if (ckWARN(WARN_RESERVED)) {
4093 if (lastchar != '-') {
4094 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4095 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4096 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4103 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4104 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4105 "Operator or semicolon missing before %c%s",
4106 lastchar, PL_tokenbuf);
4107 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4108 "Ambiguous use of %c resolved as operator %c",
4109 lastchar, lastchar);
4115 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4116 newSVpv(CopFILE(PL_curcop),0));
4120 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4121 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4124 case KEY___PACKAGE__:
4125 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4127 ? newSVsv(PL_curstname)
4136 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4137 char *pname = "main";
4138 if (PL_tokenbuf[2] == 'D')
4139 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4140 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4143 GvIOp(gv) = newIO();
4144 IoIFP(GvIOp(gv)) = PL_rsfp;
4145 #if defined(HAS_FCNTL) && defined(F_SETFD)
4147 int fd = PerlIO_fileno(PL_rsfp);
4148 fcntl(fd,F_SETFD,fd >= 3);
4151 /* Mark this internal pseudo-handle as clean */
4152 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4154 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4155 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4156 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4158 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4159 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4160 /* if the script was opened in binmode, we need to revert
4161 * it to text mode for compatibility; but only iff it has CRs
4162 * XXX this is a questionable hack at best. */
4163 if (PL_bufend-PL_bufptr > 2
4164 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4167 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4168 loc = PerlIO_tell(PL_rsfp);
4169 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4172 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4174 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4175 #endif /* NETWARE */
4176 #ifdef PERLIO_IS_STDIO /* really? */
4177 # if defined(__BORLANDC__)
4178 /* XXX see note in do_binmode() */
4179 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4183 PerlIO_seek(PL_rsfp, loc, 0);
4187 #ifdef PERLIO_LAYERS
4190 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4191 else if (PL_encoding) {
4198 XPUSHs(PL_encoding);
4200 call_method("name", G_SCALAR);
4204 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
4205 Perl_form(aTHX_ ":encoding(%"SVf")",
4223 if (PL_expect == XSTATE) {
4230 if (*s == ':' && s[1] == ':') {
4233 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4234 if (!(tmp = keyword(PL_tokenbuf, len)))
4235 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4249 LOP(OP_ACCEPT,XTERM);
4255 LOP(OP_ATAN2,XTERM);
4261 LOP(OP_BINMODE,XTERM);
4264 LOP(OP_BLESS,XTERM);
4273 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4290 if (!PL_cryptseen) {
4291 PL_cryptseen = TRUE;
4295 LOP(OP_CRYPT,XTERM);
4298 LOP(OP_CHMOD,XTERM);
4301 LOP(OP_CHOWN,XTERM);
4304 LOP(OP_CONNECT,XTERM);
4320 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4324 PL_hints |= HINT_BLOCK_SCOPE;
4334 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4335 LOP(OP_DBMOPEN,XTERM);
4341 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4348 yylval.ival = CopLINE(PL_curcop);
4362 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4363 UNIBRACK(OP_ENTEREVAL);
4381 case KEY_endhostent:
4387 case KEY_endservent:
4390 case KEY_endprotoent:
4401 yylval.ival = CopLINE(PL_curcop);
4403 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4405 if ((PL_bufend - p) >= 3 &&
4406 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4408 else if ((PL_bufend - p) >= 4 &&
4409 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4412 if (isIDFIRST_lazy_if(p,UTF)) {
4413 p = scan_ident(p, PL_bufend,
4414 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4418 Perl_croak(aTHX_ "Missing $ on loop variable");
4423 LOP(OP_FORMLINE,XTERM);
4429 LOP(OP_FCNTL,XTERM);
4435 LOP(OP_FLOCK,XTERM);
4444 LOP(OP_GREPSTART, XREF);
4447 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4462 case KEY_getpriority:
4463 LOP(OP_GETPRIORITY,XTERM);
4465 case KEY_getprotobyname:
4468 case KEY_getprotobynumber:
4469 LOP(OP_GPBYNUMBER,XTERM);
4471 case KEY_getprotoent:
4483 case KEY_getpeername:
4484 UNI(OP_GETPEERNAME);
4486 case KEY_gethostbyname:
4489 case KEY_gethostbyaddr:
4490 LOP(OP_GHBYADDR,XTERM);
4492 case KEY_gethostent:
4495 case KEY_getnetbyname:
4498 case KEY_getnetbyaddr:
4499 LOP(OP_GNBYADDR,XTERM);
4504 case KEY_getservbyname:
4505 LOP(OP_GSBYNAME,XTERM);
4507 case KEY_getservbyport:
4508 LOP(OP_GSBYPORT,XTERM);
4510 case KEY_getservent:
4513 case KEY_getsockname:
4514 UNI(OP_GETSOCKNAME);
4516 case KEY_getsockopt:
4517 LOP(OP_GSOCKOPT,XTERM);
4539 yylval.ival = CopLINE(PL_curcop);
4543 LOP(OP_INDEX,XTERM);
4549 LOP(OP_IOCTL,XTERM);
4561 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4593 LOP(OP_LISTEN,XTERM);
4602 s = scan_pat(s,OP_MATCH);
4603 TERM(sublex_start());
4606 LOP(OP_MAPSTART, XREF);
4609 LOP(OP_MKDIR,XTERM);
4612 LOP(OP_MSGCTL,XTERM);
4615 LOP(OP_MSGGET,XTERM);
4618 LOP(OP_MSGRCV,XTERM);
4621 LOP(OP_MSGSND,XTERM);
4627 if (isIDFIRST_lazy_if(s,UTF)) {
4628 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4629 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4631 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4632 if (!PL_in_my_stash) {
4635 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4643 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4650 if (PL_expect != XSTATE)
4651 yyerror("\"no\" not allowed in expression");
4652 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4653 s = force_version(s, FALSE);
4658 if (*s == '(' || (s = skipspace(s), *s == '('))
4665 if (isIDFIRST_lazy_if(s,UTF)) {
4667 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4669 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
4671 && !(t[0] == '=' && t[1] == '>')
4673 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4674 "Precedence problem: open %.*s should be open(%.*s)",
4675 d - s, s, d - s, s);
4681 yylval.ival = OP_OR;
4691 LOP(OP_OPEN_DIR,XTERM);
4694 checkcomma(s,PL_tokenbuf,"filehandle");
4698 checkcomma(s,PL_tokenbuf,"filehandle");
4717 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4721 LOP(OP_PIPE_OP,XTERM);
4724 s = scan_str(s,FALSE,FALSE);
4726 missingterm((char*)0);
4727 yylval.ival = OP_CONST;
4728 TERM(sublex_start());
4734 s = scan_str(s,FALSE,FALSE);
4736 missingterm((char*)0);
4738 if (SvCUR(PL_lex_stuff)) {
4741 d = SvPV_force(PL_lex_stuff, len);
4744 for (; isSPACE(*d) && len; --len, ++d) ;
4747 if (!warned && ckWARN(WARN_QW)) {
4748 for (; !isSPACE(*d) && len; --len, ++d) {
4750 Perl_warner(aTHX_ packWARN(WARN_QW),
4751 "Possible attempt to separate words with commas");
4754 else if (*d == '#') {
4755 Perl_warner(aTHX_ packWARN(WARN_QW),
4756 "Possible attempt to put comments in qw() list");
4762 for (; !isSPACE(*d) && len; --len, ++d) ;
4764 sv = newSVpvn(b, d-b);
4765 if (DO_UTF8(PL_lex_stuff))
4767 words = append_elem(OP_LIST, words,
4768 newSVOP(OP_CONST, 0, tokeq(sv)));
4772 PL_nextval[PL_nexttoke].opval = words;
4777 SvREFCNT_dec(PL_lex_stuff);
4778 PL_lex_stuff = Nullsv;
4784 s = scan_str(s,FALSE,FALSE);
4786 missingterm((char*)0);
4787 yylval.ival = OP_STRINGIFY;
4788 if (SvIVX(PL_lex_stuff) == '\'')
4789 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4790 TERM(sublex_start());
4793 s = scan_pat(s,OP_QR);
4794 TERM(sublex_start());
4797 s = scan_str(s,FALSE,FALSE);
4799 missingterm((char*)0);
4800 yylval.ival = OP_BACKTICK;
4802 TERM(sublex_start());
4810 s = force_version(s, FALSE);
4812 else if (*s != 'v' || !isDIGIT(s[1])
4813 || (s = force_version(s, TRUE), *s == 'v'))
4815 *PL_tokenbuf = '\0';
4816 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4817 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4818 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4820 yyerror("<> should be quotes");
4828 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4832 LOP(OP_RENAME,XTERM);
4841 LOP(OP_RINDEX,XTERM);
4851 UNIDOR(OP_READLINE);
4864 LOP(OP_REVERSE,XTERM);
4867 UNIDOR(OP_READLINK);
4875 TERM(sublex_start());
4877 TOKEN(1); /* force error */
4886 LOP(OP_SELECT,XTERM);
4892 LOP(OP_SEMCTL,XTERM);
4895 LOP(OP_SEMGET,XTERM);
4898 LOP(OP_SEMOP,XTERM);
4904 LOP(OP_SETPGRP,XTERM);
4906 case KEY_setpriority:
4907 LOP(OP_SETPRIORITY,XTERM);
4909 case KEY_sethostent:
4915 case KEY_setservent:
4918 case KEY_setprotoent:
4928 LOP(OP_SEEKDIR,XTERM);
4930 case KEY_setsockopt:
4931 LOP(OP_SSOCKOPT,XTERM);
4937 LOP(OP_SHMCTL,XTERM);
4940 LOP(OP_SHMGET,XTERM);
4943 LOP(OP_SHMREAD,XTERM);
4946 LOP(OP_SHMWRITE,XTERM);
4949 LOP(OP_SHUTDOWN,XTERM);
4958 LOP(OP_SOCKET,XTERM);
4960 case KEY_socketpair:
4961 LOP(OP_SOCKPAIR,XTERM);
4964 checkcomma(s,PL_tokenbuf,"subroutine name");
4966 if (*s == ';' || *s == ')') /* probably a close */
4967 Perl_croak(aTHX_ "sort is now a reserved word");
4969 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4973 LOP(OP_SPLIT,XTERM);
4976 LOP(OP_SPRINTF,XTERM);
4979 LOP(OP_SPLICE,XTERM);
4994 LOP(OP_SUBSTR,XTERM);
5000 char tmpbuf[sizeof PL_tokenbuf];
5001 SSize_t tboffset = 0;
5002 expectation attrful;
5003 bool have_name, have_proto, bad_proto;
5008 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
5009 (*s == ':' && s[1] == ':'))
5012 attrful = XATTRBLOCK;
5013 /* remember buffer pos'n for later force_word */
5014 tboffset = s - PL_oldbufptr;
5015 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5016 if (strchr(tmpbuf, ':'))
5017 sv_setpv(PL_subname, tmpbuf);
5019 sv_setsv(PL_subname,PL_curstname);
5020 sv_catpvn(PL_subname,"::",2);
5021 sv_catpvn(PL_subname,tmpbuf,len);
5028 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5029 PL_expect = XTERMBLOCK;
5030 attrful = XATTRTERM;
5031 sv_setpv(PL_subname,"?");
5035 if (key == KEY_format) {
5037 PL_lex_formbrack = PL_lex_brackets + 1;
5039 (void) force_word(PL_oldbufptr + tboffset, WORD,
5044 /* Look for a prototype */
5048 s = scan_str(s,FALSE,FALSE);
5050 Perl_croak(aTHX_ "Prototype not terminated");
5051 /* strip spaces and check for bad characters */
5052 d = SvPVX(PL_lex_stuff);
5055 for (p = d; *p; ++p) {
5058 if (!strchr("$@%*;[]&\\", *p))
5063 if (bad_proto && ckWARN(WARN_SYNTAX))
5064 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5065 "Illegal character in prototype for %"SVf" : %s",
5067 SvCUR(PL_lex_stuff) = tmp;
5075 if (*s == ':' && s[1] != ':')
5076 PL_expect = attrful;
5077 else if (!have_name && *s != '{' && key == KEY_sub)
5078 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
5081 PL_nextval[PL_nexttoke].opval =
5082 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5083 PL_lex_stuff = Nullsv;
5087 sv_setpv(PL_subname,
5088 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5091 (void) force_word(PL_oldbufptr + tboffset, WORD,
5100 LOP(OP_SYSTEM,XREF);
5103 LOP(OP_SYMLINK,XTERM);
5106 LOP(OP_SYSCALL,XTERM);
5109 LOP(OP_SYSOPEN,XTERM);
5112 LOP(OP_SYSSEEK,XTERM);
5115 LOP(OP_SYSREAD,XTERM);
5118 LOP(OP_SYSWRITE,XTERM);
5122 TERM(sublex_start());
5143 LOP(OP_TRUNCATE,XTERM);
5155 yylval.ival = CopLINE(PL_curcop);
5159 yylval.ival = CopLINE(PL_curcop);
5163 LOP(OP_UNLINK,XTERM);
5169 LOP(OP_UNPACK,XTERM);
5172 LOP(OP_UTIME,XTERM);
5178 LOP(OP_UNSHIFT,XTERM);
5181 if (PL_expect != XSTATE)
5182 yyerror("\"use\" not allowed in expression");
5184 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5185 s = force_version(s, TRUE);
5186 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5187 PL_nextval[PL_nexttoke].opval = Nullop;
5190 else if (*s == 'v') {
5191 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5192 s = force_version(s, FALSE);
5196 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5197 s = force_version(s, FALSE);
5209 yylval.ival = CopLINE(PL_curcop);
5213 PL_hints |= HINT_BLOCK_SCOPE;
5220 LOP(OP_WAITPID,XTERM);
5229 ctl_l[0] = toCTRL('L');
5231 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5234 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5239 if (PL_expect == XOPERATOR)
5245 yylval.ival = OP_XOR;
5250 TERM(sublex_start());
5255 #pragma segment Main
5259 S_pending_ident(pTHX)
5262 register I32 tmp = 0;
5263 /* pit holds the identifier we read and pending_ident is reset */
5264 char pit = PL_pending_ident;
5265 PL_pending_ident = 0;
5267 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5268 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5270 /* if we're in a my(), we can't allow dynamics here.
5271 $foo'bar has already been turned into $foo::bar, so
5272 just check for colons.
5274 if it's a legal name, the OP is a PADANY.
5277 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5278 if (strchr(PL_tokenbuf,':'))
5279 yyerror(Perl_form(aTHX_ "No package name allowed for "
5280 "variable %s in \"our\"",
5282 tmp = allocmy(PL_tokenbuf);
5285 if (strchr(PL_tokenbuf,':'))
5286 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5288 yylval.opval = newOP(OP_PADANY, 0);
5289 yylval.opval->op_targ = allocmy(PL_tokenbuf);
5295 build the ops for accesses to a my() variable.
5297 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5298 then used in a comparison. This catches most, but not
5299 all cases. For instance, it catches
5300 sort { my($a); $a <=> $b }
5302 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5303 (although why you'd do that is anyone's guess).
5306 if (!strchr(PL_tokenbuf,':')) {
5308 tmp = pad_findmy(PL_tokenbuf);
5309 if (tmp != NOT_IN_PAD) {
5310 /* might be an "our" variable" */
5311 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
5312 /* build ops for a bareword */
5313 SV *sym = newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)), 0);
5314 sv_catpvn(sym, "::", 2);
5315 sv_catpv(sym, PL_tokenbuf+1);
5316 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5317 yylval.opval->op_private = OPpCONST_ENTERED;
5318 gv_fetchpv(SvPVX(sym),
5320 ? (GV_ADDMULTI | GV_ADDINEVAL)
5323 ((PL_tokenbuf[0] == '$') ? SVt_PV
5324 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5329 /* if it's a sort block and they're naming $a or $b */
5330 if (PL_last_lop_op == OP_SORT &&
5331 PL_tokenbuf[0] == '$' &&
5332 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5335 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5336 d < PL_bufend && *d != '\n';
5339 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5340 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5346 yylval.opval = newOP(OP_PADANY, 0);
5347 yylval.opval->op_targ = tmp;
5353 Whine if they've said @foo in a doublequoted string,
5354 and @foo isn't a variable we can find in the symbol
5357 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5358 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5359 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5360 && ckWARN(WARN_AMBIGUOUS))
5362 /* Downgraded from fatal to warning 20000522 mjd */
5363 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5364 "Possible unintended interpolation of %s in string",
5369 /* build ops for a bareword */
5370 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5371 yylval.opval->op_private = OPpCONST_ENTERED;
5372 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5373 ((PL_tokenbuf[0] == '$') ? SVt_PV
5374 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5380 Perl_keyword(pTHX_ register char *d, I32 len)
5385 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5386 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5387 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5388 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5389 if (strEQ(d,"__END__")) return KEY___END__;
5393 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5398 if (strEQ(d,"and")) return -KEY_and;
5399 if (strEQ(d,"abs")) return -KEY_abs;
5402 if (strEQ(d,"alarm")) return -KEY_alarm;
5403 if (strEQ(d,"atan2")) return -KEY_atan2;
5406 if (strEQ(d,"accept")) return -KEY_accept;
5411 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5414 if (strEQ(d,"bless")) return -KEY_bless;
5415 if (strEQ(d,"bind")) return -KEY_bind;
5416 if (strEQ(d,"binmode")) return -KEY_binmode;
5419 if (strEQ(d,"CORE")) return -KEY_CORE;
5420 if (strEQ(d,"CHECK")) return KEY_CHECK;
5425 if (strEQ(d,"cmp")) return -KEY_cmp;
5426 if (strEQ(d,"chr")) return -KEY_chr;
5427 if (strEQ(d,"cos")) return -KEY_cos;
5430 if (strEQ(d,"chop")) return -KEY_chop;
5433 if (strEQ(d,"close")) return -KEY_close;
5434 if (strEQ(d,"chdir")) return -KEY_chdir;
5435 if (strEQ(d,"chomp")) return -KEY_chomp;
5436 if (strEQ(d,"chmod")) return -KEY_chmod;
5437 if (strEQ(d,"chown")) return -KEY_chown;
5438 if (strEQ(d,"crypt")) return -KEY_crypt;
5441 if (strEQ(d,"chroot")) return -KEY_chroot;
5442 if (strEQ(d,"caller")) return -KEY_caller;
5445 if (strEQ(d,"connect")) return -KEY_connect;
5448 if (strEQ(d,"closedir")) return -KEY_closedir;
5449 if (strEQ(d,"continue")) return -KEY_continue;
5454 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5459 if (strEQ(d,"do")) return KEY_do;
5462 if (strEQ(d,"die")) return -KEY_die;
5465 if (strEQ(d,"dump")) return -KEY_dump;
5468 if (strEQ(d,"delete")) return KEY_delete;
5471 if (strEQ(d,"defined")) return KEY_defined;
5472 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5475 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5480 if (strEQ(d,"END")) return KEY_END;
5485 if (strEQ(d,"eq")) return -KEY_eq;
5488 if (strEQ(d,"eof")) return -KEY_eof;
5489 if (strEQ(d,"err")) return -KEY_err;
5490 if (strEQ(d,"exp")) return -KEY_exp;
5493 if (strEQ(d,"else")) return KEY_else;
5494 if (strEQ(d,"exit")) return -KEY_exit;
5495 if (strEQ(d,"eval")) return KEY_eval;
5496 if (strEQ(d,"exec")) return -KEY_exec;
5497 if (strEQ(d,"each")) return -KEY_each;
5500 if (strEQ(d,"elsif")) return KEY_elsif;
5503 if (strEQ(d,"exists")) return KEY_exists;
5504 if (strEQ(d,"elseif") && ckWARN_d(WARN_SYNTAX))
5505 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5506 "elseif should be elsif");
5509 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5510 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5513 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5516 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5517 if (strEQ(d,"endservent")) return -KEY_endservent;
5520 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5527 if (strEQ(d,"for")) return KEY_for;
5530 if (strEQ(d,"fork")) return -KEY_fork;
5533 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5534 if (strEQ(d,"flock")) return -KEY_flock;
5537 if (strEQ(d,"format")) return KEY_format;
5538 if (strEQ(d,"fileno")) return -KEY_fileno;
5541 if (strEQ(d,"foreach")) return KEY_foreach;
5544 if (strEQ(d,"formline")) return -KEY_formline;
5549 if (strnEQ(d,"get",3)) {
5554 if (strEQ(d,"ppid")) return -KEY_getppid;
5555 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5558 if (strEQ(d,"pwent")) return -KEY_getpwent;
5559 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5560 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5563 if (strEQ(d,"peername")) return -KEY_getpeername;
5564 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5565 if (strEQ(d,"priority")) return -KEY_getpriority;
5568 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5571 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5575 else if (*d == 'h') {
5576 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5577 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5578 if (strEQ(d,"hostent")) return -KEY_gethostent;
5580 else if (*d == 'n') {
5581 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5582 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5583 if (strEQ(d,"netent")) return -KEY_getnetent;
5585 else if (*d == 's') {
5586 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5587 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5588 if (strEQ(d,"servent")) return -KEY_getservent;
5589 if (strEQ(d,"sockname")) return -KEY_getsockname;
5590 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5592 else if (*d == 'g') {
5593 if (strEQ(d,"grent")) return -KEY_getgrent;
5594 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5595 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5597 else if (*d == 'l') {
5598 if (strEQ(d,"login")) return -KEY_getlogin;
5600 else if (strEQ(d,"c")) return -KEY_getc;
5605 if (strEQ(d,"gt")) return -KEY_gt;
5606 if (strEQ(d,"ge")) return -KEY_ge;
5609 if (strEQ(d,"grep")) return KEY_grep;
5610 if (strEQ(d,"goto")) return KEY_goto;
5611 if (strEQ(d,"glob")) return KEY_glob;
5614 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5619 if (strEQ(d,"hex")) return -KEY_hex;
5622 if (strEQ(d,"INIT")) return KEY_INIT;
5627 if (strEQ(d,"if")) return KEY_if;
5630 if (strEQ(d,"int")) return -KEY_int;
5633 if (strEQ(d,"index")) return -KEY_index;
5634 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5639 if (strEQ(d,"join")) return -KEY_join;
5643 if (strEQ(d,"keys")) return -KEY_keys;
5644 if (strEQ(d,"kill")) return -KEY_kill;
5650 if (strEQ(d,"lt")) return -KEY_lt;
5651 if (strEQ(d,"le")) return -KEY_le;
5652 if (strEQ(d,"lc")) return -KEY_lc;
5655 if (strEQ(d,"log")) return -KEY_log;
5658 if (strEQ(d,"last")) return KEY_last;
5659 if (strEQ(d,"link")) return -KEY_link;
5660 if (strEQ(d,"lock")) return -KEY_lock;
5663 if (strEQ(d,"local")) return KEY_local;
5664 if (strEQ(d,"lstat")) return -KEY_lstat;
5667 if (strEQ(d,"length")) return -KEY_length;
5668 if (strEQ(d,"listen")) return -KEY_listen;
5671 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5674 if (strEQ(d,"localtime")) return -KEY_localtime;
5680 case 1: return KEY_m;
5682 if (strEQ(d,"my")) return KEY_my;
5685 if (strEQ(d,"map")) return KEY_map;
5688 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5691 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5692 if (strEQ(d,"msgget")) return -KEY_msgget;
5693 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5694 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5699 if (strEQ(d,"next")) return KEY_next;
5700 if (strEQ(d,"ne")) return -KEY_ne;
5701 if (strEQ(d,"not")) return -KEY_not;
5702 if (strEQ(d,"no")) return KEY_no;
5707 if (strEQ(d,"or")) return -KEY_or;
5710 if (strEQ(d,"ord")) return -KEY_ord;
5711 if (strEQ(d,"oct")) return -KEY_oct;
5712 if (strEQ(d,"our")) return KEY_our;
5715 if (strEQ(d,"open")) return -KEY_open;
5718 if (strEQ(d,"opendir")) return -KEY_opendir;
5725 if (strEQ(d,"pop")) return -KEY_pop;
5726 if (strEQ(d,"pos")) return KEY_pos;
5729 if (strEQ(d,"push")) return -KEY_push;
5730 if (strEQ(d,"pack")) return -KEY_pack;
5731 if (strEQ(d,"pipe")) return -KEY_pipe;
5734 if (strEQ(d,"print")) return KEY_print;
5737 if (strEQ(d,"printf")) return KEY_printf;
5740 if (strEQ(d,"package")) return KEY_package;
5743 if (strEQ(d,"prototype")) return KEY_prototype;
5748 if (strEQ(d,"q")) return KEY_q;
5749 if (strEQ(d,"qr")) return KEY_qr;
5750 if (strEQ(d,"qq")) return KEY_qq;
5751 if (strEQ(d,"qw")) return KEY_qw;
5752 if (strEQ(d,"qx")) return KEY_qx;
5754 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5759 if (strEQ(d,"ref")) return -KEY_ref;
5762 if (strEQ(d,"read")) return -KEY_read;
5763 if (strEQ(d,"rand")) return -KEY_rand;
5764 if (strEQ(d,"recv")) return -KEY_recv;
5765 if (strEQ(d,"redo")) return KEY_redo;
5768 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5769 if (strEQ(d,"reset")) return -KEY_reset;
5772 if (strEQ(d,"return")) return KEY_return;
5773 if (strEQ(d,"rename")) return -KEY_rename;
5774 if (strEQ(d,"rindex")) return -KEY_rindex;
5777 if (strEQ(d,"require")) return KEY_require;
5778 if (strEQ(d,"reverse")) return -KEY_reverse;
5779 if (strEQ(d,"readdir")) return -KEY_readdir;
5782 if (strEQ(d,"readlink")) return -KEY_readlink;
5783 if (strEQ(d,"readline")) return -KEY_readline;
5784 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5787 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5793 case 0: return KEY_s;
5795 if (strEQ(d,"scalar")) return KEY_scalar;
5800 if (strEQ(d,"seek")) return -KEY_seek;
5801 if (strEQ(d,"send")) return -KEY_send;
5804 if (strEQ(d,"semop")) return -KEY_semop;
5807 if (strEQ(d,"select")) return -KEY_select;
5808 if (strEQ(d,"semctl")) return -KEY_semctl;
5809 if (strEQ(d,"semget")) return -KEY_semget;
5812 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5813 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5816 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5817 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5820 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5823 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5824 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5825 if (strEQ(d,"setservent")) return -KEY_setservent;
5828 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5829 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5836 if (strEQ(d,"shift")) return -KEY_shift;
5839 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5840 if (strEQ(d,"shmget")) return -KEY_shmget;
5843 if (strEQ(d,"shmread")) return -KEY_shmread;
5846 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5847 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5852 if (strEQ(d,"sin")) return -KEY_sin;
5855 if (strEQ(d,"sleep")) return -KEY_sleep;
5858 if (strEQ(d,"sort")) return KEY_sort;
5859 if (strEQ(d,"socket")) return -KEY_socket;
5860 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5863 if (strEQ(d,"split")) return KEY_split;
5864 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5865 if (strEQ(d,"splice")) return -KEY_splice;
5868 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5871 if (strEQ(d,"srand")) return -KEY_srand;
5874 if (strEQ(d,"stat")) return -KEY_stat;
5875 if (strEQ(d,"study")) return KEY_study;
5878 if (strEQ(d,"substr")) return -KEY_substr;
5879 if (strEQ(d,"sub")) return KEY_sub;
5884 if (strEQ(d,"system")) return -KEY_system;
5887 if (strEQ(d,"symlink")) return -KEY_symlink;
5888 if (strEQ(d,"syscall")) return -KEY_syscall;
5889 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5890 if (strEQ(d,"sysread")) return -KEY_sysread;
5891 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5894 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5903 if (strEQ(d,"tr")) return KEY_tr;
5906 if (strEQ(d,"tie")) return KEY_tie;
5909 if (strEQ(d,"tell")) return -KEY_tell;
5910 if (strEQ(d,"tied")) return KEY_tied;
5911 if (strEQ(d,"time")) return -KEY_time;
5914 if (strEQ(d,"times")) return -KEY_times;
5917 if (strEQ(d,"telldir")) return -KEY_telldir;
5920 if (strEQ(d,"truncate")) return -KEY_truncate;
5927 if (strEQ(d,"uc")) return -KEY_uc;
5930 if (strEQ(d,"use")) return KEY_use;
5933 if (strEQ(d,"undef")) return KEY_undef;
5934 if (strEQ(d,"until")) return KEY_until;
5935 if (strEQ(d,"untie")) return KEY_untie;
5936 if (strEQ(d,"utime")) return -KEY_utime;
5937 if (strEQ(d,"umask")) return -KEY_umask;
5940 if (strEQ(d,"unless")) return KEY_unless;
5941 if (strEQ(d,"unpack")) return -KEY_unpack;
5942 if (strEQ(d,"unlink")) return -KEY_unlink;
5945 if (strEQ(d,"unshift")) return -KEY_unshift;
5946 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5951 if (strEQ(d,"values")) return -KEY_values;
5952 if (strEQ(d,"vec")) return -KEY_vec;
5957 if (strEQ(d,"warn")) return -KEY_warn;
5958 if (strEQ(d,"wait")) return -KEY_wait;
5961 if (strEQ(d,"while")) return KEY_while;
5962 if (strEQ(d,"write")) return -KEY_write;
5965 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5968 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5973 if (len == 1) return -KEY_x;
5974 if (strEQ(d,"xor")) return -KEY_xor;
5977 if (len == 1) return KEY_y;
5986 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5990 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5991 if (ckWARN(WARN_SYNTAX)) {
5993 for (w = s+2; *w && level; w++) {
6000 for (; *w && isSPACE(*w); w++) ;
6001 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
6002 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6003 "%s (...) interpreted as function",name);
6006 while (s < PL_bufend && isSPACE(*s))
6010 while (s < PL_bufend && isSPACE(*s))
6012 if (isIDFIRST_lazy_if(s,UTF)) {
6014 while (isALNUM_lazy_if(s,UTF))
6016 while (s < PL_bufend && isSPACE(*s))
6021 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6025 Perl_croak(aTHX_ "No comma allowed after %s", what);
6030 /* Either returns sv, or mortalizes sv and returns a new SV*.
6031 Best used as sv=new_constant(..., sv, ...).
6032 If s, pv are NULL, calls subroutine with one argument,
6033 and type is used with error messages only. */
6036 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6040 HV *table = GvHV(PL_hintgv); /* ^H */
6044 const char *why1, *why2, *why3;
6046 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6049 why2 = strEQ(key,"charnames")
6050 ? "(possibly a missing \"use charnames ...\")"
6052 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6053 (type ? type: "undef"), why2);
6055 /* This is convoluted and evil ("goto considered harmful")
6056 * but I do not understand the intricacies of all the different
6057 * failure modes of %^H in here. The goal here is to make
6058 * the most probable error message user-friendly. --jhi */
6063 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6064 (type ? type: "undef"), why1, why2, why3);
6066 yyerror(SvPVX(msg));
6070 cvp = hv_fetch(table, key, strlen(key), FALSE);
6071 if (!cvp || !SvOK(*cvp)) {
6074 why3 = "} is not defined";
6077 sv_2mortal(sv); /* Parent created it permanently */
6080 pv = sv_2mortal(newSVpvn(s, len));
6082 typesv = sv_2mortal(newSVpv(type, 0));
6084 typesv = &PL_sv_undef;
6086 PUSHSTACKi(PERLSI_OVERLOAD);
6098 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6102 /* Check the eval first */
6103 if (!PL_in_eval && SvTRUE(ERRSV)) {
6105 sv_catpv(ERRSV, "Propagated");
6106 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6108 res = SvREFCNT_inc(sv);
6112 (void)SvREFCNT_inc(res);
6121 why1 = "Call to &{$^H{";
6123 why3 = "}} did not return a defined value";
6132 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6134 register char *d = dest;
6135 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6138 Perl_croak(aTHX_ ident_too_long);
6139 if (isALNUM(*s)) /* UTF handled below */
6141 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6146 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6150 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6151 char *t = s + UTF8SKIP(s);
6152 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6154 if (d + (t - s) > e)
6155 Perl_croak(aTHX_ ident_too_long);
6156 Copy(s, d, t - s, char);
6169 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6179 e = d + destlen - 3; /* two-character token, ending NUL */
6181 while (isDIGIT(*s)) {
6183 Perl_croak(aTHX_ ident_too_long);
6190 Perl_croak(aTHX_ ident_too_long);
6191 if (isALNUM(*s)) /* UTF handled below */
6193 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6198 else if (*s == ':' && s[1] == ':') {
6202 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6203 char *t = s + UTF8SKIP(s);
6204 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6206 if (d + (t - s) > e)
6207 Perl_croak(aTHX_ ident_too_long);
6208 Copy(s, d, t - s, char);
6219 if (PL_lex_state != LEX_NORMAL)
6220 PL_lex_state = LEX_INTERPENDMAYBE;
6223 if (*s == '$' && s[1] &&
6224 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6237 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6242 if (isSPACE(s[-1])) {
6245 if (!SPACE_OR_TAB(ch)) {
6251 if (isIDFIRST_lazy_if(d,UTF)) {
6255 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6257 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6260 Copy(s, d, e - s, char);
6265 while ((isALNUM(*s) || *s == ':') && d < e)
6268 Perl_croak(aTHX_ ident_too_long);
6271 while (s < send && SPACE_OR_TAB(*s)) s++;
6272 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6273 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6274 const char *brack = *s == '[' ? "[...]" : "{...}";
6275 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6276 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6277 funny, dest, brack, funny, dest, brack);
6280 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6284 /* Handle extended ${^Foo} variables
6285 * 1999-02-27 mjd-perl-patch@plover.com */
6286 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6290 while (isALNUM(*s) && d < e) {
6294 Perl_croak(aTHX_ ident_too_long);
6299 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
6300 PL_lex_state = LEX_INTERPEND;
6305 if (PL_lex_state == LEX_NORMAL) {
6306 if (ckWARN(WARN_AMBIGUOUS) &&
6307 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6309 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6310 "Ambiguous use of %c{%s} resolved to %c%s",
6311 funny, dest, funny, dest);
6316 s = bracket; /* let the parser handle it */
6320 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6321 PL_lex_state = LEX_INTERPEND;
6326 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6331 *pmfl |= PMf_GLOBAL;
6333 *pmfl |= PMf_CONTINUE;
6337 *pmfl |= PMf_MULTILINE;
6339 *pmfl |= PMf_SINGLELINE;
6341 *pmfl |= PMf_EXTENDED;
6345 S_scan_pat(pTHX_ char *start, I32 type)
6350 s = scan_str(start,FALSE,FALSE);
6352 Perl_croak(aTHX_ "Search pattern not terminated");
6354 pm = (PMOP*)newPMOP(type, 0);
6355 if (PL_multi_open == '?')
6356 pm->op_pmflags |= PMf_ONCE;
6358 while (*s && strchr("iomsx", *s))
6359 pmflag(&pm->op_pmflags,*s++);
6362 while (*s && strchr("iogcmsx", *s))
6363 pmflag(&pm->op_pmflags,*s++);
6365 /* issue a warning if /c is specified,but /g is not */
6366 if (ckWARN(WARN_REGEXP) &&
6367 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6369 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6372 pm->op_pmpermflags = pm->op_pmflags;
6374 PL_lex_op = (OP*)pm;
6375 yylval.ival = OP_MATCH;
6380 S_scan_subst(pTHX_ char *start)
6387 yylval.ival = OP_NULL;
6389 s = scan_str(start,FALSE,FALSE);
6392 Perl_croak(aTHX_ "Substitution pattern not terminated");
6394 if (s[-1] == PL_multi_open)
6397 first_start = PL_multi_start;
6398 s = scan_str(s,FALSE,FALSE);
6401 SvREFCNT_dec(PL_lex_stuff);
6402 PL_lex_stuff = Nullsv;
6404 Perl_croak(aTHX_ "Substitution replacement not terminated");
6406 PL_multi_start = first_start; /* so whole substitution is taken together */
6408 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6414 else if (strchr("iogcmsx", *s))
6415 pmflag(&pm->op_pmflags,*s++);
6420 /* /c is not meaningful with s/// */
6421 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6423 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6428 PL_sublex_info.super_bufptr = s;
6429 PL_sublex_info.super_bufend = PL_bufend;
6431 pm->op_pmflags |= PMf_EVAL;
6432 repl = newSVpvn("",0);
6434 sv_catpv(repl, es ? "eval " : "do ");
6435 sv_catpvn(repl, "{ ", 2);
6436 sv_catsv(repl, PL_lex_repl);
6437 sv_catpvn(repl, " };", 2);
6439 SvREFCNT_dec(PL_lex_repl);
6443 pm->op_pmpermflags = pm->op_pmflags;
6444 PL_lex_op = (OP*)pm;
6445 yylval.ival = OP_SUBST;
6450 S_scan_trans(pTHX_ char *start)
6459 yylval.ival = OP_NULL;
6461 s = scan_str(start,FALSE,FALSE);
6463 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6464 if (s[-1] == PL_multi_open)
6467 s = scan_str(s,FALSE,FALSE);
6470 SvREFCNT_dec(PL_lex_stuff);
6471 PL_lex_stuff = Nullsv;
6473 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6476 complement = del = squash = 0;
6477 while (strchr("cds", *s)) {
6479 complement = OPpTRANS_COMPLEMENT;
6481 del = OPpTRANS_DELETE;
6483 squash = OPpTRANS_SQUASH;
6487 New(803, tbl, complement&&!del?258:256, short);
6488 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6489 o->op_private &= ~OPpTRANS_ALL;
6490 o->op_private |= del|squash|complement|
6491 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6492 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6495 yylval.ival = OP_TRANS;
6500 S_scan_heredoc(pTHX_ register char *s)
6503 I32 op_type = OP_SCALAR;
6510 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6514 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6517 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6518 if (*peek && strchr("`'\"",*peek)) {
6521 s = delimcpy(d, e, s, PL_bufend, term, &len);
6531 if (!isALNUM_lazy_if(s,UTF))
6532 deprecate_old("bare << to mean <<\"\"");
6533 for (; isALNUM_lazy_if(s,UTF); s++) {
6538 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6539 Perl_croak(aTHX_ "Delimiter for here document is too long");
6542 len = d - PL_tokenbuf;
6543 #ifndef PERL_STRICT_CR
6544 d = strchr(s, '\r');
6548 while (s < PL_bufend) {
6554 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6563 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6568 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6569 herewas = newSVpvn(s,PL_bufend-s);
6571 s--, herewas = newSVpvn(s,d-s);
6572 s += SvCUR(herewas);
6574 tmpstr = NEWSV(87,79);
6575 sv_upgrade(tmpstr, SVt_PVIV);
6580 else if (term == '`') {
6581 op_type = OP_BACKTICK;
6582 SvIVX(tmpstr) = '\\';
6586 PL_multi_start = CopLINE(PL_curcop);
6587 PL_multi_open = PL_multi_close = '<';
6588 term = *PL_tokenbuf;
6589 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6590 char *bufptr = PL_sublex_info.super_bufptr;
6591 char *bufend = PL_sublex_info.super_bufend;
6592 char *olds = s - SvCUR(herewas);
6593 s = strchr(bufptr, '\n');
6597 while (s < bufend &&
6598 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6600 CopLINE_inc(PL_curcop);
6603 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6604 missingterm(PL_tokenbuf);
6606 sv_setpvn(herewas,bufptr,d-bufptr+1);
6607 sv_setpvn(tmpstr,d+1,s-d);
6609 sv_catpvn(herewas,s,bufend-s);
6610 (void)strcpy(bufptr,SvPVX(herewas));
6617 while (s < PL_bufend &&
6618 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6620 CopLINE_inc(PL_curcop);
6622 if (s >= PL_bufend) {
6623 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6624 missingterm(PL_tokenbuf);
6626 sv_setpvn(tmpstr,d+1,s-d);
6628 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6630 sv_catpvn(herewas,s,PL_bufend-s);
6631 sv_setsv(PL_linestr,herewas);
6632 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6633 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6634 PL_last_lop = PL_last_uni = Nullch;
6637 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6638 while (s >= PL_bufend) { /* multiple line string? */
6640 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6641 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6642 missingterm(PL_tokenbuf);
6644 CopLINE_inc(PL_curcop);
6645 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6646 PL_last_lop = PL_last_uni = Nullch;
6647 #ifndef PERL_STRICT_CR
6648 if (PL_bufend - PL_linestart >= 2) {
6649 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6650 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6652 PL_bufend[-2] = '\n';
6654 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6656 else if (PL_bufend[-1] == '\r')
6657 PL_bufend[-1] = '\n';
6659 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6660 PL_bufend[-1] = '\n';
6662 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6663 SV *sv = NEWSV(88,0);
6665 sv_upgrade(sv, SVt_PVMG);
6666 sv_setsv(sv,PL_linestr);
6669 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6671 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6674 sv_catsv(PL_linestr,herewas);
6675 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6679 sv_catsv(tmpstr,PL_linestr);
6684 PL_multi_end = CopLINE(PL_curcop);
6685 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6686 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6687 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6689 SvREFCNT_dec(herewas);
6691 if (UTF && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6693 else if (PL_encoding)
6694 sv_recode_to_utf8(tmpstr, PL_encoding);
6696 PL_lex_stuff = tmpstr;
6697 yylval.ival = op_type;
6702 takes: current position in input buffer
6703 returns: new position in input buffer
6704 side-effects: yylval and lex_op are set.
6709 <FH> read from filehandle
6710 <pkg::FH> read from package qualified filehandle
6711 <pkg'FH> read from package qualified filehandle
6712 <$fh> read from filehandle in $fh
6718 S_scan_inputsymbol(pTHX_ char *start)
6720 register char *s = start; /* current position in buffer */
6726 d = PL_tokenbuf; /* start of temp holding space */
6727 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6728 end = strchr(s, '\n');
6731 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6733 /* die if we didn't have space for the contents of the <>,
6734 or if it didn't end, or if we see a newline
6737 if (len >= sizeof PL_tokenbuf)
6738 Perl_croak(aTHX_ "Excessively long <> operator");
6740 Perl_croak(aTHX_ "Unterminated <> operator");
6745 Remember, only scalar variables are interpreted as filehandles by
6746 this code. Anything more complex (e.g., <$fh{$num}>) will be
6747 treated as a glob() call.
6748 This code makes use of the fact that except for the $ at the front,
6749 a scalar variable and a filehandle look the same.
6751 if (*d == '$' && d[1]) d++;
6753 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6754 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6757 /* If we've tried to read what we allow filehandles to look like, and
6758 there's still text left, then it must be a glob() and not a getline.
6759 Use scan_str to pull out the stuff between the <> and treat it
6760 as nothing more than a string.
6763 if (d - PL_tokenbuf != len) {
6764 yylval.ival = OP_GLOB;
6766 s = scan_str(start,FALSE,FALSE);
6768 Perl_croak(aTHX_ "Glob not terminated");
6772 bool readline_overriden = FALSE;
6773 GV *gv_readline = Nullgv;
6775 /* we're in a filehandle read situation */
6778 /* turn <> into <ARGV> */
6780 (void)strcpy(d,"ARGV");
6782 /* Check whether readline() is overriden */
6783 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6784 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6786 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6787 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6788 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6789 readline_overriden = TRUE;
6791 /* if <$fh>, create the ops to turn the variable into a
6797 /* try to find it in the pad for this block, otherwise find
6798 add symbol table ops
6800 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6801 if (PAD_COMPNAME_FLAGS(tmp) & SVpad_OUR) {
6802 SV *sym = sv_2mortal(
6803 newSVpv(HvNAME(PAD_COMPNAME_OURSTASH(tmp)),0));
6804 sv_catpvn(sym, "::", 2);
6810 OP *o = newOP(OP_PADSV, 0);
6812 PL_lex_op = readline_overriden
6813 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6814 append_elem(OP_LIST, o,
6815 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6816 : (OP*)newUNOP(OP_READLINE, 0, o);
6825 ? (GV_ADDMULTI | GV_ADDINEVAL)
6828 PL_lex_op = readline_overriden
6829 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6830 append_elem(OP_LIST,
6831 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6832 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6833 : (OP*)newUNOP(OP_READLINE, 0,
6834 newUNOP(OP_RV2SV, 0,
6835 newGVOP(OP_GV, 0, gv)));
6837 if (!readline_overriden)
6838 PL_lex_op->op_flags |= OPf_SPECIAL;
6839 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6840 yylval.ival = OP_NULL;
6843 /* If it's none of the above, it must be a literal filehandle
6844 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6846 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6847 PL_lex_op = readline_overriden
6848 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6849 append_elem(OP_LIST,
6850 newGVOP(OP_GV, 0, gv),
6851 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6852 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6853 yylval.ival = OP_NULL;
6862 takes: start position in buffer
6863 keep_quoted preserve \ on the embedded delimiter(s)
6864 keep_delims preserve the delimiters around the string
6865 returns: position to continue reading from buffer
6866 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6867 updates the read buffer.
6869 This subroutine pulls a string out of the input. It is called for:
6870 q single quotes q(literal text)
6871 ' single quotes 'literal text'
6872 qq double quotes qq(interpolate $here please)
6873 " double quotes "interpolate $here please"
6874 qx backticks qx(/bin/ls -l)
6875 ` backticks `/bin/ls -l`
6876 qw quote words @EXPORT_OK = qw( func() $spam )
6877 m// regexp match m/this/
6878 s/// regexp substitute s/this/that/
6879 tr/// string transliterate tr/this/that/
6880 y/// string transliterate y/this/that/
6881 ($*@) sub prototypes sub foo ($)
6882 (stuff) sub attr parameters sub foo : attr(stuff)
6883 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6885 In most of these cases (all but <>, patterns and transliterate)
6886 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6887 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6888 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6891 It skips whitespace before the string starts, and treats the first
6892 character as the delimiter. If the delimiter is one of ([{< then
6893 the corresponding "close" character )]}> is used as the closing
6894 delimiter. It allows quoting of delimiters, and if the string has
6895 balanced delimiters ([{<>}]) it allows nesting.
6897 On success, the SV with the resulting string is put into lex_stuff or,
6898 if that is already non-NULL, into lex_repl. The second case occurs only
6899 when parsing the RHS of the special constructs s/// and tr/// (y///).
6900 For convenience, the terminating delimiter character is stuffed into
6905 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6907 SV *sv; /* scalar value: string */
6908 char *tmps; /* temp string, used for delimiter matching */
6909 register char *s = start; /* current position in the buffer */
6910 register char term; /* terminating character */
6911 register char *to; /* current position in the sv's data */
6912 I32 brackets = 1; /* bracket nesting level */
6913 bool has_utf8 = FALSE; /* is there any utf8 content? */
6914 I32 termcode; /* terminating char. code */
6915 U8 termstr[UTF8_MAXLEN]; /* terminating string */
6916 STRLEN termlen; /* length of terminating string */
6917 char *last = NULL; /* last position for nesting bracket */
6919 /* skip space before the delimiter */
6923 /* mark where we are, in case we need to report errors */
6926 /* after skipping whitespace, the next character is the terminator */
6929 termcode = termstr[0] = term;
6933 termcode = utf8_to_uvchr((U8*)s, &termlen);
6934 Copy(s, termstr, termlen, U8);
6935 if (!UTF8_IS_INVARIANT(term))
6939 /* mark where we are */
6940 PL_multi_start = CopLINE(PL_curcop);
6941 PL_multi_open = term;
6943 /* find corresponding closing delimiter */
6944 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6945 termcode = termstr[0] = term = tmps[5];
6947 PL_multi_close = term;
6949 /* create a new SV to hold the contents. 87 is leak category, I'm
6950 assuming. 79 is the SV's initial length. What a random number. */
6952 sv_upgrade(sv, SVt_PVIV);
6953 SvIVX(sv) = termcode;
6954 (void)SvPOK_only(sv); /* validate pointer */
6956 /* move past delimiter and try to read a complete string */
6958 sv_catpvn(sv, s, termlen);
6961 if (PL_encoding && !UTF) {
6965 int offset = s - SvPVX(PL_linestr);
6966 bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
6967 &offset, (char*)termstr, termlen);
6968 char *ns = SvPVX(PL_linestr) + offset;
6969 char *svlast = SvEND(sv) - 1;
6971 for (; s < ns; s++) {
6972 if (*s == '\n' && !PL_rsfp)
6973 CopLINE_inc(PL_curcop);
6976 goto read_more_line;
6978 /* handle quoted delimiters */
6979 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
6981 for (t = svlast-2; t >= SvPVX(sv) && *t == '\\';)
6983 if ((svlast-1 - t) % 2) {
6987 SvCUR_set(sv, SvCUR(sv) - 1);
6992 if (PL_multi_open == PL_multi_close) {
6999 for (w = t = last; t < svlast; w++, t++) {
7000 /* At here, all closes are "was quoted" one,
7001 so we don't check PL_multi_close. */
7003 if (!keep_quoted && *(t+1) == PL_multi_open)
7008 else if (*t == PL_multi_open)
7016 SvCUR_set(sv, w - SvPVX(sv));
7019 if (--brackets <= 0)
7025 SvCUR_set(sv, SvCUR(sv) - 1);
7031 /* extend sv if need be */
7032 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
7033 /* set 'to' to the next character in the sv's string */
7034 to = SvPVX(sv)+SvCUR(sv);
7036 /* if open delimiter is the close delimiter read unbridle */
7037 if (PL_multi_open == PL_multi_close) {
7038 for (; s < PL_bufend; s++,to++) {
7039 /* embedded newlines increment the current line number */
7040 if (*s == '\n' && !PL_rsfp)
7041 CopLINE_inc(PL_curcop);
7042 /* handle quoted delimiters */
7043 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
7044 if (!keep_quoted && s[1] == term)
7046 /* any other quotes are simply copied straight through */
7050 /* terminate when run out of buffer (the for() condition), or
7051 have found the terminator */
7052 else if (*s == term) {
7055 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
7058 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7064 /* if the terminator isn't the same as the start character (e.g.,
7065 matched brackets), we have to allow more in the quoting, and
7066 be prepared for nested brackets.
7069 /* read until we run out of string, or we find the terminator */
7070 for (; s < PL_bufend; s++,to++) {
7071 /* embedded newlines increment the line count */
7072 if (*s == '\n' && !PL_rsfp)
7073 CopLINE_inc(PL_curcop);
7074 /* backslashes can escape the open or closing characters */
7075 if (*s == '\\' && s+1 < PL_bufend) {
7077 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
7082 /* allow nested opens and closes */
7083 else if (*s == PL_multi_close && --brackets <= 0)
7085 else if (*s == PL_multi_open)
7087 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
7092 /* terminate the copied string and update the sv's end-of-string */
7094 SvCUR_set(sv, to - SvPVX(sv));
7097 * this next chunk reads more into the buffer if we're not done yet
7101 break; /* handle case where we are done yet :-) */
7103 #ifndef PERL_STRICT_CR
7104 if (to - SvPVX(sv) >= 2) {
7105 if ((to[-2] == '\r' && to[-1] == '\n') ||
7106 (to[-2] == '\n' && to[-1] == '\r'))
7110 SvCUR_set(sv, to - SvPVX(sv));
7112 else if (to[-1] == '\r')
7115 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7120 /* if we're out of file, or a read fails, bail and reset the current
7121 line marker so we can report where the unterminated string began
7124 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7126 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7129 /* we read a line, so increment our line counter */
7130 CopLINE_inc(PL_curcop);
7132 /* update debugger info */
7133 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7134 SV *sv = NEWSV(88,0);
7136 sv_upgrade(sv, SVt_PVMG);
7137 sv_setsv(sv,PL_linestr);
7140 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7143 /* having changed the buffer, we must update PL_bufend */
7144 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7145 PL_last_lop = PL_last_uni = Nullch;
7148 /* at this point, we have successfully read the delimited string */
7150 if (!PL_encoding || UTF) {
7152 sv_catpvn(sv, s, termlen);
7155 if (has_utf8 || PL_encoding)
7158 PL_multi_end = CopLINE(PL_curcop);
7160 /* if we allocated too much space, give some back */
7161 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7162 SvLEN_set(sv, SvCUR(sv) + 1);
7163 Renew(SvPVX(sv), SvLEN(sv), char);
7166 /* decide whether this is the first or second quoted string we've read
7179 takes: pointer to position in buffer
7180 returns: pointer to new position in buffer
7181 side-effects: builds ops for the constant in yylval.op
7183 Read a number in any of the formats that Perl accepts:
7185 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7186 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7189 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7191 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7194 If it reads a number without a decimal point or an exponent, it will
7195 try converting the number to an integer and see if it can do so
7196 without loss of precision.
7200 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7202 register char *s = start; /* current position in buffer */
7203 register char *d; /* destination in temp buffer */
7204 register char *e; /* end of temp buffer */
7205 NV nv; /* number read, as a double */
7206 SV *sv = Nullsv; /* place to put the converted number */
7207 bool floatit; /* boolean: int or float? */
7208 char *lastub = 0; /* position of last underbar */
7209 static char number_too_long[] = "Number too long";
7211 /* We use the first character to decide what type of number this is */
7215 Perl_croak(aTHX_ "panic: scan_num");
7217 /* if it starts with a 0, it could be an octal number, a decimal in
7218 0.13 disguise, or a hexadecimal number, or a binary number. */
7222 u holds the "number so far"
7223 shift the power of 2 of the base
7224 (hex == 4, octal == 3, binary == 1)
7225 overflowed was the number more than we can hold?
7227 Shift is used when we add a digit. It also serves as an "are
7228 we in octal/hex/binary?" indicator to disallow hex characters
7234 bool overflowed = FALSE;
7235 bool just_zero = TRUE; /* just plain 0 or binary number? */
7236 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7237 static char* bases[5] = { "", "binary", "", "octal",
7239 static char* Bases[5] = { "", "Binary", "", "Octal",
7241 static char *maxima[5] = { "",
7242 "0b11111111111111111111111111111111",
7246 char *base, *Base, *max;
7253 } else if (s[1] == 'b') {
7258 /* check for a decimal in disguise */
7259 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7261 /* so it must be octal */
7268 if (ckWARN(WARN_SYNTAX))
7269 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7270 "Misplaced _ in number");
7274 base = bases[shift];
7275 Base = Bases[shift];
7276 max = maxima[shift];
7278 /* read the rest of the number */
7280 /* x is used in the overflow test,
7281 b is the digit we're adding on. */
7286 /* if we don't mention it, we're done */
7290 /* _ are ignored -- but warned about if consecutive */
7292 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7293 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7294 "Misplaced _ in number");
7298 /* 8 and 9 are not octal */
7301 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7305 case '2': case '3': case '4':
7306 case '5': case '6': case '7':
7308 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7312 b = *s++ & 15; /* ASCII digit -> value of digit */
7316 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7317 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7318 /* make sure they said 0x */
7323 /* Prepare to put the digit we have onto the end
7324 of the number so far. We check for overflows.
7330 x = u << shift; /* make room for the digit */
7332 if ((x >> shift) != u
7333 && !(PL_hints & HINT_NEW_BINARY)) {
7336 if (ckWARN_d(WARN_OVERFLOW))
7337 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7338 "Integer overflow in %s number",
7341 u = x | b; /* add the digit to the end */
7344 n *= nvshift[shift];
7345 /* If an NV has not enough bits in its
7346 * mantissa to represent an UV this summing of
7347 * small low-order numbers is a waste of time
7348 * (because the NV cannot preserve the
7349 * low-order bits anyway): we could just
7350 * remember when did we overflow and in the
7351 * end just multiply n by the right
7359 /* if we get here, we had success: make a scalar value from
7364 /* final misplaced underbar check */
7366 if (ckWARN(WARN_SYNTAX))
7367 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7372 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7373 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7374 "%s number > %s non-portable",
7380 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7381 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7382 "%s number > %s non-portable",
7387 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
7388 sv = new_constant(start, s - start, "integer",
7390 else if (PL_hints & HINT_NEW_BINARY)
7391 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7396 handle decimal numbers.
7397 we're also sent here when we read a 0 as the first digit
7399 case '1': case '2': case '3': case '4': case '5':
7400 case '6': case '7': case '8': case '9': case '.':
7403 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7406 /* read next group of digits and _ and copy into d */
7407 while (isDIGIT(*s) || *s == '_') {
7408 /* skip underscores, checking for misplaced ones
7412 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7413 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7414 "Misplaced _ in number");
7418 /* check for end of fixed-length buffer */
7420 Perl_croak(aTHX_ number_too_long);
7421 /* if we're ok, copy the character */
7426 /* final misplaced underbar check */
7427 if (lastub && s == lastub + 1) {
7428 if (ckWARN(WARN_SYNTAX))
7429 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7432 /* read a decimal portion if there is one. avoid
7433 3..5 being interpreted as the number 3. followed
7436 if (*s == '.' && s[1] != '.') {
7441 if (ckWARN(WARN_SYNTAX))
7442 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7443 "Misplaced _ in number");
7447 /* copy, ignoring underbars, until we run out of digits.
7449 for (; isDIGIT(*s) || *s == '_'; s++) {
7450 /* fixed length buffer check */
7452 Perl_croak(aTHX_ number_too_long);
7454 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7455 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7456 "Misplaced _ in number");
7462 /* fractional part ending in underbar? */
7464 if (ckWARN(WARN_SYNTAX))
7465 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7466 "Misplaced _ in number");
7468 if (*s == '.' && isDIGIT(s[1])) {
7469 /* oops, it's really a v-string, but without the "v" */
7475 /* read exponent part, if present */
7476 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7480 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7481 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7483 /* stray preinitial _ */
7485 if (ckWARN(WARN_SYNTAX))
7486 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7487 "Misplaced _ in number");
7491 /* allow positive or negative exponent */
7492 if (*s == '+' || *s == '-')
7495 /* stray initial _ */
7497 if (ckWARN(WARN_SYNTAX))
7498 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7499 "Misplaced _ in number");
7503 /* read digits of exponent */
7504 while (isDIGIT(*s) || *s == '_') {
7507 Perl_croak(aTHX_ number_too_long);
7511 if (ckWARN(WARN_SYNTAX) &&
7512 ((lastub && s == lastub + 1) ||
7513 (!isDIGIT(s[1]) && s[1] != '_')))
7514 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7515 "Misplaced _ in number");
7522 /* make an sv from the string */
7526 We try to do an integer conversion first if no characters
7527 indicating "float" have been found.
7532 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7534 if (flags == IS_NUMBER_IN_UV) {
7536 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7539 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7540 if (uv <= (UV) IV_MIN)
7541 sv_setiv(sv, -(IV)uv);
7548 /* terminate the string */
7550 nv = Atof(PL_tokenbuf);
7554 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7555 (PL_hints & HINT_NEW_INTEGER) )
7556 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7557 (floatit ? "float" : "integer"),
7561 /* if it starts with a v, it could be a v-string */
7564 sv = NEWSV(92,5); /* preallocate storage space */
7565 s = scan_vstring(s,sv);
7569 /* make the op for the constant and return */
7572 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7574 lvalp->opval = Nullop;
7580 S_scan_formline(pTHX_ register char *s)
7584 SV *stuff = newSVpvn("",0);
7585 bool needargs = FALSE;
7591 #ifdef PERL_STRICT_CR
7592 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7594 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7596 if (*t == '\n' || t == PL_bufend) {
7601 if (PL_in_eval && !PL_rsfp) {
7602 eol = memchr(s,'\n',PL_bufend-s);
7607 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7609 for (t = s; t < eol; t++) {
7610 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7612 goto enough; /* ~~ must be first line in formline */
7614 if (*t == '@' || *t == '^')
7618 sv_catpvn(stuff, s, eol-s);
7619 #ifndef PERL_STRICT_CR
7620 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7621 char *end = SvPVX(stuff) + SvCUR(stuff);
7633 s = filter_gets(PL_linestr, PL_rsfp, 0);
7634 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7635 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7636 PL_last_lop = PL_last_uni = Nullch;
7648 PL_lex_state = LEX_NORMAL;
7649 PL_nextval[PL_nexttoke].ival = 0;
7653 PL_lex_state = LEX_FORMLINE;
7655 if (UTF && is_utf8_string((U8*)SvPVX(stuff), SvCUR(stuff)))
7657 else if (PL_encoding)
7658 sv_recode_to_utf8(stuff, PL_encoding);
7660 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7662 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7666 SvREFCNT_dec(stuff);
7668 PL_lex_formbrack = 0;
7679 PL_cshlen = strlen(PL_cshname);
7684 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7686 I32 oldsavestack_ix = PL_savestack_ix;
7687 CV* outsidecv = PL_compcv;
7690 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7692 SAVEI32(PL_subline);
7693 save_item(PL_subname);
7694 SAVESPTR(PL_compcv);
7696 PL_compcv = (CV*)NEWSV(1104,0);
7697 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7698 CvFLAGS(PL_compcv) |= flags;
7700 PL_subline = CopLINE(PL_curcop);
7701 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
7702 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7703 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
7705 return oldsavestack_ix;
7709 #pragma segment Perl_yylex
7712 Perl_yywarn(pTHX_ char *s)
7714 PL_in_eval |= EVAL_WARNONLY;
7716 PL_in_eval &= ~EVAL_WARNONLY;
7721 Perl_yyerror(pTHX_ char *s)
7724 char *context = NULL;
7728 if (!yychar || (yychar == ';' && !PL_rsfp))
7730 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7731 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7734 The code below is removed for NetWare because it abends/crashes on NetWare
7735 when the script has error such as not having the closing quotes like:
7737 Checking of white spaces is anyway done in NetWare code.
7740 while (isSPACE(*PL_oldoldbufptr))
7743 context = PL_oldoldbufptr;
7744 contlen = PL_bufptr - PL_oldoldbufptr;
7746 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7747 PL_oldbufptr != PL_bufptr) {
7750 The code below is removed for NetWare because it abends/crashes on NetWare
7751 when the script has error such as not having the closing quotes like:
7753 Checking of white spaces is anyway done in NetWare code.
7756 while (isSPACE(*PL_oldbufptr))
7759 context = PL_oldbufptr;
7760 contlen = PL_bufptr - PL_oldbufptr;
7762 else if (yychar > 255)
7763 where = "next token ???";
7764 else if (yychar == -2) { /* YYEMPTY */
7765 if (PL_lex_state == LEX_NORMAL ||
7766 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7767 where = "at end of line";
7768 else if (PL_lex_inpat)
7769 where = "within pattern";
7771 where = "within string";
7774 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7776 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7777 else if (isPRINT_LC(yychar))
7778 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7780 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7781 where = SvPVX(where_sv);
7783 msg = sv_2mortal(newSVpv(s, 0));
7784 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7785 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7787 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7789 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7790 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7791 Perl_sv_catpvf(aTHX_ msg,
7792 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7793 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7796 if (PL_in_eval & EVAL_WARNONLY && ckWARN_d(WARN_SYNTAX))
7797 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, msg);
7800 if (PL_error_count >= 10) {
7801 if (PL_in_eval && SvCUR(ERRSV))
7802 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7803 ERRSV, OutCopFILE(PL_curcop));
7805 Perl_croak(aTHX_ "%s has too many errors.\n",
7806 OutCopFILE(PL_curcop));
7809 PL_in_my_stash = Nullhv;
7813 #pragma segment Main
7817 S_swallow_bom(pTHX_ U8 *s)
7820 slen = SvCUR(PL_linestr);
7824 /* UTF-16 little-endian */
7825 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7826 Perl_croak(aTHX_ "Unsupported script encoding");
7827 #ifndef PERL_NO_UTF16_FILTER
7828 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7830 if (PL_bufend > (char*)s) {
7834 filter_add(utf16rev_textfilter, NULL);
7835 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7836 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7837 PL_bufend - (char*)s - 1,
7839 Copy(news, s, newlen, U8);
7840 SvCUR_set(PL_linestr, newlen);
7841 PL_bufend = SvPVX(PL_linestr) + newlen;
7842 news[newlen++] = '\0';
7846 Perl_croak(aTHX_ "Unsupported script encoding");
7851 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7852 #ifndef PERL_NO_UTF16_FILTER
7853 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7855 if (PL_bufend > (char *)s) {
7859 filter_add(utf16_textfilter, NULL);
7860 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7861 PL_bufend = (char*)utf16_to_utf8(s, news,
7862 PL_bufend - (char*)s,
7864 Copy(news, s, newlen, U8);
7865 SvCUR_set(PL_linestr, newlen);
7866 PL_bufend = SvPVX(PL_linestr) + newlen;
7867 news[newlen++] = '\0';
7871 Perl_croak(aTHX_ "Unsupported script encoding");
7876 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7877 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7882 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7883 s[2] == 0xFE && s[3] == 0xFF)
7885 Perl_croak(aTHX_ "Unsupported script encoding");
7893 * Restore a source filter.
7897 restore_rsfp(pTHX_ void *f)
7899 PerlIO *fp = (PerlIO*)f;
7901 if (PL_rsfp == PerlIO_stdin())
7902 PerlIO_clearerr(PL_rsfp);
7903 else if (PL_rsfp && (PL_rsfp != fp))
7904 PerlIO_close(PL_rsfp);
7908 #ifndef PERL_NO_UTF16_FILTER
7910 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7912 I32 count = FILTER_READ(idx+1, sv, maxlen);
7917 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7918 if (!*SvPV_nolen(sv))
7919 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7922 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7923 sv_usepvn(sv, (char*)tmps, tend - tmps);
7929 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7931 I32 count = FILTER_READ(idx+1, sv, maxlen);
7936 if (!*SvPV_nolen(sv))
7937 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7940 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7941 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7942 sv_usepvn(sv, (char*)tmps, tend - tmps);
7949 Returns a pointer to the next character after the parsed
7950 vstring, as well as updating the passed in sv.
7952 Function must be called like
7955 s = scan_vstring(s,sv);
7957 The sv should already be large enough to store the vstring
7958 passed in, for performance reasons.
7963 Perl_scan_vstring(pTHX_ char *s, SV *sv)
7967 if (*pos == 'v') pos++; /* get past 'v' */
7968 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
7971 /* this may not be a v-string if followed by => */
7973 while (next < PL_bufend && isSPACE(*next))
7975 if ((PL_bufend - next) >= 2 && *next == '=' && next[1] == '>' ) {
7976 /* return string not v-string */
7977 sv_setpvn(sv,(char *)s,pos-s);
7982 if (!isALPHA(*pos)) {
7984 U8 tmpbuf[UTF8_MAXLEN+1];
7987 if (*s == 'v') s++; /* get past 'v' */
7989 sv_setpvn(sv, "", 0);
7994 /* this is atoi() that tolerates underscores */
7997 while (--end >= s) {
8002 rev += (*end - '0') * mult;
8004 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
8005 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
8006 "Integer overflow in decimal number");
8010 if (rev > 0x7FFFFFFF)
8011 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
8013 /* Append native character for the rev point */
8014 tmpend = uvchr_to_utf8(tmpbuf, rev);
8015 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
8016 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
8018 if (pos + 1 < PL_bufend && *pos == '.' && isDIGIT(pos[1]))
8024 while (pos < PL_bufend && (isDIGIT(*pos) || *pos == '_'))
8028 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);