forked from schacon/perl
-
Notifications
You must be signed in to change notification settings - Fork 1
/
toke.c
5875 lines (5256 loc) · 134 KB
/
toke.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* toke.c
*
* Copyright (c) 1991-1997, Larry Wall
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*
*/
/*
* "It all comes from here, the stench and the peril." --Frodo
*/
#include "EXTERN.h"
#include "perl.h"
static void check_uni _((void));
static void force_next _((I32 type));
static char *force_version _((char *start));
static char *force_word _((char *start, int token, int check_keyword, int allow_pack, int allow_tick));
static SV *q _((SV *sv));
static char *scan_const _((char *start));
static char *scan_formline _((char *s));
static char *scan_heredoc _((char *s));
static char *scan_ident _((char *s, char *send, char *dest, STRLEN destlen,
I32 ck_uni));
static char *scan_inputsymbol _((char *start));
static char *scan_pat _((char *start));
static char *scan_str _((char *start));
static char *scan_subst _((char *start));
static char *scan_trans _((char *start));
static char *scan_word _((char *s, char *dest, STRLEN destlen,
int allow_package, STRLEN *slp));
static char *skipspace _((char *s));
static void checkcomma _((char *s, char *name, char *what));
static void force_ident _((char *s, int kind));
static void incline _((char *s));
static int intuit_method _((char *s, GV *gv));
static int intuit_more _((char *s));
static I32 lop _((I32 f, expectation x, char *s));
static void missingterm _((char *s));
static void no_op _((char *what, char *s));
static void set_csh _((void));
static I32 sublex_done _((void));
static I32 sublex_push _((void));
static I32 sublex_start _((void));
#ifdef CRIPPLED_CC
static int uni _((I32 f, char *s));
#endif
static char * filter_gets _((SV *sv, PerlIO *fp, STRLEN append));
static void restore_rsfp _((void *f));
static void restore_expect _((void *e));
static void restore_lex_expect _((void *e));
static char ident_too_long[] = "Identifier too long";
static char *linestart; /* beg. of most recently read line */
static char pending_ident; /* pending identifier lookup */
static struct {
I32 super_state; /* lexer state to save */
I32 sub_inwhat; /* "lex_inwhat" to use */
OP *sub_op; /* "lex_op" to use */
} sublex_info;
/* The following are arranged oddly so that the guard on the switch statement
* can get by with a single comparison (if the compiler is smart enough).
*/
/* #define LEX_NOTPARSING 11 is done in perl.h. */
#define LEX_NORMAL 10
#define LEX_INTERPNORMAL 9
#define LEX_INTERPCASEMOD 8
#define LEX_INTERPPUSH 7
#define LEX_INTERPSTART 6
#define LEX_INTERPEND 5
#define LEX_INTERPENDMAYBE 4
#define LEX_INTERPCONCAT 3
#define LEX_INTERPCONST 2
#define LEX_FORMLINE 1
#define LEX_KNOWNEXT 0
#ifdef I_FCNTL
#include <fcntl.h>
#endif
#ifdef I_SYS_FILE
#include <sys/file.h>
#endif
/* XXX If this causes problems, set i_unistd=undef in the hint file. */
#ifdef I_UNISTD
# include <unistd.h> /* Needed for execv() */
#endif
#ifdef ff_next
#undef ff_next
#endif
#include "keywords.h"
#ifdef CLINE
#undef CLINE
#endif
#define CLINE (copline = (curcop->cop_line < copline ? curcop->cop_line : copline))
#define TOKEN(retval) return (bufptr = s,(int)retval)
#define OPERATOR(retval) return (expect = XTERM,bufptr = s,(int)retval)
#define AOPERATOR(retval) return ao((expect = XTERM,bufptr = s,(int)retval))
#define PREBLOCK(retval) return (expect = XBLOCK,bufptr = s,(int)retval)
#define PRETERMBLOCK(retval) return (expect = XTERMBLOCK,bufptr = s,(int)retval)
#define PREREF(retval) return (expect = XREF,bufptr = s,(int)retval)
#define TERM(retval) return (CLINE, expect = XOPERATOR,bufptr = s,(int)retval)
#define LOOPX(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)LOOPEX)
#define FTST(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)UNIOP)
#define FUN0(f) return(yylval.ival = f,expect = XOPERATOR,bufptr = s,(int)FUNC0)
#define FUN1(f) return(yylval.ival = f,expect = XOPERATOR,bufptr = s,(int)FUNC1)
#define BOop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)BITOROP))
#define BAop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)BITANDOP))
#define SHop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)SHIFTOP))
#define PWop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)POWOP))
#define PMop(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)MATCHOP)
#define Aop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)ADDOP))
#define Mop(f) return ao((yylval.ival=f,expect = XTERM,bufptr = s,(int)MULOP))
#define Eop(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)EQOP)
#define Rop(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)RELOP)
/* This bit of chicanery makes a unary function followed by
* a parenthesis into a function with one argument, highest precedence.
*/
#define UNI(f) return(yylval.ival = f, \
expect = XTERM, \
bufptr = s, \
last_uni = oldbufptr, \
last_lop_op = f, \
(*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
#define UNIBRACK(f) return(yylval.ival = f, \
bufptr = s, \
last_uni = oldbufptr, \
(*s == '(' || (s = skipspace(s), *s == '(') ? (int)FUNC1 : (int)UNIOP) )
/* grandfather return to old style */
#define OLDLOP(f) return(yylval.ival=f,expect = XTERM,bufptr = s,(int)LSTOP)
static int
ao(toketype)
int toketype;
{
if (*bufptr == '=') {
bufptr++;
if (toketype == ANDAND)
yylval.ival = OP_ANDASSIGN;
else if (toketype == OROR)
yylval.ival = OP_ORASSIGN;
toketype = ASSIGNOP;
}
return toketype;
}
static void
no_op(what, s)
char *what;
char *s;
{
char *oldbp = bufptr;
bool is_first = (oldbufptr == linestart);
bufptr = s;
yywarn(form("%s found where operator expected", what));
if (is_first)
warn("\t(Missing semicolon on previous line?)\n");
else if (oldoldbufptr && isIDFIRST(*oldoldbufptr)) {
char *t;
for (t = oldoldbufptr; *t && (isALNUM(*t) || *t == ':'); t++) ;
if (t < bufptr && isSPACE(*t))
warn("\t(Do you need to predeclare %.*s?)\n",
t - oldoldbufptr, oldoldbufptr);
}
else
warn("\t(Missing operator before %.*s?)\n", s - oldbp, oldbp);
bufptr = oldbp;
}
static void
missingterm(s)
char *s;
{
char tmpbuf[3];
char q;
if (s) {
char *nl = strrchr(s,'\n');
if (nl)
*nl = '\0';
}
else if (multi_close < 32 || multi_close == 127) {
*tmpbuf = '^';
tmpbuf[1] = toCTRL(multi_close);
s = "\\n";
tmpbuf[2] = '\0';
s = tmpbuf;
}
else {
*tmpbuf = multi_close;
tmpbuf[1] = '\0';
s = tmpbuf;
}
q = strchr(s,'"') ? '\'' : '"';
croak("Can't find string terminator %c%s%c anywhere before EOF",q,s,q);
}
void
deprecate(s)
char *s;
{
if (dowarn)
warn("Use of %s is deprecated", s);
}
static void
depcom()
{
deprecate("comma-less variable list");
}
void
lex_start(line)
SV *line;
{
char *s;
STRLEN len;
SAVEI32(lex_dojoin);
SAVEI32(lex_brackets);
SAVEI32(lex_fakebrack);
SAVEI32(lex_casemods);
SAVEI32(lex_starts);
SAVEI32(lex_state);
SAVESPTR(lex_inpat);
SAVEI32(lex_inwhat);
SAVEI16(curcop->cop_line);
SAVEPPTR(bufptr);
SAVEPPTR(bufend);
SAVEPPTR(oldbufptr);
SAVEPPTR(oldoldbufptr);
SAVEPPTR(linestart);
SAVESPTR(linestr);
SAVEPPTR(lex_brackstack);
SAVEPPTR(lex_casestack);
SAVEDESTRUCTOR(restore_rsfp, rsfp);
SAVESPTR(lex_stuff);
SAVEI32(lex_defer);
SAVESPTR(lex_repl);
SAVEDESTRUCTOR(restore_expect, tokenbuf + expect); /* encode as pointer */
SAVEDESTRUCTOR(restore_lex_expect, tokenbuf + expect);
lex_state = LEX_NORMAL;
lex_defer = 0;
expect = XSTATE;
lex_brackets = 0;
lex_fakebrack = 0;
New(899, lex_brackstack, 120, char);
New(899, lex_casestack, 12, char);
SAVEFREEPV(lex_brackstack);
SAVEFREEPV(lex_casestack);
lex_casemods = 0;
*lex_casestack = '\0';
lex_dojoin = 0;
lex_starts = 0;
lex_stuff = Nullsv;
lex_repl = Nullsv;
lex_inpat = 0;
lex_inwhat = 0;
linestr = line;
if (SvREADONLY(linestr))
linestr = sv_2mortal(newSVsv(linestr));
s = SvPV(linestr, len);
if (len && s[len-1] != ';') {
if (!(SvFLAGS(linestr) & SVs_TEMP))
linestr = sv_2mortal(newSVsv(linestr));
sv_catpvn(linestr, "\n;", 2);
}
SvTEMP_off(linestr);
oldoldbufptr = oldbufptr = bufptr = linestart = SvPVX(linestr);
bufend = bufptr + SvCUR(linestr);
SvREFCNT_dec(rs);
rs = newSVpv("\n", 1);
rsfp = 0;
}
void
lex_end()
{
doextract = FALSE;
}
static void
restore_rsfp(f)
void *f;
{
PerlIO *fp = (PerlIO*)f;
if (rsfp == PerlIO_stdin())
PerlIO_clearerr(rsfp);
else if (rsfp && (rsfp != fp))
PerlIO_close(rsfp);
rsfp = fp;
}
static void
restore_expect(e)
void *e;
{
/* a safe way to store a small integer in a pointer */
expect = (expectation)((char *)e - tokenbuf);
}
static void
restore_lex_expect(e)
void *e;
{
/* a safe way to store a small integer in a pointer */
lex_expect = (expectation)((char *)e - tokenbuf);
}
static void
incline(s)
char *s;
{
char *t;
char *n;
char ch;
int sawline = 0;
curcop->cop_line++;
if (*s++ != '#')
return;
while (*s == ' ' || *s == '\t') s++;
if (strnEQ(s, "line ", 5)) {
s += 5;
sawline = 1;
}
if (!isDIGIT(*s))
return;
n = s;
while (isDIGIT(*s))
s++;
while (*s == ' ' || *s == '\t')
s++;
if (*s == '"' && (t = strchr(s+1, '"')))
s++;
else {
if (!sawline)
return; /* false alarm */
for (t = s; !isSPACE(*t); t++) ;
}
ch = *t;
*t = '\0';
if (t - s > 0)
curcop->cop_filegv = gv_fetchfile(s);
else
curcop->cop_filegv = gv_fetchfile(origfilename);
*t = ch;
curcop->cop_line = atoi(n)-1;
}
static char *
skipspace(s)
register char *s;
{
if (lex_formbrack && lex_brackets <= lex_formbrack) {
while (s < bufend && (*s == ' ' || *s == '\t'))
s++;
return s;
}
for (;;) {
STRLEN prevlen;
while (s < bufend && isSPACE(*s))
s++;
if (s < bufend && *s == '#') {
while (s < bufend && *s != '\n')
s++;
if (s < bufend)
s++;
}
if (s < bufend || !rsfp || lex_state != LEX_NORMAL)
return s;
if ((s = filter_gets(linestr, rsfp, (prevlen = SvCUR(linestr)))) == Nullch) {
if (minus_n || minus_p) {
sv_setpv(linestr,minus_p ?
";}continue{print or die qq(-p destination: $!\\n)" :
"");
sv_catpv(linestr,";}");
minus_n = minus_p = 0;
}
else
sv_setpv(linestr,";");
oldoldbufptr = oldbufptr = bufptr = s = linestart = SvPVX(linestr);
bufend = SvPVX(linestr) + SvCUR(linestr);
if (preprocess && !in_eval)
(void)my_pclose(rsfp);
else if ((PerlIO*)rsfp == PerlIO_stdin())
PerlIO_clearerr(rsfp);
else
(void)PerlIO_close(rsfp);
if (e_fp == rsfp)
e_fp = Nullfp;
rsfp = Nullfp;
return s;
}
linestart = bufptr = s + prevlen;
bufend = s + SvCUR(linestr);
s = bufptr;
incline(s);
if (PERLDB_LINE && curstash != debstash) {
SV *sv = NEWSV(85,0);
sv_upgrade(sv, SVt_PVMG);
sv_setpvn(sv,bufptr,bufend-bufptr);
av_store(GvAV(curcop->cop_filegv),(I32)curcop->cop_line,sv);
}
}
}
static void
check_uni() {
char *s;
char ch;
char *t;
if (oldoldbufptr != last_uni)
return;
while (isSPACE(*last_uni))
last_uni++;
for (s = last_uni; isALNUM(*s) || *s == '-'; s++) ;
if ((t = strchr(s, '(')) && t < bufptr)
return;
ch = *s;
*s = '\0';
warn("Warning: Use of \"%s\" without parens is ambiguous", last_uni);
*s = ch;
}
#ifdef CRIPPLED_CC
#undef UNI
#define UNI(f) return uni(f,s)
static int
uni(f,s)
I32 f;
char *s;
{
yylval.ival = f;
expect = XTERM;
bufptr = s;
last_uni = oldbufptr;
last_lop_op = f;
if (*s == '(')
return FUNC1;
s = skipspace(s);
if (*s == '(')
return FUNC1;
else
return UNIOP;
}
#endif /* CRIPPLED_CC */
#define LOP(f,x) return lop(f,x,s)
static I32
lop
#ifdef CAN_PROTOTYPE
(I32 f, expectation x, char *s)
#else
(f,x,s)
I32 f;
expectation x;
char *s;
#endif /* CAN_PROTOTYPE */
{
yylval.ival = f;
CLINE;
expect = x;
bufptr = s;
last_lop = oldbufptr;
last_lop_op = f;
if (nexttoke)
return LSTOP;
if (*s == '(')
return FUNC;
s = skipspace(s);
if (*s == '(')
return FUNC;
else
return LSTOP;
}
static void
force_next(type)
I32 type;
{
nexttype[nexttoke] = type;
nexttoke++;
if (lex_state != LEX_KNOWNEXT) {
lex_defer = lex_state;
lex_expect = expect;
lex_state = LEX_KNOWNEXT;
}
}
static char *
force_word(start,token,check_keyword,allow_pack,allow_initial_tick)
register char *start;
int token;
int check_keyword;
int allow_pack;
int allow_initial_tick;
{
register char *s;
STRLEN len;
start = skipspace(start);
s = start;
if (isIDFIRST(*s) ||
(allow_pack && *s == ':') ||
(allow_initial_tick && *s == '\'') )
{
s = scan_word(s, tokenbuf, sizeof tokenbuf, allow_pack, &len);
if (check_keyword && keyword(tokenbuf, len))
return start;
if (token == METHOD) {
s = skipspace(s);
if (*s == '(')
expect = XTERM;
else {
expect = XOPERATOR;
force_next(')');
force_next('(');
}
}
nextval[nexttoke].opval = (OP*)newSVOP(OP_CONST,0, newSVpv(tokenbuf,0));
nextval[nexttoke].opval->op_private |= OPpCONST_BARE;
force_next(token);
}
return s;
}
static void
force_ident(s, kind)
register char *s;
int kind;
{
if (s && *s) {
OP* o = (OP*)newSVOP(OP_CONST, 0, newSVpv(s,0));
nextval[nexttoke].opval = o;
force_next(WORD);
if (kind) {
o->op_private = OPpCONST_ENTERED;
/* XXX see note in pp_entereval() for why we forgo typo
warnings if the symbol must be introduced in an eval.
GSAR 96-10-12 */
gv_fetchpv(s, in_eval ? (GV_ADDMULTI | 8) : TRUE,
kind == '$' ? SVt_PV :
kind == '@' ? SVt_PVAV :
kind == '%' ? SVt_PVHV :
SVt_PVGV
);
}
}
}
static char *
force_version(s)
char *s;
{
OP *version = Nullop;
s = skipspace(s);
/* default VERSION number -- GBARR */
if(isDIGIT(*s)) {
char *d;
int c;
for( d=s, c = 1; isDIGIT(*d) || *d == '_' || (*d == '.' && c--); d++);
if((*d == ';' || isSPACE(*d)) && *(skipspace(d)) != ',') {
s = scan_num(s);
/* real VERSION number -- GBARR */
version = yylval.opval;
}
}
/* NOTE: The parser sees the package name and the VERSION swapped */
nextval[nexttoke].opval = version;
force_next(WORD);
return (s);
}
static SV *
q(sv)
SV *sv;
{
register char *s;
register char *send;
register char *d;
STRLEN len;
if (!SvLEN(sv))
return sv;
s = SvPV_force(sv, len);
if (SvIVX(sv) == -1)
return sv;
send = s + len;
while (s < send && *s != '\\')
s++;
if (s == send)
return sv;
d = s;
while (s < send) {
if (*s == '\\') {
if (s + 1 < send && (s[1] == '\\'))
s++; /* all that, just for this */
}
*d++ = *s++;
}
*d = '\0';
SvCUR_set(sv, d - SvPVX(sv));
return sv;
}
static I32
sublex_start()
{
register I32 op_type = yylval.ival;
if (op_type == OP_NULL) {
yylval.opval = lex_op;
lex_op = Nullop;
return THING;
}
if (op_type == OP_CONST || op_type == OP_READLINE) {
SV *sv = q(lex_stuff);
STRLEN len;
char *p = SvPV(sv, len);
yylval.opval = (OP*)newSVOP(op_type, 0, newSVpv(p, len));
SvREFCNT_dec(sv);
lex_stuff = Nullsv;
return THING;
}
sublex_info.super_state = lex_state;
sublex_info.sub_inwhat = op_type;
sublex_info.sub_op = lex_op;
lex_state = LEX_INTERPPUSH;
expect = XTERM;
if (lex_op) {
yylval.opval = lex_op;
lex_op = Nullop;
return PMFUNC;
}
else
return FUNC;
}
static I32
sublex_push()
{
ENTER;
lex_state = sublex_info.super_state;
SAVEI32(lex_dojoin);
SAVEI32(lex_brackets);
SAVEI32(lex_fakebrack);
SAVEI32(lex_casemods);
SAVEI32(lex_starts);
SAVEI32(lex_state);
SAVESPTR(lex_inpat);
SAVEI32(lex_inwhat);
SAVEI16(curcop->cop_line);
SAVEPPTR(bufptr);
SAVEPPTR(oldbufptr);
SAVEPPTR(oldoldbufptr);
SAVEPPTR(linestart);
SAVESPTR(linestr);
SAVEPPTR(lex_brackstack);
SAVEPPTR(lex_casestack);
linestr = lex_stuff;
lex_stuff = Nullsv;
bufend = bufptr = oldbufptr = oldoldbufptr = linestart = SvPVX(linestr);
bufend += SvCUR(linestr);
SAVEFREESV(linestr);
lex_dojoin = FALSE;
lex_brackets = 0;
lex_fakebrack = 0;
New(899, lex_brackstack, 120, char);
New(899, lex_casestack, 12, char);
SAVEFREEPV(lex_brackstack);
SAVEFREEPV(lex_casestack);
lex_casemods = 0;
*lex_casestack = '\0';
lex_starts = 0;
lex_state = LEX_INTERPCONCAT;
curcop->cop_line = multi_start;
lex_inwhat = sublex_info.sub_inwhat;
if (lex_inwhat == OP_MATCH || lex_inwhat == OP_SUBST)
lex_inpat = sublex_info.sub_op;
else
lex_inpat = Nullop;
return '(';
}
static I32
sublex_done()
{
if (!lex_starts++) {
expect = XOPERATOR;
yylval.opval = (OP*)newSVOP(OP_CONST, 0, newSVpv("",0));
return THING;
}
if (lex_casemods) { /* oops, we've got some unbalanced parens */
lex_state = LEX_INTERPCASEMOD;
return yylex();
}
/* Is there a right-hand side to take care of? */
if (lex_repl && (lex_inwhat == OP_SUBST || lex_inwhat == OP_TRANS)) {
linestr = lex_repl;
lex_inpat = 0;
bufend = bufptr = oldbufptr = oldoldbufptr = linestart = SvPVX(linestr);
bufend += SvCUR(linestr);
SAVEFREESV(linestr);
lex_dojoin = FALSE;
lex_brackets = 0;
lex_fakebrack = 0;
lex_casemods = 0;
*lex_casestack = '\0';
lex_starts = 0;
if (SvCOMPILED(lex_repl)) {
lex_state = LEX_INTERPNORMAL;
lex_starts++;
}
else
lex_state = LEX_INTERPCONCAT;
lex_repl = Nullsv;
return ',';
}
else {
LEAVE;
bufend = SvPVX(linestr);
bufend += SvCUR(linestr);
expect = XOPERATOR;
return ')';
}
}
/*
scan_const
Extracts a pattern, double-quoted string, or transliteration. This
is terrifying code.
It looks at lex_inwhat and lex_inpat to find out whether it's
processing a pattern (lex_inpat is true), a transliteration
(lex_inwhat & OP_TRANS is true), or a double-quoted string.
Returns a pointer to the character scanned up to. Iff this is
advanced from the start pointer supplied (ie if anything was
successfully parsed), will leave an OP for the substring scanned
in yylval. Caller must intuit reason for not parsing further
by looking at the next characters herself.
In patterns:
backslashes:
double-quoted style: \r and \n
regexp special ones: \D \s
constants: \x3
backrefs: \1 (deprecated in substitution replacements)
case and quoting: \U \Q \E
stops on @ and $, but not for $ as tail anchor
In transliterations:
characters are VERY literal, except for - not at the start or end
of the string, which indicates a range. scan_const expands the
range to the full set of intermediate characters.
In double-quoted strings:
backslashes:
double-quoted style: \r and \n
constants: \x3
backrefs: \1 (deprecated)
case and quoting: \U \Q \E
stops on @ and $
scan_const does *not* construct ops to handle interpolated strings.
It stops processing as soon as it finds an embedded $ or @ variable
and leaves it to the caller to work out what's going on.
@ in pattern could be: @foo, @{foo}, @$foo, @'foo, @:foo.
$ in pattern could be $foo or could be tail anchor. Assumption:
it's a tail anchor if $ is the last thing in the string, or if it's
followed by one of ")| \n\t"
\1 (backreferences) are turned into $1
The structure of the code is
while (there's a character to process) {
handle transliteration ranges
skip regexp comments
skip # initiated comments in //x patterns
check for embedded @foo
check for embedded scalars
if (backslash) {
leave intact backslashes from leave (below)
deprecate \1 in strings and sub replacements
handle string-changing backslashes \l \U \Q \E, etc.
switch (what was escaped) {
handle - in a transliteration (becomes a literal -)
handle \132 octal characters
handle 0x15 hex characters
handle \cV (control V)
handle printf backslashes (\f, \r, \n, etc)
} (end switch)
} (end if backslash)
} (end while character to read)
*/
static char *
scan_const(start)
char *start;
{
register char *send = bufend; /* end of the constant */
SV *sv = NEWSV(93, send - start); /* sv for the constant */
register char *s = start; /* start of the constant */
register char *d = SvPVX(sv); /* destination for copies */
bool dorange = FALSE; /* are we in a translit range? */
I32 len; /* ? */
/* leave is the set of acceptably-backslashed characters */
char *leave =
lex_inpat
? "\\.^$@AGZdDwWsSbB+*?|()-nrtfeaxc0123456789[{]} \t\n\r\f\v#"
: "";
while (s < send || dorange) {
/* get transliterations out of the way (they're most literal) */
if (lex_inwhat == OP_TRANS) {
/* expand a range A-Z to the full set of characters. AIE! */
if (dorange) {
I32 i; /* current expanded character */
I32 max; /* last character in range */
i = d - SvPVX(sv); /* remember current offset */
SvGROW(sv, SvLEN(sv) + 256); /* expand the sv -- there'll never be more'n 256 chars in a range for it to grow by */
d = SvPVX(sv) + i; /* restore d after the grow potentially has changed the ptr */
d -= 2; /* eat the first char and the - */
max = (U8)d[1]; /* last char in range */
for (i = (U8)*d; i <= max; i++)
*d++ = i;
/* mark the range as done, and continue */
dorange = FALSE;
continue;
}
/* range begins (ignore - as first or last char) */
else if (*s == '-' && s+1 < send && s != start) {
dorange = TRUE;
s++;
}
}
/* if we get here, we're not doing a transliteration */
/* skip for regexp comments /(?#comment)/ */
else if (*s == '(' && lex_inpat && s[1] == '?' && s[2] == '#') {
while (s < send && *s != ')')
*d++ = *s++;
}
/* likewise skip #-initiated comments in //x patterns */
else if (*s == '#' && lex_inpat &&
((PMOP*)lex_inpat)->op_pmflags & PMf_EXTENDED) {
while (s+1 < send && *s != '\n')
*d++ = *s++;
}
/* check for embedded arrays (@foo, @:foo, @'foo, @{foo}, @$foo) */
else if (*s == '@' && s[1] && (isALNUM(s[1]) || strchr(":'{$", s[1])))
break;
/* check for embedded scalars. only stop if we're sure it's a
variable.
*/
else if (*s == '$') {
if (!lex_inpat) /* not a regexp, so $ must be var */
break;
if (s + 1 < send && !strchr(")| \n\t", s[1]))
break; /* in regexp, $ might be tail anchor */
}
/* backslashes */
if (*s == '\\' && s+1 < send) {
s++;
/* some backslashes we leave behind */
if (*s && strchr(leave, *s)) {
*d++ = '\\';
*d++ = *s++;
continue;
}
/* deprecate \1 in strings and substitution replacements */
if (lex_inwhat == OP_SUBST && !lex_inpat &&
isDIGIT(*s) && *s != '0' && !isDIGIT(s[1]))
{
if (dowarn)
warn("\\%c better written as $%c", *s, *s);
*--s = '$';
break;
}
/* string-change backslash escapes */
if (lex_inwhat != OP_TRANS && *s && strchr("lLuUEQ", *s)) {
--s;
break;
}
/* if we get here, it's either a quoted -, or a digit */
switch (*s) {
/* quoted - in transliterations */
case '-':
if (lex_inwhat == OP_TRANS) {
*d++ = *s++;
continue;
}
/* FALL THROUGH */
/* default action is to copy the quoted character */
default:
*d++ = *s++;
continue;
/* \132 indicates an octal constant */
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
*d++ = scan_oct(s, 3, &len);
s += len;
continue;
/* \x24 indicates a hex constant */
case 'x':
*d++ = scan_hex(++s, 2, &len);
s += len;
continue;
/* \c is a control character */
case 'c':
s++;
len = *s++;
*d++ = toCTRL(len);
continue;
/* printf-style backslashes, formfeeds, newlines, etc */
case 'b':
*d++ = '\b';
break;
case 'n':
*d++ = '\n';
break;
case 'r':
*d++ = '\r';
break;
case 'f':
*d++ = '\f';
break;
case 't':
*d++ = '\t';
break;
case 'e':
*d++ = '\033';