1 /* stolen_chunk_of_toke.c - from perl 5.8.8 toke.c
3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "It all comes from here, the stench and the peril." --Frodo
16 * this is all blatantly stolen. I sincerely hopes it doesn't fuck anything
17 * up but if it does blame me (Matt S Trout), not the poor original authors
22 /* the following #defines are stolen from assorted headers, not toke.c (mst) */
24 #define skipspace(a) S_skipspace(aTHX_ a, 0)
25 #define peekspace(a) S_skipspace(aTHX_ a, 1)
26 #define skipspace_force(a) S_skipspace(aTHX_ a, 2)
27 #define incline(a) S_incline(aTHX_ a)
28 #define filter_gets(a,b,c) S_filter_gets(aTHX_ a,b,c)
29 #define scan_str(a,b,c) S_scan_str(aTHX_ a,b,c)
30 #define scan_word(a,b,c,d,e) S_scan_word(aTHX_ a,b,c,d,e)
31 #define scan_ident(a,b,c,d,e) S_scan_ident(aTHX_ a,b,c,d,e)
33 STATIC void S_incline(pTHX_ char *s);
34 STATIC char* S_skipspace(pTHX_ char *s, int incline);
35 STATIC char * S_filter_gets(pTHX_ SV *sv, PerlIO *fp, STRLEN append);
36 STATIC char* S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims);
37 STATIC char* S_scan_word(pTHX_ char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp);
39 #define DPTR2FPTR(t,p) ((t)PTR2nat(p)) /* data pointer to function pointer */
40 #define FPTR2DPTR(t,p) ((t)PTR2nat(p)) /* function pointer to data pointer */
41 #define PTR2nat(p) (PTRV)(p) /* pointer to integer of PTRSIZE */
43 /* conditionalise these two because as of 5.9.5 we already get them from
46 #define Newx(v,n,t) (v = (MEM_WRAP_CHECK_(n,t) (t*)safemalloc((MEM_SIZE)((n)*sizeof(t)))))
49 #define SvPVX_const(sv) ((const char*) (0 + SvPVX(sv)))
51 #ifndef MEM_WRAP_CHECK_
52 #define MEM_WRAP_CHECK_(n,t) MEM_WRAP_CHECK(n,t),
55 #define SvPV_renew(sv,n) \
56 STMT_START { SvLEN_set(sv, n); \
57 SvPV_set((sv), (MEM_WRAP_CHECK_(n,char) \
58 (char*)saferealloc((Malloc_t)SvPVX(sv), \
62 #define isCONTROLVAR(x) (isUPPER(x) || strchr("[\\]^_?", (x)))
64 /* On MacOS, respect nonbreaking spaces */
65 #ifdef MACOS_TRADITIONAL
66 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\312'||(c)=='\t')
68 #define SPACE_OR_TAB(c) ((c)==' '||(c)=='\t')
72 * Normally, during compile time, PL_curcop == &PL_compiling is true. However,
73 * Devel::Declare makes the interpreter call back to perl during compile time,
74 * which temporarily enters runtime. Then perl space calls various functions
75 * from this file, which are designed to work during compile time. They all
76 * happen to operate on PL_curcop, not PL_compiling. That doesn't make a
77 * difference in the core, but it does for Devel::Declare, which operates at
78 * runtime, but still wants to mangle the things that are about to be compiled.
79 * That's why we define our own PL_curcop and make it point to PL_compiling
83 #define PL_curcop (&PL_compiling)
85 #define CLINE (PL_copline = (CopLINE(PL_curcop) < PL_copline ? CopLINE(PL_curcop) : PL_copline))
87 #define LEX_NORMAL 10 /* normal code (ie not within "...") */
88 #define LEX_INTERPNORMAL 9 /* code within a string, eg "$foo[$x+1]" */
89 #define LEX_INTERPCASEMOD 8 /* expecting a \U, \Q or \E etc */
90 #define LEX_INTERPPUSH 7 /* starting a new sublex parse level */
91 #define LEX_INTERPSTART 6 /* expecting the start of a $var */
93 /* at end of code, eg "$x" followed by: */
94 #define LEX_INTERPEND 5 /* ... eg not one of [, { or -> */
95 #define LEX_INTERPENDMAYBE 4 /* ... eg one of [, { or -> */
97 #define LEX_INTERPCONCAT 3 /* expecting anything, eg at start of
98 string or after \E, $foo, etc */
99 #define LEX_INTERPCONST 2 /* NOT USED */
100 #define LEX_FORMLINE 1 /* expecting a format line */
101 #define LEX_KNOWNEXT 0 /* next token known; just return it */
103 /* and these two are my own madness (mst) */
105 #if PERL_REVISION == 5 && PERL_VERSION == 8 && PERL_SUBVERSION >= 8
106 #define PERL_5_8_8_PLUS
109 #if PERL_REVISION == 5 && PERL_VERSION > 8
110 #define PERL_5_9_PLUS
113 #if !defined(PERL_5_9_PLUS) && defined(PERL_IMPLICIT_CONTEXT)
114 /* These two are not exported from the core on Windows. With 5.9+
115 it's not an issue, because they're part of the PL_parser structure,
116 which is exported. On multiplicity/thread builds we can work
117 around the lack of export by this formulation, where we provide
118 a substitute implementation of the unexported accessor functions.
119 On single-interpreter builds we can't, because access is directly
120 via symbols that are not exported. */
121 # define Perl_Ilinestart_ptr my_Ilinestart_ptr
122 char **my_Ilinestart_ptr(pTHX) { return &(aTHX->Ilinestart); }
123 # define Perl_Isublex_info_ptr my_Isublex_info_ptr
124 static SUBLEXINFO *my_Isublex_info_ptr(pTHX) { return &(aTHX->Isublex_info); }
128 /* 5.9+ moves a bunch of things to a PL_parser struct so we need to
129 declare the backcompat macros for things to still work (mst) */
131 /* XXX temporary backwards compatibility */
132 #define PL_lex_brackets (PL_parser->lex_brackets)
133 #define PL_lex_brackstack (PL_parser->lex_brackstack)
134 #define PL_lex_casemods (PL_parser->lex_casemods)
135 #define PL_lex_casestack (PL_parser->lex_casestack)
136 #define PL_lex_defer (PL_parser->lex_defer)
137 #define PL_lex_dojoin (PL_parser->lex_dojoin)
138 #define PL_lex_expect (PL_parser->lex_expect)
139 #define PL_lex_formbrack (PL_parser->lex_formbrack)
140 #define PL_lex_inpat (PL_parser->lex_inpat)
141 #define PL_lex_inwhat (PL_parser->lex_inwhat)
142 #define PL_lex_op (PL_parser->lex_op)
143 #define PL_lex_repl (PL_parser->lex_repl)
144 #define PL_lex_starts (PL_parser->lex_starts)
145 #define PL_lex_stuff (PL_parser->lex_stuff)
146 #define PL_multi_start (PL_parser->multi_start)
147 #define PL_multi_open (PL_parser->multi_open)
148 #define PL_multi_close (PL_parser->multi_close)
149 #define PL_pending_ident (PL_parser->pending_ident)
150 #define PL_preambled (PL_parser->preambled)
151 #define PL_sublex_info (PL_parser->sublex_info)
152 #define PL_linestr (PL_parser->linestr)
153 #define PL_sublex_info (PL_parser->sublex_info)
154 #define PL_linestr (PL_parser->linestr)
155 #define PL_expect (PL_parser->expect)
156 #define PL_copline (PL_parser->copline)
157 #define PL_bufptr (PL_parser->bufptr)
158 #define PL_oldbufptr (PL_parser->oldbufptr)
159 #define PL_oldoldbufptr (PL_parser->oldoldbufptr)
160 #define PL_linestart (PL_parser->linestart)
161 #define PL_bufend (PL_parser->bufend)
162 #define PL_last_uni (PL_parser->last_uni)
163 #define PL_last_lop (PL_parser->last_lop)
164 #define PL_last_lop_op (PL_parser->last_lop_op)
165 #define PL_lex_state (PL_parser->lex_state)
166 #define PL_rsfp (PL_parser->rsfp)
167 #define PL_rsfp_filters (PL_parser->rsfp_filters)
168 #define PL_in_my (PL_parser->in_my)
169 #define PL_in_my_stash (PL_parser->in_my_stash)
170 #define PL_tokenbuf (PL_parser->tokenbuf)
171 #define PL_multi_end (PL_parser->multi_end)
172 #define PL_error_count (PL_parser->error_count)
173 #define PL_nexttoke (PL_parser->nexttoke)
174 /* these are from the non-PERL_MAD path but I don't -think- I need
175 the PERL_MAD stuff since my code isn't really populating things (mst) */
177 # define PL_curforce (PL_parser->curforce)
178 # define PL_lasttoke (PL_parser->lasttoke)
180 # define PL_nexttype (PL_parser->nexttype)
181 # define PL_nextval (PL_parser->nextval)
183 /* end of backcompat macros from 5.9 toke.c (mst) */
186 /* when ccflags include -DDEBUGGING we need this for earlier 5.8 perls */
187 #ifndef SvPV_nolen_const
188 #define SvPV_nolen_const SvPV_nolen
191 /* utf8_to_uvchr_buf() not defined in earlier perls, but less-capable
192 * substitute is available */
194 #ifndef utf8_to_uvchr_buf
195 #define utf8_to_uvchr_buf(s, e, lp) ((e), utf8_to_uvchr(s, lp))
198 #ifndef isIDFIRST_lazy_if_safe
199 # define isIDFIRST_lazy_if_safe(p,e,UTF) \
200 ((! UTF || p > e) ? isIDFIRST_lazy_if(p,UTF) : 0)
202 #ifndef isALNUM_lazy_if_safe
203 # define isALNUM_lazy_if_safe(p,e,UTF) \
204 ((! UTF || p > e) ? isALNUM_lazy_if(p,UTF) : 0)
206 #ifndef isALNUM_utf8_safe
207 # define isALNUM_utf8_safe(p,e) ((p > e) ? isALNUM_utf8(p) : 0)
210 /* and now we're back to the toke.c stuff again (mst) */
212 static const char ident_too_long[] =
213 "Identifier too long";
214 static const char c_without_g[] =
215 "Use of /c modifier is meaningless without /g";
216 static const char c_in_subst[] =
217 "Use of /c modifier is meaningless in s///";
219 #ifdef USE_UTF8_SCRIPTS
220 # define UTF (!IN_BYTES)
222 # define UTF ((PL_linestr && DO_UTF8(PL_linestr)) || (PL_hints & HINT_UTF8))
225 /* Invoke the idxth filter function for the current rsfp. */
226 /* maxlen 0 = read one text line */
228 Perl_filter_read(pTHX_ int idx, SV *buf_sv, int maxlen)
233 if (!PL_rsfp_filters)
235 if (idx > AvFILLp(PL_rsfp_filters)) { /* Any more filters? */
236 /* Provide a default input filter to make life easy. */
237 /* Note that we append to the line. This is handy. */
238 DEBUG_P(PerlIO_printf(Perl_debug_log,
239 "filter_read %d: from rsfp\n", idx));
243 const int old_len = SvCUR(buf_sv);
245 /* ensure buf_sv is large enough */
246 SvGROW(buf_sv, (STRLEN)(old_len + maxlen)) ;
247 if ((len = PerlIO_read(PL_rsfp, SvPVX(buf_sv) + old_len, maxlen)) <= 0){
248 if (PerlIO_error(PL_rsfp))
249 return -1; /* error */
251 return 0 ; /* end of file */
253 SvCUR_set(buf_sv, old_len + len) ;
256 if (sv_gets(buf_sv, PL_rsfp, SvCUR(buf_sv)) == NULL) {
257 if (PerlIO_error(PL_rsfp))
258 return -1; /* error */
260 return 0 ; /* end of file */
263 return SvCUR(buf_sv);
265 /* Skip this filter slot if filter has been deleted */
266 if ( (datasv = FILTER_DATA(idx)) == &PL_sv_undef) {
267 DEBUG_P(PerlIO_printf(Perl_debug_log,
268 "filter_read %d: skipped (filter deleted)\n",
270 return FILTER_READ(idx+1, buf_sv, maxlen); /* recurse */
272 /* Get function pointer hidden within datasv */
273 funcp = DPTR2FPTR(filter_t, IoANY(datasv));
274 DEBUG_P(PerlIO_printf(Perl_debug_log,
275 "filter_read %d: via function %p (%s)\n",
276 idx, datasv, SvPV_nolen_const(datasv)));
277 /* Call function. The function is expected to */
278 /* call "FILTER_READ(idx+1, buf_sv)" first. */
279 /* Return: <0:error, =0:eof, >0:not eof */
280 return (*funcp)(aTHX_ idx, buf_sv, maxlen);
284 S_filter_gets(pTHX_ register SV *sv, register PerlIO *fp, STRLEN append)
286 #ifdef PERL_CR_FILTER
287 if (!PL_rsfp_filters) {
288 filter_add(S_cr_textfilter,NULL);
291 if (PL_rsfp_filters) {
293 SvCUR_set(sv, 0); /* start with empty line */
294 if (FILTER_READ(0, sv, 0) > 0)
295 return ( SvPVX(sv) ) ;
300 return (sv_gets(sv, fp, append));
305 * Called to gobble the appropriate amount and type of whitespace.
306 * Skips comments as well.
310 S_skipspace(pTHX_ register char *s, int incline)
312 if (PL_lex_formbrack && PL_lex_brackets <= PL_lex_formbrack) {
313 while (s < PL_bufend && SPACE_OR_TAB(*s))
319 SSize_t oldprevlen, oldoldprevlen;
320 SSize_t oldloplen = 0, oldunilen = 0;
321 while (s < PL_bufend && isSPACE(*s)) {
322 if (*s++ == '\n' && ((incline == 2) || (PL_in_eval && !PL_rsfp && !incline)))
327 if (s < PL_bufend && *s == '#') {
328 while (s < PL_bufend && *s != '\n')
332 if (PL_in_eval && !PL_rsfp && !incline) {
339 /* also skip leading whitespace on the beginning of a line before deciding
340 * whether or not to recharge the linestr. --rafl
342 while (s < PL_bufend && isSPACE(*s)) {
343 if (*s++ == '\n' && PL_in_eval && !PL_rsfp && !incline)
347 /* only continue to recharge the buffer if we're at the end
348 * of the buffer, we're not reading from a source filter, and
349 * we're in normal lexing mode
351 if (s < PL_bufend || !PL_rsfp || PL_lex_inwhat ||
352 PL_lex_state == LEX_FORMLINE)
355 /* try to recharge the buffer */
356 if ((s = filter_gets(PL_linestr, PL_rsfp,
357 (prevlen = SvCUR(PL_linestr)))) == Nullch)
359 /* end of file. Add on the -p or -n magic */
362 ";}continue{print or die qq(-p destination: $!\\n);}");
363 PL_minus_n = PL_minus_p = 0;
365 else if (PL_minus_n) {
366 sv_setpvn(PL_linestr, ";}", 2);
370 sv_setpvn(PL_linestr,";", 1);
372 /* reset variables for next time we lex */
373 PL_oldoldbufptr = PL_oldbufptr = PL_bufptr = s = PL_linestart
375 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
376 PL_last_lop = PL_last_uni = Nullch;
378 /* In perl versions previous to p4-rawid: //depot/perl@32954 -P
379 * preprocessors were supported here. We don't support -P at all, even
380 * on perls that support it, and use the following chunk from blead
384 /* Close the filehandle. Could be from
385 * STDIN, or a regular file. If we were reading code from
386 * STDIN (because the commandline held no -e or filename)
387 * then we don't close it, we reset it so the code can
388 * read from STDIN too.
391 if ((PerlIO*)PL_rsfp == PerlIO_stdin())
392 PerlIO_clearerr(PL_rsfp);
394 (void)PerlIO_close(PL_rsfp);
399 /* not at end of file, so we only read another line */
400 /* make corresponding updates to old pointers, for yyerror() */
401 oldprevlen = PL_oldbufptr - PL_bufend;
402 oldoldprevlen = PL_oldoldbufptr - PL_bufend;
404 oldunilen = PL_last_uni - PL_bufend;
406 oldloplen = PL_last_lop - PL_bufend;
407 PL_linestart = PL_bufptr = s + prevlen;
408 PL_bufend = s + SvCUR(PL_linestr);
410 PL_oldbufptr = s + oldprevlen;
411 PL_oldoldbufptr = s + oldoldprevlen;
413 PL_last_uni = s + oldunilen;
415 PL_last_lop = s + oldloplen;
419 /* debugger active and we're not compiling the debugger code,
420 * so store the line into the debugger's array of lines
422 if (PERLDB_LINE && PL_curstash != PL_debstash) {
423 AV *fileav = CopFILEAV(PL_curcop);
425 SV * const sv = NEWSV(85,0);
426 sv_upgrade(sv, SVt_PVMG);
427 sv_setpvn(sv,PL_bufptr,PL_bufend-PL_bufptr);
430 av_store(fileav,(I32)CopLINE(PL_curcop),sv);
437 S_scan_word(pTHX_ register char *s, char *dest, STRLEN destlen, int allow_package, STRLEN *slp)
439 register char *d = dest;
440 register char * const e = d + destlen - 3; /* two-character token, ending NUL */
443 Perl_croak(aTHX_ ident_too_long);
444 if (UTF && isIDFIRST_utf8_safe((const U8*) s, (const U8*) PL_bufend)) {
445 /* The UTF-8 case must come first, otherwise things
446 * like c\N{COMBINING TILDE} would start failing, as the
447 * isALNUM case below would gobble the 'c' up.
450 char *t = s + UTF8SKIP(s);
451 while (isIDCONT_utf8_safe((const U8*) t, (const U8*) PL_bufend)) {
455 Perl_croak(aTHX_ "%s", ident_too_long);
456 Copy(s, d, t - s, char);
460 else if (isALNUM(*s))
463 } while (isWORDCHAR_A(*s) && d < e);
466 && isIDFIRST_lazy_if_safe(s+1, PL_bufend, UTF))
472 else if (*s == ':' && s[1] == ':' && allow_package && s[2] != '$') {
486 * This subroutine has nothing to do with tilting, whether at windmills
487 * or pinball tables. Its name is short for "increment line". It
488 * increments the current line number in CopLINE(PL_curcop) and checks
489 * to see whether the line starts with a comment of the form
490 * # line 500 "foo.pm"
491 * If so, it sets the current line number and file to the values in the comment.
495 S_incline(pTHX_ char *s)
502 CopLINE_inc(PL_curcop);
505 while (SPACE_OR_TAB(*s)) s++;
506 if (strnEQ(s, "line", 4))
510 if (SPACE_OR_TAB(*s))
514 while (SPACE_OR_TAB(*s)) s++;
520 while (SPACE_OR_TAB(*s))
522 if (*s == '"' && (t = strchr(s+1, '"'))) {
527 for (t = s; !isSPACE(*t); t++) ;
530 while (SPACE_OR_TAB(*e) || *e == '\r' || *e == '\f')
532 if (*e != '\n' && *e != '\0')
533 return; /* false alarm */
538 /* this chunk was added to S_incline during 5.8.8. I don't know why but I don't
539 honestly care since I probably want to be bug-compatible anyway (mst) */
541 /* ... my kingdom for a perl parser in perl ... (mst) */
543 #ifdef PERL_5_8_8_PLUS
545 const char *cf = CopFILE(PL_curcop);
546 if (cf && strlen(cf) > 7 && strnEQ(cf, "(eval ", 6)) {
547 /* must copy *{"::_<(eval N)[oldfilename:L]"}
548 * to *{"::_<newfilename"} */
549 char smallbuf[256], smallbuf2[256];
550 char *tmpbuf, *tmpbuf2;
552 STRLEN tmplen = strlen(cf);
553 STRLEN tmplen2 = strlen(s);
554 if (tmplen + 3 < sizeof smallbuf)
557 Newx(tmpbuf, tmplen + 3, char);
558 if (tmplen2 + 3 < sizeof smallbuf2)
561 Newx(tmpbuf2, tmplen2 + 3, char);
562 tmpbuf[0] = tmpbuf2[0] = '_';
563 tmpbuf[1] = tmpbuf2[1] = '<';
564 memcpy(tmpbuf + 2, cf, ++tmplen);
565 memcpy(tmpbuf2 + 2, s, ++tmplen2);
567 gvp = (GV**)hv_fetch(PL_defstash, tmpbuf, tmplen, FALSE);
569 gv2 = *(GV**)hv_fetch(PL_defstash, tmpbuf2, tmplen2, TRUE);
571 gv_init(gv2, PL_defstash, tmpbuf2, tmplen2, FALSE);
572 /* adjust ${"::_<newfilename"} to store the new file name */
573 GvSV(gv2) = newSVpvn(tmpbuf2 + 2, tmplen2 - 2);
574 GvHV(gv2) = (HV*)SvREFCNT_inc(GvHV(*gvp));
575 GvAV(gv2) = (AV*)SvREFCNT_inc(GvAV(*gvp));
577 if (tmpbuf != smallbuf) Safefree(tmpbuf);
578 if (tmpbuf2 != smallbuf2) Safefree(tmpbuf2);
582 /* second endif closes out the "are we 5.8.(8+)" conditional */
583 CopFILE_free(PL_curcop);
584 CopFILE_set(PL_curcop, s);
587 CopLINE_set(PL_curcop, atoi(n)-1);
591 takes: start position in buffer
592 keep_quoted preserve \ on the embedded delimiter(s)
593 keep_delims preserve the delimiters around the string
594 returns: position to continue reading from buffer
595 side-effects: multi_start, multi_close, lex_repl or lex_stuff, and
596 updates the read buffer.
598 This subroutine pulls a string out of the input. It is called for:
599 q single quotes q(literal text)
600 ' single quotes 'literal text'
601 qq double quotes qq(interpolate $here please)
602 " double quotes "interpolate $here please"
603 qx backticks qx(/bin/ls -l)
604 ` backticks `/bin/ls -l`
605 qw quote words @EXPORT_OK = qw( func() $spam )
606 m// regexp match m/this/
607 s/// regexp substitute s/this/that/
608 tr/// string transliterate tr/this/that/
609 y/// string transliterate y/this/that/
610 ($*@) sub prototypes sub foo ($)
611 (stuff) sub attr parameters sub foo : attr(stuff)
612 <> readline or globs <FOO>, <>, <$fh>, or <*.c>
614 In most of these cases (all but <>, patterns and transliterate)
615 yylex() calls scan_str(). m// makes yylex() call scan_pat() which
616 calls scan_str(). s/// makes yylex() call scan_subst() which calls
617 scan_str(). tr/// and y/// make yylex() call scan_trans() which
620 It skips whitespace before the string starts, and treats the first
621 character as the delimiter. If the delimiter is one of ([{< then
622 the corresponding "close" character )]}> is used as the closing
623 delimiter. It allows quoting of delimiters, and if the string has
624 balanced delimiters ([{<>}]) it allows nesting.
626 On success, the SV with the resulting string is put into lex_stuff or,
627 if that is already non-NULL, into lex_repl. The second case occurs only
628 when parsing the RHS of the special constructs s/// and tr/// (y///).
629 For convenience, the terminating delimiter character is stuffed into
634 S_scan_str(pTHX_ char *start, int keep_quoted, int keep_delims)
636 SV *sv; /* scalar value: string */
637 char *tmps; /* temp string, used for delimiter matching */
638 register char *s = start; /* current position in the buffer */
639 register char term; /* terminating character */
640 register char *to; /* current position in the sv's data */
641 I32 brackets = 1; /* bracket nesting level */
642 bool has_utf8 = FALSE; /* is there any utf8 content? */
643 I32 termcode; /* terminating char. code */
644 /* 5.8.7+ uses UTF8_MAXBYTES but also its utf8.h defs _MAXLEN to it so
645 I'm reasonably hopeful this won't destroy anything (mst) */
646 U8 termstr[UTF8_MAXLEN]; /* terminating string */
647 STRLEN termlen; /* length of terminating string */
648 char *last = NULL; /* last position for nesting bracket */
650 /* skip space before the delimiter */
654 /* mark where we are, in case we need to report errors */
657 /* after skipping whitespace, the next character is the terminator */
660 termcode = termstr[0] = term;
664 termcode = utf8_to_uvchr_buf((U8*)s, PL_bufend, &termlen);
665 Copy(s, termstr, termlen, U8);
666 if (!UTF8_IS_INVARIANT(term))
670 /* mark where we are */
671 PL_multi_start = CopLINE(PL_curcop);
672 PL_multi_open = term;
674 /* find corresponding closing delimiter */
675 if (term && (tmps = strchr("([{< )]}> )]}>",term)))
676 termcode = termstr[0] = term = tmps[5];
678 PL_multi_close = term;
680 /* create a new SV to hold the contents. 87 is leak category, I'm
681 assuming. 79 is the SV's initial length. What a random number. */
683 sv_upgrade(sv, SVt_PVIV);
684 SvIV_set(sv, termcode);
685 (void)SvPOK_only(sv); /* validate pointer */
687 /* move past delimiter and try to read a complete string */
689 sv_catpvn(sv, s, termlen);
692 if (PL_encoding && !UTF) {
696 int offset = s - SvPVX_const(PL_linestr);
697 const bool found = sv_cat_decode(sv, PL_encoding, PL_linestr,
698 &offset, (char*)termstr, termlen);
699 const char *ns = SvPVX_const(PL_linestr) + offset;
700 char *svlast = SvEND(sv) - 1;
702 for (; s < ns; s++) {
703 if (*s == '\n' && !PL_rsfp)
704 CopLINE_inc(PL_curcop);
709 /* handle quoted delimiters */
710 if (SvCUR(sv) > 1 && *(svlast-1) == '\\') {
712 for (t = svlast-2; t >= SvPVX_const(sv) && *t == '\\';)
714 if ((svlast-1 - t) % 2) {
718 SvCUR_set(sv, SvCUR(sv) - 1);
723 if (PL_multi_open == PL_multi_close) {
731 for (t = w = last; t < svlast; w++, t++) {
732 /* At here, all closes are "was quoted" one,
733 so we don't check PL_multi_close. */
735 if (!keep_quoted && *(t+1) == PL_multi_open)
740 else if (*t == PL_multi_open)
748 SvCUR_set(sv, w - SvPVX_const(sv));
757 SvCUR_set(sv, SvCUR(sv) - 1);
763 /* extend sv if need be */
764 SvGROW(sv, SvCUR(sv) + (PL_bufend - s) + 1);
765 /* set 'to' to the next character in the sv's string */
766 to = SvPVX(sv)+SvCUR(sv);
768 /* if open delimiter is the close delimiter read unbridle */
769 if (PL_multi_open == PL_multi_close) {
770 for (; s < PL_bufend; s++,to++) {
771 /* embedded newlines increment the current line number */
772 if (*s == '\n' && !PL_rsfp)
773 CopLINE_inc(PL_curcop);
774 /* handle quoted delimiters */
775 if (*s == '\\' && s+1 < PL_bufend && term != '\\') {
776 if (!keep_quoted && s[1] == term)
778 /* any other quotes are simply copied straight through */
782 /* terminate when run out of buffer (the for() condition), or
783 have found the terminator */
784 else if (*s == term) {
787 if (s+termlen <= PL_bufend && memEQ(s, (char*)termstr, termlen))
790 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
796 /* if the terminator isn't the same as the start character (e.g.,
797 matched brackets), we have to allow more in the quoting, and
798 be prepared for nested brackets.
801 /* read until we run out of string, or we find the terminator */
802 for (; s < PL_bufend; s++,to++) {
803 /* embedded newlines increment the line count */
804 if (*s == '\n' && !PL_rsfp)
805 CopLINE_inc(PL_curcop);
806 /* backslashes can escape the open or closing characters */
807 if (*s == '\\' && s+1 < PL_bufend) {
809 ((s[1] == PL_multi_open) || (s[1] == PL_multi_close)))
814 /* allow nested opens and closes */
815 else if (*s == PL_multi_close && --brackets <= 0)
817 else if (*s == PL_multi_open)
819 else if (!has_utf8 && !UTF8_IS_INVARIANT((U8)*s) && UTF)
824 /* terminate the copied string and update the sv's end-of-string */
826 SvCUR_set(sv, to - SvPVX_const(sv));
829 * this next chunk reads more into the buffer if we're not done yet
833 break; /* handle case where we are done yet :-) */
835 #ifndef PERL_STRICT_CR
836 if (to - SvPVX_const(sv) >= 2) {
837 if ((to[-2] == '\r' && to[-1] == '\n') ||
838 (to[-2] == '\n' && to[-1] == '\r'))
842 SvCUR_set(sv, to - SvPVX_const(sv));
844 else if (to[-1] == '\r')
847 else if (to - SvPVX_const(sv) == 1 && to[-1] == '\r')
852 /* if we're out of file, or a read fails, bail and reset the current
853 line marker so we can report where the unterminated string began
856 !(PL_oldoldbufptr = PL_oldbufptr = s = PL_linestart = filter_gets(PL_linestr, PL_rsfp, 0))) {
858 CopLINE_set(PL_curcop, (line_t)PL_multi_start);
861 /* we read a line, so increment our line counter */
862 CopLINE_inc(PL_curcop);
864 /* update debugger info */
865 if (PERLDB_LINE && PL_curstash != PL_debstash) {
866 AV *fileav = CopFILEAV(PL_curcop);
868 SV *sv = NEWSV(88,0);
869 sv_upgrade(sv, SVt_PVMG);
870 sv_setsv(sv,PL_linestr);
873 av_store(fileav, (I32)CopLINE(PL_curcop), sv);
877 /* having changed the buffer, we must update PL_bufend */
878 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
879 PL_last_lop = PL_last_uni = Nullch;
882 /* at this point, we have successfully read the delimited string */
884 if (!PL_encoding || UTF) {
886 sv_catpvn(sv, s, termlen);
889 if (has_utf8 || PL_encoding)
892 PL_multi_end = CopLINE(PL_curcop);
894 /* if we allocated too much space, give some back */
895 if (SvCUR(sv) + 5 < SvLEN(sv)) {
896 SvLEN_set(sv, SvCUR(sv) + 1);
897 /* 5.8.8 uses SvPV_renew, no prior version actually has the damn thing (mst) */
898 #ifdef PERL_5_8_8_PLUS
899 SvPV_renew(sv, SvLEN(sv));
901 Renew(SvPVX(sv), SvLEN(sv), char);
905 /* decide whether this is the first or second quoted string we've read
916 #define XFAKEBRACK 128
919 S_scan_ident(pTHX_ register char *s, register const char *send, char *dest, STRLEN destlen, I32 ck_uni)
923 char *bracket = Nullch;
929 e = d + destlen - 3; /* two-character token, ending NUL */
931 while (isDIGIT(*s)) {
933 Perl_croak(aTHX_ ident_too_long);
940 Perl_croak(aTHX_ ident_too_long);
941 if (UTF && isIDFIRST_utf8_safe((const U8*) s, (const U8*) PL_bufend)) {
942 /* The UTF-8 case must come first, otherwise things
943 * like c\N{COMBINING TILDE} would start failing, as the
944 * isALNUM case below would gobble the 'c' up.
947 char *t = s + UTF8SKIP(s);
948 while (isIDCONT_utf8_safe((const U8*) t, (const U8*) PL_bufend)) {
952 Perl_croak(aTHX_ "%s", ident_too_long);
953 Copy(s, d, t - s, char);
957 else if (isALNUM(*s))
960 } while (isWORDCHAR_A(*s) && d < e);
961 else if (*s == '\'' && isIDFIRST_lazy_if_safe(s+1,send,UTF)) {
966 else if (*s == ':' && s[1] == ':') {
977 if (PL_lex_state != LEX_NORMAL)
978 PL_lex_state = LEX_INTERPENDMAYBE;
981 if (*s == '$' && s[1] &&
982 ( isALNUM_lazy_if_safe(s+1,send,UTF)
983 || s[1] == '$' || s[1] == '{' || strnEQ(s+1,"::",2)) )
991 /* we always call this with ck_uni == 0, so no need for check_uni() */
997 if (*d == '^' && *s && isCONTROLVAR(*s)) {
1002 if (isSPACE(s[-1])) {
1004 const char ch = *s++;
1005 if (!SPACE_OR_TAB(ch)) {
1011 if (isIDFIRST_lazy_if_safe(d,d+destlen,UTF)) {
1016 && isIDFIRST_utf8_safe(e, send))
1020 while (e < send && isIDFIRST_utf8_safe(e, send))
1023 Copy(s, d, e - s, char);
1028 while ((isALNUM(*s) || *s == ':') && d < e)
1031 Perl_croak(aTHX_ ident_too_long);
1034 while (s < send && SPACE_OR_TAB(*s)) s++;
1035 if ((*s == '[' || (*s == '{' && strNE(dest, "sub")))) {
1036 /* we don't want perl to guess what is meant. the keyword
1037 * parser decides that later. (rafl)
1040 if (ckWARN(WARN_AMBIGUOUS) && keyword(dest, d - dest)) {
1041 const char *brack = *s == '[' ? "[...]" : "{...}";
1042 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
1043 "Ambiguous use of %c{%s%s} resolved to %c%s%s",
1044 funny, dest, brack, funny, dest, brack);
1048 PL_lex_brackstack[PL_lex_brackets++] = (char)(XOPERATOR | XFAKEBRACK);
1052 /* Handle extended ${^Foo} variables
1053 * 1999-02-27 mjd-perl-patch@plover.com */
1054 else if (!isALNUM(*d) && !isPRINT(*d) /* isCTRL(d) */
1058 while (isALNUM(*s) && d < e) {
1062 Perl_croak(aTHX_ ident_too_long);
1067 if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets) {
1068 PL_lex_state = LEX_INTERPEND;
1073 /* we don't want perl to guess what is meant. the keyword
1074 * parser decides that later. (rafl)
1077 if (PL_lex_state == LEX_NORMAL) {
1078 if (ckWARN(WARN_AMBIGUOUS) &&
1079 (keyword(dest, d - dest) || get_cv(dest, FALSE)))
1081 Perl_warner(aTHX_ packWARN(WARN_AMBIGUOUS),
1082 "Ambiguous use of %c{%s} resolved to %c%s",
1083 funny, dest, funny, dest);
1089 s = bracket; /* let the parser handle it */
1093 /* don't intuit. we really just want the string. (rafl) */
1095 else if (PL_lex_state == LEX_INTERPNORMAL && !PL_lex_brackets && !intuit_more(s))
1096 PL_lex_state = LEX_INTERPEND;