forked from schacon/perl
/
cmd.c
1216 lines (1156 loc) · 29.5 KB
/
cmd.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
/* $Header: cmd.c,v 3.0.1.10 90/10/20 02:01:56 lwall Locked $
*
* Copyright (c) 1989, Larry Wall
*
* You may distribute under the terms of the GNU General Public License
* as specified in the README file that comes with the perl 3.0 kit.
*
* $Log: cmd.c,v $
* Revision 3.0.1.10 90/10/20 02:01:56 lwall
* patch37: cray has weird restrictions on setjmp locations
*
* Revision 3.0.1.9 90/10/15 15:32:39 lwall
* patch29: non-existent array values no longer cause core dumps
* patch29: scripts now run at almost full speed under the debugger
* patch29: @ENV = () now works
* patch29: added caller
*
* Revision 3.0.1.8 90/08/09 02:28:49 lwall
* patch19: did preliminary work toward debugging packages and evals
* patch19: conditionals now always supply a scalar context to expression
* patch19: switch optimizer was confused by negative fractional values
*
* Revision 3.0.1.7 90/03/27 15:32:37 lwall
* patch16: non-terminal blocks should never have arrays requested of them
*
* Revision 3.0.1.6 90/03/12 16:21:09 lwall
* patch13: fixed some backwards VOLATILE declarations
* patch13: while (s/x//) {} still caused some anomolies
* patch13: greater-than test of numeric switch structures did less-than action
*
* Revision 3.0.1.5 90/02/28 16:38:31 lwall
* patch9: volatilized some more variables for super-optimizing compilers
* patch9: nested foreach loops didn't reset inner loop on next to outer loop
* patch9: returned values were read from obsolete stack
* patch9: added sanity check on longjmp() return value
* patch9: substitutions that almost always succeed can corrupt label stack
* patch9: subs which return by both mechanisms can clobber local return data
*
* Revision 3.0.1.4 89/12/21 19:17:41 lwall
* patch7: arranged for certain registers to be restored after longjmp()
* patch7: made nested or recursive foreach work right
*
* Revision 3.0.1.3 89/11/17 15:04:36 lwall
* patch5: nested foreach on same array didn't work
*
* Revision 3.0.1.2 89/11/11 04:08:56 lwall
* patch2: non-BSD machines required two ^D's for <>
* patch2: grow_dlevel() not inside #ifdef DEBUGGING
*
* Revision 3.0.1.1 89/10/26 23:04:21 lwall
* patch1: heuristically disabled optimization could cause core dump
*
* Revision 3.0 89/10/18 15:09:02 lwall
* 3.0 baseline
*
*/
#include "EXTERN.h"
#include "perl.h"
#ifdef I_VARARGS
# include <varargs.h>
#endif
static STR str_chop;
void grow_dlevel();
/* do longjmps() clobber register variables? */
#if defined(cray) || defined(__STDC__)
#define JMPCLOBBER
#endif
/* This is the main command loop. We try to spend as much time in this loop
* as possible, so lots of optimizations do their activities in here. This
* means things get a little sloppy.
*/
int
cmd_exec(cmdparm,gimme,sp)
CMD *VOLATILE cmdparm;
VOLATILE int gimme;
VOLATILE int sp;
{
register CMD *cmd = cmdparm;
SPAT *VOLATILE oldspat;
VOLATILE int firstsave = savestack->ary_fill;
VOLATILE int oldsave;
VOLATILE int aryoptsave;
#ifdef DEBUGGING
VOLATILE int olddlevel;
VOLATILE int entdlevel;
#endif
register STR *retstr = &str_undef;
register char *tmps;
register int cmdflags;
register int match;
register char *go_to = goto_targ;
register int newsp = -2;
register STR **st = stack->ary_array;
FILE *VOLATILE fp;
ARRAY *VOLATILE ar;
lastsize = 0;
#ifdef DEBUGGING
entdlevel = dlevel;
#endif
tail_recursion_entry:
#ifdef DEBUGGING
dlevel = entdlevel;
#endif
#ifdef TAINT
tainted = 0; /* Each statement is presumed innocent */
#endif
if (cmd == Nullcmd) {
if (gimme == G_ARRAY && newsp > -2)
return newsp;
else {
st[++sp] = retstr;
return sp;
}
}
cmdflags = cmd->c_flags; /* hopefully load register */
if (go_to) {
if (cmd->c_label && strEQ(go_to,cmd->c_label))
goto_targ = go_to = Nullch; /* here at last */
else {
switch (cmd->c_type) {
case C_IF:
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
retstr = &str_yes;
newsp = -2;
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 't';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
if (!goto_targ)
go_to = Nullch;
curspat = oldspat;
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
cmd = cmd->ucmd.ccmd.cc_alt;
goto tail_recursion_entry;
case C_ELSE:
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
retstr = &str_undef;
newsp = -2;
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 'e';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
if (!goto_targ)
go_to = Nullch;
curspat = oldspat;
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
break;
case C_BLOCK:
case C_WHILE:
if (!(cmdflags & CF_ONCE)) {
cmdflags |= CF_ONCE;
if (++loop_ptr >= loop_max) {
loop_max += 128;
Renew(loop_stack, loop_max, struct loop);
}
loop_stack[loop_ptr].loop_label = cmd->c_label;
loop_stack[loop_ptr].loop_sp = sp;
#ifdef DEBUGGING
if (debug & 4) {
deb("(Pushing label #%d %s)\n",
loop_ptr, cmd->c_label ? cmd->c_label : "");
}
#endif
}
#ifdef JMPCLOBBER
cmdparm = cmd;
#endif
match = setjmp(loop_stack[loop_ptr].loop_env);
if (match) {
st = stack->ary_array; /* possibly reallocated */
#ifdef JMPCLOBBER
cmd = cmdparm;
cmdflags = cmd->c_flags|CF_ONCE;
#endif
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
switch (match) {
default:
fatal("longjmp returned bad value (%d)",match);
case O_LAST: /* not done unless go_to found */
go_to = Nullch;
if (lastretstr) {
retstr = lastretstr;
newsp = -2;
}
else {
newsp = sp + lastsize;
retstr = st[newsp];
}
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
curspat = oldspat;
goto next_cmd;
case O_NEXT: /* not done unless go_to found */
go_to = Nullch;
#ifdef JMPCLOBBER
newsp = -2;
retstr = &str_undef;
#endif
goto next_iter;
case O_REDO: /* not done unless go_to found */
go_to = Nullch;
#ifdef JMPCLOBBER
newsp = -2;
retstr = &str_undef;
#endif
goto doit;
}
}
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 't';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
if (!goto_targ) {
go_to = Nullch;
goto next_iter;
}
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
if (cmd->ucmd.ccmd.cc_alt) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 'a';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_alt,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
if (goto_targ)
break;
go_to = Nullch;
goto finish_while;
}
cmd = cmd->c_next;
if (cmd && cmd->c_head == cmd)
/* reached end of while loop */
return sp; /* targ isn't in this block */
if (cmdflags & CF_ONCE) {
#ifdef DEBUGGING
if (debug & 4) {
tmps = loop_stack[loop_ptr].loop_label;
deb("(Popping label #%d %s)\n",loop_ptr,
tmps ? tmps : "" );
}
#endif
loop_ptr--;
}
goto tail_recursion_entry;
}
}
until_loop:
/* Set line number so run-time errors can be located */
curcmd = cmd;
#ifdef DEBUGGING
if (debug) {
if (debug & 2) {
deb("%s (%lx) r%lx t%lx a%lx n%lx cs%lx\n",
cmdname[cmd->c_type],cmd,cmd->c_expr,
cmd->ucmd.ccmd.cc_true,cmd->ucmd.ccmd.cc_alt,cmd->c_next,
curspat);
}
debname[dlevel] = cmdname[cmd->c_type][0];
debdelim[dlevel] = '!';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
/* Here is some common optimization */
if (cmdflags & CF_COND) {
switch (cmdflags & CF_OPTIMIZE) {
case CFT_FALSE:
retstr = cmd->c_short;
newsp = -2;
match = FALSE;
if (cmdflags & CF_NESURE)
goto maybe;
break;
case CFT_TRUE:
retstr = cmd->c_short;
newsp = -2;
match = TRUE;
if (cmdflags & CF_EQSURE)
goto flipmaybe;
break;
case CFT_REG:
retstr = STAB_STR(cmd->c_stab);
newsp = -2;
match = str_true(retstr); /* => retstr = retstr, c2 should fix */
if (cmdflags & (match ? CF_EQSURE : CF_NESURE))
goto flipmaybe;
break;
case CFT_ANCHOR: /* /^pat/ optimization */
if (multiline) {
if (*cmd->c_short->str_ptr && !(cmdflags & CF_EQSURE))
goto scanner; /* just unanchor it */
else
break; /* must evaluate */
}
/* FALL THROUGH */
case CFT_STROP: /* string op optimization */
retstr = STAB_STR(cmd->c_stab);
newsp = -2;
#ifndef I286
if (*cmd->c_short->str_ptr == *str_get(retstr) &&
bcmp(cmd->c_short->str_ptr, str_get(retstr),
cmd->c_slen) == 0 ) {
if (cmdflags & CF_EQSURE) {
if (sawampersand && (cmdflags & CF_OPTIMIZE) != CFT_STROP) {
curspat = Nullspat;
if (leftstab)
str_nset(stab_val(leftstab),"",0);
if (amperstab)
str_sset(stab_val(amperstab),cmd->c_short);
if (rightstab)
str_nset(stab_val(rightstab),
retstr->str_ptr + cmd->c_slen,
retstr->str_cur - cmd->c_slen);
}
match = !(cmdflags & CF_FIRSTNEG);
retstr = &str_yes;
goto flipmaybe;
}
}
else if (cmdflags & CF_NESURE) {
match = cmdflags & CF_FIRSTNEG;
retstr = &str_no;
goto flipmaybe;
}
#else
{
char *zap1, *zap2, zap1c, zap2c;
int zaplen;
zap1 = cmd->c_short->str_ptr;
zap2 = str_get(retstr);
zap1c = *zap1;
zap2c = *zap2;
zaplen = cmd->c_slen;
if ((zap1c == zap2c) && (bcmp(zap1, zap2, zaplen) == 0)) {
if (cmdflags & CF_EQSURE) {
if (sawampersand &&
(cmdflags & CF_OPTIMIZE) != CFT_STROP) {
curspat = Nullspat;
if (leftstab)
str_nset(stab_val(leftstab),"",0);
if (amperstab)
str_sset(stab_val(amperstab),cmd->c_short);
if (rightstab)
str_nset(stab_val(rightstab),
retstr->str_ptr + cmd->c_slen,
retstr->str_cur - cmd->c_slen);
}
match = !(cmdflags & CF_FIRSTNEG);
retstr = &str_yes;
goto flipmaybe;
}
}
else if (cmdflags & CF_NESURE) {
match = cmdflags & CF_FIRSTNEG;
retstr = &str_no;
goto flipmaybe;
}
}
#endif
break; /* must evaluate */
case CFT_SCAN: /* non-anchored search */
scanner:
retstr = STAB_STR(cmd->c_stab);
newsp = -2;
if (retstr->str_pok & SP_STUDIED)
if (screamfirst[cmd->c_short->str_rare] >= 0)
tmps = screaminstr(retstr, cmd->c_short);
else
tmps = Nullch;
else {
tmps = str_get(retstr); /* make sure it's pok */
#ifndef lint
tmps = fbminstr((unsigned char*)tmps,
(unsigned char*)tmps + retstr->str_cur, cmd->c_short);
#endif
}
if (tmps) {
if (cmdflags & CF_EQSURE) {
++cmd->c_short->str_u.str_useful;
if (sawampersand) {
curspat = Nullspat;
if (leftstab)
str_nset(stab_val(leftstab),retstr->str_ptr,
tmps - retstr->str_ptr);
if (amperstab)
str_sset(stab_val(amperstab),cmd->c_short);
if (rightstab)
str_nset(stab_val(rightstab),
tmps + cmd->c_short->str_cur,
retstr->str_cur - (tmps - retstr->str_ptr) -
cmd->c_short->str_cur);
}
match = !(cmdflags & CF_FIRSTNEG);
retstr = &str_yes;
goto flipmaybe;
}
else
hint = tmps;
}
else {
if (cmdflags & CF_NESURE) {
++cmd->c_short->str_u.str_useful;
match = cmdflags & CF_FIRSTNEG;
retstr = &str_no;
goto flipmaybe;
}
}
if (--cmd->c_short->str_u.str_useful < 0) {
cmdflags &= ~CF_OPTIMIZE;
cmdflags |= CFT_EVAL; /* never try this optimization again */
cmd->c_flags = (cmdflags & ~CF_ONCE);
}
break; /* must evaluate */
case CFT_NUMOP: /* numeric op optimization */
retstr = STAB_STR(cmd->c_stab);
newsp = -2;
switch (cmd->c_slen) {
case O_EQ:
if (dowarn) {
if ((!retstr->str_nok && !looks_like_number(retstr)))
warn("Possible use of == on string value");
}
match = (str_gnum(retstr) == cmd->c_short->str_u.str_nval);
break;
case O_NE:
match = (str_gnum(retstr) != cmd->c_short->str_u.str_nval);
break;
case O_LT:
match = (str_gnum(retstr) < cmd->c_short->str_u.str_nval);
break;
case O_LE:
match = (str_gnum(retstr) <= cmd->c_short->str_u.str_nval);
break;
case O_GT:
match = (str_gnum(retstr) > cmd->c_short->str_u.str_nval);
break;
case O_GE:
match = (str_gnum(retstr) >= cmd->c_short->str_u.str_nval);
break;
}
if (match) {
if (cmdflags & CF_EQSURE) {
retstr = &str_yes;
goto flipmaybe;
}
}
else if (cmdflags & CF_NESURE) {
retstr = &str_no;
goto flipmaybe;
}
break; /* must evaluate */
case CFT_INDGETS: /* while (<$foo>) */
last_in_stab = stabent(str_get(STAB_STR(cmd->c_stab)),TRUE);
if (!stab_io(last_in_stab))
stab_io(last_in_stab) = stio_new();
goto dogets;
case CFT_GETS: /* really a while (<file>) */
last_in_stab = cmd->c_stab;
dogets:
fp = stab_io(last_in_stab)->ifp;
retstr = stab_val(defstab);
newsp = -2;
keepgoing:
if (fp && str_gets(retstr, fp, 0)) {
if (*retstr->str_ptr == '0' && retstr->str_cur == 1)
match = FALSE;
else
match = TRUE;
stab_io(last_in_stab)->lines++;
}
else if (stab_io(last_in_stab)->flags & IOF_ARGV) {
if (!fp)
goto doeval; /* first time through */
fp = nextargv(last_in_stab);
if (fp)
goto keepgoing;
(void)do_close(last_in_stab,FALSE);
stab_io(last_in_stab)->flags |= IOF_START;
retstr = &str_undef;
match = FALSE;
}
else {
retstr = &str_undef;
match = FALSE;
}
goto flipmaybe;
case CFT_EVAL:
break;
case CFT_UNFLIP:
while (tmps_max > tmps_base) /* clean up after last eval */
str_free(tmps_list[tmps_max--]);
newsp = eval(cmd->c_expr,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
match = str_true(retstr);
if (cmd->c_expr->arg_type == O_FLIP) /* undid itself? */
cmdflags = copyopt(cmd,cmd->c_expr[3].arg_ptr.arg_cmd);
goto maybe;
case CFT_CHOP:
retstr = stab_val(cmd->c_stab);
newsp = -2;
match = (retstr->str_cur != 0);
tmps = str_get(retstr);
tmps += retstr->str_cur - match;
str_nset(&str_chop,tmps,match);
*tmps = '\0';
retstr->str_nok = 0;
retstr->str_cur = tmps - retstr->str_ptr;
retstr = &str_chop;
goto flipmaybe;
case CFT_ARRAY:
match = cmd->c_short->str_u.str_useful; /* just to get register */
if (match < 0) { /* first time through here? */
ar = stab_array(cmd->c_expr[1].arg_ptr.arg_stab);
aryoptsave = savestack->ary_fill;
savesptr(&stab_val(cmd->c_stab));
savelong(&cmd->c_short->str_u.str_useful);
}
else {
ar = stab_xarray(cmd->c_expr[1].arg_ptr.arg_stab);
if (cmd->c_type != C_WHILE && savestack->ary_fill > firstsave)
restorelist(firstsave);
}
if (match >= ar->ary_fill) { /* we're in LAST, probably */
retstr = &str_undef;
cmd->c_short->str_u.str_useful = -1; /* actually redundant */
match = FALSE;
}
else {
match++;
if (!(retstr = ar->ary_array[match]))
retstr = afetch(ar,match,TRUE);
stab_val(cmd->c_stab) = retstr;
cmd->c_short->str_u.str_useful = match;
match = TRUE;
}
newsp = -2;
goto maybe;
case CFT_D1:
break;
case CFT_D0:
if (DBsingle->str_u.str_nval != 0)
break;
if (DBsignal->str_u.str_nval != 0)
break;
if (DBtrace->str_u.str_nval != 0)
break;
goto next_cmd;
}
/* we have tried to make this normal case as abnormal as possible */
doeval:
if (gimme == G_ARRAY) {
lastretstr = Nullstr;
lastspbase = sp;
lastsize = newsp - sp;
}
else
lastretstr = retstr;
while (tmps_max > tmps_base) /* clean up after last eval */
str_free(tmps_list[tmps_max--]);
newsp = eval(cmd->c_expr,
gimme && (cmdflags & CF_TERM) && cmd->c_type == C_EXPR &&
!cmd->ucmd.acmd.ac_expr,
sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
if (newsp > sp && retstr)
match = str_true(retstr);
else
match = FALSE;
goto maybe;
/* if flipflop was true, flop it */
flipmaybe:
if (match && cmdflags & CF_FLIP) {
while (tmps_max > tmps_base) /* clean up after last eval */
str_free(tmps_list[tmps_max--]);
if (cmd->c_expr->arg_type == O_FLOP) { /* currently toggled? */
newsp = eval(cmd->c_expr,G_SCALAR,sp);/*let eval undo it*/
cmdflags = copyopt(cmd,cmd->c_expr[3].arg_ptr.arg_cmd);
}
else {
newsp = eval(cmd->c_expr,G_SCALAR,sp);/* let eval do it */
if (cmd->c_expr->arg_type == O_FLOP) /* still toggled? */
cmdflags = copyopt(cmd,cmd->c_expr[4].arg_ptr.arg_cmd);
}
}
else if (cmdflags & CF_FLIP) {
if (cmd->c_expr->arg_type == O_FLOP) { /* currently toggled? */
match = TRUE; /* force on */
}
}
/* at this point, match says whether our expression was true */
maybe:
if (cmdflags & CF_INVERT)
match = !match;
if (!match)
goto next_cmd;
}
#ifdef TAINT
tainted = 0; /* modifier doesn't affect regular expression */
#endif
/* now to do the actual command, if any */
switch (cmd->c_type) {
case C_NULL:
fatal("panic: cmd_exec");
case C_EXPR: /* evaluated for side effects */
if (cmd->ucmd.acmd.ac_expr) { /* more to do? */
if (gimme == G_ARRAY) {
lastretstr = Nullstr;
lastspbase = sp;
lastsize = newsp - sp;
}
else
lastretstr = retstr;
while (tmps_max > tmps_base) /* clean up after last eval */
str_free(tmps_list[tmps_max--]);
newsp = eval(cmd->ucmd.acmd.ac_expr,gimme && (cmdflags&CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
break;
case C_NSWITCH:
{
double value = str_gnum(STAB_STR(cmd->c_stab));
match = (int)value;
if (value < 0.0) {
if (((double)match) > value)
--match; /* was fractional--truncate other way */
}
}
goto doswitch;
case C_CSWITCH:
match = *(str_get(STAB_STR(cmd->c_stab))) & 255;
doswitch:
match -= cmd->ucmd.scmd.sc_offset;
if (match < 0)
match = 0;
else if (match > cmd->ucmd.scmd.sc_max)
match = cmd->ucmd.scmd.sc_max;
cmd = cmd->ucmd.scmd.sc_next[match];
goto tail_recursion_entry;
case C_NEXT:
cmd = cmd->ucmd.ccmd.cc_alt;
goto tail_recursion_entry;
case C_ELSIF:
fatal("panic: ELSIF");
case C_IF:
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
retstr = &str_yes;
newsp = -2;
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 't';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
curspat = oldspat;
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
cmd = cmd->ucmd.ccmd.cc_alt;
goto tail_recursion_entry;
case C_ELSE:
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
retstr = &str_undef;
newsp = -2;
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 'e';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
curspat = oldspat;
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
break;
case C_BLOCK:
case C_WHILE:
if (!(cmdflags & CF_ONCE)) { /* first time through here? */
cmdflags |= CF_ONCE;
if (++loop_ptr >= loop_max) {
loop_max += 128;
Renew(loop_stack, loop_max, struct loop);
}
loop_stack[loop_ptr].loop_label = cmd->c_label;
loop_stack[loop_ptr].loop_sp = sp;
#ifdef DEBUGGING
if (debug & 4) {
deb("(Pushing label #%d %s)\n",
loop_ptr, cmd->c_label ? cmd->c_label : "");
}
#endif
}
#ifdef JMPCLOBBER
cmdparm = cmd;
#endif
match = setjmp(loop_stack[loop_ptr].loop_env);
if (match) {
st = stack->ary_array; /* possibly reallocated */
#ifdef JMPCLOBBER
cmd = cmdparm;
cmdflags = cmd->c_flags|CF_ONCE;
go_to = goto_targ;
#endif
if (savestack->ary_fill > oldsave)
restorelist(oldsave);
switch (match) {
default:
fatal("longjmp returned bad value (%d)",match);
case O_LAST:
if (lastretstr) {
retstr = lastretstr;
newsp = -2;
}
else {
newsp = sp + lastsize;
retstr = st[newsp];
}
curspat = oldspat;
goto next_cmd;
case O_NEXT:
#ifdef JMPCLOBBER
newsp = -2;
retstr = &str_undef;
#endif
goto next_iter;
case O_REDO:
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
#ifdef JMPCLOBBER
newsp = -2;
retstr = &str_undef;
#endif
goto doit;
}
}
oldspat = curspat;
oldsave = savestack->ary_fill;
#ifdef DEBUGGING
olddlevel = dlevel;
#endif
doit:
if (cmd->ucmd.ccmd.cc_true) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 't';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_true,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
/* actually, this spot is rarely reached anymore since the above
* cmd_exec() returns through longjmp(). Hooray for structure.
*/
next_iter:
#ifdef DEBUGGING
dlevel = olddlevel;
#endif
if (cmd->ucmd.ccmd.cc_alt) {
#ifdef DEBUGGING
if (debug) {
debname[dlevel] = 'a';
debdelim[dlevel] = '_';
if (++dlevel >= dlmax)
grow_dlevel();
}
#endif
newsp = cmd_exec(cmd->ucmd.ccmd.cc_alt,gimme && (cmdflags & CF_TERM),sp);
st = stack->ary_array; /* possibly reallocated */
retstr = st[newsp];
}
finish_while:
curspat = oldspat;
if (savestack->ary_fill > oldsave) {
if (cmdflags & CF_TERM) {
for (match = sp + 1; match <= newsp; match++)
st[match] = str_static(st[match]);
retstr = st[newsp];
}
restorelist(oldsave);
}
#ifdef DEBUGGING
dlevel = olddlevel - 1;
#endif
if (cmd->c_type != C_BLOCK)
goto until_loop; /* go back and evaluate conditional again */
}
if (cmdflags & CF_LOOP) {
cmdflags |= CF_COND; /* now test the condition */
#ifdef DEBUGGING
dlevel = entdlevel;
#endif
goto until_loop;
}
next_cmd:
if (cmdflags & CF_ONCE) {
#ifdef DEBUGGING
if (debug & 4) {
tmps = loop_stack[loop_ptr].loop_label;
deb("(Popping label #%d %s)\n",loop_ptr, tmps ? tmps : "");
}
#endif
loop_ptr--;
if ((cmdflags & CF_OPTIMIZE) == CFT_ARRAY &&
savestack->ary_fill > aryoptsave)
restorelist(aryoptsave);
}
cmd = cmd->c_next;
goto tail_recursion_entry;
}
#ifdef DEBUGGING
# ifndef VARARGS
/*VARARGS1*/
deb(pat,a1,a2,a3,a4,a5,a6,a7,a8)
char *pat;
{
register int i;
fprintf(stderr,"%-4ld",(long)curcmd->c_line);
for (i=0; i<dlevel; i++)
fprintf(stderr,"%c%c ",debname[i],debdelim[i]);
fprintf(stderr,pat,a1,a2,a3,a4,a5,a6,a7,a8);
}
# else
/*VARARGS1*/
deb(va_alist)
va_dcl
{
va_list args;
char *pat;
register int i;
va_start(args);
fprintf(stderr,"%-4ld",(long)curcmd->c_line);
for (i=0; i<dlevel; i++)
fprintf(stderr,"%c%c ",debname[i],debdelim[i]);
pat = va_arg(args, char *);
(void) vfprintf(stderr,pat,args);
va_end( args );
}
# endif
#endif
copyopt(cmd,which)
register CMD *cmd;
register CMD *which;
{
cmd->c_flags &= CF_ONCE|CF_COND|CF_LOOP;
cmd->c_flags |= which->c_flags;
cmd->c_short = which->c_short;
cmd->c_slen = which->c_slen;
cmd->c_stab = which->c_stab;
return cmd->c_flags;
}
ARRAY *
saveary(stab)
STAB *stab;
{
register STR *str;
str = Str_new(10,0);
str->str_state = SS_SARY;
str->str_u.str_stab = stab;
if (str->str_ptr) {
Safefree(str->str_ptr);
str->str_len = 0;
}
str->str_ptr = (char*)stab_array(stab);
(void)apush(savestack,str); /* save array ptr */
stab_xarray(stab) = Null(ARRAY*);
return stab_xarray(aadd(stab));
}
HASH *