This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
1st day's EBCDIC fixes:
[perl5.git] / toke.c
CommitLineData
a0d0e21e 1/* toke.c
a687059c 2 *
bc89e66f 3 * Copyright (c) 1991-2001, Larry Wall
a687059c 4 *
d48672a2
LW
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
378cc40b 7 *
a0d0e21e
LW
8 */
9
10/*
11 * "It all comes from here, the stench and the peril." --Frodo
378cc40b
LW
12 */
13
9cbb5ea2
GS
14/*
15 * This file is the lexer for Perl. It's closely linked to the
4e553d73 16 * parser, perly.y.
ffb4593c
NT
17 *
18 * The main routine is yylex(), which returns the next token.
19 */
20
378cc40b 21#include "EXTERN.h"
864dbfa3 22#define PERL_IN_TOKE_C
378cc40b 23#include "perl.h"
378cc40b 24
d3b6f988
GS
25#define yychar PL_yychar
26#define yylval PL_yylval
27
fc36a67e 28static char ident_too_long[] = "Identifier too long";
8903cb82 29
51371543 30static void restore_rsfp(pTHXo_ void *f);
6e3aabd6
GS
31#ifndef PERL_NO_UTF16_FILTER
32static I32 utf16_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
33static I32 utf16rev_textfilter(pTHXo_ int idx, SV *sv, int maxlen);
34#endif
51371543 35
9059aa12
LW
36#define XFAKEBRACK 128
37#define XENUMMASK 127
38
7e2040f0 39/*#define UTF (SvUTF8(PL_linestr) && !(PL_hints & HINT_BYTE))*/
a0ed51b3
LW
40#define UTF (PL_hints & HINT_UTF8)
41
4e553d73 42/* In variables name $^X, these are the legal values for X.
2b92dfce
GS
43 * 1999-02-27 mjd-perl-patch@plover.com */
44#define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
45
bf4acbe4
GS
46/* On MacOS, respect nonbreaking spaces */
47#ifdef MACOS_TRADITIONAL
48#define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
49#else
50#define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
51#endif
52
ffb4593c
NT
53/* LEX_* are values for PL_lex_state, the state of the lexer.
54 * They are arranged oddly so that the guard on the switch statement
79072805
LW
55 * can get by with a single comparison (if the compiler is smart enough).
56 */
57
fb73857a
PP
58/* #define LEX_NOTPARSING 11 is done in perl.h. */
59
55497cff
PP
60#define LEX_NORMAL 10
61#define LEX_INTERPNORMAL 9
62#define LEX_INTERPCASEMOD 8
63#define LEX_INTERPPUSH 7
64#define LEX_INTERPSTART 6
65#define LEX_INTERPEND 5
66#define LEX_INTERPENDMAYBE 4
67#define LEX_INTERPCONCAT 3
68#define LEX_INTERPCONST 2
69#define LEX_FORMLINE 1
70#define LEX_KNOWNEXT 0
79072805 71
79072805
LW
72#ifdef ff_next
73#undef ff_next
d48672a2
LW
74#endif
75
a1a0e61e 76#ifdef USE_PURE_BISON
dba4d153
JH
77# ifndef YYMAXLEVEL
78# define YYMAXLEVEL 100
79# endif
20141f0e
RI
80YYSTYPE* yylval_pointer[YYMAXLEVEL];
81int* yychar_pointer[YYMAXLEVEL];
6f202aea 82int yyactlevel = -1;
22c35a8c
GS
83# undef yylval
84# undef yychar
20141f0e
RI
85# define yylval (*yylval_pointer[yyactlevel])
86# define yychar (*yychar_pointer[yyactlevel])
87# define PERL_YYLEX_PARAM yylval_pointer[yyactlevel],yychar_pointer[yyactlevel]
4e553d73 88# undef yylex
dba4d153 89# define yylex() Perl_yylex_r(aTHX_ yylval_pointer[yyactlevel],yychar_pointer[yyactlevel])
a1a0e61e
TD
90#endif
91
79072805 92#include "keywords.h"
fe14fcc3 93
ffb4593c
NT
94/* CLINE is a macro that ensures PL_copline has a sane value */
95
ae986130
LW
96#ifdef CLINE
97#undef CLINE
98#endif
57843af0 99#define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
3280af22 100
ffb4593c
NT
101/*
102 * Convenience functions to return different tokens and prime the
9cbb5ea2 103 * lexer for the next token. They all take an argument.
ffb4593c
NT
104 *
105 * TOKEN : generic token (used for '(', DOLSHARP, etc)
106 * OPERATOR : generic operator
107 * AOPERATOR : assignment operator
108 * PREBLOCK : beginning the block after an if, while, foreach, ...
109 * PRETERMBLOCK : beginning a non-code-defining {} block (eg, hash ref)
110 * PREREF : *EXPR where EXPR is not a simple identifier
111 * TERM : expression term
112 * LOOPX : loop exiting command (goto, last, dump, etc)
113 * FTST : file test operator
114 * FUN0 : zero-argument function
2d2e263d 115 * FUN1 : not used, except for not, which isn't a UNIOP
ffb4593c
NT
116 * BOop : bitwise or or xor
117 * BAop : bitwise and
118 * SHop : shift operator
119 * PWop : power operator
9cbb5ea2 120 * PMop : pattern-matching operator
ffb4593c
NT
121 * Aop : addition-level operator
122 * Mop : multiplication-level operator
123 * Eop : equality-testing operator
e5edeb50 124 * Rop : relational operator <= != gt
ffb4593c
NT
125 *
126 * Also see LOP and lop() below.
127 */
128
075953c3
JH
129/* Note that REPORT() and REPORT2() will be expressions that supply
130 * their own trailing comma, not suitable for statements as such. */
998054bd 131#ifdef DEBUGGING /* Serve -DT. */
075953c3
JH
132# define REPORT(x,retval) tokereport(x,s,(int)retval),
133# define REPORT2(x,retval) tokereport(x,s, yylval.ival),
998054bd 134#else
075953c3
JH
135# define REPORT(x,retval)
136# define REPORT2(x,retval)
998054bd
SC
137#endif
138
075953c3
JH
139#define TOKEN(retval) return (REPORT2("token",retval) PL_bufptr = s,(int)retval)
140#define OPERATOR(retval) return (REPORT2("operator",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval)
141#define AOPERATOR(retval) return ao((REPORT2("aop",retval) PL_expect = XTERM, PL_bufptr = s,(int)retval))
142#define PREBLOCK(retval) return (REPORT2("preblock",retval) PL_expect = XBLOCK,PL_bufptr = s,(int)retval)
143#define PRETERMBLOCK(retval) return (REPORT2("pretermblock",retval) PL_expect = XTERMBLOCK,PL_bufptr = s,(int)retval)
144#define PREREF(retval) return (REPORT2("preref",retval) PL_expect = XREF,PL_bufptr = s,(int)retval)
145#define TERM(retval) return (CLINE, REPORT2("term",retval) PL_expect = XOPERATOR, PL_bufptr = s,(int)retval)
146#define LOOPX(f) return(yylval.ival=f, REPORT("loopx",f) PL_expect = XTERM,PL_bufptr = s,(int)LOOPEX)
147#define FTST(f) return(yylval.ival=f, REPORT("ftst",f) PL_expect = XTERM,PL_bufptr = s,(int)UNIOP)
148#define FUN0(f) return(yylval.ival = f, REPORT("fun0",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC0)
149#define FUN1(f) return(yylval.ival = f, REPORT("fun1",f) PL_expect = XOPERATOR,PL_bufptr = s,(int)FUNC1)
150#define BOop(f) return ao((yylval.ival=f, REPORT("bitorop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITOROP))
151#define BAop(f) return ao((yylval.ival=f, REPORT("bitandop",f) PL_expect = XTERM,PL_bufptr = s,(int)BITANDOP))
152#define SHop(f) return ao((yylval.ival=f, REPORT("shiftop",f) PL_expect = XTERM,PL_bufptr = s,(int)SHIFTOP))
153#define PWop(f) return ao((yylval.ival=f, REPORT("powop",f) PL_expect = XTERM,PL_bufptr = s,(int)POWOP))
154#define PMop(f) return(yylval.ival=f, REPORT("matchop",f) PL_expect = XTERM,PL_bufptr = s,(int)MATCHOP)
155#define Aop(f) return ao((yylval.ival=f, REPORT("add",f) PL_expect = XTERM,PL_bufptr = s,(int)ADDOP))
156#define Mop(f) return ao((yylval.ival=f, REPORT("mul",f) PL_expect = XTERM,PL_bufptr = s,(int)MULOP))
157#define Eop(f) return(yylval.ival=f, REPORT("eq",f) PL_expect = XTERM,PL_bufptr = s,(int)EQOP)
158#define Rop(f) return(yylval.ival=f, REPORT("rel",f) PL_expect = XTERM,PL_bufptr = s,(int)RELOP)
2f3197b3 159
a687059c
LW
160/* This bit of chicanery makes a unary function followed by
161 * a parenthesis into a function with one argument, highest precedence.
162 */
2f3197b3 163#define UNI(f) return(yylval.ival = f, \
075953c3 164 REPORT("uni",f) \
3280af22
NIS
165 PL_expect = XTERM, \
166 PL_bufptr = s, \
167 PL_last_uni = PL_oldbufptr, \
168 PL_last_lop_op = f, \
a687059c
LW
169 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
170
79072805 171#define UNIBRACK(f) return(yylval.ival = f, \
075953c3 172 REPORT("uni",f) \
3280af22
NIS
173 PL_bufptr = s, \
174 PL_last_uni = PL_oldbufptr, \
79072805
LW
175 (*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
176
9f68db38 177/* grandfather return to old style */
3280af22 178#define OLDLOP(f) return(yylval.ival=f,PL_expect = XTERM,PL_bufptr = s,(int)LSTOP)
79072805 179
2d00ba3b 180STATIC void
61b2116b 181S_tokereport(pTHX_ char *thing, char* s, I32 rv)
9041c2e3 182{
998054bd
SC
183 SV *report;
184 DEBUG_T({
185 report = newSVpv(thing, 0);
61b2116b 186 Perl_sv_catpvf(aTHX_ report, ":line %i:%i:", CopLINE(PL_curcop), rv);
998054bd
SC
187
188 if (s - PL_bufptr > 0)
189 sv_catpvn(report, PL_bufptr, s - PL_bufptr);
190 else {
191 if (PL_oldbufptr && *PL_oldbufptr)
192 sv_catpv(report, PL_tokenbuf);
193 }
194 PerlIO_printf(Perl_debug_log, "### %s\n", SvPV_nolen(report));
195 })
196}
197
ffb4593c
NT
198/*
199 * S_ao
200 *
201 * This subroutine detects &&= and ||= and turns an ANDAND or OROR
202 * into an OP_ANDASSIGN or OP_ORASSIGN
203 */
204
76e3520e 205STATIC int
cea2e8a9 206S_ao(pTHX_ int toketype)
a0d0e21e 207{
3280af22
NIS
208 if (*PL_bufptr == '=') {
209 PL_bufptr++;
a0d0e21e
LW
210 if (toketype == ANDAND)
211 yylval.ival = OP_ANDASSIGN;
212 else if (toketype == OROR)
213 yylval.ival = OP_ORASSIGN;
214 toketype = ASSIGNOP;
215 }
216 return toketype;
217}
218
ffb4593c
NT
219/*
220 * S_no_op
221 * When Perl expects an operator and finds something else, no_op
222 * prints the warning. It always prints "<something> found where
223 * operator expected. It prints "Missing semicolon on previous line?"
224 * if the surprise occurs at the start of the line. "do you need to
225 * predeclare ..." is printed out for code like "sub bar; foo bar $x"
226 * where the compiler doesn't know if foo is a method call or a function.
227 * It prints "Missing operator before end of line" if there's nothing
228 * after the missing operator, or "... before <...>" if there is something
229 * after the missing operator.
230 */
231
76e3520e 232STATIC void
cea2e8a9 233S_no_op(pTHX_ char *what, char *s)
463ee0b2 234{
3280af22
NIS
235 char *oldbp = PL_bufptr;
236 bool is_first = (PL_oldbufptr == PL_linestart);
68dc0745 237
1189a94a
GS
238 if (!s)
239 s = oldbp;
07c798fb 240 else
1189a94a 241 PL_bufptr = s;
cea2e8a9 242 yywarn(Perl_form(aTHX_ "%s found where operator expected", what));
748a9306 243 if (is_first)
cea2e8a9 244 Perl_warn(aTHX_ "\t(Missing semicolon on previous line?)\n");
7e2040f0 245 else if (PL_oldoldbufptr && isIDFIRST_lazy_if(PL_oldoldbufptr,UTF)) {
748a9306 246 char *t;
7e2040f0 247 for (t = PL_oldoldbufptr; *t && (isALNUM_lazy_if(t,UTF) || *t == ':'); t++) ;
3280af22 248 if (t < PL_bufptr && isSPACE(*t))
cea2e8a9 249 Perl_warn(aTHX_ "\t(Do you need to predeclare %.*s?)\n",
3280af22 250 t - PL_oldoldbufptr, PL_oldoldbufptr);
748a9306 251 }
07c798fb
HS
252 else {
253 assert(s >= oldbp);
cea2e8a9 254 Perl_warn(aTHX_ "\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
07c798fb 255 }
3280af22 256 PL_bufptr = oldbp;
8990e307
LW
257}
258
ffb4593c
NT
259/*
260 * S_missingterm
261 * Complain about missing quote/regexp/heredoc terminator.
262 * If it's called with (char *)NULL then it cauterizes the line buffer.
263 * If we're in a delimited string and the delimiter is a control
264 * character, it's reformatted into a two-char sequence like ^C.
265 * This is fatal.
266 */
267
76e3520e 268STATIC void
cea2e8a9 269S_missingterm(pTHX_ char *s)
8990e307
LW
270{
271 char tmpbuf[3];
272 char q;
273 if (s) {
274 char *nl = strrchr(s,'\n');
d2719217 275 if (nl)
8990e307
LW
276 *nl = '\0';
277 }
9d116dd7
JH
278 else if (
279#ifdef EBCDIC
280 iscntrl(PL_multi_close)
281#else
282 PL_multi_close < 32 || PL_multi_close == 127
283#endif
284 ) {
8990e307 285 *tmpbuf = '^';
3280af22 286 tmpbuf[1] = toCTRL(PL_multi_close);
8990e307
LW
287 s = "\\n";
288 tmpbuf[2] = '\0';
289 s = tmpbuf;
290 }
291 else {
3280af22 292 *tmpbuf = PL_multi_close;
8990e307
LW
293 tmpbuf[1] = '\0';
294 s = tmpbuf;
295 }
296 q = strchr(s,'"') ? '\'' : '"';
cea2e8a9 297 Perl_croak(aTHX_ "Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
463ee0b2 298}
79072805 299
ffb4593c
NT
300/*
301 * Perl_deprecate
ffb4593c
NT
302 */
303
79072805 304void
864dbfa3 305Perl_deprecate(pTHX_ char *s)
a0d0e21e 306{
599cee73 307 if (ckWARN(WARN_DEPRECATED))
cea2e8a9 308 Perl_warner(aTHX_ WARN_DEPRECATED, "Use of %s is deprecated", s);
a0d0e21e
LW
309}
310
ffb4593c
NT
311/*
312 * depcom
9cbb5ea2 313 * Deprecate a comma-less variable list.
ffb4593c
NT
314 */
315
76e3520e 316STATIC void
cea2e8a9 317S_depcom(pTHX)
a0d0e21e
LW
318{
319 deprecate("comma-less variable list");
320}
321
ffb4593c 322/*
9cbb5ea2
GS
323 * experimental text filters for win32 carriage-returns, utf16-to-utf8 and
324 * utf16-to-utf8-reversed.
ffb4593c
NT
325 */
326
c39cd008
GS
327#ifdef PERL_CR_FILTER
328static void
329strip_return(SV *sv)
330{
331 register char *s = SvPVX(sv);
332 register char *e = s + SvCUR(sv);
333 /* outer loop optimized to do nothing if there are no CR-LFs */
334 while (s < e) {
335 if (*s++ == '\r' && *s == '\n') {
336 /* hit a CR-LF, need to copy the rest */
337 register char *d = s - 1;
338 *d++ = *s++;
339 while (s < e) {
340 if (*s == '\r' && s[1] == '\n')
341 s++;
342 *d++ = *s++;
343 }
344 SvCUR(sv) -= s - d;
345 return;
346 }
347 }
348}
a868473f 349
76e3520e 350STATIC I32
c39cd008 351S_cr_textfilter(pTHX_ int idx, SV *sv, int maxlen)
a868473f 352{
c39cd008
GS
353 I32 count = FILTER_READ(idx+1, sv, maxlen);
354 if (count > 0 && !maxlen)
355 strip_return(sv);
356 return count;
a868473f
NIS
357}
358#endif
359
ffb4593c
NT
360/*
361 * Perl_lex_start
9cbb5ea2
GS
362 * Initialize variables. Uses the Perl save_stack to save its state (for
363 * recursive calls to the parser).
ffb4593c
NT
364 */
365
a0d0e21e 366void
864dbfa3 367Perl_lex_start(pTHX_ SV *line)
79072805 368{
8990e307
LW
369 char *s;
370 STRLEN len;
371
3280af22
NIS
372 SAVEI32(PL_lex_dojoin);
373 SAVEI32(PL_lex_brackets);
3280af22
NIS
374 SAVEI32(PL_lex_casemods);
375 SAVEI32(PL_lex_starts);
376 SAVEI32(PL_lex_state);
7766f137 377 SAVEVPTR(PL_lex_inpat);
3280af22 378 SAVEI32(PL_lex_inwhat);
18b09519
GS
379 if (PL_lex_state == LEX_KNOWNEXT) {
380 I32 toke = PL_nexttoke;
381 while (--toke >= 0) {
382 SAVEI32(PL_nexttype[toke]);
383 SAVEVPTR(PL_nextval[toke]);
384 }
385 SAVEI32(PL_nexttoke);
18b09519 386 }
57843af0 387 SAVECOPLINE(PL_curcop);
3280af22
NIS
388 SAVEPPTR(PL_bufptr);
389 SAVEPPTR(PL_bufend);
390 SAVEPPTR(PL_oldbufptr);
391 SAVEPPTR(PL_oldoldbufptr);
207e3d1a
JH
392 SAVEPPTR(PL_last_lop);
393 SAVEPPTR(PL_last_uni);
3280af22
NIS
394 SAVEPPTR(PL_linestart);
395 SAVESPTR(PL_linestr);
396 SAVEPPTR(PL_lex_brackstack);
397 SAVEPPTR(PL_lex_casestack);
c76ac1ee 398 SAVEDESTRUCTOR_X(restore_rsfp, PL_rsfp);
3280af22
NIS
399 SAVESPTR(PL_lex_stuff);
400 SAVEI32(PL_lex_defer);
09bef843 401 SAVEI32(PL_sublex_info.sub_inwhat);
3280af22 402 SAVESPTR(PL_lex_repl);
bebdddfc
GS
403 SAVEINT(PL_expect);
404 SAVEINT(PL_lex_expect);
3280af22
NIS
405
406 PL_lex_state = LEX_NORMAL;
407 PL_lex_defer = 0;
408 PL_expect = XSTATE;
409 PL_lex_brackets = 0;
3280af22
NIS
410 New(899, PL_lex_brackstack, 120, char);
411 New(899, PL_lex_casestack, 12, char);
412 SAVEFREEPV(PL_lex_brackstack);
413 SAVEFREEPV(PL_lex_casestack);
414 PL_lex_casemods = 0;
415 *PL_lex_casestack = '\0';
416 PL_lex_dojoin = 0;
417 PL_lex_starts = 0;
418 PL_lex_stuff = Nullsv;
419 PL_lex_repl = Nullsv;
420 PL_lex_inpat = 0;
76be56bc 421 PL_nexttoke = 0;
3280af22 422 PL_lex_inwhat = 0;
09bef843 423 PL_sublex_info.sub_inwhat = 0;
3280af22
NIS
424 PL_linestr = line;
425 if (SvREADONLY(PL_linestr))
426 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
427 s = SvPV(PL_linestr, len);
8990e307 428 if (len && s[len-1] != ';') {
3280af22
NIS
429 if (!(SvFLAGS(PL_linestr) & SVs_TEMP))
430 PL_linestr = sv_2mortal(newSVsv(PL_linestr));
431 sv_catpvn(PL_linestr, "\n;", 2);
8990e307 432 }
3280af22
NIS
433 SvTEMP_off(PL_linestr);
434 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = SvPVX(PL_linestr);
435 PL_bufend = PL_bufptr + SvCUR(PL_linestr);
207e3d1a 436 PL_last_lop = PL_last_uni = Nullch;
3280af22 437 SvREFCNT_dec(PL_rs);
79cb57f6 438 PL_rs = newSVpvn("\n", 1);
3280af22 439 PL_rsfp = 0;
79072805 440}
a687059c 441
ffb4593c
NT
442/*
443 * Perl_lex_end
9cbb5ea2
GS
444 * Finalizer for lexing operations. Must be called when the parser is
445 * done with the lexer.
ffb4593c
NT
446 */
447
463ee0b2 448void
864dbfa3 449Perl_lex_end(pTHX)
463ee0b2 450{
3280af22 451 PL_doextract = FALSE;
463ee0b2
LW
452}
453
ffb4593c
NT
454/*
455 * S_incline
456 * This subroutine has nothing to do with tilting, whether at windmills
457 * or pinball tables. Its name is short for "increment line". It
57843af0 458 * increments the current line number in CopLINE(PL_curcop) and checks
ffb4593c 459 * to see whether the line starts with a comment of the form
9cbb5ea2
GS
460 * # line 500 "foo.pm"
461 * If so, it sets the current line number and file to the values in the comment.
ffb4593c
NT
462 */
463
76e3520e 464STATIC void
cea2e8a9 465S_incline(pTHX_ char *s)
463ee0b2
LW
466{
467 char *t;
468 char *n;
73659bf1 469 char *e;
463ee0b2 470 char ch;
463ee0b2 471
57843af0 472 CopLINE_inc(PL_curcop);
463ee0b2
LW
473 if (*s++ != '#')
474 return;
bf4acbe4 475 while (SPACE_OR_TAB(*s)) s++;
73659bf1
GS
476 if (strnEQ(s, "line", 4))
477 s += 4;
478 else
479 return;
084592ab 480 if (SPACE_OR_TAB(*s))
73659bf1 481 s++;
4e553d73 482 else
73659bf1 483 return;
bf4acbe4 484 while (SPACE_OR_TAB(*s)) s++;
463ee0b2
LW
485 if (!isDIGIT(*s))
486 return;
487 n = s;
488 while (isDIGIT(*s))
489 s++;
bf4acbe4 490 while (SPACE_OR_TAB(*s))
463ee0b2 491 s++;
73659bf1 492 if (*s == '"' && (t = strchr(s+1, '"'))) {
463ee0b2 493 s++;
73659bf1
GS
494 e = t + 1;
495 }
463ee0b2 496 else {
463ee0b2 497 for (t = s; !isSPACE(*t); t++) ;
73659bf1 498 e = t;
463ee0b2 499 }
bf4acbe4 500 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
73659bf1
GS
501 e++;
502 if (*e != '\n' && *e != '\0')
503 return; /* false alarm */
504
463ee0b2
LW
505 ch = *t;
506 *t = '\0';
f4dd75d9
GS
507 if (t - s > 0) {
508#ifdef USE_ITHREADS
509 Safefree(CopFILE(PL_curcop));
510#else
511 SvREFCNT_dec(CopFILEGV(PL_curcop));
512#endif
57843af0 513 CopFILE_set(PL_curcop, s);
f4dd75d9 514 }
463ee0b2 515 *t = ch;
57843af0 516 CopLINE_set(PL_curcop, atoi(n)-1);
463ee0b2
LW
517}
518
ffb4593c
NT
519/*
520 * S_skipspace
521 * Called to gobble the appropriate amount and type of whitespace.
522 * Skips comments as well.
523 */
524
76e3520e 525STATIC char *
cea2e8a9 526S_skipspace(pTHX_ register char *s)
a687059c 527{
3280af22 528 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
bf4acbe4 529 while (s < PL_bufend && SPACE_OR_TAB(*s))
463ee0b2
LW
530 s++;
531 return s;
532 }
533 for (;;) {
fd049845 534 STRLEN prevlen;
09bef843
SB
535 SSize_t oldprevlen, oldoldprevlen;
536 SSize_t oldloplen, oldunilen;
60e6418e
GS
537 while (s < PL_bufend && isSPACE(*s)) {
538 if (*s++ == '\n' && PL_in_eval && !PL_rsfp)
539 incline(s);
540 }
ffb4593c
NT
541
542 /* comment */
3280af22
NIS
543 if (s < PL_bufend && *s == '#') {
544 while (s < PL_bufend && *s != '\n')
463ee0b2 545 s++;
60e6418e 546 if (s < PL_bufend) {
463ee0b2 547 s++;
60e6418e
GS
548 if (PL_in_eval && !PL_rsfp) {
549 incline(s);
550 continue;
551 }
552 }
463ee0b2 553 }
ffb4593c
NT
554
555 /* only continue to recharge the buffer if we're at the end
556 * of the buffer, we're not reading from a source filter, and
557 * we're in normal lexing mode
558 */
09bef843
SB
559 if (s < PL_bufend || !PL_rsfp || PL_sublex_info.sub_inwhat ||
560 PL_lex_state == LEX_FORMLINE)
463ee0b2 561 return s;
ffb4593c
NT
562
563 /* try to recharge the buffer */
9cbb5ea2
GS
564 if ((s = filter_gets(PL_linestr, PL_rsfp,
565 (prevlen = SvCUR(PL_linestr)))) == Nullch)
566 {
567 /* end of file. Add on the -p or -n magic */
3280af22
NIS
568 if (PL_minus_n || PL_minus_p) {
569 sv_setpv(PL_linestr,PL_minus_p ?
08e9d68e
DD
570 ";}continue{print or die qq(-p destination: $!\\n)" :
571 "");
3280af22
NIS
572 sv_catpv(PL_linestr,";}");
573 PL_minus_n = PL_minus_p = 0;
a0d0e21e
LW
574 }
575 else
3280af22 576 sv_setpv(PL_linestr,";");
ffb4593c
NT
577
578 /* reset variables for next time we lex */
9cbb5ea2
GS
579 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
580 = SvPVX(PL_linestr);
3280af22 581 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 582 PL_last_lop = PL_last_uni = Nullch;
ffb4593c
NT
583
584 /* Close the filehandle. Could be from -P preprocessor,
585 * STDIN, or a regular file. If we were reading code from
586 * STDIN (because the commandline held no -e or filename)
587 * then we don't close it, we reset it so the code can
588 * read from STDIN too.
589 */
590
3280af22
NIS
591 if (PL_preprocess && !PL_in_eval)
592 (void)PerlProc_pclose(PL_rsfp);
593 else if ((PerlIO*)PL_rsfp == PerlIO_stdin())
594 PerlIO_clearerr(PL_rsfp);
8990e307 595 else
3280af22
NIS
596 (void)PerlIO_close(PL_rsfp);
597 PL_rsfp = Nullfp;
463ee0b2
LW
598 return s;
599 }
ffb4593c
NT
600
601 /* not at end of file, so we only read another line */
09bef843
SB
602 /* make corresponding updates to old pointers, for yyerror() */
603 oldprevlen = PL_oldbufptr - PL_bufend;
604 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
605 if (PL_last_uni)
606 oldunilen = PL_last_uni - PL_bufend;
607 if (PL_last_lop)
608 oldloplen = PL_last_lop - PL_bufend;
3280af22
NIS
609 PL_linestart = PL_bufptr = s + prevlen;
610 PL_bufend = s + SvCUR(PL_linestr);
611 s = PL_bufptr;
09bef843
SB
612 PL_oldbufptr = s + oldprevlen;
613 PL_oldoldbufptr = s + oldoldprevlen;
614 if (PL_last_uni)
615 PL_last_uni = s + oldunilen;
616 if (PL_last_lop)
617 PL_last_lop = s + oldloplen;
a0d0e21e 618 incline(s);
ffb4593c
NT
619
620 /* debugger active and we're not compiling the debugger code,
621 * so store the line into the debugger's array of lines
622 */
3280af22 623 if (PERLDB_LINE && PL_curstash != PL_debstash) {
8990e307
LW
624 SV *sv = NEWSV(85,0);
625
626 sv_upgrade(sv, SVt_PVMG);
3280af22 627 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
57843af0 628 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
8990e307 629 }
463ee0b2 630 }
a687059c 631}
378cc40b 632
ffb4593c
NT
633/*
634 * S_check_uni
635 * Check the unary operators to ensure there's no ambiguity in how they're
636 * used. An ambiguous piece of code would be:
637 * rand + 5
638 * This doesn't mean rand() + 5. Because rand() is a unary operator,
639 * the +5 is its argument.
640 */
641
76e3520e 642STATIC void
cea2e8a9 643S_check_uni(pTHX)
ba106d47 644{
2f3197b3 645 char *s;
a0d0e21e 646 char *t;
2f3197b3 647
3280af22 648 if (PL_oldoldbufptr != PL_last_uni)
2f3197b3 649 return;
3280af22
NIS
650 while (isSPACE(*PL_last_uni))
651 PL_last_uni++;
7e2040f0 652 for (s = PL_last_uni; isALNUM_lazy_if(s,UTF) || *s == '-'; s++) ;
3280af22 653 if ((t = strchr(s, '(')) && t < PL_bufptr)
a0d0e21e 654 return;
0453d815 655 if (ckWARN_d(WARN_AMBIGUOUS)){
f248d071 656 char ch = *s;
0453d815 657 *s = '\0';
4e553d73
NIS
658 Perl_warner(aTHX_ WARN_AMBIGUOUS,
659 "Warning: Use of \"%s\" without parens is ambiguous",
0453d815
PM
660 PL_last_uni);
661 *s = ch;
662 }
2f3197b3
LW
663}
664
ffb4593c
NT
665/* workaround to replace the UNI() macro with a function. Only the
666 * hints/uts.sh file mentions this. Other comments elsewhere in the
667 * source indicate Microport Unix might need it too.
668 */
669
ffed7fef
LW
670#ifdef CRIPPLED_CC
671
672#undef UNI
ffed7fef 673#define UNI(f) return uni(f,s)
ffed7fef 674
76e3520e 675STATIC int
cea2e8a9 676S_uni(pTHX_ I32 f, char *s)
ffed7fef
LW
677{
678 yylval.ival = f;
3280af22
NIS
679 PL_expect = XTERM;
680 PL_bufptr = s;
8f872242
NIS
681 PL_last_uni = PL_oldbufptr;
682 PL_last_lop_op = f;
ffed7fef
LW
683 if (*s == '(')
684 return FUNC1;
685 s = skipspace(s);
686 if (*s == '(')
687 return FUNC1;
688 else
689 return UNIOP;
690}
691
a0d0e21e
LW
692#endif /* CRIPPLED_CC */
693
ffb4593c
NT
694/*
695 * LOP : macro to build a list operator. Its behaviour has been replaced
696 * with a subroutine, S_lop() for which LOP is just another name.
697 */
698
a0d0e21e
LW
699#define LOP(f,x) return lop(f,x,s)
700
ffb4593c
NT
701/*
702 * S_lop
703 * Build a list operator (or something that might be one). The rules:
704 * - if we have a next token, then it's a list operator [why?]
705 * - if the next thing is an opening paren, then it's a function
706 * - else it's a list operator
707 */
708
76e3520e 709STATIC I32
a0be28da 710S_lop(pTHX_ I32 f, int x, char *s)
ffed7fef 711{
79072805 712 yylval.ival = f;
35c8bce7 713 CLINE;
075953c3 714 REPORT("lop", f)
3280af22
NIS
715 PL_expect = x;
716 PL_bufptr = s;
717 PL_last_lop = PL_oldbufptr;
718 PL_last_lop_op = f;
719 if (PL_nexttoke)
a0d0e21e 720 return LSTOP;
79072805
LW
721 if (*s == '(')
722 return FUNC;
723 s = skipspace(s);
724 if (*s == '(')
725 return FUNC;
726 else
727 return LSTOP;
728}
729
ffb4593c
NT
730/*
731 * S_force_next
9cbb5ea2 732 * When the lexer realizes it knows the next token (for instance,
ffb4593c 733 * it is reordering tokens for the parser) then it can call S_force_next
9cbb5ea2
GS
734 * to know what token to return the next time the lexer is called. Caller
735 * will need to set PL_nextval[], and possibly PL_expect to ensure the lexer
736 * handles the token correctly.
ffb4593c
NT
737 */
738
4e553d73 739STATIC void
cea2e8a9 740S_force_next(pTHX_ I32 type)
79072805 741{
3280af22
NIS
742 PL_nexttype[PL_nexttoke] = type;
743 PL_nexttoke++;
744 if (PL_lex_state != LEX_KNOWNEXT) {
745 PL_lex_defer = PL_lex_state;
746 PL_lex_expect = PL_expect;
747 PL_lex_state = LEX_KNOWNEXT;
79072805
LW
748 }
749}
750
ffb4593c
NT
751/*
752 * S_force_word
753 * When the lexer knows the next thing is a word (for instance, it has
754 * just seen -> and it knows that the next char is a word char, then
755 * it calls S_force_word to stick the next word into the PL_next lookahead.
756 *
757 * Arguments:
b1b65b59 758 * char *start : buffer position (must be within PL_linestr)
ffb4593c
NT
759 * int token : PL_next will be this type of bare word (e.g., METHOD,WORD)
760 * int check_keyword : if true, Perl checks to make sure the word isn't
761 * a keyword (do this if the word is a label, e.g. goto FOO)
762 * int allow_pack : if true, : characters will also be allowed (require,
763 * use, etc. do this)
9cbb5ea2 764 * int allow_initial_tick : used by the "sub" lexer only.
ffb4593c
NT
765 */
766
76e3520e 767STATIC char *
cea2e8a9 768S_force_word(pTHX_ register char *start, int token, int check_keyword, int allow_pack, int allow_initial_tick)
79072805 769{
463ee0b2
LW
770 register char *s;
771 STRLEN len;
4e553d73 772
463ee0b2
LW
773 start = skipspace(start);
774 s = start;
7e2040f0 775 if (isIDFIRST_lazy_if(s,UTF) ||
a0d0e21e 776 (allow_pack && *s == ':') ||
15f0808c 777 (allow_initial_tick && *s == '\'') )
a0d0e21e 778 {
3280af22
NIS
779 s = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, allow_pack, &len);
780 if (check_keyword && keyword(PL_tokenbuf, len))
463ee0b2
LW
781 return start;
782 if (token == METHOD) {
783 s = skipspace(s);
784 if (*s == '(')
3280af22 785 PL_expect = XTERM;
463ee0b2 786 else {
3280af22 787 PL_expect = XOPERATOR;
463ee0b2 788 }
79072805 789 }
3280af22
NIS
790 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(PL_tokenbuf,0));
791 PL_nextval[PL_nexttoke].opval->op_private |= OPpCONST_BARE;
79072805
LW
792 force_next(token);
793 }
794 return s;
795}
796
ffb4593c
NT
797/*
798 * S_force_ident
9cbb5ea2 799 * Called when the lexer wants $foo *foo &foo etc, but the program
ffb4593c
NT
800 * text only contains the "foo" portion. The first argument is a pointer
801 * to the "foo", and the second argument is the type symbol to prefix.
802 * Forces the next token to be a "WORD".
9cbb5ea2 803 * Creates the symbol if it didn't already exist (via gv_fetchpv()).
ffb4593c
NT
804 */
805
76e3520e 806STATIC void
cea2e8a9 807S_force_ident(pTHX_ register char *s, int kind)
79072805
LW
808{
809 if (s && *s) {
11343788 810 OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
3280af22 811 PL_nextval[PL_nexttoke].opval = o;
79072805 812 force_next(WORD);
748a9306 813 if (kind) {
11343788 814 o->op_private = OPpCONST_ENTERED;
55497cff
PP
815 /* XXX see note in pp_entereval() for why we forgo typo
816 warnings if the symbol must be introduced in an eval.
817 GSAR 96-10-12 */
3280af22 818 gv_fetchpv(s, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
a0d0e21e
LW
819 kind == '$' ? SVt_PV :
820 kind == '@' ? SVt_PVAV :
821 kind == '%' ? SVt_PVHV :
822 SVt_PVGV
823 );
748a9306 824 }
79072805
LW
825 }
826}
827
1571675a
GS
828NV
829Perl_str_to_version(pTHX_ SV *sv)
830{
831 NV retval = 0.0;
832 NV nshift = 1.0;
833 STRLEN len;
834 char *start = SvPVx(sv,len);
3aa33fe5 835 bool utf = SvUTF8(sv) ? TRUE : FALSE;
1571675a
GS
836 char *end = start + len;
837 while (start < end) {
ba210ebe 838 STRLEN skip;
1571675a
GS
839 UV n;
840 if (utf)
9041c2e3 841 n = utf8n_to_uvchr((U8*)start, len, &skip, 0);
1571675a
GS
842 else {
843 n = *(U8*)start;
844 skip = 1;
845 }
846 retval += ((NV)n)/nshift;
847 start += skip;
848 nshift *= 1000;
849 }
850 return retval;
851}
852
4e553d73 853/*
ffb4593c
NT
854 * S_force_version
855 * Forces the next token to be a version number.
856 */
857
76e3520e 858STATIC char *
cea2e8a9 859S_force_version(pTHX_ char *s)
89bfa8cd
PP
860{
861 OP *version = Nullop;
44dcb63b 862 char *d;
89bfa8cd
PP
863
864 s = skipspace(s);
865
44dcb63b 866 d = s;
dd629d5b 867 if (*d == 'v')
44dcb63b 868 d++;
44dcb63b 869 if (isDIGIT(*d)) {
a7cb1f99 870 for (; isDIGIT(*d) || *d == '_' || *d == '.'; d++);
9f3d182e 871 if (*d == ';' || isSPACE(*d) || *d == '}' || !*d) {
dd629d5b 872 SV *ver;
b73d6f50 873 s = scan_num(s, &yylval);
89bfa8cd 874 version = yylval.opval;
dd629d5b
GS
875 ver = cSVOPx(version)->op_sv;
876 if (SvPOK(ver) && !SvNIOK(ver)) {
155aba94 877 (void)SvUPGRADE(ver, SVt_PVNV);
1571675a
GS
878 SvNVX(ver) = str_to_version(ver);
879 SvNOK_on(ver); /* hint that it is a version */
44dcb63b 880 }
89bfa8cd
PP
881 }
882 }
883
884 /* NOTE: The parser sees the package name and the VERSION swapped */
3280af22 885 PL_nextval[PL_nexttoke].opval = version;
4e553d73 886 force_next(WORD);
89bfa8cd
PP
887
888 return (s);
889}
890
ffb4593c
NT
891/*
892 * S_tokeq
893 * Tokenize a quoted string passed in as an SV. It finds the next
894 * chunk, up to end of string or a backslash. It may make a new
895 * SV containing that chunk (if HINT_NEW_STRING is on). It also
896 * turns \\ into \.
897 */
898
76e3520e 899STATIC SV *
cea2e8a9 900S_tokeq(pTHX_ SV *sv)
79072805
LW
901{
902 register char *s;
903 register char *send;
904 register char *d;
b3ac6de7
IZ
905 STRLEN len = 0;
906 SV *pv = sv;
79072805
LW
907
908 if (!SvLEN(sv))
b3ac6de7 909 goto finish;
79072805 910
a0d0e21e 911 s = SvPV_force(sv, len);
21a311ee 912 if (SvTYPE(sv) >= SVt_PVIV && SvIVX(sv) == -1)
b3ac6de7 913 goto finish;
463ee0b2 914 send = s + len;
79072805
LW
915 while (s < send && *s != '\\')
916 s++;
917 if (s == send)
b3ac6de7 918 goto finish;
79072805 919 d = s;
3280af22 920 if ( PL_hints & HINT_NEW_STRING )
79cb57f6 921 pv = sv_2mortal(newSVpvn(SvPVX(pv), len));
79072805
LW
922 while (s < send) {
923 if (*s == '\\') {
a0d0e21e 924 if (s + 1 < send && (s[1] == '\\'))
79072805
LW
925 s++; /* all that, just for this */
926 }
927 *d++ = *s++;
928 }
929 *d = '\0';
463ee0b2 930 SvCUR_set(sv, d - SvPVX(sv));
b3ac6de7 931 finish:
3280af22 932 if ( PL_hints & HINT_NEW_STRING )
b3ac6de7 933 return new_constant(NULL, 0, "q", sv, pv, "q");
79072805
LW
934 return sv;
935}
936
ffb4593c
NT
937/*
938 * Now come three functions related to double-quote context,
939 * S_sublex_start, S_sublex_push, and S_sublex_done. They're used when
940 * converting things like "\u\Lgnat" into ucfirst(lc("gnat")). They
941 * interact with PL_lex_state, and create fake ( ... ) argument lists
942 * to handle functions and concatenation.
943 * They assume that whoever calls them will be setting up a fake
944 * join call, because each subthing puts a ',' after it. This lets
945 * "lower \luPpEr"
946 * become
947 * join($, , 'lower ', lcfirst( 'uPpEr', ) ,)
948 *
949 * (I'm not sure whether the spurious commas at the end of lcfirst's
950 * arguments and join's arguments are created or not).
951 */
952
953/*
954 * S_sublex_start
955 * Assumes that yylval.ival is the op we're creating (e.g. OP_LCFIRST).
956 *
957 * Pattern matching will set PL_lex_op to the pattern-matching op to
958 * make (we return THING if yylval.ival is OP_NULL, PMFUNC otherwise).
959 *
960 * OP_CONST and OP_READLINE are easy--just make the new op and return.
961 *
962 * Everything else becomes a FUNC.
963 *
964 * Sets PL_lex_state to LEX_INTERPPUSH unless (ival was OP_NULL or we
965 * had an OP_CONST or OP_READLINE). This just sets us up for a
966 * call to S_sublex_push().
967 */
968
76e3520e 969STATIC I32
cea2e8a9 970S_sublex_start(pTHX)
79072805
LW
971{
972 register I32 op_type = yylval.ival;
79072805
LW
973
974 if (op_type == OP_NULL) {
3280af22
NIS
975 yylval.opval = PL_lex_op;
976 PL_lex_op = Nullop;
79072805
LW
977 return THING;
978 }
979 if (op_type == OP_CONST || op_type == OP_READLINE) {
3280af22 980 SV *sv = tokeq(PL_lex_stuff);
b3ac6de7
IZ
981
982 if (SvTYPE(sv) == SVt_PVIV) {
983 /* Overloaded constants, nothing fancy: Convert to SVt_PV: */
984 STRLEN len;
985 char *p;
986 SV *nsv;
987
988 p = SvPV(sv, len);
79cb57f6 989 nsv = newSVpvn(p, len);
01ec43d0
GS
990 if (SvUTF8(sv))
991 SvUTF8_on(nsv);
b3ac6de7
IZ
992 SvREFCNT_dec(sv);
993 sv = nsv;
4e553d73 994 }
b3ac6de7 995 yylval.opval = (OP*)newSVOP(op_type, 0, sv);
3280af22 996 PL_lex_stuff = Nullsv;
79072805
LW
997 return THING;
998 }
999
3280af22
NIS
1000 PL_sublex_info.super_state = PL_lex_state;
1001 PL_sublex_info.sub_inwhat = op_type;
1002 PL_sublex_info.sub_op = PL_lex_op;
1003 PL_lex_state = LEX_INTERPPUSH;
55497cff 1004
3280af22
NIS
1005 PL_expect = XTERM;
1006 if (PL_lex_op) {
1007 yylval.opval = PL_lex_op;
1008 PL_lex_op = Nullop;
55497cff
PP
1009 return PMFUNC;
1010 }
1011 else
1012 return FUNC;
1013}
1014
ffb4593c
NT
1015/*
1016 * S_sublex_push
1017 * Create a new scope to save the lexing state. The scope will be
1018 * ended in S_sublex_done. Returns a '(', starting the function arguments
1019 * to the uc, lc, etc. found before.
1020 * Sets PL_lex_state to LEX_INTERPCONCAT.
1021 */
1022
76e3520e 1023STATIC I32
cea2e8a9 1024S_sublex_push(pTHX)
55497cff 1025{
f46d017c 1026 ENTER;
55497cff 1027
3280af22
NIS
1028 PL_lex_state = PL_sublex_info.super_state;
1029 SAVEI32(PL_lex_dojoin);
1030 SAVEI32(PL_lex_brackets);
3280af22
NIS
1031 SAVEI32(PL_lex_casemods);
1032 SAVEI32(PL_lex_starts);
1033 SAVEI32(PL_lex_state);
7766f137 1034 SAVEVPTR(PL_lex_inpat);
3280af22 1035 SAVEI32(PL_lex_inwhat);
57843af0 1036 SAVECOPLINE(PL_curcop);
3280af22
NIS
1037 SAVEPPTR(PL_bufptr);
1038 SAVEPPTR(PL_oldbufptr);
1039 SAVEPPTR(PL_oldoldbufptr);
207e3d1a
JH
1040 SAVEPPTR(PL_last_lop);
1041 SAVEPPTR(PL_last_uni);
3280af22
NIS
1042 SAVEPPTR(PL_linestart);
1043 SAVESPTR(PL_linestr);
1044 SAVEPPTR(PL_lex_brackstack);
1045 SAVEPPTR(PL_lex_casestack);
1046
1047 PL_linestr = PL_lex_stuff;
1048 PL_lex_stuff = Nullsv;
1049
9cbb5ea2
GS
1050 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart
1051 = SvPVX(PL_linestr);
3280af22 1052 PL_bufend += SvCUR(PL_linestr);
207e3d1a 1053 PL_last_lop = PL_last_uni = Nullch;
3280af22
NIS
1054 SAVEFREESV(PL_linestr);
1055
1056 PL_lex_dojoin = FALSE;
1057 PL_lex_brackets = 0;
3280af22
NIS
1058 New(899, PL_lex_brackstack, 120, char);
1059 New(899, PL_lex_casestack, 12, char);
1060 SAVEFREEPV(PL_lex_brackstack);
1061 SAVEFREEPV(PL_lex_casestack);
1062 PL_lex_casemods = 0;
1063 *PL_lex_casestack = '\0';
1064 PL_lex_starts = 0;
1065 PL_lex_state = LEX_INTERPCONCAT;
57843af0 1066 CopLINE_set(PL_curcop, PL_multi_start);
3280af22
NIS
1067
1068 PL_lex_inwhat = PL_sublex_info.sub_inwhat;
1069 if (PL_lex_inwhat == OP_MATCH || PL_lex_inwhat == OP_QR || PL_lex_inwhat == OP_SUBST)
1070 PL_lex_inpat = PL_sublex_info.sub_op;
79072805 1071 else
3280af22 1072 PL_lex_inpat = Nullop;
79072805 1073
55497cff 1074 return '(';
79072805
LW
1075}
1076
ffb4593c
NT
1077/*
1078 * S_sublex_done
1079 * Restores lexer state after a S_sublex_push.
1080 */
1081
76e3520e 1082STATIC I32
cea2e8a9 1083S_sublex_done(pTHX)
79072805 1084{
3280af22 1085 if (!PL_lex_starts++) {
9aa983d2
JH
1086 SV *sv = newSVpvn("",0);
1087 if (SvUTF8(PL_linestr))
1088 SvUTF8_on(sv);
3280af22 1089 PL_expect = XOPERATOR;
9aa983d2 1090 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
79072805
LW
1091 return THING;
1092 }
1093
3280af22
NIS
1094 if (PL_lex_casemods) { /* oops, we've got some unbalanced parens */
1095 PL_lex_state = LEX_INTERPCASEMOD;
cea2e8a9 1096 return yylex();
79072805
LW
1097 }
1098
ffb4593c 1099 /* Is there a right-hand side to take care of? (s//RHS/ or tr//RHS/) */
3280af22
NIS
1100 if (PL_lex_repl && (PL_lex_inwhat == OP_SUBST || PL_lex_inwhat == OP_TRANS)) {
1101 PL_linestr = PL_lex_repl;
1102 PL_lex_inpat = 0;
1103 PL_bufend = PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
1104 PL_bufend += SvCUR(PL_linestr);
207e3d1a 1105 PL_last_lop = PL_last_uni = Nullch;
3280af22
NIS
1106 SAVEFREESV(PL_linestr);
1107 PL_lex_dojoin = FALSE;
1108 PL_lex_brackets = 0;
3280af22
NIS
1109 PL_lex_casemods = 0;
1110 *PL_lex_casestack = '\0';
1111 PL_lex_starts = 0;
25da4f38 1112 if (SvEVALED(PL_lex_repl)) {
3280af22
NIS
1113 PL_lex_state = LEX_INTERPNORMAL;
1114 PL_lex_starts++;
e9fa98b2
HS
1115 /* we don't clear PL_lex_repl here, so that we can check later
1116 whether this is an evalled subst; that means we rely on the
1117 logic to ensure sublex_done() is called again only via the
1118 branch (in yylex()) that clears PL_lex_repl, else we'll loop */
79072805 1119 }
e9fa98b2 1120 else {
3280af22 1121 PL_lex_state = LEX_INTERPCONCAT;
e9fa98b2
HS
1122 PL_lex_repl = Nullsv;
1123 }
79072805 1124 return ',';
ffed7fef
LW
1125 }
1126 else {
f46d017c 1127 LEAVE;
3280af22
NIS
1128 PL_bufend = SvPVX(PL_linestr);
1129 PL_bufend += SvCUR(PL_linestr);
1130 PL_expect = XOPERATOR;
09bef843 1131 PL_sublex_info.sub_inwhat = 0;
79072805 1132 return ')';
ffed7fef
LW
1133 }
1134}
1135
02aa26ce
NT
1136/*
1137 scan_const
1138
1139 Extracts a pattern, double-quoted string, or transliteration. This
1140 is terrifying code.
1141
3280af22
NIS
1142 It looks at lex_inwhat and PL_lex_inpat to find out whether it's
1143 processing a pattern (PL_lex_inpat is true), a transliteration
02aa26ce
NT
1144 (lex_inwhat & OP_TRANS is true), or a double-quoted string.
1145
9b599b2a
GS
1146 Returns a pointer to the character scanned up to. Iff this is
1147 advanced from the start pointer supplied (ie if anything was
1148 successfully parsed), will leave an OP for the substring scanned
1149 in yylval. Caller must intuit reason for not parsing further
1150 by looking at the next characters herself.
1151
02aa26ce
NT
1152 In patterns:
1153 backslashes:
1154 double-quoted style: \r and \n
1155 regexp special ones: \D \s
1156 constants: \x3
1157 backrefs: \1 (deprecated in substitution replacements)
1158 case and quoting: \U \Q \E
1159 stops on @ and $, but not for $ as tail anchor
1160
1161 In transliterations:
1162 characters are VERY literal, except for - not at the start or end
1163 of the string, which indicates a range. scan_const expands the
1164 range to the full set of intermediate characters.
1165
1166 In double-quoted strings:
1167 backslashes:
1168 double-quoted style: \r and \n
1169 constants: \x3
1170 backrefs: \1 (deprecated)
1171 case and quoting: \U \Q \E
1172 stops on @ and $
1173
1174 scan_const does *not* construct ops to handle interpolated strings.
1175 It stops processing as soon as it finds an embedded $ or @ variable
1176 and leaves it to the caller to work out what's going on.
1177
1178 @ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
1179
1180 $ in pattern could be $foo or could be tail anchor. Assumption:
1181 it's a tail anchor if $ is the last thing in the string, or if it's
1182 followed by one of ")| \n\t"
1183
1184 \1 (backreferences) are turned into $1
1185
1186 The structure of the code is
1187 while (there's a character to process) {
1188 handle transliteration ranges
1189 skip regexp comments
1190 skip # initiated comments in //x patterns
1191 check for embedded @foo
1192 check for embedded scalars
1193 if (backslash) {
1194 leave intact backslashes from leave (below)
1195 deprecate \1 in strings and sub replacements
1196 handle string-changing backslashes \l \U \Q \E, etc.
1197 switch (what was escaped) {
1198 handle - in a transliteration (becomes a literal -)
1199 handle \132 octal characters
1200 handle 0x15 hex characters
1201 handle \cV (control V)
1202 handle printf backslashes (\f, \r, \n, etc)
1203 } (end switch)
1204 } (end if backslash)
1205 } (end while character to read)
4e553d73 1206
02aa26ce
NT
1207*/
1208
76e3520e 1209STATIC char *
cea2e8a9 1210S_scan_const(pTHX_ char *start)
79072805 1211{
3280af22 1212 register char *send = PL_bufend; /* end of the constant */
02aa26ce
NT
1213 SV *sv = NEWSV(93, send - start); /* sv for the constant */
1214 register char *s = start; /* start of the constant */
1215 register char *d = SvPVX(sv); /* destination for copies */
1216 bool dorange = FALSE; /* are we in a translit range? */
c2e66d9e 1217 bool didrange = FALSE; /* did we just finish a range? */
9aa983d2
JH
1218 bool has_utf8 = (PL_linestr && SvUTF8(PL_linestr));
1219 /* the constant is UTF8 */
012bcf8d
GS
1220 UV uv;
1221
ac2262e3 1222 I32 utf = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
a0ed51b3
LW
1223 ? (PL_sublex_info.sub_op->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
1224 : UTF;
89491803 1225 I32 this_utf8 = (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op)
9cbb5ea2
GS
1226 ? (PL_sublex_info.sub_op->op_private & (PL_lex_repl ?
1227 OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF))
a0ed51b3 1228 : UTF;
dff6d3cd 1229 const char *leaveit = /* set of acceptably-backslashed characters */
3280af22 1230 PL_lex_inpat
4a2d328f 1231 ? "\\.^$@AGZdDwWsSbBpPXC+*?|()-nrtfeaxcz0123456789[{]} \t\n\r\f\v#"
9b599b2a 1232 : "";
79072805
LW
1233
1234 while (s < send || dorange) {
02aa26ce 1235 /* get transliterations out of the way (they're most literal) */
3280af22 1236 if (PL_lex_inwhat == OP_TRANS) {
02aa26ce 1237 /* expand a range A-Z to the full set of characters. AIE! */
79072805 1238 if (dorange) {
1ba5c669
JH
1239 I32 i; /* current expanded character */
1240 I32 min; /* first character in range */
1241 I32 max; /* last character in range */
02aa26ce 1242
8973db79
JH
1243 if (utf) {
1244 char *c = (char*)utf8_hop((U8*)d, -1);
1245 char *e = d++;
1246 while (e-- > c)
1247 *(e + 1) = *e;
8b107d6c 1248 *c = (char)0xff;
8973db79
JH
1249 /* mark the range as done, and continue */
1250 dorange = FALSE;
1251 didrange = TRUE;
1252 continue;
1253 }
02aa26ce 1254 i = d - SvPVX(sv); /* remember current offset */
9cbb5ea2
GS
1255 SvGROW(sv, SvLEN(sv) + 256); /* never more than 256 chars in a range */
1256 d = SvPVX(sv) + i; /* refresh d after realloc */
02aa26ce
NT
1257 d -= 2; /* eat the first char and the - */
1258
8ada0baa
JH
1259 min = (U8)*d; /* first char in range */
1260 max = (U8)d[1]; /* last char in range */
1261
c2e66d9e 1262 if (min > max) {
01ec43d0 1263 Perl_croak(aTHX_
1ba5c669
JH
1264 "Invalid [] range \"%c-%c\" in transliteration operator",
1265 (char)min, (char)max);
c2e66d9e
GS
1266 }
1267
c7f1f016 1268#ifdef EBCDIC
8ada0baa
JH
1269 if ((isLOWER(min) && isLOWER(max)) ||
1270 (isUPPER(min) && isUPPER(max))) {
1271 if (isLOWER(min)) {
1272 for (i = min; i <= max; i++)
1273 if (isLOWER(i))
1274 *d++ = i;
1275 } else {
1276 for (i = min; i <= max; i++)
1277 if (isUPPER(i))
1278 *d++ = i;
1279 }
1280 }
1281 else
1282#endif
1283 for (i = min; i <= max; i++)
1284 *d++ = i;
02aa26ce
NT
1285
1286 /* mark the range as done, and continue */
79072805 1287 dorange = FALSE;
01ec43d0 1288 didrange = TRUE;
79072805 1289 continue;
4e553d73 1290 }
02aa26ce
NT
1291
1292 /* range begins (ignore - as first or last char) */
79072805 1293 else if (*s == '-' && s+1 < send && s != start) {
4e553d73 1294 if (didrange) {
1fafa243 1295 Perl_croak(aTHX_ "Ambiguous range in transliteration operator");
01ec43d0 1296 }
a0ed51b3 1297 if (utf) {
a176fa2a 1298 *d++ = (char)0xff; /* use illegal utf8 byte--see pmtrans */
a0ed51b3
LW
1299 s++;
1300 continue;
1301 }
79072805
LW
1302 dorange = TRUE;
1303 s++;
01ec43d0
GS
1304 }
1305 else {
1306 didrange = FALSE;
1307 }
79072805 1308 }
02aa26ce
NT
1309
1310 /* if we get here, we're not doing a transliteration */
1311
0f5d15d6
IZ
1312 /* skip for regexp comments /(?#comment)/ and code /(?{code})/,
1313 except for the last char, which will be done separately. */
3280af22 1314 else if (*s == '(' && PL_lex_inpat && s[1] == '?') {
cc6b7395
IZ
1315 if (s[2] == '#') {
1316 while (s < send && *s != ')')
1317 *d++ = *s++;
155aba94
GS
1318 }
1319 else if (s[2] == '{' /* This should match regcomp.c */
1320 || ((s[2] == 'p' || s[2] == '?') && s[3] == '{'))
1321 {
cc6b7395 1322 I32 count = 1;
0f5d15d6 1323 char *regparse = s + (s[2] == '{' ? 3 : 4);
cc6b7395
IZ
1324 char c;
1325
d9f97599
GS
1326 while (count && (c = *regparse)) {
1327 if (c == '\\' && regparse[1])
1328 regparse++;
4e553d73 1329 else if (c == '{')
cc6b7395 1330 count++;
4e553d73 1331 else if (c == '}')
cc6b7395 1332 count--;
d9f97599 1333 regparse++;
cc6b7395 1334 }
5bdf89e7
IZ
1335 if (*regparse != ')') {
1336 regparse--; /* Leave one char for continuation. */
cc6b7395 1337 yyerror("Sequence (?{...}) not terminated or not {}-balanced");
5bdf89e7 1338 }
0f5d15d6 1339 while (s < regparse)
cc6b7395
IZ
1340 *d++ = *s++;
1341 }
748a9306 1342 }
02aa26ce
NT
1343
1344 /* likewise skip #-initiated comments in //x patterns */
3280af22
NIS
1345 else if (*s == '#' && PL_lex_inpat &&
1346 ((PMOP*)PL_lex_inpat)->op_pmflags & PMf_EXTENDED) {
748a9306
LW
1347 while (s+1 < send && *s != '\n')
1348 *d++ = *s++;
1349 }
02aa26ce 1350
5d1d4326
JH
1351 /* check for embedded arrays
1352 (@foo, @:foo, @'foo, @{foo}, @$foo, @+, @-)
1353 */
7e2040f0 1354 else if (*s == '@' && s[1]
5d1d4326 1355 && (isALNUM_lazy_if(s+1,UTF) || strchr(":'{$+-", s[1])))
79072805 1356 break;
02aa26ce
NT
1357
1358 /* check for embedded scalars. only stop if we're sure it's a
1359 variable.
1360 */
79072805 1361 else if (*s == '$') {
3280af22 1362 if (!PL_lex_inpat) /* not a regexp, so $ must be var */
79072805 1363 break;
c277df42 1364 if (s + 1 < send && !strchr("()| \n\t", s[1]))
79072805
LW
1365 break; /* in regexp, $ might be tail anchor */
1366 }
02aa26ce
NT
1367
1368 /* backslashes */
79072805
LW
1369 if (*s == '\\' && s+1 < send) {
1370 s++;
02aa26ce
NT
1371
1372 /* some backslashes we leave behind */
c9f97d15 1373 if (*leaveit && *s && strchr(leaveit, *s)) {
79072805
LW
1374 *d++ = '\\';
1375 *d++ = *s++;
1376 continue;
1377 }
02aa26ce
NT
1378
1379 /* deprecate \1 in strings and substitution replacements */
3280af22 1380 if (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat &&
a0d0e21e 1381 isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
79072805 1382 {
599cee73 1383 if (ckWARN(WARN_SYNTAX))
cea2e8a9 1384 Perl_warner(aTHX_ WARN_SYNTAX, "\\%c better written as $%c", *s, *s);
79072805
LW
1385 *--s = '$';
1386 break;
1387 }
02aa26ce
NT
1388
1389 /* string-change backslash escapes */
3280af22 1390 if (PL_lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
79072805
LW
1391 --s;
1392 break;
1393 }
02aa26ce
NT
1394
1395 /* if we get here, it's either a quoted -, or a digit */
79072805 1396 switch (*s) {
02aa26ce
NT
1397
1398 /* quoted - in transliterations */
79072805 1399 case '-':
3280af22 1400 if (PL_lex_inwhat == OP_TRANS) {
79072805
LW
1401 *d++ = *s++;
1402 continue;
1403 }
1404 /* FALL THROUGH */
1405 default:
11b8faa4 1406 {
7e84c16c 1407 if (ckWARN(WARN_MISC) && isALNUM(*s))
4e553d73 1408 Perl_warner(aTHX_ WARN_MISC,
11b8faa4
JH
1409 "Unrecognized escape \\%c passed through",
1410 *s);
1411 /* default action is to copy the quoted character */
f9a63242 1412 goto default_action;
11b8faa4 1413 }
02aa26ce
NT
1414
1415 /* \132 indicates an octal constant */
79072805
LW
1416 case '0': case '1': case '2': case '3':
1417 case '4': case '5': case '6': case '7':
ba210ebe
JH
1418 {
1419 STRLEN len = 0; /* disallow underscores */
1420 uv = (UV)scan_oct(s, 3, &len);
1421 s += len;
1422 }
012bcf8d 1423 goto NUM_ESCAPE_INSERT;
02aa26ce
NT
1424
1425 /* \x24 indicates a hex constant */
79072805 1426 case 'x':
a0ed51b3
LW
1427 ++s;
1428 if (*s == '{') {
1429 char* e = strchr(s, '}');
adaeee49 1430 if (!e) {
a0ed51b3 1431 yyerror("Missing right brace on \\x{}");
adaeee49
GA
1432 e = s;
1433 }
89491803 1434 else {
ba210ebe
JH
1435 STRLEN len = 1; /* allow underscores */
1436 uv = (UV)scan_hex(s + 1, e - s - 1, &len);
1437 }
1438 s = e + 1;
a0ed51b3
LW
1439 }
1440 else {
ba210ebe
JH
1441 {
1442 STRLEN len = 0; /* disallow underscores */
1443 uv = (UV)scan_hex(s, 2, &len);
1444 s += len;
1445 }
012bcf8d
GS
1446 }
1447
1448 NUM_ESCAPE_INSERT:
1449 /* Insert oct or hex escaped character.
301d3d20
JH
1450 * There will always enough room in sv since such
1451 * escapes will be longer than any UT-F8 sequence
1452 * they can end up as. */
ba7cea30 1453
c7f1f016
NIS
1454 /* We need to map to chars to ASCII before doing the tests
1455 to cover EBCDIC
1456 */
1457 if (NATIVE_TO_ASCII(uv) > 127) {
9aa983d2 1458 if (!has_utf8 && uv > 255) {
301d3d20
JH
1459 /* Might need to recode whatever we have
1460 * accumulated so far if it contains any
1461 * hibit chars.
1462 *
1463 * (Can't we keep track of that and avoid
1464 * this rescan? --jhi)
012bcf8d 1465 */
c7f1f016 1466 int hicount = 0;
012bcf8d 1467 char *c;
301d3d20 1468
012bcf8d 1469 for (c = SvPVX(sv); c < d; c++) {
c7f1f016 1470 if (UTF8_IS_CONTINUED(NATIVE_TO_ASCII(*c)))
012bcf8d
GS
1471 hicount++;
1472 }
1473 if (hicount) {
1474 char *old_pvx = SvPVX(sv);
1475 char *src, *dst;
9041c2e3 1476
301d3d20 1477 d = SvGROW(sv,
8973db79 1478 SvLEN(sv) + hicount + 1) +
301d3d20 1479 (d - old_pvx);
012bcf8d
GS
1480
1481 src = d - 1;
1482 d += hicount;
1483 dst = d - 1;
1484
1485 while (src < dst) {
c7f1f016
NIS
1486 U8 ch = NATIVE_TO_ASCII(*src);
1487 if (UTF8_IS_CONTINUED(ch)) {
1488 *dst-- = UTF8_EIGHT_BIT_LO(ch);
1489 *dst-- = UTF8_EIGHT_BIT_HI(ch);
012bcf8d
GS
1490 }
1491 else {
c7f1f016 1492 *dst-- = ch;
012bcf8d 1493 }
c7f1f016 1494 src--;
012bcf8d
GS
1495 }
1496 }
1497 }
1498
9aa983d2 1499 if (has_utf8 || uv > 255) {
9041c2e3 1500 d = (char*)uvchr_to_utf8((U8*)d, uv);
4e553d73 1501 has_utf8 = TRUE;
f9a63242
JH
1502 if (PL_lex_inwhat == OP_TRANS &&
1503 PL_sublex_info.sub_op) {
1504 PL_sublex_info.sub_op->op_private |=
1505 (PL_lex_repl ? OPpTRANS_FROM_UTF
1506 : OPpTRANS_TO_UTF);
1507 utf = TRUE;
1508 }
012bcf8d 1509 }
a0ed51b3 1510 else {
012bcf8d 1511 *d++ = (char)uv;
a0ed51b3 1512 }
012bcf8d
GS
1513 }
1514 else {
1515 *d++ = (char)uv;
a0ed51b3 1516 }
79072805 1517 continue;
02aa26ce 1518
4a2d328f
IZ
1519 /* \N{latin small letter a} is a named character */
1520 case 'N':
55eda711 1521 ++s;
423cee85
JH
1522 if (*s == '{') {
1523 char* e = strchr(s, '}');
155aba94 1524 SV *res;
423cee85
JH
1525 STRLEN len;
1526 char *str;
4e553d73 1527
423cee85 1528 if (!e) {
5777a3f7 1529 yyerror("Missing right brace on \\N{}");
423cee85
JH
1530 e = s - 1;
1531 goto cont_scan;
1532 }
55eda711
JH
1533 res = newSVpvn(s + 1, e - s - 1);
1534 res = new_constant( Nullch, 0, "charnames",
1535 res, Nullsv, "\\N{...}" );
f9a63242
JH
1536 if (has_utf8)
1537 sv_utf8_upgrade(res);
423cee85 1538 str = SvPV(res,len);
89491803 1539 if (!has_utf8 && SvUTF8(res)) {
f08d6ad9
GS
1540 char *ostart = SvPVX(sv);
1541 SvCUR_set(sv, d - ostart);
1542 SvPOK_on(sv);
e4f3eed8 1543 *d = '\0';
f08d6ad9 1544 sv_utf8_upgrade(sv);
d2f449dd
SB
1545 /* this just broke our allocation above... */
1546 SvGROW(sv, send - start);
f08d6ad9 1547 d = SvPVX(sv) + SvCUR(sv);
89491803 1548 has_utf8 = TRUE;
f08d6ad9 1549 }
423cee85
JH
1550 if (len > e - s + 4) {
1551 char *odest = SvPVX(sv);
1552
8973db79 1553 SvGROW(sv, (SvLEN(sv) + len - (e - s + 4)));
423cee85
JH
1554 d = SvPVX(sv) + (d - odest);
1555 }
1556 Copy(str, d, len, char);
1557 d += len;
1558 SvREFCNT_dec(res);
1559 cont_scan:
1560 s = e + 1;
1561 }
1562 else
5777a3f7 1563 yyerror("Missing braces on \\N{}");
423cee85
JH
1564 continue;
1565
02aa26ce 1566 /* \c is a control character */
79072805
LW
1567 case 'c':
1568 s++;
ba210ebe
JH
1569 {
1570 U8 c = *s++;
c7f1f016
NIS
1571#ifdef EBCDIC
1572 if (isLOWER(c))
1573 c = toUPPER(c);
1574#endif
ba210ebe
JH
1575 *d++ = toCTRL(c);
1576 }
79072805 1577 continue;
02aa26ce
NT
1578
1579 /* printf-style backslashes, formfeeds, newlines, etc */
79072805
LW
1580 case 'b':
1581 *d++ = '\b';
1582 break;
1583 case 'n':
1584 *d++ = '\n';
1585 break;
1586 case 'r':
1587 *d++ = '\r';
1588 break;
1589 case 'f':
1590 *d++ = '\f';
1591 break;
1592 case 't':
1593 *d++ = '\t';
1594 break;
34a3fe2a 1595 case 'e':
c7f1f016 1596 *d++ = ASCII_TO_NATIVE('\033');
34a3fe2a
PP
1597 break;
1598 case 'a':
c7f1f016 1599 *d++ = ASCII_TO_NATIVE('\007');
79072805 1600 break;
02aa26ce
NT
1601 } /* end switch */
1602
79072805
LW
1603 s++;
1604 continue;
02aa26ce
NT
1605 } /* end if (backslash) */
1606
f9a63242 1607 default_action:
c7f1f016 1608 if (UTF8_IS_CONTINUED(NATIVE_TO_ASCII(*s)) && (this_utf8 || has_utf8)) {
a5a960be
RI
1609 STRLEN len = (STRLEN) -1;
1610 UV uv;
1611 if (this_utf8) {
9041c2e3 1612 uv = utf8n_to_uvchr((U8*)s, send - s, &len, 0);
a5a960be
RI
1613 }
1614 if (len == (STRLEN)-1) {
1615 /* Illegal UTF8 (a high-bit byte), make it valid. */
1616 char *old_pvx = SvPVX(sv);
1617 /* need space for one extra char (NOTE: SvCUR() not set here) */
1618 d = SvGROW(sv, SvLEN(sv) + 1) + (d - old_pvx);
9041c2e3 1619 d = (char*)uvchr_to_utf8((U8*)d, (U8)*s++);
a5a960be
RI
1620 }
1621 else {
1622 while (len--)
1623 *d++ = *s++;
1624 }
1625 has_utf8 = TRUE;
f9a63242
JH
1626 if (PL_lex_inwhat == OP_TRANS && PL_sublex_info.sub_op) {
1627 PL_sublex_info.sub_op->op_private |=
1628 (PL_lex_repl ? OPpTRANS_FROM_UTF : OPpTRANS_TO_UTF);
1629 utf = TRUE;
1630 }
a5a960be
RI
1631 continue;
1632 }
1633
f9a63242 1634 *d++ = *s++;
02aa26ce
NT
1635 } /* while loop to process each character */
1636
1637 /* terminate the string and set up the sv */
79072805 1638 *d = '\0';
463ee0b2 1639 SvCUR_set(sv, d - SvPVX(sv));
79072805 1640 SvPOK_on(sv);
89491803 1641 if (has_utf8)
7e2040f0 1642 SvUTF8_on(sv);
79072805 1643
02aa26ce 1644 /* shrink the sv if we allocated more than we used */
79072805
LW
1645 if (SvCUR(sv) + 5 < SvLEN(sv)) {
1646 SvLEN_set(sv, SvCUR(sv) + 1);
463ee0b2 1647 Renew(SvPVX(sv), SvLEN(sv), char);
79072805 1648 }
02aa26ce 1649
9b599b2a 1650 /* return the substring (via yylval) only if we parsed anything */
3280af22
NIS
1651 if (s > PL_bufptr) {
1652 if ( PL_hints & ( PL_lex_inpat ? HINT_NEW_RE : HINT_NEW_STRING ) )
4e553d73 1653 sv = new_constant(start, s - start, (PL_lex_inpat ? "qr" : "q"),
b3ac6de7 1654 sv, Nullsv,
4e553d73 1655 ( PL_lex_inwhat == OP_TRANS
b3ac6de7 1656 ? "tr"
3280af22 1657 : ( (PL_lex_inwhat == OP_SUBST && !PL_lex_inpat)
b3ac6de7
IZ
1658 ? "s"
1659 : "qq")));
79072805 1660 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
b3ac6de7 1661 } else
8990e307 1662 SvREFCNT_dec(sv);
79072805
LW
1663 return s;
1664}
1665
ffb4593c
NT
1666/* S_intuit_more
1667 * Returns TRUE if there's more to the expression (e.g., a subscript),
1668 * FALSE otherwise.
ffb4593c
NT
1669 *
1670 * It deals with "$foo[3]" and /$foo[3]/ and /$foo[0123456789$]+/
1671 *
1672 * ->[ and ->{ return TRUE
1673 * { and [ outside a pattern are always subscripts, so return TRUE
1674 * if we're outside a pattern and it's not { or [, then return FALSE
1675 * if we're in a pattern and the first char is a {
1676 * {4,5} (any digits around the comma) returns FALSE
1677 * if we're in a pattern and the first char is a [
1678 * [] returns FALSE
1679 * [SOMETHING] has a funky algorithm to decide whether it's a
1680 * character class or not. It has to deal with things like
1681 * /$foo[-3]/ and /$foo[$bar]/ as well as /$foo[$\d]+/
1682 * anything else returns TRUE
1683 */
1684
9cbb5ea2
GS
1685/* This is the one truly awful dwimmer necessary to conflate C and sed. */
1686
76e3520e 1687STATIC int
cea2e8a9 1688S_intuit_more(pTHX_ register char *s)
79072805 1689{
3280af22 1690 if (PL_lex_brackets)
79072805
LW
1691 return TRUE;
1692 if (*s == '-' && s[1] == '>' && (s[2] == '[' || s[2] == '{'))
1693 return TRUE;
1694 if (*s != '{' && *s != '[')
1695 return FALSE;
3280af22 1696 if (!PL_lex_inpat)
79072805
LW
1697 return TRUE;
1698
1699 /* In a pattern, so maybe we have {n,m}. */
1700 if (*s == '{') {
1701 s++;
1702 if (!isDIGIT(*s))
1703 return TRUE;
1704 while (isDIGIT(*s))
1705 s++;
1706 if (*s == ',')
1707 s++;
1708 while (isDIGIT(*s))
1709 s++;
1710 if (*s == '}')
1711 return FALSE;
1712 return TRUE;
1713
1714 }
1715
1716 /* On the other hand, maybe we have a character class */
1717
1718 s++;
1719 if (*s == ']' || *s == '^')
1720 return FALSE;
1721 else {
ffb4593c 1722 /* this is terrifying, and it works */
79072805
LW
1723 int weight = 2; /* let's weigh the evidence */
1724 char seen[256];
f27ffc4a 1725 unsigned char un_char = 255, last_un_char;
93a17b20 1726 char *send = strchr(s,']');
3280af22 1727 char tmpbuf[sizeof PL_tokenbuf * 4];
79072805
LW
1728
1729 if (!send) /* has to be an expression */
1730 return TRUE;
1731
1732 Zero(seen,256,char);
1733 if (*s == '$')
1734 weight -= 3;
1735 else if (isDIGIT(*s)) {
1736 if (s[1] != ']') {
1737 if (isDIGIT(s[1]) && s[2] == ']')
1738 weight -= 10;
1739 }
1740 else
1741 weight -= 100;
1742 }
1743 for (; s < send; s++) {
1744 last_un_char = un_char;
1745 un_char = (unsigned char)*s;
1746 switch (*s) {
1747 case '@':
1748 case '&':
1749 case '$':
1750 weight -= seen[un_char] * 10;
7e2040f0 1751 if (isALNUM_lazy_if(s+1,UTF)) {
8903cb82 1752 scan_ident(s, send, tmpbuf, sizeof tmpbuf, FALSE);
a0d0e21e 1753 if ((int)strlen(tmpbuf) > 1 && gv_fetchpv(tmpbuf,FALSE, SVt_PV))
79072805
LW
1754 weight -= 100;
1755 else
1756 weight -= 10;
1757 }
1758 else if (*s == '$' && s[1] &&
93a17b20
LW
1759 strchr("[#!%*<>()-=",s[1])) {
1760 if (/*{*/ strchr("])} =",s[2]))
79072805
LW
1761 weight -= 10;
1762 else
1763 weight -= 1;
1764 }
1765 break;
1766 case '\\':
1767 un_char = 254;
1768 if (s[1]) {
93a17b20 1769 if (strchr("wds]",s[1]))
79072805
LW
1770 weight += 100;
1771 else if (seen['\''] || seen['"'])
1772 weight += 1;
93a17b20 1773 else if (strchr("rnftbxcav",s[1]))
79072805
LW
1774 weight += 40;
1775 else if (isDIGIT(s[1])) {
1776 weight += 40;
1777 while (s[1] && isDIGIT(s[1]))
1778 s++;
1779 }
1780 }
1781 else
1782 weight += 100;
1783 break;
1784 case '-':
1785 if (s[1] == '\\')
1786 weight += 50;
93a17b20 1787 if (strchr("aA01! ",last_un_char))
79072805 1788 weight += 30;
93a17b20 1789 if (strchr("zZ79~",s[1]))
79072805 1790 weight += 30;
f27ffc4a
GS
1791 if (last_un_char == 255 && (isDIGIT(s[1]) || s[1] == '$'))
1792 weight -= 5; /* cope with negative subscript */
79072805
LW
1793 break;
1794 default:
93a17b20 1795 if (!isALNUM(last_un_char) && !strchr("$@&",last_un_char) &&
79072805
LW
1796 isALPHA(*s) && s[1] && isALPHA(s[1])) {
1797 char *d = tmpbuf;
1798 while (isALPHA(*s))
1799 *d++ = *s++;
1800 *d = '\0';
1801 if (keyword(tmpbuf, d - tmpbuf))
1802 weight -= 150;
1803 }
1804 if (un_char == last_un_char + 1)
1805 weight += 5;
1806 weight -= seen[un_char];
1807 break;
1808 }
1809 seen[un_char]++;
1810 }
1811 if (weight >= 0) /* probably a character class */
1812 return FALSE;
1813 }
1814
1815 return TRUE;
1816}
ffed7fef 1817
ffb4593c
NT
1818/*
1819 * S_intuit_method
1820 *
1821 * Does all the checking to disambiguate
1822 * foo bar
1823 * between foo(bar) and bar->foo. Returns 0 if not a method, otherwise
1824 * FUNCMETH (bar->foo(args)) or METHOD (bar->foo args).
1825 *
1826 * First argument is the stuff after the first token, e.g. "bar".
1827 *
1828 * Not a method if bar is a filehandle.
1829 * Not a method if foo is a subroutine prototyped to take a filehandle.
1830 * Not a method if it's really "Foo $bar"
1831 * Method if it's "foo $bar"
1832 * Not a method if it's really "print foo $bar"
1833 * Method if it's really "foo package::" (interpreted as package->foo)
1834 * Not a method if bar is known to be a subroutne ("sub bar; foo bar")
3cb0bbe5 1835 * Not a method if bar is a filehandle or package, but is quoted with
ffb4593c
NT
1836 * =>
1837 */
1838
76e3520e 1839STATIC int
cea2e8a9 1840S_intuit_method(pTHX_ char *start, GV *gv)
a0d0e21e
LW
1841{
1842 char *s = start + (*start == '$');
3280af22 1843 char tmpbuf[sizeof PL_tokenbuf];
a0d0e21e
LW
1844 STRLEN len;
1845 GV* indirgv;
1846
1847 if (gv) {
b6c543e3 1848 CV *cv;
a0d0e21e
LW
1849 if (GvIO(gv))
1850 return 0;
b6c543e3
IZ
1851 if ((cv = GvCVu(gv))) {
1852 char *proto = SvPVX(cv);
1853 if (proto) {
1854 if (*proto == ';')
1855 proto++;
1856 if (*proto == '*')
1857 return 0;
1858 }
1859 } else
a0d0e21e
LW
1860 gv = 0;
1861 }
8903cb82 1862 s = scan_word(s, tmpbuf, sizeof tmpbuf, TRUE, &len);
ffb4593c
NT
1863 /* start is the beginning of the possible filehandle/object,
1864 * and s is the end of it
1865 * tmpbuf is a copy of it
1866 */
1867
a0d0e21e 1868 if (*start == '$') {
3280af22 1869 if (gv || PL_last_lop_op == OP_PRINT || isUPPER(*PL_tokenbuf))
a0d0e21e
LW
1870 return 0;
1871 s = skipspace(s);
3280af22
NIS
1872 PL_bufptr = start;
1873 PL_expect = XREF;
a0d0e21e
LW
1874 return *s == '(' ? FUNCMETH : METHOD;
1875 }
1876 if (!keyword(tmpbuf, len)) {
c3e0f903
GS
1877 if (len > 2 && tmpbuf[len - 2] == ':' && tmpbuf[len - 1] == ':') {
1878 len -= 2;
1879 tmpbuf[len] = '\0';
1880 goto bare_package;
1881 }
1882 indirgv = gv_fetchpv(tmpbuf, FALSE, SVt_PVCV);
8ebc5c01 1883 if (indirgv && GvCVu(indirgv))
a0d0e21e
LW
1884 return 0;
1885 /* filehandle or package name makes it a method */
89bfa8cd 1886 if (!gv || GvIO(indirgv) || gv_stashpvn(tmpbuf, len, FALSE)) {
a0d0e21e 1887 s = skipspace(s);
3280af22 1888 if ((PL_bufend - s) >= 2 && *s == '=' && *(s+1) == '>')
55497cff 1889 return 0; /* no assumptions -- "=>" quotes bearword */
c3e0f903 1890 bare_package:
3280af22 1891 PL_nextval[PL_nexttoke].opval = (OP*)newSVOP(OP_CONST, 0,
79cb57f6 1892 newSVpvn(tmpbuf,len));
3280af22
NIS
1893 PL_nextval[PL_nexttoke].opval->op_private = OPpCONST_BARE;
1894 PL_expect = XTERM;
a0d0e21e 1895 force_next(WORD);
3280af22 1896 PL_bufptr = s;
a0d0e21e
LW
1897 return *s == '(' ? FUNCMETH : METHOD;
1898 }
1899 }
1900 return 0;
1901}
1902
ffb4593c
NT
1903/*
1904 * S_incl_perldb
1905 * Return a string of Perl code to load the debugger. If PERL5DB
1906 * is set, it will return the contents of that, otherwise a
1907 * compile-time require of perl5db.pl.
1908 */
1909
76e3520e 1910STATIC char*
cea2e8a9 1911S_incl_perldb(pTHX)
a0d0e21e 1912{
3280af22 1913 if (PL_perldb) {
76e3520e 1914 char *pdb = PerlEnv_getenv("PERL5DB");
a0d0e21e
LW
1915
1916 if (pdb)
1917 return pdb;
61bb5906 1918 SETERRNO(0,SS$_NORMAL);
a0d0e21e
LW
1919 return "BEGIN { require 'perl5db.pl' }";
1920 }
1921 return "";
1922}
1923
1924
16d20bd9 1925/* Encoded script support. filter_add() effectively inserts a
4e553d73 1926 * 'pre-processing' function into the current source input stream.
16d20bd9
AD
1927 * Note that the filter function only applies to the current source file
1928 * (e.g., it will not affect files 'require'd or 'use'd by this one).
1929 *
1930 * The datasv parameter (which may be NULL) can be used to pass
1931 * private data to this instance of the filter. The filter function
1932 * can recover the SV using the FILTER_DATA macro and use it to
1933 * store private buffers and state information.
1934 *
1935 * The supplied datasv parameter is upgraded to a PVIO type
4755096e 1936 * and the IoDIRP/IoANY field is used to store the function pointer,
e0c19803 1937 * and IOf_FAKE_DIRP is enabled on datasv to mark this as such.
16d20bd9
AD
1938 * Note that IoTOP_NAME, IoFMT_NAME, IoBOTTOM_NAME, if set for
1939 * private use must be set using malloc'd pointers.
1940 */
16d20bd9
AD
1941
1942SV *
864dbfa3 1943Perl_filter_add(pTHX_ filter_t funcp, SV *datasv)
16d20bd9 1944{
f4c556ac
GS
1945 if (!funcp)
1946 return Nullsv;
1947
3280af22
NIS
1948 if (!PL_rsfp_filters)
1949 PL_rsfp_filters = newAV();
16d20bd9 1950 if (!datasv)
8c52afec 1951 datasv = NEWSV(255,0);
16d20bd9 1952 if (!SvUPGRADE(datasv, SVt_PVIO))
cea2e8a9 1953 Perl_die(aTHX_ "Can't upgrade filter_add data to SVt_PVIO");
4755096e 1954 IoANY(datasv) = (void *)funcp; /* stash funcp into spare field */
e0c19803 1955 IoFLAGS(datasv) |= IOf_FAKE_DIRP;
f4c556ac
GS
1956 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_add func %p (%s)\n",
1957 funcp, SvPV_nolen(datasv)));
3280af22
NIS
1958 av_unshift(PL_rsfp_filters, 1);
1959 av_store(PL_rsfp_filters, 0, datasv) ;
16d20bd9
AD
1960 return(datasv);
1961}
4e553d73 1962
16d20bd9
AD
1963
1964/* Delete most recently added instance of this filter function. */
a0d0e21e 1965void
864dbfa3 1966Perl_filter_del(pTHX_ filter_t funcp)
16d20bd9 1967{
e0c19803 1968 SV *datasv;
f4c556ac 1969 DEBUG_P(PerlIO_printf(Perl_debug_log, "filter_del func %p", funcp));
3280af22 1970 if (!PL_rsfp_filters || AvFILLp(PL_rsfp_filters)<0)
16d20bd9
AD
1971 return;
1972 /* if filter is on top of stack (usual case) just pop it off */
e0c19803 1973 datasv = FILTER_DATA(AvFILLp(PL_rsfp_filters));
4755096e 1974 if (IoANY(datasv) == (void *)funcp) {
e0c19803 1975 IoFLAGS(datasv) &= ~IOf_FAKE_DIRP;
4755096e 1976 IoANY(datasv) = (void *)NULL;
3280af22 1977 sv_free(av_pop(PL_rsfp_filters));
e50aee73 1978
16d20bd9
AD
1979 return;
1980 }
1981 /* we need to search for the correct entry and clear it */
cea2e8a9 1982 Perl_die(aTHX_ "filter_del can only delete in reverse order (currently)");
16d20bd9
AD
1983}
1984
1985
1986/* Invoke the n'th filter function for the current rsfp. */
1987I32
864dbfa3 1988Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
4e553d73
NIS
1989
1990
8ac85365 1991 /* 0 = read one text line */
a0d0e21e 1992{
16d20bd9
AD
1993 filter_t funcp;
1994 SV *datasv = NULL;
e50aee73 1995
3280af22 1996 if (!PL_rsfp_filters)
16d20bd9 1997 return -1;
3280af22 1998 if (idx > AvFILLp(PL_rsfp_filters)){ /* Any more filters? */
16d20bd9
AD
1999 /* Provide a default input filter to make life easy. */
2000 /* Note that we append to the line. This is handy. */
f4c556ac
GS
2001 DEBUG_P(PerlIO_printf(Perl_debug_log,
2002 "filter_read %d: from rsfp\n", idx));
4e553d73 2003 if (maxlen) {
16d20bd9
AD
2004 /* Want a block */
2005 int len ;
2006 int old_len = SvCUR(buf_sv) ;
2007
2008 /* ensure buf_sv is large enough */
2009 SvGROW(buf_sv, old_len + maxlen) ;
3280af22
NIS
2010 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
2011 if (PerlIO_error(PL_rsfp))
37120919
AD
2012 return -1; /* error */
2013 else
2014 return 0 ; /* end of file */
2015 }
16d20bd9
AD
2016 SvCUR_set(buf_sv, old_len + len) ;
2017 } else {
2018 /* Want a line */
3280af22
NIS
2019 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
2020 if (PerlIO_error(PL_rsfp))
37120919
AD
2021 return -1; /* error */
2022 else
2023 return 0 ; /* end of file */
2024 }
16d20bd9
AD
2025 }
2026 return SvCUR(buf_sv);
2027 }
2028 /* Skip this filter slot if filter has been deleted */
3280af22 2029 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef){
f4c556ac
GS
2030 DEBUG_P(PerlIO_printf(Perl_debug_log,
2031 "filter_read %d: skipped (filter deleted)\n",
2032 idx));
16d20bd9
AD
2033 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
2034 }
2035 /* Get function pointer hidden within datasv */
4755096e 2036 funcp = (filter_t)IoANY(datasv);
f4c556ac
GS
2037 DEBUG_P(PerlIO_printf(Perl_debug_log,
2038 "filter_read %d: via function %p (%s)\n",
2039 idx, funcp, SvPV_nolen(datasv)));
16d20bd9
AD
2040 /* Call function. The function is expected to */
2041 /* call "FILTER_READ(idx+1, buf_sv)" first. */
37120919 2042 /* Return: <0:error, =0:eof, >0:not eof */
0cb96387 2043 return (*funcp)(aTHXo_ idx, buf_sv, maxlen);
16d20bd9
AD
2044}
2045
76e3520e 2046STATIC char *
cea2e8a9 2047S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
16d20bd9 2048{
c39cd008 2049#ifdef PERL_CR_FILTER
3280af22 2050 if (!PL_rsfp_filters) {
c39cd008 2051 filter_add(S_cr_textfilter,NULL);
a868473f
NIS
2052 }
2053#endif
3280af22 2054 if (PL_rsfp_filters) {
16d20bd9 2055
55497cff
PP
2056 if (!append)
2057 SvCUR_set(sv, 0); /* start with empty line */
16d20bd9
AD
2058 if (FILTER_READ(0, sv, 0) > 0)
2059 return ( SvPVX(sv) ) ;
2060 else
2061 return Nullch ;
2062 }
9d116dd7 2063 else
fd049845 2064 return (sv_gets(sv, fp, append));
a0d0e21e
LW
2065}
2066
01ec43d0
GS
2067STATIC HV *
2068S_find_in_my_stash(pTHX_ char *pkgname, I32 len)
def3634b
GS
2069{
2070 GV *gv;
2071
01ec43d0 2072 if (len == 11 && *pkgname == '_' && strEQ(pkgname, "__PACKAGE__"))
def3634b
GS
2073 return PL_curstash;
2074
2075 if (len > 2 &&
2076 (pkgname[len - 2] == ':' && pkgname[len - 1] == ':') &&
01ec43d0
GS
2077 (gv = gv_fetchpv(pkgname, FALSE, SVt_PVHV)))
2078 {
2079 return GvHV(gv); /* Foo:: */
def3634b
GS
2080 }
2081
2082 /* use constant CLASS => 'MyClass' */
2083 if ((gv = gv_fetchpv(pkgname, FALSE, SVt_PVCV))) {
2084 SV *sv;
2085 if (GvCV(gv) && (sv = cv_const_sv(GvCV(gv)))) {
2086 pkgname = SvPV_nolen(sv);
2087 }
2088 }
2089
2090 return gv_stashpv(pkgname, FALSE);
2091}
a0d0e21e 2092
748a9306
LW
2093#ifdef DEBUGGING
2094 static char* exp_name[] =
09bef843
SB
2095 { "OPERATOR", "TERM", "REF", "STATE", "BLOCK", "ATTRBLOCK",
2096 "ATTRTERM", "TERMBLOCK"
2097 };
748a9306 2098#endif
463ee0b2 2099
02aa26ce
NT
2100/*
2101 yylex
2102
2103 Works out what to call the token just pulled out of the input
2104 stream. The yacc parser takes care of taking the ops we return and
2105 stitching them into a tree.
2106
2107 Returns:
2108 PRIVATEREF
2109
2110 Structure:
2111 if read an identifier
2112 if we're in a my declaration
2113 croak if they tried to say my($foo::bar)
2114 build the ops for a my() declaration
2115 if it's an access to a my() variable
2116 are we in a sort block?
2117 croak if my($a); $a <=> $b
2118 build ops for access to a my() variable
2119 if in a dq string, and they've said @foo and we can't find @foo
2120 croak
2121 build ops for a bareword
2122 if we already built the token before, use it.
2123*/
2124
dba4d153 2125#ifdef USE_PURE_BISON
864dbfa3 2126int
dba4d153 2127Perl_yylex_r(pTHX_ YYSTYPE *lvalp, int *lcharp)
378cc40b 2128{
20141f0e
RI
2129 int r;
2130
6f202aea 2131 yyactlevel++;
20141f0e
RI
2132 yylval_pointer[yyactlevel] = lvalp;
2133 yychar_pointer[yyactlevel] = lcharp;
b73d6f50
RI
2134 if (yyactlevel >= YYMAXLEVEL)
2135 Perl_croak(aTHX_ "panic: YYMAXLEVEL");
20141f0e 2136
dba4d153 2137 r = Perl_yylex(aTHX);
20141f0e 2138
d8ae6756
RI
2139 if (yyactlevel > 0)
2140 yyactlevel--;
20141f0e
RI
2141
2142 return r;
2143}
dba4d153 2144#endif
20141f0e 2145
dba4d153
JH
2146#ifdef __SC__
2147#pragma segment Perl_yylex
2148#endif
dba4d153 2149int
dba4d153 2150Perl_yylex(pTHX)
20141f0e 2151{
79072805 2152 register char *s;
378cc40b 2153 register char *d;
79072805 2154 register I32 tmp;
463ee0b2 2155 STRLEN len;
161b471a
NIS
2156 GV *gv = Nullgv;
2157 GV **gvp = 0;
aa7440fb 2158 bool bof = FALSE;
a687059c 2159
02aa26ce 2160 /* check if there's an identifier for us to look at */
3280af22 2161 if (PL_pending_ident) {
02aa26ce 2162 /* pit holds the identifier we read and pending_ident is reset */
3280af22
NIS
2163 char pit = PL_pending_ident;
2164 PL_pending_ident = 0;
bbce6d69 2165
607df283
SC
2166 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2167 "### Tokener saw identifier '%s'\n", PL_tokenbuf); })
2168
02aa26ce
NT
2169 /* if we're in a my(), we can't allow dynamics here.
2170 $foo'bar has already been turned into $foo::bar, so
2171 just check for colons.
2172
2173 if it's a legal name, the OP is a PADANY.
2174 */
3280af22 2175 if (PL_in_my) {
77ca0c92 2176 if (PL_in_my == KEY_our) { /* "our" is merely analogous to "my" */
1ec3e8de
GS
2177 if (strchr(PL_tokenbuf,':'))
2178 yyerror(Perl_form(aTHX_ "No package name allowed for "
2179 "variable %s in \"our\"",
2180 PL_tokenbuf));
77ca0c92
LW
2181 tmp = pad_allocmy(PL_tokenbuf);
2182 }
2183 else {
2184 if (strchr(PL_tokenbuf,':'))
2185 yyerror(Perl_form(aTHX_ PL_no_myglob,PL_tokenbuf));
02aa26ce 2186
77ca0c92
LW
2187 yylval.opval = newOP(OP_PADANY, 0);
2188 yylval.opval->op_targ = pad_allocmy(PL_tokenbuf);
2189 return PRIVATEREF;
2190 }
bbce6d69
PP
2191 }
2192
4e553d73 2193 /*
02aa26ce
NT
2194 build the ops for accesses to a my() variable.
2195
2196 Deny my($a) or my($b) in a sort block, *if* $a or $b is
2197 then used in a comparison. This catches most, but not
2198 all cases. For instance, it catches
2199 sort { my($a); $a <=> $b }
2200 but not
2201 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
2202 (although why you'd do that is anyone's guess).
2203 */
2204
3280af22 2205 if (!strchr(PL_tokenbuf,':')) {
a863c7d1 2206#ifdef USE_THREADS
54b9620d 2207 /* Check for single character per-thread SVs */
3280af22
NIS
2208 if (PL_tokenbuf[0] == '$' && PL_tokenbuf[2] == '\0'
2209 && !isALPHA(PL_tokenbuf[1]) /* Rule out obvious non-threadsvs */
2210 && (tmp = find_threadsv(&PL_tokenbuf[1])) != NOT_IN_PAD)
554b3eca 2211 {
2faa37cc 2212 yylval.opval = newOP(OP_THREADSV, 0);
a863c7d1
MB
2213 yylval.opval->op_targ = tmp;
2214 return PRIVATEREF;
2215 }
2216#endif /* USE_THREADS */
3280af22 2217 if ((tmp = pad_findmy(PL_tokenbuf)) != NOT_IN_PAD) {
f472eb5c 2218 SV *namesv = AvARRAY(PL_comppad_name)[tmp];
77ca0c92 2219 /* might be an "our" variable" */
f472eb5c 2220 if (SvFLAGS(namesv) & SVpad_OUR) {
77ca0c92 2221 /* build ops for a bareword */
f472eb5c
GS
2222 SV *sym = newSVpv(HvNAME(GvSTASH(namesv)),0);
2223 sv_catpvn(sym, "::", 2);
2224 sv_catpv(sym, PL_tokenbuf+1);
2225 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sym);
77ca0c92 2226 yylval.opval->op_private = OPpCONST_ENTERED;
f472eb5c 2227 gv_fetchpv(SvPVX(sym),
77ca0c92 2228 (PL_in_eval
f472eb5c
GS
2229 ? (GV_ADDMULTI | GV_ADDINEVAL)
2230 : TRUE
77ca0c92
LW
2231 ),
2232 ((PL_tokenbuf[0] == '$') ? SVt_PV
2233 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
2234 : SVt_PVHV));
2235 return WORD;
2236 }
2237
02aa26ce 2238 /* if it's a sort block and they're naming $a or $b */
3280af22
NIS
2239 if (PL_last_lop_op == OP_SORT &&
2240 PL_tokenbuf[0] == '$' &&
2241 (PL_tokenbuf[1] == 'a' || PL_tokenbuf[1] == 'b')
2242 && !PL_tokenbuf[2])
bbce6d69 2243 {
3280af22
NIS
2244 for (d = PL_in_eval ? PL_oldoldbufptr : PL_linestart;
2245 d < PL_bufend && *d != '\n';
a863c7d1
MB
2246 d++)
2247 {
2248 if (strnEQ(d,"<=>",3) || strnEQ(d,"cmp",3)) {
cea2e8a9 2249 Perl_croak(aTHX_ "Can't use \"my %s\" in sort comparison",
3280af22 2250 PL_tokenbuf);
a863c7d1 2251 }
bbce6d69
PP
2252 }
2253 }
bbce6d69 2254
a863c7d1
MB
2255 yylval.opval = newOP(OP_PADANY, 0);
2256 yylval.opval->op_targ = tmp;
2257 return PRIVATEREF;
2258 }
bbce6d69
PP
2259 }
2260
02aa26ce
NT
2261 /*
2262 Whine if they've said @foo in a doublequoted string,
2263 and @foo isn't a variable we can find in the symbol
2264 table.
2265 */
3280af22
NIS
2266 if (pit == '@' && PL_lex_state != LEX_NORMAL && !PL_lex_brackets) {
2267 GV *gv = gv_fetchpv(PL_tokenbuf+1, FALSE, SVt_PVAV);
8593bda5
GS
2268 if ((!gv || ((PL_tokenbuf[0] == '@') ? !GvAV(gv) : !GvHV(gv)))
2269 && ckWARN(WARN_AMBIGUOUS))
2270 {
2271 /* Downgraded from fatal to warning 20000522 mjd */
2272 Perl_warner(aTHX_ WARN_AMBIGUOUS,
2273 "Possible unintended interpolation of %s in string",
2274 PL_tokenbuf);
2275 }
bbce6d69
PP
2276 }
2277
02aa26ce 2278 /* build ops for a bareword */
3280af22 2279 yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv(PL_tokenbuf+1, 0));
bbce6d69 2280 yylval.opval->op_private = OPpCONST_ENTERED;
3280af22
NIS
2281 gv_fetchpv(PL_tokenbuf+1, PL_in_eval ? (GV_ADDMULTI | GV_ADDINEVAL) : TRUE,
2282 ((PL_tokenbuf[0] == '$') ? SVt_PV
2283 : (PL_tokenbuf[0] == '@') ? SVt_PVAV
bbce6d69
PP
2284 : SVt_PVHV));
2285 return WORD;
2286 }
2287
02aa26ce
NT
2288 /* no identifier pending identification */
2289
3280af22 2290 switch (PL_lex_state) {
79072805
LW
2291#ifdef COMMENTARY
2292 case LEX_NORMAL: /* Some compilers will produce faster */
2293 case LEX_INTERPNORMAL: /* code if we comment these out. */
2294 break;
2295#endif
2296
09bef843 2297 /* when we've already built the next token, just pull it out of the queue */
79072805 2298 case LEX_KNOWNEXT:
3280af22
NIS
2299 PL_nexttoke--;
2300 yylval = PL_nextval[PL_nexttoke];
2301 if (!PL_nexttoke) {
2302 PL_lex_state = PL_lex_defer;
2303 PL_expect = PL_lex_expect;
2304 PL_lex_defer = LEX_NORMAL;
463ee0b2 2305 }
607df283 2306 DEBUG_T({ PerlIO_printf(Perl_debug_log,
4659c93f
RB
2307 "### Next token after '%s' was known, type %"IVdf"\n", PL_bufptr,
2308 (IV)PL_nexttype[PL_nexttoke]); })
607df283 2309
3280af22 2310 return(PL_nexttype[PL_nexttoke]);
79072805 2311
02aa26ce 2312 /* interpolated case modifiers like \L \U, including \Q and \E.
3280af22 2313 when we get here, PL_bufptr is at the \
02aa26ce 2314 */
79072805
LW
2315 case LEX_INTERPCASEMOD:
2316#ifdef DEBUGGING
3280af22 2317 if (PL_bufptr != PL_bufend && *PL_bufptr != '\\')
cea2e8a9 2318 Perl_croak(aTHX_ "panic: INTERPCASEMOD");
79072805 2319#endif
02aa26ce 2320 /* handle \E or end of string */
3280af22 2321 if (PL_bufptr == PL_bufend || PL_bufptr[1] == 'E') {
a0d0e21e 2322 char oldmod;
02aa26ce
NT
2323
2324 /* if at a \E */
3280af22
NIS
2325 if (PL_lex_casemods) {
2326 oldmod = PL_lex_casestack[--PL_lex_casemods];
2327 PL_lex_casestack[PL_lex_casemods] = '\0';
02aa26ce 2328
3280af22
NIS
2329 if (PL_bufptr != PL_bufend && strchr("LUQ", oldmod)) {
2330 PL_bufptr += 2;
2331 PL_lex_state = LEX_INTERPCONCAT;
a0d0e21e 2332 }
79072805
LW
2333 return ')';
2334 }
3280af22
NIS
2335 if (PL_bufptr != PL_bufend)
2336 PL_bufptr += 2;
2337 PL_lex_state = LEX_INTERPCONCAT;
cea2e8a9 2338 return yylex();
79072805
LW
2339 }
2340 else {
607df283
SC
2341 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2342 "### Saw case modifier at '%s'\n", PL_bufptr); })
3280af22 2343 s = PL_bufptr + 1;
79072805
LW
2344 if (strnEQ(s, "L\\u", 3) || strnEQ(s, "U\\l", 3))
2345 tmp = *s, *s = s[2], s[2] = tmp; /* misordered... */
a0d0e21e 2346 if (strchr("LU", *s) &&
3280af22 2347 (strchr(PL_lex_casestack, 'L') || strchr(PL_lex_casestack, 'U')))
a0d0e21e 2348 {
3280af22 2349 PL_lex_casestack[--PL_lex_casemods] = '\0';
a0d0e21e
LW
2350 return ')';
2351 }
3280af22
NIS
2352 if (PL_lex_casemods > 10) {
2353 char* newlb = Renew(PL_lex_casestack, PL_lex_casemods + 2, char);
2354 if (newlb != PL_lex_casestack) {
a0d0e21e 2355 SAVEFREEPV(newlb);
3280af22 2356 PL_lex_casestack = newlb;
a0d0e21e
LW
2357 }
2358 }
3280af22
NIS
2359 PL_lex_casestack[PL_lex_casemods++] = *s;
2360 PL_lex_casestack[PL_lex_casemods] = '\0';
2361 PL_lex_state = LEX_INTERPCONCAT;
2362 PL_nextval[PL_nexttoke].ival = 0;
79072805
LW
2363 force_next('(');
2364 if (*s == 'l')
3280af22 2365 PL_nextval[PL_nexttoke].ival = OP_LCFIRST;
79072805 2366 else if (*s == 'u')
3280af22 2367 PL_nextval[PL_nexttoke].ival = OP_UCFIRST;
79072805 2368 else if (*s == 'L')
3280af22 2369 PL_nextval[PL_nexttoke].ival = OP_LC;
79072805 2370 else if (*s == 'U')
3280af22 2371 PL_nextval[PL_nexttoke].ival = OP_UC;
a0d0e21e 2372 else if (*s == 'Q')
3280af22 2373 PL_nextval[PL_nexttoke].ival = OP_QUOTEMETA;
79072805 2374 else
cea2e8a9 2375 Perl_croak(aTHX_ "panic: yylex");
3280af22 2376 PL_bufptr = s + 1;
79072805 2377 force_next(FUNC);
3280af22
NIS
2378 if (PL_lex_starts) {
2379 s = PL_bufptr;
2380 PL_lex_starts = 0;
79072805
LW
2381 Aop(OP_CONCAT);
2382 }
2383 else
cea2e8a9 2384 return yylex();
79072805
LW
2385 }
2386
55497cff
PP
2387 case LEX_INTERPPUSH:
2388 return sublex_push();
2389
79072805 2390 case LEX_INTERPSTART:
3280af22 2391 if (PL_bufptr == PL_bufend)
79072805 2392 return sublex_done();
607df283
SC
2393 DEBUG_T({ PerlIO_printf(Perl_debug_log,
2394 "### Interpolated variable at '%s'\n", PL_bufptr); })
3280af22
NIS
2395 PL_expect = XTERM;
2396 PL_lex_dojoin = (*PL_bufptr == '@');
2397 PL_lex_state = LEX_INTERPNORMAL;
2398 if (PL_lex_dojoin) {
2399 PL_nextval[PL_nexttoke].ival = 0;
79072805 2400 force_next(',');
554b3eca 2401#ifdef USE_THREADS
533c011a
NIS
2402 PL_nextval[PL_nexttoke].opval = newOP(OP_THREADSV, 0);
2403 PL_nextval[PL_nexttoke].opval->op_targ = find_threadsv("\"");
554b3eca
MB
2404 force_next(PRIVATEREF);
2405#else
a0d0e21e 2406 force_ident("\"", '$');
554b3eca 2407#endif /* USE_THREADS */
3280af22 2408 PL_nextval[PL_nexttoke].ival = 0;
79072805 2409 force_next('$');
3280af22 2410 PL_nextval[PL_nexttoke].ival = 0;
79072805 2411 force_next('(');
3280af22 2412 PL_nextval[PL_nexttoke].ival = OP_JOIN; /* emulate join($", ...) */
79072805
LW
2413 force_next(FUNC);
2414 }
3280af22
NIS
2415 if (PL_lex_starts++) {
2416 s = PL_bufptr;
79072805
LW
2417 Aop(OP_CONCAT);
2418 }
cea2e8a9 2419 return yylex();
79072805
LW
2420
2421 case LEX_INTERPENDMAYBE:
3280af22
NIS
2422 if (intuit_more(PL_bufptr)) {
2423 PL_lex_state = LEX_INTERPNORMAL; /* false alarm, more expr */
79072805
LW
2424 break;
2425 }
2426 /* FALL THROUGH */
2427
2428 case LEX_INTERPEND:
3280af22
NIS
2429 if (PL_lex_dojoin) {
2430 PL_lex_dojoin = FALSE;
2431 PL_lex_state = LEX_INTERPCONCAT;
79072805
LW
2432 return ')';
2433 }
43a16006 2434 if (PL_lex_inwhat == OP_SUBST && PL_linestr == PL_lex_repl
25da4f38 2435 && SvEVALED(PL_lex_repl))
43a16006 2436 {
e9fa98b2 2437 if (PL_bufptr != PL_bufend)
cea2e8a9 2438 Perl_croak(aTHX_ "Bad evalled substitution pattern");
e9fa98b2
HS
2439 PL_lex_repl = Nullsv;
2440 }
79072805
LW
2441 /* FALLTHROUGH */
2442 case LEX_INTERPCONCAT:
2443#ifdef DEBUGGING
3280af22 2444 if (PL_lex_brackets)
cea2e8a9 2445 Perl_croak(aTHX_ "panic: INTERPCONCAT");
79072805 2446#endif
3280af22 2447 if (PL_bufptr == PL_bufend)
79072805
LW
2448 return sublex_done();
2449
3280af22
NIS
2450 if (SvIVX(PL_linestr) == '\'') {
2451 SV *sv = newSVsv(PL_linestr);
2452 if (!PL_lex_inpat)
76e3520e 2453 sv = tokeq(sv);
3280af22 2454 else if ( PL_hints & HINT_NEW_RE )
b3ac6de7 2455 sv = new_constant(NULL, 0, "qr", sv, sv, "q");
79072805 2456 yylval.opval = (OP*)newSVOP(OP_CONST, 0, sv);
3280af22 2457 s = PL_bufend;
79072805
LW
2458 }
2459 else {
3280af22 2460 s = scan_const(PL_bufptr);
79072805 2461 if (*s == '\\')
3280af22 2462 PL_lex_state = LEX_INTERPCASEMOD;
79072805 2463 else
3280af22 2464 PL_lex_state = LEX_INTERPSTART;
79072805
LW
2465 }
2466
3280af22
NIS
2467 if (s != PL_bufptr) {
2468 PL_nextval[PL_nexttoke] = yylval;
2469 PL_expect = XTERM;
79072805 2470 force_next(THING);
3280af22 2471 if (PL_lex_starts++)
79072805
LW
2472 Aop(OP_CONCAT);
2473 else {
3280af22 2474 PL_bufptr = s;
cea2e8a9 2475 return yylex();
79072805
LW
2476 }
2477 }
2478
cea2e8a9 2479 return yylex();
a0d0e21e 2480 case LEX_FORMLINE:
3280af22
NIS
2481 PL_lex_state = LEX_NORMAL;
2482 s = scan_formline(PL_bufptr);
2483 if (!PL_lex_formbrack)
a0d0e21e
LW
2484 goto rightbracket;
2485 OPERATOR(';');
79072805
LW
2486 }
2487
3280af22
NIS
2488 s = PL_bufptr;
2489 PL_oldoldbufptr = PL_oldbufptr;
2490 PL_oldbufptr = s;
607df283 2491 DEBUG_T( {
bf49b057
GS
2492 PerlIO_printf(Perl_debug_log, "### Tokener expecting %s at %s\n",
2493 exp_name[PL_expect], s);
79072805 2494 } )
463ee0b2
LW
2495
2496 retry:
378cc40b
LW
2497 switch (*s) {
2498 default:
7e2040f0 2499 if (isIDFIRST_lazy_if(s,UTF))
834a4ddd 2500 goto keylookup;
cea2e8a9 2501 Perl_croak(aTHX_ "Unrecognized character \\x%02X", *s & 255);
e929a76b
LW
2502 case 4:
2503 case 26:
2504 goto fake_eof; /* emulate EOF on ^D or ^Z */
378cc40b 2505 case 0:
3280af22
NIS
2506 if (!PL_rsfp) {
2507 PL_last_uni = 0;
2508 PL_last_lop = 0;
2509 if (PL_lex_brackets)
d98d5fff 2510 yyerror("Missing right curly or square bracket");
4e553d73 2511 DEBUG_T( { PerlIO_printf(Perl_debug_log,
607df283
SC
2512 "### Tokener got EOF\n");
2513 } )
79072805 2514 TOKEN(0);
463ee0b2 2515 }
3280af22 2516 if (s++ < PL_bufend)
a687059c 2517 goto retry; /* ignore stray nulls */
3280af22
NIS
2518 PL_last_uni = 0;
2519 PL_last_lop = 0;
2520 if (!PL_in_eval && !PL_preambled) {
2521 PL_preambled = TRUE;
2522 sv_setpv(PL_linestr,incl_perldb());
2523 if (SvCUR(PL_linestr))
2524 sv_catpv(PL_linestr,";");
2525 if (PL_preambleav){
2526 while(AvFILLp(PL_preambleav) >= 0) {
2527 SV *tmpsv = av_shift(PL_preambleav);
2528 sv_catsv(PL_linestr, tmpsv);
2529 sv_catpv(PL_linestr, ";");
91b7def8
PP
2530 sv_free(tmpsv);
2531 }
3280af22
NIS
2532 sv_free((SV*)PL_preambleav);
2533 PL_preambleav = NULL;
91b7def8 2534 }
3280af22
NIS
2535 if (PL_minus_n || PL_minus_p) {
2536 sv_catpv(PL_linestr, "LINE: while (<>) {");
2537 if (PL_minus_l)
2538 sv_catpv(PL_linestr,"chomp;");
2539 if (PL_minus_a) {
8fd239a7
CS
2540 GV* gv = gv_fetchpv("::F", TRUE, SVt_PVAV);
2541 if (gv)
2542 GvIMPORTED_AV_on(gv);
3280af22
NIS
2543 if (PL_minus_F) {
2544 if (strchr("/'\"", *PL_splitstr)
2545 && strchr(PL_splitstr + 1, *PL_splitstr))
cea2e8a9 2546 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s);", PL_splitstr);
54310121
PP
2547 else {
2548 char delim;
2549 s = "'~#\200\1'"; /* surely one char is unused...*/
3280af22 2550 while (s[1] && strchr(PL_splitstr, *s)) s++;
54310121 2551 delim = *s;
cea2e8a9 2552 Perl_sv_catpvf(aTHX_ PL_linestr, "@F=split(%s%c",
46fc3d4c 2553 "q" + (delim == '\''), delim);
3280af22 2554 for (s = PL_splitstr; *s; s++) {
54310121 2555 if (*s == '\\')
3280af22
NIS
2556 sv_catpvn(PL_linestr, "\\", 1);
2557 sv_catpvn(PL_linestr, s, 1);
54310121 2558 }
cea2e8a9 2559 Perl_sv_catpvf(aTHX_ PL_linestr, "%c);", delim);
54310121 2560 }
2304df62
AD
2561 }
2562 else
3280af22 2563 sv_catpv(PL_linestr,"@F=split(' ');");
2304df62 2564 }
79072805 2565 }
3280af22
NIS
2566 sv_catpv(PL_linestr, "\n");
2567 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2568 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 2569 PL_last_lop = PL_last_uni = Nullch;
3280af22 2570 if (PERLDB_LINE && PL_curstash != PL_debstash) {
a0d0e21e
LW
2571 SV *sv = NEWSV(85,0);
2572
2573 sv_upgrade(sv, SVt_PVMG);
3280af22 2574 sv_setsv(sv,PL_linestr);
57843af0 2575 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
a0d0e21e 2576 }
79072805 2577 goto retry;
a687059c 2578 }
e929a76b 2579 do {
aa7440fb 2580 bof = PL_rsfp ? TRUE : FALSE;
7e28d3af
JH
2581 if ((s = filter_gets(PL_linestr, PL_rsfp, 0)) == Nullch) {
2582 fake_eof:
2583 if (PL_rsfp) {
2584 if (PL_preprocess && !PL_in_eval)
2585 (void)PerlProc_pclose(PL_rsfp);
2586 else if ((PerlIO *)PL_rsfp == PerlIO_stdin())
2587 PerlIO_clearerr(PL_rsfp);
2588 else
2589 (void)PerlIO_close(PL_rsfp);
2590 PL_rsfp = Nullfp;
2591 PL_doextract = FALSE;
2592 }
2593 if (!PL_in_eval && (PL_minus_n || PL_minus_p)) {
2594 sv_setpv(PL_linestr,PL_minus_p ? ";}continue{print" : "");
2595 sv_catpv(PL_linestr,";}");
2596 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2597 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 2598 PL_last_lop = PL_last_uni = Nullch;
7e28d3af
JH
2599 PL_minus_n = PL_minus_p = 0;
2600 goto retry;
2601 }
2602 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
207e3d1a 2603 PL_last_lop = PL_last_uni = Nullch;
7e28d3af
JH
2604 sv_setpv(PL_linestr,"");
2605 TOKEN(';'); /* not infinite loop because rsfp is NULL now */
2606 }
2607 /* if it looks like the start of a BOM, check if it in fact is */
2608 else if (bof && (!*s || *(U8*)s == 0xEF || *(U8*)s >= 0xFE)) {
226017aa 2609#ifdef PERLIO_IS_STDIO
e3f494f1
JH
2610# ifdef __GNU_LIBRARY__
2611# if __GNU_LIBRARY__ == 1 /* Linux glibc5 */
226017aa
DD
2612# define FTELL_FOR_PIPE_IS_BROKEN
2613# endif
e3f494f1
JH
2614# else
2615# ifdef __GLIBC__
2616# if __GLIBC__ == 1 /* maybe some glibc5 release had it like this? */
2617# define FTELL_FOR_PIPE_IS_BROKEN
2618# endif
2619# endif
226017aa
DD
2620# endif
2621#endif
2622#ifdef FTELL_FOR_PIPE_IS_BROKEN
2623 /* This loses the possibility to detect the bof
2624 * situation on perl -P when the libc5 is being used.
2625 * Workaround? Maybe attach some extra state to PL_rsfp?
2626 */
2627 if (!PL_preprocess)
7e28d3af 2628 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
226017aa 2629#else
7e28d3af 2630 bof = PerlIO_tell(PL_rsfp) == SvCUR(PL_linestr);
226017aa 2631#endif
7e28d3af 2632 if (bof) {
3280af22 2633 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7e28d3af 2634 s = swallow_bom((U8*)s);
e929a76b 2635 }
378cc40b 2636 }
3280af22 2637 if (PL_doextract) {
a0d0e21e 2638 if (*s == '#' && s[1] == '!' && instr(s,"perl"))
3280af22 2639 PL_doextract = FALSE;
a0d0e21e
LW
2640
2641 /* Incest with pod. */
2642 if (*s == '=' && strnEQ(s, "=cut", 4)) {
3280af22
NIS
2643 sv_setpv(PL_linestr, "");
2644 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2645 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 2646 PL_last_lop = PL_last_uni = Nullch;
3280af22 2647 PL_doextract = FALSE;
a0d0e21e 2648 }
4e553d73 2649 }
463ee0b2 2650 incline(s);
3280af22
NIS
2651 } while (PL_doextract);
2652 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = PL_linestart = s;
2653 if (PERLDB_LINE && PL_curstash != PL_debstash) {
79072805 2654 SV *sv = NEWSV(85,0);
a687059c 2655
93a17b20 2656 sv_upgrade(sv, SVt_PVMG);
3280af22 2657 sv_setsv(sv,PL_linestr);
57843af0 2658 av_store(CopFILEAV(PL_curcop),(I32)CopLINE(PL_curcop),sv);
a687059c 2659 }
3280af22 2660 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 2661 PL_last_lop = PL_last_uni = Nullch;
57843af0 2662 if (CopLINE(PL_curcop) == 1) {
3280af22 2663 while (s < PL_bufend && isSPACE(*s))
79072805 2664 s++;
a0d0e21e 2665 if (*s == ':' && s[1] != ':') /* for csh execing sh scripts */
79072805 2666 s++;
44a8e56a 2667 d = Nullch;
3280af22 2668 if (!PL_in_eval) {
44a8e56a
PP
2669 if (*s == '#' && *(s+1) == '!')
2670 d = s + 2;
2671#ifdef ALTERNATE_SHEBANG
2672 else {
2673 static char as[] = ALTERNATE_SHEBANG;
2674 if (*s == as[0] && strnEQ(s, as, sizeof(as) - 1))
2675 d = s + (sizeof(as) - 1);
2676 }
2677#endif /* ALTERNATE_SHEBANG */
2678 }
2679 if (d) {
b8378b72 2680 char *ipath;
774d564b 2681 char *ipathend;
b8378b72 2682
774d564b 2683 while (isSPACE(*d))
b8378b72
CS
2684 d++;
2685 ipath = d;
774d564b
PP
2686 while (*d && !isSPACE(*d))
2687 d++;
2688 ipathend = d;
2689
2690#ifdef ARG_ZERO_IS_SCRIPT
2691 if (ipathend > ipath) {
2692 /*
2693 * HP-UX (at least) sets argv[0] to the script name,
2694 * which makes $^X incorrect. And Digital UNIX and Linux,
2695 * at least, set argv[0] to the basename of the Perl
2696 * interpreter. So, having found "#!", we'll set it right.
2697 */
2698 SV *x = GvSV(gv_fetchpv("\030", TRUE, SVt_PV));
2699 assert(SvPOK(x) || SvGMAGICAL(x));
cc49e20b 2700 if (sv_eq(x, CopFILESV(PL_curcop))) {
774d564b 2701 sv_setpvn(x, ipath, ipathend - ipath);
9607fc9c
PP
2702 SvSETMAGIC(x);
2703 }
774d564b 2704 TAINT_NOT; /* $^X is always tainted, but that's OK */
8ebc5c01 2705 }
774d564b 2706#endif /* ARG_ZERO_IS_SCRIPT */
b8378b72
CS
2707
2708 /*
2709 * Look for options.
2710 */
748a9306 2711 d = instr(s,"perl -");
84e30d1a 2712 if (!d) {
748a9306 2713 d = instr(s,"perl");
84e30d1a
GS
2714#if defined(DOSISH)
2715 /* avoid getting into infinite loops when shebang
2716 * line contains "Perl" rather than "perl" */
2717 if (!d) {
2718 for (d = ipathend-4; d >= ipath; --d) {
2719 if ((*d == 'p' || *d == 'P')
2720 && !ibcmp(d, "perl", 4))
2721 {
2722 break;
2723 }
2724 }
2725 if (d < ipath)
2726 d = Nullch;
2727 }
2728#endif
2729 }
44a8e56a
PP
2730#ifdef ALTERNATE_SHEBANG
2731 /*
2732 * If the ALTERNATE_SHEBANG on this system starts with a
2733 * character that can be part of a Perl expression, then if
2734 * we see it but not "perl", we're probably looking at the
2735 * start of Perl code, not a request to hand off to some
2736 * other interpreter. Similarly, if "perl" is there, but
2737 * not in the first 'word' of the line, we assume the line
2738 * contains the start of the Perl program.
44a8e56a
PP
2739 */
2740 if (d && *s != '#') {
774d564b 2741 char *c = ipath;
44a8e56a
PP
2742 while (*c && !strchr("; \t\r\n\f\v#", *c))
2743 c++;
2744 if (c < d)
2745 d = Nullch; /* "perl" not in first word; ignore */
2746 else
2747 *s = '#'; /* Don't try to parse shebang line */
2748 }
774d564b 2749#endif /* ALTERNATE_SHEBANG */
bf4acbe4 2750#ifndef MACOS_TRADITIONAL
748a9306 2751 if (!d &&
44a8e56a 2752 *s == '#' &&
774d564b 2753 ipathend > ipath &&
3280af22 2754 !PL_minus_c &&
748a9306 2755 !instr(s,"indir") &&
3280af22 2756 instr(PL_origargv[0],"perl"))
748a9306 2757 {
9f68db38 2758 char **newargv;
9f68db38 2759
774d564b
PP
2760 *ipathend = '\0';
2761 s = ipathend + 1;
3280af22 2762 while (s < PL_bufend && isSPACE(*s))
9f68db38 2763 s++;
3280af22
NIS
2764 if (s < PL_bufend) {
2765 Newz(899,newargv,PL_origargc+3,char*);
9f68db38 2766 newargv[1] = s;
3280af22 2767 while (s < PL_bufend && !isSPACE(*s))
9f68db38
LW
2768 s++;
2769 *s = '\0';
3280af22 2770 Copy(PL_origargv+1, newargv+2, PL_origargc+1, char*);
9f68db38
LW
2771 }
2772 else
3280af22 2773 newargv = PL_origargv;
774d564b 2774 newargv[0] = ipath;
b4748376 2775 PerlProc_execv(ipath, EXEC_ARGV_CAST(newargv));
cea2e8a9 2776 Perl_croak(aTHX_ "Can't exec %s", ipath);
9f68db38 2777 }
bf4acbe4 2778#endif
748a9306 2779 if (d) {
3280af22
NIS
2780 U32 oldpdb = PL_perldb;
2781 bool oldn = PL_minus_n;
2782 bool oldp = PL_minus_p;
748a9306
LW
2783
2784 while (*d && !isSPACE(*d)) d++;
bf4acbe4 2785 while (SPACE_OR_TAB(*d)) d++;
748a9306
LW
2786
2787 if (*d++ == '-') {
8cc95fdb
PP
2788 do {
2789 if (*d == 'M' || *d == 'm') {
2790 char *m = d;
2791 while (*d && !isSPACE(*d)) d++;
cea2e8a9 2792 Perl_croak(aTHX_ "Too late for \"-%.*s\" option",
8cc95fdb
PP
2793 (int)(d - m), m);
2794 }
2795 d = moreswitches(d);
2796 } while (d);
155aba94
GS
2797 if ((PERLDB_LINE && !oldpdb) ||
2798 ((PL_minus_n || PL_minus_p) && !(oldn || oldp)))
b084f20b
PP
2799 /* if we have already added "LINE: while (<>) {",
2800 we must not do it again */
748a9306 2801 {
3280af22
NIS
2802 sv_setpv(PL_linestr, "");
2803 PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = SvPVX(PL_linestr);
2804 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
207e3d1a 2805 PL_last_lop = PL_last_uni = Nullch;
3280af22 2806 PL_preambled = FALSE;
84902520 2807 if (PERLDB_LINE)
3280af22 2808 (void)gv_fetchfile(PL_origfilename);
748a9306
LW
2809 goto retry;
2810 }
a0d0e21e 2811 }
79072805 2812 }
9f68db38 2813 }
79072805 2814 }
3280af22
NIS
2815 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2816 PL_bufptr = s;
2817 PL_lex_state = LEX_FORMLINE;
cea2e8a9 2818 return yylex();
ae986130 2819 }
378cc40b 2820 goto retry;
4fdae800 2821 case '\r':
6a27c188 2822#ifdef PERL_STRICT_CR
cea2e8a9 2823 Perl_warn(aTHX_ "Illegal character \\%03o (carriage return)", '\r');
4e553d73 2824 Perl_croak(aTHX_
cc507455 2825 "\t(Maybe you didn't strip carriage returns after a network transfer?)\n");
a868473f 2826#endif
4fdae800 2827 case ' ': case '\t': case '\f': case 013:
bf4acbe4
GS
2828#ifdef MACOS_TRADITIONAL
2829 case '\312':
2830#endif
378cc40b
LW
2831 s++;
2832 goto retry;
378cc40b 2833 case '#':
e929a76b 2834 case '\n':
3280af22 2835 if (PL_lex_state != LEX_NORMAL || (PL_in_eval && !PL_rsfp)) {
df0deb90
GS
2836 if (*s == '#' && s == PL_linestart && PL_in_eval && !PL_rsfp) {
2837 /* handle eval qq[#line 1 "foo"\n ...] */
2838 CopLINE_dec(PL_curcop);
2839 incline(s);
2840 }
3280af22 2841 d = PL_bufend;
a687059c 2842 while (s < d && *s != '\n')
378cc40b 2843 s++;
0f85fab0 2844 if (s < d)
378cc40b 2845 s++;
463ee0b2 2846 incline(s);
3280af22
NIS
2847 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
2848 PL_bufptr = s;
2849 PL_lex_state = LEX_FORMLINE;
cea2e8a9 2850 return yylex();
a687059c 2851 }
378cc40b 2852 }
a687059c 2853 else {
378cc40b 2854 *s = '\0';
3280af22 2855 PL_bufend = s;
a687059c 2856 }
378cc40b
LW
2857 goto retry;
2858 case '-':
79072805 2859 if (s[1] && isALPHA(s[1]) && !isALNUM(s[2])) {
e5edeb50
JH
2860 I32 ftst = 0;
2861
378cc40b 2862 s++;
3280af22 2863 PL_bufptr = s;
748a9306
LW
2864 tmp = *s++;
2865
bf4acbe4 2866 while (s < PL_bufend && SPACE_OR_TAB(*s))
748a9306
LW
2867 s++;
2868
2869 if (strnEQ(s,"=>",2)) {
3280af22 2870 s = force_word(PL_bufptr,WORD,FALSE,FALSE,FALSE);
4e553d73 2871 DEBUG_T( { PerlIO_printf(Perl_debug_log,
607df283
SC
2872 "### Saw unary minus before =>, forcing word '%s'\n", s);
2873 } )
748a9306
LW
2874 OPERATOR('-'); /* unary minus */
2875 }
3280af22 2876 PL_last_uni = PL_oldbufptr;
748a9306 2877 switch (tmp) {
e5edeb50
JH
2878 case 'r': ftst = OP_FTEREAD; break;
2879 case 'w': ftst = OP_FTEWRITE; break;
2880 case 'x': ftst = OP_FTEEXEC; break;
2881 case 'o': ftst = OP_FTEOWNED; break;
2882 case 'R': ftst = OP_FTRREAD; break;
2883 case 'W': ftst = OP_FTRWRITE; break;
2884 case 'X': ftst = OP_FTREXEC; break;
2885 case 'O': ftst = OP_FTROWNED; break;
2886 case 'e': ftst = OP_FTIS; break;
2887 case 'z': ftst = OP_FTZERO; break;
2888 case 's': ftst = OP_FTSIZE; break;
2889 case 'f': ftst = OP_FTFILE; break;
2890 case 'd': ftst = OP_FTDIR; break;
2891 case 'l': ftst = OP_FTLINK; break;
2892 case 'p': ftst = OP_FTPIPE; break;
2893 case 'S': ftst = OP_FTSOCK; break;
2894 case 'u': ftst = OP_FTSUID; break;
2895 case 'g': ftst = OP_FTSGID; break;
2896 case 'k': ftst = OP_FTSVTX; break;
2897 case 'b': ftst = OP_FTBLK; break;
2898 case 'c': ftst = OP_FTCHR; break;
2899 case 't': ftst = OP_FTTTY; break;
2900 case 'T': ftst = OP_FTTEXT; break;
2901 case 'B': ftst = OP_FTBINARY; break;
2902 case 'M': case 'A': case 'C':
2903 gv_fetchpv("\024",TRUE, SVt_PV);
2904 switch (tmp) {
2905 case 'M': ftst = OP_FTMTIME; break;
2906 case 'A': ftst = OP_FTATIME; break;
2907 case 'C': ftst = OP_FTCTIME; break;
2908 default: break;
2909 }
2910 break;
378cc40b 2911 default:
378cc40b
LW
2912 break;
2913 }
e5edeb50
JH
2914 if (ftst) {
2915 PL_last_lop_op = ftst;
4e553d73 2916 DEBUG_T( { PerlIO_printf(Perl_debug_log,
0844c848 2917 "### Saw file test %c\n", (int)ftst);
e5edeb50 2918 } )
e5edeb50
JH
2919 FTST(ftst);
2920 }
2921 else {
2922 /* Assume it was a minus followed by a one-letter named
2923 * subroutine call (or a -bareword), then. */
95c31fe3 2924 DEBUG_T( { PerlIO_printf(Perl_debug_log,
0844c848
RB
2925 "### %c looked like a file test but was not\n",
2926 (int)ftst);
95c31fe3 2927 } )
e5edeb50
JH
2928 s -= 2;
2929 }
378cc40b 2930 }
a687059c
LW
2931 tmp = *s++;
2932 if (*s == tmp) {
2933 s++;
3280af22 2934 if (PL_expect == XOPERATOR)
79072805
LW
2935 TERM(POSTDEC);
2936 else
2937 OPERATOR(PREDEC);
2938 }
2939 else if (*s == '>') {
2940 s++;
2941 s = skipspace(s);
7e2040f0 2942 if (isIDFIRST_lazy_if(s,UTF)) {
a0d0e21e 2943 s = force_word(s,METHOD,FALSE,TRUE,FALSE);
463ee0b2 2944 TOKEN(ARROW);
79072805 2945 }
748a9306
LW
2946 else if (*s == '$')
2947 OPERATOR(ARROW);
463ee0b2 2948 else
748a9306 2949 TERM(ARROW);
a687059c 2950 }
3280af22 2951 if (PL_expect == XOPERATOR)
79072805
LW
2952 Aop(OP_SUBTRACT);
2953 else {
3280af22 2954 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2f3197b3 2955 check_uni();
79072805 2956 OPERATOR('-'); /* unary minus */
2f3197b3 2957 }
79072805 2958
378cc40b 2959 case '+':
a687059c
LW
2960 tmp = *s++;
2961 if (*s == tmp) {
378cc40b 2962 s++;
3280af22 2963 if (PL_expect == XOPERATOR)
79072805
LW
2964 TERM(POSTINC);
2965 else
2966 OPERATOR(PREINC);
378cc40b 2967 }
3280af22 2968 if (PL_expect == XOPERATOR)
79072805
LW
2969 Aop(OP_ADD);
2970 else {
3280af22 2971 if (isSPACE(*s) || !isSPACE(*PL_bufptr))
2f3197b3 2972 check_uni();
a687059c 2973 OPERATOR('+');
2f3197b3 2974 }
a687059c 2975
378cc40b 2976 case '*':
3280af22
NIS
2977 if (PL_expect != XOPERATOR) {
2978 s = scan_ident(s, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
2979 PL_expect = XOPERATOR;
2980 force_ident(PL_tokenbuf, '*');
2981 if (!*PL_tokenbuf)
a0d0e21e 2982 PREREF('*');
79072805 2983 TERM('*');
a687059c 2984 }
79072805
LW
2985 s++;
2986 if (*s == '*') {
a687059c 2987 s++;
79072805 2988 PWop(OP_POW);
a687059c 2989 }
79072805
LW
2990 Mop(OP_MULTIPLY);
2991
378cc40b 2992 case '%':
3280af22 2993 if (PL_expect == XOPERATOR) {
bbce6d69
PP
2994 ++s;
2995 Mop(OP_MODULO);
a687059c 2996 }
3280af22
NIS
2997 PL_tokenbuf[0] = '%';
2998 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1, TRUE);
2999 if (!PL_tokenbuf[1]) {
3000 if (s == PL_bufend)
bbce6d69
PP
3001 yyerror("Final % should be \\% or %name");
3002 PREREF('%');
a687059c 3003 }
3280af22 3004 PL_pending_ident = '%';
bbce6d69 3005 TERM('%');
a687059c 3006
378cc40b 3007 case '^':
79072805 3008 s++;
a0d0e21e 3009 BOop(OP_BIT_XOR);
79072805 3010 case '[':
3280af22 3011 PL_lex_brackets++;
79072805 3012 /* FALL THROUGH */
378cc40b 3013 case '~':
378cc40b 3014 case ',':
378cc40b
LW
3015 tmp = *s++;
3016 OPERATOR(tmp);
a0d0e21e
LW
3017 case ':':
3018 if (s[1] == ':') {
3019 len = 0;
3020 goto just_a_word;
3021 }
3022 s++;
09bef843
SB
3023 switch (PL_expect) {
3024 OP *attrs;
3025 case XOPERATOR:
3026 if (!PL_in_my || PL_lex_state != LEX_NORMAL)
3027 break;
3028 PL_bufptr = s; /* update in case we back off */
3029 goto grabattrs;
3030 case XATTRBLOCK:
3031 PL_expect = XBLOCK;
3032 goto grabattrs;
3033 case XATTRTERM:
3034 PL_expect = XTERMBLOCK;
3035 grabattrs:
3036 s = skipspace(s);
3037 attrs = Nullop;
7e2040f0 3038 while (isIDFIRST_lazy_if(s,UTF)) {
09bef843 3039 d = scan_word(s, PL_tokenbuf, sizeof PL_tokenbuf, FALSE, &len);
f9829d6b
GS
3040 if (isLOWER(*s) && (tmp = keyword(PL_tokenbuf, len))) {
3041 if (tmp < 0) tmp = -tmp;
3042 switch (tmp) {
3043 case KEY_or:
3044 case KEY_and:
3045 case KEY_for:
3046 case KEY_unless:
3047 case KEY_if:
3048 case KEY_while:
3049 case KEY_until:
3050 goto got_attrs;
3051 default:
3052 break;
3053 }
3054 }
09bef843
SB
3055 if (*d == '(') {
3056 d = scan_str(d,TRUE,TRUE);
3057 if (!d) {
09bef843
SB
3058 /* MUST advance bufptr here to avoid bogus
3059 "at end of line" context messages from yyerror().
3060 */
3061 PL_bufptr = s + len;
3062 yyerror("Unterminated attribute parameter in attribute list");
3063 if (attrs)
3064 op_free(attrs);
3065 return 0; /* EOF indicator */
3066 }
3067 }
3068 if (PL_lex_stuff) {
3069 SV *sv = newSVpvn(s, len);
3070 sv_catsv(sv, PL_lex_stuff);
3071 attrs = append_elem(OP_LIST, attrs,
3072 newSVOP(OP_CONST, 0, sv));
3073 SvREFCNT_dec(PL_lex_stuff);
3074 PL_lex_stuff = Nullsv;
3075 }
3076 else {
78f9721b
SM
3077 if (!PL_in_my && len == 6 && strnEQ(s, "lvalue", len))
3078 CvLVALUE_on(PL_compcv);
3079 else if (!PL_in_my && len == 6 && strnEQ(s, "locked", len))
3080 CvLOCKED_on(PL_compcv);
3081 else if (!PL_in_my && len == 6 && strnEQ(s, "method", len))
3082 CvMETHOD_on(PL_compcv);
87ecf892
DM
3083#ifdef USE_ITHREADS
3084 else if (PL_in_my == KEY_our && len == 6 && strnEQ(s, "shared", len))
3085 GvSHARED_on(cGVOPx_gv(yylval.opval));
3086#endif
78f9721b
SM
3087 /* After we've set the flags, it could be argued that
3088 we don't need to do the attributes.pm-based setting
3089 process, and shouldn't bother appending recognized
3090 flags. To experiment with that, uncomment the
3091 following "else": */
0256094b 3092 else
78f9721b
SM
3093 attrs = append_elem(OP_LIST, attrs,
3094 newSVOP(OP_CONST, 0,
3095 newSVpvn(s, len)));
09bef843
SB
3096 }
3097 s = skipspace(d);
0120eecf 3098 if (*s == ':' && s[1] != ':')
09bef843 3099 s = skipspace(s+1);
0120eecf
GS
3100 else if (s == d)
3101 break; /* require real whitespace or :'s */
09bef843 3102 }
f9829d6b
GS
3103 tmp = (PL_expect == XOPERATOR ? '=' : '{'); /*'}(' for vi */
3104 if (*s != ';' && *s != tmp && (tmp != '=' || *s != ')')) {
09bef843
SB
3105 char q = ((*s == '\'') ? '"' : '\'');
3106 /* If here for an expression, and parsed no attrs, back off. */
3107 if (tmp == '=' && !attrs) {
3108 s = PL_bufptr;
3109 break;
3110 }
3111 /* MUST advance bufptr here to avoid bogus "at end of line"
3112 context messages from yyerror().
3113 */
3114 PL_bufptr = s;
3115 if (!*s)
3116 yyerror("Unterminated attribute list");
3117 else
3118 yyerror(Perl_form(aTHX_ "Invalid separator character %c%c%c in attribute list",
3119 q, *s, q));
3120 if (attrs)
3121 op_free(attrs);
3122 OPERATOR(':');
3123 }
f9829d6b 3124 got_attrs:
09bef843
SB
3125 if (attrs) {
3126 PL_nextval[PL_nexttoke].opval = attrs;
3127 force_next(THING);
3128 }
3129 TOKEN(COLONATTR);
3130 }
a0d0e21e 3131 OPERATOR(':');
8990e307
LW
3132 case '(':
3133 s++;
3280af22
NIS
3134 if (PL_last_lop == PL_oldoldbufptr || PL_last_uni == PL_oldoldbufptr)
3135 PL_oldbufptr = PL_oldoldbufptr; /* allow print(STDOUT 123) */
a0d0e21e 3136 else
3280af22 3137 PL_expect = XTERM;
a0d0e21e 3138 TOKEN('(');
378cc40b 3139 case ';':
f4dd75d9 3140 CLINE;
378cc40b
LW
3141 tmp = *s++;
3142 OPERATOR(tmp);
3143 case ')':
378cc40b 3144 tmp = *s++;
16d20bd9
AD
3145 s = skipspace(s);
3146 if (*s == '{')
3147 PREBLOCK(tmp);
378cc40b 3148 TERM(tmp);
79072805
LW
3149 case ']':
3150 s++;
3280af22 3151 if (PL_lex_brackets <= 0)
d98d5fff 3152 yyerror("Unmatched right square bracket");
463ee0b2 3153 else
3280af22
NIS
3154 --PL_lex_brackets;
3155 if (PL_lex_state == LEX_INTERPNORMAL) {
3156 if (PL_lex_brackets == 0) {
a0d0e21e 3157 if (*s != '[' && *s != '{' && (*s != '-' || s[1] != '>'))
3280af22 3158 PL_lex_state = LEX_INTERPEND;
79072805
LW
3159 }
3160 }
4633a7c4 3161 TERM(']');
79072805
LW
3162 case '{':
3163 leftbracket:
79072805 3164 s++;
3280af22
NIS
3165 if (PL_lex_brackets > 100) {
3166 char* newlb = Renew(PL_lex_brackstack, PL_lex_brackets + 1, char);
3167 if (newlb != PL_lex_brackstack) {
8990e307 3168 SAVEFREEPV(newlb);
3280af22 3169 PL_lex_brackstack = newlb;
8990e307
LW
3170 }
3171 }
3280af22 3172 switch (PL_expect) {
a0d0e21e 3173 case XTERM:
3280af22 3174 if (PL_lex_formbrack) {
a0d0e21e
LW
3175 s--;
3176 PRETERMBLOCK(DO);
3177 }
3280af22
NIS
3178 if (PL_oldoldbufptr == PL_last_lop)
3179 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
a0d0e21e 3180 else
3280af22 3181 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
79072805 3182 OPERATOR(HASHBRACK);
a0d0e21e 3183 case XOPERATOR:
bf4acbe4 3184 while (s < PL_bufend && SPACE_OR_TAB(*s))
748a9306 3185 s++;
44a8e56a 3186 d = s;
3280af22
NIS
3187 PL_tokenbuf[0] = '\0';
3188 if (d < PL_bufend && *d == '-') {
3189 PL_tokenbuf[0] = '-';
44a8e56a 3190 d++;
bf4acbe4 3191 while (d < PL_bufend && SPACE_OR_TAB(*d))
44a8e56a
PP
3192 d++;
3193 }
7e2040f0 3194 if (d < PL_bufend && isIDFIRST_lazy_if(d,UTF)) {
3280af22 3195 d = scan_word(d, PL_tokenbuf + 1, sizeof PL_tokenbuf - 1,
8903cb82 3196 FALSE, &len);
bf4acbe4 3197 while (d < PL_bufend && SPACE_OR_TAB(*d))
748a9306
LW
3198 d++;
3199 if (*d == '}') {
3280af22 3200 char minus = (PL_tokenbuf[0] == '-');
44a8e56a
PP
3201 s = force_word(s + minus, WORD, FALSE, TRUE, FALSE);
3202 if (minus)
3203 force_next('-');
748a9306
LW
3204 }
3205 }
3206 /* FALL THROUGH */
09bef843 3207 case XATTRBLOCK:
748a9306 3208 case XBLOCK:
3280af22
NIS
3209 PL_lex_brackstack[PL_lex_brackets++] = XSTATE;
3210 PL_expect = XSTATE;
a0d0e21e 3211 break;
09bef843 3212 case XATTRTERM:
a0d0e21e 3213 case XTERMBLOCK:
3280af22
NIS
3214 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
3215 PL_expect = XSTATE;
a0d0e21e
LW
3216 break;
3217 default: {
3218 char *t;
3280af22
NIS
3219 if (PL_oldoldbufptr == PL_last_lop)
3220 PL_lex_brackstack[PL_lex_brackets++] = XTERM;
a0d0e21e 3221 else
3280af22 3222 PL_lex_brackstack[PL_lex_brackets++] = XOPERATOR;
a0d0e21e 3223 s = skipspace(s);
09ecc4b6 3224 if (*s == '}')
a0d0e21e 3225 OPERATOR(HASHBRACK);
b8a4b1be
GS
3226 /* This hack serves to disambiguate a pair of curlies
3227 * as being a block or an anon hash. Normally, expectation
3228 * determines that, but in cases where we're not in a
3229 * position to expect anything in particular (like inside
3230 * eval"") we have to resolve the ambiguity. This code
3231 * covers the case where the first term in the curlies is a
3232 * quoted string. Most other cases need to be explicitly
3233 * disambiguated by prepending a `+' before the opening
3234 * curly in order to force resolution as an anon hash.
3235 *
3236 * XXX should probably propagate the outer expectation
3237 * into eval"" to rely less on this hack, but that could
3238 * potentially break current behavior of eval"".
3239 * GSAR 97-07-21
3240 */
3241 t = s;
3242 if (*s == '\'' || *s == '"' || *s == '`') {
3243 /* common case: get past first string, handling escapes */
3280af22 3244 for (t++; t < PL_bufend && *t != *s;)
b8a4b1be
GS
3245 if (*t++ == '\\' && (*t == '\\' || *t == *s))
3246 t++;
3247 t++;
a0d0e21e 3248 }
b8a4b1be 3249 else if (*s == 'q') {
3280af22 3250 if (++t < PL_bufend
b8a4b1be 3251 && (!isALNUM(*t)
3280af22 3252 || ((*t == 'q' || *t == 'x') && ++t < PL_bufend
0505442f
GS
3253 && !isALNUM(*t))))
3254 {
b8a4b1be
GS
3255 char *tmps;
3256 char open, close, term;
3257 I32 brackets = 1;
3258
3280af22 3259 while (t < PL_bufend && isSPACE(*t))
b8a4b1be
GS
3260 t++;
3261 term = *t;
3262 open = term;
3263 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
3264 term = tmps[5];
3265 close = term;
3266 if (open == close)
3280af22
NIS
3267 for (t++; t < PL_bufend; t++) {
3268 if (*t == '\\' && t+1 < PL_bufend && open != '\\')
b8a4b1be 3269 t++;
6d07e5e9 3270 else if (*t == open)
b8a4b1be
GS
3271 break;
3272 }
3273 else
3280af22
NIS
3274 for (t++; t < PL_bufend; t++) {
3275 if (*t == '\\' && t+1 < PL_bufend)
b8a4b1be 3276 t++;
6d07e5e9 3277 else if (*t == close && --brackets <= 0)
b8a4b1be
GS
3278 break;
3279 else if (*t == open)
3280 brackets++;
3281 }
3282 }
3283 t++;
a0d0e21e 3284 }
7e2040f0 3285 else if (isALNUM_lazy_if(t,UTF)) {
0505442f 3286 t += UTF8SKIP(t);
7e2040f0 3287 while (t < PL_bufend && isALNUM_lazy_if(t,UTF))
0505442f 3288 t += UTF8SKIP(t);
a0d0e21e 3289 }
3280af22 3290 while (t < PL_bufend && isSPACE(*t))
a0d0e21e 3291 t++;
b8a4b1be
GS
3292 /* if comma follows first term, call it an anon hash */
3293 /* XXX it could be a comma expression with loop modifiers */
3280af22 3294 if (t < PL_bufend && ((*t == ',' && (*s == 'q' || !isLOWER(*s)))
b8a4b1be 3295 || (*t == '=' && t[1] == '>')))
a0d0e21e 3296 OPERATOR(HASHBRACK);
3280af22 3297 if (PL_expect == XREF)
4e4e412b 3298 PL_expect = XTERM;
a0d0e21e 3299 else {
3280af22
NIS
3300 PL_lex_brackstack[PL_lex_brackets-1] = XSTATE;
3301 PL_expect = XSTATE;
a0d0e21e 3302 }
8990e307 3303 }
a0d0e21e 3304 break;
463ee0b2 3305 }
57843af0 3306 yylval.ival = CopLINE(PL_curcop);
79072805 3307 if (isSPACE(*s) || *s == '#')
3280af22 3308 PL_copline = NOLINE; /* invalidate current command line number */
79072805 3309 TOKEN('{');
378cc40b 3310 case '}':
79072805
LW
3311 rightbracket:
3312 s++;
3280af22 3313 if (PL_lex_brackets <= 0)
d98d5fff 3314 yyerror("Unmatched right curly bracket");
463ee0b2 3315 else
3280af22 3316 PL_expect = (expectation)PL_lex_brackstack[--PL_lex_brackets];
c2e66d9e 3317 if (PL_lex_brackets < PL_lex_formbrack && PL_lex_state != LEX_INTERPNORMAL)
3280af22
NIS
3318 PL_lex_formbrack = 0;
3319 if (PL_lex_state == LEX_INTERPNORMAL) {
3320 if (PL_lex_brackets == 0) {
9059aa12
LW
3321 if (PL_expect & XFAKEBRACK) {
3322 PL_expect &= XENUMMASK;
3280af22
NIS
3323 PL_lex_state = LEX_INTERPEND;
3324 PL_bufptr = s;
cea2e8a9 3325 return yylex(); /* ignore fake brackets */
79072805 3326 }
fa83b5b6 3327 if (*s == '-' && s[1] == '>')
3280af22 3328 PL_lex_state = LEX_INTERPENDMAYBE;
fa83b5b6 3329 else if (*s != '[' && *s != '{')
3280af22 3330 PL_lex_state = LEX_INTERPEND;
79072805
LW
3331 }
3332 }
9059aa12
LW
3333 if (PL_expect & XFAKEBRACK) {
3334 PL_expect &= XENUMMASK;
3280af22 3335 PL_bufptr = s;
cea2e8a9 3336 return yylex(); /* ignore fake brackets */
748a9306 3337 }
79072805
LW
3338 force_next('}');
3339 TOKEN(';');
378cc40b
LW
3340 case '&':
3341 s++;
3342 tmp = *s++;
3343 if (tmp == '&')
a0d0e21e 3344 AOPERATOR(ANDAND);
378cc40b 3345 s--;
3280af22 3346 if (PL_expect == XOPERATOR) {
7e2040f0
GS
3347 if (ckWARN(WARN_SEMICOLON)
3348 && isIDFIRST_lazy_if(s,UTF) && PL_bufptr == PL_linestart)
3349 {
57843af0 3350 CopLINE_dec(PL_curcop);
cea2e8a9 3351 Perl_warner(aTHX_ WARN_SEMICOLON, PL_warn_nosemi);
57843af0 3352 CopLINE_inc(PL_curcop);
463ee0b2 3353 }
79072805 3354 BAop(OP_BIT_AND);
463ee0b2 3355 }
79072805 3356
3280af22
NIS
3357 s = scan_ident(s - 1, PL_bufend, PL_tokenbuf, sizeof PL_tokenbuf, TRUE);
3358 if (*PL_tokenbuf) {
3359 PL_expect = XOPERATOR;
3360 force_ident(PL_tokenbuf, '&');
463ee0b2 3361 }
79072805
LW
3362 else
3363 PREREF('&');
c07a80fd 3364 yylval.ival = (OPpENTERSUB_AMPER<<8);
79072805
LW
3365 TERM('&');
3366
378cc40b
LW
3367 case '|':
3368 s++;
3369 tmp = *s++;
3370 if (tmp == '|')
a0d0e21e 3371 AOPERATOR(OROR);
378cc40b 3372 s--;
79072805 3373 BOop(OP_BIT_OR);
378cc40b
LW
3374 case '=':
3375 s++;
3376 tmp = *s++;
3377 if (tmp == '=')
79072805
LW
3378 Eop(OP_EQ);
3379 if (tmp == '>')
3380 OPERATOR(',');
378cc40b 3381 if (tmp == '~')
79072805 3382 PMop(OP_MATCH);
599cee73 3383 if (ckWARN(WARN_SYNTAX) && tmp && isSPACE(*s) && strchr("+-*/%.^&|<",tmp))
cea2e8a9 3384 Perl_warner(aTHX_ WARN_SYNTAX, "Reversed %c= operator",(int)tmp);
378cc40b 3385 s--;
3280af22
NIS
3386 if (PL_expect == XSTATE && isALPHA(tmp) &&
3387 (s == PL_linestart+1 || s[-2] == '\n') )
748a9306 3388 {
3280af22
NIS
3389 if (PL_in_eval && !PL_rsfp) {
3390 d = PL_bufend;
a5f75d66
AD
3391 while (s < d) {
3392 if (*s++ == '\n') {
3393 incline(s);
3394 if (strnEQ(s,"=cut",4)) {
3395 s = strchr(s,'\n');
3396 if (s)
3397 s++;
3398 else
3399 s = d;
3400 incline(s);
3401 goto retry;
3402 }
3403 }
3404 }
3405 goto retry;
3406 }
3280af22
NIS
3407 s = PL_bufend;
3408 PL_doextract = TRUE;
a0d0e21e
LW
3409 goto retry;
3410 }
3280af22 3411 if (PL_lex_brackets < PL_lex_formbrack) {
a0d0e21e 3412 char *t;
51882d45 3413#ifdef PERL_STRICT_CR
bf4acbe4 3414 for (t = s; SPACE_OR_TAB(*t); t++) ;
51882d45 3415#else
bf4acbe4 3416 for (t = s; SPACE_OR_TAB(*t) || *t == '\r'; t++) ;
51882d45 3417#endif
a0d0e21e
LW
3418 if (*t == '\n' || *t == '#') {
3419 s--;
3280af22 3420 PL_expect = XBLOCK;
a0d0e21e
LW
3421 goto leftbracket;
3422 }
79072805 3423 }
a0d0e21e
LW
3424 yylval.ival = 0;
3425 OPERATOR(ASSIGNOP);
378cc40b
LW
3426 case '!':
3427 s++;
3428 tmp = *s++;
3429 if (tmp == '=')
79072805 3430 Eop(OP_NE);
378cc40b 3431 if (tmp == '~')
79072805 3432 PMop(OP_NOT);
378cc40b
LW
3433 s--;
3434 OPERATOR('!');
3435 case '<':
3280af22 3436 if (PL_expect != XOPERATOR) {
93a17b20 3437 if (s[1] != '<' && !strchr(s,'>'))
2f3197b3 3438 check_uni();
79072805
LW
3439 if (s[1] == '<')
3440 s = scan_heredoc(s);
3441 else
3442 s = scan_inputsymbol(s);
3443 TERM(sublex_start());
378cc40b
LW
3444 }
3445 s++;
3446 tmp = *s++;
3447 if (tmp == '<')
79072805 3448 SHop(OP_LEFT_SHIFT);
395c3793
LW
3449 if (tmp == '=') {
3450 tmp = *s++;
3451 if (tmp == '>')
79072805 3452 Eop(OP_NCMP);
395c3793 3453 s--;
79072805 3454 Rop(OP_LE);
395c3793 3455 }
378cc40b 3456 s--;
79072805 3457 Rop(OP_LT);
378cc40b
LW
3458 case '>':
3459 s++;
3460 tmp = *s++;
3461 if (tmp == '>')
79072805 3462 SHop(OP_RIGHT_SHIFT);
378cc40b 3463 if (tmp == '=')
79072805 3464 Rop(OP_GE);
378cc40b 3465 s--;
79072805 3466 Rop(OP_GT);
378cc40b
LW
3467
3468 case '$':
bbce6d69
PP
3469 CLINE;
3470
3280af22
NIS
3471 if (PL_expect == XOPERATOR) {
3472 if (PL_lex_formbrack && PL_lex_brackets == PL_lex_formbrack) {
3473 PL_expect = XTERM;
a0d0e21e 3474 depcom();
bbce6d69 3475 return ','; /* grandfather non-comma-format format */
a0d0e21e 3476 }
8990e307 3477 }
a0d0e21e 3478
7e2040f0 3479 if (s[1] == '#' && (isIDFIRST_lazy_if(s+2,UTF) || strchr("{$:+-", s[2]))) {
3280af22 3480 PL_tokenbuf[0] = '@';
376b8730
SM
3481 s = scan_ident(s + 1, PL_bufend, PL_tokenbuf + 1,
3482 sizeof PL_tokenbuf - 1, FALSE);
3483 if (PL_expect == XOPERATOR)
3484 no_op("Array length", s);
3280af22 3485 if (!PL_tokenbuf[1])
a0d0e21e 3486 PREREF(DOLSHARP);
3280af22
NIS
3487 PL_expect = XOPERATOR;
3488 PL_pending_ident = '#';
463ee0b2 3489 TOKEN(DOLSHARP);
79072805 3490 }
bbce6d69 3491
3280af22 3492 PL_tokenbuf[0] = '$';
376b8730
SM
3493 s = scan_ident(s, PL_bufend, PL_tokenbuf + 1,
3494 sizeof PL_tokenbuf - 1, FALSE);
3495 if (PL_expect == XOPERATOR)
3496 no_op("Scalar", s);
3280af22
NIS
3497 if (!PL_tokenbuf[1]) {
3498 if (s == PL_bufend)
bbce6d69
PP
3499 yyerror("Final $ should be \\$ or $name");
3500 PREREF('$');
8990e307 3501 }
a0d0e21e 3502
bbce6d69 3503 /* This kludge not intended to be bulletproof. */
3280af22 3504 if (PL_tokenbuf[1] == '[' && !PL_tokenbuf[2]) {
bbce6d69 3505 yylval.opval = newSVOP(OP_CONST, 0,
b448e4fe 3506 newSViv(PL_compiling.cop_arybase));
bbce6d69
PP
3507 yylval.opval->op_private = OPpCONST_ARYBASE;
3508 TERM(THING);
3509 }
3510
ff68c719 3511 d = s;
69d2bceb 3512 tmp = (I32)*s;
3280af22 3513 if (PL_lex_state == LEX_NORMAL)
ff68c719
PP
3514 s = skipspace(s);
3515
3280af22 3516 if ((PL_expect != XREF || PL_oldoldbufptr == PL_last_lop) && intuit_more(s)) {
bbce6d69
PP
3517 char *t;
3518 if (*s == '[') {
3280af22 3519 PL_tokenbuf[0] = '@';
599cee73 3520 if (ckWARN(WARN_SYNTAX)) {
bbce6d69 3521 for(t = s + 1;
7e2040f0 3522 isSPACE(*t) || isALNUM_lazy_if(t,UTF) || *t == '$';
bbce6d69 3523 t++) ;
a0d0e21e 3524 if (*t++ == ',') {
3280af22
NIS
3525 PL_bufptr = skipspace(PL_bufptr);
3526 while (t < PL_bufend && *t != ']')
bbce6d69 3527 t++;
cea2e8a9 3528 Perl_warner(aTHX_ WARN_SYNTAX,
599cee73
PM
3529 "Multidimensional syntax %.*s not supported",
3530 (t - PL_bufptr) + 1, PL_bufptr);
a0d0e21e
LW
3531 }
3532 }
bbce6d69
PP
3533 }
3534 else if (*s == '{') {
3280af22 3535 PL_tokenbuf[0] = '%';
599cee73 3536 if (ckWARN(WARN_SYNTAX) && strEQ(PL_tokenbuf+1, "SIG") &&
bbce6d69
PP
3537 (t = strchr(s, '}')) && (t = strchr(t, '=')))
3538 {
3280af22 3539 char tmpbuf[sizeof PL_tokenbuf];
a0d0e21e
LW
3540 STRLEN len;
3541 for (t++; isSPACE(*t); t++) ;
7e2040f0 3542 if (isIDFIRST_lazy_if(t,UTF)) {
8903cb82 3543 t = scan_word(t, tmpbuf, sizeof tmpbuf, TRUE, &len);
59a6d928 3544 for (; isSPACE(*t); t++) ;
864dbfa3 3545 if (*t == ';' && get_cv(tmpbuf, FALSE))
cea2e8a9 3546 Perl_warner(aTHX_ WARN_SYNTAX,
599cee73 3547 "You need to quote \"%s\"", tmpbuf);
748