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
|
/* $RCSfile: cmd.h,v $$Revision: 4.1 $$Date: 92/08/07 17:19:19 $
*
* Copyright (c) 1991, 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.
*
* $Log: cmd.h,v $
* Revision 4.1 92/08/07 17:19:19 lwall
* Stage 6 Snapshot
*
* Revision 4.0.1.2 92/06/08 12:01:02 lwall
* patch20: removed implicit int declarations on funcions
*
* Revision 4.0.1.1 91/06/07 10:28:50 lwall
* patch4: new copyright notice
* patch4: length($`), length($&), length($') now optimized to avoid string copy
*
* Revision 4.0 91/03/20 01:04:34 lwall
* 4.0 baseline.
*
*/
struct acop {
GV *acop_gv; /* a symbol table entry */
OP *acop_expr; /* any associated expression */
};
struct ccop {
OP *ccop_true; /* normal code to do on if and while */
OP *ccop_alt; /* else cmd ptr or continue code */
};
struct scop {
OP **scop_next; /* array of pointers to commands */
short scop_offset; /* first value - 1 */
short scop_max; /* last value + 1 */
};
struct cop {
BASEOP
OP *cop_expr; /* conditional expression */
OP *cop_head; /* head of this command list */
SV *cop_short; /* string to match as shortcut */
GV *cop_gv; /* a symbol table entry, mostly for fp */
char *cop_label; /* label for this construct */
union uop {
struct acop acop; /* normal command */
struct ccop ccop; /* compound command */
struct scop scop; /* switch command */
} uop;
U32 cop_seq; /* parse sequence number */
short cop_slen; /* len of cop_short, if not null */
VOL short cop_flags; /* optimization flags--see above */
HV * cop_stash; /* package line was compiled in */
GV * cop_filegv; /* file the following line # is from */
line_t cop_line; /* line # of this command */
char cop_type; /* what this command does */
};
#define Nullcop Null(COP*)
/*
* Here we have some enormously heavy (or at least ponderous) wizardry.
*/
/* subroutine context */
struct block_sub {
CV * cv;
GV * gv;
GV * dfoutgv;
AV * savearray;
AV * argarray;
AV * comppad;
U16 olddepth;
U8 hasargs;
};
#define PUSHSUB(cx) \
cx->blk_sub.cv = cv; \
cx->blk_sub.gv = gv; \
cx->blk_sub.olddepth = CvDEPTH(cv); \
cx->blk_sub.hasargs = hasargs;
#define PUSHFORMAT(cx) \
cx->blk_sub.cv = cv; \
cx->blk_sub.gv = gv; \
cx->blk_sub.dfoutgv = defoutgv; \
cx->blk_sub.hasargs = 0;
#define POPSUB(cx) \
if (cx->blk_sub.hasargs) { /* put back old @_ */ \
av_free(cx->blk_sub.argarray); \
GvAV(defgv) = cx->blk_sub.savearray; \
} \
if (!(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth)) { \
if (CvDELETED(cx->blk_sub.cv)) \
sv_free((SV*)cx->blk_sub.cv); \
}
#define POPFORMAT(cx) \
defoutgv = cx->blk_sub.dfoutgv;
/* eval context */
struct block_eval {
I32 old_in_eval;
I32 old_op_type;
char * old_name;
OP * old_eval_root;
};
#define PUSHEVAL(cx,n) \
cx->blk_eval.old_in_eval = in_eval; \
cx->blk_eval.old_op_type = op->op_type; \
cx->blk_eval.old_name = n; \
cx->blk_eval.old_eval_root = eval_root;
#define POPEVAL(cx) \
in_eval = cx->blk_eval.old_in_eval; \
optype = cx->blk_eval.old_op_type; \
eval_root = cx->blk_eval.old_eval_root;
/* loop context */
struct block_loop {
char * label;
I32 resetsp;
OP * redo_op;
OP * next_op;
OP * last_op;
SV ** itervar;
SV * itersave;
AV * iterary;
I32 iterix;
};
#define PUSHLOOP(cx, ivar, s) \
cx->blk_loop.label = curcop->cop_label; \
cx->blk_loop.resetsp = s - stack_base; \
cx->blk_loop.redo_op = cLOOP->op_redoop; \
cx->blk_loop.next_op = cLOOP->op_nextop; \
cx->blk_loop.last_op = cLOOP->op_lastop; \
cx->blk_loop.itervar = ivar; \
if (ivar) \
cx->blk_loop.itersave = *cx->blk_loop.itervar;
#define POPLOOP(cx) \
newsp = stack_base + cx->blk_loop.resetsp; \
if (cx->blk_loop.itervar) \
*cx->blk_loop.itervar = cx->blk_loop.itersave;
/* context common to subroutines, evals and loops */
struct block {
I32 blku_oldsp; /* stack pointer to copy stuff down to */
COP * blku_oldcop; /* old curcop pointer */
I32 blku_oldretsp; /* return stack index */
I32 blku_oldmarksp; /* mark stack index */
I32 blku_oldscopesp; /* scope stack index */
PMOP * blku_oldpm; /* values of pattern match vars */
U8 blku_gimme; /* is this block running in list context? */
union {
struct block_sub blku_sub;
struct block_eval blku_eval;
struct block_loop blku_loop;
} blk_u;
};
#define blk_oldsp cx_u.cx_blk.blku_oldsp
#define blk_oldcop cx_u.cx_blk.blku_oldcop
#define blk_oldretsp cx_u.cx_blk.blku_oldretsp
#define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
#define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
#define blk_oldpm cx_u.cx_blk.blku_oldpm
#define blk_gimme cx_u.cx_blk.blku_gimme
#define blk_sub cx_u.cx_blk.blk_u.blku_sub
#define blk_eval cx_u.cx_blk.blk_u.blku_eval
#define blk_loop cx_u.cx_blk.blk_u.blku_loop
/* Enter a block. */
#define PUSHBLOCK(cx,t,s) CXINC, cx = &cxstack[cxstack_ix], \
cx->cx_type = t, \
cx->blk_oldsp = s - stack_base, \
cx->blk_oldcop = curcop, \
cx->blk_oldmarksp = markstack_ptr - markstack, \
cx->blk_oldscopesp = scopestack_ix, \
cx->blk_oldretsp = retstack_ix, \
cx->blk_oldpm = curpm, \
cx->blk_gimme = gimme; \
if (debug & 4) \
fprintf(stderr,"Entering block %d, type %d\n", \
cxstack_ix, t);
/* Exit a block (RETURN and LAST). */
#define POPBLOCK(cx) cx = &cxstack[cxstack_ix--], \
newsp = stack_base + cx->blk_oldsp, \
curcop = cx->blk_oldcop, \
markstack_ptr = markstack + cx->blk_oldmarksp, \
scopestack_ix = cx->blk_oldscopesp, \
retstack_ix = cx->blk_oldretsp, \
curpm = cx->blk_oldpm, \
gimme = cx->blk_gimme; \
if (debug & 4) \
fprintf(stderr,"Leaving block %d, type %d\n", \
cxstack_ix+1,cx->cx_type);
/* Continue a block elsewhere (NEXT and REDO). */
#define TOPBLOCK(cx) cx = &cxstack[cxstack_ix], \
stack_sp = stack_base + cx->blk_oldsp, \
markstack_ptr = markstack + cx->blk_oldmarksp, \
scopestack_ix = cx->blk_oldscopesp, \
retstack_ix = cx->blk_oldretsp
/* substitution context */
struct subst {
I32 sbu_iters;
I32 sbu_maxiters;
I32 sbu_safebase;
I32 sbu_once;
char * sbu_orig;
SV * sbu_dstr;
SV * sbu_targ;
char * sbu_s;
char * sbu_m;
char * sbu_strend;
char * sbu_subbase;
};
#define sb_iters cx_u.cx_subst.sbu_iters
#define sb_maxiters cx_u.cx_subst.sbu_maxiters
#define sb_safebase cx_u.cx_subst.sbu_safebase
#define sb_once cx_u.cx_subst.sbu_once
#define sb_orig cx_u.cx_subst.sbu_orig
#define sb_dstr cx_u.cx_subst.sbu_dstr
#define sb_targ cx_u.cx_subst.sbu_targ
#define sb_s cx_u.cx_subst.sbu_s
#define sb_m cx_u.cx_subst.sbu_m
#define sb_strend cx_u.cx_subst.sbu_strend
#define sb_subbase cx_u.cx_subst.sbu_subbase
#define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
cx->sb_iters = iters, \
cx->sb_maxiters = maxiters, \
cx->sb_safebase = safebase, \
cx->sb_once = once, \
cx->sb_orig = orig, \
cx->sb_dstr = dstr, \
cx->sb_targ = targ, \
cx->sb_s = s, \
cx->sb_m = m, \
cx->sb_strend = strend, \
cx->cx_type = CXt_SUBST
#define POPSUBST(cx) cxstack_ix--
struct context {
I32 cx_type; /* what kind of context this is */
union {
struct block cx_blk;
struct subst cx_subst;
} cx_u;
};
#define CXt_NULL 0
#define CXt_SUB 1
#define CXt_EVAL 2
#define CXt_LOOP 3
#define CXt_SUBST 4
#define CXt_BLOCK 5
#define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
/* "gimme" values */
#define G_SCALAR 0
#define G_ARRAY 1
|
