3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'It all comes from here, the stench and the peril.' --Frodo
14 * [p.719 of _The Lord of the Rings_, IV/ix: "Shelob's Lair"]
18 * This file is the lexer for Perl. It's closely linked to the
21 * The main routine is yylex(), which returns the next token.
25 =head1 Lexer interface
27 This is the lower layer of the Perl parser, managing characters and tokens.
29 =for apidoc AmU|yy_parser *|PL_parser
31 Pointer to a structure encapsulating the state of the parsing operation
32 currently in progress. The pointer can be locally changed to perform
33 a nested parse without interfering with the state of an outer parse.
34 Individual members of C<PL_parser> have their own documentation.
40 #define PERL_IN_TOKE_C
43 #define new_constant(a,b,c,d,e,f,g) \
44 S_new_constant(aTHX_ a,b,STR_WITH_LEN(c),d,e,f, g)
46 #define pl_yylval (PL_parser->yylval)
48 /* YYINITDEPTH -- initial size of the parser's stacks. */
49 #define YYINITDEPTH 200
51 /* XXX temporary backwards compatibility */
52 #define PL_lex_brackets (PL_parser->lex_brackets)
53 #define PL_lex_brackstack (PL_parser->lex_brackstack)
54 #define PL_lex_casemods (PL_parser->lex_casemods)
55 #define PL_lex_casestack (PL_parser->lex_casestack)
56 #define PL_lex_defer (PL_parser->lex_defer)
57 #define PL_lex_dojoin (PL_parser->lex_dojoin)
58 #define PL_lex_expect (PL_parser->lex_expect)
59 #define PL_lex_formbrack (PL_parser->lex_formbrack)
60 #define PL_lex_inpat (PL_parser->lex_inpat)
61 #define PL_lex_inwhat (PL_parser->lex_inwhat)
62 #define PL_lex_op (PL_parser->lex_op)
63 #define PL_lex_repl (PL_parser->lex_repl)
64 #define PL_lex_starts (PL_parser->lex_starts)
65 #define PL_lex_stuff (PL_parser->lex_stuff)
66 #define PL_multi_start (PL_parser->multi_start)
67 #define PL_multi_open (PL_parser->multi_open)
68 #define PL_multi_close (PL_parser->multi_close)
69 #define PL_pending_ident (PL_parser->pending_ident)
70 #define PL_preambled (PL_parser->preambled)
71 #define PL_sublex_info (PL_parser->sublex_info)
72 #define PL_linestr (PL_parser->linestr)
73 #define PL_expect (PL_parser->expect)
74 #define PL_copline (PL_parser->copline)
75 #define PL_bufptr (PL_parser->bufptr)
76 #define PL_oldbufptr (PL_parser->oldbufptr)
77 #define PL_oldoldbufptr (PL_parser->oldoldbufptr)
78 #define PL_linestart (PL_parser->linestart)
79 #define PL_bufend (PL_parser->bufend)
80 #define PL_last_uni (PL_parser->last_uni)
81 #define PL_last_lop (PL_parser->last_lop)
82 #define PL_last_lop_op (PL_parser->last_lop_op)
83 #define PL_lex_state (PL_parser->lex_state)
84 #define PL_rsfp (PL_parser->rsfp)
85 #define PL_rsfp_filters (PL_parser->rsfp_filters)
86 #define PL_in_my (PL_parser->in_my)
87 #define PL_in_my_stash (PL_parser->in_my_stash)
88 #define PL_tokenbuf (PL_parser->tokenbuf)
89 #define PL_multi_end (PL_parser->multi_end)
90 #define PL_error_count (PL_parser->error_count)
93 # define PL_endwhite (PL_parser->endwhite)
94 # define PL_faketokens (PL_parser->faketokens)
95 # define PL_lasttoke (PL_parser->lasttoke)
96 # define PL_nextwhite (PL_parser->nextwhite)
97 # define PL_realtokenstart (PL_parser->realtokenstart)
98 # define PL_skipwhite (PL_parser->skipwhite)
99 # define PL_thisclose (PL_parser->thisclose)
100 # define PL_thismad (PL_parser->thismad)
101 # define PL_thisopen (PL_parser->thisopen)
102 # define PL_thisstuff (PL_parser->thisstuff)
103 # define PL_thistoken (PL_parser->thistoken)
104 # define PL_thiswhite (PL_parser->thiswhite)
105 # define PL_thiswhite (PL_parser->thiswhite)
106 # define PL_nexttoke (PL_parser->nexttoke)
107 # define PL_curforce (PL_parser->curforce)
109 # define PL_nexttoke (PL_parser->nexttoke)
110 # define PL_nexttype (PL_parser->nexttype)
111 # define PL_nextval (PL_parser->nextval)
114 /* This can't be done with embed.fnc, because struct yy_parser contains a
115 member named pending_ident, which clashes with the generated #define */
117 S_pending_ident(pTHX);
119 static const char ident_too_long[] = "Identifier too long";
122 # define CURMAD(slot,sv) if (PL_madskills) { curmad(slot,sv); sv = 0; }
123 # define NEXTVAL_NEXTTOKE PL_nexttoke[PL_curforce].next_val
125 # define CURMAD(slot,sv)
126 # define NEXTVAL_NEXTTOKE PL_nextval[PL_nexttoke]
129 #define XFAKEBRACK 128
130 #define XENUMMASK 127
132 #ifdef USE_UTF8_SCRIPTS
133 # define UTF (!IN_BYTES)
135 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
138 /* The maximum number of characters preceding the unrecognized one to display */
139 #define UNRECOGNIZED_PRECEDE_COUNT 10
141 /* In variables named $^X, these are the legal values for X.
142 * 1999-02-27 mjd-perl-patch@plover.com */
143 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
145 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
147 /* LEX_* are values for PL_lex_state, the state of the lexer.
148 * They are arranged oddly so that the guard on the switch statement
149 * can get by with a single comparison (if the compiler is smart enough).
152 /* #define LEX_NOTPARSING 11 is done in perl.h. */
154 #define LEX_NORMAL 10 /* normal code (ie not within "...") */
155 #define LEX_INTERPNORMAL 9 /* code within a string, eg "$foo[$x+1]" */
156 #define LEX_INTERPCASEMOD 8 /* expecting a \U, \Q or \E etc */
157 #define LEX_INTERPPUSH 7 /* starting a new sublex parse level */
158 #define LEX_INTERPSTART 6 /* expecting the start of a $var */
160 /* at end of code, eg "$x" followed by: */
161 #define LEX_INTERPEND 5 /* ... eg not one of [, { or -> */
162 #define LEX_INTERPENDMAYBE 4 /* ... eg one of [, { or -> */
164 #define LEX_INTERPCONCAT 3 /* expecting anything, eg at start of
165 string or after \E, $foo, etc */
166 #define LEX_INTERPCONST 2 /* NOT USED */
167 #define LEX_FORMLINE 1 /* expecting a format line */
168 #define LEX_KNOWNEXT 0 /* next token known; just return it */
172 static const char* const lex_state_names[] = {
191 #include "keywords.h"
193 /* CLINE is a macro that ensures PL_copline has a sane value */
198 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
201 # define SKIPSPACE0(s) skipspace0(s)
202 # define SKIPSPACE1(s) skipspace1(s)
203 # define SKIPSPACE2(s,tsv) skipspace2(s,&tsv)
204 # define PEEKSPACE(s) skipspace2(s,0)
206 # define SKIPSPACE0(s) skipspace(s)
207 # define SKIPSPACE1(s) skipspace(s)
208 # define SKIPSPACE2(s,tsv) skipspace(s)
209 # define PEEKSPACE(s) skipspace(s)
213 * Convenience functions to return different tokens and prime the
214 * lexer for the next token. They all take an argument.
216 * TOKEN : generic token (used for '(', DOLSHARP, etc)
217 * OPERATOR : generic operator
218 * AOPERATOR : assignment operator
219 * PREBLOCK : beginning the block after an if, while, foreach, ...
220 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
221 * PREREF : *EXPR where EXPR is not a simple identifier
222 * TERM : expression term
223 * LOOPX : loop exiting command (goto, last, dump, etc)
224 * FTST : file test operator
225 * FUN0 : zero-argument function
226 * FUN1 : not used, except for not, which isn't a UNIOP
227 * BOop : bitwise or or xor
229 * SHop : shift operator
230 * PWop : power operator
231 * PMop : pattern-matching operator
232 * Aop : addition-level operator
233 * Mop : multiplication-level operator
234 * Eop : equality-testing operator
235 * Rop : relational operator <= != gt
237 * Also see LOP and lop() below.
240 #ifdef DEBUGGING /* Serve -DT. */
241 # define REPORT(retval) tokereport((I32)retval, &pl_yylval)
243 # define REPORT(retval) (retval)
246 #define TOKEN(retval) return ( PL_bufptr = s, REPORT(retval))
247 #define OPERATOR(retval) return (PL_expect = XTERM, PL_bufptr = s, REPORT(retval))
248 #define AOPERATOR(retval) return ao((PL_expect = XTERM, PL_bufptr = s, REPORT(retval)))
249 #define PREBLOCK(retval) return (PL_expect = XBLOCK,PL_bufptr = s, REPORT(retval))
250 #define PRETERMBLOCK(retval) return (PL_expect = XTERMBLOCK,PL_bufptr = s, REPORT(retval))
251 #define PREREF(retval) return (PL_expect = XREF,PL_bufptr = s, REPORT(retval))
252 #define TERM(retval) return (CLINE, PL_expect = XOPERATOR, PL_bufptr = s, REPORT(retval))
253 #define LOOPX(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)LOOPEX))
254 #define FTST(f) return (pl_yylval.ival=f, PL_expect=XTERMORDORDOR, PL_bufptr=s, REPORT((int)UNIOP))
255 #define FUN0(f) return (pl_yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC0))
256 #define FUN1(f) return (pl_yylval.ival=f, PL_expect=XOPERATOR, PL_bufptr=s, REPORT((int)FUNC1))
257 #define BOop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITOROP)))
258 #define BAop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)BITANDOP)))
259 #define SHop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)SHIFTOP)))
260 #define PWop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)POWOP)))
261 #define PMop(f) return(pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MATCHOP))
262 #define Aop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)ADDOP)))
263 #define Mop(f) return ao((pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)MULOP)))
264 #define Eop(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)EQOP))
265 #define Rop(f) return (pl_yylval.ival=f, PL_expect=XTERM, PL_bufptr=s, REPORT((int)RELOP))
267 /* This bit of chicanery makes a unary function followed by
268 * a parenthesis into a function with one argument, highest precedence.
269 * The UNIDOR macro is for unary functions that can be followed by the //
270 * operator (such as C<shift // 0>).
272 #define UNI2(f,x) { \
273 pl_yylval.ival = f; \
276 PL_last_uni = PL_oldbufptr; \
277 PL_last_lop_op = f; \
279 return REPORT( (int)FUNC1 ); \
281 return REPORT( *s=='(' ? (int)FUNC1 : (int)UNIOP ); \
283 #define UNI(f) UNI2(f,XTERM)
284 #define UNIDOR(f) UNI2(f,XTERMORDORDOR)
286 #define UNIBRACK(f) { \
287 pl_yylval.ival = f; \
289 PL_last_uni = PL_oldbufptr; \
291 return REPORT( (int)FUNC1 ); \
293 return REPORT( (*s == '(') ? (int)FUNC1 : (int)UNIOP ); \
296 /* grandfather return to old style */
297 #define OLDLOP(f) return(pl_yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
301 /* how to interpret the pl_yylval associated with the token */
305 TOKENTYPE_OPNUM, /* pl_yylval.ival contains an opcode number */
311 static struct debug_tokens {
313 enum token_type type;
315 } const debug_tokens[] =
317 { ADDOP, TOKENTYPE_OPNUM, "ADDOP" },
318 { ANDAND, TOKENTYPE_NONE, "ANDAND" },
319 { ANDOP, TOKENTYPE_NONE, "ANDOP" },
320 { ANONSUB, TOKENTYPE_IVAL, "ANONSUB" },
321 { ARROW, TOKENTYPE_NONE, "ARROW" },
322 { ASSIGNOP, TOKENTYPE_OPNUM, "ASSIGNOP" },
323 { BITANDOP, TOKENTYPE_OPNUM, "BITANDOP" },
324 { BITOROP, TOKENTYPE_OPNUM, "BITOROP" },
325 { COLONATTR, TOKENTYPE_NONE, "COLONATTR" },
326 { CONTINUE, TOKENTYPE_NONE, "CONTINUE" },
327 { DEFAULT, TOKENTYPE_NONE, "DEFAULT" },
328 { DO, TOKENTYPE_NONE, "DO" },
329 { DOLSHARP, TOKENTYPE_NONE, "DOLSHARP" },
330 { DORDOR, TOKENTYPE_NONE, "DORDOR" },
331 { DOROP, TOKENTYPE_OPNUM, "DOROP" },
332 { DOTDOT, TOKENTYPE_IVAL, "DOTDOT" },
333 { ELSE, TOKENTYPE_NONE, "ELSE" },
334 { ELSIF, TOKENTYPE_IVAL, "ELSIF" },
335 { EQOP, TOKENTYPE_OPNUM, "EQOP" },
336 { FOR, TOKENTYPE_IVAL, "FOR" },
337 { FORMAT, TOKENTYPE_NONE, "FORMAT" },
338 { FUNC, TOKENTYPE_OPNUM, "FUNC" },
339 { FUNC0, TOKENTYPE_OPNUM, "FUNC0" },
340 { FUNC0SUB, TOKENTYPE_OPVAL, "FUNC0SUB" },
341 { FUNC1, TOKENTYPE_OPNUM, "FUNC1" },
342 { FUNCMETH, TOKENTYPE_OPVAL, "FUNCMETH" },
343 { GIVEN, TOKENTYPE_IVAL, "GIVEN" },
344 { HASHBRACK, TOKENTYPE_NONE, "HASHBRACK" },
345 { IF, TOKENTYPE_IVAL, "IF" },
346 { LABEL, TOKENTYPE_PVAL, "LABEL" },
347 { LOCAL, TOKENTYPE_IVAL, "LOCAL" },
348 { LOOPEX, TOKENTYPE_OPNUM, "LOOPEX" },
349 { LSTOP, TOKENTYPE_OPNUM, "LSTOP" },
350 { LSTOPSUB, TOKENTYPE_OPVAL, "LSTOPSUB" },
351 { MATCHOP, TOKENTYPE_OPNUM, "MATCHOP" },
352 { METHOD, TOKENTYPE_OPVAL, "METHOD" },
353 { MULOP, TOKENTYPE_OPNUM, "MULOP" },
354 { MY, TOKENTYPE_IVAL, "MY" },
355 { MYSUB, TOKENTYPE_NONE, "MYSUB" },
356 { NOAMP, TOKENTYPE_NONE, "NOAMP" },
357 { NOTOP, TOKENTYPE_NONE, "NOTOP" },
358 { OROP, TOKENTYPE_IVAL, "OROP" },
359 { OROR, TOKENTYPE_NONE, "OROR" },
360 { PACKAGE, TOKENTYPE_NONE, "PACKAGE" },
361 { PLUGEXPR, TOKENTYPE_OPVAL, "PLUGEXPR" },
362 { PLUGSTMT, TOKENTYPE_OPVAL, "PLUGSTMT" },
363 { PMFUNC, TOKENTYPE_OPVAL, "PMFUNC" },
364 { POSTDEC, TOKENTYPE_NONE, "POSTDEC" },
365 { POSTINC, TOKENTYPE_NONE, "POSTINC" },
366 { POWOP, TOKENTYPE_OPNUM, "POWOP" },
367 { PREDEC, TOKENTYPE_NONE, "PREDEC" },
368 { PREINC, TOKENTYPE_NONE, "PREINC" },
369 { PRIVATEREF, TOKENTYPE_OPVAL, "PRIVATEREF" },
370 { REFGEN, TOKENTYPE_NONE, "REFGEN" },
371 { RELOP, TOKENTYPE_OPNUM, "RELOP" },
372 { SHIFTOP, TOKENTYPE_OPNUM, "SHIFTOP" },
373 { SUB, TOKENTYPE_NONE, "SUB" },
374 { THING, TOKENTYPE_OPVAL, "THING" },
375 { UMINUS, TOKENTYPE_NONE, "UMINUS" },
376 { UNIOP, TOKENTYPE_OPNUM, "UNIOP" },
377 { UNIOPSUB, TOKENTYPE_OPVAL, "UNIOPSUB" },
378 { UNLESS, TOKENTYPE_IVAL, "UNLESS" },
379 { UNTIL, TOKENTYPE_IVAL, "UNTIL" },
380 { USE, TOKENTYPE_IVAL, "USE" },
381 { WHEN, TOKENTYPE_IVAL, "WHEN" },
382 { WHILE, TOKENTYPE_IVAL, "WHILE" },
383 { WORD, TOKENTYPE_OPVAL, "WORD" },
384 { YADAYADA, TOKENTYPE_IVAL, "YADAYADA" },
385 { 0, TOKENTYPE_NONE, NULL }
388 /* dump the returned token in rv, plus any optional arg in pl_yylval */
391 S_tokereport(pTHX_ I32 rv, const YYSTYPE* lvalp)
395 PERL_ARGS_ASSERT_TOKEREPORT;
398 const char *name = NULL;
399 enum token_type type = TOKENTYPE_NONE;
400 const struct debug_tokens *p;
401 SV* const report = newSVpvs("<== ");
403 for (p = debug_tokens; p->token; p++) {
404 if (p->token == (int)rv) {
411 Perl_sv_catpv(aTHX_ report, name);
412 else if ((char)rv > ' ' && (char)rv < '~')
413 Perl_sv_catpvf(aTHX_ report, "'%c'", (char)rv);
415 sv_catpvs(report, "EOF");
417 Perl_sv_catpvf(aTHX_ report, "?? %"IVdf, (IV)rv);
420 case TOKENTYPE_GVVAL: /* doesn't appear to be used */
423 Perl_sv_catpvf(aTHX_ report, "(ival=%"IVdf")", (IV)lvalp->ival);
425 case TOKENTYPE_OPNUM:
426 Perl_sv_catpvf(aTHX_ report, "(ival=op_%s)",
427 PL_op_name[lvalp->ival]);
430 Perl_sv_catpvf(aTHX_ report, "(pval=\"%s\")", lvalp->pval);
432 case TOKENTYPE_OPVAL:
434 Perl_sv_catpvf(aTHX_ report, "(opval=op_%s)",
435 PL_op_name[lvalp->opval->op_type]);
436 if (lvalp->opval->op_type == OP_CONST) {
437 Perl_sv_catpvf(aTHX_ report, " %s",
438 SvPEEK(cSVOPx_sv(lvalp->opval)));
443 sv_catpvs(report, "(opval=null)");
446 PerlIO_printf(Perl_debug_log, "### %s\n\n", SvPV_nolen_const(report));
452 /* print the buffer with suitable escapes */
455 S_printbuf(pTHX_ const char *const fmt, const char *const s)
457 SV* const tmp = newSVpvs("");
459 PERL_ARGS_ASSERT_PRINTBUF;
461 PerlIO_printf(Perl_debug_log, fmt, pv_display(tmp, s, strlen(s), 0, 60));
468 S_deprecate_commaless_var_list(pTHX) {
470 deprecate("comma-less variable list");
471 return REPORT(','); /* grandfather non-comma-format format */
477 * This subroutine detects &&=, ||=, and //= and turns an ANDAND, OROR or DORDOR
478 * into an OP_ANDASSIGN, OP_ORASSIGN, or OP_DORASSIGN
482 S_ao(pTHX_ int toketype)
485 if (*PL_bufptr == '=') {
487 if (toketype == ANDAND)
488 pl_yylval.ival = OP_ANDASSIGN;
489 else if (toketype == OROR)
490 pl_yylval.ival = OP_ORASSIGN;
491 else if (toketype == DORDOR)
492 pl_yylval.ival = OP_DORASSIGN;
500 * When Perl expects an operator and finds something else, no_op
501 * prints the warning. It always prints "<something> found where
502 * operator expected. It prints "Missing semicolon on previous line?"
503 * if the surprise occurs at the start of the line. "do you need to
504 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
505 * where the compiler doesn't know if foo is a method call or a function.
506 * It prints "Missing operator before end of line" if there's nothing
507 * after the missing operator, or "... before <...>" if there is something
508 * after the missing operator.
512 S_no_op(pTHX_ const char *const what, char *s)
515 char * const oldbp = PL_bufptr;
516 const bool is_first = (PL_oldbufptr == PL_linestart);
518 PERL_ARGS_ASSERT_NO_OP;
524 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
525 if (ckWARN_d(WARN_SYNTAX)) {
527 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
528 "\t(Missing semicolon on previous line?)\n");
529 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
531 for (t = PL_oldoldbufptr; (isALNUM_lazy_if(t,UTF) || *t == ':'); t++)
533 if (t < PL_bufptr && isSPACE(*t))
534 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
535 "\t(Do you need to predeclare %.*s?)\n",
536 (int)(t - PL_oldoldbufptr), PL_oldoldbufptr);
540 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
541 "\t(Missing operator before %.*s?)\n", (int)(s - oldbp), oldbp);
549 * Complain about missing quote/regexp/heredoc terminator.
550 * If it's called with NULL then it cauterizes the line buffer.
551 * If we're in a delimited string and the delimiter is a control
552 * character, it's reformatted into a two-char sequence like ^C.
557 S_missingterm(pTHX_ char *s)
563 char * const nl = strrchr(s,'\n');
567 else if (isCNTRL(PL_multi_close)) {
569 tmpbuf[1] = (char)toCTRL(PL_multi_close);
574 *tmpbuf = (char)PL_multi_close;
578 q = strchr(s,'"') ? '\'' : '"';
579 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
582 #define FEATURE_IS_ENABLED(name) \
583 ((0 != (PL_hints & HINT_LOCALIZE_HH)) \
584 && S_feature_is_enabled(aTHX_ STR_WITH_LEN(name)))
585 /* The longest string we pass in. */
586 #define MAX_FEATURE_LEN (sizeof("unicode_strings")-1)
589 * S_feature_is_enabled
590 * Check whether the named feature is enabled.
593 S_feature_is_enabled(pTHX_ const char *const name, STRLEN namelen)
596 HV * const hinthv = GvHV(PL_hintgv);
597 char he_name[8 + MAX_FEATURE_LEN] = "feature_";
599 PERL_ARGS_ASSERT_FEATURE_IS_ENABLED;
601 assert(namelen <= MAX_FEATURE_LEN);
602 memcpy(&he_name[8], name, namelen);
604 return (hinthv && hv_exists(hinthv, he_name, 8 + namelen));
608 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
609 * utf16-to-utf8-reversed.
612 #ifdef PERL_CR_FILTER
616 register const char *s = SvPVX_const(sv);
617 register const char * const e = s + SvCUR(sv);
619 PERL_ARGS_ASSERT_STRIP_RETURN;
621 /* outer loop optimized to do nothing if there are no CR-LFs */
623 if (*s++ == '\r' && *s == '\n') {
624 /* hit a CR-LF, need to copy the rest */
625 register char *d = s - 1;
628 if (*s == '\r' && s[1] == '\n')
639 S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
641 const I32 count = FILTER_READ(idx+1, sv, maxlen);
642 if (count > 0 && !maxlen)
653 * Create a parser object and initialise its parser and lexer fields
655 * rsfp is the opened file handle to read from (if any),
657 * line holds any initial content already read from the file (or in
658 * the case of no file, such as an eval, the whole contents);
660 * new_filter indicates that this is a new file and it shouldn't inherit
661 * the filters from the current parser (ie require).
665 Perl_lex_start(pTHX_ SV *line, PerlIO *rsfp, bool new_filter)
668 const char *s = NULL;
670 yy_parser *parser, *oparser;
672 /* create and initialise a parser */
674 Newxz(parser, 1, yy_parser);
675 parser->old_parser = oparser = PL_parser;
678 Newx(parser->stack, YYINITDEPTH, yy_stack_frame);
679 parser->ps = parser->stack;
680 parser->stack_size = YYINITDEPTH;
682 parser->stack->state = 0;
683 parser->yyerrstatus = 0;
684 parser->yychar = YYEMPTY; /* Cause a token to be read. */
686 /* on scope exit, free this parser and restore any outer one */
688 parser->saved_curcop = PL_curcop;
690 /* initialise lexer state */
693 parser->curforce = -1;
695 parser->nexttoke = 0;
697 parser->error_count = oparser ? oparser->error_count : 0;
698 parser->copline = NOLINE;
699 parser->lex_state = LEX_NORMAL;
700 parser->expect = XSTATE;
702 parser->rsfp_filters = (new_filter || !oparser) ? newAV()
703 : MUTABLE_AV(SvREFCNT_inc(oparser->rsfp_filters));
705 Newx(parser->lex_brackstack, 120, char);
706 Newx(parser->lex_casestack, 12, char);
707 *parser->lex_casestack = '\0';
710 s = SvPV_const(line, len);
716 parser->linestr = newSVpvs("\n;");
717 } else if (SvREADONLY(line) || s[len-1] != ';') {
718 parser->linestr = newSVsv(line);
720 sv_catpvs(parser->linestr, "\n;");
723 SvREFCNT_inc_simple_void_NN(line);
724 parser->linestr = line;
726 parser->oldoldbufptr =
729 parser->linestart = SvPVX(parser->linestr);
730 parser->bufend = parser->bufptr + SvCUR(parser->linestr);
731 parser->last_lop = parser->last_uni = NULL;
735 /* delete a parser object */
738 Perl_parser_free(pTHX_ const yy_parser *parser)
740 PERL_ARGS_ASSERT_PARSER_FREE;
742 PL_curcop = parser->saved_curcop;
743 SvREFCNT_dec(parser->linestr);
745 if (parser->rsfp == PerlIO_stdin())
746 PerlIO_clearerr(parser->rsfp);
747 else if (parser->rsfp && (!parser->old_parser ||
748 (parser->old_parser && parser->rsfp != parser->old_parser->rsfp)))
749 PerlIO_close(parser->rsfp);
750 SvREFCNT_dec(parser->rsfp_filters);
752 Safefree(parser->stack);
753 Safefree(parser->lex_brackstack);
754 Safefree(parser->lex_casestack);
755 PL_parser = parser->old_parser;
762 * Finalizer for lexing operations. Must be called when the parser is
763 * done with the lexer.
770 PL_doextract = FALSE;
774 =for apidoc AmxU|SV *|PL_parser-E<gt>linestr
776 Buffer scalar containing the chunk currently under consideration of the
777 text currently being lexed. This is always a plain string scalar (for
778 which C<SvPOK> is true). It is not intended to be used as a scalar by
779 normal scalar means; instead refer to the buffer directly by the pointer
780 variables described below.
782 The lexer maintains various C<char*> pointers to things in the
783 C<PL_parser-E<gt>linestr> buffer. If C<PL_parser-E<gt>linestr> is ever
784 reallocated, all of these pointers must be updated. Don't attempt to
785 do this manually, but rather use L</lex_grow_linestr> if you need to
786 reallocate the buffer.
788 The content of the text chunk in the buffer is commonly exactly one
789 complete line of input, up to and including a newline terminator,
790 but there are situations where it is otherwise. The octets of the
791 buffer may be intended to be interpreted as either UTF-8 or Latin-1.
792 The function L</lex_bufutf8> tells you which. Do not use the C<SvUTF8>
793 flag on this scalar, which may disagree with it.
795 For direct examination of the buffer, the variable
796 L</PL_parser-E<gt>bufend> points to the end of the buffer. The current
797 lexing position is pointed to by L</PL_parser-E<gt>bufptr>. Direct use
798 of these pointers is usually preferable to examination of the scalar
799 through normal scalar means.
801 =for apidoc AmxU|char *|PL_parser-E<gt>bufend
803 Direct pointer to the end of the chunk of text currently being lexed, the
804 end of the lexer buffer. This is equal to C<SvPVX(PL_parser-E<gt>linestr)
805 + SvCUR(PL_parser-E<gt>linestr)>. A NUL character (zero octet) is
806 always located at the end of the buffer, and does not count as part of
807 the buffer's contents.
809 =for apidoc AmxU|char *|PL_parser-E<gt>bufptr
811 Points to the current position of lexing inside the lexer buffer.
812 Characters around this point may be freely examined, within
813 the range delimited by C<SvPVX(L</PL_parser-E<gt>linestr>)> and
814 L</PL_parser-E<gt>bufend>. The octets of the buffer may be intended to be
815 interpreted as either UTF-8 or Latin-1, as indicated by L</lex_bufutf8>.
817 Lexing code (whether in the Perl core or not) moves this pointer past
818 the characters that it consumes. It is also expected to perform some
819 bookkeeping whenever a newline character is consumed. This movement
820 can be more conveniently performed by the function L</lex_read_to>,
821 which handles newlines appropriately.
823 Interpretation of the buffer's octets can be abstracted out by
824 using the slightly higher-level functions L</lex_peek_unichar> and
825 L</lex_read_unichar>.
827 =for apidoc AmxU|char *|PL_parser-E<gt>linestart
829 Points to the start of the current line inside the lexer buffer.
830 This is useful for indicating at which column an error occurred, and
831 not much else. This must be updated by any lexing code that consumes
832 a newline; the function L</lex_read_to> handles this detail.
838 =for apidoc Amx|bool|lex_bufutf8
840 Indicates whether the octets in the lexer buffer
841 (L</PL_parser-E<gt>linestr>) should be interpreted as the UTF-8 encoding
842 of Unicode characters. If not, they should be interpreted as Latin-1
843 characters. This is analogous to the C<SvUTF8> flag for scalars.
845 In UTF-8 mode, it is not guaranteed that the lexer buffer actually
846 contains valid UTF-8. Lexing code must be robust in the face of invalid
849 The actual C<SvUTF8> flag of the L</PL_parser-E<gt>linestr> scalar
850 is significant, but not the whole story regarding the input character
851 encoding. Normally, when a file is being read, the scalar contains octets
852 and its C<SvUTF8> flag is off, but the octets should be interpreted as
853 UTF-8 if the C<use utf8> pragma is in effect. During a string eval,
854 however, the scalar may have the C<SvUTF8> flag on, and in this case its
855 octets should be interpreted as UTF-8 unless the C<use bytes> pragma
856 is in effect. This logic may change in the future; use this function
857 instead of implementing the logic yourself.
863 Perl_lex_bufutf8(pTHX)
869 =for apidoc Amx|char *|lex_grow_linestr|STRLEN len
871 Reallocates the lexer buffer (L</PL_parser-E<gt>linestr>) to accommodate
872 at least I<len> octets (including terminating NUL). Returns a
873 pointer to the reallocated buffer. This is necessary before making
874 any direct modification of the buffer that would increase its length.
875 L</lex_stuff_pvn> provides a more convenient way to insert text into
878 Do not use C<SvGROW> or C<sv_grow> directly on C<PL_parser-E<gt>linestr>;
879 this function updates all of the lexer's variables that point directly
886 Perl_lex_grow_linestr(pTHX_ STRLEN len)
890 STRLEN bufend_pos, bufptr_pos, oldbufptr_pos, oldoldbufptr_pos;
891 STRLEN linestart_pos, last_uni_pos, last_lop_pos;
892 linestr = PL_parser->linestr;
893 buf = SvPVX(linestr);
894 if (len <= SvLEN(linestr))
896 bufend_pos = PL_parser->bufend - buf;
897 bufptr_pos = PL_parser->bufptr - buf;
898 oldbufptr_pos = PL_parser->oldbufptr - buf;
899 oldoldbufptr_pos = PL_parser->oldoldbufptr - buf;
900 linestart_pos = PL_parser->linestart - buf;
901 last_uni_pos = PL_parser->last_uni ? PL_parser->last_uni - buf : 0;
902 last_lop_pos = PL_parser->last_lop ? PL_parser->last_lop - buf : 0;
903 buf = sv_grow(linestr, len);
904 PL_parser->bufend = buf + bufend_pos;
905 PL_parser->bufptr = buf + bufptr_pos;
906 PL_parser->oldbufptr = buf + oldbufptr_pos;
907 PL_parser->oldoldbufptr = buf + oldoldbufptr_pos;
908 PL_parser->linestart = buf + linestart_pos;
909 if (PL_parser->last_uni)
910 PL_parser->last_uni = buf + last_uni_pos;
911 if (PL_parser->last_lop)
912 PL_parser->last_lop = buf + last_lop_pos;
917 =for apidoc Amx|void|lex_stuff_pvn|char *pv|STRLEN len|U32 flags
919 Insert characters into the lexer buffer (L</PL_parser-E<gt>linestr>),
920 immediately after the current lexing point (L</PL_parser-E<gt>bufptr>),
921 reallocating the buffer if necessary. This means that lexing code that
922 runs later will see the characters as if they had appeared in the input.
923 It is not recommended to do this as part of normal parsing, and most
924 uses of this facility run the risk of the inserted characters being
925 interpreted in an unintended manner.
927 The string to be inserted is represented by I<len> octets starting
928 at I<pv>. These octets are interpreted as either UTF-8 or Latin-1,
929 according to whether the C<LEX_STUFF_UTF8> flag is set in I<flags>.
930 The characters are recoded for the lexer buffer, according to how the
931 buffer is currently being interpreted (L</lex_bufutf8>). If a string
932 to be interpreted is available as a Perl scalar, the L</lex_stuff_sv>
933 function is more convenient.
939 Perl_lex_stuff_pvn(pTHX_ char *pv, STRLEN len, U32 flags)
942 PERL_ARGS_ASSERT_LEX_STUFF_PVN;
943 if (flags & ~(LEX_STUFF_UTF8))
944 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_stuff_pvn");
946 if (flags & LEX_STUFF_UTF8) {
950 char *p, *e = pv+len;
951 for (p = pv; p != e; p++)
952 highhalf += !!(((U8)*p) & 0x80);
955 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len+highhalf);
956 bufptr = PL_parser->bufptr;
957 Move(bufptr, bufptr+len+highhalf, PL_parser->bufend+1-bufptr, char);
958 PL_parser->bufend += len+highhalf;
959 for (p = pv; p != e; p++) {
962 *bufptr++ = (char)(0xc0 | (c >> 6));
963 *bufptr++ = (char)(0x80 | (c & 0x3f));
970 if (flags & LEX_STUFF_UTF8) {
972 char *p, *e = pv+len;
973 for (p = pv; p != e; p++) {
976 Perl_croak(aTHX_ "Lexing code attempted to stuff "
977 "non-Latin-1 character into Latin-1 input");
978 } else if (c >= 0xc2 && p+1 != e &&
979 (((U8)p[1]) & 0xc0) == 0x80) {
982 } else if (c >= 0x80) {
983 /* malformed UTF-8 */
985 SAVESPTR(PL_warnhook);
986 PL_warnhook = PERL_WARNHOOK_FATAL;
987 utf8n_to_uvuni((U8*)p, e-p, NULL, 0);
993 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len-highhalf);
994 bufptr = PL_parser->bufptr;
995 Move(bufptr, bufptr+len-highhalf, PL_parser->bufend+1-bufptr, char);
996 PL_parser->bufend += len-highhalf;
997 for (p = pv; p != e; p++) {
1000 *bufptr++ = (char)(((c & 0x3) << 6) | (p[1] & 0x3f));
1003 *bufptr++ = (char)c;
1008 lex_grow_linestr(SvCUR(PL_parser->linestr)+1+len);
1009 bufptr = PL_parser->bufptr;
1010 Move(bufptr, bufptr+len, PL_parser->bufend+1-bufptr, char);
1011 PL_parser->bufend += len;
1012 Copy(pv, bufptr, len, char);
1018 =for apidoc Amx|void|lex_stuff_sv|SV *sv|U32 flags
1020 Insert characters into the lexer buffer (L</PL_parser-E<gt>linestr>),
1021 immediately after the current lexing point (L</PL_parser-E<gt>bufptr>),
1022 reallocating the buffer if necessary. This means that lexing code that
1023 runs later will see the characters as if they had appeared in the input.
1024 It is not recommended to do this as part of normal parsing, and most
1025 uses of this facility run the risk of the inserted characters being
1026 interpreted in an unintended manner.
1028 The string to be inserted is the string value of I<sv>. The characters
1029 are recoded for the lexer buffer, according to how the buffer is currently
1030 being interpreted (L</lex_bufutf8>). If a string to be interpreted is
1031 not already a Perl scalar, the L</lex_stuff_pvn> function avoids the
1032 need to construct a scalar.
1038 Perl_lex_stuff_sv(pTHX_ SV *sv, U32 flags)
1042 PERL_ARGS_ASSERT_LEX_STUFF_SV;
1044 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_stuff_sv");
1046 lex_stuff_pvn(pv, len, flags | (SvUTF8(sv) ? LEX_STUFF_UTF8 : 0));
1050 =for apidoc Amx|void|lex_unstuff|char *ptr
1052 Discards text about to be lexed, from L</PL_parser-E<gt>bufptr> up to
1053 I<ptr>. Text following I<ptr> will be moved, and the buffer shortened.
1054 This hides the discarded text from any lexing code that runs later,
1055 as if the text had never appeared.
1057 This is not the normal way to consume lexed text. For that, use
1064 Perl_lex_unstuff(pTHX_ char *ptr)
1068 PERL_ARGS_ASSERT_LEX_UNSTUFF;
1069 buf = PL_parser->bufptr;
1071 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_unstuff");
1074 bufend = PL_parser->bufend;
1076 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_unstuff");
1077 unstuff_len = ptr - buf;
1078 Move(ptr, buf, bufend+1-ptr, char);
1079 SvCUR_set(PL_parser->linestr, SvCUR(PL_parser->linestr) - unstuff_len);
1080 PL_parser->bufend = bufend - unstuff_len;
1084 =for apidoc Amx|void|lex_read_to|char *ptr
1086 Consume text in the lexer buffer, from L</PL_parser-E<gt>bufptr> up
1087 to I<ptr>. This advances L</PL_parser-E<gt>bufptr> to match I<ptr>,
1088 performing the correct bookkeeping whenever a newline character is passed.
1089 This is the normal way to consume lexed text.
1091 Interpretation of the buffer's octets can be abstracted out by
1092 using the slightly higher-level functions L</lex_peek_unichar> and
1093 L</lex_read_unichar>.
1099 Perl_lex_read_to(pTHX_ char *ptr)
1102 PERL_ARGS_ASSERT_LEX_READ_TO;
1103 s = PL_parser->bufptr;
1104 if (ptr < s || ptr > PL_parser->bufend)
1105 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_to");
1106 for (; s != ptr; s++)
1108 CopLINE_inc(PL_curcop);
1109 PL_parser->linestart = s+1;
1111 PL_parser->bufptr = ptr;
1115 =for apidoc Amx|void|lex_discard_to|char *ptr
1117 Discards the first part of the L</PL_parser-E<gt>linestr> buffer,
1118 up to I<ptr>. The remaining content of the buffer will be moved, and
1119 all pointers into the buffer updated appropriately. I<ptr> must not
1120 be later in the buffer than the position of L</PL_parser-E<gt>bufptr>:
1121 it is not permitted to discard text that has yet to be lexed.
1123 Normally it is not necessarily to do this directly, because it suffices to
1124 use the implicit discarding behaviour of L</lex_next_chunk> and things
1125 based on it. However, if a token stretches across multiple lines,
1126 and the lexing code has kept multiple lines of text in the buffer fof
1127 that purpose, then after completion of the token it would be wise to
1128 explicitly discard the now-unneeded earlier lines, to avoid future
1129 multi-line tokens growing the buffer without bound.
1135 Perl_lex_discard_to(pTHX_ char *ptr)
1139 PERL_ARGS_ASSERT_LEX_DISCARD_TO;
1140 buf = SvPVX(PL_parser->linestr);
1142 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_discard_to");
1145 if (ptr > PL_parser->bufptr)
1146 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_discard_to");
1147 discard_len = ptr - buf;
1148 if (PL_parser->oldbufptr < ptr)
1149 PL_parser->oldbufptr = ptr;
1150 if (PL_parser->oldoldbufptr < ptr)
1151 PL_parser->oldoldbufptr = ptr;
1152 if (PL_parser->last_uni && PL_parser->last_uni < ptr)
1153 PL_parser->last_uni = NULL;
1154 if (PL_parser->last_lop && PL_parser->last_lop < ptr)
1155 PL_parser->last_lop = NULL;
1156 Move(ptr, buf, PL_parser->bufend+1-ptr, char);
1157 SvCUR_set(PL_parser->linestr, SvCUR(PL_parser->linestr) - discard_len);
1158 PL_parser->bufend -= discard_len;
1159 PL_parser->bufptr -= discard_len;
1160 PL_parser->oldbufptr -= discard_len;
1161 PL_parser->oldoldbufptr -= discard_len;
1162 if (PL_parser->last_uni)
1163 PL_parser->last_uni -= discard_len;
1164 if (PL_parser->last_lop)
1165 PL_parser->last_lop -= discard_len;
1169 =for apidoc Amx|bool|lex_next_chunk|U32 flags
1171 Reads in the next chunk of text to be lexed, appending it to
1172 L</PL_parser-E<gt>linestr>. This should be called when lexing code has
1173 looked to the end of the current chunk and wants to know more. It is
1174 usual, but not necessary, for lexing to have consumed the entirety of
1175 the current chunk at this time.
1177 If L</PL_parser-E<gt>bufptr> is pointing to the very end of the current
1178 chunk (i.e., the current chunk has been entirely consumed), normally the
1179 current chunk will be discarded at the same time that the new chunk is
1180 read in. If I<flags> includes C<LEX_KEEP_PREVIOUS>, the current chunk
1181 will not be discarded. If the current chunk has not been entirely
1182 consumed, then it will not be discarded regardless of the flag.
1184 Returns true if some new text was added to the buffer, or false if the
1185 buffer has reached the end of the input text.
1190 #define LEX_FAKE_EOF 0x80000000
1193 Perl_lex_next_chunk(pTHX_ U32 flags)
1197 STRLEN old_bufend_pos, new_bufend_pos;
1198 STRLEN bufptr_pos, oldbufptr_pos, oldoldbufptr_pos;
1199 STRLEN linestart_pos, last_uni_pos, last_lop_pos;
1200 bool got_some_for_debugger = 0;
1202 if (flags & ~(LEX_KEEP_PREVIOUS|LEX_FAKE_EOF))
1203 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_next_chunk");
1204 linestr = PL_parser->linestr;
1205 buf = SvPVX(linestr);
1206 if (!(flags & LEX_KEEP_PREVIOUS) &&
1207 PL_parser->bufptr == PL_parser->bufend) {
1208 old_bufend_pos = bufptr_pos = oldbufptr_pos = oldoldbufptr_pos = 0;
1210 if (PL_parser->last_uni != PL_parser->bufend)
1211 PL_parser->last_uni = NULL;
1212 if (PL_parser->last_lop != PL_parser->bufend)
1213 PL_parser->last_lop = NULL;
1214 last_uni_pos = last_lop_pos = 0;
1218 old_bufend_pos = PL_parser->bufend - buf;
1219 bufptr_pos = PL_parser->bufptr - buf;
1220 oldbufptr_pos = PL_parser->oldbufptr - buf;
1221 oldoldbufptr_pos = PL_parser->oldoldbufptr - buf;
1222 linestart_pos = PL_parser->linestart - buf;
1223 last_uni_pos = PL_parser->last_uni ? PL_parser->last_uni - buf : 0;
1224 last_lop_pos = PL_parser->last_lop ? PL_parser->last_lop - buf : 0;
1226 if (flags & LEX_FAKE_EOF) {
1228 } else if (!PL_parser->rsfp) {
1230 } else if (filter_gets(linestr, old_bufend_pos)) {
1232 got_some_for_debugger = 1;
1234 if (!SvPOK(linestr)) /* can get undefined by filter_gets */
1235 sv_setpvs(linestr, "");
1237 /* End of real input. Close filehandle (unless it was STDIN),
1238 * then add implicit termination.
1240 if ((PerlIO*)PL_parser->rsfp == PerlIO_stdin())
1241 PerlIO_clearerr(PL_parser->rsfp);
1242 else if (PL_parser->rsfp)
1243 (void)PerlIO_close(PL_parser->rsfp);
1244 PL_parser->rsfp = NULL;
1245 PL_doextract = FALSE;
1247 if (PL_madskills && !PL_in_eval && (PL_minus_p || PL_minus_n))
1250 if (!PL_in_eval && PL_minus_p) {
1252 /*{*/";}continue{print or die qq(-p destination: $!\\n);}");
1253 PL_minus_n = PL_minus_p = 0;
1254 } else if (!PL_in_eval && PL_minus_n) {
1255 sv_catpvs(linestr, /*{*/";}");
1258 sv_catpvs(linestr, ";");
1261 buf = SvPVX(linestr);
1262 new_bufend_pos = SvCUR(linestr);
1263 PL_parser->bufend = buf + new_bufend_pos;
1264 PL_parser->bufptr = buf + bufptr_pos;
1265 PL_parser->oldbufptr = buf + oldbufptr_pos;
1266 PL_parser->oldoldbufptr = buf + oldoldbufptr_pos;
1267 PL_parser->linestart = buf + linestart_pos;
1268 if (PL_parser->last_uni)
1269 PL_parser->last_uni = buf + last_uni_pos;
1270 if (PL_parser->last_lop)
1271 PL_parser->last_lop = buf + last_lop_pos;
1272 if (got_some_for_debugger && (PERLDB_LINE || PERLDB_SAVESRC) &&
1273 PL_curstash != PL_debstash) {
1274 /* debugger active and we're not compiling the debugger code,
1275 * so store the line into the debugger's array of lines
1277 update_debugger_info(NULL, buf+old_bufend_pos,
1278 new_bufend_pos-old_bufend_pos);
1284 =for apidoc Amx|I32|lex_peek_unichar|U32 flags
1286 Looks ahead one (Unicode) character in the text currently being lexed.
1287 Returns the codepoint (unsigned integer value) of the next character,
1288 or -1 if lexing has reached the end of the input text. To consume the
1289 peeked character, use L</lex_read_unichar>.
1291 If the next character is in (or extends into) the next chunk of input
1292 text, the next chunk will be read in. Normally the current chunk will be
1293 discarded at the same time, but if I<flags> includes C<LEX_KEEP_PREVIOUS>
1294 then the current chunk will not be discarded.
1296 If the input is being interpreted as UTF-8 and a UTF-8 encoding error
1297 is encountered, an exception is generated.
1303 Perl_lex_peek_unichar(pTHX_ U32 flags)
1306 if (flags & ~(LEX_KEEP_PREVIOUS))
1307 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_peek_unichar");
1308 s = PL_parser->bufptr;
1309 bufend = PL_parser->bufend;
1315 if (!lex_next_chunk(flags))
1317 s = PL_parser->bufptr;
1318 bufend = PL_parser->bufend;
1324 len = PL_utf8skip[head];
1325 while ((STRLEN)(bufend-s) < len) {
1326 if (!lex_next_chunk(flags | LEX_KEEP_PREVIOUS))
1328 s = PL_parser->bufptr;
1329 bufend = PL_parser->bufend;
1332 unichar = utf8n_to_uvuni((U8*)s, bufend-s, &retlen, UTF8_CHECK_ONLY);
1333 if (retlen == (STRLEN)-1) {
1334 /* malformed UTF-8 */
1336 SAVESPTR(PL_warnhook);
1337 PL_warnhook = PERL_WARNHOOK_FATAL;
1338 utf8n_to_uvuni((U8*)s, bufend-s, NULL, 0);
1344 if (!lex_next_chunk(flags))
1346 s = PL_parser->bufptr;
1353 =for apidoc Amx|I32|lex_read_unichar|U32 flags
1355 Reads the next (Unicode) character in the text currently being lexed.
1356 Returns the codepoint (unsigned integer value) of the character read,
1357 and moves L</PL_parser-E<gt>bufptr> past the character, or returns -1
1358 if lexing has reached the end of the input text. To non-destructively
1359 examine the next character, use L</lex_peek_unichar> instead.
1361 If the next character is in (or extends into) the next chunk of input
1362 text, the next chunk will be read in. Normally the current chunk will be
1363 discarded at the same time, but if I<flags> includes C<LEX_KEEP_PREVIOUS>
1364 then the current chunk will not be discarded.
1366 If the input is being interpreted as UTF-8 and a UTF-8 encoding error
1367 is encountered, an exception is generated.
1373 Perl_lex_read_unichar(pTHX_ U32 flags)
1376 if (flags & ~(LEX_KEEP_PREVIOUS))
1377 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_unichar");
1378 c = lex_peek_unichar(flags);
1381 CopLINE_inc(PL_curcop);
1382 PL_parser->bufptr += UTF8SKIP(PL_parser->bufptr);
1388 =for apidoc Amx|void|lex_read_space|U32 flags
1390 Reads optional spaces, in Perl style, in the text currently being
1391 lexed. The spaces may include ordinary whitespace characters and
1392 Perl-style comments. C<#line> directives are processed if encountered.
1393 L</PL_parser-E<gt>bufptr> is moved past the spaces, so that it points
1394 at a non-space character (or the end of the input text).
1396 If spaces extend into the next chunk of input text, the next chunk will
1397 be read in. Normally the current chunk will be discarded at the same
1398 time, but if I<flags> includes C<LEX_KEEP_PREVIOUS> then the current
1399 chunk will not be discarded.
1404 #define LEX_NO_NEXT_CHUNK 0x80000000
1407 Perl_lex_read_space(pTHX_ U32 flags)
1410 bool need_incline = 0;
1411 if (flags & ~(LEX_KEEP_PREVIOUS|LEX_NO_NEXT_CHUNK))
1412 Perl_croak(aTHX_ "Lexing code internal error (%s)", "lex_read_space");
1415 sv_free(PL_skipwhite);
1416 PL_skipwhite = NULL;
1419 PL_skipwhite = newSVpvs("");
1420 #endif /* PERL_MAD */
1421 s = PL_parser->bufptr;
1422 bufend = PL_parser->bufend;
1428 } while (!(c == '\n' || (c == 0 && s == bufend)));
1429 } else if (c == '\n') {
1431 PL_parser->linestart = s;
1436 } else if (isSPACE(c)) {
1438 } else if (c == 0 && s == bufend) {
1442 sv_catpvn(PL_skipwhite, PL_parser->bufptr, s-PL_parser->bufptr);
1443 #endif /* PERL_MAD */
1444 if (flags & LEX_NO_NEXT_CHUNK)
1446 PL_parser->bufptr = s;
1447 CopLINE_inc(PL_curcop);
1448 got_more = lex_next_chunk(flags);
1449 CopLINE_dec(PL_curcop);
1450 s = PL_parser->bufptr;
1451 bufend = PL_parser->bufend;
1454 if (need_incline && PL_parser->rsfp) {
1464 sv_catpvn(PL_skipwhite, PL_parser->bufptr, s-PL_parser->bufptr);
1465 #endif /* PERL_MAD */
1466 PL_parser->bufptr = s;
1471 * This subroutine has nothing to do with tilting, whether at windmills
1472 * or pinball tables. Its name is short for "increment line". It
1473 * increments the current line number in CopLINE(PL_curcop) and checks
1474 * to see whether the line starts with a comment of the form
1475 * # line 500 "foo.pm"
1476 * If so, it sets the current line number and file to the values in the comment.
1480 S_incline(pTHX_ const char *s)
1487 PERL_ARGS_ASSERT_INCLINE;
1489 CopLINE_inc(PL_curcop);
1492 while (SPACE_OR_TAB(*s))
1494 if (strnEQ(s, "line", 4))
1498 if (SPACE_OR_TAB(*s))
1502 while (SPACE_OR_TAB(*s))
1510 if (!SPACE_OR_TAB(*s) && *s != '\r' && *s != '\n' && *s != '\0')
1512 while (SPACE_OR_TAB(*s))
1514 if (*s == '"' && (t = strchr(s+1, '"'))) {
1520 while (!isSPACE(*t))
1524 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
1526 if (*e != '\n' && *e != '\0')
1527 return; /* false alarm */
1530 const STRLEN len = t - s;
1531 #ifndef USE_ITHREADS
1532 SV *const temp_sv = CopFILESV(PL_curcop);
1537 cf = SvPVX(temp_sv);
1538 tmplen = SvCUR(temp_sv);
1544 if (tmplen > 7 && strnEQ(cf, "(eval ", 6)) {
1545 /* must copy *{"::_<(eval N)[oldfilename:L]"}
1546 * to *{"::_<newfilename"} */
1547 /* However, the long form of evals is only turned on by the
1548 debugger - usually they're "(eval %lu)" */
1552 STRLEN tmplen2 = len;
1553 if (tmplen + 2 <= sizeof smallbuf)
1556 Newx(tmpbuf, tmplen + 2, char);
1559 memcpy(tmpbuf + 2, cf, tmplen);
1561 gvp = (GV**)hv_fetch(PL_defstash, tmpbuf, tmplen, FALSE);
1566 if (tmplen2 + 2 <= sizeof smallbuf)
1569 Newx(tmpbuf2, tmplen2 + 2, char);
1571 if (tmpbuf2 != smallbuf || tmpbuf != smallbuf) {
1572 /* Either they malloc'd it, or we malloc'd it,
1573 so no prefix is present in ours. */
1578 memcpy(tmpbuf2 + 2, s, tmplen2);
1581 gv2 = *(GV**)hv_fetch(PL_defstash, tmpbuf2, tmplen2, TRUE);
1583 gv_init(gv2, PL_defstash, tmpbuf2, tmplen2, FALSE);
1584 /* adjust ${"::_<newfilename"} to store the new file name */
1585 GvSV(gv2) = newSVpvn(tmpbuf2 + 2, tmplen2 - 2);
1586 GvHV(gv2) = MUTABLE_HV(SvREFCNT_inc(GvHV(*gvp)));
1587 GvAV(gv2) = MUTABLE_AV(SvREFCNT_inc(GvAV(*gvp)));
1590 if (tmpbuf2 != smallbuf) Safefree(tmpbuf2);
1592 if (tmpbuf != smallbuf) Safefree(tmpbuf);
1595 CopFILE_free(PL_curcop);
1596 CopFILE_setn(PL_curcop, s, len);
1598 CopLINE_set(PL_curcop, atoi(n)-1);
1602 /* skip space before PL_thistoken */
1605 S_skipspace0(pTHX_ register char *s)
1607 PERL_ARGS_ASSERT_SKIPSPACE0;
1614 PL_thiswhite = newSVpvs("");
1615 sv_catsv(PL_thiswhite, PL_skipwhite);
1616 sv_free(PL_skipwhite);
1619 PL_realtokenstart = s - SvPVX(PL_linestr);
1623 /* skip space after PL_thistoken */
1626 S_skipspace1(pTHX_ register char *s)
1628 const char *start = s;
1629 I32 startoff = start - SvPVX(PL_linestr);
1631 PERL_ARGS_ASSERT_SKIPSPACE1;
1636 start = SvPVX(PL_linestr) + startoff;
1637 if (!PL_thistoken && PL_realtokenstart >= 0) {
1638 const char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
1639 PL_thistoken = newSVpvn(tstart, start - tstart);
1641 PL_realtokenstart = -1;
1644 PL_nextwhite = newSVpvs("");
1645 sv_catsv(PL_nextwhite, PL_skipwhite);
1646 sv_free(PL_skipwhite);
1653 S_skipspace2(pTHX_ register char *s, SV **svp)
1656 const I32 bufptroff = PL_bufptr - SvPVX(PL_linestr);
1657 const I32 startoff = s - SvPVX(PL_linestr);
1659 PERL_ARGS_ASSERT_SKIPSPACE2;
1662 PL_bufptr = SvPVX(PL_linestr) + bufptroff;
1663 if (!PL_madskills || !svp)
1665 start = SvPVX(PL_linestr) + startoff;
1666 if (!PL_thistoken && PL_realtokenstart >= 0) {
1667 char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
1668 PL_thistoken = newSVpvn(tstart, start - tstart);
1669 PL_realtokenstart = -1;
1673 *svp = newSVpvs("");
1674 sv_setsv(*svp, PL_skipwhite);
1675 sv_free(PL_skipwhite);
1684 S_update_debugger_info(pTHX_ SV *orig_sv, const char *const buf, STRLEN len)
1686 AV *av = CopFILEAVx(PL_curcop);
1688 SV * const sv = newSV_type(SVt_PVMG);
1690 sv_setsv(sv, orig_sv);
1692 sv_setpvn(sv, buf, len);
1695 av_store(av, (I32)CopLINE(PL_curcop), sv);
1701 * Called to gobble the appropriate amount and type of whitespace.
1702 * Skips comments as well.
1706 S_skipspace(pTHX_ register char *s)
1710 #endif /* PERL_MAD */
1711 PERL_ARGS_ASSERT_SKIPSPACE;
1714 sv_free(PL_skipwhite);
1715 PL_skipwhite = NULL;
1717 #endif /* PERL_MAD */
1718 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
1719 while (s < PL_bufend && SPACE_OR_TAB(*s))
1722 STRLEN bufptr_pos = PL_bufptr - SvPVX(PL_linestr);
1724 lex_read_space(LEX_KEEP_PREVIOUS |
1725 (PL_sublex_info.sub_inwhat || PL_lex_state == LEX_FORMLINE ?
1726 LEX_NO_NEXT_CHUNK : 0));
1728 PL_bufptr = SvPVX(PL_linestr) + bufptr_pos;
1729 if (PL_linestart > PL_bufptr)
1730 PL_bufptr = PL_linestart;
1735 PL_skipwhite = newSVpvn(start, s-start);
1736 #endif /* PERL_MAD */
1742 * Check the unary operators to ensure there's no ambiguity in how they're
1743 * used. An ambiguous piece of code would be:
1745 * This doesn't mean rand() + 5. Because rand() is a unary operator,
1746 * the +5 is its argument.
1756 if (PL_oldoldbufptr != PL_last_uni)
1758 while (isSPACE(*PL_last_uni))
1761 while (isALNUM_lazy_if(s,UTF) || *s == '-')
1763 if ((t = strchr(s, '(')) && t < PL_bufptr)
1766 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
1767 "Warning: Use of \"%.*s\" without parentheses is ambiguous",
1768 (int)(s - PL_last_uni), PL_last_uni);
1772 * LOP : macro to build a list operator. Its behaviour has been replaced
1773 * with a subroutine, S_lop() for which LOP is just another name.
1776 #define LOP(f,x) return lop(f,x,s)
1780 * Build a list operator (or something that might be one). The rules:
1781 * - if we have a next token, then it's a list operator [why?]
1782 * - if the next thing is an opening paren, then it's a function
1783 * - else it's a list operator
1787 S_lop(pTHX_ I32 f, int x, char *s)
1791 PERL_ARGS_ASSERT_LOP;
1797 PL_last_lop = PL_oldbufptr;
1798 PL_last_lop_op = (OPCODE)f;
1801 return REPORT(LSTOP);
1804 return REPORT(LSTOP);
1807 return REPORT(FUNC);
1810 return REPORT(FUNC);
1812 return REPORT(LSTOP);
1818 * Sets up for an eventual force_next(). start_force(0) basically does
1819 * an unshift, while start_force(-1) does a push. yylex removes items
1824 S_start_force(pTHX_ int where)
1828 if (where < 0) /* so people can duplicate start_force(PL_curforce) */
1829 where = PL_lasttoke;
1830 assert(PL_curforce < 0 || PL_curforce == where);
1831 if (PL_curforce != where) {
1832 for (i = PL_lasttoke; i > where; --i) {
1833 PL_nexttoke[i] = PL_nexttoke[i-1];
1837 if (PL_curforce < 0) /* in case of duplicate start_force() */
1838 Zero(&PL_nexttoke[where], 1, NEXTTOKE);
1839 PL_curforce = where;
1842 curmad('^', newSVpvs(""));
1843 CURMAD('_', PL_nextwhite);
1848 S_curmad(pTHX_ char slot, SV *sv)
1854 if (PL_curforce < 0)
1855 where = &PL_thismad;
1857 where = &PL_nexttoke[PL_curforce].next_mad;
1863 if (UTF && is_utf8_string((U8*)SvPVX(sv), SvCUR(sv)))
1865 else if (PL_encoding) {
1866 sv_recode_to_utf8(sv, PL_encoding);
1871 /* keep a slot open for the head of the list? */
1872 if (slot != '_' && *where && (*where)->mad_key == '^') {
1873 (*where)->mad_key = slot;
1874 sv_free(MUTABLE_SV(((*where)->mad_val)));
1875 (*where)->mad_val = (void*)sv;
1878 addmad(newMADsv(slot, sv), where, 0);
1881 # define start_force(where) NOOP
1882 # define curmad(slot, sv) NOOP
1887 * When the lexer realizes it knows the next token (for instance,
1888 * it is reordering tokens for the parser) then it can call S_force_next
1889 * to know what token to return the next time the lexer is called. Caller
1890 * will need to set PL_nextval[] (or PL_nexttoke[].next_val with PERL_MAD),
1891 * and possibly PL_expect to ensure the lexer handles the token correctly.
1895 S_force_next(pTHX_ I32 type)
1900 PerlIO_printf(Perl_debug_log, "### forced token:\n");
1901 tokereport(type, &NEXTVAL_NEXTTOKE);
1905 if (PL_curforce < 0)
1906 start_force(PL_lasttoke);
1907 PL_nexttoke[PL_curforce].next_type = type;
1908 if (PL_lex_state != LEX_KNOWNEXT)
1909 PL_lex_defer = PL_lex_state;
1910 PL_lex_state = LEX_KNOWNEXT;
1911 PL_lex_expect = PL_expect;
1914 PL_nexttype[PL_nexttoke] = type;
1916 if (PL_lex_state != LEX_KNOWNEXT) {
1917 PL_lex_defer = PL_lex_state;
1918 PL_lex_expect = PL_expect;
1919 PL_lex_state = LEX_KNOWNEXT;
1925 S_newSV_maybe_utf8(pTHX_ const char *const start, STRLEN len)
1928 SV * const sv = newSVpvn_utf8(start, len,
1931 && !is_ascii_string((const U8*)start, len)
1932 && is_utf8_string((const U8*)start, len));
1938 * When the lexer knows the next thing is a word (for instance, it has
1939 * just seen -> and it knows that the next char is a word char, then
1940 * it calls S_force_word to stick the next word into the PL_nexttoke/val
1944 * char *start : buffer position (must be within PL_linestr)
1945 * int token : PL_next* will be this type of bare word (e.g., METHOD,WORD)
1946 * int check_keyword : if true, Perl checks to make sure the word isn't
1947 * a keyword (do this if the word is a label, e.g. goto FOO)
1948 * int allow_pack : if true, : characters will also be allowed (require,
1949 * use, etc. do this)
1950 * int allow_initial_tick : used by the "sub" lexer only.
1954 S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
1960 PERL_ARGS_ASSERT_FORCE_WORD;
1962 start = SKIPSPACE1(start);
1964 if (isIDFIRST_lazy_if(s,UTF) ||
1965 (allow_pack && *s == ':') ||
1966 (allow_initial_tick && *s == '\'') )
1968 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
1969 if (check_keyword && keyword(PL_tokenbuf, len, 0))
1971 start_force(PL_curforce);
1973 curmad('X', newSVpvn(start,s-start));
1974 if (token == METHOD) {
1979 PL_expect = XOPERATOR;
1983 curmad('g', newSVpvs( "forced" ));
1984 NEXTVAL_NEXTTOKE.opval
1985 = (OP*)newSVOP(OP_CONST,0,
1986 S_newSV_maybe_utf8(aTHX_ PL_tokenbuf, len));
1987 NEXTVAL_NEXTTOKE.opval->op_private |= OPpCONST_BARE;
1995 * Called when the lexer wants $foo *foo &foo etc, but the program
1996 * text only contains the "foo" portion. The first argument is a pointer
1997 * to the "foo", and the second argument is the type symbol to prefix.
1998 * Forces the next token to be a "WORD".
1999 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
2003 S_force_ident(pTHX_ register const char *s, int kind)
2007 PERL_ARGS_ASSERT_FORCE_IDENT;
2010 const STRLEN len = strlen(s);
2011 OP* const o = (OP*)newSVOP(OP_CONST, 0, newSVpvn(s, len));
2012 start_force(PL_curforce);
2013 NEXTVAL_NEXTTOKE.opval = o;
2016 o->op_private = OPpCONST_ENTERED;
2017 /* XXX see note in pp_entereval() for why we forgo typo
2018 warnings if the symbol must be introduced in an eval.
2020 gv_fetchpvn_flags(s, len,
2021 PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL)
2023 kind == '$' ? SVt_PV :
2024 kind == '@' ? SVt_PVAV :
2025 kind == '%' ? SVt_PVHV :
2033 Perl_str_to_version(pTHX_ SV *sv)
2038 const char *start = SvPV_const(sv,len);
2039 const char * const end = start + len;
2040 const bool utf = SvUTF8(sv) ? TRUE : FALSE;
2042 PERL_ARGS_ASSERT_STR_TO_VERSION;
2044 while (start < end) {
2048 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
2053 retval += ((NV)n)/nshift;
2062 * Forces the next token to be a version number.
2063 * If the next token appears to be an invalid version number, (e.g. "v2b"),
2064 * and if "guessing" is TRUE, then no new token is created (and the caller
2065 * must use an alternative parsing method).
2069 S_force_version(pTHX_ char *s, int guessing)
2075 I32 startoff = s - SvPVX(PL_linestr);
2078 PERL_ARGS_ASSERT_FORCE_VERSION;
2086 while (isDIGIT(*d) || *d == '_' || *d == '.')
2090 start_force(PL_curforce);
2091 curmad('X', newSVpvn(s,d-s));
2094 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
2096 s = scan_num(s, &pl_yylval);
2097 version = pl_yylval.opval;
2098 ver = cSVOPx(version)->op_sv;
2099 if (SvPOK(ver) && !SvNIOK(ver)) {
2100 SvUPGRADE(ver, SVt_PVNV);
2101 SvNV_set(ver, str_to_version(ver));
2102 SvNOK_on(ver); /* hint that it is a version */
2105 else if (guessing) {
2108 sv_free(PL_nextwhite); /* let next token collect whitespace */
2110 s = SvPVX(PL_linestr) + startoff;
2118 if (PL_madskills && !version) {
2119 sv_free(PL_nextwhite); /* let next token collect whitespace */
2121 s = SvPVX(PL_linestr) + startoff;
2124 /* NOTE: The parser sees the package name and the VERSION swapped */
2125 start_force(PL_curforce);
2126 NEXTVAL_NEXTTOKE.opval = version;
2134 * Tokenize a quoted string passed in as an SV. It finds the next
2135 * chunk, up to end of string or a backslash. It may make a new
2136 * SV containing that chunk (if HINT_NEW_STRING is on). It also
2141 S_tokeq(pTHX_ SV *sv)
2145 register char *send;
2150 PERL_ARGS_ASSERT_TOKEQ;
2155 s = SvPV_force(sv, len);
2156 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
2159 while (s < send && *s != '\\')
2164 if ( PL_hints & HINT_NEW_STRING ) {
2165 pv = newSVpvn_flags(SvPVX_const(pv), len, SVs_TEMP | SvUTF8(sv));
2169 if (s + 1 < send && (s[1] == '\\'))
2170 s++; /* all that, just for this */
2175 SvCUR_set(sv, d - SvPVX_const(sv));
2177 if ( PL_hints & HINT_NEW_STRING )
2178 return new_constant(NULL, 0, "q", sv, pv, "q", 1);
2183 * Now come three functions related to double-quote context,
2184 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
2185 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
2186 * interact with PL_lex_state, and create fake ( ... ) argument lists
2187 * to handle functions and concatenation.
2188 * They assume that whoever calls them will be setting up a fake
2189 * join call, because each subthing puts a ',' after it. This lets
2192 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
2194 * (I'm not sure whether the spurious commas at the end of lcfirst's
2195 * arguments and join's arguments are created or not).
2200 * Assumes that pl_yylval.ival is the op we're creating (e.g. OP_LCFIRST).
2202 * Pattern matching will set PL_lex_op to the pattern-matching op to
2203 * make (we return THING if pl_yylval.ival is OP_NULL, PMFUNC otherwise).
2205 * OP_CONST and OP_READLINE are easy--just make the new op and return.
2207 * Everything else becomes a FUNC.
2209 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
2210 * had an OP_CONST or OP_READLINE). This just sets us up for a
2211 * call to S_sublex_push().
2215 S_sublex_start(pTHX)
2218 register const I32 op_type = pl_yylval.ival;
2220 if (op_type == OP_NULL) {
2221 pl_yylval.opval = PL_lex_op;
2225 if (op_type == OP_CONST || op_type == OP_READLINE) {
2226 SV *sv = tokeq(PL_lex_stuff);
2228 if (SvTYPE(sv) == SVt_PVIV) {
2229 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
2231 const char * const p = SvPV_const(sv, len);
2232 SV * const nsv = newSVpvn_flags(p, len, SvUTF8(sv));
2236 pl_yylval.opval = (OP*)newSVOP(op_type, 0, sv);
2237 PL_lex_stuff = NULL;
2238 /* Allow <FH> // "foo" */
2239 if (op_type == OP_READLINE)
2240 PL_expect = XTERMORDORDOR;
2243 else if (op_type == OP_BACKTICK && PL_lex_op) {
2244 /* readpipe() vas overriden */
2245 cSVOPx(cLISTOPx(cUNOPx(PL_lex_op)->op_first)->op_first->op_sibling)->op_sv = tokeq(PL_lex_stuff);
2246 pl_yylval.opval = PL_lex_op;
2248 PL_lex_stuff = NULL;
2252 PL_sublex_info.super_state = PL_lex_state;
2253 PL_sublex_info.sub_inwhat = (U16)op_type;
2254 PL_sublex_info.sub_op = PL_lex_op;
2255 PL_lex_state = LEX_INTERPPUSH;
2259 pl_yylval.opval = PL_lex_op;
2269 * Create a new scope to save the lexing state. The scope will be
2270 * ended in S_sublex_done. Returns a '(', starting the function arguments
2271 * to the uc, lc, etc. found before.
2272 * Sets PL_lex_state to LEX_INTERPCONCAT.
2281 PL_lex_state = PL_sublex_info.super_state;
2282 SAVEBOOL(PL_lex_dojoin);
2283 SAVEI32(PL_lex_brackets);
2284 SAVEI32(PL_lex_casemods);
2285 SAVEI32(PL_lex_starts);
2286 SAVEI8(PL_lex_state);
2287 SAVEVPTR(PL_lex_inpat);
2288 SAVEI16(PL_lex_inwhat);
2289 SAVECOPLINE(PL_curcop);
2290 SAVEPPTR(PL_bufptr);
2291 SAVEPPTR(PL_bufend);
2292 SAVEPPTR(PL_oldbufptr);
2293 SAVEPPTR(PL_oldoldbufptr);
2294 SAVEPPTR(PL_last_lop);
2295 SAVEPPTR(PL_last_uni);
2296 SAVEPPTR(PL_linestart);
2297 SAVESPTR(PL_linestr);
2298 SAVEGENERICPV(PL_lex_brackstack);
2299 SAVEGENERICPV(PL_lex_casestack);
2301 PL_linestr = PL_lex_stuff;
2302 PL_lex_stuff = NULL;
2304 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
2305 = SvPVX(PL_linestr);
2306 PL_bufend += SvCUR(PL_linestr);
2307 PL_last_lop = PL_last_uni = NULL;
2308 SAVEFREESV(PL_linestr);
2310 PL_lex_dojoin = FALSE;
2311 PL_lex_brackets = 0;
2312 Newx(PL_lex_brackstack, 120, char);
2313 Newx(PL_lex_casestack, 12, char);
2314 PL_lex_casemods = 0;
2315 *PL_lex_casestack = '\0';
2317 PL_lex_state = LEX_INTERPCONCAT;
2318 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
2320 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
2321 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
2322 PL_lex_inpat = PL_sublex_info.sub_op;
2324 PL_lex_inpat = NULL;
2331 * Restores lexer state after a S_sublex_push.
2338 if (!PL_lex_starts++) {
2339 SV * const sv = newSVpvs("");
2340 if (SvUTF8(PL_linestr))
2342 PL_expect = XOPERATOR;
2343 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
2347 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
2348 PL_lex_state = LEX_INTERPCASEMOD;
2352 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
2353 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
2354 PL_linestr = PL_lex_repl;
2356 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
2357 PL_bufend += SvCUR(PL_linestr);
2358 PL_last_lop = PL_last_uni = NULL;
2359 SAVEFREESV(PL_linestr);
2360 PL_lex_dojoin = FALSE;
2361 PL_lex_brackets = 0;
2362 PL_lex_casemods = 0;
2363 *PL_lex_casestack = '\0';
2365 if (SvEVALED(PL_lex_repl)) {
2366 PL_lex_state = LEX_INTERPNORMAL;
2368 /* we don't clear PL_lex_repl here, so that we can check later
2369 whether this is an evalled subst; that means we rely on the
2370 logic to ensure sublex_done() is called again only via the
2371 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
2374 PL_lex_state = LEX_INTERPCONCAT;
2384 PL_endwhite = newSVpvs("");
2385 sv_catsv(PL_endwhite, PL_thiswhite);
2389 sv_setpvs(PL_thistoken,"");
2391 PL_realtokenstart = -1;
2395 PL_bufend = SvPVX(PL_linestr);
2396 PL_bufend += SvCUR(PL_linestr);
2397 PL_expect = XOPERATOR;
2398 PL_sublex_info.sub_inwhat = 0;
2406 Extracts a pattern, double-quoted string, or transliteration. This
2409 It looks at PL_lex_inwhat and PL_lex_inpat to find out whether it's
2410 processing a pattern (PL_lex_inpat is true), a transliteration
2411 (PL_lex_inwhat == OP_TRANS is true), or a double-quoted string.
2413 Returns a pointer to the character scanned up to. If this is
2414 advanced from the start pointer supplied (i.e. if anything was
2415 successfully parsed), will leave an OP for the substring scanned
2416 in pl_yylval. Caller must intuit reason for not parsing further
2417 by looking at the next characters herself.
2421 double-quoted style: \r and \n
2422 regexp special ones: \D \s
2425 case and quoting: \U \Q \E
2426 stops on @ and $, but not for $ as tail anchor
2428 In transliterations:
2429 characters are VERY literal, except for - not at the start or end
2430 of the string, which indicates a range. If the range is in bytes,
2431 scan_const expands the range to the full set of intermediate
2432 characters. If the range is in utf8, the hyphen is replaced with
2433 a certain range mark which will be handled by pmtrans() in op.c.
2435 In double-quoted strings:
2437 double-quoted style: \r and \n
2439 deprecated backrefs: \1 (in substitution replacements)
2440 case and quoting: \U \Q \E
2443 scan_const does *not* construct ops to handle interpolated strings.
2444 It stops processing as soon as it finds an embedded $ or @ variable
2445 and leaves it to the caller to work out what's going on.
2447 embedded arrays (whether in pattern or not) could be:
2448 @foo, @::foo, @'foo, @{foo}, @$foo, @+, @-.
2450 $ in double-quoted strings must be the symbol of an embedded scalar.
2452 $ in pattern could be $foo or could be tail anchor. Assumption:
2453 it's a tail anchor if $ is the last thing in the string, or if it's
2454 followed by one of "()| \r\n\t"
2456 \1 (backreferences) are turned into $1
2458 The structure of the code is
2459 while (there's a character to process) {
2460 handle transliteration ranges
2461 skip regexp comments /(?#comment)/ and codes /(?{code})/
2462 skip #-initiated comments in //x patterns
2463 check for embedded arrays
2464 check for embedded scalars
2466 leave intact backslashes from leaveit (below)
2467 deprecate \1 in substitution replacements
2468 handle string-changing backslashes \l \U \Q \E, etc.
2469 switch (what was escaped) {
2470 handle \- in a transliteration (becomes a literal -)
2471 handle \132 (octal characters)
2472 handle \x15 and \x{1234} (hex characters)
2473 handle \N{name} (named characters)
2474 handle \cV (control characters)
2475 handle printf-style backslashes (\f, \r, \n, etc)
2478 } (end if backslash)
2479 handle regular character
2480 } (end while character to read)
2485 S_scan_const(pTHX_ char *start)
2488 register char *send = PL_bufend; /* end of the constant */
2489 SV *sv = newSV(send - start); /* sv for the constant. See
2490 note below on sizing. */
2491 register char *s = start; /* start of the constant */
2492 register char *d = SvPVX(sv); /* destination for copies */
2493 bool dorange = FALSE; /* are we in a translit range? */
2494 bool didrange = FALSE; /* did we just finish a range? */
2495 I32 has_utf8 = FALSE; /* Output constant is UTF8 */
2496 I32 this_utf8 = UTF; /* Is the source string assumed
2497 to be UTF8? But, this can
2498 show as true when the source
2499 isn't utf8, as for example
2500 when it is entirely composed
2503 /* Note on sizing: The scanned constant is placed into sv, which is
2504 * initialized by newSV() assuming one byte of output for every byte of
2505 * input. This routine expects newSV() to allocate an extra byte for a
2506 * trailing NUL, which this routine will append if it gets to the end of
2507 * the input. There may be more bytes of input than output (eg., \N{LATIN
2508 * CAPITAL LETTER A}), or more output than input if the constant ends up
2509 * recoded to utf8, but each time a construct is found that might increase
2510 * the needed size, SvGROW() is called. Its size parameter each time is
2511 * based on the best guess estimate at the time, namely the length used so
2512 * far, plus the length the current construct will occupy, plus room for
2513 * the trailing NUL, plus one byte for every input byte still unscanned */
2517 UV literal_endpoint = 0;
2518 bool native_range = TRUE; /* turned to FALSE if the first endpoint is Unicode. */
2521 PERL_ARGS_ASSERT_SCAN_CONST;
2523 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
2524 /* If we are doing a trans and we know we want UTF8 set expectation */
2525 has_utf8 = PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF);
2526 this_utf8 = PL_sublex_info.sub_op->op_private & (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
2530 while (s < send || dorange) {
2531 /* get transliterations out of the way (they're most literal) */
2532 if (PL_lex_inwhat == OP_TRANS) {
2533 /* expand a range A-Z to the full set of characters. AIE! */
2535 I32 i; /* current expanded character */
2536 I32 min; /* first character in range */
2537 I32 max; /* last character in range */
2548 char * const c = (char*)utf8_hop((U8*)d, -1);
2552 *c = (char)UTF_TO_NATIVE(0xff);
2553 /* mark the range as done, and continue */
2559 i = d - SvPVX_const(sv); /* remember current offset */
2562 SvLEN(sv) + (has_utf8 ?
2563 (512 - UTF_CONTINUATION_MARK +
2566 /* How many two-byte within 0..255: 128 in UTF-8,
2567 * 96 in UTF-8-mod. */
2569 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
2571 d = SvPVX(sv) + i; /* refresh d after realloc */
2575 for (j = 0; j <= 1; j++) {
2576 char * const c = (char*)utf8_hop((U8*)d, -1);
2577 const UV uv = utf8n_to_uvchr((U8*)c, d - c, NULL, 0);
2583 max = (U8)0xff; /* only to \xff */
2584 uvmax = uv; /* \x{100} to uvmax */
2586 d = c; /* eat endpoint chars */
2591 d -= 2; /* eat the first char and the - */
2592 min = (U8)*d; /* first char in range */
2593 max = (U8)d[1]; /* last char in range */
2600 "Invalid range \"%c-%c\" in transliteration operator",
2601 (char)min, (char)max);
2605 if (literal_endpoint == 2 &&
2606 ((isLOWER(min) && isLOWER(max)) ||
2607 (isUPPER(min) && isUPPER(max)))) {
2609 for (i = min; i <= max; i++)
2611 *d++ = NATIVE_TO_NEED(has_utf8,i);
2613 for (i = min; i <= max; i++)
2615 *d++ = NATIVE_TO_NEED(has_utf8,i);
2620 for (i = min; i <= max; i++)
2623 const U8 ch = (U8)NATIVE_TO_UTF(i);
2624 if (UNI_IS_INVARIANT(ch))
2627 *d++ = (U8)UTF8_EIGHT_BIT_HI(ch);
2628 *d++ = (U8)UTF8_EIGHT_BIT_LO(ch);
2637 d = (char*)uvchr_to_utf8((U8*)d, 0x100);
2639 *d++ = (char)UTF_TO_NATIVE(0xff);
2641 d = (char*)uvchr_to_utf8((U8*)d, uvmax);
2645 /* mark the range as done, and continue */
2649 literal_endpoint = 0;
2654 /* range begins (ignore - as first or last char) */
2655 else if (*s == '-' && s+1 < send && s != start) {
2657 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
2664 *d++ = (char)UTF_TO_NATIVE(0xff); /* use illegal utf8 byte--see pmtrans */
2674 literal_endpoint = 0;
2675 native_range = TRUE;
2680 /* if we get here, we're not doing a transliteration */
2682 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
2683 except for the last char, which will be done separately. */
2684 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
2686 while (s+1 < send && *s != ')')
2687 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
2689 else if (s[2] == '{' /* This should match regcomp.c */
2690 || (s[2] == '?' && s[3] == '{'))
2693 char *regparse = s + (s[2] == '{' ? 3 : 4);
2696 while (count && (c = *regparse)) {
2697 if (c == '\\' && regparse[1])
2705 if (*regparse != ')')
2706 regparse--; /* Leave one char for continuation. */
2707 while (s < regparse)
2708 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
2712 /* likewise skip #-initiated comments in //x patterns */
2713 else if (*s == '#' && PL_lex_inpat &&
2714 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
2715 while (s+1 < send && *s != '\n')
2716 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
2719 /* check for embedded arrays
2720 (@foo, @::foo, @'foo, @{foo}, @$foo, @+, @-)
2722 else if (*s == '@' && s[1]) {
2723 if (isALNUM_lazy_if(s+1,UTF))
2725 if (strchr(":'{$", s[1]))
2727 if (!PL_lex_inpat && (s[1] == '+' || s[1] == '-'))
2728 break; /* in regexp, neither @+ nor @- are interpolated */
2731 /* check for embedded scalars. only stop if we're sure it's a
2734 else if (*s == '$') {
2735 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
2737 if (s + 1 < send && !strchr("()| \r\n\t", s[1])) {
2739 Perl_ck_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
2740 "Possible unintended interpolation of $\\ in regex");
2742 break; /* in regexp, $ might be tail anchor */
2746 /* End of else if chain - OP_TRANS rejoin rest */
2749 if (*s == '\\' && s+1 < send) {
2752 /* deprecate \1 in strings and substitution replacements */
2753 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
2754 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
2756 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "\\%c better written as $%c", *s, *s);
2761 /* string-change backslash escapes */
2762 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
2766 /* skip any other backslash escapes in a pattern */
2767 else if (PL_lex_inpat) {
2768 *d++ = NATIVE_TO_NEED(has_utf8,'\\');
2769 goto default_action;
2772 /* if we get here, it's either a quoted -, or a digit */
2775 /* quoted - in transliterations */
2777 if (PL_lex_inwhat == OP_TRANS) {
2784 if ((isALPHA(*s) || isDIGIT(*s)))
2785 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
2786 "Unrecognized escape \\%c passed through",
2788 /* default action is to copy the quoted character */
2789 goto default_action;
2792 /* eg. \132 indicates the octal constant 0x132 */
2793 case '0': case '1': case '2': case '3':
2794 case '4': case '5': case '6': case '7':
2798 uv = NATIVE_TO_UNI(grok_oct(s, &len, &flags, NULL));
2801 goto NUM_ESCAPE_INSERT;
2803 /* eg. \x24 indicates the hex constant 0x24 */
2807 char* const e = strchr(s, '}');
2808 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
2809 PERL_SCAN_DISALLOW_PREFIX;
2814 yyerror("Missing right brace on \\x{}");
2818 uv = NATIVE_TO_UNI(grok_hex(s, &len, &flags, NULL));
2824 I32 flags = PERL_SCAN_DISALLOW_PREFIX;
2825 uv = NATIVE_TO_UNI(grok_hex(s, &len, &flags, NULL));
2831 /* Insert oct, hex, or \N{U+...} escaped character. There will
2832 * always be enough room in sv since such escapes will be
2833 * longer than any UTF-8 sequence they can end up as, except if
2834 * they force us to recode the rest of the string into utf8 */
2836 /* Here uv is the ordinal of the next character being added in
2837 * unicode (converted from native). (It has to be done before
2838 * here because \N is interpreted as unicode, and oct and hex
2840 if (!UNI_IS_INVARIANT(uv)) {
2841 if (!has_utf8 && uv > 255) {
2842 /* Might need to recode whatever we have accumulated so
2843 * far if it contains any chars variant in utf8 or
2846 SvCUR_set(sv, d - SvPVX_const(sv));
2849 /* See Note on sizing above. */
2850 sv_utf8_upgrade_flags_grow(sv,
2851 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
2852 UNISKIP(uv) + (STRLEN)(send - s) + 1);
2853 d = SvPVX(sv) + SvCUR(sv);
2858 d = (char*)uvuni_to_utf8((U8*)d, uv);
2859 if (PL_lex_inwhat == OP_TRANS &&
2860 PL_sublex_info.sub_op) {
2861 PL_sublex_info.sub_op->op_private |=
2862 (PL_lex_repl ? OPpTRANS_FROM_UTF
2866 if (uv > 255 && !dorange)
2867 native_range = FALSE;
2879 /* \N{LATIN SMALL LETTER A} is a named character, and so is
2884 char* e = strchr(s, '}');
2890 yyerror("Missing right brace on \\N{}");
2894 if (e > s + 2 && s[1] == 'U' && s[2] == '+') {
2895 /* \N{U+...} The ... is a unicode value even on EBCDIC
2897 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES |
2898 PERL_SCAN_DISALLOW_PREFIX;
2901 uv = grok_hex(s, &len, &flags, NULL);
2902 if ( e > s && len != (STRLEN)(e - s) ) {
2906 goto NUM_ESCAPE_INSERT;
2908 res = newSVpvn(s + 1, e - s - 1);
2909 res = new_constant( NULL, 0, "charnames",
2910 res, NULL, s - 2, e - s + 3 );
2912 sv_utf8_upgrade(res);
2913 str = SvPV_const(res,len);
2914 #ifdef EBCDIC_NEVER_MIND
2915 /* charnames uses pack U and that has been
2916 * recently changed to do the below uni->native
2917 * mapping, so this would be redundant (and wrong,
2918 * the code point would be doubly converted).
2919 * But leave this in just in case the pack U change
2920 * gets revoked, but the semantics is still
2921 * desireable for charnames. --jhi */
2923 UV uv = utf8_to_uvchr((const U8*)str, 0);
2926 U8 tmpbuf[UTF8_MAXBYTES+1], *d;
2928 d = uvchr_to_utf8(tmpbuf, UNI_TO_NATIVE(uv));
2929 sv_setpvn(res, (char *)tmpbuf, d - tmpbuf);
2930 str = SvPV_const(res, len);
2934 /* If destination is not in utf8 but this new character is,
2935 * recode the dest to utf8 */
2936 if (!has_utf8 && SvUTF8(res)) {
2937 SvCUR_set(sv, d - SvPVX_const(sv));
2940 /* See Note on sizing above. */
2941 sv_utf8_upgrade_flags_grow(sv,
2942 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
2943 len + (STRLEN)(send - s) + 1);
2944 d = SvPVX(sv) + SvCUR(sv);
2946 } else if (len > (STRLEN)(e - s + 4)) { /* I _guess_ 4 is \N{} --jhi */
2948 /* See Note on sizing above. (NOTE: SvCUR() is not set
2949 * correctly here). */
2950 const STRLEN off = d - SvPVX_const(sv);
2951 d = SvGROW(sv, off + len + (STRLEN)(send - s) + 1) + off;
2955 native_range = FALSE; /* \N{} is guessed to be Unicode */
2957 Copy(str, d, len, char);
2964 yyerror("Missing braces on \\N{}");
2967 /* \c is a control character */
2976 *d++ = NATIVE_TO_NEED(has_utf8,toCTRL(c));
2979 yyerror("Missing control char name in \\c");
2983 /* printf-style backslashes, formfeeds, newlines, etc */
2985 *d++ = NATIVE_TO_NEED(has_utf8,'\b');
2988 *d++ = NATIVE_TO_NEED(has_utf8,'\n');
2991 *d++ = NATIVE_TO_NEED(has_utf8,'\r');
2994 *d++ = NATIVE_TO_NEED(has_utf8,'\f');
2997 *d++ = NATIVE_TO_NEED(has_utf8,'\t');
3000 *d++ = ASCII_TO_NEED(has_utf8,'\033');
3003 *d++ = ASCII_TO_NEED(has_utf8,'\007');
3009 } /* end if (backslash) */
3016 /* If we started with encoded form, or already know we want it,
3017 then encode the next character */
3018 if (! NATIVE_IS_INVARIANT((U8)(*s)) && (this_utf8 || has_utf8)) {
3022 /* One might think that it is wasted effort in the case of the
3023 * source being utf8 (this_utf8 == TRUE) to take the next character
3024 * in the source, convert it to an unsigned value, and then convert
3025 * it back again. But the source has not been validated here. The
3026 * routine that does the conversion checks for errors like
3029 const UV nextuv = (this_utf8) ? utf8n_to_uvchr((U8*)s, send - s, &len, 0) : (UV) ((U8) *s);
3030 const STRLEN need = UNISKIP(NATIVE_TO_UNI(nextuv));
3032 SvCUR_set(sv, d - SvPVX_const(sv));
3035 /* See Note on sizing above. */
3036 sv_utf8_upgrade_flags_grow(sv,
3037 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
3038 need + (STRLEN)(send - s) + 1);
3039 d = SvPVX(sv) + SvCUR(sv);
3041 } else if (need > len) {
3042 /* encoded value larger than old, may need extra space (NOTE:
3043 * SvCUR() is not set correctly here). See Note on sizing
3045 const STRLEN off = d - SvPVX_const(sv);
3046 d = SvGROW(sv, off + need + (STRLEN)(send - s) + 1) + off;
3050 d = (char*)uvchr_to_utf8((U8*)d, nextuv);
3052 if (uv > 255 && !dorange)
3053 native_range = FALSE;
3057 *d++ = NATIVE_TO_NEED(has_utf8,*s++);
3059 } /* while loop to process each character */
3061 /* terminate the string and set up the sv */
3063 SvCUR_set(sv, d - SvPVX_const(sv));
3064 if (SvCUR(sv) >= SvLEN(sv))
3065 Perl_croak(aTHX_ "panic: constant overflowed allocated space");
3068 if (PL_encoding && !has_utf8) {
3069 sv_recode_to_utf8(sv, PL_encoding);
3075 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
3076 PL_sublex_info.sub_op->op_private |=
3077 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
3081 /* shrink the sv if we allocated more than we used */
3082 if (SvCUR(sv) + 5 < SvLEN(sv)) {
3083 SvPV_shrink_to_cur(sv);
3086 /* return the substring (via pl_yylval) only if we parsed anything */
3087 if (s > PL_bufptr) {
3088 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) ) {
3089 const char *const key = PL_lex_inpat ? "qr" : "q";
3090 const STRLEN keylen = PL_lex_inpat ? 2 : 1;
3094 if (PL_lex_inwhat == OP_TRANS) {
3097 } else if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat) {
3105 sv = S_new_constant(aTHX_ start, s - start, key, keylen, sv, NULL,
3108 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3115 * Returns TRUE if there's more to the expression (e.g., a subscript),
3118 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
3120 * ->[ and ->{ return TRUE
3121 * { and [ outside a pattern are always subscripts, so return TRUE
3122 * if we're outside a pattern and it's not { or [, then return FALSE
3123 * if we're in a pattern and the first char is a {
3124 * {4,5} (any digits around the comma) returns FALSE
3125 * if we're in a pattern and the first char is a [
3127 * [SOMETHING] has a funky algorithm to decide whether it's a
3128 * character class or not. It has to deal with things like
3129 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
3130 * anything else returns TRUE
3133 /* This is the one truly awful dwimmer necessary to conflate C and sed. */
3136 S_intuit_more(pTHX_ register char *s)
3140 PERL_ARGS_ASSERT_INTUIT_MORE;
3142 if (PL_lex_brackets)
3144 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
3146 if (*s != '{' && *s != '[')
3151 /* In a pattern, so maybe we have {n,m}. */
3168 /* On the other hand, maybe we have a character class */
3171 if (*s == ']' || *s == '^')
3174 /* this is terrifying, and it works */
3175 int weight = 2; /* let's weigh the evidence */
3177 unsigned char un_char = 255, last_un_char;
3178 const char * const send = strchr(s,']');
3179 char tmpbuf[sizeof PL_tokenbuf * 4];
3181 if (!send) /* has to be an expression */
3184 Zero(seen,256,char);
3187 else if (isDIGIT(*s)) {
3189 if (isDIGIT(s[1]) && s[2] == ']')
3195 for (; s < send; s++) {
3196 last_un_char = un_char;
3197 un_char = (unsigned char)*s;
3202 weight -= seen[un_char] * 10;
3203 if (isALNUM_lazy_if(s+1,UTF)) {
3205 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
3206 len = (int)strlen(tmpbuf);
3207 if (len > 1 && gv_fetchpvn_flags(tmpbuf, len, 0, SVt_PV))
3212 else if (*s == '$' && s[1] &&
3213 strchr("[#!%*<>()-=",s[1])) {
3214 if (/*{*/ strchr("])} =",s[2]))
3223 if (strchr("wds]",s[1]))
3225 else if (seen[(U8)'\''] || seen[(U8)'"'])
3227 else if (strchr("rnftbxcav",s[1]))
3229 else if (isDIGIT(s[1])) {
3231 while (s[1] && isDIGIT(s[1]))
3241 if (strchr("aA01! ",last_un_char))
3243 if (strchr("zZ79~",s[1]))
3245 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
3246 weight -= 5; /* cope with negative subscript */
3249 if (!isALNUM(last_un_char)
3250 && !(last_un_char == '$' || last_un_char == '@'
3251 || last_un_char == '&')
3252 && isALPHA(*s) && s[1] && isALPHA(s[1])) {
3257 if (keyword(tmpbuf, d - tmpbuf, 0))
3260 if (un_char == last_un_char + 1)
3262 weight -= seen[un_char];
3267 if (weight >= 0) /* probably a character class */
3277 * Does all the checking to disambiguate
3279 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
3280 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
3282 * First argument is the stuff after the first token, e.g. "bar".
3284 * Not a method if bar is a filehandle.
3285 * Not a method if foo is a subroutine prototyped to take a filehandle.
3286 * Not a method if it's really "Foo $bar"
3287 * Method if it's "foo $bar"
3288 * Not a method if it's really "print foo $bar"
3289 * Method if it's really "foo package::" (interpreted as package->foo)
3290 * Not a method if bar is known to be a subroutine ("sub bar; foo bar")
3291 * Not a method if bar is a filehandle or package, but is quoted with
3296 S_intuit_method(pTHX_ char *start, GV *gv, CV *cv)
3299 char *s = start + (*start == '$');
3300 char tmpbuf[sizeof PL_tokenbuf];
3307 PERL_ARGS_ASSERT_INTUIT_METHOD;
3310 if (SvTYPE(gv) == SVt_PVGV && GvIO(gv))
3314 const char *proto = SvPVX_const(cv);
3325 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
3326 /* start is the beginning of the possible filehandle/object,
3327 * and s is the end of it
3328 * tmpbuf is a copy of it
3331 if (*start == '$') {
3332 if (gv || PL_last_lop_op == OP_PRINT || PL_last_lop_op == OP_SAY ||
3333 isUPPER(*PL_tokenbuf))
3336 len = start - SvPVX(PL_linestr);
3340 start = SvPVX(PL_linestr) + len;
3344 return *s == '(' ? FUNCMETH : METHOD;
3346 if (!keyword(tmpbuf, len, 0)) {
3347 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
3351 soff = s - SvPVX(PL_linestr);
3355 indirgv = gv_fetchpvn_flags(tmpbuf, len, 0, SVt_PVCV);
3356 if (indirgv && GvCVu(indirgv))
3358 /* filehandle or package name makes it a method */
3359 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, 0)) {
3361 soff = s - SvPVX(PL_linestr);
3364 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
3365 return 0; /* no assumptions -- "=>" quotes bearword */
3367 start_force(PL_curforce);
3368 NEXTVAL_NEXTTOKE.opval = (OP*)newSVOP(OP_CONST, 0,
3369 S_newSV_maybe_utf8(aTHX_ tmpbuf, len));
3370 NEXTVAL_NEXTTOKE.opval->op_private = OPpCONST_BARE;
3372 curmad('X', newSVpvn(start,SvPVX(PL_linestr) + soff - start));
3377 PL_bufptr = SvPVX(PL_linestr) + soff; /* restart before space */
3379 return *s == '(' ? FUNCMETH : METHOD;
3385 /* Encoded script support. filter_add() effectively inserts a
3386 * 'pre-processing' function into the current source input stream.
3387 * Note that the filter function only applies to the current source file
3388 * (e.g., it will not affect files 'require'd or 'use'd by this one).
3390 * The datasv parameter (which may be NULL) can be used to pass
3391 * private data to this instance of the filter. The filter function
3392 * can recover the SV using the FILTER_DATA macro and use it to
3393 * store private buffers and state information.
3395 * The supplied datasv parameter is upgraded to a PVIO type
3396 * and the IoDIRP/IoANY field is used to store the function pointer,
3397 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
3398 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
3399 * private use must be set using malloc'd pointers.
3403 Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
3412 if (!PL_rsfp_filters)
3413 PL_rsfp_filters = newAV();
3416 SvUPGRADE(datasv, SVt_PVIO);
3417 IoANY(datasv) = FPTR2DPTR(void *, funcp); /* stash funcp into spare field */
3418 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
3419 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
3420 FPTR2DPTR(void *, IoANY(datasv)),
3421 SvPV_nolen(datasv)));
3422 av_unshift(PL_rsfp_filters, 1);
3423 av_store(PL_rsfp_filters, 0, datasv) ;
3428 /* Delete most recently added instance of this filter function. */
3430 Perl_filter_del(pTHX_ filter_t funcp)
3435 PERL_ARGS_ASSERT_FILTER_DEL;
3438 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p",
3439 FPTR2DPTR(void*, funcp)));
3441 if (!PL_parser || !PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
3443 /* if filter is on top of stack (usual case) just pop it off */
3444 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
3445 if (IoANY(datasv) == FPTR2DPTR(void *, funcp)) {
3446 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
3447 IoANY(datasv) = (void *)NULL;
3448 sv_free(av_pop(PL_rsfp_filters));
3452 /* we need to search for the correct entry and clear it */
3453 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
3457 /* Invoke the idxth filter function for the current rsfp. */
3458 /* maxlen 0 = read one text line */
3460 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
3465 /* This API is bad. It should have been using unsigned int for maxlen.
3466 Not sure if we want to change the API, but if not we should sanity
3467 check the value here. */
3468 const unsigned int correct_length
3477 PERL_ARGS_ASSERT_FILTER_READ;
3479 if (!PL_parser || !PL_rsfp_filters)
3481 if (idx > AvFILLp(PL_rsfp_filters)) { /* Any more filters? */
3482 /* Provide a default input filter to make life easy. */
3483 /* Note that we append to the line. This is handy. */
3484 DEBUG_P(PerlIO_printf(Perl_debug_log,
3485 "filter_read %d: from rsfp\n", idx));
3486 if (correct_length) {
3489 const int old_len = SvCUR(buf_sv);
3491 /* ensure buf_sv is large enough */
3492 SvGROW(buf_sv, (STRLEN)(old_len + correct_length + 1)) ;
3493 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len,
3494 correct_length)) <= 0) {
3495 if (PerlIO_error(PL_rsfp))
3496 return -1; /* error */
3498 return 0 ; /* end of file */
3500 SvCUR_set(buf_sv, old_len + len) ;
3501 SvPVX(buf_sv)[old_len + len] = '\0';
3504 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
3505 if (PerlIO_error(PL_rsfp))
3506 return -1; /* error */
3508 return 0 ; /* end of file */
3511 return SvCUR(buf_sv);
3513 /* Skip this filter slot if filter has been deleted */
3514 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef) {
3515 DEBUG_P(PerlIO_printf(Perl_debug_log,
3516 "filter_read %d: skipped (filter deleted)\n",
3518 return FILTER_READ(idx+1, buf_sv, correct_length); /* recurse */
3520 /* Get function pointer hidden within datasv */
3521 funcp = DPTR2FPTR(filter_t, IoANY(datasv));
3522 DEBUG_P(PerlIO_printf(Perl_debug_log,
3523 "filter_read %d: via function %p (%s)\n",
3524 idx, (void*)datasv, SvPV_nolen_const(datasv)));
3525 /* Call function. The function is expected to */
3526 /* call "FILTER_READ(idx+1, buf_sv)" first. */
3527 /* Return: <0:error, =0:eof, >0:not eof */
3528 return (*funcp)(aTHX_ idx, buf_sv, correct_length);
3532 S_filter_gets(pTHX_ register SV *sv, STRLEN append)
3536 PERL_ARGS_ASSERT_FILTER_GETS;
3538 #ifdef PERL_CR_FILTER
3539 if (!PL_rsfp_filters) {
3540 filter_add(S_cr_textfilter,NULL);
3543 if (PL_rsfp_filters) {
3545 SvCUR_set(sv, 0); /* start with empty line */
3546 if (FILTER_READ(0, sv, 0) > 0)
3547 return ( SvPVX(sv) ) ;
3552 return (sv_gets(sv, PL_rsfp, append));
3556 S_find_in_my_stash(pTHX_ const char *pkgname, STRLEN len)
3561 PERL_ARGS_ASSERT_FIND_IN_MY_STASH;
3563 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
3567 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
3568 (gv = gv_fetchpvn_flags(pkgname, len, 0, SVt_PVHV)))
3570 return GvHV(gv); /* Foo:: */
3573 /* use constant CLASS => 'MyClass' */
3574 gv = gv_fetchpvn_flags(pkgname, len, 0, SVt_PVCV);
3575 if (gv && GvCV(gv)) {
3576 SV * const sv = cv_const_sv(GvCV(gv));
3578 pkgname = SvPV_const(sv, len);
3581 return gv_stashpvn(pkgname, len, 0);
3585 * S_readpipe_override
3586 * Check whether readpipe() is overriden, and generates the appropriate
3587 * optree, provided sublex_start() is called afterwards.
3590 S_readpipe_override(pTHX)
3593 GV *gv_readpipe = gv_fetchpvs("readpipe", GV_NOTQUAL, SVt_PVCV);
3594 pl_yylval.ival = OP_BACKTICK;
3596 && GvCVu(gv_readpipe) && GvIMPORTED_CV(gv_readpipe))
3598 ((gvp = (GV**)hv_fetchs(PL_globalstash, "readpipe", FALSE))
3599 && (gv_readpipe = *gvp) && isGV_with_GP(gv_readpipe)
3600 && GvCVu(gv_readpipe) && GvIMPORTED_CV(gv_readpipe)))
3602 PL_lex_op = (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
3603 append_elem(OP_LIST,
3604 newSVOP(OP_CONST, 0, &PL_sv_undef), /* value will be read later */
3605 newCVREF(0, newGVOP(OP_GV, 0, gv_readpipe))));
3612 * The intent of this yylex wrapper is to minimize the changes to the
3613 * tokener when we aren't interested in collecting madprops. It remains
3614 * to be seen how successful this strategy will be...
3621 char *s = PL_bufptr;
3623 /* make sure PL_thiswhite is initialized */
3627 /* just do what yylex would do on pending identifier; leave PL_thiswhite alone */
3628 if (PL_pending_ident)
3629 return S_pending_ident(aTHX);
3631 /* previous token ate up our whitespace? */
3632 if (!PL_lasttoke && PL_nextwhite) {
3633 PL_thiswhite = PL_nextwhite;
3637 /* isolate the token, and figure out where it is without whitespace */
3638 PL_realtokenstart = -1;
3642 assert(PL_curforce < 0);
3644 if (!PL_thismad || PL_thismad->mad_key == '^') { /* not forced already? */
3645 if (!PL_thistoken) {
3646 if (PL_realtokenstart < 0 || !CopLINE(PL_curcop))
3647 PL_thistoken = newSVpvs("");
3649 char * const tstart = SvPVX(PL_linestr) + PL_realtokenstart;
3650 PL_thistoken = newSVpvn(tstart, s - tstart);
3653 if (PL_thismad) /* install head */
3654 CURMAD('X', PL_thistoken);
3657 /* last whitespace of a sublex? */
3658 if (optype == ')' && PL_endwhite) {
3659 CURMAD('X', PL_endwhite);
3664 /* if no whitespace and we're at EOF, bail. Otherwise fake EOF below. */
3665 if (!PL_thiswhite && !PL_endwhite && !optype) {
3666 sv_free(PL_thistoken);
3671 /* put off final whitespace till peg */
3672 if (optype == ';' && !PL_rsfp) {
3673 PL_nextwhite = PL_thiswhite;
3676 else if (PL_thisopen) {
3677 CURMAD('q', PL_thisopen);
3679 sv_free(PL_thistoken);
3683 /* Store actual token text as madprop X */
3684 CURMAD('X', PL_thistoken);
3688 /* add preceding whitespace as madprop _ */
3689 CURMAD('_', PL_thiswhite);
3693 /* add quoted material as madprop = */
3694 CURMAD('=', PL_thisstuff);
3698 /* add terminating quote as madprop Q */
3699 CURMAD('Q', PL_thisclose);
3703 /* special processing based on optype */
3707 /* opval doesn't need a TOKEN since it can already store mp */
3717 if (pl_yylval.opval)
3718 append_madprops(PL_thismad, pl_yylval.opval, 0);
3726 addmad(newMADsv('p', PL_endwhite), &PL_thismad, 0);
3735 /* remember any fake bracket that lexer is about to discard */
3736 if (PL_lex_brackets == 1 &&
3737 ((expectation)PL_lex_brackstack[0] & XFAKEBRACK))
3740 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
3743 PL_thiswhite = newSVpvn(PL_bufptr, ++s - PL_bufptr);
3744 addmad(newMADsv('#', PL_thiswhite), &PL_thismad, 0);
3747 break; /* don't bother looking for trailing comment */
3756 /* attach a trailing comment to its statement instead of next token */
3760 if (PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == optype) {
3762 while (s < PL_bufend && (*s == ' ' || *s == '\t'))
3764 if (*s == '\n' || *s == '#') {
3765 while (s < PL_bufend && *s != '\n')
3769 PL_thiswhite = newSVpvn(PL_bufptr, s - PL_bufptr);
3770 addmad(newMADsv('#', PL_thiswhite), &PL_thismad, 0);
3787 /* Create new token struct. Note: opvals return early above. */
3788 pl_yylval.tkval = newTOKEN(optype, pl_yylval, PL_thismad);
3795 S_tokenize_use(pTHX_ int is_use, char *s) {
3798 PERL_ARGS_ASSERT_TOKENIZE_USE;
3800 if (PL_expect != XSTATE)
3801 yyerror(Perl_form(aTHX_ "\"%s\" not allowed in expression",
3802 is_use ? "use" : "no"));
3804 if (isDIGIT(*s) || (*s == 'v' && isDIGIT(s[1]))) {
3805 s = force_version(s, TRUE);
3806 if (*s == ';' || *s == '}'
3807 || (s = SKIPSPACE1(s), (*s == ';' || *s == '}'))) {
3808 start_force(PL_curforce);
3809 NEXTVAL_NEXTTOKE.opval = NULL;
3812 else if (*s == 'v') {
3813 s = force_word(s,WORD,FALSE,TRUE,FALSE);
3814 s = force_version(s, FALSE);
3818 s = force_word(s,WORD,FALSE,TRUE,FALSE);
3819 s = force_version(s, FALSE);
3821 pl_yylval.ival = is_use;
3825 static const char* const exp_name[] =
3826 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
3827 "ATTRTERM", "TERMBLOCK", "TERMORDORDOR"
3834 Works out what to call the token just pulled out of the input
3835 stream. The yacc parser takes care of taking the ops we return and
3836 stitching them into a tree.
3842 if read an identifier
3843 if we're in a my declaration
3844 croak if they tried to say my($foo::bar)
3845 build the ops for a my() declaration
3846 if it's an access to a my() variable
3847 are we in a sort block?
3848 croak if my($a); $a <=> $b
3849 build ops for access to a my() variable
3850 if in a dq string, and they've said @foo and we can't find @foo
3852 build ops for a bareword
3853 if we already built the token before, use it.
3858 #pragma segment Perl_yylex
3864 register char *s = PL_bufptr;
3870 /* orig_keyword, gvp, and gv are initialized here because
3871 * jump to the label just_a_word_zero can bypass their
3872 * initialization later. */
3873 I32 orig_keyword = 0;
3878 SV* tmp = newSVpvs("");
3879 PerlIO_printf(Perl_debug_log, "### %"IVdf":LEX_%s/X%s %s\n",
3880 (IV)CopLINE(PL_curcop),
3881 lex_state_names[PL_lex_state],
3882 exp_name[PL_expect],
3883 pv_display(tmp, s, strlen(s), 0, 60));
3886 /* check if there's an identifier for us to look at */
3887 if (PL_pending_ident)
3888 return REPORT(S_pending_ident(aTHX));
3890 /* no identifier pending identification */
3892 switch (PL_lex_state) {
3894 case LEX_NORMAL: /* Some compilers will produce faster */
3895 case LEX_INTERPNORMAL: /* code if we comment these out. */
3899 /* when we've already built the next token, just pull it out of the queue */
3903 pl_yylval = PL_nexttoke[PL_lasttoke].next_val;
3905 PL_thismad = PL_nexttoke[PL_lasttoke].next_mad;
3906 PL_nexttoke[PL_lasttoke].next_mad = 0;
3907 if (PL_thismad && PL_thismad->mad_key == '_') {
3908 PL_thiswhite = MUTABLE_SV(PL_thismad->mad_val);
3909 PL_thismad->mad_val = 0;
3910 mad_free(PL_thismad);
3915 PL_lex_state = PL_lex_defer;
3916 PL_expect = PL_lex_expect;
3917 PL_lex_defer = LEX_NORMAL;
3918 if (!PL_nexttoke[PL_lasttoke].next_type)
3923 pl_yylval = PL_nextval[PL_nexttoke];
3925 PL_lex_state = PL_lex_defer;
3926 PL_expect = PL_lex_expect;
3927 PL_lex_defer = LEX_NORMAL;
3931 /* FIXME - can these be merged? */
3932 return(PL_nexttoke[PL_lasttoke].next_type);
3934 return REPORT(PL_nexttype[PL_nexttoke]);
3937 /* interpolated case modifiers like \L \U, including \Q and \E.
3938 when we get here, PL_bufptr is at the \
3940 case LEX_INTERPCASEMOD:
3942 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
3943 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
3945 /* handle \E or end of string */
3946 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
3948 if (PL_lex_casemods) {
3949 const char oldmod = PL_lex_casestack[--PL_lex_casemods];
3950 PL_lex_casestack[PL_lex_casemods] = '\0';
3952 if (PL_bufptr != PL_bufend
3953 && (oldmod == 'L' || oldmod == 'U' || oldmod == 'Q')) {
3955 PL_lex_state = LEX_INTERPCONCAT;
3958 PL_thistoken = newSVpvs("\\E");
3964 while (PL_bufptr != PL_bufend &&
3965 PL_bufptr[0] == '\\' && PL_bufptr[1] == 'E') {
3967 PL_thiswhite = newSVpvs("");
3968 sv_catpvn(PL_thiswhite, PL_bufptr, 2);
3972 if (PL_bufptr != PL_bufend)
3975 PL_lex_state = LEX_INTERPCONCAT;
3979 DEBUG_T({ PerlIO_printf(Perl_debug_log,
3980 "### Saw case modifier\n"); });
3982 if (s[1] == '\\' && s[2] == 'E') {
3985 PL_thiswhite = newSVpvs("");
3986 sv_catpvn(PL_thiswhite, PL_bufptr, 4);
3989 PL_lex_state = LEX_INTERPCONCAT;
3994 if (!PL_madskills) /* when just compiling don't need correct */
3995 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
3996 tmp = *s, *s = s[2], s[2] = (char)tmp; /* misordered... */
3997 if ((*s == 'L' || *s == 'U') &&
3998 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U'))) {
3999 PL_lex_casestack[--PL_lex_casemods] = '\0';
4002 if (PL_lex_casemods > 10)
4003 Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
4004 PL_lex_casestack[PL_lex_casemods++] = *s;
4005 PL_lex_casestack[PL_lex_casemods] = '\0';
4006 PL_lex_state = LEX_INTERPCONCAT;
4007 start_force(PL_curforce);
4008 NEXTVAL_NEXTTOKE.ival = 0;
4010 start_force(PL_curforce);
4012 NEXTVAL_NEXTTOKE.ival = OP_LCFIRST;
4014 NEXTVAL_NEXTTOKE.ival = OP_UCFIRST;
4016 NEXTVAL_NEXTTOKE.ival = OP_LC;
4018 NEXTVAL_NEXTTOKE.ival = OP_UC;
4020 NEXTVAL_NEXTTOKE.ival = OP_QUOTEMETA;
4022 Perl_croak(aTHX_ "panic: yylex");
4024 SV* const tmpsv = newSVpvs("\\ ");
4025 /* replace the space with the character we want to escape
4027 SvPVX(tmpsv)[1] = *s;
4033 if (PL_lex_starts) {
4039 sv_free(PL_thistoken);
4040 PL_thistoken = newSVpvs("");
4043 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4044 if (PL_lex_casemods == 1 && PL_lex_inpat)
4053 case LEX_INTERPPUSH:
4054 return REPORT(sublex_push());
4056 case LEX_INTERPSTART:
4057 if (PL_bufptr == PL_bufend)
4058 return REPORT(sublex_done());
4059 DEBUG_T({ PerlIO_printf(Perl_debug_log,
4060 "### Interpolated variable\n"); });
4062 PL_lex_dojoin = (*PL_bufptr == '@');
4063 PL_lex_state = LEX_INTERPNORMAL;
4064 if (PL_lex_dojoin) {
4065 start_force(PL_curforce);
4066 NEXTVAL_NEXTTOKE.ival = 0;
4068 start_force(PL_curforce);
4069 force_ident("\"", '$');
4070 start_force(PL_curforce);
4071 NEXTVAL_NEXTTOKE.ival = 0;
4073 start_force(PL_curforce);
4074 NEXTVAL_NEXTTOKE.ival = 0;
4076 start_force(PL_curforce);
4077 NEXTVAL_NEXTTOKE.ival = OP_JOIN; /* emulate join($", ...) */
4080 if (PL_lex_starts++) {
4085 sv_free(PL_thistoken);
4086 PL_thistoken = newSVpvs("");
4089 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4090 if (!PL_lex_casemods && PL_lex_inpat)
4097 case LEX_INTERPENDMAYBE:
4098 if (intuit_more(PL_bufptr)) {
4099 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
4105 if (PL_lex_dojoin) {
4106 PL_lex_dojoin = FALSE;
4107 PL_lex_state = LEX_INTERPCONCAT;
4111 sv_free(PL_thistoken);
4112 PL_thistoken = newSVpvs("");
4117 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
4118 && SvEVALED(PL_lex_repl))
4120 if (PL_bufptr != PL_bufend)
4121 Perl_croak(aTHX_ "Bad evalled substitution pattern");
4125 case LEX_INTERPCONCAT:
4127 if (PL_lex_brackets)
4128 Perl_croak(aTHX_ "panic: INTERPCONCAT");
4130 if (PL_bufptr == PL_bufend)
4131 return REPORT(sublex_done());
4133 if (SvIVX(PL_linestr) == '\'') {
4134 SV *sv = newSVsv(PL_linestr);
4137 else if ( PL_hints & HINT_NEW_RE )
4138 sv = new_constant(NULL, 0, "qr", sv, sv, "q", 1);
4139 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
4143 s = scan_const(PL_bufptr);
4145 PL_lex_state = LEX_INTERPCASEMOD;
4147 PL_lex_state = LEX_INTERPSTART;
4150 if (s != PL_bufptr) {
4151 start_force(PL_curforce);
4153 curmad('X', newSVpvn(PL_bufptr,s-PL_bufptr));
4155 NEXTVAL_NEXTTOKE = pl_yylval;
4158 if (PL_lex_starts++) {
4162 sv_free(PL_thistoken);
4163 PL_thistoken = newSVpvs("");
4166 /* commas only at base level: /$a\Ub$c/ => ($a,uc(b.$c)) */
4167 if (!PL_lex_casemods && PL_lex_inpat)
4180 PL_lex_state = LEX_NORMAL;
4181 s = scan_formline(PL_bufptr);
4182 if (!PL_lex_formbrack)
4188 PL_oldoldbufptr = PL_oldbufptr;
4194 sv_free(PL_thistoken);
4197 PL_realtokenstart = s - SvPVX(PL_linestr); /* assume but undo on ws */
4201 if (isIDFIRST_lazy_if(s,UTF))
4204 unsigned char c = *s;
4205 len = UTF ? Perl_utf8_length(aTHX_ (U8 *) PL_linestart, (U8 *) s) : (STRLEN) (s - PL_linestart);
4206 if (len > UNRECOGNIZED_PRECEDE_COUNT) {
4207 d = UTF ? (char *) Perl_utf8_hop(aTHX_ (U8 *) s, -UNRECOGNIZED_PRECEDE_COUNT) : s - UNRECOGNIZED_PRECEDE_COUNT;
4212 Perl_croak(aTHX_ "Unrecognized character \\x%02X; marked by <-- HERE after %s<-- HERE near column %d", c, d, (int) len + 1);
4216 goto fake_eof; /* emulate EOF on ^D or ^Z */
4225 if (PL_lex_brackets) {
4226 yyerror((const char *)
4228 ? "Format not terminated"
4229 : "Missing right curly or square bracket"));
4231 DEBUG_T( { PerlIO_printf(Perl_debug_log,
4232 "### Tokener got EOF\n");
4236 if (s++ < PL_bufend)
4237 goto retry; /* ignore stray nulls */
4240 if (!PL_in_eval && !PL_preambled) {
4241 PL_preambled = TRUE;
4247 /* Generate a string of Perl code to load the debugger.
4248 * If PERL5DB is set, it will return the contents of that,
4249 * otherwise a compile-time require of perl5db.pl. */
4251 const char * const pdb = PerlEnv_getenv("PERL5DB");
4254 sv_setpv(PL_linestr, pdb);
4255 sv_catpvs(PL_linestr,";");
4257 SETERRNO(0,SS_NORMAL);
4258 sv_setpvs(PL_linestr, "BEGIN { require 'perl5db.pl' };");
4261 sv_setpvs(PL_linestr,"");
4262 if (PL_preambleav) {
4263 SV **svp = AvARRAY(PL_preambleav);
4264 SV **const end = svp + AvFILLp(PL_preambleav);
4266 sv_catsv(PL_linestr, *svp);
4268 sv_catpvs(PL_linestr, ";");
4270 sv_free(MUTABLE_SV(PL_preambleav));
4271 PL_preambleav = NULL;
4274 sv_catpvs(PL_linestr,
4275 "use feature ':5." STRINGIFY(PERL_VERSION) "';");
4276 if (PL_minus_n || PL_minus_p) {
4277 sv_catpvs(PL_linestr, "LINE: while (<>) {"/*}*/);
4279 sv_catpvs(PL_linestr,"chomp;");
4282 if ((*PL_splitstr == '/' || *PL_splitstr == '\''
4283 || *PL_splitstr == '"')
4284 && strchr(PL_splitstr + 1, *PL_splitstr))
4285 Perl_sv_catpvf(aTHX_ PL_linestr, "our @F=split(%s);", PL_splitstr);
4287 /* "q\0${splitstr}\0" is legal perl. Yes, even NUL
4288 bytes can be used as quoting characters. :-) */
4289 const char *splits = PL_splitstr;
4290 sv_catpvs(PL_linestr, "our @F=split(q\0");
4293 if (*splits == '\\')
4294 sv_catpvn(PL_linestr, splits, 1);
4295 sv_catpvn(PL_linestr, splits, 1);
4296 } while (*splits++);
4297 /* This loop will embed the trailing NUL of
4298 PL_linestr as the last thing it does before
4300 sv_catpvs(PL_linestr, ");");
4304 sv_catpvs(PL_linestr,"our @F=split(' ');");
4307 sv_catpvs(PL_linestr, "\n");
4308 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
4309 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4310 PL_last_lop = PL_last_uni = NULL;
4311 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash)
4312 update_debugger_info(PL_linestr, NULL, 0);
4317 bof = PL_rsfp ? TRUE : FALSE;
4320 fake_eof = LEX_FAKE_EOF;
4322 PL_bufptr = PL_bufend;
4323 CopLINE_inc(PL_curcop);
4324 if (!lex_next_chunk(fake_eof)) {
4325 CopLINE_dec(PL_curcop);
4327 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
4329 CopLINE_dec(PL_curcop);
4332 PL_realtokenstart = -1;
4335 /* If it looks like the start of a BOM or raw UTF-16,
4336 * check if it in fact is. */
4337 if (bof && PL_rsfp &&
4342 bof = PerlIO_tell(PL_rsfp) == (Off_t)SvCUR(PL_linestr);
4344 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4345 s = swallow_bom((U8*)s);
4349 /* Incest with pod. */
4352 sv_catsv(PL_thiswhite, PL_linestr);
4354 if (*s == '=' && strnEQ(s, "=cut", 4) && !isALPHA(s[4])) {
4355 sv_setpvs(PL_linestr, "");
4356 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
4357 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4358 PL_last_lop = PL_last_uni = NULL;
4359 PL_doextract = FALSE;
4364 } while (PL_doextract);
4365 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
4366 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4367 PL_last_lop = PL_last_uni = NULL;
4368 if (CopLINE(PL_curcop) == 1) {
4369 while (s < PL_bufend && isSPACE(*s))
4371 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
4375 PL_thiswhite = newSVpvn(PL_linestart, s - PL_linestart);
4379 if (*s == '#' && *(s+1) == '!')
4381 #ifdef ALTERNATE_SHEBANG
4383 static char const as[] = ALTERNATE_SHEBANG;
4384 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
4385 d = s + (sizeof(as) - 1);
4387 #endif /* ALTERNATE_SHEBANG */
4396 while (*d && !isSPACE(*d))
4400 #ifdef ARG_ZERO_IS_SCRIPT
4401 if (ipathend > ipath) {
4403 * HP-UX (at least) sets argv[0] to the script name,
4404 * which makes $^X incorrect. And Digital UNIX and Linux,
4405 * at least, set argv[0] to the basename of the Perl
4406 * interpreter. So, having found "#!", we'll set it right.
4408 SV * const x = GvSV(gv_fetchpvs("\030", GV_ADD|GV_NOTQUAL,
4410 assert(SvPOK(x) || SvGMAGICAL(x));
4411 if (sv_eq(x, CopFILESV(PL_curcop))) {
4412 sv_setpvn(x, ipath, ipathend - ipath);
4418 const char *bstart = SvPV_const(CopFILESV(PL_curcop),blen);
4419 const char * const lstart = SvPV_const(x,llen);
4421 bstart += blen - llen;
4422 if (strnEQ(bstart, lstart, llen) && bstart[-1] == '/') {
4423 sv_setpvn(x, ipath, ipathend - ipath);
4428 TAINT_NOT; /* $^X is always tainted, but that's OK */
4430 #endif /* ARG_ZERO_IS_SCRIPT */
4435 d = instr(s,"perl -");
4437 d = instr(s,"perl");
4439 /* avoid getting into infinite loops when shebang
4440 * line contains "Perl" rather than "perl" */
4442 for (d = ipathend-4; d >= ipath; --d) {
4443 if ((*d == 'p' || *d == 'P')
4444 && !ibcmp(d, "perl", 4))
4454 #ifdef ALTERNATE_SHEBANG
4456 * If the ALTERNATE_SHEBANG on this system starts with a
4457 * character that can be part of a Perl expression, then if
4458 * we see it but not "perl", we're probably looking at the
4459 * start of Perl code, not a request to hand off to some
4460 * other interpreter. Similarly, if "perl" is there, but
4461 * not in the first 'word' of the line, we assume the line
4462 * contains the start of the Perl program.
4464 if (d && *s != '#') {
4465 const char *c = ipath;
4466 while (*c && !strchr("; \t\r\n\f\v#", *c))
4469 d = NULL; /* "perl" not in first word; ignore */
4471 *s = '#'; /* Don't try to parse shebang line */
4473 #endif /* ALTERNATE_SHEBANG */
4478 !instr(s,"indir") &&
4479 instr(PL_origargv[0],"perl"))
4486 while (s < PL_bufend && isSPACE(*s))
4488 if (s < PL_bufend) {
4489 Newx(newargv,PL_origargc+3,char*);
4491 while (s < PL_bufend && !isSPACE(*s))
4494 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
4497 newargv = PL_origargv;
4500 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
4502 Perl_croak(aTHX_ "Can't exec %s", ipath);
4505 while (*d && !isSPACE(*d))
4507 while (SPACE_OR_TAB(*d))
4511 const bool switches_done = PL_doswitches;
4512 const U32 oldpdb = PL_perldb;
4513 const bool oldn = PL_minus_n;
4514 const bool oldp = PL_minus_p;
4518 bool baduni = FALSE;
4520 const char *d2 = d1 + 1;
4521 if (parse_unicode_opts((const char **)&d2)
4525 if (baduni || *d1 == 'M' || *d1 == 'm') {
4526 const char * const m = d1;
4527 while (*d1 && !isSPACE(*d1))
4529 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
4532 d1 = moreswitches(d1);
4534 if (PL_doswitches && !switches_done) {
4535 int argc = PL_origargc;
4536 char **argv = PL_origargv;
4539 } while (argc && argv[0][0] == '-' && argv[0][1]);
4540 init_argv_symbols(argc,argv);
4542 if (((PERLDB_LINE || PERLDB_SAVESRC) && !oldpdb) ||
4543 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
4544 /* if we have already added "LINE: while (<>) {",
4545 we must not do it again */
4547 sv_setpvs(PL_linestr, "");
4548 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
4549 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
4550 PL_last_lop = PL_last_uni = NULL;
4551 PL_preambled = FALSE;
4552 if (PERLDB_LINE || PERLDB_SAVESRC)
4553 (void)gv_fetchfile(PL_origfilename);
4560 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
4562 PL_lex_state = LEX_FORMLINE;
4567 #ifdef PERL_STRICT_CR
4568 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
4570 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
4572 case ' ': case '\t': case '\f': case 013:
4574 PL_realtokenstart = -1;
4576 PL_thiswhite = newSVpvs("");
4577 sv_catpvn(PL_thiswhite, s, 1);
4584 PL_realtokenstart = -1;
4588 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
4589 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
4590 /* handle eval qq[#line 1 "foo"\n ...] */
4591 CopLINE_dec(PL_curcop);
4594 if (PL_madskills && !PL_lex_formbrack && !PL_in_eval) {
4596 if (!PL_in_eval || PL_rsfp)
4601 while (d < PL_bufend && *d != '\n')
4605 else if (d > PL_bufend) /* Found by Ilya: feed random input to Perl. */
4606 Perl_croak(aTHX_ "panic: input overflow");
4609 PL_thiswhite = newSVpvn(s, d - s);
4614 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
4616 PL_lex_state = LEX_FORMLINE;
4622 if (PL_madskills && CopLINE(PL_curcop) >= 1 && !PL_lex_formbrack) {
4623 if (CopLINE(PL_curcop) == 1 && s[0] == '#' && s[1] == '!') {
4626 TOKEN(PEG); /* make sure any #! line is accessible */
4631 /* if (PL_madskills && PL_lex_formbrack) { */
4633 while (d < PL_bufend && *d != '\n')
4637 else if (d > PL_bufend) /* Found by Ilya: feed random input to Perl. */
4638 Perl_croak(aTHX_ "panic: input overflow");
4639 if (PL_madskills && CopLINE(PL_curcop) >= 1) {
4641 PL_thiswhite = newSVpvs("");
4642 if (CopLINE(PL_curcop) == 1) {
4643 sv_setpvs(PL_thiswhite, "");
4646 sv_catpvn(PL_thiswhite, s, d - s);
4660 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
4668 while (s < PL_bufend && SPACE_OR_TAB(*s))
4671 if (strnEQ(s,"=>",2)) {
4672 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
4673 DEBUG_T( { printbuf("### Saw unary minus before =>, forcing word %s\n", s); } );
4674 OPERATOR('-'); /* unary minus */
4676 PL_last_uni = PL_oldbufptr;
4678 case 'r': ftst = OP_FTEREAD; break;
4679 case 'w': ftst = OP_FTEWRITE; break;
4680 case 'x': ftst = OP_FTEEXEC; break;
4681 case 'o': ftst = OP_FTEOWNED; break;
4682 case 'R': ftst = OP_FTRREAD; break;
4683 case 'W': ftst = OP_FTRWRITE; break;
4684 case 'X': ftst = OP_FTREXEC; break;
4685 case 'O': ftst = OP_FTROWNED; break;
4686 case 'e': ftst = OP_FTIS; break;
4687 case 'z': ftst = OP_FTZERO; break;
4688 case 's': ftst = OP_FTSIZE; break;
4689 case 'f': ftst = OP_FTFILE; break;
4690 case 'd': ftst = OP_FTDIR; break;
4691 case 'l': ftst = OP_FTLINK; break;
4692 case 'p': ftst = OP_FTPIPE; break;
4693 case 'S': ftst = OP_FTSOCK; break;
4694 case 'u': ftst = OP_FTSUID; break;
4695 case 'g': ftst = OP_FTSGID; break;
4696 case 'k': ftst = OP_FTSVTX; break;
4697 case 'b': ftst = OP_FTBLK; break;
4698 case 'c': ftst = OP_FTCHR; break;
4699 case 't': ftst = OP_FTTTY; break;
4700 case 'T': ftst = OP_FTTEXT; break;
4701 case 'B': ftst = OP_FTBINARY; break;
4702 case 'M': case 'A': case 'C':
4703 gv_fetchpvs("\024", GV_ADD|GV_NOTQUAL, SVt_PV);
4705 case 'M': ftst = OP_FTMTIME; break;
4706 case 'A': ftst = OP_FTATIME; break;
4707 case 'C': ftst = OP_FTCTIME; break;
4715 PL_last_lop_op = (OPCODE)ftst;
4716 DEBUG_T( { PerlIO_printf(Perl_debug_log,
4717 "### Saw file test %c\n", (int)tmp);
4722 /* Assume it was a minus followed by a one-letter named
4723 * subroutine call (or a -bareword), then. */
4724 DEBUG_T( { PerlIO_printf(Perl_debug_log,
4725 "### '-%c' looked like a file test but was not\n",
4732 const char tmp = *s++;
4735 if (PL_expect == XOPERATOR)
4740 else if (*s == '>') {
4743 if (isIDFIRST_lazy_if(s,UTF)) {
4744 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
4752 if (PL_expect == XOPERATOR)
4755 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
4757 OPERATOR('-'); /* unary minus */
4763 const char tmp = *s++;
4766 if (PL_expect == XOPERATOR)
4771 if (PL_expect == XOPERATOR)
4774 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
4781 if (PL_expect != XOPERATOR) {
4782 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
4783 PL_expect = XOPERATOR;
4784 force_ident(PL_tokenbuf, '*');
4797 if (PL_expect == XOPERATOR) {
4801 PL_tokenbuf[0] = '%';
4802 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
4803 sizeof PL_tokenbuf - 1, FALSE);
4804 if (!PL_tokenbuf[1]) {
4807 PL_pending_ident = '%';
4816 const char tmp = *s++;
4821 && (PL_expect == XOPERATOR || PL_expect == XTERMORDORDOR))
4828 const char tmp = *s++;
4834 goto just_a_word_zero_gv;
4837 switch (PL_expect) {
4843 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
4845 PL_bufptr = s; /* update in case we back off */
4847 deprecate(":= for an empty attribute list");
4854 PL_expect = XTERMBLOCK;
4857 stuffstart = s - SvPVX(PL_linestr) - 1;
4861 while (isIDFIRST_lazy_if(s,UTF)) {
4864 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
4865 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len, 0))) {
4866 if (tmp < 0) tmp = -tmp;
4881 sv = newSVpvn(s, len);
4883 d = scan_str(d,TRUE,TRUE);
4885 /* MUST advance bufptr here to avoid bogus
4886 "at end of line" context messages from yyerror().
4888 PL_bufptr = s + len;
4889 yyerror("Unterminated attribute parameter in attribute list");
4893 return REPORT(0); /* EOF indicator */
4897 sv_catsv(sv, PL_lex_stuff);
4898 attrs = append_elem(OP_LIST, attrs,
4899 newSVOP(OP_CONST, 0, sv));
4900 SvREFCNT_dec(PL_lex_stuff);
4901 PL_lex_stuff = NULL;
4904 if (len == 6 && strnEQ(SvPVX(sv), "unique", len)) {
4906 if (PL_in_my == KEY_our) {
4907 deprecate(":unique");
4910 Perl_croak(aTHX_ "The 'unique' attribute may only be applied to 'our' variables");
4913 /* NOTE: any CV attrs applied here need to be part of
4914 the CVf_BUILTIN_ATTRS define in cv.h! */
4915 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "lvalue", len)) {
4917 CvLVALUE_on(PL_compcv);
4919 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "locked", len)) {
4921 deprecate(":locked");
4923 else if (!PL_in_my && len == 6 && strnEQ(SvPVX(sv), "method", len)) {
4925 CvMETHOD_on(PL_compcv);
4927 /* After we've set the flags, it could be argued that
4928 we don't need to do the attributes.pm-based setting
4929 process, and shouldn't bother appending recognized
4930 flags. To experiment with that, uncomment the
4931 following "else". (Note that's already been
4932 uncommented. That keeps the above-applied built-in
4933 attributes from being intercepted (and possibly
4934 rejected) by a package's attribute routines, but is
4935 justified by the performance win for the common case
4936 of applying only built-in attributes.) */
4938 attrs = append_elem(OP_LIST, attrs,
4939 newSVOP(OP_CONST, 0,
4943 if (*s == ':' && s[1] != ':')
4946 break; /* require real whitespace or :'s */
4947 /* XXX losing whitespace on sequential attributes here */
4951 = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
4952 if (*s != ';' && *s != '}' && *s != tmp
4953 && (tmp != '=' || *s != ')')) {
4954 const char q = ((*s == '\'') ? '"' : '\'');
4955 /* If here for an expression, and parsed no attrs, back
4957 if (tmp == '=' && !attrs) {
4961 /* MUST advance bufptr here to avoid bogus "at end of line"
4962 context messages from yyerror().
4965 yyerror( (const char *)
4967 ? Perl_form(aTHX_ "Invalid separator character "
4968 "%c%c%c in attribute list", q, *s, q)
4969 : "Unterminated attribute list" ) );
4977 start_force(PL_curforce);
4978 NEXTVAL_NEXTTOKE.opval = attrs;
4979 CURMAD('_', PL_nextwhite);
4984 PL_thistoken = newSVpvn(SvPVX(PL_linestr) + stuffstart,
4985 (s - SvPVX(PL_linestr)) - stuffstart);
4993 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
4994 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
5002 const char tmp = *s++;
5007 const char tmp = *s++;
5015 if (PL_lex_brackets <= 0)
5016 yyerror("Unmatched right square bracket");
5019 if (PL_lex_state == LEX_INTERPNORMAL) {
5020 if (PL_lex_brackets == 0) {
5021 if (*s == '-' && s[1] == '>')
5022 PL_lex_state = LEX_INTERPENDMAYBE;
5023 else if (*s != '[' && *s != '{')
5024 PL_lex_state = LEX_INTERPEND;
5031 if (PL_lex_brackets > 100) {
5032 Renew(PL_lex_brackstack, PL_lex_brackets + 10, char);
5034 switch (PL_expect) {
5036 if (PL_lex_formbrack) {
5040 if (PL_oldoldbufptr == PL_last_lop)
5041 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
5043 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5044 OPERATOR(HASHBRACK);
5046 while (s < PL_bufend && SPACE_OR_TAB(*s))
5049 PL_tokenbuf[0] = '\0';
5050 if (d < PL_bufend && *d == '-') {
5051 PL_tokenbuf[0] = '-';
5053 while (d < PL_bufend && SPACE_OR_TAB(*d))
5056 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
5057 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
5059 while (d < PL_bufend && SPACE_OR_TAB(*d))
5062 const char minus = (PL_tokenbuf[0] == '-');
5063 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
5071 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
5076 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5081 if (PL_oldoldbufptr == PL_last_lop)
5082 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
5084 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
5087 if (PL_expect == XREF && PL_lex_state == LEX_INTERPNORMAL) {
5089 /* This hack is to get the ${} in the message. */
5091 yyerror("syntax error");
5094 OPERATOR(HASHBRACK);
5096 /* This hack serves to disambiguate a pair of curlies
5097 * as being a block or an anon hash. Normally, expectation
5098 * determines that, but in cases where we're not in a
5099 * position to expect anything in particular (like inside
5100 * eval"") we have to resolve the ambiguity. This code
5101 * covers the case where the first term in the curlies is a
5102 * quoted string. Most other cases need to be explicitly
5103 * disambiguated by prepending a "+" before the opening
5104 * curly in order to force resolution as an anon hash.
5106 * XXX should probably propagate the outer expectation
5107 * into eval"" to rely less on this hack, but that could
5108 * potentially break current behavior of eval"".
5112 if (*s == '\'' || *s == '"' || *s == '`') {
5113 /* common case: get past first string, handling escapes */
5114 for (t++; t < PL_bufend && *t != *s;)
5115 if (*t++ == '\\' && (*t == '\\' || *t == *s))
5119 else if (*s == 'q') {
5122 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
5125 /* skip q//-like construct */
5127 char open, close, term;
5130 while (t < PL_bufend && isSPACE(*t))
5132 /* check for q => */
5133 if (t+1 < PL_bufend && t[0] == '=' && t[1] == '>') {
5134 OPERATOR(HASHBRACK);
5138 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
5142 for (t++; t < PL_bufend; t++) {
5143 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
5145 else if (*t == open)
5149 for (t++; t < PL_bufend; t++) {
5150 if (*t == '\\' && t+1 < PL_bufend)
5152 else if (*t == close && --brackets <= 0)
5154 else if (*t == open)
5161 /* skip plain q word */
5162 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
5165 else if (isALNUM_lazy_if(t,UTF)) {
5167 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
5170 while (t < PL_bufend && isSPACE(*t))
5172 /* if comma follows first term, call it an anon hash */
5173 /* XXX it could be a comma expression with loop modifiers */
5174 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
5175 || (*t == '=' && t[1] == '>')))
5176 OPERATOR(HASHBRACK);
5177 if (PL_expect == XREF)
5180 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
5186 pl_yylval.ival = CopLINE(PL_curcop);
5187 if (isSPACE(*s) || *s == '#')
5188 PL_copline = NOLINE; /* invalidate current command line number */
5193 if (PL_lex_brackets <= 0)
5194 yyerror("Unmatched right curly bracket");
5196 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
5197 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
5198 PL_lex_formbrack = 0;
5199 if (PL_lex_state == LEX_INTERPNORMAL) {
5200 if (PL_lex_brackets == 0) {
5201 if (PL_expect & XFAKEBRACK) {
5202 PL_expect &= XENUMMASK;
5203 PL_lex_state = LEX_INTERPEND;
5208 PL_thiswhite = newSVpvs("");
5209 sv_catpvs(PL_thiswhite,"}");
5212 return yylex(); /* ignore fake brackets */
5214 if (*s == '-' && s[1] == '>')
5215 PL_lex_state = LEX_INTERPENDMAYBE;
5216 else if (*s != '[' && *s != '{')
5217 PL_lex_state = LEX_INTERPEND;
5220 if (PL_expect & XFAKEBRACK) {
5221 PL_expect &= XENUMMASK;
5223 return yylex(); /* ignore fake brackets */
5225 start_force(PL_curforce);
5227 curmad('X', newSVpvn(s-1,1));
5228 CURMAD('_', PL_thiswhite);
5233 PL_thistoken = newSVpvs("");
5241 if (PL_expect == XOPERATOR) {
5242 if (PL_bufptr == PL_linestart && ckWARN(WARN_SEMICOLON)
5243 && isIDFIRST_lazy_if(s,UTF))
5245 CopLINE_dec(PL_curcop);
5246 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), "%s", PL_warn_nosemi);
5247 CopLINE_inc(PL_curcop);
5252 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
5254 PL_expect = XOPERATOR;
5255 force_ident(PL_tokenbuf, '&');
5259 pl_yylval.ival = (OPpENTERSUB_AMPER<<8);
5271 const char tmp = *s++;
5278 if (tmp && isSPACE(*s) && ckWARN(WARN_SYNTAX)
5279 && strchr("+-*/%.^&|<",tmp))
5280 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5281 "Reversed %c= operator",(int)tmp);
5283 if (PL_expect == XSTATE && isALPHA(tmp) &&
5284 (s == PL_linestart+1 || s[-2] == '\n') )
5286 if (PL_in_eval && !PL_rsfp) {
5291 if (strnEQ(s,"=cut",4)) {
5307 PL_thiswhite = newSVpvs("");
5308 sv_catpvn(PL_thiswhite, PL_linestart,
5309 PL_bufend - PL_linestart);
5313 PL_doextract = TRUE;
5317 if (PL_lex_brackets < PL_lex_formbrack) {
5319 #ifdef PERL_STRICT_CR
5320 while (SPACE_OR_TAB(*t))
5322 while (SPACE_OR_TAB(*t) || *t == '\r')
5325 if (*t == '\n' || *t == '#') {
5336 const char tmp = *s++;
5338 /* was this !=~ where !~ was meant?
5339 * warn on m:!=~\s+([/?]|[msy]\W|tr\W): */
5341 if (*s == '~' && ckWARN(WARN_SYNTAX)) {
5342 const char *t = s+1;
5344 while (t < PL_bufend && isSPACE(*t))
5347 if (*t == '/' || *t == '?' ||
5348 ((*t == 'm' || *t == 's' || *t == 'y')
5349 && !isALNUM(t[1])) ||
5350 (*t == 't' && t[1] == 'r' && !isALNUM(t[2])))
5351 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5352 "!=~ should be !~");
5362 if (PL_expect != XOPERATOR) {
5363 if (s[1] != '<' && !strchr(s,'>'))
5366 s = scan_heredoc(s);
5368 s = scan_inputsymbol(s);
5369 TERM(sublex_start());
5375 SHop(OP_LEFT_SHIFT);
5389 const char tmp = *s++;
5391 SHop(OP_RIGHT_SHIFT);
5392 else if (tmp == '=')
5401 if (PL_expect == XOPERATOR) {
5402 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
5403 return deprecate_commaless_var_list();
5407 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
5408 PL_tokenbuf[0] = '@';
5409 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
5410 sizeof PL_tokenbuf - 1, FALSE);
5411 if (PL_expect == XOPERATOR)
5412 no_op("Array length", s);
5413 if (!PL_tokenbuf[1])
5415 PL_expect = XOPERATOR;
5416 PL_pending_ident = '#';
5420 PL_tokenbuf[0] = '$';
5421 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
5422 sizeof PL_tokenbuf - 1, FALSE);
5423 if (PL_expect == XOPERATOR)
5425 if (!PL_tokenbuf[1]) {
5427 yyerror("Final $ should be \\$ or $name");
5431 /* This kludge not intended to be bulletproof. */
5432 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
5433 pl_yylval.opval = newSVOP(OP_CONST, 0,
5434 newSViv(CopARYBASE_get(&PL_compiling)));
5435 pl_yylval.opval->op_private = OPpCONST_ARYBASE;
5441 const char tmp = *s;
5442 if (PL_lex_state == LEX_NORMAL || PL_lex_brackets)
5445 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop)
5446 && intuit_more(s)) {
5448 PL_tokenbuf[0] = '@';
5449 if (ckWARN(WARN_SYNTAX)) {
5452 while (isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$')
5455 PL_bufptr = PEEKSPACE(PL_bufptr); /* XXX can realloc */
5456 while (t < PL_bufend && *t != ']')
5458 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5459 "Multidimensional syntax %.*s not supported",
5460 (int)((t - PL_bufptr) + 1), PL_bufptr);
5464 else if (*s == '{') {
5466 PL_tokenbuf[0] = '%';
5467 if (strEQ(PL_tokenbuf+1, "SIG") && ckWARN(WARN_SYNTAX)
5468 && (t = strchr(s, '}')) && (t = strchr(t, '=')))
5470 char tmpbuf[sizeof PL_tokenbuf];
5473 } while (isSPACE(*t));
5474 if (isIDFIRST_lazy_if(t,UTF)) {
5476 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE,
5480 if (*t == ';' && get_cvn_flags(tmpbuf, len, 0))
5481 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5482 "You need to quote \"%s\"",
5489 PL_expect = XOPERATOR;
5490 if (PL_lex_state == LEX_NORMAL && isSPACE((char)tmp)) {
5491 const bool islop = (PL_last_lop == PL_oldoldbufptr);
5492 if (!islop || PL_last_lop_op == OP_GREPSTART)
5493 PL_expect = XOPERATOR;
5494 else if (strchr("$@\"'`q", *s))
5495 PL_expect = XTERM; /* e.g. print $fh "foo" */
5496 else if (strchr("&*<%", *s) && isIDFIRST_lazy_if(s+1,UTF))
5497 PL_expect = XTERM; /* e.g. print $fh &sub */
5498 else if (isIDFIRST_lazy_if(s,UTF)) {
5499 char tmpbuf[sizeof PL_tokenbuf];
5501 scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
5502 if ((t2 = keyword(tmpbuf, len, 0))) {
5503 /* binary operators exclude handle interpretations */
5515 PL_expect = XTERM; /* e.g. print $fh length() */
5520 PL_expect = XTERM; /* e.g. print $fh subr() */
5523 else if (isDIGIT(*s))
5524 PL_expect = XTERM; /* e.g. print $fh 3 */
5525 else if (*s == '.' && isDIGIT(s[1]))
5526 PL_expect = XTERM; /* e.g. print $fh .3 */
5527 else if ((*s == '?' || *s == '-' || *s == '+')
5528 && !isSPACE(s[1]) && s[1] != '=')
5529 PL_expect = XTERM; /* e.g. print $fh -1 */
5530 else if (*s == '/' && !isSPACE(s[1]) && s[1] != '='
5532 PL_expect = XTERM; /* e.g. print $fh /.../
5533 XXX except DORDOR operator
5535 else if (*s == '<' && s[1] == '<' && !isSPACE(s[2])
5537 PL_expect = XTERM; /* print $fh <<"EOF" */
5540 PL_pending_ident = '$';
5544 if (PL_expect == XOPERATOR)
5546 PL_tokenbuf[0] = '@';
5547 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, FALSE);
5548 if (!PL_tokenbuf[1]) {
5551 if (PL_lex_state == LEX_NORMAL)
5553 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
5555 PL_tokenbuf[0] = '%';
5557 /* Warn about @ where they meant $. */
5558 if (*s == '[' || *s == '{') {
5559 if (ckWARN(WARN_SYNTAX)) {
5560 const char *t = s + 1;
5561 while (*t && (isALNUM_lazy_if(t,UTF) || strchr(" \t$#+-'\"", *t)))
5563 if (*t == '}' || *t == ']') {
5565 PL_bufptr = PEEKSPACE(PL_bufptr); /* XXX can realloc */
5566 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5567 "Scalar value %.*s better written as $%.*s",
5568 (int)(t-PL_bufptr), PL_bufptr,
5569 (int)(t-PL_bufptr-1), PL_bufptr+1);
5574 PL_pending_ident = '@';
5577 case '/': /* may be division, defined-or, or pattern */
5578 if (PL_expect == XTERMORDORDOR && s[1] == '/') {
5582 case '?': /* may either be conditional or pattern */
5583 if (PL_expect == XOPERATOR) {
5591 /* A // operator. */
5601 /* Disable warning on "study /blah/" */
5602 if (PL_oldoldbufptr == PL_last_uni
5603 && (*PL_last_uni != 's' || s - PL_last_uni < 5
5604 || memNE(PL_last_uni, "study", 5)
5605 || isALNUM_lazy_if(PL_last_uni+5,UTF)
5608 s = scan_pat(s,OP_MATCH);
5609 TERM(sublex_start());
5613 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack
5614 #ifdef PERL_STRICT_CR
5617 && (s[1] == '\n' || (s[1] == '\r' && s[2] == '\n'))
5619 && (s == PL_linestart || s[-1] == '\n') )
5621 PL_lex_formbrack = 0;
5625 if (PL_expect == XSTATE && s[1] == '.' && s[2] == '.') {
5629 if (PL_expect == XOPERATOR || !isDIGIT(s[1])) {
5635 pl_yylval.ival = OPf_SPECIAL;
5644 case '0': case '1': case '2': case '3': case '4':
5645 case '5': case '6': case '7': case '8': case '9':
5646 s = scan_num(s, &pl_yylval);
5647 DEBUG_T( { printbuf("### Saw number in %s\n", s); } );
5648 if (PL_expect == XOPERATOR)
5653 s = scan_str(s,!!PL_madskills,FALSE);
5654 DEBUG_T( { printbuf("### Saw string before %s\n", s); } );
5655 if (PL_expect == XOPERATOR) {
5656 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
5657 return deprecate_commaless_var_list();
5664 pl_yylval.ival = OP_CONST;
5665 TERM(sublex_start());
5668 s = scan_str(s,!!PL_madskills,FALSE);
5669 DEBUG_T( { printbuf("### Saw string before %s\n", s); } );
5670 if (PL_expect == XOPERATOR) {
5671 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
5672 return deprecate_commaless_var_list();
5679 pl_yylval.ival = OP_CONST;
5680 /* FIXME. I think that this can be const if char *d is replaced by
5681 more localised variables. */
5682 for (d = SvPV(PL_lex_stuff, len); len; len--, d++) {
5683 if (*d == '$' || *d == '@' || *d == '\\' || !UTF8_IS_INVARIANT((U8)*d)) {
5684 pl_yylval.ival = OP_STRINGIFY;
5688 TERM(sublex_start());
5691 s = scan_str(s,!!PL_madskills,FALSE);
5692 DEBUG_T( { printbuf("### Saw backtick string before %s\n", s); } );
5693 if (PL_expect == XOPERATOR)
5694 no_op("Backticks",s);
5697 readpipe_override();
5698 TERM(sublex_start());
5702 if (PL_lex_inwhat && isDIGIT(*s))
5703 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),"Can't use \\%c to mean $%c in expression",
5705 if (PL_expect == XOPERATOR)
5706 no_op("Backslash",s);
5710 if (isDIGIT(s[1]) && PL_expect != XOPERATOR) {
5711 char *start = s + 2;
5712 while (isDIGIT(*start) || *start == '_')
5714 if (*start == '.' && isDIGIT(start[1])) {
5715 s = scan_num(s, &pl_yylval);
5718 /* avoid v123abc() or $h{v1}, allow C<print v10;> */
5719 else if (!isALPHA(*start) && (PL_expect == XTERM
5720 || PL_expect == XREF || PL_expect == XSTATE
5721 || PL_expect == XTERMORDORDOR)) {
5722 GV *const gv = gv_fetchpvn_flags(s, start - s, 0, SVt_PVCV);
5724 s = scan_num(s, &pl_yylval);
5731 if (isDIGIT(s[1]) && PL_expect == XOPERATOR) {
5774 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
5776 /* Some keywords can be followed by any delimiter, including ':' */
5777 anydelim = ((len == 1 && strchr("msyq", PL_tokenbuf[0])) ||
5778 (len == 2 && ((PL_tokenbuf[0] == 't' && PL_tokenbuf[1] == 'r') ||
5779 (PL_tokenbuf[0] == 'q' &&
5780 strchr("qwxr", PL_tokenbuf[1])))));
5782 /* x::* is just a word, unless x is "CORE" */
5783 if (!anydelim && *s == ':' && s[1] == ':' && strNE(PL_tokenbuf, "CORE"))
5787 while (d < PL_bufend && isSPACE(*d))
5788 d++; /* no comments skipped here, or s### is misparsed */
5790 /* Is this a word before a => operator? */
5791 if (*d == '=' && d[1] == '>') {
5794 = (OP*)newSVOP(OP_CONST, 0,
5795 S_newSV_maybe_utf8(aTHX_ PL_tokenbuf, len));
5796 pl_yylval.opval->op_private = OPpCONST_BARE;
5800 /* Check for plugged-in keyword */
5804 char *saved_bufptr = PL_bufptr;
5806 result = CALL_FPTR(PL_keyword_plugin)(aTHX_ PL_tokenbuf, len, &o);
5808 if (result == KEYWORD_PLUGIN_DECLINE) {
5809 /* not a plugged-in keyword */
5810 PL_bufptr = saved_bufptr;
5811 } else if (result == KEYWORD_PLUGIN_STMT) {
5812 pl_yylval.opval = o;
5815 return REPORT(PLUGSTMT);
5816 } else if (result == KEYWORD_PLUGIN_EXPR) {
5817 pl_yylval.opval = o;
5819 PL_expect = XOPERATOR;
5820 return REPORT(PLUGEXPR);
5822 Perl_croak(aTHX_ "Bad plugin affecting keyword '%s'",
5827 /* Check for built-in keyword */
5828 tmp = keyword(PL_tokenbuf, len, 0);
5830 /* Is this a label? */
5831 if (!anydelim && PL_expect == XSTATE
5832 && d < PL_bufend && *d == ':' && *(d + 1) != ':') {
5834 Perl_croak(aTHX_ "Can't use keyword '%s' as a label", PL_tokenbuf);
5836 pl_yylval.pval = CopLABEL_alloc(PL_tokenbuf);
5841 if (tmp < 0) { /* second-class keyword? */
5842 GV *ogv = NULL; /* override (winner) */
5843 GV *hgv = NULL; /* hidden (loser) */
5844 if (PL_expect != XOPERATOR && (*s != ':' || s[1] != ':')) {
5846 if ((gv = gv_fetchpvn_flags(PL_tokenbuf, len, 0, SVt_PVCV)) &&
5849 if (GvIMPORTED_CV(gv))
5851 else if (! CvMETHOD(cv))
5855 (gvp = (GV**)hv_fetch(PL_globalstash,PL_tokenbuf,len,FALSE)) &&
5856 (gv = *gvp) && isGV_with_GP(gv) &&
5857 GvCVu(gv) && GvIMPORTED_CV(gv))
5864 tmp = 0; /* overridden by import or by GLOBAL */
5867 && -tmp==KEY_lock /* XXX generalizable kludge */
5870 tmp = 0; /* any sub overrides "weak" keyword */
5872 else { /* no override */
5874 if (tmp == KEY_dump) {
5875 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
5876 "dump() better written as CORE::dump()");
5880 if (hgv && tmp != KEY_x && tmp != KEY_CORE) /* never ambiguous */
5881 Perl_ck_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
5882 "Ambiguous call resolved as CORE::%s(), %s",
5883 GvENAME(hgv), "qualify as such or use &");
5890 default: /* not a keyword */
5891 /* Trade off - by using this evil construction we can pull the
5892 variable gv into the block labelled keylookup. If not, then
5893 we have to give it function scope so that the goto from the
5894 earlier ':' case doesn't bypass the initialisation. */
5896 just_a_word_zero_gv:
5904 const char lastchar = (PL_bufptr == PL_oldoldbufptr ? 0 : PL_bufptr[-1]);
5908 SV *nextPL_nextwhite = 0;
5912 /* Get the rest if it looks like a package qualifier */
5914 if (*s == '\'' || (*s == ':' && s[1] == ':')) {
5916 s = scan_word(s, PL_tokenbuf + len, sizeof PL_tokenbuf - len,
5919 Perl_croak(aTHX_ "Bad name after %s%s", PL_tokenbuf,
5920 *s == '\'' ? "'" : "::");
5925 if (PL_expect == XOPERATOR) {
5926 if (PL_bufptr == PL_linestart) {
5927 CopLINE_dec(PL_curcop);
5928 Perl_warner(aTHX_ packWARN(WARN_SEMICOLON), "%s", PL_warn_nosemi);
5929 CopLINE_inc(PL_curcop);
5932 no_op("Bareword",s);
5935 /* Look for a subroutine with this name in current package,
5936 unless name is "Foo::", in which case Foo is a bearword
5937 (and a package name). */
5939 if (len > 2 && !PL_madskills &&
5940 PL_tokenbuf[len - 2] == ':' && PL_tokenbuf[len - 1] == ':')
5942 if (ckWARN(WARN_BAREWORD)
5943 && ! gv_fetchpvn_flags(PL_tokenbuf, len, 0, SVt_PVHV))
5944 Perl_warner(aTHX_ packWARN(WARN_BAREWORD),
5945 "Bareword \"%s\" refers to nonexistent package",
5948 PL_tokenbuf[len] = '\0';
5954 /* Mustn't actually add anything to a symbol table.
5955 But also don't want to "initialise" any placeholder
5956 constants that might already be there into full
5957 blown PVGVs with attached PVCV. */
5958 gv = gv_fetchpvn_flags(PL_tokenbuf, len,
5959 GV_NOADD_NOINIT, SVt_PVCV);
5964 /* if we saw a global override before, get the right name */
5967 sv = newSVpvs("CORE::GLOBAL::");
5968 sv_catpv(sv,PL_tokenbuf);
5971 /* If len is 0, newSVpv does strlen(), which is correct.
5972 If len is non-zero, then it will be the true length,
5973 and so the scalar will be created correctly. */
5974 sv = newSVpv(PL_tokenbuf,len);
5977 if (PL_madskills && !PL_thistoken) {
5978 char *start = SvPVX(PL_linestr) + PL_realtokenstart;
5979 PL_thistoken = newSVpvn(start,s - start);
5980 PL_realtokenstart = s - SvPVX(PL_linestr);
5984 /* Presume this is going to be a bareword of some sort. */
5987 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
5988 pl_yylval.opval->op_private = OPpCONST_BARE;
5989 /* UTF-8 package name? */
5990 if (UTF && !IN_BYTES &&
5991 is_utf8_string((U8*)SvPVX_const(sv), SvCUR(sv)))
5994 /* And if "Foo::", then that's what it certainly is. */
6001 OP *const_op = newSVOP(OP_CONST, 0, SvREFCNT_inc(sv));
6002 const_op->op_private = OPpCONST_BARE;
6003 rv2cv_op = newCVREF(0, const_op);
6005 if (rv2cv_op->op_type == OP_RV2CV &&
6006 (rv2cv_op->op_flags & OPf_KIDS)) {
6007 OP *rv_op = cUNOPx(rv2cv_op)->op_first;
6008 switch (rv_op->op_type) {
6010 SV *sv = cSVOPx_sv(rv_op);
6011 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV)
6015 GV *gv = cGVOPx_gv(rv_op);
6016 CV *maybe_cv = GvCVu(gv);
6017 if (maybe_cv && SvTYPE((SV*)maybe_cv) == SVt_PVCV)
6023 /* See if it's the indirect object for a list operator. */
6025 if (PL_oldoldbufptr &&
6026 PL_oldoldbufptr < PL_bufptr &&
6027 (PL_oldoldbufptr == PL_last_lop
6028 || PL_oldoldbufptr == PL_last_uni) &&
6029 /* NO SKIPSPACE BEFORE HERE! */
6030 (PL_expect == XREF ||
6031 ((PL_opargs[PL_last_lop_op] >> OASHIFT)& 7) == OA_FILEREF))
6033 bool immediate_paren = *s == '(';
6035 /* (Now we can afford to cross potential line boundary.) */
6036 s = SKIPSPACE2(s,nextPL_nextwhite);
6038 PL_nextwhite = nextPL_nextwhite; /* assume no & deception */
6041 /* Two barewords in a row may indicate method call. */
6043 if ((isIDFIRST_lazy_if(s,UTF) || *s == '$') &&
6044 (tmp = intuit_method(s, gv, cv))) {
6049 /* If not a declared subroutine, it's an indirect object. */
6050 /* (But it's an indir obj regardless for sort.) */
6051 /* Also, if "_" follows a filetest operator, it's a bareword */
6054 ( !immediate_paren && (PL_last_lop_op == OP_SORT ||
6056 (PL_last_lop_op != OP_MAPSTART &&
6057 PL_last_lop_op != OP_GREPSTART))))
6058 || (PL_tokenbuf[0] == '_' && PL_tokenbuf[1] == '\0'
6059 && ((PL_opargs[PL_last_lop_op] & OA_CLASS_MASK) == OA_FILESTATOP))
6062 PL_expect = (PL_last_lop == PL_oldoldbufptr) ? XTERM : XOPERATOR;
6067 PL_expect = XOPERATOR;
6070 s = SKIPSPACE2(s,nextPL_nextwhite);
6071 PL_nextwhite = nextPL_nextwhite;
6076 /* Is this a word before a => operator? */
6077 if (*s == '=' && s[1] == '>' && !pkgname) {
6080 sv_setpv(((SVOP*)pl_yylval.opval)->op_sv, PL_tokenbuf);
6081 if (UTF && !IN_BYTES && is_utf8_string((U8*)PL_tokenbuf, len))
6082 SvUTF8_on(((SVOP*)pl_yylval.opval)->op_sv);
6086 /* If followed by a paren, it's certainly a subroutine. */
6091 while (SPACE_OR_TAB(*d))
6093 if (*d == ')' && (sv = cv_const_sv(cv))) {
6100 PL_nextwhite = PL_thiswhite;
6103 start_force(PL_curforce);
6105 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6106 PL_expect = XOPERATOR;
6109 PL_nextwhite = nextPL_nextwhite;
6110 curmad('X', PL_thistoken);
6111 PL_thistoken = newSVpvs("");
6120 /* If followed by var or block, call it a method (unless sub) */
6122 if ((*s == '$' || *s == '{') && !cv) {
6124 PL_last_lop = PL_oldbufptr;
6125 PL_last_lop_op = OP_METHOD;
6129 /* If followed by a bareword, see if it looks like indir obj. */
6132 && (isIDFIRST_lazy_if(s,UTF) || *s == '$')
6133 && (tmp = intuit_method(s, gv, cv))) {
6138 /* Not a method, so call it a subroutine (if defined) */
6141 if (lastchar == '-')
6142 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
6143 "Ambiguous use of -%s resolved as -&%s()",
6144 PL_tokenbuf, PL_tokenbuf);
6145 /* Check for a constant sub */
6146 if ((sv = cv_const_sv(cv))) {
6149 SvREFCNT_dec(((SVOP*)pl_yylval.opval)->op_sv);
6150 ((SVOP*)pl_yylval.opval)->op_sv = SvREFCNT_inc_simple(sv);
6151 pl_yylval.opval->op_private = 0;
6155 op_free(pl_yylval.opval);
6156 pl_yylval.opval = rv2cv_op;
6157 pl_yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
6158 PL_last_lop = PL_oldbufptr;
6159 PL_last_lop_op = OP_ENTERSUB;
6160 /* Is there a prototype? */
6168 const char *proto = SvPV_const(MUTABLE_SV(cv), protolen);
6171 if ((*proto == '$' || *proto == '_') && proto[1] == '\0')
6173 while (*proto == ';')
6175 if (*proto == '&' && *s == '{') {
6177 sv_setpvs(PL_subname, "__ANON__");
6179 sv_setpvs(PL_subname, "__ANON__::__ANON__");
6186 PL_nextwhite = PL_thiswhite;
6189 start_force(PL_curforce);
6190 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6193 PL_nextwhite = nextPL_nextwhite;
6194 curmad('X', PL_thistoken);
6195 PL_thistoken = newSVpvs("");
6202 /* Guess harder when madskills require "best effort". */
6203 if (PL_madskills && (!gv || !GvCVu(gv))) {
6204 int probable_sub = 0;
6205 if (strchr("\"'`$@%0123456789!*+{[<", *s))
6207 else if (isALPHA(*s)) {
6211 d = scan_word(d, tmpbuf, sizeof tmpbuf, TRUE, &tmplen);
6212 if (!keyword(tmpbuf, tmplen, 0))
6215 while (d < PL_bufend && isSPACE(*d))
6217 if (*d == '=' && d[1] == '>')
6222 gv = gv_fetchpv(PL_tokenbuf, GV_ADD, SVt_PVCV);
6223 op_free(pl_yylval.opval);
6224 pl_yylval.opval = rv2cv_op;
6225 pl_yylval.opval->op_private |= OPpENTERSUB_NOPAREN;
6226 PL_last_lop = PL_oldbufptr;
6227 PL_last_lop_op = OP_ENTERSUB;
6228 PL_nextwhite = PL_thiswhite;
6230 start_force(PL_curforce);
6231 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6233 PL_nextwhite = nextPL_nextwhite;
6234 curmad('X', PL_thistoken);
6235 PL_thistoken = newSVpvs("");
6240 NEXTVAL_NEXTTOKE.opval = pl_yylval.opval;
6247 /* Call it a bare word */
6249 if (PL_hints & HINT_STRICT_SUBS)
6250 pl_yylval.opval->op_private |= OPpCONST_STRICT;
6253 /* after "print" and similar functions (corresponding to
6254 * "F? L" in opcode.pl), whatever wasn't already parsed as
6255 * a filehandle should be subject to "strict subs".
6256 * Likewise for the optional indirect-object argument to system
6257 * or exec, which can't be a bareword */
6258 if ((PL_last_lop_op == OP_PRINT
6259 || PL_last_lop_op == OP_PRTF
6260 || PL_last_lop_op == OP_SAY
6261 || PL_last_lop_op == OP_SYSTEM
6262 || PL_last_lop_op == OP_EXEC)
6263 && (PL_hints & HINT_STRICT_SUBS))
6264 pl_yylval.opval->op_private |= OPpCONST_STRICT;
6265 if (lastchar != '-') {
6266 if (ckWARN(WARN_RESERVED)) {
6270 if (!*d && !gv_stashpv(PL_tokenbuf, 0))
6271 Perl_warner(aTHX_ packWARN(WARN_RESERVED), PL_warn_reserved,
6279 if ((lastchar == '*' || lastchar == '%' || lastchar == '&')) {
6280 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
6281 "Operator or semicolon missing before %c%s",
6282 lastchar, PL_tokenbuf);
6283 Perl_ck_warner_d(aTHX_ packWARN(WARN_AMBIGUOUS),
6284 "Ambiguous use of %c resolved as operator %c",
6285 lastchar, lastchar);
6291 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0,
6292 newSVpv(CopFILE(PL_curcop),0));
6296 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0,
6297 Perl_newSVpvf(aTHX_ "%"IVdf, (IV)CopLINE(PL_curcop)));
6300 case KEY___PACKAGE__:
6301 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0,
6303 ? newSVhek(HvNAME_HEK(PL_curstash))
6310 if (PL_rsfp && (!PL_in_eval || PL_tokenbuf[2] == 'D')) {
6311 const char *pname = "main";
6312 if (PL_tokenbuf[2] == 'D')
6313 pname = HvNAME_get(PL_curstash ? PL_curstash : PL_defstash);
6314 gv = gv_fetchpv(Perl_form(aTHX_ "%s::DATA", pname), GV_ADD,
6318 GvIOp(gv) = newIO();
6319 IoIFP(GvIOp(gv)) = PL_rsfp;
6320 #if defined(HAS_FCNTL) && defined(F_SETFD)
6322 const int fd = PerlIO_fileno(PL_rsfp);
6323 fcntl(fd,F_SETFD,fd >= 3);
6326 /* Mark this internal pseudo-handle as clean */
6327 IoFLAGS(GvIOp(gv)) |= IOf_UNTAINT;
6328 if ((PerlIO*)PL_rsfp == PerlIO_stdin())
6329 IoTYPE(GvIOp(gv)) = IoTYPE_STD;
6331 IoTYPE(GvIOp(gv)) = IoTYPE_RDONLY;
6332 #if defined(WIN32) && !defined(PERL_TEXTMODE_SCRIPTS)
6333 /* if the script was opened in binmode, we need to revert
6334 * it to text mode for compatibility; but only iff it has CRs
6335 * XXX this is a questionable hack at best. */
6336 if (PL_bufend-PL_bufptr > 2
6337 && PL_bufend[-1] == '\n' && PL_bufend[-2] == '\r')
6340 if (IoTYPE(GvIOp(gv)) == IoTYPE_RDONLY) {
6341 loc = PerlIO_tell(PL_rsfp);
6342 (void)PerlIO_seek(PL_rsfp, 0L, 0);
6345 if (PerlLIO_setmode(PL_rsfp, O_TEXT) != -1) {
6347 if (PerlLIO_setmode(PerlIO_fileno(PL_rsfp), O_TEXT) != -1) {
6348 #endif /* NETWARE */
6349 #ifdef PERLIO_IS_STDIO /* really? */
6350 # if defined(__BORLANDC__)
6351 /* XXX see note in do_binmode() */
6352 ((FILE*)PL_rsfp)->flags &= ~_F_BIN;
6356 PerlIO_seek(PL_rsfp, loc, 0);
6360 #ifdef PERLIO_LAYERS
6363 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL, ":utf8");
6364 else if (PL_encoding) {
6371 XPUSHs(PL_encoding);
6373 call_method("name", G_SCALAR);
6377 PerlIO_apply_layers(aTHX_ PL_rsfp, NULL,
6378 Perl_form(aTHX_ ":encoding(%"SVf")",
6387 if (PL_realtokenstart >= 0) {
6388 char *tstart = SvPVX(PL_linestr) + PL_realtokenstart;
6390 PL_endwhite = newSVpvs("");
6391 sv_catsv(PL_endwhite, PL_thiswhite);
6393 sv_catpvn(PL_endwhite, tstart, PL_bufend - tstart);
6394 PL_realtokenstart = -1;
6396 while ((s = filter_gets(PL_endwhite, SvCUR(PL_endwhite)))
6412 if (PL_expect == XSTATE) {
6419 if (*s == ':' && s[1] == ':') {
6422 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
6423 if (!(tmp = keyword(PL_tokenbuf, len, 0)))
6424 Perl_croak(aTHX_ "CORE::%s is not a keyword", PL_tokenbuf);
6427 else if (tmp == KEY_require || tmp == KEY_do)
6428 /* that's a way to remember we saw "CORE::" */
6441 LOP(OP_ACCEPT,XTERM);
6447 LOP(OP_ATAN2,XTERM);
6453 LOP(OP_BINMODE,XTERM);
6456 LOP(OP_BLESS,XTERM);
6465 /* When 'use switch' is in effect, continue has a dual
6466 life as a control operator. */
6468 if (!FEATURE_IS_ENABLED("switch"))
6471 /* We have to disambiguate the two senses of
6472 "continue". If the next token is a '{' then
6473 treat it as the start of a continue block;
6474 otherwise treat it as a control operator.
6486 (void)gv_fetchpvs("ENV", GV_ADD|GV_NOTQUAL, SVt_PVHV);
6503 if (!PL_cryptseen) {
6504 PL_cryptseen = TRUE;
6508 LOP(OP_CRYPT,XTERM);
6511 LOP(OP_CHMOD,XTERM);
6514 LOP(OP_CHOWN,XTERM);
6517 LOP(OP_CONNECT,XTERM);
6536 s = force_word(s,WORD,TRUE,TRUE,FALSE);
6537 if (orig_keyword == KEY_do) {
6546 PL_hints |= HINT_BLOCK_SCOPE;
6556 gv_fetchpvs("AnyDBM_File::ISA", GV_ADDMULTI, SVt_PVAV);
6557 LOP(OP_DBMOPEN,XTERM);
6563 s = force_word(s,WORD,TRUE,FALSE,FALSE);
6570 pl_yylval.ival = CopLINE(PL_curcop);
6586 if (*s == '{') { /* block eval */
6587 PL_expect = XTERMBLOCK;
6588 UNIBRACK(OP_ENTERTRY);
6590 else { /* string eval */
6592 UNIBRACK(OP_ENTEREVAL);
6607 case KEY_endhostent:
6613 case KEY_endservent:
6616 case KEY_endprotoent:
6627 pl_yylval.ival = CopLINE(PL_curcop);
6629 if (PL_expect == XSTATE && isIDFIRST_lazy_if(s,UTF)) {
6632 int soff = s - SvPVX(PL_linestr); /* for skipspace realloc */
6635 if ((PL_bufend - p) >= 3 &&
6636 strnEQ(p, "my", 2) && isSPACE(*(p + 2)))
6638 else if ((PL_bufend - p) >= 4 &&
6639 strnEQ(p, "our", 3) && isSPACE(*(p + 3)))
6642 if (isIDFIRST_lazy_if(p,UTF)) {
6643 p = scan_ident(p, PL_bufend,
6644 PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
6648 Perl_croak(aTHX_ "Missing $ on loop variable");
6650 s = SvPVX(PL_linestr) + soff;
6656 LOP(OP_FORMLINE,XTERM);
6662 LOP(OP_FCNTL,XTERM);
6668 LOP(OP_FLOCK,XTERM);
6677 LOP(OP_GREPSTART, XREF);
6680 s = force_word(s,WORD,TRUE,FALSE,FALSE);
6695 case KEY_getpriority:
6696 LOP(OP_GETPRIORITY,XTERM);
6698 case KEY_getprotobyname:
6701 case KEY_getprotobynumber:
6702 LOP(OP_GPBYNUMBER,XTERM);
6704 case KEY_getprotoent:
6716 case KEY_getpeername:
6717 UNI(OP_GETPEERNAME);
6719 case KEY_gethostbyname:
6722 case KEY_gethostbyaddr:
6723 LOP(OP_GHBYADDR,XTERM);
6725 case KEY_gethostent:
6728 case KEY_getnetbyname:
6731 case KEY_getnetbyaddr:
6732 LOP(OP_GNBYADDR,XTERM);
6737 case KEY_getservbyname:
6738 LOP(OP_GSBYNAME,XTERM);
6740 case KEY_getservbyport:
6741 LOP(OP_GSBYPORT,XTERM);
6743 case KEY_getservent:
6746 case KEY_getsockname:
6747 UNI(OP_GETSOCKNAME);
6749 case KEY_getsockopt:
6750 LOP(OP_GSOCKOPT,XTERM);
6765 pl_yylval.ival = CopLINE(PL_curcop);
6775 pl_yylval.ival = CopLINE(PL_curcop);
6779 LOP(OP_INDEX,XTERM);
6785 LOP(OP_IOCTL,XTERM);
6797 s = force_word(s,WORD,TRUE,FALSE,FALSE);
6829 LOP(OP_LISTEN,XTERM);
6838 s = scan_pat(s,OP_MATCH);
6839 TERM(sublex_start());
6842 LOP(OP_MAPSTART, XREF);
6845 LOP(OP_MKDIR,XTERM);
6848 LOP(OP_MSGCTL,XTERM);
6851 LOP(OP_MSGGET,XTERM);
6854 LOP(OP_MSGRCV,XTERM);
6857 LOP(OP_MSGSND,XTERM);
6862 PL_in_my = (U16)tmp;
6864 if (isIDFIRST_lazy_if(s,UTF)) {
6868 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, TRUE, &len);
6869 if (len == 3 && strnEQ(PL_tokenbuf, "sub", 3))
6871 PL_in_my_stash = find_in_my_stash(PL_tokenbuf, len);
6872 if (!PL_in_my_stash) {
6875 my_snprintf(tmpbuf, sizeof(tmpbuf), "No such class %.1000s", PL_tokenbuf);
6879 if (PL_madskills) { /* just add type to declarator token */
6880 sv_catsv(PL_thistoken, PL_nextwhite);
6882 sv_catpvn(PL_thistoken, start, s - start);
6890 s = force_word(s,WORD,TRUE,FALSE,FALSE);
6897 s = tokenize_use(0, s);
6901 if (*s == '(' || (s = SKIPSPACE1(s), *s == '('))
6908 if (isIDFIRST_lazy_if(s,UTF)) {
6910 for (d = s; isALNUM_lazy_if(d,UTF);)
6912 for (t=d; isSPACE(*t);)
6914 if ( *t && strchr("|&*+-=!?:.", *t) && ckWARN_d(WARN_PRECEDENCE)
6916 && !(t[0] == '=' && t[1] == '>')
6918 int parms_len = (int)(d-s);
6919 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6920 "Precedence problem: open %.*s should be open(%.*s)",
6921 parms_len, s, parms_len, s);
6927 pl_yylval.ival = OP_OR;
6937 LOP(OP_OPEN_DIR,XTERM);
6940 checkcomma(s,PL_tokenbuf,"filehandle");
6944 checkcomma(s,PL_tokenbuf,"filehandle");
6963 s = force_word(s,WORD,FALSE,TRUE,FALSE);
6964 s = force_version(s, FALSE);
6968 LOP(OP_PIPE_OP,XTERM);
6971 s = scan_str(s,!!PL_madskills,FALSE);
6974 pl_yylval.ival = OP_CONST;
6975 TERM(sublex_start());
6981 s = scan_str(s,!!PL_madskills,FALSE);
6984 PL_expect = XOPERATOR;
6986 if (SvCUR(PL_lex_stuff)) {
6989 d = SvPV_force(PL_lex_stuff, len);
6991 for (; isSPACE(*d) && len; --len, ++d)
6996 if (!warned && ckWARN(WARN_QW)) {
6997 for (; !isSPACE(*d) && len; --len, ++d) {
6999 Perl_warner(aTHX_ packWARN(WARN_QW),
7000 "Possible attempt to separate words with commas");
7003 else if (*d == '#') {
7004 Perl_warner(aTHX_ packWARN(WARN_QW),
7005 "Possible attempt to put comments in qw() list");
7011 for (; !isSPACE(*d) && len; --len, ++d)
7014 sv = newSVpvn_utf8(b, d-b, DO_UTF8(PL_lex_stuff));
7015 words = append_elem(OP_LIST, words,
7016 newSVOP(OP_CONST, 0, tokeq(sv)));
7020 start_force(PL_curforce);
7021 NEXTVAL_NEXTTOKE.opval = words;
7026 SvREFCNT_dec(PL_lex_stuff);
7027 PL_lex_stuff = NULL;
7033 s = scan_str(s,!!PL_madskills,FALSE);
7036 pl_yylval.ival = OP_STRINGIFY;
7037 if (SvIVX(PL_lex_stuff) == '\'')
7038 SvIV_set(PL_lex_stuff, 0); /* qq'$foo' should intepolate */
7039 TERM(sublex_start());
7042 s = scan_pat(s,OP_QR);
7043 TERM(sublex_start());
7046 s = scan_str(s,!!PL_madskills,FALSE);
7049 readpipe_override();
7050 TERM(sublex_start());
7058 s = force_version(s, FALSE);
7060 else if (*s != 'v' || !isDIGIT(s[1])
7061 || (s = force_version(s, TRUE), *s == 'v'))
7063 *PL_tokenbuf = '\0';
7064 s = force_word(s,WORD,TRUE,TRUE,FALSE);
7065 if (isIDFIRST_lazy_if(PL_tokenbuf,UTF))
7066 gv_stashpvn(PL_tokenbuf, strlen(PL_tokenbuf), GV_ADD);
7068 yyerror("<> should be quotes");
7070 if (orig_keyword == KEY_require) {
7078 PL_last_uni = PL_oldbufptr;
7079 PL_last_lop_op = OP_REQUIRE;
7081 return REPORT( (int)REQUIRE );
7087 s = force_word(s,WORD,TRUE,FALSE,FALSE);
7091 LOP(OP_RENAME,XTERM);
7100 LOP(OP_RINDEX,XTERM);
7109 UNIDOR(OP_READLINE);
7112 UNIDOR(OP_BACKTICK);
7121 LOP(OP_REVERSE,XTERM);
7124 UNIDOR(OP_READLINK);
7131 if (pl_yylval.opval)
7132 TERM(sublex_start());
7134 TOKEN(1); /* force error */
7137 checkcomma(s,PL_tokenbuf,"filehandle");
7147 LOP(OP_SELECT,XTERM);
7153 LOP(OP_SEMCTL,XTERM);
7156 LOP(OP_SEMGET,XTERM);
7159 LOP(OP_SEMOP,XTERM);
7165 LOP(OP_SETPGRP,XTERM);
7167 case KEY_setpriority:
7168 LOP(OP_SETPRIORITY,XTERM);
7170 case KEY_sethostent:
7176 case KEY_setservent:
7179 case KEY_setprotoent:
7189 LOP(OP_SEEKDIR,XTERM);
7191 case KEY_setsockopt:
7192 LOP(OP_SSOCKOPT,XTERM);
7198 LOP(OP_SHMCTL,XTERM);
7201 LOP(OP_SHMGET,XTERM);
7204 LOP(OP_SHMREAD,XTERM);
7207 LOP(OP_SHMWRITE,XTERM);
7210 LOP(OP_SHUTDOWN,XTERM);
7219 LOP(OP_SOCKET,XTERM);
7221 case KEY_socketpair:
7222 LOP(OP_SOCKPAIR,XTERM);
7225 checkcomma(s,PL_tokenbuf,"subroutine name");
7227 if (*s == ';' || *s == ')') /* probably a close */
7228 Perl_croak(aTHX_ "sort is now a reserved word");
7230 s = force_word(s,WORD,TRUE,TRUE,FALSE);
7234 LOP(OP_SPLIT,XTERM);
7237 LOP(OP_SPRINTF,XTERM);
7240 LOP(OP_SPLICE,XTERM);
7255 LOP(OP_SUBSTR,XTERM);
7261 char tmpbuf[sizeof PL_tokenbuf];
7262 SSize_t tboffset = 0;
7263 expectation attrful;
7264 bool have_name, have_proto;
7265 const int key = tmp;
7270 char *tstart = SvPVX(PL_linestr) + PL_realtokenstart;
7271 SV *subtoken = newSVpvn(tstart, s - tstart);
7275 s = SKIPSPACE2(s,tmpwhite);
7280 if (isIDFIRST_lazy_if(s,UTF) || *s == '\'' ||
7281 (*s == ':' && s[1] == ':'))
7284 SV *nametoke = NULL;
7288 attrful = XATTRBLOCK;
7289 /* remember buffer pos'n for later force_word */
7290 tboffset = s - PL_oldbufptr;
7291 d = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
7294 nametoke = newSVpvn(s, d - s);
7296 if (memchr(tmpbuf, ':', len))
7297 sv_setpvn(PL_subname, tmpbuf, len);
7299 sv_setsv(PL_subname,PL_curstname);
7300 sv_catpvs(PL_subname,"::");
7301 sv_catpvn(PL_subname,tmpbuf,len);
7308 CURMAD('X', nametoke);
7309 CURMAD('_', tmpwhite);
7310 (void) force_word(PL_oldbufptr + tboffset, WORD,
7313 s = SKIPSPACE2(d,tmpwhite);
7320 Perl_croak(aTHX_ "Missing name in \"my sub\"");
7321 PL_expect = XTERMBLOCK;
7322 attrful = XATTRTERM;
7323 sv_setpvs(PL_subname,"?");
7327 if (key == KEY_format) {
7329 PL_lex_formbrack = PL_lex_brackets + 1;
7331 PL_thistoken = subtoken;
7335 (void) force_word(PL_oldbufptr + tboffset, WORD,
7341 /* Look for a prototype */
7344 bool bad_proto = FALSE;
7345 bool in_brackets = FALSE;
7346 char greedy_proto = ' ';
7347 bool proto_after_greedy_proto = FALSE;
7348 bool must_be_last = FALSE;
7349 bool underscore = FALSE;
7350 bool seen_underscore = FALSE;
7351 const bool warnillegalproto = ckWARN(WARN_ILLEGALPROTO);
7353 s = scan_str(s,!!PL_madskills,FALSE);
7355 Perl_croak(aTHX_ "Prototype not terminated");
7356 /* strip spaces and check for bad characters */
7357 d = SvPVX(PL_lex_stuff);
7359 for (p = d; *p; ++p) {
7363 if (warnillegalproto) {
7365 proto_after_greedy_proto = TRUE;
7366 if (!strchr("$@%*;[]&\\_", *p)) {
7378 else if ( *p == ']' ) {
7379 in_brackets = FALSE;
7381 else if ( (*p == '@' || *p == '%') &&
7382 ( tmp < 2 || d[tmp-2] != '\\' ) &&
7384 must_be_last = TRUE;
7387 else if ( *p == '_' ) {
7388 underscore = seen_underscore = TRUE;
7395 if (proto_after_greedy_proto)
7396 Perl_warner(aTHX_ packWARN(WARN_ILLEGALPROTO),
7397 "Prototype after '%c' for %"SVf" : %s",
7398 greedy_proto, SVfARG(PL_subname), d);
7400 Perl_warner(aTHX_ packWARN(WARN_ILLEGALPROTO),
7401 "Illegal character %sin prototype for %"SVf" : %s",
7402 seen_underscore ? "after '_' " : "",
7403 SVfARG(PL_subname), d);
7404 SvCUR_set(PL_lex_stuff, tmp);
7409 CURMAD('q', PL_thisopen);
7410 CURMAD('_', tmpwhite);
7411 CURMAD('=', PL_thisstuff);
7412 CURMAD('Q', PL_thisclose);
7413 NEXTVAL_NEXTTOKE.opval =
7414 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
7415 PL_lex_stuff = NULL;
7418 s = SKIPSPACE2(s,tmpwhite);
7426 if (*s == ':' && s[1] != ':')
7427 PL_expect = attrful;
7428 else if (*s != '{' && key == KEY_sub) {
7430 Perl_croak(aTHX_ "Illegal declaration of anonymous subroutine");
7431 else if (*s != ';' && *s != '}')
7432 Perl_croak(aTHX_ "Illegal declaration of subroutine %"SVf, SVfARG(PL_subname));
7439 curmad('^', newSVpvs(""));
7440 CURMAD('_', tmpwhite);
7444 PL_thistoken = subtoken;
7447 NEXTVAL_NEXTTOKE.opval =
7448 (OP*)newSVOP(OP_CONST, 0, PL_lex_stuff);
7449 PL_lex_stuff = NULL;
7455 sv_setpvs(PL_subname, "__ANON__");
7457 sv_setpvs(PL_subname, "__ANON__::__ANON__");
7461 (void) force_word(PL_oldbufptr + tboffset, WORD,
7470 LOP(OP_SYSTEM,XREF);
7473 LOP(OP_SYMLINK,XTERM);
7476 LOP(OP_SYSCALL,XTERM);
7479 LOP(OP_SYSOPEN,XTERM);
7482 LOP(OP_SYSSEEK,XTERM);
7485 LOP(OP_SYSREAD,XTERM);
7488 LOP(OP_SYSWRITE,XTERM);
7492 TERM(sublex_start());
7513 LOP(OP_TRUNCATE,XTERM);
7525 pl_yylval.ival = CopLINE(PL_curcop);
7529 pl_yylval.ival = CopLINE(PL_curcop);
7533 LOP(OP_UNLINK,XTERM);
7539 LOP(OP_UNPACK,XTERM);
7542 LOP(OP_UTIME,XTERM);
7548 LOP(OP_UNSHIFT,XTERM);
7551 s = tokenize_use(1, s);
7561 pl_yylval.ival = CopLINE(PL_curcop);
7565 pl_yylval.ival = CopLINE(PL_curcop);
7569 PL_hints |= HINT_BLOCK_SCOPE;
7576 LOP(OP_WAITPID,XTERM);
7585 ctl_l[0] = toCTRL('L');
7587 gv_fetchpvn_flags(ctl_l, 1, GV_ADD|GV_NOTQUAL, SVt_PV);
7590 /* Make sure $^L is defined */
7591 gv_fetchpvs("\f", GV_ADD|GV_NOTQUAL, SVt_PV);
7596 if (PL_expect == XOPERATOR)
7602 pl_yylval.ival = OP_XOR;
7607 TERM(sublex_start());
7612 #pragma segment Main
7616 S_pending_ident(pTHX)
7621 /* pit holds the identifier we read and pending_ident is reset */
7622 char pit = PL_pending_ident;
7623 const STRLEN tokenbuf_len = strlen(PL_tokenbuf);
7624 /* All routes through this function want to know if there is a colon. */
7625 const char *const has_colon = (const char*) memchr (PL_tokenbuf, ':', tokenbuf_len);
7626 PL_pending_ident = 0;
7628 /* PL_realtokenstart = realtokenend = PL_bufptr - SvPVX(PL_linestr); */
7629 DEBUG_T({ PerlIO_printf(Perl_debug_log,
7630 "### Pending identifier '%s'\n", PL_tokenbuf); });
7632 /* if we're in a my(), we can't allow dynamics here.
7633 $foo'bar has already been turned into $foo::bar, so
7634 just check for colons.
7636 if it's a legal name, the OP is a PADANY.
7639 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
7641 yyerror(Perl_form(aTHX_ "No package name allowed for "
7642 "variable %s in \"our\"",
7644 tmp = allocmy(PL_tokenbuf, tokenbuf_len, 0);
7648 yyerror(Perl_form(aTHX_ PL_no_myglob,
7649 PL_in_my == KEY_my ? "my" : "state", PL_tokenbuf));
7651 pl_yylval.opval = newOP(OP_PADANY, 0);
7652 pl_yylval.opval->op_targ = allocmy(PL_tokenbuf, tokenbuf_len, 0);
7658 build the ops for accesses to a my() variable.
7660 Deny my($a) or my($b) in a sort block, *if* $a or $b is
7661 then used in a comparison. This catches most, but not
7662 all cases. For instance, it catches
7663 sort { my($a); $a <=> $b }
7665 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
7666 (although why you'd do that is anyone's guess).
7671 tmp = pad_findmy(PL_tokenbuf, tokenbuf_len, 0);
7672 if (tmp != NOT_IN_PAD) {
7673 /* might be an "our" variable" */
7674 if (PAD_COMPNAME_FLAGS_isOUR(tmp)) {
7675 /* build ops for a bareword */
7676 HV * const stash = PAD_COMPNAME_OURSTASH(tmp);
7677 HEK * const stashname = HvNAME_HEK(stash);
7678 SV * const sym = newSVhek(stashname);
7679 sv_catpvs(sym, "::");
7680 sv_catpvn(sym, PL_tokenbuf+1, tokenbuf_len - 1);
7681 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
7682 pl_yylval.opval->op_private = OPpCONST_ENTERED;
7685 ? (GV_ADDMULTI | GV_ADDINEVAL)
7688 ((PL_tokenbuf[0] == '$') ? SVt_PV
7689 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
7694 /* if it's a sort block and they're naming $a or $b */
7695 if (PL_last_lop_op == OP_SORT &&
7696 PL_tokenbuf[0] == '$' &&
7697 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
7700 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
7701 d < PL_bufend && *d != '\n';
7704 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
7705 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
7711 pl_yylval.opval = newOP(OP_PADANY, 0);
7712 pl_yylval.opval->op_targ = tmp;
7718 Whine if they've said @foo in a doublequoted string,
7719 and @foo isn't a variable we can find in the symbol
7722 if (ckWARN(WARN_AMBIGUOUS) &&
7723 pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
7724 GV *const gv = gv_fetchpvn_flags(PL_tokenbuf + 1, tokenbuf_len - 1, 0,
7726 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
7727 /* DO NOT warn for @- and @+ */
7728 && !( PL_tokenbuf[2] == '\0' &&
7729 ( PL_tokenbuf[1] == '-' || PL_tokenbuf[1] == '+' ))
7732 /* Downgraded from fatal to warning 20000522 mjd */
7733 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
7734 "Possible unintended interpolation of %s in string",
7739 /* build ops for a bareword */
7740 pl_yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpvn(PL_tokenbuf + 1,
7742 pl_yylval.opval->op_private = OPpCONST_ENTERED;
7744 PL_tokenbuf + 1, tokenbuf_len - 1,
7745 /* If the identifier refers to a stash, don't autovivify it.
7746 * Change 24660 had the side effect of causing symbol table
7747 * hashes to always be defined, even if they were freshly
7748 * created and the only reference in the entire program was
7749 * the single statement with the defined %foo::bar:: test.
7750 * It appears that all code in the wild doing this actually
7751 * wants to know whether sub-packages have been loaded, so
7752 * by avoiding auto-vivifying symbol tables, we ensure that
7753 * defined %foo::bar:: continues to be false, and the existing
7754 * tests still give the expected answers, even though what
7755 * they're actually testing has now changed subtly.
7757 (*PL_tokenbuf == '%'
7758 && *(d = PL_tokenbuf + tokenbuf_len - 1) == ':'
7761 : PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : GV_ADD),
7762 ((PL_tokenbuf[0] == '$') ? SVt_PV
7763 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
7769 * The following code was generated by perl_keyword.pl.
7773 Perl_keyword (pTHX_ const char *name, I32 len, bool all_keywords)
7777 PERL_ARGS_ASSERT_KEYWORD;
7781 case 1: /* 5 tokens of length 1 */
7813 case 2: /* 18 tokens of length 2 */
7959 case 3: /* 29 tokens of length 3 */
7963 if (name[1] == 'N' &&
8026 if (name[1] == 'i' &&
8058 if (name[1] == 'o' &&
8067 if (name[1] == 'e' &&
8076 if (name[1] == 'n' &&
8085 if (name[1] == 'o' &&
8094 if (name[1] == 'a' &&
8103 if (name[1] == 'o' &&
8165 if (name[1] == 'e' &&
8179 return (all_keywords || FEATURE_IS_ENABLED("say") ? KEY_say : 0);
8205 if (name[1] == 'i' &&
8214 if (name[1] == 's' &&
8223 if (name[1] == 'e' &&
8232 if (name[1] == 'o' &&
8244 case 4: /* 41 tokens of length 4 */
8248 if (name[1] == 'O' &&
8258 if (name[1] == 'N' &&
8268 if (name[1] == 'i' &&
8278 if (name[1] == 'h' &&
8288 if (name[1] == 'u' &&
8301 if (name[2] == 'c' &&
8310 if (name[2] == 's' &&
8319 if (name[2] == 'a' &&
8355 if (name[1] == 'o' &&
8368 if (name[2] == 't' &&
8377 if (name[2] == 'o' &&
8386 if (name[2] == 't' &&
8395 if (name[2] == 'e' &&
8408 if (name[1] == 'o' &&
8421 if (name[2] == 'y' &&
8430 if (name[2] == 'l' &&
8446 if (name[2] == 's' &&
8455 if (name[2] == 'n' &&
8464 if (name[2] == 'c' &&
8477 if (name[1] == 'e' &&
8487 if (name[1] == 'p' &&
8500 if (name[2] == 'c' &&
8509 if (name[2] == 'p' &&
8518 if (name[2] == 's' &&
8534 if (name[2] == 'n' &&
8604 if (name[2] == 'r' &&
8613 if (name[2] == 'r' &&
8622 if (name[2] == 'a' &&
8638 if (name[2] == 'l' &&
8700 if (name[2] == 'e' &&
8703 return (all_keywords || FEATURE_IS_ENABLED("switch") ? KEY_when : 0);
8716 case 5: /* 39 tokens of length 5 */
8720 if (name[1] == 'E' &&
8731 if (name[1] == 'H' &&
8745 if (name[2] == 'a' &&
8755 if (name[2] == 'a' &&
8772 if (name[2] == 'e' &&
8782 if (name[2] == 'e' &&
8786 return (all_keywords || FEATURE_IS_ENABLED("switch") ? -KEY_break : 0);
8802 if (name[3] == 'i' &&
8811 if (name[3] == 'o' &&
8847 if (name[2] == 'o' &&
8857 if (name[2] == 'y' &&
8871 if (name[1] == 'l' &&
8885 if (name[2] == 'n' &&
8895 if (name[2] == 'o' &&
8909 if (name[1] == 'i' &&
8914 return (all_keywords || FEATURE_IS_ENABLED("switch") ? KEY_given : 0);
8923 if (name[2] == 'd' &&
8933 if (name[2] == 'c' &&
8950 if (name[2] == 'c' &&
8960 if (name[2] == 't' &&
8974 if (name[1] == 'k' &&
8985 if (name[1] == 'r' &&
8999 if (name[2] == 's' &&
9009 if (name[2] == 'd' &&
9026 if (name[2] == 'm' &&
9036 if (name[2] == 'i' &&
9046 if (name[2] == 'e' &&
9056 if (name[2] == 'l' &&
9066 if (name[2] == 'a' &&
9079 if (name[3] == 't' &&
9082 return (all_keywords || FEATURE_IS_ENABLED("state") ? KEY_state : 0);
9088 if (name[3] == 'd' &&
9105 if (name[1] == 'i' &&
9119 if (name[2] == 'a' &&
9132 if (name[3] == 'e' &&
9167 if (name[2] == 'i' &&
9184 if (name[2] == 'i' &&
9194 if (name[2] == 'i' &&
9211 case 6: /* 33 tokens of length 6 */
9215 if (name[1] == 'c' &&
9230 if (name[2] == 'l' &&
9241 if (name[2] == 'r' &&
9256 if (name[1] == 'e' &&
9271 if (name[2] == 's' &&
9276 Perl_ck_warner_d(aTHX_ packWARN(WARN_SYNTAX), "elseif should be elsif");
9282 if (name[2] == 'i' &&
9300 if (name[2] == 'l' &&
9311 if (name[2] == 'r' &&
9326 if (name[1] == 'm' &&
9341 if (name[2] == 'n' &&
9352 if (name[2] == 's' &&
9367 if (name[1] == 's' &&
9373 if (name[4] == 't' &&
9382 if (name[4] == 'e' &&
9391 if (name[4] == 'c' &&
9400 if (name[4] == 'n' &&
9416 if (name[1] == 'r' &&
9434 if (name[3] == 'a' &&
9444 if (name[3] == 'u' &&
9458 if (name[2] == 'n' &&
9476 if (name[2] == 'a' &&
9490 if (name[3] == 'e' &&
9503 if (name[4] == 't' &&
9512 if (name[4] == 'e' &&
9534 if (name[4] == 't' &&
9543 if (name[4] == 'e' &&
9559 if (name[2] == 'c' &&
9570 if (name[2] == 'l' &&
9581 if (name[2] == 'b' &&
9592 if (name[2] == 's' &&
9615 if (name[4] == 's' &&
9624 if (name[4] == 'n' &&
9637 if (name[3] == 'a' &&
9654 if (name[1] == 'a' &&
9669 case 7: /* 29 tokens of length 7 */
9673 if (name[1] == 'E' &&
9686 if (name[1] == '_' &&
9699 if (name[1] == 'i' &&
9706 return -KEY_binmode;
9712 if (name[1] == 'o' &&
9719 return -KEY_connect;
9728 if (name[2] == 'm' &&
9734 return -KEY_dbmopen;
9745 if (name[4] == 'u' &&
9749 return (all_keywords || FEATURE_IS_ENABLED("switch") ? KEY_default : 0);
9755 if (name[4] == 'n' &&
9776 if (name[1] == 'o' &&
9789 if (name[1] == 'e' &&
9796 if (name[5] == 'r' &&
9799 return -KEY_getpgrp;
9805 if (name[5] == 'i' &&
9808 return -KEY_getppid;
9821 if (name[1] == 'c' &&
9828 return -KEY_lcfirst;
9834 if (name[1] == 'p' &&
9841 return -KEY_opendir;
9847 if (name[1] == 'a' &&
9865 if (name[3] == 'd' &&
9870 return -KEY_readdir;
9876 if (name[3] == 'u' &&
9887 if (name[3] == 'e' &&
9892 return -KEY_reverse;
9911 if (name[3] == 'k' &&
9916 return -KEY_seekdir;
9922 if (name[3] == 'p' &&
9927 return -KEY_setpgrp;
9937 if (name[2] == 'm' &&
9943 return -KEY_shmread;
9949 if (name[2] == 'r' &&
9955 return -KEY_sprintf;
9964 if (name[3] == 'l' &&
9969 return -KEY_symlink;
9978 if (name[4] == 'a' &&
9982 return -KEY_syscall;
9988 if (name[4] == 'p' &&
9992 return -KEY_sysopen;
9998 if (name[4] == 'e' &&
10002 return -KEY_sysread;
10008 if (name[4] == 'e' &&
10012 return -KEY_sysseek;
10030 if (name[1] == 'e' &&
10037 return -KEY_telldir;
10046 if (name[2] == 'f' &&
10052 return -KEY_ucfirst;
10058 if (name[2] == 's' &&
10064 return -KEY_unshift;
10074 if (name[1] == 'a' &&
10081 return -KEY_waitpid;
10090 case 8: /* 26 tokens of length 8 */
10094 if (name[1] == 'U' &&
10102 return KEY_AUTOLOAD;
10108 if (name[1] == '_')
10113 if (name[3] == 'A' &&
10119 return KEY___DATA__;
10125 if (name[3] == 'I' &&
10131 return -KEY___FILE__;
10137 if (name[3] == 'I' &&
10143 return -KEY___LINE__;
10159 if (name[2] == 'o' &&
10166 return -KEY_closedir;
10172 if (name[2] == 'n' &&
10179 return -KEY_continue;
10189 if (name[1] == 'b' &&
10197 return -KEY_dbmclose;
10203 if (name[1] == 'n' &&
10209 if (name[4] == 'r' &&
10214 return -KEY_endgrent;
10220 if (name[4] == 'w' &&
10225 return -KEY_endpwent;
10238 if (name[1] == 'o' &&
10246 return -KEY_formline;
10252 if (name[1] == 'e' &&
10258 if (name[4] == 'r')
10263 if (name[6] == 'n' &&
10266 return -KEY_getgrent;
10272 if (name[6] == 'i' &&
10275 return -KEY_getgrgid;
10281 if (name[6] == 'a' &&
10284 return -KEY_getgrnam;
10297 if (name[4] == 'o' &&
10302 return -KEY_getlogin;
10308 if (name[4] == 'w')
10313 if (name[6] == 'n' &&
10316 return -KEY_getpwent;
10322 if (name[6] == 'a' &&
10325 return -KEY_getpwnam;
10331 if (name[6] == 'i' &&
10334 return -KEY_getpwuid;
10354 if (name[1] == 'e' &&
10361 if (name[5] == 'i' &&
10368 return -KEY_readline;
10373 return -KEY_readlink;
10384 if (name[5] == 'i' &&
10388 return -KEY_readpipe;
10404 if (name[2] == 't')
10409 if (name[4] == 'r' &&
10414 return -KEY_setgrent;
10420 if (name[4] == 'w' &&
10425 return -KEY_setpwent;
10441 if (name[3] == 'w' &&
10447 return -KEY_shmwrite;
10453 if (name[3] == 't' &&
10459 return -KEY_shutdown;
10469 if (name[2] == 's' &&
10476 return -KEY_syswrite;
10486 if (name[1] == 'r' &&
10494 return -KEY_truncate;
10503 case 9: /* 9 tokens of length 9 */
10507 if (name[1] == 'N' &&
10516 return KEY_UNITCHECK;
10522 if (name[1] == 'n' &&
10531 return -KEY_endnetent;
10537 if (name[1] == 'e' &&
10546 return -KEY_getnetent;
10552 if (name[1] == 'o' &&
10561 return -KEY_localtime;
10567 if (name[1] == 'r' &&
10576 return KEY_prototype;
10582 if (name[1] == 'u' &&
10591 return -KEY_quotemeta;
10597 if (name[1] == 'e' &&
10606 return -KEY_rewinddir;
10612 if (name[1] == 'e' &&
10621 return -KEY_setnetent;
10627 if (name[1] == 'a' &&
10636 return -KEY_wantarray;
10645 case 10: /* 9 tokens of length 10 */
10649 if (name[1] == 'n' &&
10655 if (name[4] == 'o' &&
10662 return -KEY_endhostent;
10668 if (name[4] == 'e' &&
10675 return -KEY_endservent;
10688 if (name[1] == 'e' &&
10694 if (name[4] == 'o' &&
10701 return -KEY_gethostent;
10710 if (name[5] == 'r' &&
10716 return -KEY_getservent;
10722 if (name[5] == 'c' &&
10728 return -KEY_getsockopt;
10748 if (name[2] == 't')
10753 if (name[4] == 'o' &&
10760 return -KEY_sethostent;
10769 if (name[5] == 'r' &&
10775 return -KEY_setservent;
10781 if (name[5] == 'c' &&
10787 return -KEY_setsockopt;
10804 if (name[2] == 'c' &&
10813 return -KEY_socketpair;
10826 case 11: /* 8 tokens of length 11 */
10830 if (name[1] == '_' &&
10840 { /* __PACKAGE__ */
10841 return -KEY___PACKAGE__;
10847 if (name[1] == 'n' &&
10857 { /* endprotoent */
10858 return -KEY_endprotoent;
10864 if (name[1] == 'e' &&
10873 if (name[5] == 'e' &&
10879 { /* getpeername */
10880 return -KEY_getpeername;
10889 if (name[6] == 'o' &&
10894 { /* getpriority */
10895 return -KEY_getpriority;
10901 if (name[6] == 't' &&
10906 { /* getprotoent */
10907 return -KEY_getprotoent;
10921 if (name[4] == 'o' &&
10928 { /* getsockname */
10929 return -KEY_getsockname;
10942 if (name[1] == 'e' &&
10950 if (name[6] == 'o' &&
10955 { /* setpriority */
10956 return -KEY_setpriority;
10962 if (name[6] == 't' &&
10967 { /* setprotoent */
10968 return -KEY_setprotoent;
10984 case 12: /* 2 tokens of length 12 */
10985 if (name[0] == 'g' &&
10997 if (name[9] == 'd' &&
11000 { /* getnetbyaddr */
11001 return -KEY_getnetbyaddr;
11007 if (name[9] == 'a' &&
11010 { /* getnetbyname */
11011 return -KEY_getnetbyname;
11023 case 13: /* 4 tokens of length 13 */
11024 if (name[0] == 'g' &&
11031 if (name[4] == 'o' &&
11040 if (name[10] == 'd' &&
11043 { /* gethostbyaddr */
11044 return -KEY_gethostbyaddr;
11050 if (name[10] == 'a' &&
11053 { /* gethostbyname */
11054 return -KEY_gethostbyname;
11067 if (name[4] == 'e' &&
11076 if (name[10] == 'a' &&
11079 { /* getservbyname */
11080 return -KEY_getservbyname;
11086 if (name[10] == 'o' &&
11089 { /* getservbyport */
11090 return -KEY_getservbyport;
11109 case 14: /* 1 tokens of length 14 */
11110 if (name[0] == 'g' &&
11124 { /* getprotobyname */
11125 return -KEY_getprotobyname;
11130 case 16: /* 1 tokens of length 16 */
11131 if (name[0] == 'g' &&
11147 { /* getprotobynumber */
11148 return -KEY_getprotobynumber;
11162 S_checkcomma(pTHX_ const char *s, const char *name, const char *what)
11166 PERL_ARGS_ASSERT_CHECKCOMMA;
11168 if (*s == ' ' && s[1] == '(') { /* XXX gotta be a better way */
11169 if (ckWARN(WARN_SYNTAX)) {
11172 for (w = s+2; *w && level; w++) {
11175 else if (*w == ')')
11178 while (isSPACE(*w))
11180 /* the list of chars below is for end of statements or
11181 * block / parens, boolean operators (&&, ||, //) and branch
11182 * constructs (or, and, if, until, unless, while, err, for).
11183 * Not a very solid hack... */
11184 if (!*w || !strchr(";&/|})]oaiuwef!=", *w))
11185 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
11186 "%s (...) interpreted as function",name);
11189 while (s < PL_bufend && isSPACE(*s))
11193 while (s < PL_bufend && isSPACE(*s))
11195 if (isIDFIRST_lazy_if(s,UTF)) {
11196 const char * const w = s++;
11197 while (isALNUM_lazy_if(s,UTF))
11199 while (s < PL_bufend && isSPACE(*s))
11203 if (keyword(w, s - w, 0))
11206 gv = gv_fetchpvn_flags(w, s - w, 0, SVt_PVCV);
11207 if (gv && GvCVu(gv))
11209 Perl_croak(aTHX_ "No comma allowed after %s", what);
11214 /* Either returns sv, or mortalizes sv and returns a new SV*.
11215 Best used as sv=new_constant(..., sv, ...).
11216 If s, pv are NULL, calls subroutine with one argument,
11217 and type is used with error messages only. */
11220 S_new_constant(pTHX_ const char *s, STRLEN len, const char *key, STRLEN keylen,
11221 SV *sv, SV *pv, const char *type, STRLEN typelen)
11224 HV * const table = GvHV(PL_hintgv); /* ^H */
11228 const char *why1 = "", *why2 = "", *why3 = "";
11230 PERL_ARGS_ASSERT_NEW_CONSTANT;
11232 if (!table || !(PL_hints & HINT_LOCALIZE_HH)) {
11235 why2 = (const char *)
11236 (strEQ(key,"charnames")
11237 ? "(possibly a missing \"use charnames ...\")"
11239 msg = Perl_newSVpvf(aTHX_ "Constant(%s) unknown: %s",
11240 (type ? type: "undef"), why2);
11242 /* This is convoluted and evil ("goto considered harmful")
11243 * but I do not understand the intricacies of all the different
11244 * failure modes of %^H in here. The goal here is to make
11245 * the most probable error message user-friendly. --jhi */
11250 msg = Perl_newSVpvf(aTHX_ "Constant(%s): %s%s%s",
11251 (type ? type: "undef"), why1, why2, why3);
11253 yyerror(SvPVX_const(msg));
11257 cvp = hv_fetch(table, key, keylen, FALSE);
11258 if (!cvp || !SvOK(*cvp)) {
11261 why3 = "} is not defined";
11264 sv_2mortal(sv); /* Parent created it permanently */
11267 pv = newSVpvn_flags(s, len, SVs_TEMP);
11269 typesv = newSVpvn_flags(type, typelen, SVs_TEMP);
11271 typesv = &PL_sv_undef;
11273 PUSHSTACKi(PERLSI_OVERLOAD);
11285 call_sv(cv, G_SCALAR | ( PL_in_eval ? 0 : G_EVAL));
11289 /* Check the eval first */
11290 if (!PL_in_eval && SvTRUE(ERRSV)) {
11291 sv_catpvs(ERRSV, "Propagated");
11292 yyerror(SvPV_nolen_const(ERRSV)); /* Duplicates the message inside eval */
11294 res = SvREFCNT_inc_simple(sv);
11298 SvREFCNT_inc_simple_void(res);
11307 why1 = "Call to &{$^H{";
11309 why3 = "}} did not return a defined value";
11317 /* Returns a NUL terminated string, with the length of the string written to
11321 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
11324 register char *d = dest;
11325 register char * const e = d + destlen - 3; /* two-character token, ending NUL */
11327 PERL_ARGS_ASSERT_SCAN_WORD;
11331 Perl_croak(aTHX_ ident_too_long);
11332 if (isALNUM(*s)) /* UTF handled below */
11334 else if (allow_package && (*s == '\'') && isIDFIRST_lazy_if(s+1,UTF)) {
11339 else if (allow_package && (s[0] == ':') && (s[1] == ':') && (s[2] != '$')) {
11343 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
11344 char *t = s + UTF8SKIP(s);
11346 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
11350 Perl_croak(aTHX_ ident_too_long);
11351 Copy(s, d, len, char);
11364 S_scan_ident(pTHX_ register char *s, register const char *send, char *dest, STRLEN destlen, I32 ck_uni)
11367 char *bracket = NULL;
11369 register char *d = dest;
11370 register char * const e = d + destlen - 3; /* two-character token, ending NUL */
11372 PERL_ARGS_ASSERT_SCAN_IDENT;
11377 while (isDIGIT(*s)) {
11379 Perl_croak(aTHX_ ident_too_long);
11386 Perl_croak(aTHX_ ident_too_long);
11387 if (isALNUM(*s)) /* UTF handled below */
11389 else if (*s == '\'' && isIDFIRST_lazy_if(s+1,UTF)) {
11394 else if (*s == ':' && s[1] == ':') {
11398 else if (UTF && UTF8_IS_START(*s) && isALNUM_utf8((U8*)s)) {
11399 char *t = s + UTF8SKIP(s);
11400 while (UTF8_IS_CONTINUED(*t) && is_utf8_mark((U8*)t))
11402 if (d + (t - s) > e)
11403 Perl_croak(aTHX_ ident_too_long);
11404 Copy(s, d, t - s, char);
11415 if (PL_lex_state != LEX_NORMAL)
11416 PL_lex_state = LEX_INTERPENDMAYBE;
11419 if (*s == '$' && s[1] &&
11420 (isALNUM_lazy_if(s+1,UTF) || s[1] == '$' || s[1] == '{' || strnEQ(s+1,"::",2)) )
11433 if (*d == '^' && *s && isCONTROLVAR(*s)) {
11438 if (isSPACE(s[-1])) {
11440 const char ch = *s++;
11441 if (!SPACE_OR_TAB(ch)) {
11447 if (isIDFIRST_lazy_if(d,UTF)) {
11451 while ((end < send && isALNUM_lazy_if(end,UTF)) || *end == ':') {
11452 end += UTF8SKIP(end);
11453 while (end < send && UTF8_IS_CONTINUED(*end) && is_utf8_mark((U8*)end))
11454 end += UTF8SKIP(end);
11456 Copy(s, d, end - s, char);
11461 while ((isALNUM(*s) || *s == ':') && d < e)
11464 Perl_croak(aTHX_ ident_too_long);
11467 while (s < send && SPACE_OR_TAB(*s))
11469 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
11470 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest, 0)) {
11471 const char * const brack =
11473 ((*s == '[') ? "[...]" : "{...}");
11474 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
11475 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
11476 funny, dest, brack, funny, dest, brack);
11479 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
11483 /* Handle extended ${^Foo} variables
11484 * 1999-02-27 mjd-perl-patch@plover.com */
11485 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
11489 while (isALNUM(*s) && d < e) {
11493 Perl_croak(aTHX_ ident_too_long);
11498 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
11499 PL_lex_state = LEX_INTERPEND;
11502 if (PL_lex_state == LEX_NORMAL) {
11503 if (ckWARN(WARN_AMBIGUOUS) &&
11504 (keyword(dest, d - dest, 0)
11505 || get_cvn_flags(dest, d - dest, 0)))
11509 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
11510 "Ambiguous use of %c{%s} resolved to %c%s",
11511 funny, dest, funny, dest);
11516 s = bracket; /* let the parser handle it */
11520 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
11521 PL_lex_state = LEX_INTERPEND;
11526 S_pmflag(U32 pmfl, const char ch) {
11528 CASE_STD_PMMOD_FLAGS_PARSE_SET(&pmfl);
11529 case GLOBAL_PAT_MOD: pmfl |= PMf_GLOBAL; break;
11530 case CONTINUE_PAT_MOD: pmfl |= PMf_CONTINUE; break;
11531 case ONCE_PAT_MOD: pmfl |= PMf_KEEP; break;
11532 case KEEPCOPY_PAT_MOD: pmfl |= PMf_KEEPCOPY; break;
11538 Perl_pmflag(pTHX_ U32* pmfl, int ch)
11540 PERL_ARGS_ASSERT_PMFLAG;
11542 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
11543 "Perl_pmflag() is deprecated, and will be removed from the XS API");
11546 *pmfl = S_pmflag(*pmfl, (char)ch);
11551 S_scan_pat(pTHX_ char *start, I32 type)
11555 char *s = scan_str(start,!!PL_madskills,FALSE);
11556 const char * const valid_flags =
11557 (const char *)((type == OP_QR) ? QR_PAT_MODS : M_PAT_MODS);
11562 PERL_ARGS_ASSERT_SCAN_PAT;
11565 const char * const delimiter = skipspace(start);
11569 ? "Search pattern not terminated or ternary operator parsed as search pattern"
11570 : "Search pattern not terminated" ));
11573 pm = (PMOP*)newPMOP(type, 0);
11574 if (PL_multi_open == '?') {
11575 /* This is the only point in the code that sets PMf_ONCE: */
11576 pm->op_pmflags |= PMf_ONCE;
11578 /* Hence it's safe to do this bit of PMOP book-keeping here, which
11579 allows us to restrict the list needed by reset to just the ??
11581 assert(type != OP_TRANS);
11583 MAGIC *mg = mg_find((const SV *)PL_curstash, PERL_MAGIC_symtab);
11586 mg = sv_magicext(MUTABLE_SV(PL_curstash), 0, PERL_MAGIC_symtab, 0, 0,
11589 elements = mg->mg_len / sizeof(PMOP**);
11590 Renewc(mg->mg_ptr, elements + 1, PMOP*, char);
11591 ((PMOP**)mg->mg_ptr) [elements++] = pm;
11592 mg->mg_len = elements * sizeof(PMOP**);
11593 PmopSTASH_set(pm,PL_curstash);
11599 while (*s && strchr(valid_flags, *s))
11600 pm->op_pmflags = S_pmflag(pm->op_pmflags, *s++);
11602 if (PL_madskills && modstart != s) {
11603 SV* tmptoken = newSVpvn(modstart, s - modstart);
11604 append_madprops(newMADPROP('m', MAD_SV, tmptoken, 0), (OP*)pm, 0);
11607 /* issue a warning if /c is specified,but /g is not */
11608 if ((pm->op_pmflags & PMf_CONTINUE) && !(pm->op_pmflags & PMf_GLOBAL))
11610 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
11611 "Use of /c modifier is meaningless without /g" );
11614 PL_lex_op = (OP*)pm;
11615 pl_yylval.ival = OP_MATCH;
11620 S_scan_subst(pTHX_ char *start)
11631 PERL_ARGS_ASSERT_SCAN_SUBST;
11633 pl_yylval.ival = OP_NULL;
11635 s = scan_str(start,!!PL_madskills,FALSE);
11638 Perl_croak(aTHX_ "Substitution pattern not terminated");
11640 if (s[-1] == PL_multi_open)
11643 if (PL_madskills) {
11644 CURMAD('q', PL_thisopen);
11645 CURMAD('_', PL_thiswhite);
11646 CURMAD('E', PL_thisstuff);
11647 CURMAD('Q', PL_thisclose);
11648 PL_realtokenstart = s - SvPVX(PL_linestr);
11652 first_start = PL_multi_start;
11653 s = scan_str(s,!!PL_madskills,FALSE);
11655 if (PL_lex_stuff) {
11656 SvREFCNT_dec(PL_lex_stuff);
11657 PL_lex_stuff = NULL;
11659 Perl_croak(aTHX_ "Substitution replacement not terminated");
11661 PL_multi_start = first_start; /* so whole substitution is taken together */
11663 pm = (PMOP*)newPMOP(OP_SUBST, 0);
11666 if (PL_madskills) {
11667 CURMAD('z', PL_thisopen);
11668 CURMAD('R', PL_thisstuff);
11669 CURMAD('Z', PL_thisclose);
11675 if (*s == EXEC_PAT_MOD) {
11679 else if (strchr(S_PAT_MODS, *s))
11680 pm->op_pmflags = S_pmflag(pm->op_pmflags, *s++);
11686 if (PL_madskills) {
11688 curmad('m', newSVpvn(modstart, s - modstart));
11689 append_madprops(PL_thismad, (OP*)pm, 0);
11693 if ((pm->op_pmflags & PMf_CONTINUE)) {
11694 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), "Use of /c modifier is meaningless in s///" );
11698 SV * const repl = newSVpvs("");
11700 PL_sublex_info.super_bufptr = s;
11701 PL_sublex_info.super_bufend = PL_bufend;
11703 pm->op_pmflags |= PMf_EVAL;
11706 sv_catpvs(repl, "eval ");
11708 sv_catpvs(repl, "do ");
11710 sv_catpvs(repl, "{");
11711 sv_catsv(repl, PL_lex_repl);
11712 if (strchr(SvPVX(PL_lex_repl), '#'))
11713 sv_catpvs(repl, "\n");
11714 sv_catpvs(repl, "}");
11716 SvREFCNT_dec(PL_lex_repl);
11717 PL_lex_repl = repl;
11720 PL_lex_op = (OP*)pm;
11721 pl_yylval.ival = OP_SUBST;
11726 S_scan_trans(pTHX_ char *start)
11739 PERL_ARGS_ASSERT_SCAN_TRANS;
11741 pl_yylval.ival = OP_NULL;
11743 s = scan_str(start,!!PL_madskills,FALSE);
11745 Perl_croak(aTHX_ "Transliteration pattern not terminated");
11747 if (s[-1] == PL_multi_open)
11750 if (PL_madskills) {
11751 CURMAD('q', PL_thisopen);
11752 CURMAD('_', PL_thiswhite);
11753 CURMAD('E', PL_thisstuff);
11754 CURMAD('Q', PL_thisclose);
11755 PL_realtokenstart = s - SvPVX(PL_linestr);
11759 s = scan_str(s,!!PL_madskills,FALSE);
11761 if (PL_lex_stuff) {
11762 SvREFCNT_dec(PL_lex_stuff);
11763 PL_lex_stuff = NULL;
11765 Perl_croak(aTHX_ "Transliteration replacement not terminated");
11767 if (PL_madskills) {
11768 CURMAD('z', PL_thisopen);
11769 CURMAD('R', PL_thisstuff);
11770 CURMAD('Z', PL_thisclose);
11773 complement = del = squash = 0;
11780 complement = OPpTRANS_COMPLEMENT;
11783 del = OPpTRANS_DELETE;
11786 squash = OPpTRANS_SQUASH;
11795 tbl = (short *)PerlMemShared_calloc(complement&&!del?258:256, sizeof(short));
11796 o = newPVOP(OP_TRANS, 0, (char*)tbl);
11797 o->op_private &= ~OPpTRANS_ALL;
11798 o->op_private |= del|squash|complement|
11799 (DO_UTF8(PL_lex_stuff)? OPpTRANS_FROM_UTF : 0)|
11800 (DO_UTF8(PL_lex_repl) ? OPpTRANS_TO_UTF : 0);
11803 pl_yylval.ival = OP_TRANS;
11806 if (PL_madskills) {
11808 curmad('m', newSVpvn(modstart, s - modstart));
11809 append_madprops(PL_thismad, o, 0);
11818 S_scan_heredoc(pTHX_ register char *s)
11822 I32 op_type = OP_SCALAR;
11826 const char *found_newline;
11830 const int outer = (PL_rsfp && !(PL_lex_inwhat == OP_SCALAR));
11832 I32 stuffstart = s - SvPVX(PL_linestr);
11835 PL_realtokenstart = -1;
11838 PERL_ARGS_ASSERT_SCAN_HEREDOC;
11842 e = PL_tokenbuf + sizeof PL_tokenbuf - 1;
11846 while (SPACE_OR_TAB(*peek))
11848 if (*peek == '`' || *peek == '\'' || *peek =='"') {
11851 s = delimcpy(d, e, s, PL_bufend, term, &len);
11861 if (!isALNUM_lazy_if(s,UTF))
11862 deprecate("bare << to mean <<\"\"");
11863 for (; isALNUM_lazy_if(s,UTF); s++) {
11868 if (d >= PL_tokenbuf + sizeof PL_tokenbuf - 1)
11869 Perl_croak(aTHX_ "Delimiter for here document is too long");
11872 len = d - PL_tokenbuf;
11875 if (PL_madskills) {
11876 tstart = PL_tokenbuf + !outer;
11877 PL_thisclose = newSVpvn(tstart, len - !outer);
11878 tstart = SvPVX(PL_linestr) + stuffstart;
11879 PL_thisopen = newSVpvn(tstart, s - tstart);
11880 stuffstart = s - SvPVX(PL_linestr);
11883 #ifndef PERL_STRICT_CR
11884 d = strchr(s, '\r');
11886 char * const olds = s;
11888 while (s < PL_bufend) {
11894 else if (*s == '\n' && s[1] == '\r') { /* \015\013 on a mac? */
11903 SvCUR_set(PL_linestr, PL_bufend - SvPVX_const(PL_linestr));
11910 if ( outer || !(found_newline = (char*)memchr((void*)s, '\n', PL_bufend - s)) ) {
11911 herewas = newSVpvn(s,PL_bufend-s);
11915 herewas = newSVpvn(s-1,found_newline-s+1);
11918 herewas = newSVpvn(s,found_newline-s);
11922 if (PL_madskills) {
11923 tstart = SvPVX(PL_linestr) + stuffstart;
11925 sv_catpvn(PL_thisstuff, tstart, s - tstart);
11927 PL_thisstuff = newSVpvn(tstart, s - tstart);
11930 s += SvCUR(herewas);
11933 stuffstart = s - SvPVX(PL_linestr);
11939 tmpstr = newSV_type(SVt_PVIV);
11940 SvGROW(tmpstr, 80);
11941 if (term == '\'') {
11942 op_type = OP_CONST;
11943 SvIV_set(tmpstr, -1);
11945 else if (term == '`') {
11946 op_type = OP_BACKTICK;
11947 SvIV_set(tmpstr, '\\');
11951 PL_multi_start = CopLINE(PL_curcop);
11952 PL_multi_open = PL_multi_close = '<';
11953 term = *PL_tokenbuf;
11954 if (PL_lex_inwhat == OP_SUBST && PL_in_eval && !PL_rsfp) {
11955 char * const bufptr = PL_sublex_info.super_bufptr;
11956 char * const bufend = PL_sublex_info.super_bufend;
11957 char * const olds = s - SvCUR(herewas);
11958 s = strchr(bufptr, '\n');
11962 while (s < bufend &&
11963 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
11965 CopLINE_inc(PL_curcop);
11968 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
11969 missingterm(PL_tokenbuf);
11971 sv_setpvn(herewas,bufptr,d-bufptr+1);
11972 sv_setpvn(tmpstr,d+1,s-d);
11974 sv_catpvn(herewas,s,bufend-s);
11975 Copy(SvPVX_const(herewas),bufptr,SvCUR(herewas) + 1,char);
11982 while (s < PL_bufend &&
11983 (*s != term || memNE(s,PL_tokenbuf,len)) ) {
11985 CopLINE_inc(PL_curcop);
11987 if (s >= PL_bufend) {
11988 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
11989 missingterm(PL_tokenbuf);
11991 sv_setpvn(tmpstr,d+1,s-d);
11993 if (PL_madskills) {
11995 sv_catpvn(PL_thisstuff, d + 1, s - d);
11997 PL_thisstuff = newSVpvn(d + 1, s - d);
11998 stuffstart = s - SvPVX(PL_linestr);
12002 CopLINE_inc(PL_curcop); /* the preceding stmt passes a newline */
12004 sv_catpvn(herewas,s,PL_bufend-s);
12005 sv_setsv(PL_linestr,herewas);
12006 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart = SvPVX(PL_linestr);
12007 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12008 PL_last_lop = PL_last_uni = NULL;
12011 sv_setpvs(tmpstr,""); /* avoid "uninitialized" warning */
12012 while (s >= PL_bufend) { /* multiple line string? */
12014 if (PL_madskills) {
12015 tstart = SvPVX(PL_linestr) + stuffstart;
12017 sv_catpvn(PL_thisstuff, tstart, PL_bufend - tstart);
12019 PL_thisstuff = newSVpvn(tstart, PL_bufend - tstart);
12023 CopLINE_inc(PL_curcop);
12024 if (!outer || !lex_next_chunk(0)) {
12025 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
12026 missingterm(PL_tokenbuf);
12028 CopLINE_dec(PL_curcop);
12031 stuffstart = s - SvPVX(PL_linestr);
12033 CopLINE_inc(PL_curcop);
12034 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12035 PL_last_lop = PL_last_uni = NULL;
12036 #ifndef PERL_STRICT_CR
12037 if (PL_bufend - PL_linestart >= 2) {
12038 if ((PL_bufend[-2] == '\r' && PL_bufend[-1] == '\n') ||
12039 (PL_bufend[-2] == '\n' && PL_bufend[-1] == '\r'))
12041 PL_bufend[-2] = '\n';
12043 SvCUR_set(PL_linestr, PL_bufend - SvPVX_const(PL_linestr));
12045 else if (PL_bufend[-1] == '\r')
12046 PL_bufend[-1] = '\n';
12048 else if (PL_bufend - PL_linestart == 1 && PL_bufend[-1] == '\r')
12049 PL_bufend[-1] = '\n';
12051 if (*s == term && memEQ(s,PL_tokenbuf,len)) {
12052 STRLEN off = PL_bufend - 1 - SvPVX_const(PL_linestr);
12053 *(SvPVX(PL_linestr) + off ) = ' ';
12054 sv_catsv(PL_linestr,herewas);
12055 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12056 s = SvPVX(PL_linestr) + off; /* In case PV of PL_linestr moved. */
12060 sv_catsv(tmpstr,PL_linestr);
12065 PL_multi_end = CopLINE(PL_curcop);
12066 if (SvCUR(tmpstr) + 5 < SvLEN(tmpstr)) {
12067 SvPV_shrink_to_cur(tmpstr);
12069 SvREFCNT_dec(herewas);
12071 if (UTF && is_utf8_string((U8*)SvPVX_const(tmpstr), SvCUR(tmpstr)))
12073 else if (PL_encoding)
12074 sv_recode_to_utf8(tmpstr, PL_encoding);
12076 PL_lex_stuff = tmpstr;
12077 pl_yylval.ival = op_type;
12081 /* scan_inputsymbol
12082 takes: current position in input buffer
12083 returns: new position in input buffer
12084 side-effects: pl_yylval and lex_op are set.
12089 <FH> read from filehandle
12090 <pkg::FH> read from package qualified filehandle
12091 <pkg'FH> read from package qualified filehandle
12092 <$fh> read from filehandle in $fh
12093 <*.h> filename glob
12098 S_scan_inputsymbol(pTHX_ char *start)
12101 register char *s = start; /* current position in buffer */
12104 char *d = PL_tokenbuf; /* start of temp holding space */
12105 const char * const e = PL_tokenbuf + sizeof PL_tokenbuf; /* end of temp holding space */
12107 PERL_ARGS_ASSERT_SCAN_INPUTSYMBOL;
12109 end = strchr(s, '\n');
12112 s = delimcpy(d, e, s + 1, end, '>', &len); /* extract until > */
12114 /* die if we didn't have space for the contents of the <>,
12115 or if it didn't end, or if we see a newline
12118 if (len >= (I32)sizeof PL_tokenbuf)
12119 Perl_croak(aTHX_ "Excessively long <> operator");
12121 Perl_croak(aTHX_ "Unterminated <> operator");
12126 Remember, only scalar variables are interpreted as filehandles by
12127 this code. Anything more complex (e.g., <$fh{$num}>) will be
12128 treated as a glob() call.
12129 This code makes use of the fact that except for the $ at the front,
12130 a scalar variable and a filehandle look the same.
12132 if (*d == '$' && d[1]) d++;
12134 /* allow <Pkg'VALUE> or <Pkg::VALUE> */
12135 while (*d && (isALNUM_lazy_if(d,UTF) || *d == '\'' || *d == ':'))
12138 /* If we've tried to read what we allow filehandles to look like, and
12139 there's still text left, then it must be a glob() and not a getline.
12140 Use scan_str to pull out the stuff between the <> and treat it
12141 as nothing more than a string.
12144 if (d - PL_tokenbuf != len) {
12145 pl_yylval.ival = OP_GLOB;
12146 s = scan_str(start,!!PL_madskills,FALSE);
12148 Perl_croak(aTHX_ "Glob not terminated");
12152 bool readline_overriden = FALSE;
12155 /* we're in a filehandle read situation */
12158 /* turn <> into <ARGV> */
12160 Copy("ARGV",d,5,char);
12162 /* Check whether readline() is overriden */
12163 gv_readline = gv_fetchpvs("readline", GV_NOTQUAL, SVt_PVCV);
12165 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline))
12167 ((gvp = (GV**)hv_fetchs(PL_globalstash, "readline", FALSE))
12168 && (gv_readline = *gvp) && isGV_with_GP(gv_readline)
12169 && GvCVu(gv_readline) && GvIMPORTED_CV(gv_readline)))
12170 readline_overriden = TRUE;
12172 /* if <$fh>, create the ops to turn the variable into a
12176 /* try to find it in the pad for this block, otherwise find
12177 add symbol table ops
12179 const PADOFFSET tmp = pad_findmy(d, len, 0);
12180 if (tmp != NOT_IN_PAD) {
12181 if (PAD_COMPNAME_FLAGS_isOUR(tmp)) {
12182 HV * const stash = PAD_COMPNAME_OURSTASH(tmp);
12183 HEK * const stashname = HvNAME_HEK(stash);
12184 SV * const sym = sv_2mortal(newSVhek(stashname));
12185 sv_catpvs(sym, "::");
12186 sv_catpv(sym, d+1);
12191 OP * const o = newOP(OP_PADSV, 0);
12193 PL_lex_op = readline_overriden
12194 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
12195 append_elem(OP_LIST, o,
12196 newCVREF(0, newGVOP(OP_GV,0,gv_readline))))
12197 : (OP*)newUNOP(OP_READLINE, 0, o);
12206 ? (GV_ADDMULTI | GV_ADDINEVAL)
12209 PL_lex_op = readline_overriden
12210 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
12211 append_elem(OP_LIST,
12212 newUNOP(OP_RV2SV, 0, newGVOP(OP_GV, 0, gv)),
12213 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
12214 : (OP*)newUNOP(OP_READLINE, 0,
12215 newUNOP(OP_RV2SV, 0,
12216 newGVOP(OP_GV, 0, gv)));
12218 if (!readline_overriden)
12219 PL_lex_op->op_flags |= OPf_SPECIAL;
12220 /* we created the ops in PL_lex_op, so make pl_yylval.ival a null op */
12221 pl_yylval.ival = OP_NULL;
12224 /* If it's none of the above, it must be a literal filehandle
12225 (<Foo::BAR> or <FOO>) so build a simple readline OP */
12227 GV * const gv = gv_fetchpv(d, GV_ADD, SVt_PVIO);
12228 PL_lex_op = readline_overriden
12229 ? (OP*)newUNOP(OP_ENTERSUB, OPf_STACKED,
12230 append_elem(OP_LIST,
12231 newGVOP(OP_GV, 0, gv),
12232 newCVREF(0, newGVOP(OP_GV, 0, gv_readline))))
12233 : (OP*)newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, gv));
12234 pl_yylval.ival = OP_NULL;
12243 takes: start position in buffer
12244 keep_quoted preserve \ on the embedded delimiter(s)
12245 keep_delims preserve the delimiters around the string
12246 returns: position to continue reading from buffer
12247 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
12248 updates the read buffer.
12250 This subroutine pulls a string out of the input. It is called for:
12251 q single quotes q(literal text)
12252 ' single quotes 'literal text'
12253 qq double quotes qq(interpolate $here please)
12254 " double quotes "interpolate $here please"
12255 qx backticks qx(/bin/ls -l)
12256 ` backticks `/bin/ls -l`
12257 qw quote words @EXPORT_OK = qw( func() $spam )
12258 m// regexp match m/this/
12259 s/// regexp substitute s/this/that/
12260 tr/// string transliterate tr/this/that/
12261 y/// string transliterate y/this/that/
12262 ($*@) sub prototypes sub foo ($)
12263 (stuff) sub attr parameters sub foo : attr(stuff)
12264 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
12266 In most of these cases (all but <>, patterns and transliterate)
12267 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
12268 calls scan_str(). s/// makes yylex() call scan_subst() which calls
12269 scan_str(). tr/// and y/// make yylex() call scan_trans() which
12272 It skips whitespace before the string starts, and treats the first
12273 character as the delimiter. If the delimiter is one of ([{< then
12274 the corresponding "close" character )]}> is used as the closing
12275 delimiter. It allows quoting of delimiters, and if the string has
12276 balanced delimiters ([{<>}]) it allows nesting.
12278 On success, the SV with the resulting string is put into lex_stuff or,
12279 if that is already non-NULL, into lex_repl. The second case occurs only
12280 when parsing the RHS of the special constructs s/// and tr/// (y///).
12281 For convenience, the terminating delimiter character is stuffed into
12286 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
12289 SV *sv; /* scalar value: string */
12290 const char *tmps; /* temp string, used for delimiter matching */
12291 register char *s = start; /* current position in the buffer */
12292 register char term; /* terminating character */
12293 register char *to; /* current position in the sv's data */
12294 I32 brackets = 1; /* bracket nesting level */
12295 bool has_utf8 = FALSE; /* is there any utf8 content? */
12296 I32 termcode; /* terminating char. code */
12297 U8 termstr[UTF8_MAXBYTES]; /* terminating string */
12298 STRLEN termlen; /* length of terminating string */
12299 int last_off = 0; /* last position for nesting bracket */
12305 PERL_ARGS_ASSERT_SCAN_STR;
12307 /* skip space before the delimiter */
12313 if (PL_realtokenstart >= 0) {
12314 stuffstart = PL_realtokenstart;
12315 PL_realtokenstart = -1;
12318 stuffstart = start - SvPVX(PL_linestr);
12320 /* mark where we are, in case we need to report errors */
12323 /* after skipping whitespace, the next character is the terminator */
12326 termcode = termstr[0] = term;
12330 termcode = utf8_to_uvchr((U8*)s, &termlen);
12331 Copy(s, termstr, termlen, U8);
12332 if (!UTF8_IS_INVARIANT(term))
12336 /* mark where we are */
12337 PL_multi_start = CopLINE(PL_curcop);
12338 PL_multi_open = term;
12340 /* find corresponding closing delimiter */
12341 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
12342 termcode = termstr[0] = term = tmps[5];
12344 PL_multi_close = term;
12346 /* create a new SV to hold the contents. 79 is the SV's initial length.
12347 What a random number. */
12348 sv = newSV_type(SVt_PVIV);
12350 SvIV_set(sv, termcode);
12351 (void)SvPOK_only(sv); /* validate pointer */
12353 /* move past delimiter and try to read a complete string */
12355 sv_catpvn(sv, s, termlen);
12358 tstart = SvPVX(PL_linestr) + stuffstart;
12359 if (!PL_thisopen && !keep_delims) {
12360 PL_thisopen = newSVpvn(tstart, s - tstart);
12361 stuffstart = s - SvPVX(PL_linestr);
12365 if (PL_encoding && !UTF) {
12369 int offset = s - SvPVX_const(PL_linestr);
12370 const bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
12371 &offset, (char*)termstr, termlen);
12372 const char * const ns = SvPVX_const(PL_linestr) + offset;
12373 char * const svlast = SvEND(sv) - 1;
12375 for (; s < ns; s++) {
12376 if (*s == '\n' && !PL_rsfp)
12377 CopLINE_inc(PL_curcop);
12380 goto read_more_line;
12382 /* handle quoted delimiters */
12383 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
12385 for (t = svlast-2; t >= SvPVX_const(sv) && *t == '\\';)
12387 if ((svlast-1 - t) % 2) {
12388 if (!keep_quoted) {
12389 *(svlast-1) = term;
12391 SvCUR_set(sv, SvCUR(sv) - 1);
12396 if (PL_multi_open == PL_multi_close) {
12402 for (t = w = SvPVX(sv)+last_off; t < svlast; w++, t++) {
12403 /* At here, all closes are "was quoted" one,
12404 so we don't check PL_multi_close. */
12406 if (!keep_quoted && *(t+1) == PL_multi_open)
12411 else if (*t == PL_multi_open)
12419 SvCUR_set(sv, w - SvPVX_const(sv));
12421 last_off = w - SvPVX(sv);
12422 if (--brackets <= 0)
12427 if (!keep_delims) {
12428 SvCUR_set(sv, SvCUR(sv) - 1);
12434 /* extend sv if need be */
12435 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
12436 /* set 'to' to the next character in the sv's string */
12437 to = SvPVX(sv)+SvCUR(sv);
12439 /* if open delimiter is the close delimiter read unbridle */
12440 if (PL_multi_open == PL_multi_close) {
12441 for (; s < PL_bufend; s++,to++) {
12442 /* embedded newlines increment the current line number */
12443 if (*s == '\n' && !PL_rsfp)
12444 CopLINE_inc(PL_curcop);
12445 /* handle quoted delimiters */
12446 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
12447 if (!keep_quoted && s[1] == term)
12449 /* any other quotes are simply copied straight through */
12453 /* terminate when run out of buffer (the for() condition), or
12454 have found the terminator */
12455 else if (*s == term) {
12458 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
12461 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
12467 /* if the terminator isn't the same as the start character (e.g.,
12468 matched brackets), we have to allow more in the quoting, and
12469 be prepared for nested brackets.
12472 /* read until we run out of string, or we find the terminator */
12473 for (; s < PL_bufend; s++,to++) {
12474 /* embedded newlines increment the line count */
12475 if (*s == '\n' && !PL_rsfp)
12476 CopLINE_inc(PL_curcop);
12477 /* backslashes can escape the open or closing characters */
12478 if (*s == '\\' && s+1 < PL_bufend) {
12479 if (!keep_quoted &&
12480 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
12485 /* allow nested opens and closes */
12486 else if (*s == PL_multi_close && --brackets <= 0)
12488 else if (*s == PL_multi_open)
12490 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
12495 /* terminate the copied string and update the sv's end-of-string */
12497 SvCUR_set(sv, to - SvPVX_const(sv));
12500 * this next chunk reads more into the buffer if we're not done yet
12504 break; /* handle case where we are done yet :-) */
12506 #ifndef PERL_STRICT_CR
12507 if (to - SvPVX_const(sv) >= 2) {
12508 if ((to[-2] == '\r' && to[-1] == '\n') ||
12509 (to[-2] == '\n' && to[-1] == '\r'))
12513 SvCUR_set(sv, to - SvPVX_const(sv));
12515 else if (to[-1] == '\r')
12518 else if (to - SvPVX_const(sv) == 1 && to[-1] == '\r')
12523 /* if we're out of file, or a read fails, bail and reset the current
12524 line marker so we can report where the unterminated string began
12527 if (PL_madskills) {
12528 char * const tstart = SvPVX(PL_linestr) + stuffstart;
12530 sv_catpvn(PL_thisstuff, tstart, PL_bufend - tstart);
12532 PL_thisstuff = newSVpvn(tstart, PL_bufend - tstart);
12535 CopLINE_inc(PL_curcop);
12536 PL_bufptr = PL_bufend;
12537 if (!lex_next_chunk(0)) {
12539 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
12548 /* at this point, we have successfully read the delimited string */
12550 if (!PL_encoding || UTF) {
12552 if (PL_madskills) {
12553 char * const tstart = SvPVX(PL_linestr) + stuffstart;
12554 const int len = s - tstart;
12556 sv_catpvn(PL_thisstuff, tstart, len);
12558 PL_thisstuff = newSVpvn(tstart, len);
12559 if (!PL_thisclose && !keep_delims)
12560 PL_thisclose = newSVpvn(s,termlen);
12565 sv_catpvn(sv, s, termlen);
12570 if (PL_madskills) {
12571 char * const tstart = SvPVX(PL_linestr) + stuffstart;
12572 const int len = s - tstart - termlen;
12574 sv_catpvn(PL_thisstuff, tstart, len);
12576 PL_thisstuff = newSVpvn(tstart, len);
12577 if (!PL_thisclose && !keep_delims)
12578 PL_thisclose = newSVpvn(s - termlen,termlen);
12582 if (has_utf8 || PL_encoding)
12585 PL_multi_end = CopLINE(PL_curcop);
12587 /* if we allocated too much space, give some back */
12588 if (SvCUR(sv) + 5 < SvLEN(sv)) {
12589 SvLEN_set(sv, SvCUR(sv) + 1);
12590 SvPV_renew(sv, SvLEN(sv));
12593 /* decide whether this is the first or second quoted string we've read
12606 takes: pointer to position in buffer
12607 returns: pointer to new position in buffer
12608 side-effects: builds ops for the constant in pl_yylval.op
12610 Read a number in any of the formats that Perl accepts:
12612 \d(_?\d)*(\.(\d(_?\d)*)?)?[Ee][\+\-]?(\d(_?\d)*) 12 12.34 12.
12613 \.\d(_?\d)*[Ee][\+\-]?(\d(_?\d)*) .34
12616 0x[0-9A-Fa-f](_?[0-9A-Fa-f])*
12618 Like most scan_ routines, it uses the PL_tokenbuf buffer to hold the
12621 If it reads a number without a decimal point or an exponent, it will
12622 try converting the number to an integer and see if it can do so
12623 without loss of precision.
12627 Perl_scan_num(pTHX_ const char *start, YYSTYPE* lvalp)
12630 register const char *s = start; /* current position in buffer */
12631 register char *d; /* destination in temp buffer */
12632 register char *e; /* end of temp buffer */
12633 NV nv; /* number read, as a double */
12634 SV *sv = NULL; /* place to put the converted number */
12635 bool floatit; /* boolean: int or float? */
12636 const char *lastub = NULL; /* position of last underbar */
12637 static char const number_too_long[] = "Number too long";
12639 PERL_ARGS_ASSERT_SCAN_NUM;
12641 /* We use the first character to decide what type of number this is */
12645 Perl_croak(aTHX_ "panic: scan_num");
12647 /* if it starts with a 0, it could be an octal number, a decimal in
12648 0.13 disguise, or a hexadecimal number, or a binary number. */
12652 u holds the "number so far"
12653 shift the power of 2 of the base
12654 (hex == 4, octal == 3, binary == 1)
12655 overflowed was the number more than we can hold?
12657 Shift is used when we add a digit. It also serves as an "are
12658 we in octal/hex/binary?" indicator to disallow hex characters
12659 when in octal mode.
12664 bool overflowed = FALSE;
12665 bool just_zero = TRUE; /* just plain 0 or binary number? */
12666 static const NV nvshift[5] = { 1.0, 2.0, 4.0, 8.0, 16.0 };
12667 static const char* const bases[5] =
12668 { "", "binary", "", "octal", "hexadecimal" };
12669 static const char* const Bases[5] =
12670 { "", "Binary", "", "Octal", "Hexadecimal" };
12671 static const char* const maxima[5] =
12673 "0b11111111111111111111111111111111",
12677 const char *base, *Base, *max;
12679 /* check for hex */
12684 } else if (s[1] == 'b') {
12689 /* check for a decimal in disguise */
12690 else if (s[1] == '.' || s[1] == 'e' || s[1] == 'E')
12692 /* so it must be octal */
12699 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12700 "Misplaced _ in number");
12704 base = bases[shift];
12705 Base = Bases[shift];
12706 max = maxima[shift];
12708 /* read the rest of the number */
12710 /* x is used in the overflow test,
12711 b is the digit we're adding on. */
12716 /* if we don't mention it, we're done */
12720 /* _ are ignored -- but warned about if consecutive */
12722 if (lastub && s == lastub + 1)
12723 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12724 "Misplaced _ in number");
12728 /* 8 and 9 are not octal */
12729 case '8': case '9':
12731 yyerror(Perl_form(aTHX_ "Illegal octal digit '%c'", *s));
12735 case '2': case '3': case '4':
12736 case '5': case '6': case '7':
12738 yyerror(Perl_form(aTHX_ "Illegal binary digit '%c'", *s));
12741 case '0': case '1':
12742 b = *s++ & 15; /* ASCII digit -> value of digit */
12746 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
12747 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
12748 /* make sure they said 0x */
12751 b = (*s++ & 7) + 9;
12753 /* Prepare to put the digit we have onto the end
12754 of the number so far. We check for overflows.
12760 x = u << shift; /* make room for the digit */
12762 if ((x >> shift) != u
12763 && !(PL_hints & HINT_NEW_BINARY)) {
12766 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
12767 "Integer overflow in %s number",
12770 u = x | b; /* add the digit to the end */
12773 n *= nvshift[shift];
12774 /* If an NV has not enough bits in its
12775 * mantissa to represent an UV this summing of
12776 * small low-order numbers is a waste of time
12777 * (because the NV cannot preserve the
12778 * low-order bits anyway): we could just
12779 * remember when did we overflow and in the
12780 * end just multiply n by the right
12788 /* if we get here, we had success: make a scalar value from
12793 /* final misplaced underbar check */
12794 if (s[-1] == '_') {
12795 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
12800 if (n > 4294967295.0)
12801 Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
12802 "%s number > %s non-portable",
12808 if (u > 0xffffffff)
12809 Perl_ck_warner(aTHX_ packWARN(WARN_PORTABLE),
12810 "%s number > %s non-portable",
12815 if (just_zero && (PL_hints & HINT_NEW_INTEGER))
12816 sv = new_constant(start, s - start, "integer",
12817 sv, NULL, NULL, 0);
12818 else if (PL_hints & HINT_NEW_BINARY)
12819 sv = new_constant(start, s - start, "binary", sv, NULL, NULL, 0);
12824 handle decimal numbers.
12825 we're also sent here when we read a 0 as the first digit
12827 case '1': case '2': case '3': case '4': case '5':
12828 case '6': case '7': case '8': case '9': case '.':
12831 e = PL_tokenbuf + sizeof PL_tokenbuf - 6; /* room for various punctuation */
12834 /* read next group of digits and _ and copy into d */
12835 while (isDIGIT(*s) || *s == '_') {
12836 /* skip underscores, checking for misplaced ones
12840 if (lastub && s == lastub + 1)
12841 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12842 "Misplaced _ in number");
12846 /* check for end of fixed-length buffer */
12848 Perl_croak(aTHX_ number_too_long);
12849 /* if we're ok, copy the character */
12854 /* final misplaced underbar check */
12855 if (lastub && s == lastub + 1) {
12856 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), "Misplaced _ in number");
12859 /* read a decimal portion if there is one. avoid
12860 3..5 being interpreted as the number 3. followed
12863 if (*s == '.' && s[1] != '.') {
12868 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12869 "Misplaced _ in number");
12873 /* copy, ignoring underbars, until we run out of digits.
12875 for (; isDIGIT(*s) || *s == '_'; s++) {
12876 /* fixed length buffer check */
12878 Perl_croak(aTHX_ number_too_long);
12880 if (lastub && s == lastub + 1)
12881 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12882 "Misplaced _ in number");
12888 /* fractional part ending in underbar? */
12889 if (s[-1] == '_') {
12890 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12891 "Misplaced _ in number");
12893 if (*s == '.' && isDIGIT(s[1])) {
12894 /* oops, it's really a v-string, but without the "v" */
12900 /* read exponent part, if present */
12901 if ((*s == 'e' || *s == 'E') && strchr("+-0123456789_", s[1])) {
12905 /* regardless of whether user said 3E5 or 3e5, use lower 'e' */
12906 *d++ = 'e'; /* At least some Mach atof()s don't grok 'E' */
12908 /* stray preinitial _ */
12910 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12911 "Misplaced _ in number");
12915 /* allow positive or negative exponent */
12916 if (*s == '+' || *s == '-')
12919 /* stray initial _ */
12921 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12922 "Misplaced _ in number");
12926 /* read digits of exponent */
12927 while (isDIGIT(*s) || *s == '_') {
12930 Perl_croak(aTHX_ number_too_long);
12934 if (((lastub && s == lastub + 1) ||
12935 (!isDIGIT(s[1]) && s[1] != '_')))
12936 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
12937 "Misplaced _ in number");
12944 /* make an sv from the string */
12948 We try to do an integer conversion first if no characters
12949 indicating "float" have been found.
12954 const int flags = grok_number (PL_tokenbuf, d - PL_tokenbuf, &uv);
12956 if (flags == IS_NUMBER_IN_UV) {
12958 sv_setiv(sv, uv); /* Prefer IVs over UVs. */
12961 } else if (flags == (IS_NUMBER_IN_UV | IS_NUMBER_NEG)) {
12962 if (uv <= (UV) IV_MIN)
12963 sv_setiv(sv, -(IV)uv);
12970 /* terminate the string */
12972 nv = Atof(PL_tokenbuf);
12977 ? (PL_hints & HINT_NEW_FLOAT) : (PL_hints & HINT_NEW_INTEGER) ) {
12978 const char *const key = floatit ? "float" : "integer";
12979 const STRLEN keylen = floatit ? 5 : 7;
12980 sv = S_new_constant(aTHX_ PL_tokenbuf, d - PL_tokenbuf,
12981 key, keylen, sv, NULL, NULL, 0);
12985 /* if it starts with a v, it could be a v-string */
12988 sv = newSV(5); /* preallocate storage space */
12989 s = scan_vstring(s, PL_bufend, sv);
12993 /* make the op for the constant and return */
12996 lvalp->opval = newSVOP(OP_CONST, 0, sv);
12998 lvalp->opval = NULL;
13004 S_scan_formline(pTHX_ register char *s)
13007 register char *eol;
13009 SV * const stuff = newSVpvs("");
13010 bool needargs = FALSE;
13011 bool eofmt = FALSE;
13013 char *tokenstart = s;
13014 SV* savewhite = NULL;
13016 if (PL_madskills) {
13017 savewhite = PL_thiswhite;
13022 PERL_ARGS_ASSERT_SCAN_FORMLINE;
13024 while (!needargs) {
13027 #ifdef PERL_STRICT_CR
13028 while (SPACE_OR_TAB(*t))
13031 while (SPACE_OR_TAB(*t) || *t == '\r')
13034 if (*t == '\n' || t == PL_bufend) {
13039 if (PL_in_eval && !PL_rsfp) {
13040 eol = (char *) memchr(s,'\n',PL_bufend-s);
13045 eol = PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
13047 for (t = s; t < eol; t++) {
13048 if (*t == '~' && t[1] == '~' && SvCUR(stuff)) {
13050 goto enough; /* ~~ must be first line in formline */
13052 if (*t == '@' || *t == '^')
13056 sv_catpvn(stuff, s, eol-s);
13057 #ifndef PERL_STRICT_CR
13058 if (eol-s > 1 && eol[-2] == '\r' && eol[-1] == '\n') {
13059 char *end = SvPVX(stuff) + SvCUR(stuff);
13062 SvCUR_set(stuff, SvCUR(stuff) - 1);
13073 if (PL_madskills) {
13075 sv_catpvn(PL_thistoken, tokenstart, PL_bufend - tokenstart);
13077 PL_thistoken = newSVpvn(tokenstart, PL_bufend - tokenstart);
13080 PL_bufptr = PL_bufend;
13081 CopLINE_inc(PL_curcop);
13082 got_some = lex_next_chunk(0);
13083 CopLINE_dec(PL_curcop);
13086 tokenstart = PL_bufptr;
13094 if (SvCUR(stuff)) {
13097 PL_lex_state = LEX_NORMAL;
13098 start_force(PL_curforce);
13099 NEXTVAL_NEXTTOKE.ival = 0;
13103 PL_lex_state = LEX_FORMLINE;
13105 if (UTF && is_utf8_string((U8*)SvPVX_const(stuff), SvCUR(stuff)))
13107 else if (PL_encoding)
13108 sv_recode_to_utf8(stuff, PL_encoding);
13110 start_force(PL_curforce);
13111 NEXTVAL_NEXTTOKE.opval = (OP*)newSVOP(OP_CONST, 0, stuff);
13113 start_force(PL_curforce);
13114 NEXTVAL_NEXTTOKE.ival = OP_FORMLINE;
13118 SvREFCNT_dec(stuff);
13120 PL_lex_formbrack = 0;
13124 if (PL_madskills) {
13126 sv_catpvn(PL_thistoken, tokenstart, s - tokenstart);
13128 PL_thistoken = newSVpvn(tokenstart, s - tokenstart);
13129 PL_thiswhite = savewhite;
13136 Perl_start_subparse(pTHX_ I32 is_format, U32 flags)
13139 const I32 oldsavestack_ix = PL_savestack_ix;
13140 CV* const outsidecv = PL_compcv;
13143 assert(SvTYPE(PL_compcv) == SVt_PVCV);
13145 SAVEI32(PL_subline);
13146 save_item(PL_subname);
13147 SAVESPTR(PL_compcv);
13149 PL_compcv = MUTABLE_CV(newSV_type(is_format ? SVt_PVFM : SVt_PVCV));
13150 CvFLAGS(PL_compcv) |= flags;
13152 PL_subline = CopLINE(PL_curcop);
13153 CvPADLIST(PL_compcv) = pad_new(padnew_SAVE|padnew_SAVESUB);
13154 CvOUTSIDE(PL_compcv) = MUTABLE_CV(SvREFCNT_inc_simple(outsidecv));
13155 CvOUTSIDE_SEQ(PL_compcv) = PL_cop_seqmax;
13157 return oldsavestack_ix;
13161 #pragma segment Perl_yylex
13164 S_yywarn(pTHX_ const char *const s)
13168 PERL_ARGS_ASSERT_YYWARN;
13170 PL_in_eval |= EVAL_WARNONLY;
13172 PL_in_eval &= ~EVAL_WARNONLY;
13177 Perl_yyerror(pTHX_ const char *const s)
13180 const char *where = NULL;
13181 const char *context = NULL;
13184 int yychar = PL_parser->yychar;
13186 PERL_ARGS_ASSERT_YYERROR;
13188 if (!yychar || (yychar == ';' && !PL_rsfp))
13190 else if (PL_oldoldbufptr && PL_bufptr > PL_oldoldbufptr &&
13191 PL_bufptr - PL_oldoldbufptr < 200 && PL_oldoldbufptr != PL_oldbufptr &&
13192 PL_oldbufptr != PL_bufptr) {
13195 The code below is removed for NetWare because it abends/crashes on NetWare
13196 when the script has error such as not having the closing quotes like:
13197 if ($var eq "value)
13198 Checking of white spaces is anyway done in NetWare code.
13201 while (isSPACE(*PL_oldoldbufptr))
13204 context = PL_oldoldbufptr;
13205 contlen = PL_bufptr - PL_oldoldbufptr;
13207 else if (PL_oldbufptr && PL_bufptr > PL_oldbufptr &&
13208 PL_bufptr - PL_oldbufptr < 200 && PL_oldbufptr != PL_bufptr) {
13211 The code below is removed for NetWare because it abends/crashes on NetWare
13212 when the script has error such as not having the closing quotes like:
13213 if ($var eq "value)
13214 Checking of white spaces is anyway done in NetWare code.
13217 while (isSPACE(*PL_oldbufptr))
13220 context = PL_oldbufptr;
13221 contlen = PL_bufptr - PL_oldbufptr;
13223 else if (yychar > 255)
13224 where = "next token ???";
13225 else if (yychar == -2) { /* YYEMPTY */
13226 if (PL_lex_state == LEX_NORMAL ||
13227 (PL_lex_state == LEX_KNOWNEXT && PL_lex_defer == LEX_NORMAL))
13228 where = "at end of line";
13229 else if (PL_lex_inpat)
13230 where = "within pattern";
13232 where = "within string";
13235 SV * const where_sv = newSVpvs_flags("next char ", SVs_TEMP);
13237 Perl_sv_catpvf(aTHX_ where_sv, "^%c", toCTRL(yychar));
13238 else if (isPRINT_LC(yychar)) {
13239 const char string = yychar;
13240 sv_catpvn(where_sv, &string, 1);
13243 Perl_sv_catpvf(aTHX_ where_sv, "\\%03o", yychar & 255);
13244 where = SvPVX_const(where_sv);
13246 msg = sv_2mortal(newSVpv(s, 0));
13247 Perl_sv_catpvf(aTHX_ msg, " at %s line %"IVdf", ",
13248 OutCopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
13250 Perl_sv_catpvf(aTHX_ msg, "near \"%.*s\"\n", contlen, context);
13252 Perl_sv_catpvf(aTHX_ msg, "%s\n", where);
13253 if (PL_multi_start < PL_multi_end && (U32)(CopLINE(PL_curcop) - PL_multi_end) <= 1) {
13254 Perl_sv_catpvf(aTHX_ msg,
13255 " (Might be a runaway multi-line %c%c string starting on line %"IVdf")\n",
13256 (int)PL_multi_open,(int)PL_multi_close,(IV)PL_multi_start);
13259 if (PL_in_eval & EVAL_WARNONLY) {
13260 Perl_ck_warner_d(aTHX_ packWARN(WARN_SYNTAX), "%"SVf, SVfARG(msg));
13264 if (PL_error_count >= 10) {
13265 if (PL_in_eval && SvCUR(ERRSV))
13266 Perl_croak(aTHX_ "%"SVf"%s has too many errors.\n",
13267 SVfARG(ERRSV), OutCopFILE(PL_curcop));
13269 Perl_croak(aTHX_ "%s has too many errors.\n",
13270 OutCopFILE(PL_curcop));
13273 PL_in_my_stash = NULL;
13277 #pragma segment Main
13281 S_swallow_bom(pTHX_ U8 *s)
13284 const STRLEN slen = SvCUR(PL_linestr);
13286 PERL_ARGS_ASSERT_SWALLOW_BOM;
13290 if (s[1] == 0xFE) {
13291 /* UTF-16 little-endian? (or UTF-32LE?) */
13292 if (s[2] == 0 && s[3] == 0) /* UTF-32 little-endian */
13293 Perl_croak(aTHX_ "Unsupported script encoding UTF-32LE");
13294 #ifndef PERL_NO_UTF16_FILTER
13295 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (BOM)\n");
13297 if (PL_bufend > (char*)s) {
13298 s = add_utf16_textfilter(s, TRUE);
13301 Perl_croak(aTHX_ "Unsupported script encoding UTF-16LE");
13306 if (s[1] == 0xFF) { /* UTF-16 big-endian? */
13307 #ifndef PERL_NO_UTF16_FILTER
13308 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (BOM)\n");
13310 if (PL_bufend > (char *)s) {
13311 s = add_utf16_textfilter(s, FALSE);
13314 Perl_croak(aTHX_ "Unsupported script encoding UTF-16BE");
13319 if (slen > 2 && s[1] == 0xBB && s[2] == 0xBF) {
13320 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
13321 s += 3; /* UTF-8 */
13327 if (s[2] == 0xFE && s[3] == 0xFF) {
13328 /* UTF-32 big-endian */
13329 Perl_croak(aTHX_ "Unsupported script encoding UTF-32BE");
13332 else if (s[2] == 0 && s[3] != 0) {
13335 * are a good indicator of UTF-16BE. */
13336 #ifndef PERL_NO_UTF16_FILTER
13337 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16BE script encoding (no BOM)\n");
13338 s = add_utf16_textfilter(s, FALSE);
13340 Perl_croak(aTHX_ "Unsupported script encoding UTF-16BE");
13346 if (slen > 3 && s[1] == 0x73 && s[2] == 0x66 && s[3] == 0x73) {
13347 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-8 script encoding (BOM)\n");
13348 s += 4; /* UTF-8 */
13354 if (slen > 3 && s[1] == 0 && s[2] != 0 && s[3] == 0) {
13357 * are a good indicator of UTF-16LE. */
13358 #ifndef PERL_NO_UTF16_FILTER
13359 if (DEBUG_p_TEST || DEBUG_T_TEST) PerlIO_printf(Perl_debug_log, "UTF-16LE script encoding (no BOM)\n");
13360 s = add_utf16_textfilter(s, TRUE);
13362 Perl_croak(aTHX_ "Unsupported script encoding UTF-16LE");
13370 #ifndef PERL_NO_UTF16_FILTER
13372 S_utf16_textfilter(pTHX_ int idx, SV *sv, int maxlen)
13375 SV *const filter = FILTER_DATA(idx);
13376 /* We re-use this each time round, throwing the contents away before we
13378 SV *const utf16_buffer = MUTABLE_SV(IoTOP_GV(filter));
13379 SV *const utf8_buffer = filter;
13380 IV status = IoPAGE(filter);
13381 const bool reverse = (bool) IoLINES(filter);
13384 /* As we're automatically added, at the lowest level, and hence only called
13385 from this file, we can be sure that we're not called in block mode. Hence
13386 don't bother writing code to deal with block mode. */
13388 Perl_croak(aTHX_ "panic: utf16_textfilter called in block mode (for %d characters)", maxlen);
13391 Perl_croak(aTHX_ "panic: utf16_textfilter called after error (status=%"IVdf")", status);
13393 DEBUG_P(PerlIO_printf(Perl_debug_log,
13394 "utf16_textfilter(%p,%ce): idx=%d maxlen=%d status=%"IVdf" utf16=%"UVuf" utf8=%"UVuf"\n",
13395 FPTR2DPTR(void *, S_utf16_textfilter),
13396 reverse ? 'l' : 'b', idx, maxlen, status,
13397 (UV)SvCUR(utf16_buffer), (UV)SvCUR(utf8_buffer)));
13404 /* First, look in our buffer of existing UTF-8 data: */
13405 char *nl = (char *)memchr(SvPVX(utf8_buffer), '\n', SvCUR(utf8_buffer));
13409 } else if (status == 0) {
13411 IoPAGE(filter) = 0;
13412 nl = SvEND(utf8_buffer);
13415 STRLEN got = nl - SvPVX(utf8_buffer);
13416 /* Did we have anything to append? */
13418 sv_catpvn(sv, SvPVX(utf8_buffer), got);
13419 /* Everything else in this code works just fine if SVp_POK isn't
13420 set. This, however, needs it, and we need it to work, else
13421 we loop infinitely because the buffer is never consumed. */
13422 sv_chop(utf8_buffer, nl);
13426 /* OK, not a complete line there, so need to read some more UTF-16.
13427 Read an extra octect if the buffer currently has an odd number. */
13431 if (SvCUR(utf16_buffer) >= 2) {
13432 /* Location of the high octet of the last complete code point.
13433 Gosh, UTF-16 is a pain. All the benefits of variable length,
13434 *coupled* with all the benefits of partial reads and
13436 const U8 *const last_hi = (U8*)SvPVX(utf16_buffer)
13437 + ((SvCUR(utf16_buffer) & ~1) - (reverse ? 1 : 2));
13439 if (*last_hi < 0xd8 || *last_hi > 0xdb) {
13443 /* We have the first half of a surrogate. Read more. */
13444 DEBUG_P(PerlIO_printf(Perl_debug_log, "utf16_textfilter partial surrogate detected at %p\n", last_hi));
13447 status = FILTER_READ(idx + 1, utf16_buffer,
13448 160 + (SvCUR(utf16_buffer) & 1));
13449 DEBUG_P(PerlIO_printf(Perl_debug_log, "utf16_textfilter status=%"IVdf" SvCUR(sv)=%"UVuf"\n", status, (UV)SvCUR(utf16_buffer)));
13450 DEBUG_P({ sv_dump(utf16_buffer); sv_dump(utf8_buffer);});
13453 IoPAGE(filter) = status;
13458 chars = SvCUR(utf16_buffer) >> 1;
13459 have = SvCUR(utf8_buffer);
13460 SvGROW(utf8_buffer, have + chars * 3 + 1);
13463 end = utf16_to_utf8_reversed((U8*)SvPVX(utf16_buffer),
13464 (U8*)SvPVX_const(utf8_buffer) + have,
13465 chars * 2, &newlen);
13467 end = utf16_to_utf8((U8*)SvPVX(utf16_buffer),
13468 (U8*)SvPVX_const(utf8_buffer) + have,
13469 chars * 2, &newlen);
13471 SvCUR_set(utf8_buffer, have + newlen);
13474 /* No need to keep this SV "well-formed" with a '\0' after the end, as
13475 it's private to us, and utf16_to_utf8{,reversed} take a
13476 (pointer,length) pair, rather than a NUL-terminated string. */
13477 if(SvCUR(utf16_buffer) & 1) {
13478 *SvPVX(utf16_buffer) = SvEND(utf16_buffer)[-1];
13479 SvCUR_set(utf16_buffer, 1);
13481 SvCUR_set(utf16_buffer, 0);
13484 DEBUG_P(PerlIO_printf(Perl_debug_log,
13485 "utf16_textfilter: returns, status=%"IVdf" utf16=%"UVuf" utf8=%"UVuf"\n",
13487 (UV)SvCUR(utf16_buffer), (UV)SvCUR(utf8_buffer)));
13488 DEBUG_P({ sv_dump(utf8_buffer); sv_dump(sv);});
13493 S_add_utf16_textfilter(pTHX_ U8 *const s, bool reversed)
13495 SV *filter = filter_add(S_utf16_textfilter, NULL);
13497 IoTOP_GV(filter) = MUTABLE_GV(newSVpvn((char *)s, PL_bufend - (char*)s));
13498 sv_setpvs(filter, "");
13499 IoLINES(filter) = reversed;
13500 IoPAGE(filter) = 1; /* Not EOF */
13502 /* Sadly, we have to return a valid pointer, come what may, so we have to
13503 ignore any error return from this. */
13504 SvCUR_set(PL_linestr, 0);
13505 if (FILTER_READ(0, PL_linestr, 0)) {
13506 SvUTF8_on(PL_linestr);
13508 SvUTF8_on(PL_linestr);
13510 PL_bufend = SvEND(PL_linestr);
13511 return (U8*)SvPVX(PL_linestr);
13516 Returns a pointer to the next character after the parsed
13517 vstring, as well as updating the passed in sv.
13519 Function must be called like
13522 s = scan_vstring(s,e,sv);
13524 where s and e are the start and end of the string.
13525 The sv should already be large enough to store the vstring
13526 passed in, for performance reasons.
13531 Perl_scan_vstring(pTHX_ const char *s, const char *const e, SV *sv)
13534 const char *pos = s;
13535 const char *start = s;
13537 PERL_ARGS_ASSERT_SCAN_VSTRING;
13539 if (*pos == 'v') pos++; /* get past 'v' */
13540 while (pos < e && (isDIGIT(*pos) || *pos == '_'))
13542 if ( *pos != '.') {
13543 /* this may not be a v-string if followed by => */
13544 const char *next = pos;
13545 while (next < e && isSPACE(*next))
13547 if ((e - next) >= 2 && *next == '=' && next[1] == '>' ) {
13548 /* return string not v-string */
13549 sv_setpvn(sv,(char *)s,pos-s);
13550 return (char *)pos;
13554 if (!isALPHA(*pos)) {
13555 U8 tmpbuf[UTF8_MAXBYTES+1];
13558 s++; /* get past 'v' */
13563 /* this is atoi() that tolerates underscores */
13566 const char *end = pos;
13568 while (--end >= s) {
13570 const UV orev = rev;
13571 rev += (*end - '0') * mult;
13574 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
13575 "Integer overflow in decimal number");
13579 if (rev > 0x7FFFFFFF)
13580 Perl_croak(aTHX_ "In EBCDIC the v-string components cannot exceed 2147483647");
13582 /* Append native character for the rev point */
13583 tmpend = uvchr_to_utf8(tmpbuf, rev);
13584 sv_catpvn(sv, (const char*)tmpbuf, tmpend - tmpbuf);
13585 if (!UNI_IS_INVARIANT(NATIVE_TO_UNI(rev)))
13587 if (pos + 1 < e && *pos == '.' && isDIGIT(pos[1]))
13593 while (pos < e && (isDIGIT(*pos) || *pos == '_'))
13597 sv_magic(sv,NULL,PERL_MAGIC_vstring,(const char*)start, pos-start);
13604 Perl_keyword_plugin_standard(pTHX_
13605 char *keyword_ptr, STRLEN keyword_len, OP **op_ptr)
13607 PERL_ARGS_ASSERT_KEYWORD_PLUGIN_STANDARD;
13608 PERL_UNUSED_CONTEXT;
13609 PERL_UNUSED_ARG(keyword_ptr);
13610 PERL_UNUSED_ARG(keyword_len);
13611 PERL_UNUSED_ARG(op_ptr);
13612 return KEYWORD_PLUGIN_DECLINE;
13617 * c-indentation-style: bsd
13618 * c-basic-offset: 4
13619 * indent-tabs-mode: t
13622 * ex: set ts=8 sts=4 sw=4 noet: