3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "It all comes from here, the stench and the peril." --Frodo
15 * This file is the lexer for Perl. It's closely linked to the
18 * The main routine is yylex(), which returns the next token.
22 #define PERL_IN_TOKE_C
25 #define yychar PL_yychar
26 #define yylval PL_yylval
28 static char ident_too_long[] = "Identifier too long";
29 static char c_without_g[] = "Use of /c modifier is meaningless without /g";
30 static char c_in_subst[] = "Use of /c modifier is meaningless in s///";
32 static void restore_rsfp(pTHX_ void *f);
33 #ifndef PERL_NO_UTF16_FILTER
34 static I32 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen);
35 static I32 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen);
38 #define XFAKEBRACK 128
41 #ifdef USE_UTF8_SCRIPTS
42 # define UTF (!IN_BYTES)
44 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
47 /* In variables named $^X, these are the legal values for X.
48 * 1999-02-27 mjd-perl-patch@plover.com */
49 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
51 /* On MacOS, respect nonbreaking spaces */
52 #ifdef MACOS_TRADITIONAL
53 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
55 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
58 /* LEX_* are values for PL_lex_state, the state of the lexer.
59 * They are arranged oddly so that the guard on the switch statement
60 * can get by with a single comparison (if the compiler is smart enough).
63 /* #define LEX_NOTPARSING 11 is done in perl.h. */
66 #define LEX_INTERPNORMAL 9
67 #define LEX_INTERPCASEMOD 8
68 #define LEX_INTERPPUSH 7
69 #define LEX_INTERPSTART 6
70 #define LEX_INTERPEND 5
71 #define LEX_INTERPENDMAYBE 4
72 #define LEX_INTERPCONCAT 3
73 #define LEX_INTERPCONST 2
74 #define LEX_FORMLINE 1
75 #define LEX_KNOWNEXT 0
83 # define YYMAXLEVEL 100
85 YYSTYPE* yylval_pointer[YYMAXLEVEL];
86 int* yychar_pointer[YYMAXLEVEL];
90 # define yylval (*yylval_pointer[yyactlevel])
91 # define yychar (*yychar_pointer[yyactlevel])
92 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
94 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
99 /* CLINE is a macro that ensures PL_copline has a sane value */
104 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
107 * Convenience functions to return different tokens and prime the
108 * lexer for the next token. They all take an argument.
110 * TOKEN : generic token (used for '(', DOLSHARP, etc)
111 * OPERATOR : generic operator
112 * AOPERATOR : assignment operator
113 * PREBLOCK : beginning the block after an if, while, foreach, ...
114 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
115 * PREREF : *EXPR where EXPR is not a simple identifier
116 * TERM : expression term
117 * LOOPX : loop exiting command (goto, last, dump, etc)
118 * FTST : file test operator
119 * FUN0 : zero-argument function
120 * FUN1 : not used, except for not, which isn't a UNIOP
121 * BOop : bitwise or or xor
123 * SHop : shift operator
124 * PWop : power operator
125 * PMop : pattern-matching operator
126 * Aop : addition-level operator
127 * Mop : multiplication-level operator
128 * Eop : equality-testing operator
129 * Rop : relational operator <= != gt
131 * Also see LOP and lop() below.
134 /* Note that REPORT() and REPORT2() will be expressions that supply
135 * their own trailing comma, not suitable for statements as such. */
136 #ifdef DEBUGGING /* Serve -DT. */
137 # define REPORT(x,retval) tokereport(x,s,(int)retval),
138 # define REPORT2(x,retval) tokereport(x,s, yylval.ival),
140 # define REPORT(x,retval)
141 # define REPORT2(x,retval)
144 #define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
145 #define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
146 #define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
147 #define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
148 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
149 #define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
150 #define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
151 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
152 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERMORDORDOR,PL_bufptr = s,(int)UNIOP)
153 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
154 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
155 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
156 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
157 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
158 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
159 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
160 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
161 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
162 #define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
163 #define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
165 /* This bit of chicanery makes a unary function followed by
166 * a parenthesis into a function with one argument, highest precedence.
167 * The UNIDOR macro is for unary functions that can be followed by the //
168 * operator (such as C<shift // 0>).
170 #define UNI2(f,x) return(yylval.ival = f, \
174 PL_last_uni = PL_oldbufptr, \
175 PL_last_lop_op = f, \
176 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
177 #define UNI(f) UNI2(f,XTERM)
178 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
180 #define UNIBRACK(f) return(yylval.ival = f, \
183 PL_last_uni = PL_oldbufptr, \
184 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
186 /* grandfather return to old style */
187 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
192 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
195 SV* report = newSVpv(thing, 0);
196 Perl_sv_catpvf(aTHX_ report, ":line %d:%"IVdf":", CopLINE(PL_curcop),
199 if (s - PL_bufptr > 0)
200 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
202 if (PL_oldbufptr && *PL_oldbufptr)
203 sv_catpv(report, PL_tokenbuf);
205 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
214 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
215 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
219 S_ao(pTHX_ int toketype)
221 if (*PL_bufptr == '=') {
223 if (toketype == ANDAND)
224 yylval.ival = OP_ANDASSIGN;
225 else if (toketype == OROR)
226 yylval.ival = OP_ORASSIGN;
227 else if (toketype == DORDOR)
228 yylval.ival = OP_DORASSIGN;
236 * When Perl expects an operator and finds something else, no_op
237 * prints the warning. It always prints "<something> found where
238 * operator expected. It prints "Missing semicolon on previous line?"
239 * if the surprise occurs at the start of the line. "do you need to
240 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
241 * where the compiler doesn't know if foo is a method call or a function.
242 * It prints "Missing operator before end of line" if there's nothing
243 * after the missing operator, or "... before <...>" if there is something
244 * after the missing operator.
248 S_no_op(pTHX_ char *what, char *s)
250 char *oldbp = PL_bufptr;
251 bool is_first = (PL_oldbufptr == PL_linestart);
257 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
259 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
260 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
262 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
263 if (t < PL_bufptr && isSPACE(*t))
264 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
265 t - PL_oldoldbufptr, PL_oldoldbufptr);
269 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
276 * Complain about missing quote/regexp/heredoc terminator.
277 * If it's called with (char *)NULL then it cauterizes the line buffer.
278 * If we're in a delimited string and the delimiter is a control
279 * character, it's reformatted into a two-char sequence like ^C.
284 S_missingterm(pTHX_ char *s)
289 char *nl = strrchr(s,'\n');
295 iscntrl(PL_multi_close)
297 PL_multi_close < 32 || PL_multi_close == 127
301 tmpbuf[1] = toCTRL(PL_multi_close);
307 *tmpbuf = (char)PL_multi_close;
311 q = strchr(s,'"') ? '\'' : '"';
312 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
320 Perl_deprecate(pTHX_ char *s)
322 if (ckWARN(WARN_DEPRECATED))
323 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED), "Use of %s is deprecated", s);
327 Perl_deprecate_old(pTHX_ char *s)
329 /* This function should NOT be called for any new deprecated warnings */
330 /* Use Perl_deprecate instead */
332 /* It is here to maintain backward compatibility with the pre-5.8 */
333 /* warnings category hierarchy. The "deprecated" category used to */
334 /* live under the "syntax" category. It is now a top-level category */
335 /* in its own right. */
337 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
338 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
339 "Use of %s is deprecated", s);
344 * Deprecate a comma-less variable list.
350 deprecate_old("comma-less variable list");
354 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
355 * utf16-to-utf8-reversed.
358 #ifdef PERL_CR_FILTER
362 register char *s = SvPVX(sv);
363 register char *e = s + SvCUR(sv);
364 /* outer loop optimized to do nothing if there are no CR-LFs */
366 if (*s++ == '\r' && *s == '\n') {
367 /* hit a CR-LF, need to copy the rest */
368 register char *d = s - 1;
371 if (*s == '\r' && s[1] == '\n')
382 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
384 I32 count = FILTER_READ(idx+1, sv, maxlen);
385 if (count > 0 && !maxlen)
393 * Initialize variables. Uses the Perl save_stack to save its state (for
394 * recursive calls to the parser).
398 Perl_lex_start(pTHX_ SV *line)
403 SAVEI32(PL_lex_dojoin);
404 SAVEI32(PL_lex_brackets);
405 SAVEI32(PL_lex_casemods);
406 SAVEI32(PL_lex_starts);
407 SAVEI32(PL_lex_state);
408 SAVEVPTR(PL_lex_inpat);
409 SAVEI32(PL_lex_inwhat);
410 if (PL_lex_state == LEX_KNOWNEXT) {
411 I32 toke = PL_nexttoke;
412 while (--toke >= 0) {
413 SAVEI32(PL_nexttype[toke]);
414 SAVEVPTR(PL_nextval[toke]);
416 SAVEI32(PL_nexttoke);
418 SAVECOPLINE(PL_curcop);
421 SAVEPPTR(PL_oldbufptr);
422 SAVEPPTR(PL_oldoldbufptr);
423 SAVEPPTR(PL_last_lop);
424 SAVEPPTR(PL_last_uni);
425 SAVEPPTR(PL_linestart);
426 SAVESPTR(PL_linestr);
427 SAVEPPTR(PL_lex_brackstack);
428 SAVEPPTR(PL_lex_casestack);
429 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
430 SAVESPTR(PL_lex_stuff);
431 SAVEI32(PL_lex_defer);
432 SAVEI32(PL_sublex_info.sub_inwhat);
433 SAVESPTR(PL_lex_repl);
435 SAVEINT(PL_lex_expect);
437 PL_lex_state = LEX_NORMAL;
441 New(899, PL_lex_brackstack, 120, char);
442 New(899, PL_lex_casestack, 12, char);
443 SAVEFREEPV(PL_lex_brackstack);
444 SAVEFREEPV(PL_lex_casestack);
446 *PL_lex_casestack = '\0';
449 PL_lex_stuff = Nullsv;
450 PL_lex_repl = Nullsv;
454 PL_sublex_info.sub_inwhat = 0;
456 if (SvREADONLY(PL_linestr))
457 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
458 s = SvPV(PL_linestr, len);
459 if (!len || s[len-1] != ';') {
460 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
461 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
462 sv_catpvn(PL_linestr, "\n;", 2);
464 SvTEMP_off(PL_linestr);
465 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
466 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
467 PL_last_lop = PL_last_uni = Nullch;
473 * Finalizer for lexing operations. Must be called when the parser is
474 * done with the lexer.
480 PL_doextract = FALSE;
485 * This subroutine has nothing to do with tilting, whether at windmills
486 * or pinball tables. Its name is short for "increment line". It
487 * increments the current line number in CopLINE(PL_curcop) and checks
488 * to see whether the line starts with a comment of the form
489 * # line 500 "foo.pm"
490 * If so, it sets the current line number and file to the values in the comment.
494 S_incline(pTHX_ char *s)
501 CopLINE_inc(PL_curcop);
504 while (SPACE_OR_TAB(*s)) s++;
505 if (strnEQ(s, "line", 4))
509 if (SPACE_OR_TAB(*s))
513 while (SPACE_OR_TAB(*s)) s++;
519 while (SPACE_OR_TAB(*s))
521 if (*s == '"' && (t = strchr(s+1, '"'))) {
526 for (t = s; !isSPACE(*t); t++) ;
529 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
531 if (*e != '\n' && *e != '\0')
532 return; /* false alarm */
537 CopFILE_free(PL_curcop);
538 CopFILE_set(PL_curcop, s);
541 CopLINE_set(PL_curcop, atoi(n)-1);
546 * Called to gobble the appropriate amount and type of whitespace.
547 * Skips comments as well.
551 S_skipspace(pTHX_ register char *s)
553 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
554 while (s < PL_bufend && SPACE_OR_TAB(*s))
560 SSize_t oldprevlen, oldoldprevlen;
561 SSize_t oldloplen = 0, oldunilen = 0;
562 while (s < PL_bufend && isSPACE(*s)) {
563 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
568 if (s < PL_bufend && *s == '#') {
569 while (s < PL_bufend && *s != '\n')
573 if (PL_in_eval && !PL_rsfp) {
580 /* only continue to recharge the buffer if we're at the end
581 * of the buffer, we're not reading from a source filter, and
582 * we're in normal lexing mode
584 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
585 PL_lex_state == LEX_FORMLINE)
588 /* try to recharge the buffer */
589 if ((s = filter_gets(PL_linestr, PL_rsfp,
590 (prevlen = SvCUR(PL_linestr)))) == Nullch)
592 /* end of file. Add on the -p or -n magic */
593 if (PL_minus_n || PL_minus_p) {
594 sv_setpv(PL_linestr,PL_minus_p ?
595 ";}continue{print or die qq(-p destination: $!\\n)" :
597 sv_catpv(PL_linestr,";}");
598 PL_minus_n = PL_minus_p = 0;
601 sv_setpv(PL_linestr,";");
603 /* reset variables for next time we lex */
604 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
606 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
607 PL_last_lop = PL_last_uni = Nullch;
609 /* Close the filehandle. Could be from -P preprocessor,
610 * STDIN, or a regular file. If we were reading code from
611 * STDIN (because the commandline held no -e or filename)
612 * then we don't close it, we reset it so the code can
613 * read from STDIN too.
616 if (PL_preprocess && !PL_in_eval)
617 (void)PerlProc_pclose(PL_rsfp);
618 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
619 PerlIO_clearerr(PL_rsfp);
621 (void)PerlIO_close(PL_rsfp);
626 /* not at end of file, so we only read another line */
627 /* make corresponding updates to old pointers, for yyerror() */
628 oldprevlen = PL_oldbufptr - PL_bufend;
629 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
631 oldunilen = PL_last_uni - PL_bufend;
633 oldloplen = PL_last_lop - PL_bufend;
634 PL_linestart = PL_bufptr = s + prevlen;
635 PL_bufend = s + SvCUR(PL_linestr);
637 PL_oldbufptr = s + oldprevlen;
638 PL_oldoldbufptr = s + oldoldprevlen;
640 PL_last_uni = s + oldunilen;
642 PL_last_lop = s + oldloplen;
645 /* debugger active and we're not compiling the debugger code,
646 * so store the line into the debugger's array of lines
648 if (PERLDB_LINE && PL_curstash != PL_debstash) {
649 SV *sv = NEWSV(85,0);
651 sv_upgrade(sv, SVt_PVMG);
652 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
655 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
662 * Check the unary operators to ensure there's no ambiguity in how they're
663 * used. An ambiguous piece of code would be:
665 * This doesn't mean rand() + 5. Because rand() is a unary operator,
666 * the +5 is its argument.
675 if (PL_oldoldbufptr != PL_last_uni)
677 while (isSPACE(*PL_last_uni))
679 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
680 if ((t = strchr(s, '(')) && t < PL_bufptr)
682 if (ckWARN_d(WARN_AMBIGUOUS)){
685 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
686 "Warning: Use of \"%s\" without parens is ambiguous",
693 * LOP : macro to build a list operator. Its behaviour has been replaced
694 * with a subroutine, S_lop() for which LOP is just another name.
697 #define LOP(f,x) return lop(f,x,s)
701 * Build a list operator (or something that might be one). The rules:
702 * - if we have a next token, then it's a list operator [why?]
703 * - if the next thing is an opening paren, then it's a function
704 * - else it's a list operator
708 S_lop(pTHX_ I32 f, int x, char *s)
715 PL_last_lop = PL_oldbufptr;
716 PL_last_lop_op = (OPCODE)f;
730 * When the lexer realizes it knows the next token (for instance,
731 * it is reordering tokens for the parser) then it can call S_force_next
732 * to know what token to return the next time the lexer is called. Caller
733 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
734 * handles the token correctly.
738 S_force_next(pTHX_ I32 type)
740 PL_nexttype[PL_nexttoke] = type;
742 if (PL_lex_state != LEX_KNOWNEXT) {
743 PL_lex_defer = PL_lex_state;
744 PL_lex_expect = PL_expect;
745 PL_lex_state = LEX_KNOWNEXT;
751 * When the lexer knows the next thing is a word (for instance, it has
752 * just seen -> and it knows that the next char is a word char, then
753 * it calls S_force_word to stick the next word into the PL_next lookahead.
756 * char *start : buffer position (must be within PL_linestr)
757 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
758 * int check_keyword : if true, Perl checks to make sure the word isn't
759 * a keyword (do this if the word is a label, e.g. goto FOO)
760 * int allow_pack : if true, : characters will also be allowed (require,
762 * int allow_initial_tick : used by the "sub" lexer only.
766 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
771 start = skipspace(start);
773 if (isIDFIRST_lazy_if(s,UTF) ||
774 (allow_pack && *s == ':') ||
775 (allow_initial_tick && *s == '\'') )
777 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
778 if (check_keyword && keyword(PL_tokenbuf, len))
780 if (token == METHOD) {
785 PL_expect = XOPERATOR;
788 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
789 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
797 * Called when the lexer wants $foo *foo &foo etc, but the program
798 * text only contains the "foo" portion. The first argument is a pointer
799 * to the "foo", and the second argument is the type symbol to prefix.
800 * Forces the next token to be a "WORD".
801 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
805 S_force_ident(pTHX_ register char *s, int kind)
808 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
809 PL_nextval[PL_nexttoke].opval = o;
812 o->op_private = OPpCONST_ENTERED;
813 /* XXX see note in pp_entereval() for why we forgo typo
814 warnings if the symbol must be introduced in an eval.
816 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
817 kind == '$' ? SVt_PV :
818 kind == '@' ? SVt_PVAV :
819 kind == '%' ? SVt_PVHV :
827 Perl_str_to_version(pTHX_ SV *sv)
832 char *start = SvPVx(sv,len);
833 bool utf = SvUTF8(sv) ? TRUE : FALSE;
834 char *end = start + len;
835 while (start < end) {
839 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
844 retval += ((NV)n)/nshift;
853 * Forces the next token to be a version number.
854 * If the next token appears to be an invalid version number, (e.g. "v2b"),
855 * and if "guessing" is TRUE, then no new token is created (and the caller
856 * must use an alternative parsing method).
860 S_force_version(pTHX_ char *s, int guessing)
862 OP *version = Nullop;
871 while (isDIGIT(*d) || *d == '_' || *d == '.')
873 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
875 s = scan_num(s, &yylval);
876 version = yylval.opval;
877 ver = cSVOPx(version)->op_sv;
878 if (SvPOK(ver) && !SvNIOK(ver)) {
879 (void)SvUPGRADE(ver, SVt_PVNV);
880 SvNVX(ver) = str_to_version(ver);
881 SvNOK_on(ver); /* hint that it is a version */
888 /* NOTE: The parser sees the package name and the VERSION swapped */
889 PL_nextval[PL_nexttoke].opval = version;
897 * Tokenize a quoted string passed in as an SV. It finds the next
898 * chunk, up to end of string or a backslash. It may make a new
899 * SV containing that chunk (if HINT_NEW_STRING is on). It also
904 S_tokeq(pTHX_ SV *sv)
915 s = SvPV_force(sv, len);
916 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
919 while (s < send && *s != '\\')
924 if ( PL_hints & HINT_NEW_STRING ) {
925 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
931 if (s + 1 < send && (s[1] == '\\'))
932 s++; /* all that, just for this */
937 SvCUR_set(sv, d - SvPVX(sv));
939 if ( PL_hints & HINT_NEW_STRING )
940 return new_constant(NULL, 0, "q", sv, pv, "q");
945 * Now come three functions related to double-quote context,
946 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
947 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
948 * interact with PL_lex_state, and create fake ( ... ) argument lists
949 * to handle functions and concatenation.
950 * They assume that whoever calls them will be setting up a fake
951 * join call, because each subthing puts a ',' after it. This lets
954 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
956 * (I'm not sure whether the spurious commas at the end of lcfirst's
957 * arguments and join's arguments are created or not).
962 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
964 * Pattern matching will set PL_lex_op to the pattern-matching op to
965 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
967 * OP_CONST and OP_READLINE are easy--just make the new op and return.
969 * Everything else becomes a FUNC.
971 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
972 * had an OP_CONST or OP_READLINE). This just sets us up for a
973 * call to S_sublex_push().
979 register I32 op_type = yylval.ival;
981 if (op_type == OP_NULL) {
982 yylval.opval = PL_lex_op;
986 if (op_type == OP_CONST || op_type == OP_READLINE) {
987 SV *sv = tokeq(PL_lex_stuff);
989 if (SvTYPE(sv) == SVt_PVIV) {
990 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
996 nsv = newSVpvn(p, len);
1002 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
1003 PL_lex_stuff = Nullsv;
1004 /* Allow <FH> // "foo" */
1005 if (op_type == OP_READLINE)
1006 PL_expect = XTERMORDORDOR;
1010 PL_sublex_info.super_state = PL_lex_state;
1011 PL_sublex_info.sub_inwhat = op_type;
1012 PL_sublex_info.sub_op = PL_lex_op;
1013 PL_lex_state = LEX_INTERPPUSH;
1017 yylval.opval = PL_lex_op;
1027 * Create a new scope to save the lexing state. The scope will be
1028 * ended in S_sublex_done. Returns a '(', starting the function arguments
1029 * to the uc, lc, etc. found before.
1030 * Sets PL_lex_state to LEX_INTERPCONCAT.
1038 PL_lex_state = PL_sublex_info.super_state;
1039 SAVEI32(PL_lex_dojoin);
1040 SAVEI32(PL_lex_brackets);
1041 SAVEI32(PL_lex_casemods);
1042 SAVEI32(PL_lex_starts);
1043 SAVEI32(PL_lex_state);
1044 SAVEVPTR(PL_lex_inpat);
1045 SAVEI32(PL_lex_inwhat);
1046 SAVECOPLINE(PL_curcop);
1047 SAVEPPTR(PL_bufptr);
1048 SAVEPPTR(PL_bufend);
1049 SAVEPPTR(PL_oldbufptr);
1050 SAVEPPTR(PL_oldoldbufptr);
1051 SAVEPPTR(PL_last_lop);
1052 SAVEPPTR(PL_last_uni);
1053 SAVEPPTR(PL_linestart);
1054 SAVESPTR(PL_linestr);
1055 SAVEPPTR(PL_lex_brackstack);
1056 SAVEPPTR(PL_lex_casestack);
1058 PL_linestr = PL_lex_stuff;
1059 PL_lex_stuff = Nullsv;
1061 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1062 = SvPVX(PL_linestr);
1063 PL_bufend += SvCUR(PL_linestr);
1064 PL_last_lop = PL_last_uni = Nullch;
1065 SAVEFREESV(PL_linestr);
1067 PL_lex_dojoin = FALSE;
1068 PL_lex_brackets = 0;
1069 New(899, PL_lex_brackstack, 120, char);
1070 New(899, PL_lex_casestack, 12, char);
1071 SAVEFREEPV(PL_lex_brackstack);
1072 SAVEFREEPV(PL_lex_casestack);
1073 PL_lex_casemods = 0;
1074 *PL_lex_casestack = '\0';
1076 PL_lex_state = LEX_INTERPCONCAT;
1077 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
1079 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1080 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1081 PL_lex_inpat = PL_sublex_info.sub_op;
1083 PL_lex_inpat = Nullop;
1090 * Restores lexer state after a S_sublex_push.
1096 if (!PL_lex_starts++) {
1097 SV *sv = newSVpvn("",0);
1098 if (SvUTF8(PL_linestr))
1100 PL_expect = XOPERATOR;
1101 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1105 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1106 PL_lex_state = LEX_INTERPCASEMOD;
1110 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1111 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1112 PL_linestr = PL_lex_repl;
1114 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1115 PL_bufend += SvCUR(PL_linestr);
1116 PL_last_lop = PL_last_uni = Nullch;
1117 SAVEFREESV(PL_linestr);
1118 PL_lex_dojoin = FALSE;
1119 PL_lex_brackets = 0;
1120 PL_lex_casemods = 0;
1121 *PL_lex_casestack = '\0';
1123 if (SvEVALED(PL_lex_repl)) {
1124 PL_lex_state = LEX_INTERPNORMAL;
1126 /* we don't clear PL_lex_repl here, so that we can check later
1127 whether this is an evalled subst; that means we rely on the
1128 logic to ensure sublex_done() is called again only via the
1129 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1132 PL_lex_state = LEX_INTERPCONCAT;
1133 PL_lex_repl = Nullsv;
1139 PL_bufend = SvPVX(PL_linestr);
1140 PL_bufend += SvCUR(PL_linestr);
1141 PL_expect = XOPERATOR;
1142 PL_sublex_info.sub_inwhat = 0;
1150 Extracts a pattern, double-quoted string, or transliteration. This
1153 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1154 processing a pattern (PL_lex_inpat is true), a transliteration
1155 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1157 Returns a pointer to the character scanned up to. Iff this is
1158 advanced from the start pointer supplied (ie if anything was
1159 successfully parsed), will leave an OP for the substring scanned
1160 in yylval. Caller must intuit reason for not parsing further
1161 by looking at the next characters herself.
1165 double-quoted style: \r and \n
1166 regexp special ones: \D \s
1168 backrefs: \1 (deprecated in substitution replacements)
1169 case and quoting: \U \Q \E
1170 stops on @ and $, but not for $ as tail anchor
1172 In transliterations:
1173 characters are VERY literal, except for - not at the start or end
1174 of the string, which indicates a range. scan_const expands the
1175 range to the full set of intermediate characters.
1177 In double-quoted strings:
1179 double-quoted style: \r and \n
1181 backrefs: \1 (deprecated)
1182 case and quoting: \U \Q \E
1185 scan_const does *not* construct ops to handle interpolated strings.
1186 It stops processing as soon as it finds an embedded $ or @ variable
1187 and leaves it to the caller to work out what's going on.
1189 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @::foo.
1191 $ in pattern could be $foo or could be tail anchor. Assumption:
1192 it's a tail anchor if $ is the last thing in the string, or if it's
1193 followed by one of ")| \n\t"
1195 \1 (backreferences) are turned into $1
1197 The structure of the code is
1198 while (there's a character to process) {
1199 handle transliteration ranges
1200 skip regexp comments
1201 skip # initiated comments in //x patterns
1202 check for embedded @foo
1203 check for embedded scalars
1205 leave intact backslashes from leave (below)
1206 deprecate \1 in strings and sub replacements
1207 handle string-changing backslashes \l \U \Q \E, etc.
1208 switch (what was escaped) {
1209 handle - in a transliteration (becomes a literal -)
1210 handle \132 octal characters
1211 handle 0x15 hex characters
1212 handle \cV (control V)
1213 handle printf backslashes (\f, \r, \n, etc)
1215 } (end if backslash)
1216 } (end while character to read)
1221 S_scan_const(pTHX_ char *start)
1223 register char *send = PL_bufend; /* end of the constant */
1224 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1225 register char *s = start; /* start of the constant */
1226 register char *d = SvPVX(sv); /* destination for copies */
1227 bool dorange = FALSE; /* are we in a translit range? */
1228 bool didrange = FALSE; /* did we just finish a range? */
1229 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
1230 I32 this_utf8 = UTF; /* The source string is assumed to be UTF8 */
1233 const char *leaveit = /* set of acceptably-backslashed characters */
1235 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1238 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1239 /* If we are doing a trans and we know we want UTF8 set expectation */
1240 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
1241 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1245 while (s < send || dorange) {
1246 /* get transliterations out of the way (they're most literal) */
1247 if (PL_lex_inwhat == OP_TRANS) {
1248 /* expand a range A-Z to the full set of characters. AIE! */
1250 I32 i; /* current expanded character */
1251 I32 min; /* first character in range */
1252 I32 max; /* last character in range */
1255 char *c = (char*)utf8_hop((U8*)d, -1);
1259 *c = (char)UTF_TO_NATIVE(0xff);
1260 /* mark the range as done, and continue */
1266 i = d - SvPVX(sv); /* remember current offset */
1267 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1268 d = SvPVX(sv) + i; /* refresh d after realloc */
1269 d -= 2; /* eat the first char and the - */
1271 min = (U8)*d; /* first char in range */
1272 max = (U8)d[1]; /* last char in range */
1276 "Invalid [] range \"%c-%c\" in transliteration operator",
1277 (char)min, (char)max);
1281 if ((isLOWER(min) && isLOWER(max)) ||
1282 (isUPPER(min) && isUPPER(max))) {
1284 for (i = min; i <= max; i++)
1286 *d++ = NATIVE_TO_NEED(has_utf8,i);
1288 for (i = min; i <= max; i++)
1290 *d++ = NATIVE_TO_NEED(has_utf8,i);
1295 for (i = min; i <= max; i++)
1298 /* mark the range as done, and continue */
1304 /* range begins (ignore - as first or last char) */
1305 else if (*s == '-' && s+1 < send && s != start) {
1307 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1310 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
1322 /* if we get here, we're not doing a transliteration */
1324 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1325 except for the last char, which will be done separately. */
1326 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1328 while (s < send && *s != ')')
1329 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1331 else if (s[2] == '{' /* This should match regcomp.c */
1332 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1335 char *regparse = s + (s[2] == '{' ? 3 : 4);
1338 while (count && (c = *regparse)) {
1339 if (c == '\\' && regparse[1])
1347 if (*regparse != ')') {
1348 regparse--; /* Leave one char for continuation. */
1349 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1351 while (s < regparse)
1352 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1356 /* likewise skip #-initiated comments in //x patterns */
1357 else if (*s == '#' && PL_lex_inpat &&
1358 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1359 while (s+1 < send && *s != '\n')
1360 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1363 /* check for embedded arrays
1364 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
1366 else if (*s == '@' && s[1]
1367 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1370 /* check for embedded scalars. only stop if we're sure it's a
1373 else if (*s == '$') {
1374 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1376 if (s + 1 < send && !strchr("()| \r\n\t", s[1]))
1377 break; /* in regexp, $ might be tail anchor */
1380 /* End of else if chain - OP_TRANS rejoin rest */
1383 if (*s == '\\' && s+1 < send) {
1386 /* some backslashes we leave behind */
1387 if (*leaveit && *s && strchr(leaveit, *s)) {
1388 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
1389 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1393 /* deprecate \1 in strings and substitution replacements */
1394 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1395 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1397 if (ckWARN(WARN_SYNTAX))
1398 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
1403 /* string-change backslash escapes */
1404 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1409 /* if we get here, it's either a quoted -, or a digit */
1412 /* quoted - in transliterations */
1414 if (PL_lex_inwhat == OP_TRANS) {
1421 if (ckWARN(WARN_MISC) &&
1424 Perl_warner(aTHX_ packWARN(WARN_MISC),
1425 "Unrecognized escape \\%c passed through",
1427 /* default action is to copy the quoted character */
1428 goto default_action;
1431 /* \132 indicates an octal constant */
1432 case '0': case '1': case '2': case '3':
1433 case '4': case '5': case '6': case '7':
1437 uv = grok_oct(s, &len, &flags, NULL);
1440 goto NUM_ESCAPE_INSERT;
1442 /* \x24 indicates a hex constant */
1446 char* e = strchr(s, '}');
1447 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1448 PERL_SCAN_DISALLOW_PREFIX;
1453 yyerror("Missing right brace on \\x{}");
1457 uv = grok_hex(s, &len, &flags, NULL);
1463 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
1464 uv = grok_hex(s, &len, &flags, NULL);
1470 /* Insert oct or hex escaped character.
1471 * There will always enough room in sv since such
1472 * escapes will be longer than any UTF-8 sequence
1473 * they can end up as. */
1475 /* We need to map to chars to ASCII before doing the tests
1478 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(uv))) {
1479 if (!has_utf8 && uv > 255) {
1480 /* Might need to recode whatever we have
1481 * accumulated so far if it contains any
1484 * (Can't we keep track of that and avoid
1485 * this rescan? --jhi)
1489 for (c = (U8 *) SvPVX(sv); c < (U8 *)d; c++) {
1490 if (!NATIVE_IS_INVARIANT(*c)) {
1495 STRLEN offset = d - SvPVX(sv);
1497 d = SvGROW(sv, SvLEN(sv) + hicount + 1) + offset;
1501 while (src >= (U8 *)SvPVX(sv)) {
1502 if (!NATIVE_IS_INVARIANT(*src)) {
1503 U8 ch = NATIVE_TO_ASCII(*src);
1504 *dst-- = (U8)UTF8_EIGHT_BIT_LO(ch);
1505 *dst-- = (U8)UTF8_EIGHT_BIT_HI(ch);
1515 if (has_utf8 || uv > 255) {
1516 d = (char*)uvchr_to_utf8((U8*)d, uv);
1518 if (PL_lex_inwhat == OP_TRANS &&
1519 PL_sublex_info.sub_op) {
1520 PL_sublex_info.sub_op->op_private |=
1521 (PL_lex_repl ? OPpTRANS_FROM_UTF
1534 /* \N{LATIN SMALL LETTER A} is a named character */
1538 char* e = strchr(s, '}');
1544 yyerror("Missing right brace on \\N{}");
1548 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
1550 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
1551 PERL_SCAN_DISALLOW_PREFIX;
1554 uv = grok_hex(s, &len, &flags, NULL);
1556 goto NUM_ESCAPE_INSERT;
1558 res = newSVpvn(s + 1, e - s - 1);
1559 res = new_constant( Nullch, 0, "charnames",
1560 res, Nullsv, "\\N{...}" );
1562 sv_utf8_upgrade(res);
1563 str = SvPV(res,len);
1564 #ifdef EBCDIC_NEVER_MIND
1565 /* charnames uses pack U and that has been
1566 * recently changed to do the below uni->native
1567 * mapping, so this would be redundant (and wrong,
1568 * the code point would be doubly converted).
1569 * But leave this in just in case the pack U change
1570 * gets revoked, but the semantics is still
1571 * desireable for charnames. --jhi */
1573 UV uv = utf8_to_uvchr((U8*)str, 0);
1576 U8 tmpbuf[UTF8_MAXLEN+1], *d;
1578 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
1579 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
1580 str = SvPV(res, len);
1584 if (!has_utf8 && SvUTF8(res)) {
1585 char *ostart = SvPVX(sv);
1586 SvCUR_set(sv, d - ostart);
1589 sv_utf8_upgrade(sv);
1590 /* this just broke our allocation above... */
1591 SvGROW(sv, (STRLEN)(send - start));
1592 d = SvPVX(sv) + SvCUR(sv);
1595 if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
1596 char *odest = SvPVX(sv);
1598 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
1599 d = SvPVX(sv) + (d - odest);
1601 Copy(str, d, len, char);
1608 yyerror("Missing braces on \\N{}");
1611 /* \c is a control character */
1620 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
1624 /* printf-style backslashes, formfeeds, newlines, etc */
1626 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
1629 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
1632 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
1635 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
1638 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
1641 *d++ = ASCII_TO_NEED(has_utf8,'\033');
1644 *d++ = ASCII_TO_NEED(has_utf8,'\007');
1650 } /* end if (backslash) */
1653 /* If we started with encoded form, or already know we want it
1654 and then encode the next character */
1655 if ((has_utf8 || this_utf8) && !NATIVE_IS_INVARIANT((U8)(*s))) {
1657 UV uv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
1658 STRLEN need = UNISKIP(NATIVE_TO_UNI(uv));
1661 /* encoded value larger than old, need extra space (NOTE: SvCUR() not set here) */
1662 STRLEN off = d - SvPVX(sv);
1663 d = SvGROW(sv, SvLEN(sv) + (need-len)) + off;
1665 d = (char*)uvchr_to_utf8((U8*)d, uv);
1669 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
1671 } /* while loop to process each character */
1673 /* terminate the string and set up the sv */
1675 SvCUR_set(sv, d - SvPVX(sv));
1676 if (SvCUR(sv) >= SvLEN(sv))
1677 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
1680 if (PL_encoding && !has_utf8) {
1681 sv_recode_to_utf8(sv, PL_encoding);
1686 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1687 PL_sublex_info.sub_op->op_private |=
1688 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1692 /* shrink the sv if we allocated more than we used */
1693 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1694 SvLEN_set(sv, SvCUR(sv) + 1);
1695 Renew(SvPVX(sv), SvLEN(sv), char);
1698 /* return the substring (via yylval) only if we parsed anything */
1699 if (s > PL_bufptr) {
1700 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1701 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1703 ( PL_lex_inwhat == OP_TRANS
1705 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1708 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1715 * Returns TRUE if there's more to the expression (e.g., a subscript),
1718 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1720 * ->[ and ->{ return TRUE
1721 * { and [ outside a pattern are always subscripts, so return TRUE
1722 * if we're outside a pattern and it's not { or [, then return FALSE
1723 * if we're in a pattern and the first char is a {
1724 * {4,5} (any digits around the comma) returns FALSE
1725 * if we're in a pattern and the first char is a [
1727 * [SOMETHING] has a funky algorithm to decide whether it's a
1728 * character class or not. It has to deal with things like
1729 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1730 * anything else returns TRUE
1733 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1736 S_intuit_more(pTHX_ register char *s)
1738 if (PL_lex_brackets)
1740 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1742 if (*s != '{' && *s != '[')
1747 /* In a pattern, so maybe we have {n,m}. */
1764 /* On the other hand, maybe we have a character class */
1767 if (*s == ']' || *s == '^')
1770 /* this is terrifying, and it works */
1771 int weight = 2; /* let's weigh the evidence */
1773 unsigned char un_char = 255, last_un_char;
1774 char *send = strchr(s,']');
1775 char tmpbuf[sizeof PL_tokenbuf * 4];
1777 if (!send) /* has to be an expression */
1780 Zero(seen,256,char);
1783 else if (isDIGIT(*s)) {
1785 if (isDIGIT(s[1]) && s[2] == ']')
1791 for (; s < send; s++) {
1792 last_un_char = un_char;
1793 un_char = (unsigned char)*s;
1798 weight -= seen[un_char] * 10;
1799 if (isALNUM_lazy_if(s+1,UTF)) {
1800 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1801 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1806 else if (*s == '$' && s[1] &&
1807 strchr("[#!%*<>()-=",s[1])) {
1808 if (/*{*/ strchr("])} =",s[2]))
1817 if (strchr("wds]",s[1]))
1819 else if (seen['\''] || seen['"'])
1821 else if (strchr("rnftbxcav",s[1]))
1823 else if (isDIGIT(s[1])) {
1825 while (s[1] && isDIGIT(s[1]))
1835 if (strchr("aA01! ",last_un_char))
1837 if (strchr("zZ79~",s[1]))
1839 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1840 weight -= 5; /* cope with negative subscript */
1843 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1844 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1849 if (keyword(tmpbuf, d - tmpbuf))
1852 if (un_char == last_un_char + 1)
1854 weight -= seen[un_char];
1859 if (weight >= 0) /* probably a character class */
1869 * Does all the checking to disambiguate
1871 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1872 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1874 * First argument is the stuff after the first token, e.g. "bar".
1876 * Not a method if bar is a filehandle.
1877 * Not a method if foo is a subroutine prototyped to take a filehandle.
1878 * Not a method if it's really "Foo $bar"
1879 * Method if it's "foo $bar"
1880 * Not a method if it's really "print foo $bar"
1881 * Method if it's really "foo package::" (interpreted as package->foo)
1882 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
1883 * Not a method if bar is a filehandle or package, but is quoted with
1888 S_intuit_method(pTHX_ char *start, GV *gv)
1890 char *s = start + (*start == '$');
1891 char tmpbuf[sizeof PL_tokenbuf];
1899 if ((cv = GvCVu(gv))) {
1900 char *proto = SvPVX(cv);
1910 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1911 /* start is the beginning of the possible filehandle/object,
1912 * and s is the end of it
1913 * tmpbuf is a copy of it
1916 if (*start == '$') {
1917 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1922 return *s == '(' ? FUNCMETH : METHOD;
1924 if (!keyword(tmpbuf, len)) {
1925 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1930 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1931 if (indirgv && GvCVu(indirgv))
1933 /* filehandle or package name makes it a method */
1934 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1936 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1937 return 0; /* no assumptions -- "=>" quotes bearword */
1939 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1940 newSVpvn(tmpbuf,len));
1941 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1945 return *s == '(' ? FUNCMETH : METHOD;
1953 * Return a string of Perl code to load the debugger. If PERL5DB
1954 * is set, it will return the contents of that, otherwise a
1955 * compile-time require of perl5db.pl.
1962 char *pdb = PerlEnv_getenv("PERL5DB");
1966 SETERRNO(0,SS$_NORMAL);
1967 return "BEGIN { require 'perl5db.pl' }";
1973 /* Encoded script support. filter_add() effectively inserts a
1974 * 'pre-processing' function into the current source input stream.
1975 * Note that the filter function only applies to the current source file
1976 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1978 * The datasv parameter (which may be NULL) can be used to pass
1979 * private data to this instance of the filter. The filter function
1980 * can recover the SV using the FILTER_DATA macro and use it to
1981 * store private buffers and state information.
1983 * The supplied datasv parameter is upgraded to a PVIO type
1984 * and the IoDIRP/IoANY field is used to store the function pointer,
1985 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1986 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1987 * private use must be set using malloc'd pointers.
1991 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1996 if (!PL_rsfp_filters)
1997 PL_rsfp_filters = newAV();
1999 datasv = NEWSV(255,0);
2000 if (!SvUPGRADE(datasv, SVt_PVIO))
2001 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
2002 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
2003 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
2004 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
2005 (void*)funcp, SvPV_nolen(datasv)));
2006 av_unshift(PL_rsfp_filters, 1);
2007 av_store(PL_rsfp_filters, 0, datasv) ;
2012 /* Delete most recently added instance of this filter function. */
2014 Perl_filter_del(pTHX_ filter_t funcp)
2017 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", (void*)funcp));
2018 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
2020 /* if filter is on top of stack (usual case) just pop it off */
2021 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
2022 if (IoANY(datasv) == (void *)funcp) {
2023 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
2024 IoANY(datasv) = (void *)NULL;
2025 sv_free(av_pop(PL_rsfp_filters));
2029 /* we need to search for the correct entry and clear it */
2030 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
2034 /* Invoke the n'th filter function for the current rsfp. */
2036 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
2039 /* 0 = read one text line */
2044 if (!PL_rsfp_filters)
2046 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
2047 /* Provide a default input filter to make life easy. */
2048 /* Note that we append to the line. This is handy. */
2049 DEBUG_P(PerlIO_printf(Perl_debug_log,
2050 "filter_read %d: from rsfp\n", idx));
2054 int old_len = SvCUR(buf_sv) ;
2056 /* ensure buf_sv is large enough */
2057 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
2058 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2059 if (PerlIO_error(PL_rsfp))
2060 return -1; /* error */
2062 return 0 ; /* end of file */
2064 SvCUR_set(buf_sv, old_len + len) ;
2067 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2068 if (PerlIO_error(PL_rsfp))
2069 return -1; /* error */
2071 return 0 ; /* end of file */
2074 return SvCUR(buf_sv);
2076 /* Skip this filter slot if filter has been deleted */
2077 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2078 DEBUG_P(PerlIO_printf(Perl_debug_log,
2079 "filter_read %d: skipped (filter deleted)\n",
2081 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2083 /* Get function pointer hidden within datasv */
2084 funcp = (filter_t)IoANY(datasv);
2085 DEBUG_P(PerlIO_printf(Perl_debug_log,
2086 "filter_read %d: via function %p (%s)\n",
2087 idx, (void*)funcp, SvPV_nolen(datasv)));
2088 /* Call function. The function is expected to */
2089 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2090 /* Return: <0:error, =0:eof, >0:not eof */
2091 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
2095 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2097 #ifdef PERL_CR_FILTER
2098 if (!PL_rsfp_filters) {
2099 filter_add(S_cr_textfilter,NULL);
2102 if (PL_rsfp_filters) {
2105 SvCUR_set(sv, 0); /* start with empty line */
2106 if (FILTER_READ(0, sv, 0) > 0)
2107 return ( SvPVX(sv) ) ;
2112 return (sv_gets(sv, fp, append));
2116 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2120 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2124 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2125 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2127 return GvHV(gv); /* Foo:: */
2130 /* use constant CLASS => 'MyClass' */
2131 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2133 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2134 pkgname = SvPV_nolen(sv);
2138 return gv_stashpv(pkgname, FALSE);
2142 static char* exp_name[] =
2143 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2144 "ATTRTERM", "TERMBLOCK"
2151 Works out what to call the token just pulled out of the input
2152 stream. The yacc parser takes care of taking the ops we return and
2153 stitching them into a tree.
2159 if read an identifier
2160 if we're in a my declaration
2161 croak if they tried to say my($foo::bar)
2162 build the ops for a my() declaration
2163 if it's an access to a my() variable
2164 are we in a sort block?
2165 croak if my($a); $a <=> $b
2166 build ops for access to a my() variable
2167 if in a dq string, and they've said @foo and we can't find @foo
2169 build ops for a bareword
2170 if we already built the token before, use it.
2173 #ifdef USE_PURE_BISON
2175 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2180 yylval_pointer[yyactlevel] = lvalp;
2181 yychar_pointer[yyactlevel] = lcharp;
2182 if (yyactlevel >= YYMAXLEVEL)
2183 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2185 r = Perl_yylex(aTHX);
2195 #pragma segment Perl_yylex
2208 /* check if there's an identifier for us to look at */
2209 if (PL_pending_ident)
2210 return S_pending_ident(aTHX);
2212 /* no identifier pending identification */
2214 switch (PL_lex_state) {
2216 case LEX_NORMAL: /* Some compilers will produce faster */
2217 case LEX_INTERPNORMAL: /* code if we comment these out. */
2221 /* when we've already built the next token, just pull it out of the queue */
2224 yylval = PL_nextval[PL_nexttoke];
2226 PL_lex_state = PL_lex_defer;
2227 PL_expect = PL_lex_expect;
2228 PL_lex_defer = LEX_NORMAL;
2230 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2231 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2232 (IV)PL_nexttype[PL_nexttoke]); });
2234 return(PL_nexttype[PL_nexttoke]);
2236 /* interpolated case modifiers like \L \U, including \Q and \E.
2237 when we get here, PL_bufptr is at the \
2239 case LEX_INTERPCASEMOD:
2241 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2242 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2244 /* handle \E or end of string */
2245 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2249 if (PL_lex_casemods) {
2250 oldmod = PL_lex_casestack[--PL_lex_casemods];
2251 PL_lex_casestack[PL_lex_casemods] = '\0';
2253 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2255 PL_lex_state = LEX_INTERPCONCAT;
2259 if (PL_bufptr != PL_bufend)
2261 PL_lex_state = LEX_INTERPCONCAT;
2265 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2266 "### Saw case modifier at '%s'\n", PL_bufptr); });
2268 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2269 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
2270 if (strchr("LU", *s) &&
2271 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2273 PL_lex_casestack[--PL_lex_casemods] = '\0';
2276 if (PL_lex_casemods > 10) {
2277 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2278 if (newlb != PL_lex_casestack) {
2280 PL_lex_casestack = newlb;
2283 PL_lex_casestack[PL_lex_casemods++] = *s;
2284 PL_lex_casestack[PL_lex_casemods] = '\0';
2285 PL_lex_state = LEX_INTERPCONCAT;
2286 PL_nextval[PL_nexttoke].ival = 0;
2289 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2291 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2293 PL_nextval[PL_nexttoke].ival = OP_LC;
2295 PL_nextval[PL_nexttoke].ival = OP_UC;
2297 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2299 Perl_croak(aTHX_ "panic: yylex");
2302 if (PL_lex_starts) {
2311 case LEX_INTERPPUSH:
2312 return sublex_push();
2314 case LEX_INTERPSTART:
2315 if (PL_bufptr == PL_bufend)
2316 return sublex_done();
2317 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2318 "### Interpolated variable at '%s'\n", PL_bufptr); });
2320 PL_lex_dojoin = (*PL_bufptr == '@');
2321 PL_lex_state = LEX_INTERPNORMAL;
2322 if (PL_lex_dojoin) {
2323 PL_nextval[PL_nexttoke].ival = 0;
2325 #ifdef USE_5005THREADS
2326 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2327 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2328 force_next(PRIVATEREF);
2330 force_ident("\"", '$');
2331 #endif /* USE_5005THREADS */
2332 PL_nextval[PL_nexttoke].ival = 0;
2334 PL_nextval[PL_nexttoke].ival = 0;
2336 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2339 if (PL_lex_starts++) {
2345 case LEX_INTERPENDMAYBE:
2346 if (intuit_more(PL_bufptr)) {
2347 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2353 if (PL_lex_dojoin) {
2354 PL_lex_dojoin = FALSE;
2355 PL_lex_state = LEX_INTERPCONCAT;
2358 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2359 && SvEVALED(PL_lex_repl))
2361 if (PL_bufptr != PL_bufend)
2362 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2363 PL_lex_repl = Nullsv;
2366 case LEX_INTERPCONCAT:
2368 if (PL_lex_brackets)
2369 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2371 if (PL_bufptr == PL_bufend)
2372 return sublex_done();
2374 if (SvIVX(PL_linestr) == '\'') {
2375 SV *sv = newSVsv(PL_linestr);
2378 else if ( PL_hints & HINT_NEW_RE )
2379 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2380 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2384 s = scan_const(PL_bufptr);
2386 PL_lex_state = LEX_INTERPCASEMOD;
2388 PL_lex_state = LEX_INTERPSTART;
2391 if (s != PL_bufptr) {
2392 PL_nextval[PL_nexttoke] = yylval;
2395 if (PL_lex_starts++)
2405 PL_lex_state = LEX_NORMAL;
2406 s = scan_formline(PL_bufptr);
2407 if (!PL_lex_formbrack)
2413 PL_oldoldbufptr = PL_oldbufptr;
2416 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2417 exp_name[PL_expect], s);
2423 if (isIDFIRST_lazy_if(s,UTF))
2425 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2428 goto fake_eof; /* emulate EOF on ^D or ^Z */
2433 if (PL_lex_brackets)
2434 yyerror("Missing right curly or square bracket");
2435 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2436 "### Tokener got EOF\n");
2440 if (s++ < PL_bufend)
2441 goto retry; /* ignore stray nulls */
2444 if (!PL_in_eval && !PL_preambled) {
2445 PL_preambled = TRUE;
2446 sv_setpv(PL_linestr,incl_perldb());
2447 if (SvCUR(PL_linestr))
2448 sv_catpv(PL_linestr,";");
2450 while(AvFILLp(PL_preambleav) >= 0) {
2451 SV *tmpsv = av_shift(PL_preambleav);
2452 sv_catsv(PL_linestr, tmpsv);
2453 sv_catpv(PL_linestr, ";");
2456 sv_free((SV*)PL_preambleav);
2457 PL_preambleav = NULL;
2459 if (PL_minus_n || PL_minus_p) {
2460 sv_catpv(PL_linestr, "LINE: while (<>) {");
2462 sv_catpv(PL_linestr,"chomp;");
2465 if (strchr("/'\"", *PL_splitstr)
2466 && strchr(PL_splitstr + 1, *PL_splitstr))
2467 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
2470 s = "'~#\200\1'"; /* surely one char is unused...*/
2471 while (s[1] && strchr(PL_splitstr, *s)) s++;
2473 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s%c",
2474 "q" + (delim == '\''), delim);
2475 for (s = PL_splitstr; *s; s++) {
2477 sv_catpvn(PL_linestr, "\\", 1);
2478 sv_catpvn(PL_linestr, s, 1);
2480 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2484 sv_catpv(PL_linestr,"our @F=split(' ');");
2487 sv_catpv(PL_linestr, "\n");
2488 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2489 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2490 PL_last_lop = PL_last_uni = Nullch;
2491 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2492 SV *sv = NEWSV(85,0);
2494 sv_upgrade(sv, SVt_PVMG);
2495 sv_setsv(sv,PL_linestr);
2498 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2503 bof = PL_rsfp ? TRUE : FALSE;
2504 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2507 if (PL_preprocess && !PL_in_eval)
2508 (void)PerlProc_pclose(PL_rsfp);
2509 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2510 PerlIO_clearerr(PL_rsfp);
2512 (void)PerlIO_close(PL_rsfp);
2514 PL_doextract = FALSE;
2516 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2517 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2518 sv_catpv(PL_linestr,";}");
2519 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2520 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2521 PL_last_lop = PL_last_uni = Nullch;
2522 PL_minus_n = PL_minus_p = 0;
2525 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2526 PL_last_lop = PL_last_uni = Nullch;
2527 sv_setpv(PL_linestr,"");
2528 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2530 /* if it looks like the start of a BOM, check if it in fact is */
2531 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2532 #ifdef PERLIO_IS_STDIO
2533 # ifdef __GNU_LIBRARY__
2534 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2535 # define FTELL_FOR_PIPE_IS_BROKEN
2539 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2540 # define FTELL_FOR_PIPE_IS_BROKEN
2545 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2546 /* This loses the possibility to detect the bof
2547 * situation on perl -P when the libc5 is being used.
2548 * Workaround? Maybe attach some extra state to PL_rsfp?
2551 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2553 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
2556 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2557 s = swallow_bom((U8*)s);
2561 /* Incest with pod. */
2562 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2563 sv_setpv(PL_linestr, "");
2564 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2565 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2566 PL_last_lop = PL_last_uni = Nullch;
2567 PL_doextract = FALSE;
2571 } while (PL_doextract);
2572 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2573 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2574 SV *sv = NEWSV(85,0);
2576 sv_upgrade(sv, SVt_PVMG);
2577 sv_setsv(sv,PL_linestr);
2580 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2582 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2583 PL_last_lop = PL_last_uni = Nullch;
2584 if (CopLINE(PL_curcop) == 1) {
2585 while (s < PL_bufend && isSPACE(*s))
2587 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2591 if (*s == '#' && *(s+1) == '!')
2593 #ifdef ALTERNATE_SHEBANG
2595 static char as[] = ALTERNATE_SHEBANG;
2596 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2597 d = s + (sizeof(as) - 1);
2599 #endif /* ALTERNATE_SHEBANG */
2608 while (*d && !isSPACE(*d))
2612 #ifdef ARG_ZERO_IS_SCRIPT
2613 if (ipathend > ipath) {
2615 * HP-UX (at least) sets argv[0] to the script name,
2616 * which makes $^X incorrect. And Digital UNIX and Linux,
2617 * at least, set argv[0] to the basename of the Perl
2618 * interpreter. So, having found "#!", we'll set it right.
2620 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV)); /* $^X */
2621 assert(SvPOK(x) || SvGMAGICAL(x));
2622 if (sv_eq(x, CopFILESV(PL_curcop))) {
2623 sv_setpvn(x, ipath, ipathend - ipath);
2629 char *bstart = SvPV(CopFILESV(PL_curcop),blen);
2630 char *lstart = SvPV(x,llen);
2632 bstart += blen - llen;
2633 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
2634 sv_setpvn(x, ipath, ipathend - ipath);
2639 TAINT_NOT; /* $^X is always tainted, but that's OK */
2641 #endif /* ARG_ZERO_IS_SCRIPT */
2646 d = instr(s,"perl -");
2648 d = instr(s,"perl");
2650 /* avoid getting into infinite loops when shebang
2651 * line contains "Perl" rather than "perl" */
2653 for (d = ipathend-4; d >= ipath; --d) {
2654 if ((*d == 'p' || *d == 'P')
2655 && !ibcmp(d, "perl", 4))
2665 #ifdef ALTERNATE_SHEBANG
2667 * If the ALTERNATE_SHEBANG on this system starts with a
2668 * character that can be part of a Perl expression, then if
2669 * we see it but not "perl", we're probably looking at the
2670 * start of Perl code, not a request to hand off to some
2671 * other interpreter. Similarly, if "perl" is there, but
2672 * not in the first 'word' of the line, we assume the line
2673 * contains the start of the Perl program.
2675 if (d && *s != '#') {
2677 while (*c && !strchr("; \t\r\n\f\v#", *c))
2680 d = Nullch; /* "perl" not in first word; ignore */
2682 *s = '#'; /* Don't try to parse shebang line */
2684 #endif /* ALTERNATE_SHEBANG */
2685 #ifndef MACOS_TRADITIONAL
2690 !instr(s,"indir") &&
2691 instr(PL_origargv[0],"perl"))
2697 while (s < PL_bufend && isSPACE(*s))
2699 if (s < PL_bufend) {
2700 Newz(899,newargv,PL_origargc+3,char*);
2702 while (s < PL_bufend && !isSPACE(*s))
2705 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2708 newargv = PL_origargv;
2710 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2711 Perl_croak(aTHX_ "Can't exec %s", ipath);
2715 U32 oldpdb = PL_perldb;
2716 bool oldn = PL_minus_n;
2717 bool oldp = PL_minus_p;
2719 while (*d && !isSPACE(*d)) d++;
2720 while (SPACE_OR_TAB(*d)) d++;
2723 bool switches_done = PL_doswitches;
2725 if (*d == 'M' || *d == 'm') {
2727 while (*d && !isSPACE(*d)) d++;
2728 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2731 d = moreswitches(d);
2733 if ((PERLDB_LINE && !oldpdb) ||
2734 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2735 /* if we have already added "LINE: while (<>) {",
2736 we must not do it again */
2738 sv_setpv(PL_linestr, "");
2739 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2740 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2741 PL_last_lop = PL_last_uni = Nullch;
2742 PL_preambled = FALSE;
2744 (void)gv_fetchfile(PL_origfilename);
2747 if (PL_doswitches && !switches_done) {
2748 int argc = PL_origargc;
2749 char **argv = PL_origargv;
2752 } while (argc && argv[0][0] == '-' && argv[0][1]);
2753 init_argv_symbols(argc,argv);
2759 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2761 PL_lex_state = LEX_FORMLINE;
2766 #ifdef PERL_STRICT_CR
2767 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2769 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2771 case ' ': case '\t': case '\f': case 013:
2772 #ifdef MACOS_TRADITIONAL
2779 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2780 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2781 /* handle eval qq[#line 1 "foo"\n ...] */
2782 CopLINE_dec(PL_curcop);
2786 while (s < d && *s != '\n')
2790 else if (s > d) /* Found by Ilya: feed random input to Perl. */
2791 Perl_croak(aTHX_ "panic: input overflow");
2793 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2795 PL_lex_state = LEX_FORMLINE;
2805 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2812 while (s < PL_bufend && SPACE_OR_TAB(*s))
2815 if (strnEQ(s,"=>",2)) {
2816 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2817 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2818 "### Saw unary minus before =>, forcing word '%s'\n", s);
2820 OPERATOR('-'); /* unary minus */
2822 PL_last_uni = PL_oldbufptr;
2824 case 'r': ftst = OP_FTEREAD; break;
2825 case 'w': ftst = OP_FTEWRITE; break;
2826 case 'x': ftst = OP_FTEEXEC; break;
2827 case 'o': ftst = OP_FTEOWNED; break;
2828 case 'R': ftst = OP_FTRREAD; break;
2829 case 'W': ftst = OP_FTRWRITE; break;
2830 case 'X': ftst = OP_FTREXEC; break;
2831 case 'O': ftst = OP_FTROWNED; break;
2832 case 'e': ftst = OP_FTIS; break;
2833 case 'z': ftst = OP_FTZERO; break;
2834 case 's': ftst = OP_FTSIZE; break;
2835 case 'f': ftst = OP_FTFILE; break;
2836 case 'd': ftst = OP_FTDIR; break;
2837 case 'l': ftst = OP_FTLINK; break;
2838 case 'p': ftst = OP_FTPIPE; break;
2839 case 'S': ftst = OP_FTSOCK; break;
2840 case 'u': ftst = OP_FTSUID; break;
2841 case 'g': ftst = OP_FTSGID; break;
2842 case 'k': ftst = OP_FTSVTX; break;
2843 case 'b': ftst = OP_FTBLK; break;
2844 case 'c': ftst = OP_FTCHR; break;
2845 case 't': ftst = OP_FTTTY; break;
2846 case 'T': ftst = OP_FTTEXT; break;
2847 case 'B': ftst = OP_FTBINARY; break;
2848 case 'M': case 'A': case 'C':
2849 gv_fetchpv("\024",TRUE, SVt_PV);
2851 case 'M': ftst = OP_FTMTIME; break;
2852 case 'A': ftst = OP_FTATIME; break;
2853 case 'C': ftst = OP_FTCTIME; break;
2861 PL_last_lop_op = (OPCODE)ftst;
2862 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2863 "### Saw file test %c\n", (int)ftst);
2868 /* Assume it was a minus followed by a one-letter named
2869 * subroutine call (or a -bareword), then. */
2870 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2871 "### %c looked like a file test but was not\n",
2880 if (PL_expect == XOPERATOR)
2885 else if (*s == '>') {
2888 if (isIDFIRST_lazy_if(s,UTF)) {
2889 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2897 if (PL_expect == XOPERATOR)
2900 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2902 OPERATOR('-'); /* unary minus */
2909 if (PL_expect == XOPERATOR)
2914 if (PL_expect == XOPERATOR)
2917 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2923 if (PL_expect != XOPERATOR) {
2924 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2925 PL_expect = XOPERATOR;
2926 force_ident(PL_tokenbuf, '*');
2939 if (PL_expect == XOPERATOR) {
2943 PL_tokenbuf[0] = '%';
2944 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2945 if (!PL_tokenbuf[1]) {
2947 yyerror("Final % should be \\% or %name");
2950 PL_pending_ident = '%';
2969 switch (PL_expect) {
2972 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
2974 PL_bufptr = s; /* update in case we back off */
2980 PL_expect = XTERMBLOCK;
2984 while (isIDFIRST_lazy_if(s,UTF)) {
2985 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
2986 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
2987 if (tmp < 0) tmp = -tmp;
3003 d = scan_str(d,TRUE,TRUE);
3005 /* MUST advance bufptr here to avoid bogus
3006 "at end of line" context messages from yyerror().
3008 PL_bufptr = s + len;
3009 yyerror("Unterminated attribute parameter in attribute list");
3012 return 0; /* EOF indicator */
3016 SV *sv = newSVpvn(s, len);
3017 sv_catsv(sv, PL_lex_stuff);
3018 attrs = append_elem(OP_LIST, attrs,
3019 newSVOP(OP_CONST, 0, sv));
3020 SvREFCNT_dec(PL_lex_stuff);
3021 PL_lex_stuff = Nullsv;
3024 /* NOTE: any CV attrs applied here need to be part of
3025 the CVf_BUILTIN_ATTRS define in cv.h! */
3026 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3027 CvLVALUE_on(PL_compcv);
3028 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3029 CvLOCKED_on(PL_compcv);
3030 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3031 CvMETHOD_on(PL_compcv);
3033 else if (PL_in_my == KEY_our && len == 6 &&
3034 strnEQ(s, "unique", len))
3035 GvUNIQUE_on(cGVOPx_gv(yylval.opval));
3037 /* After we've set the flags, it could be argued that
3038 we don't need to do the attributes.pm-based setting
3039 process, and shouldn't bother appending recognized
3040 flags. To experiment with that, uncomment the
3041 following "else". (Note that's already been
3042 uncommented. That keeps the above-applied built-in
3043 attributes from being intercepted (and possibly
3044 rejected) by a package's attribute routines, but is
3045 justified by the performance win for the common case
3046 of applying only built-in attributes.) */
3048 attrs = append_elem(OP_LIST, attrs,
3049 newSVOP(OP_CONST, 0,
3053 if (*s == ':' && s[1] != ':')
3056 break; /* require real whitespace or :'s */
3058 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3059 if (*s != ';' && *s != '}' && *s != tmp && (tmp != '=' || *s != ')')) {
3060 char q = ((*s == '\'') ? '"' : '\'');
3061 /* If here for an expression, and parsed no attrs, back off. */
3062 if (tmp == '=' && !attrs) {
3066 /* MUST advance bufptr here to avoid bogus "at end of line"
3067 context messages from yyerror().
3071 yyerror("Unterminated attribute list");
3073 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3081 PL_nextval[PL_nexttoke].opval = attrs;
3089 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3090 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3106 if (PL_lex_brackets <= 0)
3107 yyerror("Unmatched right square bracket");
3110 if (PL_lex_state == LEX_INTERPNORMAL) {
3111 if (PL_lex_brackets == 0) {
3112 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3113 PL_lex_state = LEX_INTERPEND;
3120 if (PL_lex_brackets > 100) {
3121 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3122 if (newlb != PL_lex_brackstack) {
3124 PL_lex_brackstack = newlb;
3127 switch (PL_expect) {
3129 if (PL_lex_formbrack) {
3133 if (PL_oldoldbufptr == PL_last_lop)
3134 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3136 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3137 OPERATOR(HASHBRACK);
3139 while (s < PL_bufend && SPACE_OR_TAB(*s))
3142 PL_tokenbuf[0] = '\0';
3143 if (d < PL_bufend && *d == '-') {
3144 PL_tokenbuf[0] = '-';
3146 while (d < PL_bufend && SPACE_OR_TAB(*d))
3149 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3150 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3152 while (d < PL_bufend && SPACE_OR_TAB(*d))
3155 char minus = (PL_tokenbuf[0] == '-');
3156 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3164 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3169 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3174 if (PL_oldoldbufptr == PL_last_lop)
3175 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3177 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3180 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
3182 /* This hack is to get the ${} in the message. */
3184 yyerror("syntax error");
3187 OPERATOR(HASHBRACK);
3189 /* This hack serves to disambiguate a pair of curlies
3190 * as being a block or an anon hash. Normally, expectation
3191 * determines that, but in cases where we're not in a
3192 * position to expect anything in particular (like inside
3193 * eval"") we have to resolve the ambiguity. This code
3194 * covers the case where the first term in the curlies is a
3195 * quoted string. Most other cases need to be explicitly
3196 * disambiguated by prepending a `+' before the opening
3197 * curly in order to force resolution as an anon hash.
3199 * XXX should probably propagate the outer expectation
3200 * into eval"" to rely less on this hack, but that could
3201 * potentially break current behavior of eval"".
3205 if (*s == '\'' || *s == '"' || *s == '`') {
3206 /* common case: get past first string, handling escapes */
3207 for (t++; t < PL_bufend && *t != *s;)
3208 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3212 else if (*s == 'q') {
3215 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3219 char open, close, term;
3222 while (t < PL_bufend && isSPACE(*t))
3226 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3230 for (t++; t < PL_bufend; t++) {
3231 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3233 else if (*t == open)
3237 for (t++; t < PL_bufend; t++) {
3238 if (*t == '\\' && t+1 < PL_bufend)
3240 else if (*t == close && --brackets <= 0)
3242 else if (*t == open)
3248 else if (isALNUM_lazy_if(t,UTF)) {
3250 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3253 while (t < PL_bufend && isSPACE(*t))
3255 /* if comma follows first term, call it an anon hash */
3256 /* XXX it could be a comma expression with loop modifiers */
3257 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3258 || (*t == '=' && t[1] == '>')))
3259 OPERATOR(HASHBRACK);
3260 if (PL_expect == XREF)
3263 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3269 yylval.ival = CopLINE(PL_curcop);
3270 if (isSPACE(*s) || *s == '#')
3271 PL_copline = NOLINE; /* invalidate current command line number */
3276 if (PL_lex_brackets <= 0)
3277 yyerror("Unmatched right curly bracket");
3279 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3280 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3281 PL_lex_formbrack = 0;
3282 if (PL_lex_state == LEX_INTERPNORMAL) {
3283 if (PL_lex_brackets == 0) {
3284 if (PL_expect & XFAKEBRACK) {
3285 PL_expect &= XENUMMASK;
3286 PL_lex_state = LEX_INTERPEND;
3288 return yylex(); /* ignore fake brackets */
3290 if (*s == '-' && s[1] == '>')
3291 PL_lex_state = LEX_INTERPENDMAYBE;
3292 else if (*s != '[' && *s != '{')
3293 PL_lex_state = LEX_INTERPEND;
3296 if (PL_expect & XFAKEBRACK) {
3297 PL_expect &= XENUMMASK;
3299 return yylex(); /* ignore fake brackets */
3309 if (PL_expect == XOPERATOR) {
3310 if (ckWARN(WARN_SEMICOLON)
3311 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3313 CopLINE_dec(PL_curcop);
3314 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3315 CopLINE_inc(PL_curcop);
3320 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3322 PL_expect = XOPERATOR;
3323 force_ident(PL_tokenbuf, '&');
3327 yylval.ival = (OPpENTERSUB_AMPER<<8);
3346 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3347 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Reversed %c= operator",(int)tmp);
3349 if (PL_expect == XSTATE && isALPHA(tmp) &&
3350 (s == PL_linestart+1 || s[-2] == '\n') )
3352 if (PL_in_eval && !PL_rsfp) {
3357 if (strnEQ(s,"=cut",4)) {
3371 PL_doextract = TRUE;
3374 if (PL_lex_brackets < PL_lex_formbrack) {
3376 #ifdef PERL_STRICT_CR
3377 for (t = s; SPACE_OR_TAB(*t); t++) ;
3379 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3381 if (*t == '\n' || *t == '#') {
3399 if (PL_expect != XOPERATOR) {
3400 if (s[1] != '<' && !strchr(s,'>'))
3403 s = scan_heredoc(s);
3405 s = scan_inputsymbol(s);
3406 TERM(sublex_start());
3411 SHop(OP_LEFT_SHIFT);
3425 SHop(OP_RIGHT_SHIFT);
3434 if (PL_expect == XOPERATOR) {
3435 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3438 return ','; /* grandfather non-comma-format format */
3442 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3443 PL_tokenbuf[0] = '@';
3444 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3445 sizeof PL_tokenbuf - 1, FALSE);
3446 if (PL_expect == XOPERATOR)
3447 no_op("Array length", s);
3448 if (!PL_tokenbuf[1])
3450 PL_expect = XOPERATOR;
3451 PL_pending_ident = '#';
3455 PL_tokenbuf[0] = '$';
3456 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3457 sizeof PL_tokenbuf - 1, FALSE);
3458 if (PL_expect == XOPERATOR)
3460 if (!PL_tokenbuf[1]) {
3462 yyerror("Final $ should be \\$ or $name");
3466 /* This kludge not intended to be bulletproof. */
3467 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3468 yylval.opval = newSVOP(OP_CONST, 0,
3469 newSViv(PL_compiling.cop_arybase));
3470 yylval.opval->op_private = OPpCONST_ARYBASE;
3476 if (PL_lex_state == LEX_NORMAL)
3479 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3482 PL_tokenbuf[0] = '@';
3483 if (ckWARN(WARN_SYNTAX)) {
3485 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3488 PL_bufptr = skipspace(PL_bufptr);
3489 while (t < PL_bufend && *t != ']')
3491 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3492 "Multidimensional syntax %.*s not supported",
3493 (t - PL_bufptr) + 1, PL_bufptr);
3497 else if (*s == '{') {
3498 PL_tokenbuf[0] = '%';
3499 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3500 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3502 char tmpbuf[sizeof PL_tokenbuf];
3504 for (t++; isSPACE(*t); t++) ;
3505 if (isIDFIRST_lazy_if(t,UTF)) {
3506 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3507 for (; isSPACE(*t); t++) ;
3508 if (*t == ';' && get_cv(tmpbuf, FALSE))
3509 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3510 "You need to quote \"%s\"", tmpbuf);
3516 PL_expect = XOPERATOR;
3517 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3518 bool islop = (PL_last_lop == PL_oldoldbufptr);
3519 if (!islop || PL_last_lop_op == OP_GREPSTART)
3520 PL_expect = XOPERATOR;
3521 else if (strchr("$@\"'`q", *s))
3522 PL_expect = XTERM; /* e.g. print $fh "foo" */
3523 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3524 PL_expect = XTERM; /* e.g. print $fh &sub */
3525 else if (isIDFIRST_lazy_if(s,UTF)) {
3526 char tmpbuf[sizeof PL_tokenbuf];
3527 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3528 if ((tmp = keyword(tmpbuf, len))) {
3529 /* binary operators exclude handle interpretations */
3541 PL_expect = XTERM; /* e.g. print $fh length() */
3546 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3547 if (gv && GvCVu(gv))
3548 PL_expect = XTERM; /* e.g. print $fh subr() */
3551 else if (isDIGIT(*s))
3552 PL_expect = XTERM; /* e.g. print $fh 3 */
3553 else if (*s == '.' && isDIGIT(s[1]))
3554 PL_expect = XTERM; /* e.g. print $fh .3 */
3555 else if (strchr("?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3556 PL_expect = XTERM; /* e.g. print $fh -1 */
3557 else if (*s == '/') {
3559 PL_expect=XOPERATOR;
3565 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3566 PL_expect = XTERM; /* print $fh <<"EOF" */
3568 PL_pending_ident = '$';
3572 if (PL_expect == XOPERATOR)
3574 PL_tokenbuf[0] = '@';
3575 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3576 if (!PL_tokenbuf[1]) {
3578 yyerror("Final @ should be \\@ or @name");
3581 if (PL_lex_state == LEX_NORMAL)
3583 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3585 PL_tokenbuf[0] = '%';
3587 /* Warn about @ where they meant $. */
3588 if (ckWARN(WARN_SYNTAX)) {
3589 if (*s == '[' || *s == '{') {
3591 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3593 if (*t == '}' || *t == ']') {
3595 PL_bufptr = skipspace(PL_bufptr);
3596 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
3597 "Scalar value %.*s better written as $%.*s",
3598 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3603 PL_pending_ident = '@';
3606 case '/': /* may be division, defined-or, or pattern */
3607 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
3611 case '?': /* may either be conditional or pattern */
3612 if(PL_expect == XOPERATOR) {
3620 /* A // operator. */
3630 /* Disable warning on "study /blah/" */
3631 if (PL_oldoldbufptr == PL_last_uni
3632 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3633 || memNE(PL_last_uni, "study", 5)
3634 || isALNUM_lazy_if(PL_last_uni+5,UTF)
3637 s = scan_pat(s,OP_MATCH);
3638 TERM(sublex_start());
3642 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3643 #ifdef PERL_STRICT_CR
3646 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3648 && (s == PL_linestart || s[-1] == '\n') )
3650 PL_lex_formbrack = 0;
3654 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3660 yylval.ival = OPf_SPECIAL;
3666 if (PL_expect != XOPERATOR)
3671 case '0': case '1': case '2': case '3': case '4':
3672 case '5': case '6': case '7': case '8': case '9':
3673 s = scan_num(s, &yylval);
3674 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3675 "### Saw number in '%s'\n", s);
3677 if (PL_expect == XOPERATOR)
3682 s = scan_str(s,FALSE,FALSE);
3683 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3684 "### Saw string before '%s'\n", s);
3686 if (PL_expect == XOPERATOR) {
3687 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3690 return ','; /* grandfather non-comma-format format */
3696 missingterm((char*)0);
3697 yylval.ival = OP_CONST;
3698 TERM(sublex_start());
3701 s = scan_str(s,FALSE,FALSE);
3702 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3703 "### Saw string before '%s'\n", s);
3705 if (PL_expect == XOPERATOR) {
3706 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3709 return ','; /* grandfather non-comma-format format */
3715 missingterm((char*)0);
3716 yylval.ival = OP_CONST;
3717 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3718 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
3719 yylval.ival = OP_STRINGIFY;
3723 TERM(sublex_start());
3726 s = scan_str(s,FALSE,FALSE);
3727 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3728 "### Saw backtick string before '%s'\n", s);
3730 if (PL_expect == XOPERATOR)
3731 no_op("Backticks",s);
3733 missingterm((char*)0);
3734 yylval.ival = OP_BACKTICK;
3736 TERM(sublex_start());
3740 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3741 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
3743 if (PL_expect == XOPERATOR)
3744 no_op("Backslash",s);
3748 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3752 while (isDIGIT(*start) || *start == '_')
3754 if (*start == '.' && isDIGIT(start[1])) {
3755 s = scan_num(s, &yylval);
3758 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3759 else if (!isALPHA(*start) && (PL_expect == XTERM
3760 || PL_expect == XREF || PL_expect == XSTATE
3761 || PL_expect == XTERMORDORDOR)) {
3765 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3768 s = scan_num(s, &yylval);
3775 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3814 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3816 /* Some keywords can be followed by any delimiter, including ':' */
3817 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3818 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3819 (PL_tokenbuf[0] == 'q' &&
3820 strchr("qwxr", PL_tokenbuf[1])))));
3822 /* x::* is just a word, unless x is "CORE" */
3823 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3827 while (d < PL_bufend && isSPACE(*d))
3828 d++; /* no comments skipped here, or s### is misparsed */
3830 /* Is this a label? */
3831 if (!tmp && PL_expect == XSTATE
3832 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3834 yylval.pval = savepv(PL_tokenbuf);
3839 /* Check for keywords */
3840 tmp = keyword(PL_tokenbuf, len);
3842 /* Is this a word before a => operator? */
3843 if (*d == '=' && d[1] == '>') {
3845 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3846 yylval.opval->op_private = OPpCONST_BARE;
3847 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
3848 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3852 if (tmp < 0) { /* second-class keyword? */
3853 GV *ogv = Nullgv; /* override (winner) */
3854 GV *hgv = Nullgv; /* hidden (loser) */
3855 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3857 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3860 if (GvIMPORTED_CV(gv))
3862 else if (! CvMETHOD(cv))
3866 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3867 (gv = *gvp) != (GV*)&PL_sv_undef &&
3868 GvCVu(gv) && GvIMPORTED_CV(gv))
3874 tmp = 0; /* overridden by import or by GLOBAL */
3877 && -tmp==KEY_lock /* XXX generalizable kludge */
3879 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3881 tmp = 0; /* any sub overrides "weak" keyword */
3883 else { /* no override */
3885 if (tmp == KEY_dump && ckWARN(WARN_MISC)) {
3886 Perl_warner(aTHX_ packWARN(WARN_MISC),
3887 "dump() better written as CORE::dump()");
3891 if (ckWARN(WARN_AMBIGUOUS) && hgv
3892 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3893 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
3894 "Ambiguous call resolved as CORE::%s(), %s",
3895 GvENAME(hgv), "qualify as such or use &");
3902 default: /* not a keyword */
3906 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3908 /* Get the rest if it looks like a package qualifier */
3910 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3912 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3915 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3916 *s == '\'' ? "'" : "::");
3921 if (PL_expect == XOPERATOR) {
3922 if (PL_bufptr == PL_linestart) {
3923 CopLINE_dec(PL_curcop);
3924 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), PL_warn_nosemi);
3925 CopLINE_inc(PL_curcop);
3928 no_op("Bareword",s);
3931 /* Look for a subroutine with this name in current package,
3932 unless name is "Foo::", in which case Foo is a bearword
3933 (and a package name). */
3936 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3938 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3939 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
3940 "Bareword \"%s\" refers to nonexistent package",
3943 PL_tokenbuf[len] = '\0';
3950 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3953 /* if we saw a global override before, get the right name */
3956 sv = newSVpvn("CORE::GLOBAL::",14);
3957 sv_catpv(sv,PL_tokenbuf);
3960 sv = newSVpv(PL_tokenbuf,0);
3962 /* Presume this is going to be a bareword of some sort. */
3965 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3966 yylval.opval->op_private = OPpCONST_BARE;
3967 /* UTF-8 package name? */
3968 if (UTF && !IN_BYTES &&
3969 is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
3972 /* And if "Foo::", then that's what it certainly is. */
3977 /* See if it's the indirect object for a list operator. */
3979 if (PL_oldoldbufptr &&
3980 PL_oldoldbufptr < PL_bufptr &&
3981 (PL_oldoldbufptr == PL_last_lop
3982 || PL_oldoldbufptr == PL_last_uni) &&
3983 /* NO SKIPSPACE BEFORE HERE! */
3984 (PL_expect == XREF ||
3985 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3987 bool immediate_paren = *s == '(';
3989 /* (Now we can afford to cross potential line boundary.) */
3992 /* Two barewords in a row may indicate method call. */
3994 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3997 /* If not a declared subroutine, it's an indirect object. */
3998 /* (But it's an indir obj regardless for sort.) */
4000 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
4001 ((!gv || !GvCVu(gv)) &&
4002 (PL_last_lop_op != OP_MAPSTART &&
4003 PL_last_lop_op != OP_GREPSTART))))
4005 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
4010 PL_expect = XOPERATOR;
4013 /* Is this a word before a => operator? */
4014 if (*s == '=' && s[1] == '>' && !pkgname) {
4016 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4017 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
4018 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4022 /* If followed by a paren, it's certainly a subroutine. */
4025 if (gv && GvCVu(gv)) {
4026 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4027 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4032 PL_nextval[PL_nexttoke].opval = yylval.opval;
4033 PL_expect = XOPERATOR;
4039 /* If followed by var or block, call it a method (unless sub) */
4041 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4042 PL_last_lop = PL_oldbufptr;
4043 PL_last_lop_op = OP_METHOD;
4047 /* If followed by a bareword, see if it looks like indir obj. */
4049 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4052 /* Not a method, so call it a subroutine (if defined) */
4054 if (gv && GvCVu(gv)) {
4056 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4057 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4058 "Ambiguous use of -%s resolved as -&%s()",
4059 PL_tokenbuf, PL_tokenbuf);
4060 /* Check for a constant sub */
4062 if ((sv = cv_const_sv(cv))) {
4064 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4065 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4066 yylval.opval->op_private = 0;
4070 /* Resolve to GV now. */
4071 op_free(yylval.opval);
4072 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4073 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4074 PL_last_lop = PL_oldbufptr;
4075 PL_last_lop_op = OP_ENTERSUB;
4076 /* Is there a prototype? */
4079 char *proto = SvPV((SV*)cv, len);
4082 if (strEQ(proto, "$"))
4084 if (*proto == '&' && *s == '{') {
4085 sv_setpv(PL_subname, PL_curstash ?
4086 "__ANON__" : "__ANON__::__ANON__");
4090 PL_nextval[PL_nexttoke].opval = yylval.opval;
4096 /* Call it a bare word */
4098 if (PL_hints & HINT_STRICT_SUBS)
4099 yylval.opval->op_private |= OPpCONST_STRICT;
4102 if (ckWARN(WARN_RESERVED)) {
4103 if (lastchar != '-') {
4104 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4105 if (!*d && !gv_stashpv(PL_tokenbuf,FALSE))
4106 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
4113 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4114 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4115 "Operator or semicolon missing before %c%s",
4116 lastchar, PL_tokenbuf);
4117 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
4118 "Ambiguous use of %c resolved as operator %c",
4119 lastchar, lastchar);
4125 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4126 newSVpv(CopFILE(PL_curcop),0));
4130 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4131 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4134 case KEY___PACKAGE__:
4135 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4137 ? newSVsv(PL_curstname)
4146 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4147 char *pname = "main";
4148 if (PL_tokenbuf[2] == 'D')
4149 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4150 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4153 GvIOp(gv) = newIO();
4154 IoIFP(GvIOp(gv)) = PL_rsfp;
4155 #if defined(HAS_FCNTL) && defined(F_SETFD)
4157 int fd = PerlIO_fileno(PL_rsfp);
4158 fcntl(fd,F_SETFD,fd >= 3);
4161 /* Mark this internal pseudo-handle as clean */
4162 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4164 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4165 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4166 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4168 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4169 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4170 /* if the script was opened in binmode, we need to revert
4171 * it to text mode for compatibility; but only iff it has CRs
4172 * XXX this is a questionable hack at best. */
4173 if (PL_bufend-PL_bufptr > 2
4174 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4177 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4178 loc = PerlIO_tell(PL_rsfp);
4179 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4182 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
4184 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4185 #endif /* NETWARE */
4186 #ifdef PERLIO_IS_STDIO /* really? */
4187 # if defined(__BORLANDC__)
4188 /* XXX see note in do_binmode() */
4189 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
4193 PerlIO_seek(PL_rsfp, loc, 0);
4197 #ifdef PERLIO_LAYERS
4198 if (UTF && !IN_BYTES)
4199 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4212 if (PL_expect == XSTATE) {
4219 if (*s == ':' && s[1] == ':') {
4222 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4223 if (!(tmp = keyword(PL_tokenbuf, len)))
4224 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4238 LOP(OP_ACCEPT,XTERM);
4244 LOP(OP_ATAN2,XTERM);
4250 LOP(OP_BINMODE,XTERM);
4253 LOP(OP_BLESS,XTERM);
4262 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4279 if (!PL_cryptseen) {
4280 PL_cryptseen = TRUE;
4284 LOP(OP_CRYPT,XTERM);
4287 LOP(OP_CHMOD,XTERM);
4290 LOP(OP_CHOWN,XTERM);
4293 LOP(OP_CONNECT,XTERM);
4309 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4313 PL_hints |= HINT_BLOCK_SCOPE;
4323 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4324 LOP(OP_DBMOPEN,XTERM);
4330 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4337 yylval.ival = CopLINE(PL_curcop);
4351 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4352 UNIBRACK(OP_ENTEREVAL);
4370 case KEY_endhostent:
4376 case KEY_endservent:
4379 case KEY_endprotoent:
4390 yylval.ival = CopLINE(PL_curcop);
4392 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4394 if ((PL_bufend - p) >= 3 &&
4395 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4397 else if ((PL_bufend - p) >= 4 &&
4398 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4401 if (isIDFIRST_lazy_if(p,UTF)) {
4402 p = scan_ident(p, PL_bufend,
4403 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4407 Perl_croak(aTHX_ "Missing $ on loop variable");
4412 LOP(OP_FORMLINE,XTERM);
4418 LOP(OP_FCNTL,XTERM);
4424 LOP(OP_FLOCK,XTERM);
4433 LOP(OP_GREPSTART, XREF);
4436 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4451 case KEY_getpriority:
4452 LOP(OP_GETPRIORITY,XTERM);
4454 case KEY_getprotobyname:
4457 case KEY_getprotobynumber:
4458 LOP(OP_GPBYNUMBER,XTERM);
4460 case KEY_getprotoent:
4472 case KEY_getpeername:
4473 UNI(OP_GETPEERNAME);
4475 case KEY_gethostbyname:
4478 case KEY_gethostbyaddr:
4479 LOP(OP_GHBYADDR,XTERM);
4481 case KEY_gethostent:
4484 case KEY_getnetbyname:
4487 case KEY_getnetbyaddr:
4488 LOP(OP_GNBYADDR,XTERM);
4493 case KEY_getservbyname:
4494 LOP(OP_GSBYNAME,XTERM);
4496 case KEY_getservbyport:
4497 LOP(OP_GSBYPORT,XTERM);
4499 case KEY_getservent:
4502 case KEY_getsockname:
4503 UNI(OP_GETSOCKNAME);
4505 case KEY_getsockopt:
4506 LOP(OP_GSOCKOPT,XTERM);
4528 yylval.ival = CopLINE(PL_curcop);
4532 LOP(OP_INDEX,XTERM);
4538 LOP(OP_IOCTL,XTERM);
4550 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4582 LOP(OP_LISTEN,XTERM);
4591 s = scan_pat(s,OP_MATCH);
4592 TERM(sublex_start());
4595 LOP(OP_MAPSTART, XREF);
4598 LOP(OP_MKDIR,XTERM);
4601 LOP(OP_MSGCTL,XTERM);
4604 LOP(OP_MSGGET,XTERM);
4607 LOP(OP_MSGRCV,XTERM);
4610 LOP(OP_MSGSND,XTERM);
4616 if (isIDFIRST_lazy_if(s,UTF)) {
4617 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4618 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4620 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4621 if (!PL_in_my_stash) {
4624 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4632 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4639 if (PL_expect != XSTATE)
4640 yyerror("\"no\" not allowed in expression");
4641 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4642 s = force_version(s, FALSE);
4647 if (*s == '(' || (s = skipspace(s), *s == '('))
4654 if (isIDFIRST_lazy_if(s,UTF)) {
4656 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4658 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4659 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4660 "Precedence problem: open %.*s should be open(%.*s)",
4666 yylval.ival = OP_OR;
4676 LOP(OP_OPEN_DIR,XTERM);
4679 checkcomma(s,PL_tokenbuf,"filehandle");
4683 checkcomma(s,PL_tokenbuf,"filehandle");
4702 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4706 LOP(OP_PIPE_OP,XTERM);
4709 s = scan_str(s,FALSE,FALSE);
4711 missingterm((char*)0);
4712 yylval.ival = OP_CONST;
4713 TERM(sublex_start());
4719 s = scan_str(s,FALSE,FALSE);
4721 missingterm((char*)0);
4723 if (SvCUR(PL_lex_stuff)) {
4726 d = SvPV_force(PL_lex_stuff, len);
4729 for (; isSPACE(*d) && len; --len, ++d) ;
4732 if (!warned && ckWARN(WARN_QW)) {
4733 for (; !isSPACE(*d) && len; --len, ++d) {
4735 Perl_warner(aTHX_ packWARN(WARN_QW),
4736 "Possible attempt to separate words with commas");
4739 else if (*d == '#') {
4740 Perl_warner(aTHX_ packWARN(WARN_QW),
4741 "Possible attempt to put comments in qw() list");
4747 for (; !isSPACE(*d) && len; --len, ++d) ;
4749 sv = newSVpvn(b, d-b);
4750 if (DO_UTF8(PL_lex_stuff))
4752 words = append_elem(OP_LIST, words,
4753 newSVOP(OP_CONST, 0, tokeq(sv)));
4757 PL_nextval[PL_nexttoke].opval = words;
4762 SvREFCNT_dec(PL_lex_stuff);
4763 PL_lex_stuff = Nullsv;
4769 s = scan_str(s,FALSE,FALSE);
4771 missingterm((char*)0);
4772 yylval.ival = OP_STRINGIFY;
4773 if (SvIVX(PL_lex_stuff) == '\'')
4774 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4775 TERM(sublex_start());
4778 s = scan_pat(s,OP_QR);
4779 TERM(sublex_start());
4782 s = scan_str(s,FALSE,FALSE);
4784 missingterm((char*)0);
4785 yylval.ival = OP_BACKTICK;
4787 TERM(sublex_start());
4795 s = force_version(s, FALSE);
4797 else if (*s != 'v' || !isDIGIT(s[1])
4798 || (s = force_version(s, TRUE), *s == 'v'))
4800 *PL_tokenbuf = '\0';
4801 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4802 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4803 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4805 yyerror("<> should be quotes");
4813 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4817 LOP(OP_RENAME,XTERM);
4826 LOP(OP_RINDEX,XTERM);
4836 UNIDOR(OP_READLINE);
4849 LOP(OP_REVERSE,XTERM);
4852 UNIDOR(OP_READLINK);
4860 TERM(sublex_start());
4862 TOKEN(1); /* force error */
4871 LOP(OP_SELECT,XTERM);
4877 LOP(OP_SEMCTL,XTERM);
4880 LOP(OP_SEMGET,XTERM);
4883 LOP(OP_SEMOP,XTERM);
4889 LOP(OP_SETPGRP,XTERM);
4891 case KEY_setpriority:
4892 LOP(OP_SETPRIORITY,XTERM);
4894 case KEY_sethostent:
4900 case KEY_setservent:
4903 case KEY_setprotoent:
4913 LOP(OP_SEEKDIR,XTERM);
4915 case KEY_setsockopt:
4916 LOP(OP_SSOCKOPT,XTERM);
4922 LOP(OP_SHMCTL,XTERM);
4925 LOP(OP_SHMGET,XTERM);
4928 LOP(OP_SHMREAD,XTERM);
4931 LOP(OP_SHMWRITE,XTERM);
4934 LOP(OP_SHUTDOWN,XTERM);
4943 LOP(OP_SOCKET,XTERM);
4945 case KEY_socketpair:
4946 LOP(OP_SOCKPAIR,XTERM);
4949 checkcomma(s,PL_tokenbuf,"subroutine name");
4951 if (*s == ';' || *s == ')') /* probably a close */
4952 Perl_croak(aTHX_ "sort is now a reserved word");
4954 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4958 LOP(OP_SPLIT,XTERM);
4961 LOP(OP_SPRINTF,XTERM);
4964 LOP(OP_SPLICE,XTERM);
4979 LOP(OP_SUBSTR,XTERM);
4985 char tmpbuf[sizeof PL_tokenbuf];
4986 SSize_t tboffset = 0;
4987 expectation attrful;
4988 bool have_name, have_proto, bad_proto;
4993 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4994 (*s == ':' && s[1] == ':'))
4997 attrful = XATTRBLOCK;
4998 /* remember buffer pos'n for later force_word */
4999 tboffset = s - PL_oldbufptr;
5000 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5001 if (strchr(tmpbuf, ':'))
5002 sv_setpv(PL_subname, tmpbuf);
5004 sv_setsv(PL_subname,PL_curstname);
5005 sv_catpvn(PL_subname,"::",2);
5006 sv_catpvn(PL_subname,tmpbuf,len);
5013 Perl_croak(aTHX_ "Missing name in \"my sub\"");
5014 PL_expect = XTERMBLOCK;
5015 attrful = XATTRTERM;
5016 sv_setpv(PL_subname,"?");
5020 if (key == KEY_format) {
5022 PL_lex_formbrack = PL_lex_brackets + 1;
5024 (void) force_word(PL_oldbufptr + tboffset, WORD,
5029 /* Look for a prototype */
5033 s = scan_str(s,FALSE,FALSE);
5035 Perl_croak(aTHX_ "Prototype not terminated");
5036 /* strip spaces and check for bad characters */
5037 d = SvPVX(PL_lex_stuff);
5040 for (p = d; *p; ++p) {
5043 if (!strchr("$@%*;[]&\\", *p))
5048 if (bad_proto && ckWARN(WARN_SYNTAX))
5049 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5050 "Illegal character in prototype for %s : %s",
5051 SvPVX(PL_subname), d);
5052 SvCUR(PL_lex_stuff) = tmp;
5060 if (*s == ':' && s[1] != ':')
5061 PL_expect = attrful;
5064 PL_nextval[PL_nexttoke].opval =
5065 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5066 PL_lex_stuff = Nullsv;
5070 sv_setpv(PL_subname,
5071 PL_curstash ? "__ANON__" : "__ANON__::__ANON__");
5074 (void) force_word(PL_oldbufptr + tboffset, WORD,
5083 LOP(OP_SYSTEM,XREF);
5086 LOP(OP_SYMLINK,XTERM);
5089 LOP(OP_SYSCALL,XTERM);
5092 LOP(OP_SYSOPEN,XTERM);
5095 LOP(OP_SYSSEEK,XTERM);
5098 LOP(OP_SYSREAD,XTERM);
5101 LOP(OP_SYSWRITE,XTERM);
5105 TERM(sublex_start());
5126 LOP(OP_TRUNCATE,XTERM);
5138 yylval.ival = CopLINE(PL_curcop);
5142 yylval.ival = CopLINE(PL_curcop);
5146 LOP(OP_UNLINK,XTERM);
5152 LOP(OP_UNPACK,XTERM);
5155 LOP(OP_UTIME,XTERM);
5161 LOP(OP_UNSHIFT,XTERM);
5164 if (PL_expect != XSTATE)
5165 yyerror("\"use\" not allowed in expression");
5167 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5168 s = force_version(s, TRUE);
5169 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5170 PL_nextval[PL_nexttoke].opval = Nullop;
5173 else if (*s == 'v') {
5174 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5175 s = force_version(s, FALSE);
5179 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5180 s = force_version(s, FALSE);
5192 yylval.ival = CopLINE(PL_curcop);
5196 PL_hints |= HINT_BLOCK_SCOPE;
5203 LOP(OP_WAITPID,XTERM);
5212 ctl_l[0] = toCTRL('L');
5214 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5217 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5222 if (PL_expect == XOPERATOR)
5228 yylval.ival = OP_XOR;
5233 TERM(sublex_start());
5238 #pragma segment Main
5242 S_pending_ident(pTHX)
5246 /* pit holds the identifier we read and pending_ident is reset */
5247 char pit = PL_pending_ident;
5248 PL_pending_ident = 0;
5250 DEBUG_T({ PerlIO_printf(Perl_debug_log,
5251 "### Tokener saw identifier '%s'\n", PL_tokenbuf); });
5253 /* if we're in a my(), we can't allow dynamics here.
5254 $foo'bar has already been turned into $foo::bar, so
5255 just check for colons.
5257 if it's a legal name, the OP is a PADANY.
5260 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
5261 if (strchr(PL_tokenbuf,':'))
5262 yyerror(Perl_form(aTHX_ "No package name allowed for "
5263 "variable %s in \"our\"",
5265 tmp = pad_allocmy(PL_tokenbuf);
5268 if (strchr(PL_tokenbuf,':'))
5269 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
5271 yylval.opval = newOP(OP_PADANY, 0);
5272 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
5278 build the ops for accesses to a my() variable.
5280 Deny my($a) or my($b) in a sort block, *if* $a or $b is
5281 then used in a comparison. This catches most, but not
5282 all cases. For instance, it catches
5283 sort { my($a); $a <=> $b }
5285 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
5286 (although why you'd do that is anyone's guess).
5289 if (!strchr(PL_tokenbuf,':')) {
5290 #ifdef USE_5005THREADS
5291 /* Check for single character per-thread SVs */
5292 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
5293 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
5294 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
5296 yylval.opval = newOP(OP_THREADSV, 0);
5297 yylval.opval->op_targ = tmp;
5300 #endif /* USE_5005THREADS */
5301 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
5302 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
5303 /* might be an "our" variable" */
5304 if (SvFLAGS(namesv) & SVpad_OUR) {
5305 /* build ops for a bareword */
5306 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
5307 sv_catpvn(sym, "::", 2);
5308 sv_catpv(sym, PL_tokenbuf+1);
5309 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
5310 yylval.opval->op_private = OPpCONST_ENTERED;
5311 gv_fetchpv(SvPVX(sym),
5313 ? (GV_ADDMULTI | GV_ADDINEVAL)
5316 ((PL_tokenbuf[0] == '$') ? SVt_PV
5317 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5322 /* if it's a sort block and they're naming $a or $b */
5323 if (PL_last_lop_op == OP_SORT &&
5324 PL_tokenbuf[0] == '$' &&
5325 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
5328 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
5329 d < PL_bufend && *d != '\n';
5332 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
5333 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
5339 yylval.opval = newOP(OP_PADANY, 0);
5340 yylval.opval->op_targ = tmp;
5346 Whine if they've said @foo in a doublequoted string,
5347 and @foo isn't a variable we can find in the symbol
5350 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
5351 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
5352 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
5353 && ckWARN(WARN_AMBIGUOUS))
5355 /* Downgraded from fatal to warning 20000522 mjd */
5356 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5357 "Possible unintended interpolation of %s in string",
5362 /* build ops for a bareword */
5363 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
5364 yylval.opval->op_private = OPpCONST_ENTERED;
5365 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
5366 ((PL_tokenbuf[0] == '$') ? SVt_PV
5367 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
5373 Perl_keyword(pTHX_ register char *d, I32 len)
5378 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5379 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5380 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5381 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5382 if (strEQ(d,"__END__")) return KEY___END__;
5386 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5391 if (strEQ(d,"and")) return -KEY_and;
5392 if (strEQ(d,"abs")) return -KEY_abs;
5395 if (strEQ(d,"alarm")) return -KEY_alarm;
5396 if (strEQ(d,"atan2")) return -KEY_atan2;
5399 if (strEQ(d,"accept")) return -KEY_accept;
5404 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5407 if (strEQ(d,"bless")) return -KEY_bless;
5408 if (strEQ(d,"bind")) return -KEY_bind;
5409 if (strEQ(d,"binmode")) return -KEY_binmode;
5412 if (strEQ(d,"CORE")) return -KEY_CORE;
5413 if (strEQ(d,"CHECK")) return KEY_CHECK;
5418 if (strEQ(d,"cmp")) return -KEY_cmp;
5419 if (strEQ(d,"chr")) return -KEY_chr;
5420 if (strEQ(d,"cos")) return -KEY_cos;
5423 if (strEQ(d,"chop")) return -KEY_chop;
5426 if (strEQ(d,"close")) return -KEY_close;
5427 if (strEQ(d,"chdir")) return -KEY_chdir;
5428 if (strEQ(d,"chomp")) return -KEY_chomp;
5429 if (strEQ(d,"chmod")) return -KEY_chmod;
5430 if (strEQ(d,"chown")) return -KEY_chown;
5431 if (strEQ(d,"crypt")) return -KEY_crypt;
5434 if (strEQ(d,"chroot")) return -KEY_chroot;
5435 if (strEQ(d,"caller")) return -KEY_caller;
5438 if (strEQ(d,"connect")) return -KEY_connect;
5441 if (strEQ(d,"closedir")) return -KEY_closedir;
5442 if (strEQ(d,"continue")) return -KEY_continue;
5447 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5452 if (strEQ(d,"do")) return KEY_do;
5455 if (strEQ(d,"die")) return -KEY_die;
5458 if (strEQ(d,"dump")) return -KEY_dump;
5461 if (strEQ(d,"delete")) return KEY_delete;
5464 if (strEQ(d,"defined")) return KEY_defined;
5465 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5468 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5473 if (strEQ(d,"END")) return KEY_END;
5478 if (strEQ(d,"eq")) return -KEY_eq;
5481 if (strEQ(d,"eof")) return -KEY_eof;
5482 if (strEQ(d,"err")) return -KEY_err;
5483 if (strEQ(d,"exp")) return -KEY_exp;
5486 if (strEQ(d,"else")) return KEY_else;
5487 if (strEQ(d,"exit")) return -KEY_exit;
5488 if (strEQ(d,"eval")) return KEY_eval;
5489 if (strEQ(d,"exec")) return -KEY_exec;
5490 if (strEQ(d,"each")) return -KEY_each;
5493 if (strEQ(d,"elsif")) return KEY_elsif;
5496 if (strEQ(d,"exists")) return KEY_exists;
5497 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5500 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5501 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5504 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5507 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5508 if (strEQ(d,"endservent")) return -KEY_endservent;
5511 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5518 if (strEQ(d,"for")) return KEY_for;
5521 if (strEQ(d,"fork")) return -KEY_fork;
5524 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5525 if (strEQ(d,"flock")) return -KEY_flock;
5528 if (strEQ(d,"format")) return KEY_format;
5529 if (strEQ(d,"fileno")) return -KEY_fileno;
5532 if (strEQ(d,"foreach")) return KEY_foreach;
5535 if (strEQ(d,"formline")) return -KEY_formline;
5540 if (strnEQ(d,"get",3)) {
5545 if (strEQ(d,"ppid")) return -KEY_getppid;
5546 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5549 if (strEQ(d,"pwent")) return -KEY_getpwent;
5550 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5551 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5554 if (strEQ(d,"peername")) return -KEY_getpeername;
5555 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5556 if (strEQ(d,"priority")) return -KEY_getpriority;
5559 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5562 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5566 else if (*d == 'h') {
5567 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5568 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5569 if (strEQ(d,"hostent")) return -KEY_gethostent;
5571 else if (*d == 'n') {
5572 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5573 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5574 if (strEQ(d,"netent")) return -KEY_getnetent;
5576 else if (*d == 's') {
5577 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5578 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5579 if (strEQ(d,"servent")) return -KEY_getservent;
5580 if (strEQ(d,"sockname")) return -KEY_getsockname;
5581 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5583 else if (*d == 'g') {
5584 if (strEQ(d,"grent")) return -KEY_getgrent;
5585 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5586 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5588 else if (*d == 'l') {
5589 if (strEQ(d,"login")) return -KEY_getlogin;
5591 else if (strEQ(d,"c")) return -KEY_getc;
5596 if (strEQ(d,"gt")) return -KEY_gt;
5597 if (strEQ(d,"ge")) return -KEY_ge;
5600 if (strEQ(d,"grep")) return KEY_grep;
5601 if (strEQ(d,"goto")) return KEY_goto;
5602 if (strEQ(d,"glob")) return KEY_glob;
5605 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5610 if (strEQ(d,"hex")) return -KEY_hex;
5613 if (strEQ(d,"INIT")) return KEY_INIT;
5618 if (strEQ(d,"if")) return KEY_if;
5621 if (strEQ(d,"int")) return -KEY_int;
5624 if (strEQ(d,"index")) return -KEY_index;
5625 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5630 if (strEQ(d,"join")) return -KEY_join;
5634 if (strEQ(d,"keys")) return -KEY_keys;
5635 if (strEQ(d,"kill")) return -KEY_kill;
5641 if (strEQ(d,"lt")) return -KEY_lt;
5642 if (strEQ(d,"le")) return -KEY_le;
5643 if (strEQ(d,"lc")) return -KEY_lc;
5646 if (strEQ(d,"log")) return -KEY_log;
5649 if (strEQ(d,"last")) return KEY_last;
5650 if (strEQ(d,"link")) return -KEY_link;
5651 if (strEQ(d,"lock")) return -KEY_lock;
5654 if (strEQ(d,"local")) return KEY_local;
5655 if (strEQ(d,"lstat")) return -KEY_lstat;
5658 if (strEQ(d,"length")) return -KEY_length;
5659 if (strEQ(d,"listen")) return -KEY_listen;
5662 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5665 if (strEQ(d,"localtime")) return -KEY_localtime;
5671 case 1: return KEY_m;
5673 if (strEQ(d,"my")) return KEY_my;
5676 if (strEQ(d,"map")) return KEY_map;
5679 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5682 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5683 if (strEQ(d,"msgget")) return -KEY_msgget;
5684 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5685 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5690 if (strEQ(d,"next")) return KEY_next;
5691 if (strEQ(d,"ne")) return -KEY_ne;
5692 if (strEQ(d,"not")) return -KEY_not;
5693 if (strEQ(d,"no")) return KEY_no;
5698 if (strEQ(d,"or")) return -KEY_or;
5701 if (strEQ(d,"ord")) return -KEY_ord;
5702 if (strEQ(d,"oct")) return -KEY_oct;
5703 if (strEQ(d,"our")) return KEY_our;
5706 if (strEQ(d,"open")) return -KEY_open;
5709 if (strEQ(d,"opendir")) return -KEY_opendir;
5716 if (strEQ(d,"pop")) return -KEY_pop;
5717 if (strEQ(d,"pos")) return KEY_pos;
5720 if (strEQ(d,"push")) return -KEY_push;
5721 if (strEQ(d,"pack")) return -KEY_pack;
5722 if (strEQ(d,"pipe")) return -KEY_pipe;
5725 if (strEQ(d,"print")) return KEY_print;
5728 if (strEQ(d,"printf")) return KEY_printf;
5731 if (strEQ(d,"package")) return KEY_package;
5734 if (strEQ(d,"prototype")) return KEY_prototype;
5739 if (strEQ(d,"q")) return KEY_q;
5740 if (strEQ(d,"qr")) return KEY_qr;
5741 if (strEQ(d,"qq")) return KEY_qq;
5742 if (strEQ(d,"qw")) return KEY_qw;
5743 if (strEQ(d,"qx")) return KEY_qx;
5745 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5750 if (strEQ(d,"ref")) return -KEY_ref;
5753 if (strEQ(d,"read")) return -KEY_read;
5754 if (strEQ(d,"rand")) return -KEY_rand;
5755 if (strEQ(d,"recv")) return -KEY_recv;
5756 if (strEQ(d,"redo")) return KEY_redo;
5759 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5760 if (strEQ(d,"reset")) return -KEY_reset;
5763 if (strEQ(d,"return")) return KEY_return;
5764 if (strEQ(d,"rename")) return -KEY_rename;
5765 if (strEQ(d,"rindex")) return -KEY_rindex;
5768 if (strEQ(d,"require")) return KEY_require;
5769 if (strEQ(d,"reverse")) return -KEY_reverse;
5770 if (strEQ(d,"readdir")) return -KEY_readdir;
5773 if (strEQ(d,"readlink")) return -KEY_readlink;
5774 if (strEQ(d,"readline")) return -KEY_readline;
5775 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5778 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5784 case 0: return KEY_s;
5786 if (strEQ(d,"scalar")) return KEY_scalar;
5791 if (strEQ(d,"seek")) return -KEY_seek;
5792 if (strEQ(d,"send")) return -KEY_send;
5795 if (strEQ(d,"semop")) return -KEY_semop;
5798 if (strEQ(d,"select")) return -KEY_select;
5799 if (strEQ(d,"semctl")) return -KEY_semctl;
5800 if (strEQ(d,"semget")) return -KEY_semget;
5803 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5804 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5807 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5808 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5811 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5814 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5815 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5816 if (strEQ(d,"setservent")) return -KEY_setservent;
5819 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5820 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5827 if (strEQ(d,"shift")) return -KEY_shift;
5830 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5831 if (strEQ(d,"shmget")) return -KEY_shmget;
5834 if (strEQ(d,"shmread")) return -KEY_shmread;
5837 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5838 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5843 if (strEQ(d,"sin")) return -KEY_sin;
5846 if (strEQ(d,"sleep")) return -KEY_sleep;
5849 if (strEQ(d,"sort")) return KEY_sort;
5850 if (strEQ(d,"socket")) return -KEY_socket;
5851 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5854 if (strEQ(d,"split")) return KEY_split;
5855 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5856 if (strEQ(d,"splice")) return -KEY_splice;
5859 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5862 if (strEQ(d,"srand")) return -KEY_srand;
5865 if (strEQ(d,"stat")) return -KEY_stat;
5866 if (strEQ(d,"study")) return KEY_study;
5869 if (strEQ(d,"substr")) return -KEY_substr;
5870 if (strEQ(d,"sub")) return KEY_sub;
5875 if (strEQ(d,"system")) return -KEY_system;
5878 if (strEQ(d,"symlink")) return -KEY_symlink;
5879 if (strEQ(d,"syscall")) return -KEY_syscall;
5880 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5881 if (strEQ(d,"sysread")) return -KEY_sysread;
5882 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5885 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5894 if (strEQ(d,"tr")) return KEY_tr;
5897 if (strEQ(d,"tie")) return KEY_tie;
5900 if (strEQ(d,"tell")) return -KEY_tell;
5901 if (strEQ(d,"tied")) return KEY_tied;
5902 if (strEQ(d,"time")) return -KEY_time;
5905 if (strEQ(d,"times")) return -KEY_times;
5908 if (strEQ(d,"telldir")) return -KEY_telldir;
5911 if (strEQ(d,"truncate")) return -KEY_truncate;
5918 if (strEQ(d,"uc")) return -KEY_uc;
5921 if (strEQ(d,"use")) return KEY_use;
5924 if (strEQ(d,"undef")) return KEY_undef;
5925 if (strEQ(d,"until")) return KEY_until;
5926 if (strEQ(d,"untie")) return KEY_untie;
5927 if (strEQ(d,"utime")) return -KEY_utime;
5928 if (strEQ(d,"umask")) return -KEY_umask;
5931 if (strEQ(d,"unless")) return KEY_unless;
5932 if (strEQ(d,"unpack")) return -KEY_unpack;
5933 if (strEQ(d,"unlink")) return -KEY_unlink;
5936 if (strEQ(d,"unshift")) return -KEY_unshift;
5937 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5942 if (strEQ(d,"values")) return -KEY_values;
5943 if (strEQ(d,"vec")) return -KEY_vec;
5948 if (strEQ(d,"warn")) return -KEY_warn;
5949 if (strEQ(d,"wait")) return -KEY_wait;
5952 if (strEQ(d,"while")) return KEY_while;
5953 if (strEQ(d,"write")) return -KEY_write;
5956 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5959 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5964 if (len == 1) return -KEY_x;
5965 if (strEQ(d,"xor")) return -KEY_xor;
5968 if (len == 1) return KEY_y;
5977 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5981 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5982 if (ckWARN(WARN_SYNTAX)) {
5984 for (w = s+2; *w && level; w++) {
5991 for (; *w && isSPACE(*w); w++) ;
5992 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5993 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5994 "%s (...) interpreted as function",name);
5997 while (s < PL_bufend && isSPACE(*s))
6001 while (s < PL_bufend && isSPACE(*s))
6003 if (isIDFIRST_lazy_if(s,UTF)) {
6005 while (isALNUM_lazy_if(s,UTF))
6007 while (s < PL_bufend && isSPACE(*s))
6012 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
6016 Perl_croak(aTHX_ "No comma allowed after %s", what);
6021 /* Either returns sv, or mortalizes sv and returns a new SV*.
6022 Best used as sv=new_constant(..., sv, ...).
6023 If s, pv are NULL, calls subroutine with one argument,
6024 and type is used with error messages only. */
6027 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
6031 HV *table = GvHV(PL_hintgv); /* ^H */
6035 const char *why1, *why2, *why3;
6037 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
6040 why2 = strEQ(key,"charnames")
6041 ? "(possibly a missing \"use charnames ...\")"
6043 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
6044 (type ? type: "undef"), why2);
6046 /* This is convoluted and evil ("goto considered harmful")
6047 * but I do not understand the intricacies of all the different
6048 * failure modes of %^H in here. The goal here is to make
6049 * the most probable error message user-friendly. --jhi */
6054 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
6055 (type ? type: "undef"), why1, why2, why3);
6057 yyerror(SvPVX(msg));
6061 cvp = hv_fetch(table, key, strlen(key), FALSE);
6062 if (!cvp || !SvOK(*cvp)) {
6065 why3 = "} is not defined";
6068 sv_2mortal(sv); /* Parent created it permanently */
6071 pv = sv_2mortal(newSVpvn(s, len));
6073 typesv = sv_2mortal(newSVpv(type, 0));
6075 typesv = &PL_sv_undef;
6077 PUSHSTACKi(PERLSI_OVERLOAD);
6089 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
6093 /* Check the eval first */
6094 if (!PL_in_eval && SvTRUE(ERRSV)) {
6096 sv_catpv(ERRSV, "Propagated");
6097 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
6099 res = SvREFCNT_inc(sv);
6103 (void)SvREFCNT_inc(res);
6112 why1 = "Call to &{$^H{";
6114 why3 = "}} did not return a defined value";
6123 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
6125 register char *d = dest;
6126 register char *e = d + destlen - 3; /* two-character token, ending NUL */
6129 Perl_croak(aTHX_ ident_too_long);
6130 if (isALNUM(*s)) /* UTF handled below */
6132 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
6137 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
6141 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6142 char *t = s + UTF8SKIP(s);
6143 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6145 if (d + (t - s) > e)
6146 Perl_croak(aTHX_ ident_too_long);
6147 Copy(s, d, t - s, char);
6160 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6170 e = d + destlen - 3; /* two-character token, ending NUL */
6172 while (isDIGIT(*s)) {
6174 Perl_croak(aTHX_ ident_too_long);
6181 Perl_croak(aTHX_ ident_too_long);
6182 if (isALNUM(*s)) /* UTF handled below */
6184 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6189 else if (*s == ':' && s[1] == ':') {
6193 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6194 char *t = s + UTF8SKIP(s);
6195 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6197 if (d + (t - s) > e)
6198 Perl_croak(aTHX_ ident_too_long);
6199 Copy(s, d, t - s, char);
6210 if (PL_lex_state != LEX_NORMAL)
6211 PL_lex_state = LEX_INTERPENDMAYBE;
6214 if (*s == '$' && s[1] &&
6215 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6228 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6233 if (isSPACE(s[-1])) {
6236 if (!SPACE_OR_TAB(ch)) {
6242 if (isIDFIRST_lazy_if(d,UTF)) {
6246 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6248 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6251 Copy(s, d, e - s, char);
6256 while ((isALNUM(*s) || *s == ':') && d < e)
6259 Perl_croak(aTHX_ ident_too_long);
6262 while (s < send && SPACE_OR_TAB(*s)) s++;
6263 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6264 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6265 const char *brack = *s == '[' ? "[...]" : "{...}";
6266 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6267 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6268 funny, dest, brack, funny, dest, brack);
6271 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6275 /* Handle extended ${^Foo} variables
6276 * 1999-02-27 mjd-perl-patch@plover.com */
6277 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6281 while (isALNUM(*s) && d < e) {
6285 Perl_croak(aTHX_ ident_too_long);
6290 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6291 PL_lex_state = LEX_INTERPEND;
6294 if (PL_lex_state == LEX_NORMAL) {
6295 if (ckWARN(WARN_AMBIGUOUS) &&
6296 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6298 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
6299 "Ambiguous use of %c{%s} resolved to %c%s",
6300 funny, dest, funny, dest);
6305 s = bracket; /* let the parser handle it */
6309 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6310 PL_lex_state = LEX_INTERPEND;
6315 Perl_pmflag(pTHX_ U32* pmfl, int ch)
6320 *pmfl |= PMf_GLOBAL;
6322 *pmfl |= PMf_CONTINUE;
6326 *pmfl |= PMf_MULTILINE;
6328 *pmfl |= PMf_SINGLELINE;
6330 *pmfl |= PMf_EXTENDED;
6334 S_scan_pat(pTHX_ char *start, I32 type)
6339 s = scan_str(start,FALSE,FALSE);
6341 Perl_croak(aTHX_ "Search pattern not terminated");
6343 pm = (PMOP*)newPMOP(type, 0);
6344 if (PL_multi_open == '?')
6345 pm->op_pmflags |= PMf_ONCE;
6347 while (*s && strchr("iomsx", *s))
6348 pmflag(&pm->op_pmflags,*s++);
6351 while (*s && strchr("iogcmsx", *s))
6352 pmflag(&pm->op_pmflags,*s++);
6354 /* issue a warning if /c is specified,but /g is not */
6355 if (ckWARN(WARN_REGEXP) &&
6356 (pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
6358 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_without_g);
6361 pm->op_pmpermflags = pm->op_pmflags;
6363 PL_lex_op = (OP*)pm;
6364 yylval.ival = OP_MATCH;
6369 S_scan_subst(pTHX_ char *start)
6376 yylval.ival = OP_NULL;
6378 s = scan_str(start,FALSE,FALSE);
6381 Perl_croak(aTHX_ "Substitution pattern not terminated");
6383 if (s[-1] == PL_multi_open)
6386 first_start = PL_multi_start;
6387 s = scan_str(s,FALSE,FALSE);
6390 SvREFCNT_dec(PL_lex_stuff);
6391 PL_lex_stuff = Nullsv;
6393 Perl_croak(aTHX_ "Substitution replacement not terminated");
6395 PL_multi_start = first_start; /* so whole substitution is taken together */
6397 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6403 else if (strchr("iogcmsx", *s))
6404 pmflag(&pm->op_pmflags,*s++);
6409 /* /c is not meaningful with s/// */
6410 if (ckWARN(WARN_REGEXP) && (pm->op_pmflags & PMf_CONTINUE))
6412 Perl_warner(aTHX_ packWARN(WARN_REGEXP), c_in_subst);
6417 PL_sublex_info.super_bufptr = s;
6418 PL_sublex_info.super_bufend = PL_bufend;
6420 pm->op_pmflags |= PMf_EVAL;
6421 repl = newSVpvn("",0);
6423 sv_catpv(repl, es ? "eval " : "do ");
6424 sv_catpvn(repl, "{ ", 2);
6425 sv_catsv(repl, PL_lex_repl);
6426 sv_catpvn(repl, " };", 2);
6428 SvREFCNT_dec(PL_lex_repl);
6432 pm->op_pmpermflags = pm->op_pmflags;
6433 PL_lex_op = (OP*)pm;
6434 yylval.ival = OP_SUBST;
6439 S_scan_trans(pTHX_ char *start)
6448 yylval.ival = OP_NULL;
6450 s = scan_str(start,FALSE,FALSE);
6452 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6453 if (s[-1] == PL_multi_open)
6456 s = scan_str(s,FALSE,FALSE);
6459 SvREFCNT_dec(PL_lex_stuff);
6460 PL_lex_stuff = Nullsv;
6462 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6465 complement = del = squash = 0;
6466 while (strchr("cds", *s)) {
6468 complement = OPpTRANS_COMPLEMENT;
6470 del = OPpTRANS_DELETE;
6472 squash = OPpTRANS_SQUASH;
6476 New(803, tbl, complement&&!del?258:256, short);
6477 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6478 o->op_private = del|squash|complement|
6479 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6480 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6483 yylval.ival = OP_TRANS;
6488 S_scan_heredoc(pTHX_ register char *s)
6491 I32 op_type = OP_SCALAR;
6498 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6502 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6505 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6506 if (*peek && strchr("`'\"",*peek)) {
6509 s = delimcpy(d, e, s, PL_bufend, term, &len);
6519 if (!isALNUM_lazy_if(s,UTF))
6520 deprecate_old("bare << to mean <<\"\"");
6521 for (; isALNUM_lazy_if(s,UTF); s++) {
6526 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6527 Perl_croak(aTHX_ "Delimiter for here document is too long");
6530 len = d - PL_tokenbuf;
6531 #ifndef PERL_STRICT_CR
6532 d = strchr(s, '\r');
6536 while (s < PL_bufend) {
6542 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6551 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6556 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6557 herewas = newSVpvn(s,PL_bufend-s);
6559 s--, herewas = newSVpvn(s,d-s);
6560 s += SvCUR(herewas);
6562 tmpstr = NEWSV(87,79);
6563 sv_upgrade(tmpstr, SVt_PVIV);
6568 else if (term == '`') {
6569 op_type = OP_BACKTICK;
6570 SvIVX(tmpstr) = '\\';
6574 PL_multi_start = CopLINE(PL_curcop);
6575 PL_multi_open = PL_multi_close = '<';
6576 term = *PL_tokenbuf;
6577 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6578 char *bufptr = PL_sublex_info.super_bufptr;
6579 char *bufend = PL_sublex_info.super_bufend;
6580 char *olds = s - SvCUR(herewas);
6581 s = strchr(bufptr, '\n');
6585 while (s < bufend &&
6586 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6588 CopLINE_inc(PL_curcop);
6591 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6592 missingterm(PL_tokenbuf);
6594 sv_setpvn(herewas,bufptr,d-bufptr+1);
6595 sv_setpvn(tmpstr,d+1,s-d);
6597 sv_catpvn(herewas,s,bufend-s);
6598 (void)strcpy(bufptr,SvPVX(herewas));
6605 while (s < PL_bufend &&
6606 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6608 CopLINE_inc(PL_curcop);
6610 if (s >= PL_bufend) {
6611 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6612 missingterm(PL_tokenbuf);
6614 sv_setpvn(tmpstr,d+1,s-d);
6616 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6618 sv_catpvn(herewas,s,PL_bufend-s);
6619 sv_setsv(PL_linestr,herewas);
6620 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6621 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6622 PL_last_lop = PL_last_uni = Nullch;
6625 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6626 while (s >= PL_bufend) { /* multiple line string? */
6628 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6629 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
6630 missingterm(PL_tokenbuf);
6632 CopLINE_inc(PL_curcop);
6633 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6634 PL_last_lop = PL_last_uni = Nullch;
6635 #ifndef PERL_STRICT_CR
6636 if (PL_bufend - PL_linestart >= 2) {
6637 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6638 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6640 PL_bufend[-2] = '\n';
6642 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6644 else if (PL_bufend[-1] == '\r')
6645 PL_bufend[-1] = '\n';
6647 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6648 PL_bufend[-1] = '\n';
6650 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6651 SV *sv = NEWSV(88,0);
6653 sv_upgrade(sv, SVt_PVMG);
6654 sv_setsv(sv,PL_linestr);
6657 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6659 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6662 sv_catsv(PL_linestr,herewas);
6663 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6667 sv_catsv(tmpstr,PL_linestr);
6672 PL_multi_end = CopLINE(PL_curcop);
6673 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6674 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6675 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6677 SvREFCNT_dec(herewas);
6678 if (UTF && !IN_BYTES && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6680 PL_lex_stuff = tmpstr;
6681 yylval.ival = op_type;
6686 takes: current position in input buffer
6687 returns: new position in input buffer
6688 side-effects: yylval and lex_op are set.
6693 <FH> read from filehandle
6694 <pkg::FH> read from package qualified filehandle
6695 <pkg'FH> read from package qualified filehandle
6696 <$fh> read from filehandle in $fh
6702 S_scan_inputsymbol(pTHX_ char *start)
6704 register char *s = start; /* current position in buffer */
6710 d = PL_tokenbuf; /* start of temp holding space */
6711 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6712 end = strchr(s, '\n');
6715 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6717 /* die if we didn't have space for the contents of the <>,
6718 or if it didn't end, or if we see a newline
6721 if (len >= sizeof PL_tokenbuf)
6722 Perl_croak(aTHX_ "Excessively long <> operator");
6724 Perl_croak(aTHX_ "Unterminated <> operator");
6729 Remember, only scalar variables are interpreted as filehandles by
6730 this code. Anything more complex (e.g., <$fh{$num}>) will be
6731 treated as a glob() call.
6732 This code makes use of the fact that except for the $ at the front,
6733 a scalar variable and a filehandle look the same.
6735 if (*d == '$' && d[1]) d++;
6737 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6738 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6741 /* If we've tried to read what we allow filehandles to look like, and
6742 there's still text left, then it must be a glob() and not a getline.
6743 Use scan_str to pull out the stuff between the <> and treat it
6744 as nothing more than a string.
6747 if (d - PL_tokenbuf != len) {
6748 yylval.ival = OP_GLOB;
6750 s = scan_str(start,FALSE,FALSE);
6752 Perl_croak(aTHX_ "Glob not terminated");
6756 bool readline_overriden = FALSE;
6757 GV *gv_readline = Nullgv;
6759 /* we're in a filehandle read situation */
6762 /* turn <> into <ARGV> */
6764 (void)strcpy(d,"ARGV");
6766 /* Check whether readline() is overriden */
6767 if (((gv_readline = gv_fetchpv("readline", FALSE, SVt_PVCV))
6768 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
6770 ((gvp = (GV**)hv_fetch(PL_globalstash, "readline", 8, FALSE))
6771 && (gv_readline = *gvp) != (GV*)&PL_sv_undef
6772 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
6773 readline_overriden = TRUE;
6775 /* if <$fh>, create the ops to turn the variable into a
6781 /* try to find it in the pad for this block, otherwise find
6782 add symbol table ops
6784 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6785 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
6786 if (SvFLAGS(namesv) & SVpad_OUR) {
6787 SV *sym = sv_2mortal(newSVpv(HvNAME(GvSTASH(namesv)),0));
6788 sv_catpvn(sym, "::", 2);
6794 OP *o = newOP(OP_PADSV, 0);
6796 PL_lex_op = readline_overriden
6797 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6798 append_elem(OP_LIST, o,
6799 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
6800 : (OP*)newUNOP(OP_READLINE, 0, o);
6809 ? (GV_ADDMULTI | GV_ADDINEVAL)
6812 PL_lex_op = readline_overriden
6813 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6814 append_elem(OP_LIST,
6815 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
6816 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6817 : (OP*)newUNOP(OP_READLINE, 0,
6818 newUNOP(OP_RV2SV, 0,
6819 newGVOP(OP_GV, 0, gv)));
6821 if (!readline_overriden)
6822 PL_lex_op->op_flags |= OPf_SPECIAL;
6823 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6824 yylval.ival = OP_NULL;
6827 /* If it's none of the above, it must be a literal filehandle
6828 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6830 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6831 PL_lex_op = readline_overriden
6832 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
6833 append_elem(OP_LIST,
6834 newGVOP(OP_GV, 0, gv),
6835 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
6836 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6837 yylval.ival = OP_NULL;
6846 takes: start position in buffer
6847 keep_quoted preserve \ on the embedded delimiter(s)
6848 keep_delims preserve the delimiters around the string
6849 returns: position to continue reading from buffer
6850 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6851 updates the read buffer.
6853 This subroutine pulls a string out of the input. It is called for:
6854 q single quotes q(literal text)
6855 ' single quotes 'literal text'
6856 qq double quotes qq(interpolate $here please)
6857 " double quotes "interpolate $here please"
6858 qx backticks qx(/bin/ls -l)
6859 ` backticks `/bin/ls -l`
6860 qw quote words @EXPORT_OK = qw( func() $spam )
6861 m// regexp match m/this/
6862 s/// regexp substitute s/this/that/
6863 tr/// string transliterate tr/this/that/
6864 y/// string transliterate y/this/that/
6865 ($*@) sub prototypes sub foo ($)
6866 (stuff) sub attr parameters sub foo : attr(stuff)
6867 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6869 In most of these cases (all but <>, patterns and transliterate)
6870 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6871 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6872 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6875 It skips whitespace before the string starts, and treats the first
6876 character as the delimiter. If the delimiter is one of ([{< then
6877 the corresponding "close" character )]}> is used as the closing
6878 delimiter. It allows quoting of delimiters, and if the string has
6879 balanced delimiters ([{<>}]) it allows nesting.
6881 On success, the SV with the resulting string is put into lex_stuff or,
6882 if that is already non-NULL, into lex_repl. The second case occurs only
6883 when parsing the RHS of the special constructs s/// and tr/// (y///).
6884 For convenience, the terminating delimiter character is stuffed into
6889 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6891 SV *sv; /* scalar value: string */
6892 char *tmps; /* temp string, used for delimiter matching */
6893 register char *s = start; /* current position in the buffer */
6894 register char term; /* terminating character */
6895 register char *to; /* current position in the sv's data */
6896 I32 brackets = 1; /* bracket nesting level */
6897 bool has_utf8 = FALSE; /* is there any utf8 content? */
6899 /* skip space before the delimiter */
6903 /* mark where we are, in case we need to report errors */
6906 /* after skipping whitespace, the next character is the terminator */
6908 if (!UTF8_IS_INVARIANT((U8)term) && UTF)
6911 /* mark where we are */
6912 PL_multi_start = CopLINE(PL_curcop);
6913 PL_multi_open = term;
6915 /* find corresponding closing delimiter */
6916 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6918 PL_multi_close = term;
6920 /* create a new SV to hold the contents. 87 is leak category, I'm
6921 assuming. 79 is the SV's initial length. What a random number. */
6923 sv_upgrade(sv, SVt_PVIV);
6925 (void)SvPOK_only(sv); /* validate pointer */
6927 /* move past delimiter and try to read a complete string */
6929 sv_catpvn(sv, s, 1);
6932 /* extend sv if need be */
6933 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6934 /* set 'to' to the next character in the sv's string */
6935 to = SvPVX(sv)+SvCUR(sv);
6937 /* if open delimiter is the close delimiter read unbridle */
6938 if (PL_multi_open == PL_multi_close) {
6939 for (; s < PL_bufend; s++,to++) {
6940 /* embedded newlines increment the current line number */
6941 if (*s == '\n' && !PL_rsfp)
6942 CopLINE_inc(PL_curcop);
6943 /* handle quoted delimiters */
6944 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6945 if (!keep_quoted && s[1] == term)
6947 /* any other quotes are simply copied straight through */
6951 /* terminate when run out of buffer (the for() condition), or
6952 have found the terminator */
6953 else if (*s == term)
6955 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6961 /* if the terminator isn't the same as the start character (e.g.,
6962 matched brackets), we have to allow more in the quoting, and
6963 be prepared for nested brackets.
6966 /* read until we run out of string, or we find the terminator */
6967 for (; s < PL_bufend; s++,to++) {
6968 /* embedded newlines increment the line count */
6969 if (*s == '\n' && !PL_rsfp)
6970 CopLINE_inc(PL_curcop);
6971 /* backslashes can escape the open or closing characters */
6972 if (*s == '\\' && s+1 < PL_bufend) {
6974 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6979 /* allow nested opens and closes */
6980 else if (*s == PL_multi_close && --brackets <= 0)
6982 else if (*s == PL_multi_open)
6984 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
6989 /* terminate the copied string and update the sv's end-of-string */
6991 SvCUR_set(sv, to - SvPVX(sv));
6994 * this next chunk reads more into the buffer if we're not done yet
6998 break; /* handle case where we are done yet :-) */
7000 #ifndef PERL_STRICT_CR
7001 if (to - SvPVX(sv) >= 2) {
7002 if ((to[-2] == '\r' && to[-1] == '\n') ||
7003 (to[-2] == '\n' && to[-1] == '\r'))
7007 SvCUR_set(sv, to - SvPVX(sv));
7009 else if (to[-1] == '\r')
7012 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
7016 /* if we're out of file, or a read fails, bail and reset the current
7017 line marker so we can report where the unterminated string began
7020 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
7022 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
7025 /* we read a line, so increment our line counter */
7026 CopLINE_inc(PL_curcop);
7028 /* update debugger info */
7029 if (PERLDB_LINE && PL_curstash != PL_debstash) {
7030 SV *sv = NEWSV(88,0);
7032 sv_upgrade(sv, SVt_PVMG);
7033 sv_setsv(sv,PL_linestr);
7036 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
7039 /* having changed the buffer, we must update PL_bufend */
7040 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7041 PL_last_lop = PL_last_uni = Nullch;
7044 /* at this point, we have successfully read the delimited string */
7047 sv_catpvn(sv, s, 1);
7050 PL_multi_end = CopLINE(PL_curcop);
7053 /* if we allocated too much space, give some back */
7054 if (SvCUR(sv) + 5 < SvLEN(sv)) {
7055 SvLEN_set(sv, SvCUR(sv) + 1);
7056 Renew(SvPVX(sv), SvLEN(sv), char);
7059 /* decide whether this is the first or second quoted string we've read
7072 takes: pointer to position in buffer
7073 returns: pointer to new position in buffer
7074 side-effects: builds ops for the constant in yylval.op
7076 Read a number in any of the formats that Perl accepts:
7078 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
7079 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
7082 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
7084 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
7087 If it reads a number without a decimal point or an exponent, it will
7088 try converting the number to an integer and see if it can do so
7089 without loss of precision.
7093 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
7095 register char *s = start; /* current position in buffer */
7096 register char *d; /* destination in temp buffer */
7097 register char *e; /* end of temp buffer */
7098 NV nv; /* number read, as a double */
7099 SV *sv = Nullsv; /* place to put the converted number */
7100 bool floatit; /* boolean: int or float? */
7101 char *lastub = 0; /* position of last underbar */
7102 static char number_too_long[] = "Number too long";
7104 /* We use the first character to decide what type of number this is */
7108 Perl_croak(aTHX_ "panic: scan_num");
7110 /* if it starts with a 0, it could be an octal number, a decimal in
7111 0.13 disguise, or a hexadecimal number, or a binary number. */
7115 u holds the "number so far"
7116 shift the power of 2 of the base
7117 (hex == 4, octal == 3, binary == 1)
7118 overflowed was the number more than we can hold?
7120 Shift is used when we add a digit. It also serves as an "are
7121 we in octal/hex/binary?" indicator to disallow hex characters
7127 bool overflowed = FALSE;
7128 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
7129 static char* bases[5] = { "", "binary", "", "octal",
7131 static char* Bases[5] = { "", "Binary", "", "Octal",
7133 static char *maxima[5] = { "",
7134 "0b11111111111111111111111111111111",
7138 char *base, *Base, *max;
7144 } else if (s[1] == 'b') {
7148 /* check for a decimal in disguise */
7149 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
7151 /* so it must be octal */
7158 if (ckWARN(WARN_SYNTAX))
7159 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7160 "Misplaced _ in number");
7164 base = bases[shift];
7165 Base = Bases[shift];
7166 max = maxima[shift];
7168 /* read the rest of the number */
7170 /* x is used in the overflow test,
7171 b is the digit we're adding on. */
7176 /* if we don't mention it, we're done */
7180 /* _ are ignored -- but warned about if consecutive */
7182 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7183 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7184 "Misplaced _ in number");
7188 /* 8 and 9 are not octal */
7191 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
7195 case '2': case '3': case '4':
7196 case '5': case '6': case '7':
7198 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
7202 b = *s++ & 15; /* ASCII digit -> value of digit */
7206 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
7207 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
7208 /* make sure they said 0x */
7213 /* Prepare to put the digit we have onto the end
7214 of the number so far. We check for overflows.
7219 x = u << shift; /* make room for the digit */
7221 if ((x >> shift) != u
7222 && !(PL_hints & HINT_NEW_BINARY)) {
7225 if (ckWARN_d(WARN_OVERFLOW))
7226 Perl_warner(aTHX_ packWARN(WARN_OVERFLOW),
7227 "Integer overflow in %s number",
7230 u = x | b; /* add the digit to the end */
7233 n *= nvshift[shift];
7234 /* If an NV has not enough bits in its
7235 * mantissa to represent an UV this summing of
7236 * small low-order numbers is a waste of time
7237 * (because the NV cannot preserve the
7238 * low-order bits anyway): we could just
7239 * remember when did we overflow and in the
7240 * end just multiply n by the right
7248 /* if we get here, we had success: make a scalar value from
7253 /* final misplaced underbar check */
7255 if (ckWARN(WARN_SYNTAX))
7256 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7261 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7262 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7263 "%s number > %s non-portable",
7269 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7270 Perl_warner(aTHX_ packWARN(WARN_PORTABLE),
7271 "%s number > %s non-portable",
7276 if (PL_hints & HINT_NEW_BINARY)
7277 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7282 handle decimal numbers.
7283 we're also sent here when we read a 0 as the first digit
7285 case '1': case '2': case '3': case '4': case '5':
7286 case '6': case '7': case '8': case '9': case '.':
7289 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7292 /* read next group of digits and _ and copy into d */
7293 while (isDIGIT(*s) || *s == '_') {
7294 /* skip underscores, checking for misplaced ones
7298 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7299 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7300 "Misplaced _ in number");
7304 /* check for end of fixed-length buffer */
7306 Perl_croak(aTHX_ number_too_long);
7307 /* if we're ok, copy the character */
7312 /* final misplaced underbar check */
7313 if (lastub && s == lastub + 1) {
7314 if (ckWARN(WARN_SYNTAX))
7315 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
7318 /* read a decimal portion if there is one. avoid
7319 3..5 being interpreted as the number 3. followed
7322 if (*s == '.' && s[1] != '.') {
7327 if (ckWARN(WARN_SYNTAX))
7328 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7329 "Misplaced _ in number");
7333 /* copy, ignoring underbars, until we run out of digits.
7335 for (; isDIGIT(*s) || *s == '_'; s++) {
7336 /* fixed length buffer check */
7338 Perl_croak(aTHX_ number_too_long);
7340 if (ckWARN(WARN_SYNTAX) && lastub && s == lastub + 1)
7341 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7342 "Misplaced _ in number");
7348 /* fractional part ending in underbar? */
7350 if (ckWARN(WARN_SYNTAX))
7351 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7352 "Misplaced _ in number");
7354 if (*s == '.' && isDIGIT(s[1])) {
7355 /* oops, it's really a v-string, but without the "v" */
7361 /* read exponent part, if present */
7362 if (*s && strchr("eE",*s) && strchr("+-0123456789_", s[1])) {
7366 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7367 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7369 /* stray preinitial _ */
7371 if (ckWARN(WARN_SYNTAX))
7372 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7373 "Misplaced _ in number");
7377 /* allow positive or negative exponent */
7378 if (*s == '+' || *s == '-')
7381 /* stray initial _ */
7383 if (ckWARN(WARN_SYNTAX))
7384 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7385 "Misplaced _ in number");
7389 /* read digits of exponent */
7390 while (isDIGIT(*s) || *s == '_') {
7393 Perl_croak(aTHX_ number_too_long);
7397 if (ckWARN(WARN_SYNTAX) &&
7398 ((lastub && s == lastub + 1) ||
7399 (!isDIGIT(s[1]) && s[1] != '_')))
7400 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7401 "Misplaced _ in number");
7408 /* make an sv from the string */
7412 We try to do an integer conversion first if no characters
7413 indicating "float" have been found.
7418 int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
7420 if (flags == IS_NUMBER_IN_UV) {
7422 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7425 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
7426 if (uv <= (UV) IV_MIN)
7427 sv_setiv(sv, -(IV)uv);
7434 /* terminate the string */
7436 nv = Atof(PL_tokenbuf);
7440 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7441 (PL_hints & HINT_NEW_INTEGER) )
7442 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7443 (floatit ? "float" : "integer"),
7447 /* if it starts with a v, it could be a v-string */
7450 sv = NEWSV(92,5); /* preallocate storage space */
7451 s = scan_vstring(s,sv);
7455 /* make the op for the constant and return */
7458 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7460 lvalp->opval = Nullop;
7466 S_scan_formline(pTHX_ register char *s)
7470 SV *stuff = newSVpvn("",0);
7471 bool needargs = FALSE;
7474 if (*s == '.' || *s == /*{*/'}') {
7476 #ifdef PERL_STRICT_CR
7477 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7479 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7481 if (*t == '\n' || t == PL_bufend)
7484 if (PL_in_eval && !PL_rsfp) {
7485 eol = strchr(s,'\n');
7490 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7492 for (t = s; t < eol; t++) {
7493 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7495 goto enough; /* ~~ must be first line in formline */
7497 if (*t == '@' || *t == '^')
7501 sv_catpvn(stuff, s, eol-s);
7502 #ifndef PERL_STRICT_CR
7503 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7504 char *end = SvPVX(stuff) + SvCUR(stuff);
7516 s = filter_gets(PL_linestr, PL_rsfp, 0);
7517 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7518 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7519 PL_last_lop = PL_last_uni = Nullch;
7522 yyerror("Format not terminated");
7532 PL_lex_state = LEX_NORMAL;
7533 PL_nextval[PL_nexttoke].ival = 0;
7537 PL_lex_state = LEX_FORMLINE;
7538 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7540 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7544 SvREFCNT_dec(stuff);
7545 PL_lex_formbrack = 0;
7556 PL_cshlen = strlen(PL_cshname);
7561 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7563 I32 oldsavestack_ix = PL_savestack_ix;
7564 CV* outsidecv = PL_compcv;
7568 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7570 SAVEI32(PL_subline);
7571 save_item(PL_subname);
7574 SAVESPTR(PL_comppad_name);
7575 SAVESPTR(PL_compcv);
7576 SAVEI32(PL_comppad_name_fill);
7577 SAVEI32(PL_min_intro_pending);
7578 SAVEI32(PL_max_intro_pending);
7579 SAVEI32(PL_pad_reset_pending);
7581 PL_compcv = (CV*)NEWSV(1104,0);
7582 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7583 CvFLAGS(PL_compcv) |= flags;
7585 PL_comppad = newAV();
7586 av_push(PL_comppad, Nullsv);
7587 PL_curpad = AvARRAY(PL_comppad);
7588 PL_comppad_name = newAV();
7589 PL_comppad_name_fill = 0;
7590 PL_min_intro_pending = 0;
7592 PL_subline = CopLINE(PL_curcop);
7593 #ifdef USE_5005THREADS
7594 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7595 PL_curpad[0] = (SV*)newAV();
7596 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7597 #endif /* USE_5005THREADS */
7599 comppadlist = newAV();
7600 AvREAL_off(comppadlist);
7601 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7602 av_store(comppadlist, 1, (SV*)PL_comppad);
7604 CvPADLIST(PL_compcv) = comppadlist;
7605 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7606 #ifdef USE_5005THREADS
7607 CvOWNER(PL_compcv) = 0;
7608 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7609 MUTEX_INIT(CvMUTEXP(PL_compcv));
7610 #endif /* USE_5005THREADS */
7612 return oldsavestack_ix;
7616 #pragma segment Perl_yylex
7619 Perl_yywarn(pTHX_ char *s)
7621 PL_in_eval |= EVAL_WARNONLY;
7623 PL_in_eval &= ~EVAL_WARNONLY;
7628 Perl_yyerror(pTHX_ char *s)
7631 char *context = NULL;
7635 if (!yychar || (yychar == ';' && !PL_rsfp))
7637 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7638 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7641 The code below is removed for NetWare because it abends/crashes on NetWare
7642 when the script has error such as not having the closing quotes like:
7644 Checking of white spaces is anyway done in NetWare code.
7647 while (isSPACE(*PL_oldoldbufptr))
7650 context = PL_oldoldbufptr;
7651 contlen = PL_bufptr - PL_oldoldbufptr;
7653 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7654 PL_oldbufptr != PL_bufptr) {
7657 The code below is removed for NetWare because it abends/crashes on NetWare
7658 when the script has error such as not having the closing quotes like:
7660 Checking of white spaces is anyway done in NetWare code.
7663 while (isSPACE(*PL_oldbufptr))
7666 context = PL_oldbufptr;
7667 contlen = PL_bufptr - PL_oldbufptr;
7669 else if (yychar > 255)
7670 where = "next token ???";
7671 #ifdef USE_PURE_BISON
7672 /* GNU Bison sets the value -2 */
7673 else if (yychar == -2) {
7675 else if ((yychar & 127) == 127) {
7677 if (PL_lex_state == LEX_NORMAL ||
7678 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7679 where = "at end of line";
7680 else if (PL_lex_inpat)
7681 where = "within pattern";
7683 where = "within string";
7686 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7688 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7689 else if (isPRINT_LC(yychar))
7690 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7692 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7693 where = SvPVX(where_sv);
7695 msg = sv_2mortal(newSVpv(s, 0));
7696 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7697 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7699 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7701 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7702 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7703 Perl_sv_catpvf(aTHX_ msg,
7704 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7705 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7708 if (PL_in_eval & EVAL_WARNONLY)
7709 Perl_warn(aTHX_ "%"SVf, msg);
7712 if (PL_error_count >= 10) {
7713 if (PL_in_eval && SvCUR(ERRSV))
7714 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7715 ERRSV, OutCopFILE(PL_curcop));
7717 Perl_croak(aTHX_ "%s has too many errors.\n",
7718 OutCopFILE(PL_curcop));
7721 PL_in_my_stash = Nullhv;
7725 #pragma segment Main
7729 S_swallow_bom(pTHX_ U8 *s)
7732 slen = SvCUR(PL_linestr);
7736 /* UTF-16 little-endian */
7737 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7738 Perl_croak(aTHX_ "Unsupported script encoding");
7739 #ifndef PERL_NO_UTF16_FILTER
7740 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7742 if (PL_bufend > (char*)s) {
7746 filter_add(utf16rev_textfilter, NULL);
7747 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7748 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7749 PL_bufend - (char*)s - 1,
7751 Copy(news, s, newlen, U8);
7752 SvCUR_set(PL_linestr, newlen);
7753 PL_bufend = SvPVX(PL_linestr) + newlen;
7754 news[newlen++] = '\0';
7758 Perl_croak(aTHX_ "Unsupported script encoding");
7763 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7764 #ifndef PERL_NO_UTF16_FILTER
7765 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7767 if (PL_bufend > (char *)s) {
7771 filter_add(utf16_textfilter, NULL);
7772 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7773 PL_bufend = (char*)utf16_to_utf8(s, news,
7774 PL_bufend - (char*)s,
7776 Copy(news, s, newlen, U8);
7777 SvCUR_set(PL_linestr, newlen);
7778 PL_bufend = SvPVX(PL_linestr) + newlen;
7779 news[newlen++] = '\0';
7783 Perl_croak(aTHX_ "Unsupported script encoding");
7788 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7789 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7794 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7795 s[2] == 0xFE && s[3] == 0xFF)
7797 Perl_croak(aTHX_ "Unsupported script encoding");
7805 * Restore a source filter.
7809 restore_rsfp(pTHX_ void *f)
7811 PerlIO *fp = (PerlIO*)f;
7813 if (PL_rsfp == PerlIO_stdin())
7814 PerlIO_clearerr(PL_rsfp);
7815 else if (PL_rsfp && (PL_rsfp != fp))
7816 PerlIO_close(PL_rsfp);
7820 #ifndef PERL_NO_UTF16_FILTER
7822 utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7824 I32 count = FILTER_READ(idx+1, sv, maxlen);
7829 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7830 if (!*SvPV_nolen(sv))
7831 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7834 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7835 sv_usepvn(sv, (char*)tmps, tend - tmps);
7841 utf16rev_textfilter(pTHX_ int idx, SV *sv, int maxlen)
7843 I32 count = FILTER_READ(idx+1, sv, maxlen);
7848 if (!*SvPV_nolen(sv))
7849 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7852 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7853 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7854 sv_usepvn(sv, (char*)tmps, tend - tmps);