3 * Copyright (c) 1991-2001, 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";
30 static void restore_rsfp(pTHXo_ void *f);
31 #ifndef PERL_NO_UTF16_FILTER
32 static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33 static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
36 #define XFAKEBRACK 128
39 /*#define UTF (SvUTF8(PL_linestr) && !(PL_hints & HINT_BYTE))*/
40 #define UTF (PL_hints & HINT_UTF8)
42 /* In variables name $^X, these are the legal values for X.
43 * 1999-02-27 mjd-perl-patch@plover.com */
44 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
46 /* On MacOS, respect nonbreaking spaces */
47 #ifdef MACOS_TRADITIONAL
48 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
50 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
53 /* LEX_* are values for PL_lex_state, the state of the lexer.
54 * They are arranged oddly so that the guard on the switch statement
55 * can get by with a single comparison (if the compiler is smart enough).
58 /* #define LEX_NOTPARSING 11 is done in perl.h. */
61 #define LEX_INTERPNORMAL 9
62 #define LEX_INTERPCASEMOD 8
63 #define LEX_INTERPPUSH 7
64 #define LEX_INTERPSTART 6
65 #define LEX_INTERPEND 5
66 #define LEX_INTERPENDMAYBE 4
67 #define LEX_INTERPCONCAT 3
68 #define LEX_INTERPCONST 2
69 #define LEX_FORMLINE 1
70 #define LEX_KNOWNEXT 0
78 # define YYMAXLEVEL 100
80 YYSTYPE* yylval_pointer[YYMAXLEVEL];
81 int* yychar_pointer[YYMAXLEVEL];
85 # define yylval (*yylval_pointer[yyactlevel])
86 # define yychar (*yychar_pointer[yyactlevel])
87 # define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
89 # define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
94 /* CLINE is a macro that ensures PL_copline has a sane value */
99 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
102 * Convenience functions to return different tokens and prime the
103 * lexer for the next token. They all take an argument.
105 * TOKEN : generic token (used for '(', DOLSHARP, etc)
106 * OPERATOR : generic operator
107 * AOPERATOR : assignment operator
108 * PREBLOCK : beginning the block after an if, while, foreach, ...
109 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
110 * PREREF : *EXPR where EXPR is not a simple identifier
111 * TERM : expression term
112 * LOOPX : loop exiting command (goto, last, dump, etc)
113 * FTST : file test operator
114 * FUN0 : zero-argument function
115 * FUN1 : not used, except for not, which isn't a UNIOP
116 * BOop : bitwise or or xor
118 * SHop : shift operator
119 * PWop : power operator
120 * PMop : pattern-matching operator
121 * Aop : addition-level operator
122 * Mop : multiplication-level operator
123 * Eop : equality-testing operator
124 * Rop : relational operator <= != gt
126 * Also see LOP and lop() below.
129 #ifdef DEBUGGING /* Serve -DT. */
130 # define REPORT(x,retval) tokereport(x,s,(int)retval)
131 # define REPORT2(x,retval) tokereport(x,s, yylval.ival)
133 # define REPORT(x,retval) 1
134 # define REPORT2(x,retval) 1
137 #define TOKEN(retval) return (REPORT2("token",retval), PL_bufptr = s,(int)retval)
138 #define OPERATOR(retval) return (REPORT2("operator",retval), PL_expect = XTERM, PL_bufptr = s,(int)retval)
139 #define AOPERATOR(retval) return ao((REPORT2("aop",retval), PL_expect = XTERM, PL_bufptr = s,(int)retval))
140 #define PREBLOCK(retval) return (REPORT2("preblock",retval), PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
141 #define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval), PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
142 #define PREREF(retval) return (REPORT2("preref",retval), PL_expect = XREF,PL_bufptr = s,(int)retval)
143 #define TERM(retval) return (CLINE, REPORT2("term",retval), PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
144 #define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f), PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
145 #define FTST(f) return(yylval.ival=f, REPORT("ftst",f), PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
146 #define FUN0(f) return(yylval.ival = f, REPORT("fun0",f), PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
147 #define FUN1(f) return(yylval.ival = f, REPORT("fun1",f), PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
148 #define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f), PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
149 #define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f), PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
150 #define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f), PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
151 #define PWop(f) return ao((yylval.ival=f, REPORT("powop",f), PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
152 #define PMop(f) return(yylval.ival=f, REPORT("matchop",f), PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
153 #define Aop(f) return ao((yylval.ival=f, REPORT("add",f), PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
154 #define Mop(f) return ao((yylval.ival=f, REPORT("mul",f), PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
155 #define Eop(f) return(yylval.ival=f, REPORT("eq",f), PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
156 #define Rop(f) return(yylval.ival=f, REPORT("rel",f), PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
158 /* This bit of chicanery makes a unary function followed by
159 * a parenthesis into a function with one argument, highest precedence.
161 #define UNI(f) return(yylval.ival = f, \
165 PL_last_uni = PL_oldbufptr, \
166 PL_last_lop_op = f, \
167 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
169 #define UNIBRACK(f) return(yylval.ival = f, \
172 PL_last_uni = PL_oldbufptr, \
173 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
175 /* grandfather return to old style */
176 #define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
179 S_tokereport(pTHX_ char *thing, char* s, I32 rv)
183 report = newSVpv(thing, 0);
184 Perl_sv_catpvf(aTHX_ report, ":line %i:%i:", CopLINE(PL_curcop), rv);
186 if (s - PL_bufptr > 0)
187 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
189 if (PL_oldbufptr && *PL_oldbufptr)
190 sv_catpv(report, PL_tokenbuf);
192 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
199 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
200 * into an OP_ANDASSIGN or OP_ORASSIGN
204 S_ao(pTHX_ int toketype)
206 if (*PL_bufptr == '=') {
208 if (toketype == ANDAND)
209 yylval.ival = OP_ANDASSIGN;
210 else if (toketype == OROR)
211 yylval.ival = OP_ORASSIGN;
219 * When Perl expects an operator and finds something else, no_op
220 * prints the warning. It always prints "<something> found where
221 * operator expected. It prints "Missing semicolon on previous line?"
222 * if the surprise occurs at the start of the line. "do you need to
223 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
224 * where the compiler doesn't know if foo is a method call or a function.
225 * It prints "Missing operator before end of line" if there's nothing
226 * after the missing operator, or "... before <...>" if there is something
227 * after the missing operator.
231 S_no_op(pTHX_ char *what, char *s)
233 char *oldbp = PL_bufptr;
234 bool is_first = (PL_oldbufptr == PL_linestart);
240 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
242 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
243 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
245 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
246 if (t < PL_bufptr && isSPACE(*t))
247 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
248 t - PL_oldoldbufptr, PL_oldoldbufptr);
252 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
259 * Complain about missing quote/regexp/heredoc terminator.
260 * If it's called with (char *)NULL then it cauterizes the line buffer.
261 * If we're in a delimited string and the delimiter is a control
262 * character, it's reformatted into a two-char sequence like ^C.
267 S_missingterm(pTHX_ char *s)
272 char *nl = strrchr(s,'\n');
278 iscntrl(PL_multi_close)
280 PL_multi_close < 32 || PL_multi_close == 127
284 tmpbuf[1] = toCTRL(PL_multi_close);
290 *tmpbuf = PL_multi_close;
294 q = strchr(s,'"') ? '\'' : '"';
295 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
303 Perl_deprecate(pTHX_ char *s)
305 if (ckWARN(WARN_DEPRECATED))
306 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
311 * Deprecate a comma-less variable list.
317 deprecate("comma-less variable list");
321 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
322 * utf16-to-utf8-reversed.
325 #ifdef PERL_CR_FILTER
329 register char *s = SvPVX(sv);
330 register char *e = s + SvCUR(sv);
331 /* outer loop optimized to do nothing if there are no CR-LFs */
333 if (*s++ == '\r' && *s == '\n') {
334 /* hit a CR-LF, need to copy the rest */
335 register char *d = s - 1;
338 if (*s == '\r' && s[1] == '\n')
349 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
351 I32 count = FILTER_READ(idx+1, sv, maxlen);
352 if (count > 0 && !maxlen)
360 * Initialize variables. Uses the Perl save_stack to save its state (for
361 * recursive calls to the parser).
365 Perl_lex_start(pTHX_ SV *line)
370 SAVEI32(PL_lex_dojoin);
371 SAVEI32(PL_lex_brackets);
372 SAVEI32(PL_lex_casemods);
373 SAVEI32(PL_lex_starts);
374 SAVEI32(PL_lex_state);
375 SAVEVPTR(PL_lex_inpat);
376 SAVEI32(PL_lex_inwhat);
377 if (PL_lex_state == LEX_KNOWNEXT) {
378 I32 toke = PL_nexttoke;
379 while (--toke >= 0) {
380 SAVEI32(PL_nexttype[toke]);
381 SAVEVPTR(PL_nextval[toke]);
383 SAVEI32(PL_nexttoke);
385 SAVECOPLINE(PL_curcop);
388 SAVEPPTR(PL_oldbufptr);
389 SAVEPPTR(PL_oldoldbufptr);
390 SAVEPPTR(PL_linestart);
391 SAVESPTR(PL_linestr);
392 SAVEPPTR(PL_lex_brackstack);
393 SAVEPPTR(PL_lex_casestack);
394 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
395 SAVESPTR(PL_lex_stuff);
396 SAVEI32(PL_lex_defer);
397 SAVEI32(PL_sublex_info.sub_inwhat);
398 SAVESPTR(PL_lex_repl);
400 SAVEINT(PL_lex_expect);
402 PL_lex_state = LEX_NORMAL;
406 New(899, PL_lex_brackstack, 120, char);
407 New(899, PL_lex_casestack, 12, char);
408 SAVEFREEPV(PL_lex_brackstack);
409 SAVEFREEPV(PL_lex_casestack);
411 *PL_lex_casestack = '\0';
414 PL_lex_stuff = Nullsv;
415 PL_lex_repl = Nullsv;
419 PL_sublex_info.sub_inwhat = 0;
421 if (SvREADONLY(PL_linestr))
422 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
423 s = SvPV(PL_linestr, len);
424 if (len && s[len-1] != ';') {
425 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
426 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
427 sv_catpvn(PL_linestr, "\n;", 2);
429 SvTEMP_off(PL_linestr);
430 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
431 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
433 PL_rs = newSVpvn("\n", 1);
439 * Finalizer for lexing operations. Must be called when the parser is
440 * done with the lexer.
446 PL_doextract = FALSE;
451 * This subroutine has nothing to do with tilting, whether at windmills
452 * or pinball tables. Its name is short for "increment line". It
453 * increments the current line number in CopLINE(PL_curcop) and checks
454 * to see whether the line starts with a comment of the form
455 * # line 500 "foo.pm"
456 * If so, it sets the current line number and file to the values in the comment.
460 S_incline(pTHX_ char *s)
467 CopLINE_inc(PL_curcop);
470 while (SPACE_OR_TAB(*s)) s++;
471 if (strnEQ(s, "line", 4))
475 if (SPACE_OR_TAB(*s))
479 while (SPACE_OR_TAB(*s)) s++;
485 while (SPACE_OR_TAB(*s))
487 if (*s == '"' && (t = strchr(s+1, '"'))) {
492 for (t = s; !isSPACE(*t); t++) ;
495 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
497 if (*e != '\n' && *e != '\0')
498 return; /* false alarm */
504 Safefree(CopFILE(PL_curcop));
506 SvREFCNT_dec(CopFILEGV(PL_curcop));
508 CopFILE_set(PL_curcop, s);
511 CopLINE_set(PL_curcop, atoi(n)-1);
516 * Called to gobble the appropriate amount and type of whitespace.
517 * Skips comments as well.
521 S_skipspace(pTHX_ register char *s)
523 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
524 while (s < PL_bufend && SPACE_OR_TAB(*s))
530 SSize_t oldprevlen, oldoldprevlen;
531 SSize_t oldloplen, oldunilen;
532 while (s < PL_bufend && isSPACE(*s)) {
533 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
538 if (s < PL_bufend && *s == '#') {
539 while (s < PL_bufend && *s != '\n')
543 if (PL_in_eval && !PL_rsfp) {
550 /* only continue to recharge the buffer if we're at the end
551 * of the buffer, we're not reading from a source filter, and
552 * we're in normal lexing mode
554 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
555 PL_lex_state == LEX_FORMLINE)
558 /* try to recharge the buffer */
559 if ((s = filter_gets(PL_linestr, PL_rsfp,
560 (prevlen = SvCUR(PL_linestr)))) == Nullch)
562 /* end of file. Add on the -p or -n magic */
563 if (PL_minus_n || PL_minus_p) {
564 sv_setpv(PL_linestr,PL_minus_p ?
565 ";}continue{print or die qq(-p destination: $!\\n)" :
567 sv_catpv(PL_linestr,";}");
568 PL_minus_n = PL_minus_p = 0;
571 sv_setpv(PL_linestr,";");
573 /* reset variables for next time we lex */
574 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
576 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
578 /* Close the filehandle. Could be from -P preprocessor,
579 * STDIN, or a regular file. If we were reading code from
580 * STDIN (because the commandline held no -e or filename)
581 * then we don't close it, we reset it so the code can
582 * read from STDIN too.
585 if (PL_preprocess && !PL_in_eval)
586 (void)PerlProc_pclose(PL_rsfp);
587 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
588 PerlIO_clearerr(PL_rsfp);
590 (void)PerlIO_close(PL_rsfp);
595 /* not at end of file, so we only read another line */
596 /* make corresponding updates to old pointers, for yyerror() */
597 oldprevlen = PL_oldbufptr - PL_bufend;
598 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
600 oldunilen = PL_last_uni - PL_bufend;
602 oldloplen = PL_last_lop - PL_bufend;
603 PL_linestart = PL_bufptr = s + prevlen;
604 PL_bufend = s + SvCUR(PL_linestr);
606 PL_oldbufptr = s + oldprevlen;
607 PL_oldoldbufptr = s + oldoldprevlen;
609 PL_last_uni = s + oldunilen;
611 PL_last_lop = s + oldloplen;
614 /* debugger active and we're not compiling the debugger code,
615 * so store the line into the debugger's array of lines
617 if (PERLDB_LINE && PL_curstash != PL_debstash) {
618 SV *sv = NEWSV(85,0);
620 sv_upgrade(sv, SVt_PVMG);
621 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
622 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
629 * Check the unary operators to ensure there's no ambiguity in how they're
630 * used. An ambiguous piece of code would be:
632 * This doesn't mean rand() + 5. Because rand() is a unary operator,
633 * the +5 is its argument.
642 if (PL_oldoldbufptr != PL_last_uni)
644 while (isSPACE(*PL_last_uni))
646 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
647 if ((t = strchr(s, '(')) && t < PL_bufptr)
649 if (ckWARN_d(WARN_AMBIGUOUS)){
652 Perl_warner(aTHX_ WARN_AMBIGUOUS,
653 "Warning: Use of \"%s\" without parens is ambiguous",
659 /* workaround to replace the UNI() macro with a function. Only the
660 * hints/uts.sh file mentions this. Other comments elsewhere in the
661 * source indicate Microport Unix might need it too.
667 #define UNI(f) return uni(f,s)
670 S_uni(pTHX_ I32 f, char *s)
675 PL_last_uni = PL_oldbufptr;
686 #endif /* CRIPPLED_CC */
689 * LOP : macro to build a list operator. Its behaviour has been replaced
690 * with a subroutine, S_lop() for which LOP is just another name.
693 #define LOP(f,x) return lop(f,x,s)
697 * Build a list operator (or something that might be one). The rules:
698 * - if we have a next token, then it's a list operator [why?]
699 * - if the next thing is an opening paren, then it's a function
700 * - else it's a list operator
704 S_lop(pTHX_ I32 f, int x, char *s)
711 PL_last_lop = PL_oldbufptr;
726 * When the lexer realizes it knows the next token (for instance,
727 * it is reordering tokens for the parser) then it can call S_force_next
728 * to know what token to return the next time the lexer is called. Caller
729 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
730 * handles the token correctly.
734 S_force_next(pTHX_ I32 type)
736 PL_nexttype[PL_nexttoke] = type;
738 if (PL_lex_state != LEX_KNOWNEXT) {
739 PL_lex_defer = PL_lex_state;
740 PL_lex_expect = PL_expect;
741 PL_lex_state = LEX_KNOWNEXT;
747 * When the lexer knows the next thing is a word (for instance, it has
748 * just seen -> and it knows that the next char is a word char, then
749 * it calls S_force_word to stick the next word into the PL_next lookahead.
752 * char *start : buffer position (must be within PL_linestr)
753 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
754 * int check_keyword : if true, Perl checks to make sure the word isn't
755 * a keyword (do this if the word is a label, e.g. goto FOO)
756 * int allow_pack : if true, : characters will also be allowed (require,
758 * int allow_initial_tick : used by the "sub" lexer only.
762 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
767 start = skipspace(start);
769 if (isIDFIRST_lazy_if(s,UTF) ||
770 (allow_pack && *s == ':') ||
771 (allow_initial_tick && *s == '\'') )
773 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
774 if (check_keyword && keyword(PL_tokenbuf, len))
776 if (token == METHOD) {
781 PL_expect = XOPERATOR;
784 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
785 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
793 * Called when the lexer wants $foo *foo &foo etc, but the program
794 * text only contains the "foo" portion. The first argument is a pointer
795 * to the "foo", and the second argument is the type symbol to prefix.
796 * Forces the next token to be a "WORD".
797 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
801 S_force_ident(pTHX_ register char *s, int kind)
804 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
805 PL_nextval[PL_nexttoke].opval = o;
808 o->op_private = OPpCONST_ENTERED;
809 /* XXX see note in pp_entereval() for why we forgo typo
810 warnings if the symbol must be introduced in an eval.
812 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
813 kind == '$' ? SVt_PV :
814 kind == '@' ? SVt_PVAV :
815 kind == '%' ? SVt_PVHV :
823 Perl_str_to_version(pTHX_ SV *sv)
828 char *start = SvPVx(sv,len);
829 bool utf = SvUTF8(sv) ? TRUE : FALSE;
830 char *end = start + len;
831 while (start < end) {
835 n = utf8_to_uv((U8*)start, len, &skip, 0);
840 retval += ((NV)n)/nshift;
849 * Forces the next token to be a version number.
853 S_force_version(pTHX_ char *s)
855 OP *version = Nullop;
864 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
865 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
867 s = scan_num(s, &yylval);
868 version = yylval.opval;
869 ver = cSVOPx(version)->op_sv;
870 if (SvPOK(ver) && !SvNIOK(ver)) {
871 (void)SvUPGRADE(ver, SVt_PVNV);
872 SvNVX(ver) = str_to_version(ver);
873 SvNOK_on(ver); /* hint that it is a version */
878 /* NOTE: The parser sees the package name and the VERSION swapped */
879 PL_nextval[PL_nexttoke].opval = version;
887 * Tokenize a quoted string passed in as an SV. It finds the next
888 * chunk, up to end of string or a backslash. It may make a new
889 * SV containing that chunk (if HINT_NEW_STRING is on). It also
894 S_tokeq(pTHX_ SV *sv)
905 s = SvPV_force(sv, len);
906 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
909 while (s < send && *s != '\\')
914 if ( PL_hints & HINT_NEW_STRING )
915 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
918 if (s + 1 < send && (s[1] == '\\'))
919 s++; /* all that, just for this */
924 SvCUR_set(sv, d - SvPVX(sv));
926 if ( PL_hints & HINT_NEW_STRING )
927 return new_constant(NULL, 0, "q", sv, pv, "q");
932 * Now come three functions related to double-quote context,
933 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
934 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
935 * interact with PL_lex_state, and create fake ( ... ) argument lists
936 * to handle functions and concatenation.
937 * They assume that whoever calls them will be setting up a fake
938 * join call, because each subthing puts a ',' after it. This lets
941 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
943 * (I'm not sure whether the spurious commas at the end of lcfirst's
944 * arguments and join's arguments are created or not).
949 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
951 * Pattern matching will set PL_lex_op to the pattern-matching op to
952 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
954 * OP_CONST and OP_READLINE are easy--just make the new op and return.
956 * Everything else becomes a FUNC.
958 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
959 * had an OP_CONST or OP_READLINE). This just sets us up for a
960 * call to S_sublex_push().
966 register I32 op_type = yylval.ival;
968 if (op_type == OP_NULL) {
969 yylval.opval = PL_lex_op;
973 if (op_type == OP_CONST || op_type == OP_READLINE) {
974 SV *sv = tokeq(PL_lex_stuff);
976 if (SvTYPE(sv) == SVt_PVIV) {
977 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
983 nsv = newSVpvn(p, len);
989 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
990 PL_lex_stuff = Nullsv;
994 PL_sublex_info.super_state = PL_lex_state;
995 PL_sublex_info.sub_inwhat = op_type;
996 PL_sublex_info.sub_op = PL_lex_op;
997 PL_lex_state = LEX_INTERPPUSH;
1001 yylval.opval = PL_lex_op;
1011 * Create a new scope to save the lexing state. The scope will be
1012 * ended in S_sublex_done. Returns a '(', starting the function arguments
1013 * to the uc, lc, etc. found before.
1014 * Sets PL_lex_state to LEX_INTERPCONCAT.
1022 PL_lex_state = PL_sublex_info.super_state;
1023 SAVEI32(PL_lex_dojoin);
1024 SAVEI32(PL_lex_brackets);
1025 SAVEI32(PL_lex_casemods);
1026 SAVEI32(PL_lex_starts);
1027 SAVEI32(PL_lex_state);
1028 SAVEVPTR(PL_lex_inpat);
1029 SAVEI32(PL_lex_inwhat);
1030 SAVECOPLINE(PL_curcop);
1031 SAVEPPTR(PL_bufptr);
1032 SAVEPPTR(PL_oldbufptr);
1033 SAVEPPTR(PL_oldoldbufptr);
1034 SAVEPPTR(PL_linestart);
1035 SAVESPTR(PL_linestr);
1036 SAVEPPTR(PL_lex_brackstack);
1037 SAVEPPTR(PL_lex_casestack);
1039 PL_linestr = PL_lex_stuff;
1040 PL_lex_stuff = Nullsv;
1042 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1043 = SvPVX(PL_linestr);
1044 PL_bufend += SvCUR(PL_linestr);
1045 SAVEFREESV(PL_linestr);
1047 PL_lex_dojoin = FALSE;
1048 PL_lex_brackets = 0;
1049 New(899, PL_lex_brackstack, 120, char);
1050 New(899, PL_lex_casestack, 12, char);
1051 SAVEFREEPV(PL_lex_brackstack);
1052 SAVEFREEPV(PL_lex_casestack);
1053 PL_lex_casemods = 0;
1054 *PL_lex_casestack = '\0';
1056 PL_lex_state = LEX_INTERPCONCAT;
1057 CopLINE_set(PL_curcop, PL_multi_start);
1059 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1060 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1061 PL_lex_inpat = PL_sublex_info.sub_op;
1063 PL_lex_inpat = Nullop;
1070 * Restores lexer state after a S_sublex_push.
1076 if (!PL_lex_starts++) {
1077 SV *sv = newSVpvn("",0);
1078 if (SvUTF8(PL_linestr))
1080 PL_expect = XOPERATOR;
1081 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1085 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1086 PL_lex_state = LEX_INTERPCASEMOD;
1090 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
1091 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1092 PL_linestr = PL_lex_repl;
1094 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1095 PL_bufend += SvCUR(PL_linestr);
1096 SAVEFREESV(PL_linestr);
1097 PL_lex_dojoin = FALSE;
1098 PL_lex_brackets = 0;
1099 PL_lex_casemods = 0;
1100 *PL_lex_casestack = '\0';
1102 if (SvEVALED(PL_lex_repl)) {
1103 PL_lex_state = LEX_INTERPNORMAL;
1105 /* we don't clear PL_lex_repl here, so that we can check later
1106 whether this is an evalled subst; that means we rely on the
1107 logic to ensure sublex_done() is called again only via the
1108 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
1111 PL_lex_state = LEX_INTERPCONCAT;
1112 PL_lex_repl = Nullsv;
1118 PL_bufend = SvPVX(PL_linestr);
1119 PL_bufend += SvCUR(PL_linestr);
1120 PL_expect = XOPERATOR;
1121 PL_sublex_info.sub_inwhat = 0;
1129 Extracts a pattern, double-quoted string, or transliteration. This
1132 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1133 processing a pattern (PL_lex_inpat is true), a transliteration
1134 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1136 Returns a pointer to the character scanned up to. Iff this is
1137 advanced from the start pointer supplied (ie if anything was
1138 successfully parsed), will leave an OP for the substring scanned
1139 in yylval. Caller must intuit reason for not parsing further
1140 by looking at the next characters herself.
1144 double-quoted style: \r and \n
1145 regexp special ones: \D \s
1147 backrefs: \1 (deprecated in substitution replacements)
1148 case and quoting: \U \Q \E
1149 stops on @ and $, but not for $ as tail anchor
1151 In transliterations:
1152 characters are VERY literal, except for - not at the start or end
1153 of the string, which indicates a range. scan_const expands the
1154 range to the full set of intermediate characters.
1156 In double-quoted strings:
1158 double-quoted style: \r and \n
1160 backrefs: \1 (deprecated)
1161 case and quoting: \U \Q \E
1164 scan_const does *not* construct ops to handle interpolated strings.
1165 It stops processing as soon as it finds an embedded $ or @ variable
1166 and leaves it to the caller to work out what's going on.
1168 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1170 $ in pattern could be $foo or could be tail anchor. Assumption:
1171 it's a tail anchor if $ is the last thing in the string, or if it's
1172 followed by one of ")| \n\t"
1174 \1 (backreferences) are turned into $1
1176 The structure of the code is
1177 while (there's a character to process) {
1178 handle transliteration ranges
1179 skip regexp comments
1180 skip # initiated comments in //x patterns
1181 check for embedded @foo
1182 check for embedded scalars
1184 leave intact backslashes from leave (below)
1185 deprecate \1 in strings and sub replacements
1186 handle string-changing backslashes \l \U \Q \E, etc.
1187 switch (what was escaped) {
1188 handle - in a transliteration (becomes a literal -)
1189 handle \132 octal characters
1190 handle 0x15 hex characters
1191 handle \cV (control V)
1192 handle printf backslashes (\f, \r, \n, etc)
1194 } (end if backslash)
1195 } (end while character to read)
1200 S_scan_const(pTHX_ char *start)
1202 register char *send = PL_bufend; /* end of the constant */
1203 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1204 register char *s = start; /* start of the constant */
1205 register char *d = SvPVX(sv); /* destination for copies */
1206 bool dorange = FALSE; /* are we in a translit range? */
1207 bool didrange = FALSE; /* did we just finish a range? */
1208 bool has_utf8 = (PL_linestr && SvUTF8(PL_linestr));
1209 /* the constant is UTF8 */
1212 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1213 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1215 I32 this_utf8 = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
1216 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1217 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
1219 const char *leaveit = /* set of acceptably-backslashed characters */
1221 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
1224 while (s < send || dorange) {
1225 /* get transliterations out of the way (they're most literal) */
1226 if (PL_lex_inwhat == OP_TRANS) {
1227 /* expand a range A-Z to the full set of characters. AIE! */
1229 UV i; /* current expanded character */
1230 UV min; /* first character in range */
1231 UV max; /* last character in range */
1233 i = d - SvPVX(sv); /* remember current offset */
1234 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1235 d = SvPVX(sv) + i; /* refresh d after realloc */
1236 d -= 2; /* eat the first char and the - */
1238 min = (U8)*d; /* first char in range */
1239 max = (U8)d[1]; /* last char in range */
1243 "Invalid [] range \"\\x%"UVxf"-\\x%"UVxf"\" in transliteration operator",
1247 #ifdef ALPHAS_HAVE_GAPS
1248 /* BROKEN FOR EBCDIC, see regcomp.c:reglass() */
1249 if ((isLOWER(min) && isLOWER(max)) ||
1250 (isUPPER(min) && isUPPER(max))) {
1252 for (i = min; i <= max; i++)
1256 for (i = min; i <= max; i++)
1263 for (i = min; i <= max; i++)
1266 /* mark the range as done, and continue */
1272 /* range begins (ignore - as first or last char) */
1273 else if (*s == '-' && s+1 < send && s != start) {
1275 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
1278 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
1290 /* if we get here, we're not doing a transliteration */
1292 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1293 except for the last char, which will be done separately. */
1294 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
1296 while (s < send && *s != ')')
1299 else if (s[2] == '{' /* This should match regcomp.c */
1300 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1303 char *regparse = s + (s[2] == '{' ? 3 : 4);
1306 while (count && (c = *regparse)) {
1307 if (c == '\\' && regparse[1])
1315 if (*regparse != ')') {
1316 regparse--; /* Leave one char for continuation. */
1317 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
1319 while (s < regparse)
1324 /* likewise skip #-initiated comments in //x patterns */
1325 else if (*s == '#' && PL_lex_inpat &&
1326 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
1327 while (s+1 < send && *s != '\n')
1331 /* check for embedded arrays
1332 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1334 else if (*s == '@' && s[1]
1335 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
1338 /* check for embedded scalars. only stop if we're sure it's a
1341 else if (*s == '$') {
1342 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
1344 if (s + 1 < send && !strchr("()| \n\t", s[1]))
1345 break; /* in regexp, $ might be tail anchor */
1349 if (*s == '\\' && s+1 < send) {
1352 /* some backslashes we leave behind */
1353 if (*leaveit && *s && strchr(leaveit, *s)) {
1359 /* deprecate \1 in strings and substitution replacements */
1360 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
1361 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
1363 if (ckWARN(WARN_SYNTAX))
1364 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
1369 /* string-change backslash escapes */
1370 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
1375 /* if we get here, it's either a quoted -, or a digit */
1378 /* quoted - in transliterations */
1380 if (PL_lex_inwhat == OP_TRANS) {
1387 if (ckWARN(WARN_MISC) && isALNUM(*s))
1388 Perl_warner(aTHX_ WARN_MISC,
1389 "Unrecognized escape \\%c passed through",
1391 /* default action is to copy the quoted character */
1392 goto default_action;
1395 /* \132 indicates an octal constant */
1396 case '0': case '1': case '2': case '3':
1397 case '4': case '5': case '6': case '7':
1399 STRLEN len = 0; /* disallow underscores */
1400 uv = (UV)scan_oct(s, 3, &len);
1403 goto NUM_ESCAPE_INSERT;
1405 /* \x24 indicates a hex constant */
1409 char* e = strchr(s, '}');
1411 yyerror("Missing right brace on \\x{}");
1415 STRLEN len = 1; /* allow underscores */
1416 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1422 STRLEN len = 0; /* disallow underscores */
1423 uv = (UV)scan_hex(s, 2, &len);
1429 /* Insert oct or hex escaped character.
1430 * There will always enough room in sv since such
1431 * escapes will be longer than any UT-F8 sequence
1432 * they can end up as. */
1434 /* This spot is wrong for EBCDIC. Characters like
1435 * the lowercase letters and digits are >127 in EBCDIC,
1436 * so here they would need to be mapped to the Unicode
1437 * repertoire. --jhi */
1440 if (!has_utf8 && uv > 255) {
1441 /* Might need to recode whatever we have
1442 * accumulated so far if it contains any
1445 * (Can't we keep track of that and avoid
1446 * this rescan? --jhi)
1451 for (c = SvPVX(sv); c < d; c++) {
1452 if (UTF8_IS_CONTINUED(*c))
1456 char *old_pvx = SvPVX(sv);
1460 SvCUR(sv) + hicount + 1) +
1468 if (UTF8_IS_CONTINUED(*src)) {
1469 *dst-- = UTF8_EIGHT_BIT_LO(*src);
1470 *dst-- = UTF8_EIGHT_BIT_HI(*src--);
1479 if (has_utf8 || uv > 255) {
1480 d = (char*)uv_to_utf8((U8*)d, uv);
1482 if (PL_lex_inwhat == OP_TRANS &&
1483 PL_sublex_info.sub_op) {
1484 PL_sublex_info.sub_op->op_private |=
1485 (PL_lex_repl ? OPpTRANS_FROM_UTF
1499 /* \N{latin small letter a} is a named character */
1503 char* e = strchr(s, '}');
1509 yyerror("Missing right brace on \\N{}");
1513 res = newSVpvn(s + 1, e - s - 1);
1514 res = new_constant( Nullch, 0, "charnames",
1515 res, Nullsv, "\\N{...}" );
1517 sv_utf8_upgrade(res);
1518 str = SvPV(res,len);
1519 if (!has_utf8 && SvUTF8(res)) {
1520 char *ostart = SvPVX(sv);
1521 SvCUR_set(sv, d - ostart);
1524 sv_utf8_upgrade(sv);
1525 /* this just broke our allocation above... */
1526 SvGROW(sv, send - start);
1527 d = SvPVX(sv) + SvCUR(sv);
1530 if (len > e - s + 4) {
1531 char *odest = SvPVX(sv);
1533 SvGROW(sv, (SvCUR(sv) + len - (e - s + 4)));
1534 d = SvPVX(sv) + (d - odest);
1536 Copy(str, d, len, char);
1543 yyerror("Missing braces on \\N{}");
1546 /* \c is a control character */
1563 /* printf-style backslashes, formfeeds, newlines, etc */
1581 *d++ = '\047'; /* CP 1047 */
1584 *d++ = '\057'; /* CP 1047 */
1598 } /* end if (backslash) */
1601 if (UTF8_IS_CONTINUED(*s) && (this_utf8 || has_utf8)) {
1602 STRLEN len = (STRLEN) -1;
1605 uv = utf8_to_uv((U8*)s, send - s, &len, 0);
1607 if (len == (STRLEN)-1) {
1608 /* Illegal UTF8 (a high-bit byte), make it valid. */
1609 char *old_pvx = SvPVX(sv);
1610 /* need space for one extra char (NOTE: SvCUR() not set here) */
1611 d = SvGROW(sv, SvLEN(sv) + 1) + (d - old_pvx);
1612 d = (char*)uv_to_utf8((U8*)d, (U8)*s++);
1619 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1620 PL_sublex_info.sub_op->op_private |=
1621 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1628 } /* while loop to process each character */
1630 /* terminate the string and set up the sv */
1632 SvCUR_set(sv, d - SvPVX(sv));
1637 /* shrink the sv if we allocated more than we used */
1638 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1639 SvLEN_set(sv, SvCUR(sv) + 1);
1640 Renew(SvPVX(sv), SvLEN(sv), char);
1643 /* return the substring (via yylval) only if we parsed anything */
1644 if (s > PL_bufptr) {
1645 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
1646 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
1648 ( PL_lex_inwhat == OP_TRANS
1650 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
1653 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
1660 * Returns TRUE if there's more to the expression (e.g., a subscript),
1663 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1665 * ->[ and ->{ return TRUE
1666 * { and [ outside a pattern are always subscripts, so return TRUE
1667 * if we're outside a pattern and it's not { or [, then return FALSE
1668 * if we're in a pattern and the first char is a {
1669 * {4,5} (any digits around the comma) returns FALSE
1670 * if we're in a pattern and the first char is a [
1672 * [SOMETHING] has a funky algorithm to decide whether it's a
1673 * character class or not. It has to deal with things like
1674 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1675 * anything else returns TRUE
1678 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
1681 S_intuit_more(pTHX_ register char *s)
1683 if (PL_lex_brackets)
1685 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1687 if (*s != '{' && *s != '[')
1692 /* In a pattern, so maybe we have {n,m}. */
1709 /* On the other hand, maybe we have a character class */
1712 if (*s == ']' || *s == '^')
1715 /* this is terrifying, and it works */
1716 int weight = 2; /* let's weigh the evidence */
1718 unsigned char un_char = 255, last_un_char;
1719 char *send = strchr(s,']');
1720 char tmpbuf[sizeof PL_tokenbuf * 4];
1722 if (!send) /* has to be an expression */
1725 Zero(seen,256,char);
1728 else if (isDIGIT(*s)) {
1730 if (isDIGIT(s[1]) && s[2] == ']')
1736 for (; s < send; s++) {
1737 last_un_char = un_char;
1738 un_char = (unsigned char)*s;
1743 weight -= seen[un_char] * 10;
1744 if (isALNUM_lazy_if(s+1,UTF)) {
1745 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
1746 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
1751 else if (*s == '$' && s[1] &&
1752 strchr("[#!%*<>()-=",s[1])) {
1753 if (/*{*/ strchr("])} =",s[2]))
1762 if (strchr("wds]",s[1]))
1764 else if (seen['\''] || seen['"'])
1766 else if (strchr("rnftbxcav",s[1]))
1768 else if (isDIGIT(s[1])) {
1770 while (s[1] && isDIGIT(s[1]))
1780 if (strchr("aA01! ",last_un_char))
1782 if (strchr("zZ79~",s[1]))
1784 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1785 weight -= 5; /* cope with negative subscript */
1788 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
1789 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1794 if (keyword(tmpbuf, d - tmpbuf))
1797 if (un_char == last_un_char + 1)
1799 weight -= seen[un_char];
1804 if (weight >= 0) /* probably a character class */
1814 * Does all the checking to disambiguate
1816 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1817 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1819 * First argument is the stuff after the first token, e.g. "bar".
1821 * Not a method if bar is a filehandle.
1822 * Not a method if foo is a subroutine prototyped to take a filehandle.
1823 * Not a method if it's really "Foo $bar"
1824 * Method if it's "foo $bar"
1825 * Not a method if it's really "print foo $bar"
1826 * Method if it's really "foo package::" (interpreted as package->foo)
1827 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
1828 * Not a method if bar is a filehandle or package, but is quoted with
1833 S_intuit_method(pTHX_ char *start, GV *gv)
1835 char *s = start + (*start == '$');
1836 char tmpbuf[sizeof PL_tokenbuf];
1844 if ((cv = GvCVu(gv))) {
1845 char *proto = SvPVX(cv);
1855 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
1856 /* start is the beginning of the possible filehandle/object,
1857 * and s is the end of it
1858 * tmpbuf is a copy of it
1861 if (*start == '$') {
1862 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
1867 return *s == '(' ? FUNCMETH : METHOD;
1869 if (!keyword(tmpbuf, len)) {
1870 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1875 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
1876 if (indirgv && GvCVu(indirgv))
1878 /* filehandle or package name makes it a method */
1879 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
1881 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
1882 return 0; /* no assumptions -- "=>" quotes bearword */
1884 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
1885 newSVpvn(tmpbuf,len));
1886 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1890 return *s == '(' ? FUNCMETH : METHOD;
1898 * Return a string of Perl code to load the debugger. If PERL5DB
1899 * is set, it will return the contents of that, otherwise a
1900 * compile-time require of perl5db.pl.
1907 char *pdb = PerlEnv_getenv("PERL5DB");
1911 SETERRNO(0,SS$_NORMAL);
1912 return "BEGIN { require 'perl5db.pl' }";
1918 /* Encoded script support. filter_add() effectively inserts a
1919 * 'pre-processing' function into the current source input stream.
1920 * Note that the filter function only applies to the current source file
1921 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1923 * The datasv parameter (which may be NULL) can be used to pass
1924 * private data to this instance of the filter. The filter function
1925 * can recover the SV using the FILTER_DATA macro and use it to
1926 * store private buffers and state information.
1928 * The supplied datasv parameter is upgraded to a PVIO type
1929 * and the IoDIRP/IoANY field is used to store the function pointer,
1930 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
1931 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1932 * private use must be set using malloc'd pointers.
1936 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
1941 if (!PL_rsfp_filters)
1942 PL_rsfp_filters = newAV();
1944 datasv = NEWSV(255,0);
1945 if (!SvUPGRADE(datasv, SVt_PVIO))
1946 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
1947 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
1948 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
1949 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1950 funcp, SvPV_nolen(datasv)));
1951 av_unshift(PL_rsfp_filters, 1);
1952 av_store(PL_rsfp_filters, 0, datasv) ;
1957 /* Delete most recently added instance of this filter function. */
1959 Perl_filter_del(pTHX_ filter_t funcp)
1962 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
1963 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
1965 /* if filter is on top of stack (usual case) just pop it off */
1966 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
1967 if (IoANY(datasv) == (void *)funcp) {
1968 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
1969 IoANY(datasv) = (void *)NULL;
1970 sv_free(av_pop(PL_rsfp_filters));
1974 /* we need to search for the correct entry and clear it */
1975 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
1979 /* Invoke the n'th filter function for the current rsfp. */
1981 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
1984 /* 0 = read one text line */
1989 if (!PL_rsfp_filters)
1991 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
1992 /* Provide a default input filter to make life easy. */
1993 /* Note that we append to the line. This is handy. */
1994 DEBUG_P(PerlIO_printf(Perl_debug_log,
1995 "filter_read %d: from rsfp\n", idx));
1999 int old_len = SvCUR(buf_sv) ;
2001 /* ensure buf_sv is large enough */
2002 SvGROW(buf_sv, old_len + maxlen) ;
2003 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2004 if (PerlIO_error(PL_rsfp))
2005 return -1; /* error */
2007 return 0 ; /* end of file */
2009 SvCUR_set(buf_sv, old_len + len) ;
2012 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2013 if (PerlIO_error(PL_rsfp))
2014 return -1; /* error */
2016 return 0 ; /* end of file */
2019 return SvCUR(buf_sv);
2021 /* Skip this filter slot if filter has been deleted */
2022 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
2023 DEBUG_P(PerlIO_printf(Perl_debug_log,
2024 "filter_read %d: skipped (filter deleted)\n",
2026 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2028 /* Get function pointer hidden within datasv */
2029 funcp = (filter_t)IoANY(datasv);
2030 DEBUG_P(PerlIO_printf(Perl_debug_log,
2031 "filter_read %d: via function %p (%s)\n",
2032 idx, funcp, SvPV_nolen(datasv)));
2033 /* Call function. The function is expected to */
2034 /* call "FILTER_READ(idx+1, buf_sv)" first. */
2035 /* Return: <0:error, =0:eof, >0:not eof */
2036 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
2040 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
2042 #ifdef PERL_CR_FILTER
2043 if (!PL_rsfp_filters) {
2044 filter_add(S_cr_textfilter,NULL);
2047 if (PL_rsfp_filters) {
2050 SvCUR_set(sv, 0); /* start with empty line */
2051 if (FILTER_READ(0, sv, 0) > 0)
2052 return ( SvPVX(sv) ) ;
2057 return (sv_gets(sv, fp, append));
2061 S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
2065 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
2069 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
2070 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2072 return GvHV(gv); /* Foo:: */
2075 /* use constant CLASS => 'MyClass' */
2076 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2078 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2079 pkgname = SvPV_nolen(sv);
2083 return gv_stashpv(pkgname, FALSE);
2087 static char* exp_name[] =
2088 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2089 "ATTRTERM", "TERMBLOCK"
2096 Works out what to call the token just pulled out of the input
2097 stream. The yacc parser takes care of taking the ops we return and
2098 stitching them into a tree.
2104 if read an identifier
2105 if we're in a my declaration
2106 croak if they tried to say my($foo::bar)
2107 build the ops for a my() declaration
2108 if it's an access to a my() variable
2109 are we in a sort block?
2110 croak if my($a); $a <=> $b
2111 build ops for access to a my() variable
2112 if in a dq string, and they've said @foo and we can't find @foo
2114 build ops for a bareword
2115 if we already built the token before, use it.
2118 #ifdef USE_PURE_BISON
2120 Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
2125 yylval_pointer[yyactlevel] = lvalp;
2126 yychar_pointer[yyactlevel] = lcharp;
2127 if (yyactlevel >= YYMAXLEVEL)
2128 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
2130 r = Perl_yylex(aTHX);
2140 #pragma segment Perl_yylex
2153 /* check if there's an identifier for us to look at */
2154 if (PL_pending_ident) {
2155 /* pit holds the identifier we read and pending_ident is reset */
2156 char pit = PL_pending_ident;
2157 PL_pending_ident = 0;
2159 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2160 "### Tokener saw identifier '%s'\n", PL_tokenbuf); })
2162 /* if we're in a my(), we can't allow dynamics here.
2163 $foo'bar has already been turned into $foo::bar, so
2164 just check for colons.
2166 if it's a legal name, the OP is a PADANY.
2169 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
2170 if (strchr(PL_tokenbuf,':'))
2171 yyerror(Perl_form(aTHX_ "No package name allowed for "
2172 "variable %s in \"our\"",
2174 tmp = pad_allocmy(PL_tokenbuf);
2177 if (strchr(PL_tokenbuf,':'))
2178 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
2180 yylval.opval = newOP(OP_PADANY, 0);
2181 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2187 build the ops for accesses to a my() variable.
2189 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2190 then used in a comparison. This catches most, but not
2191 all cases. For instance, it catches
2192 sort { my($a); $a <=> $b }
2194 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2195 (although why you'd do that is anyone's guess).
2198 if (!strchr(PL_tokenbuf,':')) {
2200 /* Check for single character per-thread SVs */
2201 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2202 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2203 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
2205 yylval.opval = newOP(OP_THREADSV, 0);
2206 yylval.opval->op_targ = tmp;
2209 #endif /* USE_THREADS */
2210 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
2211 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
2212 /* might be an "our" variable" */
2213 if (SvFLAGS(namesv) & SVpad_OUR) {
2214 /* build ops for a bareword */
2215 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2216 sv_catpvn(sym, "::", 2);
2217 sv_catpv(sym, PL_tokenbuf+1);
2218 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
2219 yylval.opval->op_private = OPpCONST_ENTERED;
2220 gv_fetchpv(SvPVX(sym),
2222 ? (GV_ADDMULTI | GV_ADDINEVAL)
2225 ((PL_tokenbuf[0] == '$') ? SVt_PV
2226 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2231 /* if it's a sort block and they're naming $a or $b */
2232 if (PL_last_lop_op == OP_SORT &&
2233 PL_tokenbuf[0] == '$' &&
2234 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2237 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2238 d < PL_bufend && *d != '\n';
2241 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
2242 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
2248 yylval.opval = newOP(OP_PADANY, 0);
2249 yylval.opval->op_targ = tmp;
2255 Whine if they've said @foo in a doublequoted string,
2256 and @foo isn't a variable we can find in the symbol
2259 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2260 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
2261 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2262 && ckWARN(WARN_AMBIGUOUS))
2264 /* Downgraded from fatal to warning 20000522 mjd */
2265 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2266 "Possible unintended interpolation of %s in string",
2271 /* build ops for a bareword */
2272 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
2273 yylval.opval->op_private = OPpCONST_ENTERED;
2274 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2275 ((PL_tokenbuf[0] == '$') ? SVt_PV
2276 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2281 /* no identifier pending identification */
2283 switch (PL_lex_state) {
2285 case LEX_NORMAL: /* Some compilers will produce faster */
2286 case LEX_INTERPNORMAL: /* code if we comment these out. */
2290 /* when we've already built the next token, just pull it out of the queue */
2293 yylval = PL_nextval[PL_nexttoke];
2295 PL_lex_state = PL_lex_defer;
2296 PL_expect = PL_lex_expect;
2297 PL_lex_defer = LEX_NORMAL;
2299 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2300 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2301 (IV)PL_nexttype[PL_nexttoke]); })
2303 return(PL_nexttype[PL_nexttoke]);
2305 /* interpolated case modifiers like \L \U, including \Q and \E.
2306 when we get here, PL_bufptr is at the \
2308 case LEX_INTERPCASEMOD:
2310 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
2311 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
2313 /* handle \E or end of string */
2314 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
2318 if (PL_lex_casemods) {
2319 oldmod = PL_lex_casestack[--PL_lex_casemods];
2320 PL_lex_casestack[PL_lex_casemods] = '\0';
2322 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2324 PL_lex_state = LEX_INTERPCONCAT;
2328 if (PL_bufptr != PL_bufend)
2330 PL_lex_state = LEX_INTERPCONCAT;
2334 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2335 "### Saw case modifier at '%s'\n", PL_bufptr); })
2337 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2338 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
2339 if (strchr("LU", *s) &&
2340 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
2342 PL_lex_casestack[--PL_lex_casemods] = '\0';
2345 if (PL_lex_casemods > 10) {
2346 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2347 if (newlb != PL_lex_casestack) {
2349 PL_lex_casestack = newlb;
2352 PL_lex_casestack[PL_lex_casemods++] = *s;
2353 PL_lex_casestack[PL_lex_casemods] = '\0';
2354 PL_lex_state = LEX_INTERPCONCAT;
2355 PL_nextval[PL_nexttoke].ival = 0;
2358 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
2360 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
2362 PL_nextval[PL_nexttoke].ival = OP_LC;
2364 PL_nextval[PL_nexttoke].ival = OP_UC;
2366 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
2368 Perl_croak(aTHX_ "panic: yylex");
2371 if (PL_lex_starts) {
2380 case LEX_INTERPPUSH:
2381 return sublex_push();
2383 case LEX_INTERPSTART:
2384 if (PL_bufptr == PL_bufend)
2385 return sublex_done();
2386 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2387 "### Interpolated variable at '%s'\n", PL_bufptr); })
2389 PL_lex_dojoin = (*PL_bufptr == '@');
2390 PL_lex_state = LEX_INTERPNORMAL;
2391 if (PL_lex_dojoin) {
2392 PL_nextval[PL_nexttoke].ival = 0;
2395 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2396 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
2397 force_next(PRIVATEREF);
2399 force_ident("\"", '$');
2400 #endif /* USE_THREADS */
2401 PL_nextval[PL_nexttoke].ival = 0;
2403 PL_nextval[PL_nexttoke].ival = 0;
2405 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
2408 if (PL_lex_starts++) {
2414 case LEX_INTERPENDMAYBE:
2415 if (intuit_more(PL_bufptr)) {
2416 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
2422 if (PL_lex_dojoin) {
2423 PL_lex_dojoin = FALSE;
2424 PL_lex_state = LEX_INTERPCONCAT;
2427 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
2428 && SvEVALED(PL_lex_repl))
2430 if (PL_bufptr != PL_bufend)
2431 Perl_croak(aTHX_ "Bad evalled substitution pattern");
2432 PL_lex_repl = Nullsv;
2435 case LEX_INTERPCONCAT:
2437 if (PL_lex_brackets)
2438 Perl_croak(aTHX_ "panic: INTERPCONCAT");
2440 if (PL_bufptr == PL_bufend)
2441 return sublex_done();
2443 if (SvIVX(PL_linestr) == '\'') {
2444 SV *sv = newSVsv(PL_linestr);
2447 else if ( PL_hints & HINT_NEW_RE )
2448 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
2449 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2453 s = scan_const(PL_bufptr);
2455 PL_lex_state = LEX_INTERPCASEMOD;
2457 PL_lex_state = LEX_INTERPSTART;
2460 if (s != PL_bufptr) {
2461 PL_nextval[PL_nexttoke] = yylval;
2464 if (PL_lex_starts++)
2474 PL_lex_state = LEX_NORMAL;
2475 s = scan_formline(PL_bufptr);
2476 if (!PL_lex_formbrack)
2482 PL_oldoldbufptr = PL_oldbufptr;
2485 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2486 exp_name[PL_expect], s);
2492 if (isIDFIRST_lazy_if(s,UTF))
2494 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
2497 goto fake_eof; /* emulate EOF on ^D or ^Z */
2502 if (PL_lex_brackets)
2503 yyerror("Missing right curly or square bracket");
2504 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2505 "### Tokener got EOF\n");
2509 if (s++ < PL_bufend)
2510 goto retry; /* ignore stray nulls */
2513 if (!PL_in_eval && !PL_preambled) {
2514 PL_preambled = TRUE;
2515 sv_setpv(PL_linestr,incl_perldb());
2516 if (SvCUR(PL_linestr))
2517 sv_catpv(PL_linestr,";");
2519 while(AvFILLp(PL_preambleav) >= 0) {
2520 SV *tmpsv = av_shift(PL_preambleav);
2521 sv_catsv(PL_linestr, tmpsv);
2522 sv_catpv(PL_linestr, ";");
2525 sv_free((SV*)PL_preambleav);
2526 PL_preambleav = NULL;
2528 if (PL_minus_n || PL_minus_p) {
2529 sv_catpv(PL_linestr, "LINE: while (<>) {");
2531 sv_catpv(PL_linestr,"chomp;");
2533 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2535 GvIMPORTED_AV_on(gv);
2537 if (strchr("/'\"", *PL_splitstr)
2538 && strchr(PL_splitstr + 1, *PL_splitstr))
2539 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
2542 s = "'~#\200\1'"; /* surely one char is unused...*/
2543 while (s[1] && strchr(PL_splitstr, *s)) s++;
2545 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
2546 "q" + (delim == '\''), delim);
2547 for (s = PL_splitstr; *s; s++) {
2549 sv_catpvn(PL_linestr, "\\", 1);
2550 sv_catpvn(PL_linestr, s, 1);
2552 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
2556 sv_catpv(PL_linestr,"@F=split(' ');");
2559 sv_catpv(PL_linestr, "\n");
2560 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2561 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2562 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2563 SV *sv = NEWSV(85,0);
2565 sv_upgrade(sv, SVt_PVMG);
2566 sv_setsv(sv,PL_linestr);
2567 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2572 bof = PL_rsfp ? TRUE : FALSE;
2573 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2576 if (PL_preprocess && !PL_in_eval)
2577 (void)PerlProc_pclose(PL_rsfp);
2578 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2579 PerlIO_clearerr(PL_rsfp);
2581 (void)PerlIO_close(PL_rsfp);
2583 PL_doextract = FALSE;
2585 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2586 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2587 sv_catpv(PL_linestr,";}");
2588 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2589 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2590 PL_minus_n = PL_minus_p = 0;
2593 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2594 sv_setpv(PL_linestr,"");
2595 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2597 /* if it looks like the start of a BOM, check if it in fact is */
2598 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
2599 #ifdef PERLIO_IS_STDIO
2600 # ifdef __GNU_LIBRARY__
2601 # if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
2602 # define FTELL_FOR_PIPE_IS_BROKEN
2606 # if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2607 # define FTELL_FOR_PIPE_IS_BROKEN
2612 #ifdef FTELL_FOR_PIPE_IS_BROKEN
2613 /* This loses the possibility to detect the bof
2614 * situation on perl -P when the libc5 is being used.
2615 * Workaround? Maybe attach some extra state to PL_rsfp?
2618 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2620 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
2623 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2624 s = swallow_bom((U8*)s);
2628 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
2629 PL_doextract = FALSE;
2631 /* Incest with pod. */
2632 if (*s == '=' && strnEQ(s, "=cut", 4)) {
2633 sv_setpv(PL_linestr, "");
2634 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2635 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2636 PL_doextract = FALSE;
2640 } while (PL_doextract);
2641 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2642 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2643 SV *sv = NEWSV(85,0);
2645 sv_upgrade(sv, SVt_PVMG);
2646 sv_setsv(sv,PL_linestr);
2647 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
2649 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2650 if (CopLINE(PL_curcop) == 1) {
2651 while (s < PL_bufend && isSPACE(*s))
2653 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
2657 if (*s == '#' && *(s+1) == '!')
2659 #ifdef ALTERNATE_SHEBANG
2661 static char as[] = ALTERNATE_SHEBANG;
2662 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2663 d = s + (sizeof(as) - 1);
2665 #endif /* ALTERNATE_SHEBANG */
2674 while (*d && !isSPACE(*d))
2678 #ifdef ARG_ZERO_IS_SCRIPT
2679 if (ipathend > ipath) {
2681 * HP-UX (at least) sets argv[0] to the script name,
2682 * which makes $^X incorrect. And Digital UNIX and Linux,
2683 * at least, set argv[0] to the basename of the Perl
2684 * interpreter. So, having found "#!", we'll set it right.
2686 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2687 assert(SvPOK(x) || SvGMAGICAL(x));
2688 if (sv_eq(x, CopFILESV(PL_curcop))) {
2689 sv_setpvn(x, ipath, ipathend - ipath);
2692 TAINT_NOT; /* $^X is always tainted, but that's OK */
2694 #endif /* ARG_ZERO_IS_SCRIPT */
2699 d = instr(s,"perl -");
2701 d = instr(s,"perl");
2703 /* avoid getting into infinite loops when shebang
2704 * line contains "Perl" rather than "perl" */
2706 for (d = ipathend-4; d >= ipath; --d) {
2707 if ((*d == 'p' || *d == 'P')
2708 && !ibcmp(d, "perl", 4))
2718 #ifdef ALTERNATE_SHEBANG
2720 * If the ALTERNATE_SHEBANG on this system starts with a
2721 * character that can be part of a Perl expression, then if
2722 * we see it but not "perl", we're probably looking at the
2723 * start of Perl code, not a request to hand off to some
2724 * other interpreter. Similarly, if "perl" is there, but
2725 * not in the first 'word' of the line, we assume the line
2726 * contains the start of the Perl program.
2728 if (d && *s != '#') {
2730 while (*c && !strchr("; \t\r\n\f\v#", *c))
2733 d = Nullch; /* "perl" not in first word; ignore */
2735 *s = '#'; /* Don't try to parse shebang line */
2737 #endif /* ALTERNATE_SHEBANG */
2738 #ifndef MACOS_TRADITIONAL
2743 !instr(s,"indir") &&
2744 instr(PL_origargv[0],"perl"))
2750 while (s < PL_bufend && isSPACE(*s))
2752 if (s < PL_bufend) {
2753 Newz(899,newargv,PL_origargc+3,char*);
2755 while (s < PL_bufend && !isSPACE(*s))
2758 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
2761 newargv = PL_origargv;
2763 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
2764 Perl_croak(aTHX_ "Can't exec %s", ipath);
2768 U32 oldpdb = PL_perldb;
2769 bool oldn = PL_minus_n;
2770 bool oldp = PL_minus_p;
2772 while (*d && !isSPACE(*d)) d++;
2773 while (SPACE_OR_TAB(*d)) d++;
2777 if (*d == 'M' || *d == 'm') {
2779 while (*d && !isSPACE(*d)) d++;
2780 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
2783 d = moreswitches(d);
2785 if ((PERLDB_LINE && !oldpdb) ||
2786 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
2787 /* if we have already added "LINE: while (<>) {",
2788 we must not do it again */
2790 sv_setpv(PL_linestr, "");
2791 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2792 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
2793 PL_preambled = FALSE;
2795 (void)gv_fetchfile(PL_origfilename);
2802 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2804 PL_lex_state = LEX_FORMLINE;
2809 #ifdef PERL_STRICT_CR
2810 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
2812 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
2814 case ' ': case '\t': case '\f': case 013:
2815 #ifdef MACOS_TRADITIONAL
2822 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
2823 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2824 /* handle eval qq[#line 1 "foo"\n ...] */
2825 CopLINE_dec(PL_curcop);
2829 while (s < d && *s != '\n')
2834 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2836 PL_lex_state = LEX_FORMLINE;
2846 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
2853 while (s < PL_bufend && SPACE_OR_TAB(*s))
2856 if (strnEQ(s,"=>",2)) {
2857 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
2858 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2859 "### Saw unary minus before =>, forcing word '%s'\n", s);
2861 OPERATOR('-'); /* unary minus */
2863 PL_last_uni = PL_oldbufptr;
2865 case 'r': ftst = OP_FTEREAD; break;
2866 case 'w': ftst = OP_FTEWRITE; break;
2867 case 'x': ftst = OP_FTEEXEC; break;
2868 case 'o': ftst = OP_FTEOWNED; break;
2869 case 'R': ftst = OP_FTRREAD; break;
2870 case 'W': ftst = OP_FTRWRITE; break;
2871 case 'X': ftst = OP_FTREXEC; break;
2872 case 'O': ftst = OP_FTROWNED; break;
2873 case 'e': ftst = OP_FTIS; break;
2874 case 'z': ftst = OP_FTZERO; break;
2875 case 's': ftst = OP_FTSIZE; break;
2876 case 'f': ftst = OP_FTFILE; break;
2877 case 'd': ftst = OP_FTDIR; break;
2878 case 'l': ftst = OP_FTLINK; break;
2879 case 'p': ftst = OP_FTPIPE; break;
2880 case 'S': ftst = OP_FTSOCK; break;
2881 case 'u': ftst = OP_FTSUID; break;
2882 case 'g': ftst = OP_FTSGID; break;
2883 case 'k': ftst = OP_FTSVTX; break;
2884 case 'b': ftst = OP_FTBLK; break;
2885 case 'c': ftst = OP_FTCHR; break;
2886 case 't': ftst = OP_FTTTY; break;
2887 case 'T': ftst = OP_FTTEXT; break;
2888 case 'B': ftst = OP_FTBINARY; break;
2889 case 'M': case 'A': case 'C':
2890 gv_fetchpv("\024",TRUE, SVt_PV);
2892 case 'M': ftst = OP_FTMTIME; break;
2893 case 'A': ftst = OP_FTATIME; break;
2894 case 'C': ftst = OP_FTCTIME; break;
2902 PL_last_lop_op = ftst;
2903 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2904 "### Saw file test %c\n", (int)ftst);
2909 /* Assume it was a minus followed by a one-letter named
2910 * subroutine call (or a -bareword), then. */
2911 DEBUG_T( { PerlIO_printf(Perl_debug_log,
2912 "### %c looked like a file test but was not\n",
2921 if (PL_expect == XOPERATOR)
2926 else if (*s == '>') {
2929 if (isIDFIRST_lazy_if(s,UTF)) {
2930 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
2938 if (PL_expect == XOPERATOR)
2941 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2943 OPERATOR('-'); /* unary minus */
2950 if (PL_expect == XOPERATOR)
2955 if (PL_expect == XOPERATOR)
2958 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2964 if (PL_expect != XOPERATOR) {
2965 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2966 PL_expect = XOPERATOR;
2967 force_ident(PL_tokenbuf, '*');
2980 if (PL_expect == XOPERATOR) {
2984 PL_tokenbuf[0] = '%';
2985 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2986 if (!PL_tokenbuf[1]) {
2988 yyerror("Final % should be \\% or %name");
2991 PL_pending_ident = '%';
3010 switch (PL_expect) {
3013 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3015 PL_bufptr = s; /* update in case we back off */
3021 PL_expect = XTERMBLOCK;
3025 while (isIDFIRST_lazy_if(s,UTF)) {
3026 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3027 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3028 if (tmp < 0) tmp = -tmp;
3043 d = scan_str(d,TRUE,TRUE);
3045 /* MUST advance bufptr here to avoid bogus
3046 "at end of line" context messages from yyerror().
3048 PL_bufptr = s + len;
3049 yyerror("Unterminated attribute parameter in attribute list");
3052 return 0; /* EOF indicator */
3056 SV *sv = newSVpvn(s, len);
3057 sv_catsv(sv, PL_lex_stuff);
3058 attrs = append_elem(OP_LIST, attrs,
3059 newSVOP(OP_CONST, 0, sv));
3060 SvREFCNT_dec(PL_lex_stuff);
3061 PL_lex_stuff = Nullsv;
3064 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3065 CvLVALUE_on(PL_compcv);
3066 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3067 CvLOCKED_on(PL_compcv);
3068 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3069 CvMETHOD_on(PL_compcv);
3071 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "shared", len))
3072 GvSHARED_on(cGVOPx_gv(yylval.opval));
3074 /* After we've set the flags, it could be argued that
3075 we don't need to do the attributes.pm-based setting
3076 process, and shouldn't bother appending recognized
3077 flags. To experiment with that, uncomment the
3078 following "else": */
3080 attrs = append_elem(OP_LIST, attrs,
3081 newSVOP(OP_CONST, 0,
3085 if (*s == ':' && s[1] != ':')
3088 break; /* require real whitespace or :'s */
3090 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3091 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
3092 char q = ((*s == '\'') ? '"' : '\'');
3093 /* If here for an expression, and parsed no attrs, back off. */
3094 if (tmp == '=' && !attrs) {
3098 /* MUST advance bufptr here to avoid bogus "at end of line"
3099 context messages from yyerror().
3103 yyerror("Unterminated attribute list");
3105 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3113 PL_nextval[PL_nexttoke].opval = attrs;
3121 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3122 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
3138 if (PL_lex_brackets <= 0)
3139 yyerror("Unmatched right square bracket");
3142 if (PL_lex_state == LEX_INTERPNORMAL) {
3143 if (PL_lex_brackets == 0) {
3144 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3145 PL_lex_state = LEX_INTERPEND;
3152 if (PL_lex_brackets > 100) {
3153 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3154 if (newlb != PL_lex_brackstack) {
3156 PL_lex_brackstack = newlb;
3159 switch (PL_expect) {
3161 if (PL_lex_formbrack) {
3165 if (PL_oldoldbufptr == PL_last_lop)
3166 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3168 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3169 OPERATOR(HASHBRACK);
3171 while (s < PL_bufend && SPACE_OR_TAB(*s))
3174 PL_tokenbuf[0] = '\0';
3175 if (d < PL_bufend && *d == '-') {
3176 PL_tokenbuf[0] = '-';
3178 while (d < PL_bufend && SPACE_OR_TAB(*d))
3181 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3182 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
3184 while (d < PL_bufend && SPACE_OR_TAB(*d))
3187 char minus = (PL_tokenbuf[0] == '-');
3188 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3196 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3201 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3206 if (PL_oldoldbufptr == PL_last_lop)
3207 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
3209 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3212 OPERATOR(HASHBRACK);
3213 /* This hack serves to disambiguate a pair of curlies
3214 * as being a block or an anon hash. Normally, expectation
3215 * determines that, but in cases where we're not in a
3216 * position to expect anything in particular (like inside
3217 * eval"") we have to resolve the ambiguity. This code
3218 * covers the case where the first term in the curlies is a
3219 * quoted string. Most other cases need to be explicitly
3220 * disambiguated by prepending a `+' before the opening
3221 * curly in order to force resolution as an anon hash.
3223 * XXX should probably propagate the outer expectation
3224 * into eval"" to rely less on this hack, but that could
3225 * potentially break current behavior of eval"".
3229 if (*s == '\'' || *s == '"' || *s == '`') {
3230 /* common case: get past first string, handling escapes */
3231 for (t++; t < PL_bufend && *t != *s;)
3232 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3236 else if (*s == 'q') {
3239 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
3243 char open, close, term;
3246 while (t < PL_bufend && isSPACE(*t))
3250 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3254 for (t++; t < PL_bufend; t++) {
3255 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
3257 else if (*t == open)
3261 for (t++; t < PL_bufend; t++) {
3262 if (*t == '\\' && t+1 < PL_bufend)
3264 else if (*t == close && --brackets <= 0)
3266 else if (*t == open)
3272 else if (isALNUM_lazy_if(t,UTF)) {
3274 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
3277 while (t < PL_bufend && isSPACE(*t))
3279 /* if comma follows first term, call it an anon hash */
3280 /* XXX it could be a comma expression with loop modifiers */
3281 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
3282 || (*t == '=' && t[1] == '>')))
3283 OPERATOR(HASHBRACK);
3284 if (PL_expect == XREF)
3287 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3293 yylval.ival = CopLINE(PL_curcop);
3294 if (isSPACE(*s) || *s == '#')
3295 PL_copline = NOLINE; /* invalidate current command line number */
3300 if (PL_lex_brackets <= 0)
3301 yyerror("Unmatched right curly bracket");
3303 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
3304 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3305 PL_lex_formbrack = 0;
3306 if (PL_lex_state == LEX_INTERPNORMAL) {
3307 if (PL_lex_brackets == 0) {
3308 if (PL_expect & XFAKEBRACK) {
3309 PL_expect &= XENUMMASK;
3310 PL_lex_state = LEX_INTERPEND;
3312 return yylex(); /* ignore fake brackets */
3314 if (*s == '-' && s[1] == '>')
3315 PL_lex_state = LEX_INTERPENDMAYBE;
3316 else if (*s != '[' && *s != '{')
3317 PL_lex_state = LEX_INTERPEND;
3320 if (PL_expect & XFAKEBRACK) {
3321 PL_expect &= XENUMMASK;
3323 return yylex(); /* ignore fake brackets */
3333 if (PL_expect == XOPERATOR) {
3334 if (ckWARN(WARN_SEMICOLON)
3335 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3337 CopLINE_dec(PL_curcop);
3338 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3339 CopLINE_inc(PL_curcop);
3344 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3346 PL_expect = XOPERATOR;
3347 force_ident(PL_tokenbuf, '&');
3351 yylval.ival = (OPpENTERSUB_AMPER<<8);
3370 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
3371 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
3373 if (PL_expect == XSTATE && isALPHA(tmp) &&
3374 (s == PL_linestart+1 || s[-2] == '\n') )
3376 if (PL_in_eval && !PL_rsfp) {
3381 if (strnEQ(s,"=cut",4)) {
3395 PL_doextract = TRUE;
3398 if (PL_lex_brackets < PL_lex_formbrack) {
3400 #ifdef PERL_STRICT_CR
3401 for (t = s; SPACE_OR_TAB(*t); t++) ;
3403 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
3405 if (*t == '\n' || *t == '#') {
3423 if (PL_expect != XOPERATOR) {
3424 if (s[1] != '<' && !strchr(s,'>'))
3427 s = scan_heredoc(s);
3429 s = scan_inputsymbol(s);
3430 TERM(sublex_start());
3435 SHop(OP_LEFT_SHIFT);
3449 SHop(OP_RIGHT_SHIFT);
3458 if (PL_expect == XOPERATOR) {
3459 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3462 return ','; /* grandfather non-comma-format format */
3466 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3467 PL_tokenbuf[0] = '@';
3468 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3469 sizeof PL_tokenbuf - 1, FALSE);
3470 if (PL_expect == XOPERATOR)
3471 no_op("Array length", s);
3472 if (!PL_tokenbuf[1])
3474 PL_expect = XOPERATOR;
3475 PL_pending_ident = '#';
3479 PL_tokenbuf[0] = '$';
3480 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3481 sizeof PL_tokenbuf - 1, FALSE);
3482 if (PL_expect == XOPERATOR)
3484 if (!PL_tokenbuf[1]) {
3486 yyerror("Final $ should be \\$ or $name");
3490 /* This kludge not intended to be bulletproof. */
3491 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
3492 yylval.opval = newSVOP(OP_CONST, 0,
3493 newSViv(PL_compiling.cop_arybase));
3494 yylval.opval->op_private = OPpCONST_ARYBASE;
3500 if (PL_lex_state == LEX_NORMAL)
3503 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3506 PL_tokenbuf[0] = '@';
3507 if (ckWARN(WARN_SYNTAX)) {
3509 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
3512 PL_bufptr = skipspace(PL_bufptr);
3513 while (t < PL_bufend && *t != ']')
3515 Perl_warner(aTHX_ WARN_SYNTAX,
3516 "Multidimensional syntax %.*s not supported",
3517 (t - PL_bufptr) + 1, PL_bufptr);
3521 else if (*s == '{') {
3522 PL_tokenbuf[0] = '%';
3523 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
3524 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3526 char tmpbuf[sizeof PL_tokenbuf];
3528 for (t++; isSPACE(*t); t++) ;
3529 if (isIDFIRST_lazy_if(t,UTF)) {
3530 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
3531 for (; isSPACE(*t); t++) ;
3532 if (*t == ';' && get_cv(tmpbuf, FALSE))
3533 Perl_warner(aTHX_ WARN_SYNTAX,
3534 "You need to quote \"%s\"", tmpbuf);
3540 PL_expect = XOPERATOR;
3541 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
3542 bool islop = (PL_last_lop == PL_oldoldbufptr);
3543 if (!islop || PL_last_lop_op == OP_GREPSTART)
3544 PL_expect = XOPERATOR;
3545 else if (strchr("$@\"'`q", *s))
3546 PL_expect = XTERM; /* e.g. print $fh "foo" */
3547 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
3548 PL_expect = XTERM; /* e.g. print $fh &sub */
3549 else if (isIDFIRST_lazy_if(s,UTF)) {
3550 char tmpbuf[sizeof PL_tokenbuf];
3551 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3552 if ((tmp = keyword(tmpbuf, len))) {
3553 /* binary operators exclude handle interpretations */
3565 PL_expect = XTERM; /* e.g. print $fh length() */
3570 GV *gv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
3571 if (gv && GvCVu(gv))
3572 PL_expect = XTERM; /* e.g. print $fh subr() */
3575 else if (isDIGIT(*s))
3576 PL_expect = XTERM; /* e.g. print $fh 3 */
3577 else if (*s == '.' && isDIGIT(s[1]))
3578 PL_expect = XTERM; /* e.g. print $fh .3 */
3579 else if (strchr("/?-+", *s) && !isSPACE(s[1]) && s[1] != '=')
3580 PL_expect = XTERM; /* e.g. print $fh -1 */
3581 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2]) && s[2] != '=')
3582 PL_expect = XTERM; /* print $fh <<"EOF" */
3584 PL_pending_ident = '$';
3588 if (PL_expect == XOPERATOR)
3590 PL_tokenbuf[0] = '@';
3591 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
3592 if (!PL_tokenbuf[1]) {
3594 yyerror("Final @ should be \\@ or @name");
3597 if (PL_lex_state == LEX_NORMAL)
3599 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
3601 PL_tokenbuf[0] = '%';
3603 /* Warn about @ where they meant $. */
3604 if (ckWARN(WARN_SYNTAX)) {
3605 if (*s == '[' || *s == '{') {
3607 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
3609 if (*t == '}' || *t == ']') {
3611 PL_bufptr = skipspace(PL_bufptr);
3612 Perl_warner(aTHX_ WARN_SYNTAX,
3613 "Scalar value %.*s better written as $%.*s",
3614 t-PL_bufptr, PL_bufptr, t-PL_bufptr-1, PL_bufptr+1);
3619 PL_pending_ident = '@';
3622 case '/': /* may either be division or pattern */
3623 case '?': /* may either be conditional or pattern */
3624 if (PL_expect != XOPERATOR) {
3625 /* Disable warning on "study /blah/" */
3626 if (PL_oldoldbufptr == PL_last_uni
3627 && (*PL_last_uni != 's' || s - PL_last_uni < 5
3628 || memNE(PL_last_uni, "study", 5)
3629 || isALNUM_lazy_if(PL_last_uni+5,UTF)))
3631 s = scan_pat(s,OP_MATCH);
3632 TERM(sublex_start());
3640 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
3641 #ifdef PERL_STRICT_CR
3644 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
3646 && (s == PL_linestart || s[-1] == '\n') )
3648 PL_lex_formbrack = 0;
3652 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
3658 yylval.ival = OPf_SPECIAL;
3664 if (PL_expect != XOPERATOR)
3669 case '0': case '1': case '2': case '3': case '4':
3670 case '5': case '6': case '7': case '8': case '9':
3671 s = scan_num(s, &yylval);
3672 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3673 "### Saw number in '%s'\n", s);
3675 if (PL_expect == XOPERATOR)
3680 s = scan_str(s,FALSE,FALSE);
3681 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3682 "### Saw string in '%s'\n", s);
3684 if (PL_expect == XOPERATOR) {
3685 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3688 return ','; /* grandfather non-comma-format format */
3694 missingterm((char*)0);
3695 yylval.ival = OP_CONST;
3696 TERM(sublex_start());
3699 s = scan_str(s,FALSE,FALSE);
3700 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3701 "### Saw string in '%s'\n", s);
3703 if (PL_expect == XOPERATOR) {
3704 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3707 return ','; /* grandfather non-comma-format format */
3713 missingterm((char*)0);
3714 yylval.ival = OP_CONST;
3715 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
3716 if (*d == '$' || *d == '@' || *d == '\\' || UTF8_IS_CONTINUED(*d)) {
3717 yylval.ival = OP_STRINGIFY;
3721 TERM(sublex_start());
3724 s = scan_str(s,FALSE,FALSE);
3725 DEBUG_T( { PerlIO_printf(Perl_debug_log,
3726 "### Saw backtick string in '%s'\n", s);
3728 if (PL_expect == XOPERATOR)
3729 no_op("Backticks",s);
3731 missingterm((char*)0);
3732 yylval.ival = OP_BACKTICK;
3734 TERM(sublex_start());
3738 if (ckWARN(WARN_SYNTAX) && PL_lex_inwhat && isDIGIT(*s))
3739 Perl_warner(aTHX_ WARN_SYNTAX,"Can't use \\%c to mean $%c in expression",
3741 if (PL_expect == XOPERATOR)
3742 no_op("Backslash",s);
3746 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
3750 while (isDIGIT(*start) || *start == '_')
3752 if (*start == '.' && isDIGIT(start[1])) {
3753 s = scan_num(s, &yylval);
3756 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
3757 else if (!isALPHA(*start) && (PL_expect == XTERM || PL_expect == XREF)) {
3761 gv = gv_fetchpv(s, FALSE, SVt_PVCV);
3764 s = scan_num(s, &yylval);
3771 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
3810 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
3812 /* Some keywords can be followed by any delimiter, including ':' */
3813 tmp = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
3814 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
3815 (PL_tokenbuf[0] == 'q' &&
3816 strchr("qwxr", PL_tokenbuf[1])))));
3818 /* x::* is just a word, unless x is "CORE" */
3819 if (!tmp && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
3823 while (d < PL_bufend && isSPACE(*d))
3824 d++; /* no comments skipped here, or s### is misparsed */
3826 /* Is this a label? */
3827 if (!tmp && PL_expect == XSTATE
3828 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
3830 yylval.pval = savepv(PL_tokenbuf);
3835 /* Check for keywords */
3836 tmp = keyword(PL_tokenbuf, len);
3838 /* Is this a word before a => operator? */
3839 if (*d == '=' && d[1] == '>') {
3841 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf,0));
3842 yylval.opval->op_private = OPpCONST_BARE;
3843 if (UTF && !IN_BYTE && is_utf8_string((U8*)PL_tokenbuf, len))
3844 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
3848 if (tmp < 0) { /* second-class keyword? */
3849 GV *ogv = Nullgv; /* override (winner) */
3850 GV *hgv = Nullgv; /* hidden (loser) */
3851 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
3853 if ((gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV)) &&
3856 if (GvIMPORTED_CV(gv))
3858 else if (! CvMETHOD(cv))
3862 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
3863 (gv = *gvp) != (GV*)&PL_sv_undef &&
3864 GvCVu(gv) && GvIMPORTED_CV(gv))
3870 tmp = 0; /* overridden by import or by GLOBAL */
3873 && -tmp==KEY_lock /* XXX generalizable kludge */
3875 && !hv_fetch(GvHVn(PL_incgv), "Thread.pm", 9, FALSE))
3877 tmp = 0; /* any sub overrides "weak" keyword */
3879 else { /* no override */
3883 if (ckWARN(WARN_AMBIGUOUS) && hgv
3884 && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
3885 Perl_warner(aTHX_ WARN_AMBIGUOUS,
3886 "Ambiguous call resolved as CORE::%s(), %s",
3887 GvENAME(hgv), "qualify as such or use &");
3894 default: /* not a keyword */
3897 char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
3899 /* Get the rest if it looks like a package qualifier */
3901 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
3903 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
3906 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
3907 *s == '\'' ? "'" : "::");
3911 if (PL_expect == XOPERATOR) {
3912 if (PL_bufptr == PL_linestart) {
3913 CopLINE_dec(PL_curcop);
3914 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
3915 CopLINE_inc(PL_curcop);
3918 no_op("Bareword",s);
3921 /* Look for a subroutine with this name in current package,
3922 unless name is "Foo::", in which case Foo is a bearword
3923 (and a package name). */
3926 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
3928 if (ckWARN(WARN_BAREWORD) && ! gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVHV))
3929 Perl_warner(aTHX_ WARN_BAREWORD,
3930 "Bareword \"%s\" refers to nonexistent package",
3933 PL_tokenbuf[len] = '\0';
3940 gv = gv_fetchpv(PL_tokenbuf, FALSE, SVt_PVCV);
3943 /* if we saw a global override before, get the right name */
3946 sv = newSVpvn("CORE::GLOBAL::",14);
3947 sv_catpv(sv,PL_tokenbuf);
3950 sv = newSVpv(PL_tokenbuf,0);
3952 /* Presume this is going to be a bareword of some sort. */
3955 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3956 yylval.opval->op_private = OPpCONST_BARE;
3958 /* And if "Foo::", then that's what it certainly is. */
3963 /* See if it's the indirect object for a list operator. */
3965 if (PL_oldoldbufptr &&
3966 PL_oldoldbufptr < PL_bufptr &&
3967 (PL_oldoldbufptr == PL_last_lop
3968 || PL_oldoldbufptr == PL_last_uni) &&
3969 /* NO SKIPSPACE BEFORE HERE! */
3970 (PL_expect == XREF ||
3971 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
3973 bool immediate_paren = *s == '(';
3975 /* (Now we can afford to cross potential line boundary.) */
3978 /* Two barewords in a row may indicate method call. */
3980 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp=intuit_method(s,gv)))
3983 /* If not a declared subroutine, it's an indirect object. */
3984 /* (But it's an indir obj regardless for sort.) */
3986 if ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
3987 ((!gv || !GvCVu(gv)) &&
3988 (PL_last_lop_op != OP_MAPSTART &&
3989 PL_last_lop_op != OP_GREPSTART))))
3991 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
3997 PL_expect = XOPERATOR;
4000 /* Is this a word before a => operator? */
4001 if (*s == '=' && s[1] == '>') {
4003 sv_setpv(((SVOP*)yylval.opval)->op_sv, PL_tokenbuf);
4004 if (UTF && !IN_BYTE && is_utf8_string((U8*)PL_tokenbuf, len))
4005 SvUTF8_on(((SVOP*)yylval.opval)->op_sv);
4009 /* If followed by a paren, it's certainly a subroutine. */
4012 if (gv && GvCVu(gv)) {
4013 for (d = s + 1; SPACE_OR_TAB(*d); d++) ;
4014 if (*d == ')' && (sv = cv_const_sv(GvCV(gv)))) {
4019 PL_nextval[PL_nexttoke].opval = yylval.opval;
4020 PL_expect = XOPERATOR;
4026 /* If followed by var or block, call it a method (unless sub) */
4028 if ((*s == '$' || *s == '{') && (!gv || !GvCVu(gv))) {
4029 PL_last_lop = PL_oldbufptr;
4030 PL_last_lop_op = OP_METHOD;
4034 /* If followed by a bareword, see if it looks like indir obj. */
4036 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') && (tmp = intuit_method(s,gv)))
4039 /* Not a method, so call it a subroutine (if defined) */
4041 if (gv && GvCVu(gv)) {
4043 if (lastchar == '-' && ckWARN_d(WARN_AMBIGUOUS))
4044 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4045 "Ambiguous use of -%s resolved as -&%s()",
4046 PL_tokenbuf, PL_tokenbuf);
4047 /* Check for a constant sub */
4049 if ((sv = cv_const_sv(cv))) {
4051 SvREFCNT_dec(((SVOP*)yylval.opval)->op_sv);
4052 ((SVOP*)yylval.opval)->op_sv = SvREFCNT_inc(sv);
4053 yylval.opval->op_private = 0;
4057 /* Resolve to GV now. */
4058 op_free(yylval.opval);
4059 yylval.opval = newCVREF(0, newGVOP(OP_GV, 0, gv));
4060 yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
4061 PL_last_lop = PL_oldbufptr;
4062 PL_last_lop_op = OP_ENTERSUB;
4063 /* Is there a prototype? */
4066 char *proto = SvPV((SV*)cv, len);
4069 if (strEQ(proto, "$"))
4071 if (*proto == '&' && *s == '{') {
4072 sv_setpv(PL_subname,"__ANON__");
4076 PL_nextval[PL_nexttoke].opval = yylval.opval;
4082 /* Call it a bare word */
4084 if (PL_hints & HINT_STRICT_SUBS)
4085 yylval.opval->op_private |= OPpCONST_STRICT;
4088 if (ckWARN(WARN_RESERVED)) {
4089 if (lastchar != '-') {
4090 for (d = PL_tokenbuf; *d && isLOWER(*d); d++) ;
4092 Perl_warner(aTHX_ WARN_RESERVED, PL_warn_reserved,
4099 if (lastchar && strchr("*%&", lastchar) && ckWARN_d(WARN_AMBIGUOUS)) {
4100 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4101 "Operator or semicolon missing before %c%s",
4102 lastchar, PL_tokenbuf);
4103 Perl_warner(aTHX_ WARN_AMBIGUOUS,
4104 "Ambiguous use of %c resolved as operator %c",
4105 lastchar, lastchar);
4111 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4112 newSVpv(CopFILE(PL_curcop),0));
4116 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4117 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
4120 case KEY___PACKAGE__:
4121 yylval.opval = (OP*)newSVOP(OP_CONST, 0,
4123 ? newSVsv(PL_curstname)
4132 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
4133 char *pname = "main";
4134 if (PL_tokenbuf[2] == 'D')
4135 pname = HvNAME(PL_curstash ? PL_curstash : PL_defstash);
4136 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), TRUE, SVt_PVIO);
4139 GvIOp(gv) = newIO();
4140 IoIFP(GvIOp(gv)) = PL_rsfp;
4141 #if defined(HAS_FCNTL) && defined(F_SETFD)
4143 int fd = PerlIO_fileno(PL_rsfp);
4144 fcntl(fd,F_SETFD,fd >= 3);
4147 /* Mark this internal pseudo-handle as clean */
4148 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
4150 IoTYPE(GvIOp(gv)) = IoTYPE_PIPE;
4151 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
4152 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
4154 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
4155 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
4156 /* if the script was opened in binmode, we need to revert
4157 * it to text mode for compatibility; but only iff it has CRs
4158 * XXX this is a questionable hack at best. */
4159 if (PL_bufend-PL_bufptr > 2
4160 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
4163 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
4164 loc = PerlIO_tell(PL_rsfp);
4165 (void)PerlIO_seek(PL_rsfp, 0L, 0);
4167 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
4169 PerlIO_seek(PL_rsfp, loc, 0);
4173 #ifdef PERLIO_LAYERS
4174 if (UTF && !IN_BYTE)
4175 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
4188 if (PL_expect == XSTATE) {
4195 if (*s == ':' && s[1] == ':') {
4198 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4199 if (!(tmp = keyword(PL_tokenbuf, len)))
4200 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
4214 LOP(OP_ACCEPT,XTERM);
4220 LOP(OP_ATAN2,XTERM);
4226 LOP(OP_BINMODE,XTERM);
4229 LOP(OP_BLESS,XTERM);
4238 (void)gv_fetchpv("ENV",TRUE, SVt_PVHV); /* may use HOME */
4255 if (!PL_cryptseen) {
4256 PL_cryptseen = TRUE;
4260 LOP(OP_CRYPT,XTERM);
4263 if (ckWARN(WARN_CHMOD)) {
4264 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
4265 if (*d != '0' && isDIGIT(*d))
4266 Perl_warner(aTHX_ WARN_CHMOD,
4267 "chmod() mode argument is missing initial 0");
4269 LOP(OP_CHMOD,XTERM);
4272 LOP(OP_CHOWN,XTERM);
4275 LOP(OP_CONNECT,XTERM);
4291 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4295 PL_hints |= HINT_BLOCK_SCOPE;
4305 gv_fetchpv("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
4306 LOP(OP_DBMOPEN,XTERM);
4312 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4319 yylval.ival = CopLINE(PL_curcop);
4333 PL_expect = (*s == '{') ? XTERMBLOCK : XTERM;
4334 UNIBRACK(OP_ENTEREVAL);
4349 case KEY_endhostent:
4355 case KEY_endservent:
4358 case KEY_endprotoent:
4369 yylval.ival = CopLINE(PL_curcop);
4371 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
4373 if ((PL_bufend - p) >= 3 &&
4374 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
4376 else if ((PL_bufend - p) >= 4 &&
4377 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
4380 if (isIDFIRST_lazy_if(p,UTF)) {
4381 p = scan_ident(p, PL_bufend,
4382 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4386 Perl_croak(aTHX_ "Missing $ on loop variable");
4391 LOP(OP_FORMLINE,XTERM);
4397 LOP(OP_FCNTL,XTERM);
4403 LOP(OP_FLOCK,XTERM);
4412 LOP(OP_GREPSTART, XREF);
4415 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4430 case KEY_getpriority:
4431 LOP(OP_GETPRIORITY,XTERM);
4433 case KEY_getprotobyname:
4436 case KEY_getprotobynumber:
4437 LOP(OP_GPBYNUMBER,XTERM);
4439 case KEY_getprotoent:
4451 case KEY_getpeername:
4452 UNI(OP_GETPEERNAME);
4454 case KEY_gethostbyname:
4457 case KEY_gethostbyaddr:
4458 LOP(OP_GHBYADDR,XTERM);
4460 case KEY_gethostent:
4463 case KEY_getnetbyname:
4466 case KEY_getnetbyaddr:
4467 LOP(OP_GNBYADDR,XTERM);
4472 case KEY_getservbyname:
4473 LOP(OP_GSBYNAME,XTERM);
4475 case KEY_getservbyport:
4476 LOP(OP_GSBYPORT,XTERM);
4478 case KEY_getservent:
4481 case KEY_getsockname:
4482 UNI(OP_GETSOCKNAME);
4484 case KEY_getsockopt:
4485 LOP(OP_GSOCKOPT,XTERM);
4507 yylval.ival = CopLINE(PL_curcop);
4511 LOP(OP_INDEX,XTERM);
4517 LOP(OP_IOCTL,XTERM);
4529 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4561 LOP(OP_LISTEN,XTERM);
4570 s = scan_pat(s,OP_MATCH);
4571 TERM(sublex_start());
4574 LOP(OP_MAPSTART, XREF);
4577 LOP(OP_MKDIR,XTERM);
4580 LOP(OP_MSGCTL,XTERM);
4583 LOP(OP_MSGGET,XTERM);
4586 LOP(OP_MSGRCV,XTERM);
4589 LOP(OP_MSGSND,XTERM);
4595 if (isIDFIRST_lazy_if(s,UTF)) {
4596 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
4597 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
4599 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
4600 if (!PL_in_my_stash) {
4603 sprintf(tmpbuf, "No such class %.1000s", PL_tokenbuf);
4611 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4618 if (PL_expect != XSTATE)
4619 yyerror("\"no\" not allowed in expression");
4620 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4621 s = force_version(s);
4626 if (*s == '(' || (s = skipspace(s), *s == '('))
4633 if (isIDFIRST_lazy_if(s,UTF)) {
4635 for (d = s; isALNUM_lazy_if(d,UTF); d++) ;
4637 if (strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE))
4638 Perl_warner(aTHX_ WARN_PRECEDENCE,
4639 "Precedence problem: open %.*s should be open(%.*s)",
4645 yylval.ival = OP_OR;
4655 LOP(OP_OPEN_DIR,XTERM);
4658 checkcomma(s,PL_tokenbuf,"filehandle");
4662 checkcomma(s,PL_tokenbuf,"filehandle");
4681 s = force_word(s,WORD,FALSE,TRUE,FALSE);
4685 LOP(OP_PIPE_OP,XTERM);
4688 s = scan_str(s,FALSE,FALSE);
4690 missingterm((char*)0);
4691 yylval.ival = OP_CONST;
4692 TERM(sublex_start());
4698 s = scan_str(s,FALSE,FALSE);
4700 missingterm((char*)0);
4702 if (SvCUR(PL_lex_stuff)) {
4705 d = SvPV_force(PL_lex_stuff, len);
4708 for (; isSPACE(*d) && len; --len, ++d) ;
4711 if (!warned && ckWARN(WARN_QW)) {
4712 for (; !isSPACE(*d) && len; --len, ++d) {
4714 Perl_warner(aTHX_ WARN_QW,
4715 "Possible attempt to separate words with commas");
4718 else if (*d == '#') {
4719 Perl_warner(aTHX_ WARN_QW,
4720 "Possible attempt to put comments in qw() list");
4726 for (; !isSPACE(*d) && len; --len, ++d) ;
4728 sv = newSVpvn(b, d-b);
4729 if (DO_UTF8(PL_lex_stuff))
4731 words = append_elem(OP_LIST, words,
4732 newSVOP(OP_CONST, 0, tokeq(sv)));
4736 PL_nextval[PL_nexttoke].opval = words;
4741 SvREFCNT_dec(PL_lex_stuff);
4742 PL_lex_stuff = Nullsv;
4749 s = scan_str(s,FALSE,FALSE);
4750 if (tmp == KEY_qu &&
4751 is_utf8_string((U8*)SvPVX(PL_lex_stuff), SvCUR(PL_lex_stuff)))
4752 SvUTF8_on(PL_lex_stuff);
4754 missingterm((char*)0);
4755 yylval.ival = OP_STRINGIFY;
4756 if (SvIVX(PL_lex_stuff) == '\'')
4757 SvIVX(PL_lex_stuff) = 0; /* qq'$foo' should intepolate */
4758 TERM(sublex_start());
4761 s = scan_pat(s,OP_QR);
4762 TERM(sublex_start());
4765 s = scan_str(s,FALSE,FALSE);
4767 missingterm((char*)0);
4768 yylval.ival = OP_BACKTICK;
4770 TERM(sublex_start());
4777 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
4778 s = force_version(s);
4781 *PL_tokenbuf = '\0';
4782 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4783 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
4784 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), TRUE);
4786 yyerror("<> should be quotes");
4794 s = force_word(s,WORD,TRUE,FALSE,FALSE);
4798 LOP(OP_RENAME,XTERM);
4807 LOP(OP_RINDEX,XTERM);
4830 LOP(OP_REVERSE,XTERM);
4841 TERM(sublex_start());
4843 TOKEN(1); /* force error */
4852 LOP(OP_SELECT,XTERM);
4858 LOP(OP_SEMCTL,XTERM);
4861 LOP(OP_SEMGET,XTERM);
4864 LOP(OP_SEMOP,XTERM);
4870 LOP(OP_SETPGRP,XTERM);
4872 case KEY_setpriority:
4873 LOP(OP_SETPRIORITY,XTERM);
4875 case KEY_sethostent:
4881 case KEY_setservent:
4884 case KEY_setprotoent:
4894 LOP(OP_SEEKDIR,XTERM);
4896 case KEY_setsockopt:
4897 LOP(OP_SSOCKOPT,XTERM);
4903 LOP(OP_SHMCTL,XTERM);
4906 LOP(OP_SHMGET,XTERM);
4909 LOP(OP_SHMREAD,XTERM);
4912 LOP(OP_SHMWRITE,XTERM);
4915 LOP(OP_SHUTDOWN,XTERM);
4924 LOP(OP_SOCKET,XTERM);
4926 case KEY_socketpair:
4927 LOP(OP_SOCKPAIR,XTERM);
4930 checkcomma(s,PL_tokenbuf,"subroutine name");
4932 if (*s == ';' || *s == ')') /* probably a close */
4933 Perl_croak(aTHX_ "sort is now a reserved word");
4935 s = force_word(s,WORD,TRUE,TRUE,FALSE);
4939 LOP(OP_SPLIT,XTERM);
4942 LOP(OP_SPRINTF,XTERM);
4945 LOP(OP_SPLICE,XTERM);
4960 LOP(OP_SUBSTR,XTERM);
4966 char tmpbuf[sizeof PL_tokenbuf];
4968 expectation attrful;
4969 bool have_name, have_proto;
4974 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
4975 (*s == ':' && s[1] == ':'))
4978 attrful = XATTRBLOCK;
4979 /* remember buffer pos'n for later force_word */
4980 tboffset = s - PL_oldbufptr;
4981 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
4982 if (strchr(tmpbuf, ':'))
4983 sv_setpv(PL_subname, tmpbuf);
4985 sv_setsv(PL_subname,PL_curstname);
4986 sv_catpvn(PL_subname,"::",2);
4987 sv_catpvn(PL_subname,tmpbuf,len);
4994 Perl_croak(aTHX_ "Missing name in \"my sub\"");
4995 PL_expect = XTERMBLOCK;
4996 attrful = XATTRTERM;
4997 sv_setpv(PL_subname,"?");
5001 if (key == KEY_format) {
5003 PL_lex_formbrack = PL_lex_brackets + 1;
5005 (void) force_word(PL_oldbufptr + tboffset, WORD,
5010 /* Look for a prototype */
5014 s = scan_str(s,FALSE,FALSE);
5016 Perl_croak(aTHX_ "Prototype not terminated");
5018 d = SvPVX(PL_lex_stuff);
5020 for (p = d; *p; ++p) {
5025 SvCUR(PL_lex_stuff) = tmp;
5033 if (*s == ':' && s[1] != ':')
5034 PL_expect = attrful;
5037 PL_nextval[PL_nexttoke].opval =
5038 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
5039 PL_lex_stuff = Nullsv;
5043 sv_setpv(PL_subname,"__ANON__");
5046 (void) force_word(PL_oldbufptr + tboffset, WORD,
5055 LOP(OP_SYSTEM,XREF);
5058 LOP(OP_SYMLINK,XTERM);
5061 LOP(OP_SYSCALL,XTERM);
5064 LOP(OP_SYSOPEN,XTERM);
5067 LOP(OP_SYSSEEK,XTERM);
5070 LOP(OP_SYSREAD,XTERM);
5073 LOP(OP_SYSWRITE,XTERM);
5077 TERM(sublex_start());
5098 LOP(OP_TRUNCATE,XTERM);
5110 yylval.ival = CopLINE(PL_curcop);
5114 yylval.ival = CopLINE(PL_curcop);
5118 LOP(OP_UNLINK,XTERM);
5124 LOP(OP_UNPACK,XTERM);
5127 LOP(OP_UTIME,XTERM);
5130 if (ckWARN(WARN_UMASK)) {
5131 for (d = s; d < PL_bufend && (isSPACE(*d) || *d == '('); d++) ;
5132 if (*d != '0' && isDIGIT(*d))
5133 Perl_warner(aTHX_ WARN_UMASK,
5134 "umask: argument is missing initial 0");
5139 LOP(OP_UNSHIFT,XTERM);
5142 if (PL_expect != XSTATE)
5143 yyerror("\"use\" not allowed in expression");
5145 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
5146 s = force_version(s);
5147 if (*s == ';' || (s = skipspace(s), *s == ';')) {
5148 PL_nextval[PL_nexttoke].opval = Nullop;
5153 s = force_word(s,WORD,FALSE,TRUE,FALSE);
5154 s = force_version(s);
5166 yylval.ival = CopLINE(PL_curcop);
5170 PL_hints |= HINT_BLOCK_SCOPE;
5177 LOP(OP_WAITPID,XTERM);
5185 static char ctl_l[2];
5187 if (ctl_l[0] == '\0')
5188 ctl_l[0] = toCTRL('L');
5189 gv_fetchpv(ctl_l,TRUE, SVt_PV);
5192 gv_fetchpv("\f",TRUE, SVt_PV); /* Make sure $^L is defined */
5197 if (PL_expect == XOPERATOR)
5203 yylval.ival = OP_XOR;
5208 TERM(sublex_start());
5213 #pragma segment Main
5217 Perl_keyword(pTHX_ register char *d, I32 len)
5222 if (strEQ(d,"__FILE__")) return -KEY___FILE__;
5223 if (strEQ(d,"__LINE__")) return -KEY___LINE__;
5224 if (strEQ(d,"__PACKAGE__")) return -KEY___PACKAGE__;
5225 if (strEQ(d,"__DATA__")) return KEY___DATA__;
5226 if (strEQ(d,"__END__")) return KEY___END__;
5230 if (strEQ(d,"AUTOLOAD")) return KEY_AUTOLOAD;
5235 if (strEQ(d,"and")) return -KEY_and;
5236 if (strEQ(d,"abs")) return -KEY_abs;
5239 if (strEQ(d,"alarm")) return -KEY_alarm;
5240 if (strEQ(d,"atan2")) return -KEY_atan2;
5243 if (strEQ(d,"accept")) return -KEY_accept;
5248 if (strEQ(d,"BEGIN")) return KEY_BEGIN;
5251 if (strEQ(d,"bless")) return -KEY_bless;
5252 if (strEQ(d,"bind")) return -KEY_bind;
5253 if (strEQ(d,"binmode")) return -KEY_binmode;
5256 if (strEQ(d,"CORE")) return -KEY_CORE;
5257 if (strEQ(d,"CHECK")) return KEY_CHECK;
5262 if (strEQ(d,"cmp")) return -KEY_cmp;
5263 if (strEQ(d,"chr")) return -KEY_chr;
5264 if (strEQ(d,"cos")) return -KEY_cos;
5267 if (strEQ(d,"chop")) return -KEY_chop;
5270 if (strEQ(d,"close")) return -KEY_close;
5271 if (strEQ(d,"chdir")) return -KEY_chdir;
5272 if (strEQ(d,"chomp")) return -KEY_chomp;
5273 if (strEQ(d,"chmod")) return -KEY_chmod;
5274 if (strEQ(d,"chown")) return -KEY_chown;
5275 if (strEQ(d,"crypt")) return -KEY_crypt;
5278 if (strEQ(d,"chroot")) return -KEY_chroot;
5279 if (strEQ(d,"caller")) return -KEY_caller;
5282 if (strEQ(d,"connect")) return -KEY_connect;
5285 if (strEQ(d,"closedir")) return -KEY_closedir;
5286 if (strEQ(d,"continue")) return -KEY_continue;
5291 if (strEQ(d,"DESTROY")) return KEY_DESTROY;
5296 if (strEQ(d,"do")) return KEY_do;
5299 if (strEQ(d,"die")) return -KEY_die;
5302 if (strEQ(d,"dump")) return -KEY_dump;
5305 if (strEQ(d,"delete")) return KEY_delete;
5308 if (strEQ(d,"defined")) return KEY_defined;
5309 if (strEQ(d,"dbmopen")) return -KEY_dbmopen;
5312 if (strEQ(d,"dbmclose")) return -KEY_dbmclose;
5317 if (strEQ(d,"END")) return KEY_END;
5322 if (strEQ(d,"eq")) return -KEY_eq;
5325 if (strEQ(d,"eof")) return -KEY_eof;
5326 if (strEQ(d,"exp")) return -KEY_exp;
5329 if (strEQ(d,"else")) return KEY_else;
5330 if (strEQ(d,"exit")) return -KEY_exit;
5331 if (strEQ(d,"eval")) return KEY_eval;
5332 if (strEQ(d,"exec")) return -KEY_exec;
5333 if (strEQ(d,"each")) return -KEY_each;
5336 if (strEQ(d,"elsif")) return KEY_elsif;
5339 if (strEQ(d,"exists")) return KEY_exists;
5340 if (strEQ(d,"elseif")) Perl_warn(aTHX_ "elseif should be elsif");
5343 if (strEQ(d,"endgrent")) return -KEY_endgrent;
5344 if (strEQ(d,"endpwent")) return -KEY_endpwent;
5347 if (strEQ(d,"endnetent")) return -KEY_endnetent;
5350 if (strEQ(d,"endhostent")) return -KEY_endhostent;
5351 if (strEQ(d,"endservent")) return -KEY_endservent;
5354 if (strEQ(d,"endprotoent")) return -KEY_endprotoent;
5361 if (strEQ(d,"for")) return KEY_for;
5364 if (strEQ(d,"fork")) return -KEY_fork;
5367 if (strEQ(d,"fcntl")) return -KEY_fcntl;
5368 if (strEQ(d,"flock")) return -KEY_flock;
5371 if (strEQ(d,"format")) return KEY_format;
5372 if (strEQ(d,"fileno")) return -KEY_fileno;
5375 if (strEQ(d,"foreach")) return KEY_foreach;
5378 if (strEQ(d,"formline")) return -KEY_formline;
5383 if (strnEQ(d,"get",3)) {
5388 if (strEQ(d,"ppid")) return -KEY_getppid;
5389 if (strEQ(d,"pgrp")) return -KEY_getpgrp;
5392 if (strEQ(d,"pwent")) return -KEY_getpwent;
5393 if (strEQ(d,"pwnam")) return -KEY_getpwnam;
5394 if (strEQ(d,"pwuid")) return -KEY_getpwuid;
5397 if (strEQ(d,"peername")) return -KEY_getpeername;
5398 if (strEQ(d,"protoent")) return -KEY_getprotoent;
5399 if (strEQ(d,"priority")) return -KEY_getpriority;
5402 if (strEQ(d,"protobyname")) return -KEY_getprotobyname;
5405 if (strEQ(d,"protobynumber"))return -KEY_getprotobynumber;
5409 else if (*d == 'h') {
5410 if (strEQ(d,"hostbyname")) return -KEY_gethostbyname;
5411 if (strEQ(d,"hostbyaddr")) return -KEY_gethostbyaddr;
5412 if (strEQ(d,"hostent")) return -KEY_gethostent;
5414 else if (*d == 'n') {
5415 if (strEQ(d,"netbyname")) return -KEY_getnetbyname;
5416 if (strEQ(d,"netbyaddr")) return -KEY_getnetbyaddr;
5417 if (strEQ(d,"netent")) return -KEY_getnetent;
5419 else if (*d == 's') {
5420 if (strEQ(d,"servbyname")) return -KEY_getservbyname;
5421 if (strEQ(d,"servbyport")) return -KEY_getservbyport;
5422 if (strEQ(d,"servent")) return -KEY_getservent;
5423 if (strEQ(d,"sockname")) return -KEY_getsockname;
5424 if (strEQ(d,"sockopt")) return -KEY_getsockopt;
5426 else if (*d == 'g') {
5427 if (strEQ(d,"grent")) return -KEY_getgrent;
5428 if (strEQ(d,"grnam")) return -KEY_getgrnam;
5429 if (strEQ(d,"grgid")) return -KEY_getgrgid;
5431 else if (*d == 'l') {
5432 if (strEQ(d,"login")) return -KEY_getlogin;
5434 else if (strEQ(d,"c")) return -KEY_getc;
5439 if (strEQ(d,"gt")) return -KEY_gt;
5440 if (strEQ(d,"ge")) return -KEY_ge;
5443 if (strEQ(d,"grep")) return KEY_grep;
5444 if (strEQ(d,"goto")) return KEY_goto;
5445 if (strEQ(d,"glob")) return KEY_glob;
5448 if (strEQ(d,"gmtime")) return -KEY_gmtime;
5453 if (strEQ(d,"hex")) return -KEY_hex;
5456 if (strEQ(d,"INIT")) return KEY_INIT;
5461 if (strEQ(d,"if")) return KEY_if;
5464 if (strEQ(d,"int")) return -KEY_int;
5467 if (strEQ(d,"index")) return -KEY_index;
5468 if (strEQ(d,"ioctl")) return -KEY_ioctl;
5473 if (strEQ(d,"join")) return -KEY_join;
5477 if (strEQ(d,"keys")) return -KEY_keys;
5478 if (strEQ(d,"kill")) return -KEY_kill;
5484 if (strEQ(d,"lt")) return -KEY_lt;
5485 if (strEQ(d,"le")) return -KEY_le;
5486 if (strEQ(d,"lc")) return -KEY_lc;
5489 if (strEQ(d,"log")) return -KEY_log;
5492 if (strEQ(d,"last")) return KEY_last;
5493 if (strEQ(d,"link")) return -KEY_link;
5494 if (strEQ(d,"lock")) return -KEY_lock;
5497 if (strEQ(d,"local")) return KEY_local;
5498 if (strEQ(d,"lstat")) return -KEY_lstat;
5501 if (strEQ(d,"length")) return -KEY_length;
5502 if (strEQ(d,"listen")) return -KEY_listen;
5505 if (strEQ(d,"lcfirst")) return -KEY_lcfirst;
5508 if (strEQ(d,"localtime")) return -KEY_localtime;
5514 case 1: return KEY_m;
5516 if (strEQ(d,"my")) return KEY_my;
5519 if (strEQ(d,"map")) return KEY_map;
5522 if (strEQ(d,"mkdir")) return -KEY_mkdir;
5525 if (strEQ(d,"msgctl")) return -KEY_msgctl;
5526 if (strEQ(d,"msgget")) return -KEY_msgget;
5527 if (strEQ(d,"msgrcv")) return -KEY_msgrcv;
5528 if (strEQ(d,"msgsnd")) return -KEY_msgsnd;
5533 if (strEQ(d,"next")) return KEY_next;
5534 if (strEQ(d,"ne")) return -KEY_ne;
5535 if (strEQ(d,"not")) return -KEY_not;
5536 if (strEQ(d,"no")) return KEY_no;
5541 if (strEQ(d,"or")) return -KEY_or;
5544 if (strEQ(d,"ord")) return -KEY_ord;
5545 if (strEQ(d,"oct")) return -KEY_oct;
5546 if (strEQ(d,"our")) return KEY_our;
5549 if (strEQ(d,"open")) return -KEY_open;
5552 if (strEQ(d,"opendir")) return -KEY_opendir;
5559 if (strEQ(d,"pop")) return -KEY_pop;
5560 if (strEQ(d,"pos")) return KEY_pos;
5563 if (strEQ(d,"push")) return -KEY_push;
5564 if (strEQ(d,"pack")) return -KEY_pack;
5565 if (strEQ(d,"pipe")) return -KEY_pipe;
5568 if (strEQ(d,"print")) return KEY_print;
5571 if (strEQ(d,"printf")) return KEY_printf;
5574 if (strEQ(d,"package")) return KEY_package;
5577 if (strEQ(d,"prototype")) return KEY_prototype;
5582 if (strEQ(d,"q")) return KEY_q;
5583 if (strEQ(d,"qr")) return KEY_qr;
5584 if (strEQ(d,"qq")) return KEY_qq;
5585 if (strEQ(d,"qu")) return KEY_qu;
5586 if (strEQ(d,"qw")) return KEY_qw;
5587 if (strEQ(d,"qx")) return KEY_qx;
5589 else if (strEQ(d,"quotemeta")) return -KEY_quotemeta;
5594 if (strEQ(d,"ref")) return -KEY_ref;
5597 if (strEQ(d,"read")) return -KEY_read;
5598 if (strEQ(d,"rand")) return -KEY_rand;
5599 if (strEQ(d,"recv")) return -KEY_recv;
5600 if (strEQ(d,"redo")) return KEY_redo;
5603 if (strEQ(d,"rmdir")) return -KEY_rmdir;
5604 if (strEQ(d,"reset")) return -KEY_reset;
5607 if (strEQ(d,"return")) return KEY_return;
5608 if (strEQ(d,"rename")) return -KEY_rename;
5609 if (strEQ(d,"rindex")) return -KEY_rindex;
5612 if (strEQ(d,"require")) return -KEY_require;
5613 if (strEQ(d,"reverse")) return -KEY_reverse;
5614 if (strEQ(d,"readdir")) return -KEY_readdir;
5617 if (strEQ(d,"readlink")) return -KEY_readlink;
5618 if (strEQ(d,"readline")) return -KEY_readline;
5619 if (strEQ(d,"readpipe")) return -KEY_readpipe;
5622 if (strEQ(d,"rewinddir")) return -KEY_rewinddir;
5628 case 0: return KEY_s;
5630 if (strEQ(d,"scalar")) return KEY_scalar;
5635 if (strEQ(d,"seek")) return -KEY_seek;
5636 if (strEQ(d,"send")) return -KEY_send;
5639 if (strEQ(d,"semop")) return -KEY_semop;
5642 if (strEQ(d,"select")) return -KEY_select;
5643 if (strEQ(d,"semctl")) return -KEY_semctl;
5644 if (strEQ(d,"semget")) return -KEY_semget;
5647 if (strEQ(d,"setpgrp")) return -KEY_setpgrp;
5648 if (strEQ(d,"seekdir")) return -KEY_seekdir;
5651 if (strEQ(d,"setpwent")) return -KEY_setpwent;
5652 if (strEQ(d,"setgrent")) return -KEY_setgrent;
5655 if (strEQ(d,"setnetent")) return -KEY_setnetent;
5658 if (strEQ(d,"setsockopt")) return -KEY_setsockopt;
5659 if (strEQ(d,"sethostent")) return -KEY_sethostent;
5660 if (strEQ(d,"setservent")) return -KEY_setservent;
5663 if (strEQ(d,"setpriority")) return -KEY_setpriority;
5664 if (strEQ(d,"setprotoent")) return -KEY_setprotoent;
5671 if (strEQ(d,"shift")) return -KEY_shift;
5674 if (strEQ(d,"shmctl")) return -KEY_shmctl;
5675 if (strEQ(d,"shmget")) return -KEY_shmget;
5678 if (strEQ(d,"shmread")) return -KEY_shmread;
5681 if (strEQ(d,"shmwrite")) return -KEY_shmwrite;
5682 if (strEQ(d,"shutdown")) return -KEY_shutdown;
5687 if (strEQ(d,"sin")) return -KEY_sin;
5690 if (strEQ(d,"sleep")) return -KEY_sleep;
5693 if (strEQ(d,"sort")) return KEY_sort;
5694 if (strEQ(d,"socket")) return -KEY_socket;
5695 if (strEQ(d,"socketpair")) return -KEY_socketpair;
5698 if (strEQ(d,"split")) return KEY_split;
5699 if (strEQ(d,"sprintf")) return -KEY_sprintf;
5700 if (strEQ(d,"splice")) return -KEY_splice;
5703 if (strEQ(d,"sqrt")) return -KEY_sqrt;
5706 if (strEQ(d,"srand")) return -KEY_srand;
5709 if (strEQ(d,"stat")) return -KEY_stat;
5710 if (strEQ(d,"study")) return KEY_study;
5713 if (strEQ(d,"substr")) return -KEY_substr;
5714 if (strEQ(d,"sub")) return KEY_sub;
5719 if (strEQ(d,"system")) return -KEY_system;
5722 if (strEQ(d,"symlink")) return -KEY_symlink;
5723 if (strEQ(d,"syscall")) return -KEY_syscall;
5724 if (strEQ(d,"sysopen")) return -KEY_sysopen;
5725 if (strEQ(d,"sysread")) return -KEY_sysread;
5726 if (strEQ(d,"sysseek")) return -KEY_sysseek;
5729 if (strEQ(d,"syswrite")) return -KEY_syswrite;
5738 if (strEQ(d,"tr")) return KEY_tr;
5741 if (strEQ(d,"tie")) return KEY_tie;
5744 if (strEQ(d,"tell")) return -KEY_tell;
5745 if (strEQ(d,"tied")) return KEY_tied;
5746 if (strEQ(d,"time")) return -KEY_time;
5749 if (strEQ(d,"times")) return -KEY_times;
5752 if (strEQ(d,"telldir")) return -KEY_telldir;
5755 if (strEQ(d,"truncate")) return -KEY_truncate;
5762 if (strEQ(d,"uc")) return -KEY_uc;
5765 if (strEQ(d,"use")) return KEY_use;
5768 if (strEQ(d,"undef")) return KEY_undef;
5769 if (strEQ(d,"until")) return KEY_until;
5770 if (strEQ(d,"untie")) return KEY_untie;
5771 if (strEQ(d,"utime")) return -KEY_utime;
5772 if (strEQ(d,"umask")) return -KEY_umask;
5775 if (strEQ(d,"unless")) return KEY_unless;
5776 if (strEQ(d,"unpack")) return -KEY_unpack;
5777 if (strEQ(d,"unlink")) return -KEY_unlink;
5780 if (strEQ(d,"unshift")) return -KEY_unshift;
5781 if (strEQ(d,"ucfirst")) return -KEY_ucfirst;
5786 if (strEQ(d,"values")) return -KEY_values;
5787 if (strEQ(d,"vec")) return -KEY_vec;
5792 if (strEQ(d,"warn")) return -KEY_warn;
5793 if (strEQ(d,"wait")) return -KEY_wait;
5796 if (strEQ(d,"while")) return KEY_while;
5797 if (strEQ(d,"write")) return -KEY_write;
5800 if (strEQ(d,"waitpid")) return -KEY_waitpid;
5803 if (strEQ(d,"wantarray")) return -KEY_wantarray;
5808 if (len == 1) return -KEY_x;
5809 if (strEQ(d,"xor")) return -KEY_xor;
5812 if (len == 1) return KEY_y;
5821 S_checkcomma(pTHX_ register char *s, char *name, char *what)
5825 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
5826 if (ckWARN(WARN_SYNTAX)) {
5828 for (w = s+2; *w && level; w++) {
5835 for (; *w && isSPACE(*w); w++) ;
5836 if (!*w || !strchr(";|})]oaiuw!=", *w)) /* an advisory hack only... */
5837 Perl_warner(aTHX_ WARN_SYNTAX,
5838 "%s (...) interpreted as function",name);
5841 while (s < PL_bufend && isSPACE(*s))
5845 while (s < PL_bufend && isSPACE(*s))
5847 if (isIDFIRST_lazy_if(s,UTF)) {
5849 while (isALNUM_lazy_if(s,UTF))
5851 while (s < PL_bufend && isSPACE(*s))
5856 kw = keyword(w, s - w) || get_cv(w, FALSE) != 0;
5860 Perl_croak(aTHX_ "No comma allowed after %s", what);
5865 /* Either returns sv, or mortalizes sv and returns a new SV*.
5866 Best used as sv=new_constant(..., sv, ...).
5867 If s, pv are NULL, calls subroutine with one argument,
5868 and type is used with error messages only. */
5871 S_new_constant(pTHX_ char *s, STRLEN len, const char *key, SV *sv, SV *pv,
5875 HV *table = GvHV(PL_hintgv); /* ^H */
5879 const char *why1, *why2, *why3;
5881 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
5884 why2 = strEQ(key,"charnames")
5885 ? "(possibly a missing \"use charnames ...\")"
5887 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
5888 (type ? type: "undef"), why2);
5890 /* This is convoluted and evil ("goto considered harmful")
5891 * but I do not understand the intricacies of all the different
5892 * failure modes of %^H in here. The goal here is to make
5893 * the most probable error message user-friendly. --jhi */
5898 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
5899 (type ? type: "undef"), why1, why2, why3);
5901 yyerror(SvPVX(msg));
5905 cvp = hv_fetch(table, key, strlen(key), FALSE);
5906 if (!cvp || !SvOK(*cvp)) {
5909 why3 = "} is not defined";
5912 sv_2mortal(sv); /* Parent created it permanently */
5915 pv = sv_2mortal(newSVpvn(s, len));
5917 typesv = sv_2mortal(newSVpv(type, 0));
5919 typesv = &PL_sv_undef;
5921 PUSHSTACKi(PERLSI_OVERLOAD);
5933 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
5937 /* Check the eval first */
5938 if (!PL_in_eval && SvTRUE(ERRSV)) {
5940 sv_catpv(ERRSV, "Propagated");
5941 yyerror(SvPV(ERRSV, n_a)); /* Duplicates the message inside eval */
5943 res = SvREFCNT_inc(sv);
5947 (void)SvREFCNT_inc(res);
5956 why1 = "Call to &{$^H{";
5958 why3 = "}} did not return a defined value";
5967 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
5969 register char *d = dest;
5970 register char *e = d + destlen - 3; /* two-character token, ending NUL */
5973 Perl_croak(aTHX_ ident_too_long);
5974 if (isALNUM(*s)) /* UTF handled below */
5976 else if (*s == '\'' && allow_package && isIDFIRST_lazy_if(s+1,UTF)) {
5981 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
5985 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
5986 char *t = s + UTF8SKIP(s);
5987 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
5989 if (d + (t - s) > e)
5990 Perl_croak(aTHX_ ident_too_long);
5991 Copy(s, d, t - s, char);
6004 S_scan_ident(pTHX_ register char *s, register char *send, char *dest, STRLEN destlen, I32 ck_uni)
6014 e = d + destlen - 3; /* two-character token, ending NUL */
6016 while (isDIGIT(*s)) {
6018 Perl_croak(aTHX_ ident_too_long);
6025 Perl_croak(aTHX_ ident_too_long);
6026 if (isALNUM(*s)) /* UTF handled below */
6028 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
6033 else if (*s == ':' && s[1] == ':') {
6037 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
6038 char *t = s + UTF8SKIP(s);
6039 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
6041 if (d + (t - s) > e)
6042 Perl_croak(aTHX_ ident_too_long);
6043 Copy(s, d, t - s, char);
6054 if (PL_lex_state != LEX_NORMAL)
6055 PL_lex_state = LEX_INTERPENDMAYBE;
6058 if (*s == '$' && s[1] &&
6059 (isALNUM_lazy_if(s+1,UTF) || strchr("${", s[1]) || strnEQ(s+1,"::",2)) )
6072 if (*d == '^' && *s && isCONTROLVAR(*s)) {
6077 if (isSPACE(s[-1])) {
6080 if (!SPACE_OR_TAB(ch)) {
6086 if (isIDFIRST_lazy_if(d,UTF)) {
6090 while ((e < send && isALNUM_lazy_if(e,UTF)) || *e == ':') {
6092 while (e < send && UTF8_IS_CONTINUED(*e) && is_utf8_mark((U8*)e))
6095 Copy(s, d, e - s, char);
6100 while ((isALNUM(*s) || *s == ':') && d < e)
6103 Perl_croak(aTHX_ ident_too_long);
6106 while (s < send && SPACE_OR_TAB(*s)) s++;
6107 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
6108 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
6109 const char *brack = *s == '[' ? "[...]" : "{...}";
6110 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6111 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
6112 funny, dest, brack, funny, dest, brack);
6115 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
6119 /* Handle extended ${^Foo} variables
6120 * 1999-02-27 mjd-perl-patch@plover.com */
6121 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
6125 while (isALNUM(*s) && d < e) {
6129 Perl_croak(aTHX_ ident_too_long);
6134 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets)
6135 PL_lex_state = LEX_INTERPEND;
6138 if (PL_lex_state == LEX_NORMAL) {
6139 if (ckWARN(WARN_AMBIGUOUS) &&
6140 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
6142 Perl_warner(aTHX_ WARN_AMBIGUOUS,
6143 "Ambiguous use of %c{%s} resolved to %c%s",
6144 funny, dest, funny, dest);
6149 s = bracket; /* let the parser handle it */
6153 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
6154 PL_lex_state = LEX_INTERPEND;
6159 Perl_pmflag(pTHX_ U16 *pmfl, int ch)
6164 *pmfl |= PMf_GLOBAL;
6166 *pmfl |= PMf_CONTINUE;
6170 *pmfl |= PMf_MULTILINE;
6172 *pmfl |= PMf_SINGLELINE;
6174 *pmfl |= PMf_EXTENDED;
6178 S_scan_pat(pTHX_ char *start, I32 type)
6183 s = scan_str(start,FALSE,FALSE);
6185 Perl_croak(aTHX_ "Search pattern not terminated");
6187 pm = (PMOP*)newPMOP(type, 0);
6188 if (PL_multi_open == '?')
6189 pm->op_pmflags |= PMf_ONCE;
6191 while (*s && strchr("iomsx", *s))
6192 pmflag(&pm->op_pmflags,*s++);
6195 while (*s && strchr("iogcmsx", *s))
6196 pmflag(&pm->op_pmflags,*s++);
6198 pm->op_pmpermflags = pm->op_pmflags;
6200 PL_lex_op = (OP*)pm;
6201 yylval.ival = OP_MATCH;
6206 S_scan_subst(pTHX_ char *start)
6213 yylval.ival = OP_NULL;
6215 s = scan_str(start,FALSE,FALSE);
6218 Perl_croak(aTHX_ "Substitution pattern not terminated");
6220 if (s[-1] == PL_multi_open)
6223 first_start = PL_multi_start;
6224 s = scan_str(s,FALSE,FALSE);
6227 SvREFCNT_dec(PL_lex_stuff);
6228 PL_lex_stuff = Nullsv;
6230 Perl_croak(aTHX_ "Substitution replacement not terminated");
6232 PL_multi_start = first_start; /* so whole substitution is taken together */
6234 pm = (PMOP*)newPMOP(OP_SUBST, 0);
6240 else if (strchr("iogcmsx", *s))
6241 pmflag(&pm->op_pmflags,*s++);
6248 PL_sublex_info.super_bufptr = s;
6249 PL_sublex_info.super_bufend = PL_bufend;
6251 pm->op_pmflags |= PMf_EVAL;
6252 repl = newSVpvn("",0);
6254 sv_catpv(repl, es ? "eval " : "do ");
6255 sv_catpvn(repl, "{ ", 2);
6256 sv_catsv(repl, PL_lex_repl);
6257 sv_catpvn(repl, " };", 2);
6259 SvREFCNT_dec(PL_lex_repl);
6263 pm->op_pmpermflags = pm->op_pmflags;
6264 PL_lex_op = (OP*)pm;
6265 yylval.ival = OP_SUBST;
6270 S_scan_trans(pTHX_ char *start)
6279 yylval.ival = OP_NULL;
6281 s = scan_str(start,FALSE,FALSE);
6283 Perl_croak(aTHX_ "Transliteration pattern not terminated");
6284 if (s[-1] == PL_multi_open)
6287 s = scan_str(s,FALSE,FALSE);
6290 SvREFCNT_dec(PL_lex_stuff);
6291 PL_lex_stuff = Nullsv;
6293 Perl_croak(aTHX_ "Transliteration replacement not terminated");
6296 New(803,tbl,256,short);
6297 o = newPVOP(OP_TRANS, 0, (char*)tbl);
6299 complement = del = squash = 0;
6300 while (strchr("cds", *s)) {
6302 complement = OPpTRANS_COMPLEMENT;
6304 del = OPpTRANS_DELETE;
6306 squash = OPpTRANS_SQUASH;
6309 o->op_private = del|squash|complement|
6310 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
6311 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
6314 yylval.ival = OP_TRANS;
6319 S_scan_heredoc(pTHX_ register char *s)
6322 I32 op_type = OP_SCALAR;
6329 int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
6333 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
6336 for (peek = s; SPACE_OR_TAB(*peek); peek++) ;
6337 if (*peek && strchr("`'\"",*peek)) {
6340 s = delimcpy(d, e, s, PL_bufend, term, &len);
6350 if (!isALNUM_lazy_if(s,UTF))
6351 deprecate("bare << to mean <<\"\"");
6352 for (; isALNUM_lazy_if(s,UTF); s++) {
6357 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
6358 Perl_croak(aTHX_ "Delimiter for here document is too long");
6361 len = d - PL_tokenbuf;
6362 #ifndef PERL_STRICT_CR
6363 d = strchr(s, '\r');
6367 while (s < PL_bufend) {
6373 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
6382 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6387 if (outer || !(d=ninstr(s,PL_bufend,d,d+1)))
6388 herewas = newSVpvn(s,PL_bufend-s);
6390 s--, herewas = newSVpvn(s,d-s);
6391 s += SvCUR(herewas);
6393 tmpstr = NEWSV(87,79);
6394 sv_upgrade(tmpstr, SVt_PVIV);
6399 else if (term == '`') {
6400 op_type = OP_BACKTICK;
6401 SvIVX(tmpstr) = '\\';
6405 PL_multi_start = CopLINE(PL_curcop);
6406 PL_multi_open = PL_multi_close = '<';
6407 term = *PL_tokenbuf;
6408 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
6409 char *bufptr = PL_sublex_info.super_bufptr;
6410 char *bufend = PL_sublex_info.super_bufend;
6411 char *olds = s - SvCUR(herewas);
6412 s = strchr(bufptr, '\n');
6416 while (s < bufend &&
6417 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6419 CopLINE_inc(PL_curcop);
6422 CopLINE_set(PL_curcop, PL_multi_start);
6423 missingterm(PL_tokenbuf);
6425 sv_setpvn(herewas,bufptr,d-bufptr+1);
6426 sv_setpvn(tmpstr,d+1,s-d);
6428 sv_catpvn(herewas,s,bufend-s);
6429 (void)strcpy(bufptr,SvPVX(herewas));
6436 while (s < PL_bufend &&
6437 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
6439 CopLINE_inc(PL_curcop);
6441 if (s >= PL_bufend) {
6442 CopLINE_set(PL_curcop, PL_multi_start);
6443 missingterm(PL_tokenbuf);
6445 sv_setpvn(tmpstr,d+1,s-d);
6447 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
6449 sv_catpvn(herewas,s,PL_bufend-s);
6450 sv_setsv(PL_linestr,herewas);
6451 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
6452 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6455 sv_setpvn(tmpstr,"",0); /* avoid "uninitialized" warning */
6456 while (s >= PL_bufend) { /* multiple line string? */
6458 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6459 CopLINE_set(PL_curcop, PL_multi_start);
6460 missingterm(PL_tokenbuf);
6462 CopLINE_inc(PL_curcop);
6463 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6464 #ifndef PERL_STRICT_CR
6465 if (PL_bufend - PL_linestart >= 2) {
6466 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
6467 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
6469 PL_bufend[-2] = '\n';
6471 SvCUR_set(PL_linestr, PL_bufend - SvPVX(PL_linestr));
6473 else if (PL_bufend[-1] == '\r')
6474 PL_bufend[-1] = '\n';
6476 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
6477 PL_bufend[-1] = '\n';
6479 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6480 SV *sv = NEWSV(88,0);
6482 sv_upgrade(sv, SVt_PVMG);
6483 sv_setsv(sv,PL_linestr);
6484 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop),sv);
6486 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
6489 sv_catsv(PL_linestr,herewas);
6490 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6494 sv_catsv(tmpstr,PL_linestr);
6499 PL_multi_end = CopLINE(PL_curcop);
6500 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
6501 SvLEN_set(tmpstr, SvCUR(tmpstr) + 1);
6502 Renew(SvPVX(tmpstr), SvLEN(tmpstr), char);
6504 SvREFCNT_dec(herewas);
6505 if (UTF && !IN_BYTE && is_utf8_string((U8*)SvPVX(tmpstr), SvCUR(tmpstr)))
6507 PL_lex_stuff = tmpstr;
6508 yylval.ival = op_type;
6513 takes: current position in input buffer
6514 returns: new position in input buffer
6515 side-effects: yylval and lex_op are set.
6520 <FH> read from filehandle
6521 <pkg::FH> read from package qualified filehandle
6522 <pkg'FH> read from package qualified filehandle
6523 <$fh> read from filehandle in $fh
6529 S_scan_inputsymbol(pTHX_ char *start)
6531 register char *s = start; /* current position in buffer */
6537 d = PL_tokenbuf; /* start of temp holding space */
6538 e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
6539 end = strchr(s, '\n');
6542 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
6544 /* die if we didn't have space for the contents of the <>,
6545 or if it didn't end, or if we see a newline
6548 if (len >= sizeof PL_tokenbuf)
6549 Perl_croak(aTHX_ "Excessively long <> operator");
6551 Perl_croak(aTHX_ "Unterminated <> operator");
6556 Remember, only scalar variables are interpreted as filehandles by
6557 this code. Anything more complex (e.g., <$fh{$num}>) will be
6558 treated as a glob() call.
6559 This code makes use of the fact that except for the $ at the front,
6560 a scalar variable and a filehandle look the same.
6562 if (*d == '$' && d[1]) d++;
6564 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
6565 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
6568 /* If we've tried to read what we allow filehandles to look like, and
6569 there's still text left, then it must be a glob() and not a getline.
6570 Use scan_str to pull out the stuff between the <> and treat it
6571 as nothing more than a string.
6574 if (d - PL_tokenbuf != len) {
6575 yylval.ival = OP_GLOB;
6577 s = scan_str(start,FALSE,FALSE);
6579 Perl_croak(aTHX_ "Glob not terminated");
6583 /* we're in a filehandle read situation */
6586 /* turn <> into <ARGV> */
6588 (void)strcpy(d,"ARGV");
6590 /* if <$fh>, create the ops to turn the variable into a
6596 /* try to find it in the pad for this block, otherwise find
6597 add symbol table ops
6599 if ((tmp = pad_findmy(d)) != NOT_IN_PAD) {
6600 OP *o = newOP(OP_PADSV, 0);
6602 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, o);
6605 GV *gv = gv_fetchpv(d+1,TRUE, SVt_PV);
6606 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0,
6607 newUNOP(OP_RV2SV, 0,
6608 newGVOP(OP_GV, 0, gv)));
6610 PL_lex_op->op_flags |= OPf_SPECIAL;
6611 /* we created the ops in PL_lex_op, so make yylval.ival a null op */
6612 yylval.ival = OP_NULL;
6615 /* If it's none of the above, it must be a literal filehandle
6616 (<Foo::BAR> or <FOO>) so build a simple readline OP */
6618 GV *gv = gv_fetchpv(d,TRUE, SVt_PVIO);
6619 PL_lex_op = (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
6620 yylval.ival = OP_NULL;
6629 takes: start position in buffer
6630 keep_quoted preserve \ on the embedded delimiter(s)
6631 keep_delims preserve the delimiters around the string
6632 returns: position to continue reading from buffer
6633 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
6634 updates the read buffer.
6636 This subroutine pulls a string out of the input. It is called for:
6637 q single quotes q(literal text)
6638 ' single quotes 'literal text'
6639 qq double quotes qq(interpolate $here please)
6640 " double quotes "interpolate $here please"
6641 qx backticks qx(/bin/ls -l)
6642 ` backticks `/bin/ls -l`
6643 qw quote words @EXPORT_OK = qw( func() $spam )
6644 m// regexp match m/this/
6645 s/// regexp substitute s/this/that/
6646 tr/// string transliterate tr/this/that/
6647 y/// string transliterate y/this/that/
6648 ($*@) sub prototypes sub foo ($)
6649 (stuff) sub attr parameters sub foo : attr(stuff)
6650 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
6652 In most of these cases (all but <>, patterns and transliterate)
6653 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
6654 calls scan_str(). s/// makes yylex() call scan_subst() which calls
6655 scan_str(). tr/// and y/// make yylex() call scan_trans() which
6658 It skips whitespace before the string starts, and treats the first
6659 character as the delimiter. If the delimiter is one of ([{< then
6660 the corresponding "close" character )]}> is used as the closing
6661 delimiter. It allows quoting of delimiters, and if the string has
6662 balanced delimiters ([{<>}]) it allows nesting.
6664 On success, the SV with the resulting string is put into lex_stuff or,
6665 if that is already non-NULL, into lex_repl. The second case occurs only
6666 when parsing the RHS of the special constructs s/// and tr/// (y///).
6667 For convenience, the terminating delimiter character is stuffed into
6672 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
6674 SV *sv; /* scalar value: string */
6675 char *tmps; /* temp string, used for delimiter matching */
6676 register char *s = start; /* current position in the buffer */
6677 register char term; /* terminating character */
6678 register char *to; /* current position in the sv's data */
6679 I32 brackets = 1; /* bracket nesting level */
6680 bool has_utf8 = FALSE; /* is there any utf8 content? */
6682 /* skip space before the delimiter */
6686 /* mark where we are, in case we need to report errors */
6689 /* after skipping whitespace, the next character is the terminator */
6691 if (UTF8_IS_CONTINUED(term) && UTF)
6694 /* mark where we are */
6695 PL_multi_start = CopLINE(PL_curcop);
6696 PL_multi_open = term;
6698 /* find corresponding closing delimiter */
6699 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
6701 PL_multi_close = term;
6703 /* create a new SV to hold the contents. 87 is leak category, I'm
6704 assuming. 79 is the SV's initial length. What a random number. */
6706 sv_upgrade(sv, SVt_PVIV);
6708 (void)SvPOK_only(sv); /* validate pointer */
6710 /* move past delimiter and try to read a complete string */
6712 sv_catpvn(sv, s, 1);
6715 /* extend sv if need be */
6716 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
6717 /* set 'to' to the next character in the sv's string */
6718 to = SvPVX(sv)+SvCUR(sv);
6720 /* if open delimiter is the close delimiter read unbridle */
6721 if (PL_multi_open == PL_multi_close) {
6722 for (; s < PL_bufend; s++,to++) {
6723 /* embedded newlines increment the current line number */
6724 if (*s == '\n' && !PL_rsfp)
6725 CopLINE_inc(PL_curcop);
6726 /* handle quoted delimiters */
6727 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
6728 if (!keep_quoted && s[1] == term)
6730 /* any other quotes are simply copied straight through */
6734 /* terminate when run out of buffer (the for() condition), or
6735 have found the terminator */
6736 else if (*s == term)
6738 else if (!has_utf8 && UTF8_IS_CONTINUED(*s) && UTF)
6744 /* if the terminator isn't the same as the start character (e.g.,
6745 matched brackets), we have to allow more in the quoting, and
6746 be prepared for nested brackets.
6749 /* read until we run out of string, or we find the terminator */
6750 for (; s < PL_bufend; s++,to++) {
6751 /* embedded newlines increment the line count */
6752 if (*s == '\n' && !PL_rsfp)
6753 CopLINE_inc(PL_curcop);
6754 /* backslashes can escape the open or closing characters */
6755 if (*s == '\\' && s+1 < PL_bufend) {
6757 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
6762 /* allow nested opens and closes */
6763 else if (*s == PL_multi_close && --brackets <= 0)
6765 else if (*s == PL_multi_open)
6767 else if (!has_utf8 && UTF8_IS_CONTINUED(*s) && UTF)
6772 /* terminate the copied string and update the sv's end-of-string */
6774 SvCUR_set(sv, to - SvPVX(sv));
6777 * this next chunk reads more into the buffer if we're not done yet
6781 break; /* handle case where we are done yet :-) */
6783 #ifndef PERL_STRICT_CR
6784 if (to - SvPVX(sv) >= 2) {
6785 if ((to[-2] == '\r' && to[-1] == '\n') ||
6786 (to[-2] == '\n' && to[-1] == '\r'))
6790 SvCUR_set(sv, to - SvPVX(sv));
6792 else if (to[-1] == '\r')
6795 else if (to - SvPVX(sv) == 1 && to[-1] == '\r')
6799 /* if we're out of file, or a read fails, bail and reset the current
6800 line marker so we can report where the unterminated string began
6803 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
6805 CopLINE_set(PL_curcop, PL_multi_start);
6808 /* we read a line, so increment our line counter */
6809 CopLINE_inc(PL_curcop);
6811 /* update debugger info */
6812 if (PERLDB_LINE && PL_curstash != PL_debstash) {
6813 SV *sv = NEWSV(88,0);
6815 sv_upgrade(sv, SVt_PVMG);
6816 sv_setsv(sv,PL_linestr);
6817 av_store(CopFILEAV(PL_curcop), (I32)CopLINE(PL_curcop), sv);
6820 /* having changed the buffer, we must update PL_bufend */
6821 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
6824 /* at this point, we have successfully read the delimited string */
6827 sv_catpvn(sv, s, 1);
6830 PL_multi_end = CopLINE(PL_curcop);
6833 /* if we allocated too much space, give some back */
6834 if (SvCUR(sv) + 5 < SvLEN(sv)) {
6835 SvLEN_set(sv, SvCUR(sv) + 1);
6836 Renew(SvPVX(sv), SvLEN(sv), char);
6839 /* decide whether this is the first or second quoted string we've read
6852 takes: pointer to position in buffer
6853 returns: pointer to new position in buffer
6854 side-effects: builds ops for the constant in yylval.op
6856 Read a number in any of the formats that Perl accepts:
6858 0(x[0-7A-F]+)|([0-7]+)|(b[01])
6859 [\d_]+(\.[\d_]*)?[Ee](\d+)
6861 Underbars (_) are allowed in decimal numbers. If -w is on,
6862 underbars before a decimal point must be at three digit intervals.
6864 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
6867 If it reads a number without a decimal point or an exponent, it will
6868 try converting the number to an integer and see if it can do so
6869 without loss of precision.
6873 Perl_scan_num(pTHX_ char *start, YYSTYPE* lvalp)
6875 register char *s = start; /* current position in buffer */
6876 register char *d; /* destination in temp buffer */
6877 register char *e; /* end of temp buffer */
6878 NV nv; /* number read, as a double */
6879 SV *sv = Nullsv; /* place to put the converted number */
6880 bool floatit; /* boolean: int or float? */
6881 char *lastub = 0; /* position of last underbar */
6882 static char number_too_long[] = "Number too long";
6884 /* We use the first character to decide what type of number this is */
6888 Perl_croak(aTHX_ "panic: scan_num");
6890 /* if it starts with a 0, it could be an octal number, a decimal in
6891 0.13 disguise, or a hexadecimal number, or a binary number. */
6895 u holds the "number so far"
6896 shift the power of 2 of the base
6897 (hex == 4, octal == 3, binary == 1)
6898 overflowed was the number more than we can hold?
6900 Shift is used when we add a digit. It also serves as an "are
6901 we in octal/hex/binary?" indicator to disallow hex characters
6907 bool overflowed = FALSE;
6908 static NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
6909 static char* bases[5] = { "", "binary", "", "octal",
6911 static char* Bases[5] = { "", "Binary", "", "Octal",
6913 static char *maxima[5] = { "",
6914 "0b11111111111111111111111111111111",
6918 char *base, *Base, *max;
6924 } else if (s[1] == 'b') {
6928 /* check for a decimal in disguise */
6929 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
6931 /* so it must be octal */
6935 base = bases[shift];
6936 Base = Bases[shift];
6937 max = maxima[shift];
6939 /* read the rest of the number */
6941 /* x is used in the overflow test,
6942 b is the digit we're adding on. */
6947 /* if we don't mention it, we're done */
6956 /* 8 and 9 are not octal */
6959 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
6963 case '2': case '3': case '4':
6964 case '5': case '6': case '7':
6966 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
6970 b = *s++ & 15; /* ASCII digit -> value of digit */
6974 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
6975 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
6976 /* make sure they said 0x */
6981 /* Prepare to put the digit we have onto the end
6982 of the number so far. We check for overflows.
6987 x = u << shift; /* make room for the digit */
6989 if ((x >> shift) != u
6990 && !(PL_hints & HINT_NEW_BINARY)) {
6993 if (ckWARN_d(WARN_OVERFLOW))
6994 Perl_warner(aTHX_ WARN_OVERFLOW,
6995 "Integer overflow in %s number",
6998 u = x | b; /* add the digit to the end */
7001 n *= nvshift[shift];
7002 /* If an NV has not enough bits in its
7003 * mantissa to represent an UV this summing of
7004 * small low-order numbers is a waste of time
7005 * (because the NV cannot preserve the
7006 * low-order bits anyway): we could just
7007 * remember when did we overflow and in the
7008 * end just multiply n by the right
7016 /* if we get here, we had success: make a scalar value from
7022 if (ckWARN(WARN_PORTABLE) && n > 4294967295.0)
7023 Perl_warner(aTHX_ WARN_PORTABLE,
7024 "%s number > %s non-portable",
7030 if (ckWARN(WARN_PORTABLE) && u > 0xffffffff)
7031 Perl_warner(aTHX_ WARN_PORTABLE,
7032 "%s number > %s non-portable",
7037 if (PL_hints & HINT_NEW_BINARY)
7038 sv = new_constant(start, s - start, "binary", sv, Nullsv, NULL);
7043 handle decimal numbers.
7044 we're also sent here when we read a 0 as the first digit
7046 case '1': case '2': case '3': case '4': case '5':
7047 case '6': case '7': case '8': case '9': case '.':
7050 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
7053 /* read next group of digits and _ and copy into d */
7054 while (isDIGIT(*s) || *s == '_') {
7055 /* skip underscores, checking for misplaced ones
7059 if (ckWARN(WARN_SYNTAX) && lastub && s - lastub != 3)
7060 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7064 /* check for end of fixed-length buffer */
7066 Perl_croak(aTHX_ number_too_long);
7067 /* if we're ok, copy the character */
7072 /* final misplaced underbar check */
7073 if (lastub && s - lastub != 3) {
7074 if (ckWARN(WARN_SYNTAX))
7075 Perl_warner(aTHX_ WARN_SYNTAX, "Misplaced _ in number");
7078 /* read a decimal portion if there is one. avoid
7079 3..5 being interpreted as the number 3. followed
7082 if (*s == '.' && s[1] != '.') {
7086 /* copy, ignoring underbars, until we run out of
7087 digits. Note: no misplaced underbar checks!
7089 for (; isDIGIT(*s) || *s == '_'; s++) {
7090 /* fixed length buffer check */
7092 Perl_croak(aTHX_ number_too_long);
7096 if (*s == '.' && isDIGIT(s[1])) {
7097 /* oops, it's really a v-string, but without the "v" */
7103 /* read exponent part, if present */
7104 if (*s && strchr("eE",*s) && strchr("+-0123456789",s[1])) {
7108 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
7109 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
7111 /* allow positive or negative exponent */
7112 if (*s == '+' || *s == '-')
7115 /* read digits of exponent (no underbars :-) */
7116 while (isDIGIT(*s)) {
7118 Perl_croak(aTHX_ number_too_long);
7123 /* terminate the string */
7126 /* make an sv from the string */
7129 #if defined(Strtol) && defined(Strtoul)
7132 strtol/strtoll sets errno to ERANGE if the number is too big
7133 for an integer. We try to do an integer conversion first
7134 if no characters indicating "float" have been found.
7141 if (*PL_tokenbuf == '-')
7142 iv = Strtol(PL_tokenbuf, (char**)NULL, 10);
7144 uv = Strtoul(PL_tokenbuf, (char**)NULL, 10);
7146 floatit = TRUE; /* Probably just too large. */
7147 else if (*PL_tokenbuf == '-')
7149 else if (uv <= IV_MAX)
7150 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7155 nv = Atof(PL_tokenbuf);
7160 No working strtou?ll?.
7162 Unfortunately atol() doesn't do range checks (returning
7163 LONG_MIN/LONG_MAX, and setting errno to ERANGE on overflows)
7164 everywhere [1], so we cannot use use atol() (or atoll()).
7165 If we could, they would be used, as Atol(), very much like
7166 Strtol() and Strtoul() are used above.
7168 [1] XXX Configure test needed to check for atol()
7169 (and atoll()) overflow behaviour XXX
7173 We need to do this the hard way. */
7175 nv = Atof(PL_tokenbuf);
7177 /* See if we can make do with an integer value without loss of
7178 precision. We use U_V to cast to a UV, because some
7179 compilers have issues. Then we try casting it back and see
7180 if it was the same [1]. We only do this if we know we
7181 specifically read an integer. If floatit is true, then we
7182 don't need to do the conversion at all.
7184 [1] Note that this is lossy if our NVs cannot preserve our
7185 UVs. There are metaconfig defines NV_PRESERVES_UV (a boolean)
7186 and NV_PRESERVES_UV_BITS (a number), but in general we really
7187 do hope all such potentially lossy platforms have strtou?ll?
7188 to do a lossless IV/UV conversion.
7190 Maybe could do some tricks with DBL_DIG, LDBL_DIG and
7191 DBL_MANT_DIG and LDBL_MANT_DIG (these are already available
7192 as NV_DIG and NV_MANT_DIG)?
7198 if (!floatit && (NV)uv == nv) {
7200 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
7208 if ( floatit ? (PL_hints & HINT_NEW_FLOAT) :
7209 (PL_hints & HINT_NEW_INTEGER) )
7210 sv = new_constant(PL_tokenbuf, d - PL_tokenbuf,
7211 (floatit ? "float" : "integer"),
7215 /* if it starts with a v, it could be a v-string */
7221 while (isDIGIT(*pos) || *pos == '_')
7223 if (!isALPHA(*pos)) {
7225 U8 tmpbuf[UTF8_MAXLEN+1];
7227 s++; /* get past 'v' */
7230 sv_setpvn(sv, "", 0);
7233 if (*s == '0' && isDIGIT(s[1]))
7234 yyerror("Octal number in vector unsupported");
7237 /* this is atoi() that tolerates underscores */
7240 while (--end >= s) {
7245 rev += (*end - '0') * mult;
7247 if (orev > rev && ckWARN_d(WARN_OVERFLOW))
7248 Perl_warner(aTHX_ WARN_OVERFLOW,
7249 "Integer overflow in decimal number");
7252 tmpend = uv_to_utf8(tmpbuf, rev);
7255 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
7256 if (*pos == '.' && isDIGIT(pos[1]))
7262 while (isDIGIT(*pos) || *pos == '_')
7271 sv_utf8_downgrade(sv, TRUE);
7278 /* make the op for the constant and return */
7281 lvalp->opval = newSVOP(OP_CONST, 0, sv);
7283 lvalp->opval = Nullop;
7289 S_scan_formline(pTHX_ register char *s)
7293 SV *stuff = newSVpvn("",0);
7294 bool needargs = FALSE;
7297 if (*s == '.' || *s == /*{*/'}') {
7299 #ifdef PERL_STRICT_CR
7300 for (t = s+1;SPACE_OR_TAB(*t); t++) ;
7302 for (t = s+1;SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
7304 if (*t == '\n' || t == PL_bufend)
7307 if (PL_in_eval && !PL_rsfp) {
7308 eol = strchr(s,'\n');
7313 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7315 for (t = s; t < eol; t++) {
7316 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
7318 goto enough; /* ~~ must be first line in formline */
7320 if (*t == '@' || *t == '^')
7323 sv_catpvn(stuff, s, eol-s);
7324 #ifndef PERL_STRICT_CR
7325 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
7326 char *end = SvPVX(stuff) + SvCUR(stuff);
7335 s = filter_gets(PL_linestr, PL_rsfp, 0);
7336 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
7337 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
7340 yyerror("Format not terminated");
7350 PL_lex_state = LEX_NORMAL;
7351 PL_nextval[PL_nexttoke].ival = 0;
7355 PL_lex_state = LEX_FORMLINE;
7356 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0, stuff);
7358 PL_nextval[PL_nexttoke].ival = OP_FORMLINE;
7362 SvREFCNT_dec(stuff);
7363 PL_lex_formbrack = 0;
7374 PL_cshlen = strlen(PL_cshname);
7379 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
7381 I32 oldsavestack_ix = PL_savestack_ix;
7382 CV* outsidecv = PL_compcv;
7386 assert(SvTYPE(PL_compcv) == SVt_PVCV);
7388 SAVEI32(PL_subline);
7389 save_item(PL_subname);
7392 SAVESPTR(PL_comppad_name);
7393 SAVESPTR(PL_compcv);
7394 SAVEI32(PL_comppad_name_fill);
7395 SAVEI32(PL_min_intro_pending);
7396 SAVEI32(PL_max_intro_pending);
7397 SAVEI32(PL_pad_reset_pending);
7399 PL_compcv = (CV*)NEWSV(1104,0);
7400 sv_upgrade((SV *)PL_compcv, is_format ? SVt_PVFM : SVt_PVCV);
7401 CvFLAGS(PL_compcv) |= flags;
7403 PL_comppad = newAV();
7404 av_push(PL_comppad, Nullsv);
7405 PL_curpad = AvARRAY(PL_comppad);
7406 PL_comppad_name = newAV();
7407 PL_comppad_name_fill = 0;
7408 PL_min_intro_pending = 0;
7410 PL_subline = CopLINE(PL_curcop);
7412 av_store(PL_comppad_name, 0, newSVpvn("@_", 2));
7413 PL_curpad[0] = (SV*)newAV();
7414 SvPADMY_on(PL_curpad[0]); /* XXX Needed? */
7415 #endif /* USE_THREADS */
7417 comppadlist = newAV();
7418 AvREAL_off(comppadlist);
7419 av_store(comppadlist, 0, (SV*)PL_comppad_name);
7420 av_store(comppadlist, 1, (SV*)PL_comppad);
7422 CvPADLIST(PL_compcv) = comppadlist;
7423 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outsidecv);
7425 CvOWNER(PL_compcv) = 0;
7426 New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
7427 MUTEX_INIT(CvMUTEXP(PL_compcv));
7428 #endif /* USE_THREADS */
7430 return oldsavestack_ix;
7434 #pragma segment Perl_yylex
7437 Perl_yywarn(pTHX_ char *s)
7439 PL_in_eval |= EVAL_WARNONLY;
7441 PL_in_eval &= ~EVAL_WARNONLY;
7446 Perl_yyerror(pTHX_ char *s)
7449 char *context = NULL;
7453 if (!yychar || (yychar == ';' && !PL_rsfp))
7455 else if (PL_bufptr > PL_oldoldbufptr && PL_bufptr - PL_oldoldbufptr < 200 &&
7456 PL_oldoldbufptr != PL_oldbufptr && PL_oldbufptr != PL_bufptr) {
7457 while (isSPACE(*PL_oldoldbufptr))
7459 context = PL_oldoldbufptr;
7460 contlen = PL_bufptr - PL_oldoldbufptr;
7462 else if (PL_bufptr > PL_oldbufptr && PL_bufptr - PL_oldbufptr < 200 &&
7463 PL_oldbufptr != PL_bufptr) {
7464 while (isSPACE(*PL_oldbufptr))
7466 context = PL_oldbufptr;
7467 contlen = PL_bufptr - PL_oldbufptr;
7469 else if (yychar > 255)
7470 where = "next token ???";
7471 #ifdef USE_PURE_BISON
7472 /* GNU Bison sets the value -2 */
7473 else if (yychar == -2) {
7475 else if ((yychar & 127) == 127) {
7477 if (PL_lex_state == LEX_NORMAL ||
7478 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
7479 where = "at end of line";
7480 else if (PL_lex_inpat)
7481 where = "within pattern";
7483 where = "within string";
7486 SV *where_sv = sv_2mortal(newSVpvn("next char ", 10));
7488 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
7489 else if (isPRINT_LC(yychar))
7490 Perl_sv_catpvf(aTHX_ where_sv, "%c", yychar);
7492 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
7493 where = SvPVX(where_sv);
7495 msg = sv_2mortal(newSVpv(s, 0));
7496 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
7497 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7499 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
7501 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
7502 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
7503 Perl_sv_catpvf(aTHX_ msg,
7504 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
7505 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
7508 if (PL_in_eval & EVAL_WARNONLY)
7509 Perl_warn(aTHX_ "%"SVf, msg);
7512 if (PL_error_count >= 10) {
7513 if (PL_in_eval && SvCUR(ERRSV))
7514 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
7515 ERRSV, CopFILE(PL_curcop));
7517 Perl_croak(aTHX_ "%s has too many errors.\n",
7518 CopFILE(PL_curcop));
7521 PL_in_my_stash = Nullhv;
7525 #pragma segment Main
7529 S_swallow_bom(pTHX_ U8 *s)
7532 slen = SvCUR(PL_linestr);
7536 /* UTF-16 little-endian */
7537 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
7538 Perl_croak(aTHX_ "Unsupported script encoding");
7539 #ifndef PERL_NO_UTF16_FILTER
7540 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-LE script encoding\n"));
7542 if (PL_bufend > (char*)s) {
7546 filter_add(utf16rev_textfilter, NULL);
7547 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7548 PL_bufend = (char*)utf16_to_utf8_reversed(s, news,
7549 PL_bufend - (char*)s - 1,
7551 Copy(news, s, newlen, U8);
7552 SvCUR_set(PL_linestr, newlen);
7553 PL_bufend = SvPVX(PL_linestr) + newlen;
7554 news[newlen++] = '\0';
7558 Perl_croak(aTHX_ "Unsupported script encoding");
7563 if (s[1] == 0xFF) { /* UTF-16 big-endian */
7564 #ifndef PERL_NO_UTF16_FILTER
7565 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding\n"));
7567 if (PL_bufend > (char *)s) {
7571 filter_add(utf16_textfilter, NULL);
7572 New(898, news, (PL_bufend - (char*)s) * 3 / 2 + 1, U8);
7573 PL_bufend = (char*)utf16_to_utf8(s, news,
7574 PL_bufend - (char*)s,
7576 Copy(news, s, newlen, U8);
7577 SvCUR_set(PL_linestr, newlen);
7578 PL_bufend = SvPVX(PL_linestr) + newlen;
7579 news[newlen++] = '\0';
7583 Perl_croak(aTHX_ "Unsupported script encoding");
7588 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
7589 DEBUG_p(PerlIO_printf(Perl_debug_log, "UTF-8 script encoding\n"));
7594 if (slen > 3 && s[1] == 0 && /* UTF-32 big-endian */
7595 s[2] == 0xFE && s[3] == 0xFF)
7597 Perl_croak(aTHX_ "Unsupported script encoding");
7609 * Restore a source filter.
7613 restore_rsfp(pTHXo_ void *f)
7615 PerlIO *fp = (PerlIO*)f;
7617 if (PL_rsfp == PerlIO_stdin())
7618 PerlIO_clearerr(PL_rsfp);
7619 else if (PL_rsfp && (PL_rsfp != fp))
7620 PerlIO_close(PL_rsfp);
7624 #ifndef PERL_NO_UTF16_FILTER
7626 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7628 I32 count = FILTER_READ(idx+1, sv, maxlen);
7633 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7634 if (!*SvPV_nolen(sv))
7635 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7638 tend = utf16_to_utf8((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7639 sv_usepvn(sv, (char*)tmps, tend - tmps);
7645 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen)
7647 I32 count = FILTER_READ(idx+1, sv, maxlen);
7652 if (!*SvPV_nolen(sv))
7653 /* Game over, but don't feed an odd-length string to utf16_to_utf8 */
7656 New(898, tmps, SvCUR(sv) * 3 / 2 + 1, U8);
7657 tend = utf16_to_utf8_reversed((U8*)SvPVX(sv), tmps, SvCUR(sv), &newlen);
7658 sv_usepvn(sv, (char*)tmps, tend - tmps);