|
69
|
1 /* Evaluate compiled expression nodes */
|
|
|
2
|
|
|
3 #include <stdio.h>
|
|
|
4 #include <ctype.h>
|
|
|
5 #include "string.h"
|
|
|
6
|
|
|
7 #include "PROTO.h"
|
|
|
8 #include "object.h"
|
|
|
9 #include "objimpl.h"
|
|
|
10 #include "intobject.h"
|
|
|
11 #include "stringobject.h"
|
|
|
12 #include "tupleobject.h"
|
|
|
13 #include "listobject.h"
|
|
|
14 #include "dictobject.h"
|
|
|
15 #include "builtinobject.h"
|
|
|
16 #include "methodobject.h"
|
|
|
17 #include "moduleobject.h"
|
|
|
18 #include "context.h"
|
|
|
19 #include "funcobject.h"
|
|
|
20 #include "classobject.h"
|
|
|
21 #include "token.h"
|
|
|
22 #include "graminit.h"
|
|
|
23 #include "run.h"
|
|
|
24 #include "import.h"
|
|
|
25 #include "support.h"
|
|
|
26 #include "sysmodule.h"
|
|
|
27 #include "compile.h"
|
|
|
28 #include "opcode.h"
|
|
|
29
|
|
|
30 /* List access macros */
|
|
|
31 #ifdef NDEBUG
|
|
|
32 #define GETITEM(v, i) GETLISTITEM((listobject *)(v), (i))
|
|
|
33 #define GETITEMNAME(v, i) GETSTRINGVALUE((stringobject *)GETITEM((v), (i)))
|
|
|
34 #else
|
|
|
35 #define GETITEM(v, i) getlistitem((v), (i))
|
|
|
36 #define GETITEMNAME(v, i) getstringvalue(getlistitem((v), (i)))
|
|
|
37 #endif
|
|
|
38
|
|
|
39 typedef struct {
|
|
|
40 int b_type; /* what kind of block this is */
|
|
|
41 int b_handler; /* where to jump to find handler */
|
|
|
42 int b_level; /* value stack level to pop to */
|
|
|
43 } block;
|
|
|
44
|
|
|
45 typedef struct _frame {
|
|
|
46 OB_HEAD
|
|
|
47 struct _frame *f_back; /* previous frame, or NULL */
|
|
|
48 codeobject *f_code; /* code segment */
|
|
|
49 object *f_locals; /* local symbol table (dictobject) */
|
|
|
50 object *f_globals; /* global symbol table (dictobject) */
|
|
|
51 object **f_valuestack; /* malloc'ed array */
|
|
|
52 block *f_blockstack; /* malloc'ed array */
|
|
|
53 int f_nvalues; /* size of f_valuestack */
|
|
|
54 int f_nblocks; /* size of f_blockstack */
|
|
|
55 int f_ivalue; /* index in f_valuestack */
|
|
|
56 int f_iblock; /* index in f_blockstack */
|
|
|
57 int f_nexti; /* index in f_code (next instruction) */
|
|
|
58 } frameobject;
|
|
|
59
|
|
|
60 #define is_frameobject(op) ((op)->ob_type == &Frametype)
|
|
|
61
|
|
|
62 static void
|
|
|
63 frame_dealloc(f)
|
|
|
64 frameobject *f;
|
|
|
65 {
|
|
|
66 XDECREF(f->f_back);
|
|
|
67 XDECREF(f->f_code);
|
|
|
68 XDECREF(f->f_locals);
|
|
|
69 XDECREF(f->f_globals);
|
|
|
70 XDEL(f->f_valuestack);
|
|
|
71 XDEL(f->f_blockstack);
|
|
|
72 DEL(f);
|
|
|
73 }
|
|
|
74 typeobject Frametype = {
|
|
|
75 OB_HEAD_INIT(&Typetype)
|
|
|
76 0,
|
|
|
77 "frame",
|
|
|
78 sizeof(frameobject),
|
|
|
79 0,
|
|
|
80 frame_dealloc, /*tp_dealloc*/
|
|
|
81 0, /*tp_print*/
|
|
|
82 0, /*tp_getattr*/
|
|
|
83 0, /*tp_setattr*/
|
|
|
84 0, /*tp_compare*/
|
|
|
85 0, /*tp_repr*/
|
|
|
86 0, /*tp_as_number*/
|
|
|
87 0, /*tp_as_sequence*/
|
|
|
88 0, /*tp_as_mapping*/
|
|
|
89 };
|
|
|
90
|
|
|
91 static frameobject * newframeobject PROTO(
|
|
|
92 (frameobject *, codeobject *, object *, object *, int, int));
|
|
|
93
|
|
|
94 static frameobject *
|
|
|
95 newframeobject(back, code, locals, globals, nvalues, nblocks)
|
|
|
96 frameobject *back;
|
|
|
97 codeobject *code;
|
|
|
98 object *locals;
|
|
|
99 object *globals;
|
|
|
100 int nvalues;
|
|
|
101 int nblocks;
|
|
|
102 {
|
|
|
103 frameobject *f;
|
|
|
104 if ((back != NULL && !is_frameobject(back)) ||
|
|
|
105 code == NULL || !is_codeobject(code) ||
|
|
|
106 locals == NULL || !is_dictobject(locals) ||
|
|
|
107 globals == NULL || !is_dictobject(globals) ||
|
|
|
108 nvalues < 0 || nblocks < 0) {
|
|
|
109 err_badcall();
|
|
|
110 return NULL;
|
|
|
111 }
|
|
|
112 f = NEWOBJ(frameobject, &Frametype);
|
|
|
113 if (f != NULL) {
|
|
|
114 if (back)
|
|
|
115 INCREF(back);
|
|
|
116 f->f_back = back;
|
|
|
117 INCREF(code);
|
|
|
118 f->f_code = code;
|
|
|
119 INCREF(locals);
|
|
|
120 f->f_locals = locals;
|
|
|
121 INCREF(globals);
|
|
|
122 f->f_globals = globals;
|
|
|
123 f->f_valuestack = NEW(object *, nvalues+1);
|
|
|
124 f->f_blockstack = NEW(block, nblocks+1);
|
|
|
125 f->f_nvalues = nvalues;
|
|
|
126 f->f_nblocks = nblocks;
|
|
|
127 f->f_ivalue = f->f_iblock = f->f_nexti = 0;
|
|
|
128 if (f->f_valuestack == NULL || f->f_blockstack == NULL) {
|
|
|
129 err_nomem();
|
|
|
130 DECREF(f);
|
|
|
131 f = NULL;
|
|
|
132 }
|
|
|
133 }
|
|
|
134 return f;
|
|
|
135 }
|
|
|
136
|
|
|
137 #define Push(f, v) ((f)->f_valuestack[(f)->f_ivalue++] = (v))
|
|
|
138 #define Pop(f) ((f)->f_valuestack[--(f)->f_ivalue])
|
|
|
139 #define Top(f) ((f)->f_valuestack[(f)->f_ivalue-1])
|
|
|
140 #define Empty(f) ((f)->f_ivalue == 0)
|
|
|
141 #define Full(f) ((f)->f_ivalue == (f)->f_nvalues)
|
|
|
142 #define Nextbyte(f) (GETSTRINGVALUE((f)->f_code->co_code)[(f)->f_nexti++])
|
|
|
143 #define Peekbyte(f) (GETSTRINGVALUE((f)->f_code->co_code)[(f)->f_nexti])
|
|
|
144 #define Prevbyte(f) (GETSTRINGVALUE((f)->f_code->co_code)[(f)->f_nexti-1])
|
|
|
145 #define Jumpto(f, x) ((f)->f_nexti = (x))
|
|
|
146 #define Jumpby(f, x) ((f)->f_nexti += (x))
|
|
|
147 #define Getconst(f, i) (GETITEM((f)->f_code->co_consts, (i)))
|
|
|
148 #define Getname(f, i) (GETITEMNAME((f)->f_code->co_names, (i)))
|
|
|
149
|
|
|
150 /* Corresponding functions, for debugging */
|
|
|
151
|
|
|
152 static void
|
|
|
153 push(f, v)
|
|
|
154 frameobject *f;
|
|
|
155 object *v;
|
|
|
156 {
|
|
|
157 if (Full(f)) {
|
|
|
158 printf("stack overflow\n");
|
|
|
159 abort();
|
|
|
160 }
|
|
|
161 Push(f, v);
|
|
|
162 }
|
|
|
163
|
|
|
164 static object *
|
|
|
165 pop(f)
|
|
|
166 frameobject *f;
|
|
|
167 {
|
|
|
168 if (Empty(f)) {
|
|
|
169 printf("stack underflow\n");
|
|
|
170 abort();
|
|
|
171 }
|
|
|
172 return Pop(f);
|
|
|
173 }
|
|
|
174
|
|
|
175 static object *
|
|
|
176 top(f)
|
|
|
177 frameobject *f;
|
|
|
178 {
|
|
|
179 if (Empty(f)) {
|
|
|
180 printf("stack underflow\n");
|
|
|
181 abort();
|
|
|
182 }
|
|
|
183 return Top(f);
|
|
|
184 }
|
|
|
185
|
|
|
186 static int
|
|
|
187 nextbyte(f)
|
|
|
188 frameobject *f;
|
|
|
189 {
|
|
|
190 stringobject *code = (f)->f_code->co_code;
|
|
|
191 if (f->f_nexti >= getstringsize((object *)code)) {
|
|
|
192 printf("ran off end of instructions\n");
|
|
|
193 abort();
|
|
|
194 }
|
|
|
195 return GETSTRINGVALUE(code)[f->f_nexti++];
|
|
|
196 }
|
|
|
197
|
|
|
198 /* Tracing versions */
|
|
|
199
|
|
|
200 static void
|
|
|
201 trace_push(f, v)
|
|
|
202 frameobject *f;
|
|
|
203 object *v;
|
|
|
204 {
|
|
|
205 printf("\tpush ");
|
|
|
206 printobject(v, stdout, 0);
|
|
|
207 printf("\n");
|
|
|
208 push(f, v);
|
|
|
209 }
|
|
|
210
|
|
|
211 static object *
|
|
|
212 trace_pop(f)
|
|
|
213 frameobject *f;
|
|
|
214 {
|
|
|
215 object *v;
|
|
|
216 v = pop(f);
|
|
|
217 printf("\tpop ");
|
|
|
218 printobject(v, stdout, 0);
|
|
|
219 printf("\n");
|
|
|
220 return v;
|
|
|
221 }
|
|
|
222
|
|
|
223 static object *
|
|
|
224 trace_top(f)
|
|
|
225 frameobject *f;
|
|
|
226 {
|
|
|
227 object *v;
|
|
|
228 v = top(f);
|
|
|
229 printf("\ttop ");
|
|
|
230 printobject(v, stdout, 0);
|
|
|
231 printf("\n");
|
|
|
232 return v;
|
|
|
233 }
|
|
|
234
|
|
|
235 static int
|
|
|
236 trace_nextop(f)
|
|
|
237 frameobject *f;
|
|
|
238 {
|
|
|
239 int op;
|
|
|
240 int arg;
|
|
|
241
|
|
|
242 printf("%d: ", f->f_nexti);
|
|
|
243 op = nextbyte(f);
|
|
|
244 if (op < HAVE_ARGUMENT)
|
|
|
245 printf("op %3d\n", op);
|
|
|
246 else {
|
|
|
247 arg = Peekbyte(f);
|
|
|
248 printf("op %3d arg %3d\n", op, arg);
|
|
|
249 }
|
|
|
250 return op;
|
|
|
251 }
|
|
|
252
|
|
|
253 /* Block management */
|
|
|
254
|
|
|
255 static void
|
|
|
256 setup_block(f, type, handler)
|
|
|
257 frameobject *f;
|
|
|
258 int type;
|
|
|
259 int handler;
|
|
|
260 {
|
|
|
261 block *b;
|
|
|
262 if (f->f_iblock >= f->f_nblocks) {
|
|
|
263 printf("block stack overflow\n");
|
|
|
264 abort();
|
|
|
265 }
|
|
|
266 b = &f->f_blockstack[f->f_iblock++];
|
|
|
267 b->b_type = type;
|
|
|
268 b->b_level = f->f_ivalue;
|
|
|
269 b->b_handler = handler + f->f_nexti;
|
|
|
270 }
|
|
|
271
|
|
|
272 static block *
|
|
|
273 pop_block(f)
|
|
|
274 frameobject *f;
|
|
|
275 {
|
|
|
276 block *b;
|
|
|
277 if (f->f_iblock <= 0) {
|
|
|
278 printf("block stack underflow\n");
|
|
|
279 abort();
|
|
|
280 }
|
|
|
281 b = &f->f_blockstack[--f->f_iblock];
|
|
|
282 while (f->f_ivalue > b->b_level) {
|
|
|
283 object *v = Pop(f);
|
|
|
284 XDECREF(v);
|
|
|
285 }
|
|
|
286 return b;
|
|
|
287 }
|
|
|
288
|
|
|
289
|
|
|
290 /* XXX Mixing "print ...," and direct file I/O on stdin/stdout
|
|
|
291 XXX has some bad consequences. The needspace flag should
|
|
|
292 XXX really be part of the file object. */
|
|
|
293
|
|
|
294 static int needspace;
|
|
|
295
|
|
|
296 void
|
|
|
297 flushline()
|
|
|
298 {
|
|
|
299 FILE *fp = sysgetfile("stdout", stdout);
|
|
|
300 if (needspace) {
|
|
|
301 fprintf(fp, "\n");
|
|
|
302 needspace = 0;
|
|
|
303 }
|
|
|
304 }
|
|
|
305
|
|
|
306 static object *
|
|
|
307 checkerror(ctx, v)
|
|
|
308 context *ctx;
|
|
|
309 object *v;
|
|
|
310 {
|
|
|
311 if (v == NULL)
|
|
|
312 puterrno(ctx);
|
|
|
313 return v;
|
|
|
314 }
|
|
|
315
|
|
|
316 static object *
|
|
|
317 add(ctx, v, w)
|
|
|
318 context *ctx;
|
|
|
319 object *v, *w;
|
|
|
320 {
|
|
|
321 if (v->ob_type->tp_as_number != NULL)
|
|
|
322 v = (*v->ob_type->tp_as_number->nb_add)(v, w);
|
|
|
323 else if (v->ob_type->tp_as_sequence != NULL)
|
|
|
324 v = (*v->ob_type->tp_as_sequence->sq_concat)(v, w);
|
|
|
325 else {
|
|
|
326 type_error(ctx, "+ not supported by operands");
|
|
|
327 return NULL;
|
|
|
328 }
|
|
|
329 return checkerror(ctx, v);
|
|
|
330 }
|
|
|
331
|
|
|
332 static object *
|
|
|
333 sub(ctx, v, w)
|
|
|
334 context *ctx;
|
|
|
335 object *v, *w;
|
|
|
336 {
|
|
|
337 if (v->ob_type->tp_as_number != NULL)
|
|
|
338 return checkerror(ctx,
|
|
|
339 (*v->ob_type->tp_as_number->nb_subtract)(v, w));
|
|
|
340 type_error(ctx, "bad operand type(s) for -");
|
|
|
341 return NULL;
|
|
|
342 }
|
|
|
343
|
|
|
344 static object *
|
|
|
345 mul(ctx, v, w)
|
|
|
346 context *ctx;
|
|
|
347 object *v, *w;
|
|
|
348 {
|
|
|
349 typeobject *tp;
|
|
|
350 if (is_intobject(v) && w->ob_type->tp_as_sequence != NULL) {
|
|
|
351 /* int*sequence -- swap v and w */
|
|
|
352 object *tmp = v;
|
|
|
353 v = w;
|
|
|
354 w = tmp;
|
|
|
355 }
|
|
|
356 tp = v->ob_type;
|
|
|
357 if (tp->tp_as_number != NULL)
|
|
|
358 return checkerror(ctx, (*tp->tp_as_number->nb_multiply)(v, w));
|
|
|
359 if (tp->tp_as_sequence != NULL) {
|
|
|
360 if (!is_intobject(w)) {
|
|
|
361 type_error(ctx, "can't multiply sequence with non-int");
|
|
|
362 return NULL;
|
|
|
363 }
|
|
|
364 if (tp->tp_as_sequence->sq_repeat == NULL) {
|
|
|
365 type_error(ctx, "sequence does not support *");
|
|
|
366 return NULL;
|
|
|
367 }
|
|
|
368 return checkerror(ctx, (*tp->tp_as_sequence->sq_repeat)
|
|
|
369 (v, (int)getintvalue(w)));
|
|
|
370 }
|
|
|
371 type_error(ctx, "bad operand type(s) for *");
|
|
|
372 return NULL;
|
|
|
373 }
|
|
|
374
|
|
|
375 static object *
|
|
|
376 div(ctx, v, w)
|
|
|
377 context *ctx;
|
|
|
378 object *v, *w;
|
|
|
379 {
|
|
|
380 if (v->ob_type->tp_as_number != NULL)
|
|
|
381 return checkerror(ctx,
|
|
|
382 (*v->ob_type->tp_as_number->nb_divide)(v, w));
|
|
|
383 type_error(ctx, "bad operand type(s) for /");
|
|
|
384 return NULL;
|
|
|
385 }
|
|
|
386
|
|
|
387 static object *
|
|
|
388 rem(ctx, v, w)
|
|
|
389 context *ctx;
|
|
|
390 object *v, *w;
|
|
|
391 {
|
|
|
392 if (v->ob_type->tp_as_number != NULL)
|
|
|
393 return checkerror(ctx,
|
|
|
394 (*v->ob_type->tp_as_number->nb_remainder)(v, w));
|
|
|
395 type_error(ctx, "bad operand type(s) for %");
|
|
|
396 return NULL;
|
|
|
397 }
|
|
|
398
|
|
|
399 static object *
|
|
|
400 neg(ctx, v)
|
|
|
401 context *ctx;
|
|
|
402 object *v;
|
|
|
403 {
|
|
|
404 if (v->ob_type->tp_as_number != NULL)
|
|
|
405 return checkerror(ctx,
|
|
|
406 (*v->ob_type->tp_as_number->nb_negative)(v));
|
|
|
407 type_error(ctx, "bad operand type(s) for unary -");
|
|
|
408 return NULL;
|
|
|
409 }
|
|
|
410
|
|
|
411 static object *
|
|
|
412 pos(ctx, v)
|
|
|
413 context *ctx;
|
|
|
414 object *v;
|
|
|
415 {
|
|
|
416 if (v->ob_type->tp_as_number != NULL)
|
|
|
417 return checkerror(ctx,
|
|
|
418 (*v->ob_type->tp_as_number->nb_positive)(v));
|
|
|
419 type_error(ctx, "bad operand type(s) for unary +");
|
|
|
420 return NULL;
|
|
|
421 }
|
|
|
422
|
|
|
423 static object *
|
|
|
424 not(ctx, v)
|
|
|
425 context *ctx;
|
|
|
426 object *v;
|
|
|
427 {
|
|
|
428 int outcome = testbool(ctx, v);
|
|
|
429 if (ctx->ctx_exception)
|
|
|
430 return NULL;
|
|
|
431 return checkerror(ctx, newintobject((long) !outcome));
|
|
|
432 }
|
|
|
433
|
|
|
434 static object *
|
|
|
435 call_builtin(ctx, func, args)
|
|
|
436 context *ctx;
|
|
|
437 object *func;
|
|
|
438 object *args;
|
|
|
439 {
|
|
|
440 if (is_builtinobject(func)) {
|
|
|
441 function funcptr = getbuiltinfunction(func);
|
|
|
442 return (*funcptr)(ctx, args);
|
|
|
443 }
|
|
|
444 if (is_methodobject(func)) {
|
|
|
445 method meth = getmethod(func);
|
|
|
446 object *self = getself(func);
|
|
|
447 return checkerror(ctx, (*meth)(self, args));
|
|
|
448 }
|
|
|
449 if (is_classobject(func)) {
|
|
|
450 if (args != NULL) {
|
|
|
451 type_error(ctx, "classobject() allows no arguments");
|
|
|
452 return NULL;
|
|
|
453 }
|
|
|
454 return checkerror(ctx, newclassmemberobject(func));
|
|
|
455 }
|
|
|
456 type_error(ctx, "call of non-function");
|
|
|
457 return NULL;
|
|
|
458 }
|
|
|
459
|
|
|
460 static object *eval_compiled PROTO((context *, codeobject *, object *, int));
|
|
|
461
|
|
|
462 /* XXX Eventually, this should not call eval_compiled recursively
|
|
|
463 but create a new frame */
|
|
|
464
|
|
|
465 static object *
|
|
|
466 call_function(ctx, func, args)
|
|
|
467 context *ctx;
|
|
|
468 object *func;
|
|
|
469 object *args;
|
|
|
470 {
|
|
|
471 object *newargs = NULL;
|
|
|
472 object *savelocals, *newlocals, *saveglobals;
|
|
|
473 object *c, *v;
|
|
|
474
|
|
|
475 if (is_classmethodobject(func)) {
|
|
|
476 object *self = classmethodgetself(func);
|
|
|
477 func = classmethodgetfunc(func);
|
|
|
478 if (args == NULL) {
|
|
|
479 args = self;
|
|
|
480 }
|
|
|
481 else {
|
|
|
482 newargs = checkerror(ctx, newtupleobject(2));
|
|
|
483 if (newargs == NULL)
|
|
|
484 return NULL;
|
|
|
485 INCREF(self);
|
|
|
486 INCREF(args);
|
|
|
487 settupleitem(newargs, 0, self);
|
|
|
488 settupleitem(newargs, 1, args);
|
|
|
489 args = newargs;
|
|
|
490 }
|
|
|
491 }
|
|
|
492 else {
|
|
|
493 if (!is_funcobject(func)) {
|
|
|
494 type_error(ctx, "call of non-function");
|
|
|
495 return NULL;
|
|
|
496 }
|
|
|
497 }
|
|
|
498
|
|
|
499 c = checkerror(ctx, getfunccode(func));
|
|
|
500 if (c == NULL) {
|
|
|
501 XDECREF(newargs);
|
|
|
502 return NULL;
|
|
|
503 }
|
|
|
504 if (!is_codeobject(c)) {
|
|
|
505 printf("Bad code\n");
|
|
|
506 abort();
|
|
|
507 }
|
|
|
508 newlocals = checkerror(ctx, newdictobject());
|
|
|
509 if (newlocals == NULL) {
|
|
|
510 XDECREF(newargs);
|
|
|
511 return NULL;
|
|
|
512 }
|
|
|
513
|
|
|
514 savelocals = ctx->ctx_locals;
|
|
|
515 ctx->ctx_locals = newlocals;
|
|
|
516 saveglobals = ctx->ctx_globals;
|
|
|
517 ctx->ctx_globals = getfuncglobals(func);
|
|
|
518
|
|
|
519 v = eval_compiled(ctx, (codeobject *)c, args, 1);
|
|
|
520
|
|
|
521 DECREF(ctx->ctx_locals);
|
|
|
522 ctx->ctx_locals = savelocals;
|
|
|
523 ctx->ctx_globals = saveglobals;
|
|
|
524
|
|
|
525 XDECREF(newargs);
|
|
|
526
|
|
|
527 return v;
|
|
|
528 }
|
|
|
529
|
|
|
530 static object *
|
|
|
531 apply_subscript(ctx, v, w)
|
|
|
532 context *ctx;
|
|
|
533 object *v, *w;
|
|
|
534 {
|
|
|
535 typeobject *tp = v->ob_type;
|
|
|
536 if (tp->tp_as_sequence == NULL && tp->tp_as_mapping == NULL) {
|
|
|
537 type_error(ctx, "unsubscriptable object");
|
|
|
538 return NULL;
|
|
|
539 }
|
|
|
540 if (tp->tp_as_sequence != NULL) {
|
|
|
541 int i;
|
|
|
542 if (!is_intobject(w)) {
|
|
|
543 type_error(ctx, "sequence subscript not int");
|
|
|
544 return NULL;
|
|
|
545 }
|
|
|
546 i = getintvalue(w);
|
|
|
547 return checkerror(ctx, (*tp->tp_as_sequence->sq_item)(v, i));
|
|
|
548 }
|
|
|
549 return checkerror(ctx, (*tp->tp_as_mapping->mp_subscript)(v, w));
|
|
|
550 }
|
|
|
551
|
|
|
552 static object *
|
|
|
553 loop_subscript(ctx, v, w)
|
|
|
554 context *ctx;
|
|
|
555 object *v, *w;
|
|
|
556 {
|
|
|
557 sequence_methods *sq = v->ob_type->tp_as_sequence;
|
|
|
558 int i, n;
|
|
|
559 if (sq == NULL) {
|
|
|
560 type_error(ctx, "loop over non-sequence");
|
|
|
561 return NULL;
|
|
|
562 }
|
|
|
563 i = getintvalue(w);
|
|
|
564 n = (*sq->sq_length)(v);
|
|
|
565 if (i >= n)
|
|
|
566 return NULL; /* End of loop */
|
|
|
567 return checkerror(ctx, (*sq->sq_item)(v, i));
|
|
|
568 }
|
|
|
569
|
|
|
570 static int
|
|
|
571 slice_index(ctx, v, isize, pi)
|
|
|
572 context *ctx;
|
|
|
573 object *v;
|
|
|
574 int isize;
|
|
|
575 int *pi;
|
|
|
576 {
|
|
|
577 if (v != NULL) {
|
|
|
578 if (!is_intobject(v)) {
|
|
|
579 type_error(ctx, "slice index must be int");
|
|
|
580 return 0;
|
|
|
581 }
|
|
|
582 *pi = getintvalue(v);
|
|
|
583 if (*pi < 0)
|
|
|
584 *pi += isize;
|
|
|
585 }
|
|
|
586 return 1;
|
|
|
587 }
|
|
|
588
|
|
|
589 static object *
|
|
|
590 apply_slice(ctx, u, v, w) /* u[v:w] */
|
|
|
591 context *ctx;
|
|
|
592 object *u, *v, *w;
|
|
|
593 {
|
|
|
594 typeobject *tp = u->ob_type;
|
|
|
595 int ilow, ihigh, isize;
|
|
|
596 if (tp->tp_as_sequence == NULL) {
|
|
|
597 type_error(ctx, "only sequences can be sliced");
|
|
|
598 return NULL;
|
|
|
599 }
|
|
|
600 ilow = 0;
|
|
|
601 isize = ihigh = (*tp->tp_as_sequence->sq_length)(u);
|
|
|
602 if (!slice_index(ctx, v, isize, &ilow))
|
|
|
603 return NULL;
|
|
|
604 if (!slice_index(ctx, w, isize, &ihigh))
|
|
|
605 return NULL;
|
|
|
606 return checkerror(ctx, (*tp->tp_as_sequence->sq_slice)(u, ilow, ihigh));
|
|
|
607 }
|
|
|
608 static void
|
|
|
609 assign_subscript(ctx, w, key, v)
|
|
|
610 context *ctx;
|
|
|
611 object *w;
|
|
|
612 object *key;
|
|
|
613 object *v;
|
|
|
614 {
|
|
|
615 typeobject *tp = w->ob_type;
|
|
|
616 sequence_methods *sq;
|
|
|
617 mapping_methods *mp;
|
|
|
618 int (*func)();
|
|
|
619 int err;
|
|
|
620 if ((sq = tp->tp_as_sequence) != NULL &&
|
|
|
621 (func = sq->sq_ass_item) != NULL) {
|
|
|
622 if (!is_intobject(key)) {
|
|
|
623 type_error(ctx, "sequence subscript must be integer");
|
|
|
624 return;
|
|
|
625 }
|
|
|
626 err = (*func)(w, (int)getintvalue(key), v);
|
|
|
627 }
|
|
|
628 else if ((mp = tp->tp_as_mapping) != NULL &&
|
|
|
629 (func = mp->mp_ass_subscript) != NULL) {
|
|
|
630 err = (*func)(w, key, v);
|
|
|
631 }
|
|
|
632 else {
|
|
|
633 type_error(ctx, "can't assign to this subscripted object");
|
|
|
634 return;
|
|
|
635 }
|
|
|
636 if (err != 0)
|
|
|
637 puterrno(ctx);
|
|
|
638 }
|
|
|
639
|
|
|
640 static void
|
|
|
641 assign_slice(ctx, u, v, w, x) /* u[v:w] = x */
|
|
|
642 context *ctx;
|
|
|
643 object *u, *v, *w, *x;
|
|
|
644 {
|
|
|
645 typeobject *tp = u->ob_type;
|
|
|
646 int ilow, ihigh, isize;
|
|
|
647 if (tp->tp_as_sequence == NULL ||
|
|
|
648 tp->tp_as_sequence->sq_ass_slice == NULL) {
|
|
|
649 type_error(ctx, "unassignable slice");
|
|
|
650 return;
|
|
|
651 }
|
|
|
652 ilow = 0;
|
|
|
653 isize = ihigh = (*tp->tp_as_sequence->sq_length)(u);
|
|
|
654 if (!slice_index(ctx, v, isize, &ilow))
|
|
|
655 return;
|
|
|
656 if (!slice_index(ctx, w, isize, &ihigh))
|
|
|
657 return;
|
|
|
658 if ((*tp->tp_as_sequence->sq_ass_slice)(u, ilow, ihigh, x) != 0)
|
|
|
659 puterrno(ctx);
|
|
|
660 }
|
|
|
661
|
|
|
662 static int
|
|
|
663 cmp_exception(err, v)
|
|
|
664 object *err, *v;
|
|
|
665 {
|
|
|
666 if (is_tupleobject(v)) {
|
|
|
667 int i, n;
|
|
|
668 n = gettuplesize(v);
|
|
|
669 for (i = 0; i < n; i++) {
|
|
|
670 if (err == gettupleitem(v, i))
|
|
|
671 return 1;
|
|
|
672 }
|
|
|
673 return 0;
|
|
|
674 }
|
|
|
675 return err == v;
|
|
|
676 }
|
|
|
677
|
|
|
678 static object *
|
|
|
679 cmp_outcome(ctx, op, v, w)
|
|
|
680 register context *ctx;
|
|
|
681 enum cmp_op op;
|
|
|
682 register object *v;
|
|
|
683 register object *w;
|
|
|
684 {
|
|
|
685 register int cmp;
|
|
|
686 register int res = 0;
|
|
|
687 switch (op) {
|
|
|
688 case IN:
|
|
|
689 case NOT_IN:
|
|
|
690 cmp = cmp_member(ctx, v, w);
|
|
|
691 break;
|
|
|
692 case IS:
|
|
|
693 case IS_NOT:
|
|
|
694 cmp = (v == w);
|
|
|
695 break;
|
|
|
696 case EXC_MATCH:
|
|
|
697 cmp = cmp_exception(v, w);
|
|
|
698 break;
|
|
|
699 default:
|
|
|
700 cmp = cmp_values(ctx, v, w);
|
|
|
701 }
|
|
|
702 if (ctx->ctx_exception)
|
|
|
703 return NULL;
|
|
|
704 switch (op) {
|
|
|
705 case EXC_MATCH:
|
|
|
706 case IS:
|
|
|
707 case IN: res = cmp; break;
|
|
|
708 case IS_NOT:
|
|
|
709 case NOT_IN: res = !cmp; break;
|
|
|
710 case LT: res = cmp < 0; break;
|
|
|
711 case LE: res = cmp <= 0; break;
|
|
|
712 case EQ: res = cmp == 0; break;
|
|
|
713 case NE: res = cmp != 0; break;
|
|
|
714 case GT: res = cmp > 0; break;
|
|
|
715 case GE: res = cmp >= 0; break;
|
|
|
716 /* XXX no default? */
|
|
|
717 }
|
|
|
718 v = res ? True : False;
|
|
|
719 INCREF(v);
|
|
|
720 return v;
|
|
|
721 }
|
|
|
722
|
|
|
723 static object *
|
|
|
724 eval_compiled(ctx, co, arg, needvalue)
|
|
|
725 context *ctx;
|
|
|
726 codeobject *co;
|
|
|
727 object *arg;
|
|
|
728 int needvalue;
|
|
|
729 {
|
|
|
730 frameobject *f;
|
|
|
731 register object *v;
|
|
|
732 register object *w;
|
|
|
733 register object *u;
|
|
|
734 register object *x;
|
|
|
735 char *name;
|
|
|
736 int n, i;
|
|
|
737 enum cmp_op op;
|
|
|
738 FILE *fp;
|
|
|
739 #ifndef NDEBUG
|
|
|
740 int trace = dictlookup(ctx->ctx_globals, "__trace") != NULL;
|
|
|
741 #endif
|
|
|
742
|
|
|
743 f = newframeobject(
|
|
|
744 (frameobject *)NULL, /*back*/
|
|
|
745 co, /*code*/
|
|
|
746 ctx->ctx_locals, /*locals*/
|
|
|
747 ctx->ctx_globals, /*globals*/
|
|
|
748 50, /*nvalues*/
|
|
|
749 20); /*nblocks*/
|
|
|
750 if (f == NULL) {
|
|
|
751 puterrno(ctx);
|
|
|
752 return NULL;
|
|
|
753 }
|
|
|
754
|
|
|
755 #define EMPTY() Empty(f)
|
|
|
756 #define FULL() Full(f)
|
|
|
757 #define GETCONST(i) Getconst(f, i)
|
|
|
758 #define GETNAME(i) Getname(f, i)
|
|
|
759 #define JUMPTO(x) Jumpto(f, x)
|
|
|
760 #define JUMPBY(x) Jumpby(f, x)
|
|
|
761
|
|
|
762 #ifdef NDEBUG
|
|
|
763
|
|
|
764 #define PUSH(v) Push(f, v)
|
|
|
765 #define TOP() Top(f)
|
|
|
766 #define POP() Pop(f)
|
|
|
767 #define NEXTOP() Nextbyte(f)
|
|
|
768 #define NEXTI() Nextbyte(f)
|
|
|
769
|
|
|
770 #else
|
|
|
771
|
|
|
772 #define PUSH(v) if(trace) trace_push(f, v); else push(f, v)
|
|
|
773 #define TOP() (trace ? trace_top(f) : top(f))
|
|
|
774 #define POP() (trace ? trace_pop(f) : pop(f))
|
|
|
775 #define NEXTOP() (trace ? trace_nextop(f) : nextbyte(f))
|
|
|
776 #define NEXTI() (nextbyte(f))
|
|
|
777
|
|
|
778 #endif
|
|
|
779
|
|
|
780 if (arg != NULL) {
|
|
|
781 INCREF(arg);
|
|
|
782 PUSH(arg);
|
|
|
783 }
|
|
|
784
|
|
|
785 while (f->f_nexti < getstringsize((object *)f->f_code->co_code) &&
|
|
|
786 !ctx->ctx_exception) {
|
|
|
787
|
|
|
788 switch (NEXTOP()) {
|
|
|
789
|
|
|
790 case DUP_TOP:
|
|
|
791 v = TOP();
|
|
|
792 INCREF(v);
|
|
|
793 PUSH(v);
|
|
|
794 break;
|
|
|
795
|
|
|
796 case POP_TOP:
|
|
|
797 v = POP();
|
|
|
798 DECREF(v);
|
|
|
799 break;
|
|
|
800
|
|
|
801 case ROT_TWO:
|
|
|
802 v = POP();
|
|
|
803 w = POP();
|
|
|
804 PUSH(v);
|
|
|
805 PUSH(w);
|
|
|
806 break;
|
|
|
807
|
|
|
808 case ROT_THREE:
|
|
|
809 v = POP();
|
|
|
810 w = POP();
|
|
|
811 x = POP();
|
|
|
812 PUSH(v);
|
|
|
813 PUSH(x);
|
|
|
814 PUSH(w);
|
|
|
815 break;
|
|
|
816
|
|
|
817 case UNARY_POSITIVE:
|
|
|
818 v = POP();
|
|
|
819 u = pos(ctx, v);
|
|
|
820 DECREF(v);
|
|
|
821 PUSH(u);
|
|
|
822 break;
|
|
|
823
|
|
|
824 case UNARY_NEGATIVE:
|
|
|
825 v = POP();
|
|
|
826 u = neg(ctx, v);
|
|
|
827 DECREF(v);
|
|
|
828 PUSH(u);
|
|
|
829 break;
|
|
|
830
|
|
|
831 case UNARY_NOT:
|
|
|
832 v = POP();
|
|
|
833 u = not(ctx, v);
|
|
|
834 DECREF(v);
|
|
|
835 PUSH(u);
|
|
|
836 break;
|
|
|
837
|
|
|
838 case UNARY_CONVERT:
|
|
|
839 v = POP();
|
|
|
840 u = checkerror(ctx, reprobject(v));
|
|
|
841 DECREF(v);
|
|
|
842 PUSH(u);
|
|
|
843 break;
|
|
|
844
|
|
|
845 case UNARY_CALL:
|
|
|
846 v = POP();
|
|
|
847 if (is_classmemberobject(v) || is_funcobject(v))
|
|
|
848 u = call_function(ctx, v, (object *)NULL);
|
|
|
849 else
|
|
|
850 u = call_builtin(ctx, v, (object *)NULL);
|
|
|
851 DECREF(v);
|
|
|
852 PUSH(u);
|
|
|
853 break;
|
|
|
854
|
|
|
855 case BINARY_MULTIPLY:
|
|
|
856 w = POP();
|
|
|
857 v = POP();
|
|
|
858 u = mul(ctx, v, w);
|
|
|
859 DECREF(v);
|
|
|
860 DECREF(w);
|
|
|
861 PUSH(u);
|
|
|
862 break;
|
|
|
863
|
|
|
864 case BINARY_DIVIDE:
|
|
|
865 w = POP();
|
|
|
866 v = POP();
|
|
|
867 u = div(ctx, v, w);
|
|
|
868 DECREF(v);
|
|
|
869 DECREF(w);
|
|
|
870 PUSH(u);
|
|
|
871 break;
|
|
|
872
|
|
|
873 case BINARY_MODULO:
|
|
|
874 w = POP();
|
|
|
875 v = POP();
|
|
|
876 u = rem(ctx, v, w);
|
|
|
877 DECREF(v);
|
|
|
878 DECREF(w);
|
|
|
879 PUSH(u);
|
|
|
880 break;
|
|
|
881
|
|
|
882 case BINARY_ADD:
|
|
|
883 w = POP();
|
|
|
884 v = POP();
|
|
|
885 u = add(ctx, v, w);
|
|
|
886 DECREF(v);
|
|
|
887 DECREF(w);
|
|
|
888 PUSH(u);
|
|
|
889 break;
|
|
|
890
|
|
|
891 case BINARY_SUBTRACT:
|
|
|
892 w = POP();
|
|
|
893 v = POP();
|
|
|
894 u = sub(ctx, v, w);
|
|
|
895 DECREF(v);
|
|
|
896 DECREF(w);
|
|
|
897 PUSH(u);
|
|
|
898 break;
|
|
|
899
|
|
|
900 case BINARY_SUBSCR:
|
|
|
901 w = POP();
|
|
|
902 v = POP();
|
|
|
903 u = apply_subscript(ctx, v, w);
|
|
|
904 DECREF(v);
|
|
|
905 DECREF(w);
|
|
|
906 PUSH(u);
|
|
|
907 break;
|
|
|
908
|
|
|
909 case BINARY_CALL:
|
|
|
910 w = POP();
|
|
|
911 v = POP();
|
|
|
912 if (is_classmemberobject(v) || is_funcobject(v))
|
|
|
913 u = call_function(ctx, v, w);
|
|
|
914 else
|
|
|
915 u = call_builtin(ctx, v, w);
|
|
|
916 DECREF(v);
|
|
|
917 DECREF(w);
|
|
|
918 PUSH(u);
|
|
|
919 break;
|
|
|
920
|
|
|
921 case SLICE:
|
|
|
922 w = NULL;
|
|
|
923 v = NULL;
|
|
|
924 u = POP();
|
|
|
925 x = apply_slice(ctx, u, v, w);
|
|
|
926 DECREF(u);
|
|
|
927 PUSH(x);
|
|
|
928 break;
|
|
|
929
|
|
|
930 case SLICE+1:
|
|
|
931 w = NULL;
|
|
|
932 v = POP();
|
|
|
933 u = POP();
|
|
|
934 x = apply_slice(ctx, u, v, w);
|
|
|
935 DECREF(u);
|
|
|
936 DECREF(v);
|
|
|
937 PUSH(x);
|
|
|
938 break;
|
|
|
939
|
|
|
940 case SLICE+2:
|
|
|
941 w = POP();
|
|
|
942 v = NULL;
|
|
|
943 u = POP();
|
|
|
944 x = apply_slice(ctx, u, v, w);
|
|
|
945 DECREF(u);
|
|
|
946 DECREF(w);
|
|
|
947 PUSH(x);
|
|
|
948 break;
|
|
|
949
|
|
|
950 case SLICE+3:
|
|
|
951 w = POP();
|
|
|
952 v = POP();
|
|
|
953 u = POP();
|
|
|
954 x = apply_slice(ctx, u, v, w);
|
|
|
955 DECREF(u);
|
|
|
956 DECREF(v);
|
|
|
957 DECREF(w);
|
|
|
958 PUSH(x);
|
|
|
959 break;
|
|
|
960
|
|
|
961 case STORE_SLICE:
|
|
|
962 w = NULL;
|
|
|
963 v = NULL;
|
|
|
964 u = POP();
|
|
|
965 x = POP();
|
|
|
966 assign_slice(ctx, u, v, w, x); /* u[:] = x */
|
|
|
967 DECREF(x);
|
|
|
968 DECREF(u);
|
|
|
969 break;
|
|
|
970
|
|
|
971 case STORE_SLICE+1:
|
|
|
972 w = NULL;
|
|
|
973 v = POP();
|
|
|
974 u = POP();
|
|
|
975 x = POP();
|
|
|
976 assign_slice(ctx, u, v, w, x); /* u[v:] = x */
|
|
|
977 DECREF(x);
|
|
|
978 DECREF(u);
|
|
|
979 DECREF(v);
|
|
|
980 break;
|
|
|
981
|
|
|
982 case STORE_SLICE+2:
|
|
|
983 w = POP();
|
|
|
984 v = NULL;
|
|
|
985 u = POP();
|
|
|
986 x = POP();
|
|
|
987 assign_slice(ctx, u, v, w, x); /* u[:w] = x */
|
|
|
988 DECREF(x);
|
|
|
989 DECREF(u);
|
|
|
990 DECREF(w);
|
|
|
991 break;
|
|
|
992
|
|
|
993 case STORE_SLICE+3:
|
|
|
994 w = POP();
|
|
|
995 v = POP();
|
|
|
996 u = POP();
|
|
|
997 x = POP();
|
|
|
998 assign_slice(ctx, u, v, w, x); /* u[v:w] = x */
|
|
|
999 DECREF(x);
|
|
|
1000 DECREF(u);
|
|
|
1001 DECREF(v);
|
|
|
1002 DECREF(w);
|
|
|
1003 break;
|
|
|
1004
|
|
|
1005 case DELETE_SLICE:
|
|
|
1006 w = NULL;
|
|
|
1007 v = NULL;
|
|
|
1008 u = POP();
|
|
|
1009 x = NULL;
|
|
|
1010 assign_slice(ctx, u, v, w, x); /* del u[:] */
|
|
|
1011 DECREF(u);
|
|
|
1012 break;
|
|
|
1013
|
|
|
1014 case DELETE_SLICE+1:
|
|
|
1015 w = NULL;
|
|
|
1016 v = POP();
|
|
|
1017 u = POP();
|
|
|
1018 x = NULL;
|
|
|
1019 assign_slice(ctx, u, v, w, x); /* del u[v:] */
|
|
|
1020 DECREF(u);
|
|
|
1021 DECREF(v);
|
|
|
1022 break;
|
|
|
1023
|
|
|
1024 case DELETE_SLICE+2:
|
|
|
1025 w = POP();
|
|
|
1026 v = NULL;
|
|
|
1027 u = POP();
|
|
|
1028 x = NULL;
|
|
|
1029 assign_slice(ctx, u, v, w, x); /* del u[:w] */
|
|
|
1030 DECREF(u);
|
|
|
1031 DECREF(w);
|
|
|
1032 break;
|
|
|
1033
|
|
|
1034 case DELETE_SLICE+3:
|
|
|
1035 w = POP();
|
|
|
1036 v = POP();
|
|
|
1037 u = POP();
|
|
|
1038 x = NULL;
|
|
|
1039 assign_slice(ctx, u, v, w, x); /* del u[v:w] */
|
|
|
1040 DECREF(u);
|
|
|
1041 DECREF(v);
|
|
|
1042 DECREF(w);
|
|
|
1043 break;
|
|
|
1044
|
|
|
1045 case STORE_SUBSCR:
|
|
|
1046 w = POP();
|
|
|
1047 v = POP();
|
|
|
1048 u = POP();
|
|
|
1049 /* v[w] = u */
|
|
|
1050 assign_subscript(ctx, v, w, u);
|
|
|
1051 DECREF(u);
|
|
|
1052 DECREF(v);
|
|
|
1053 DECREF(w);
|
|
|
1054 break;
|
|
|
1055
|
|
|
1056 case DELETE_SUBSCR:
|
|
|
1057 w = POP();
|
|
|
1058 v = POP();
|
|
|
1059 /* del v[w] */
|
|
|
1060 assign_subscript(ctx, v, w, (object *)NULL);
|
|
|
1061 DECREF(v);
|
|
|
1062 DECREF(w);
|
|
|
1063 break;
|
|
|
1064
|
|
|
1065 case PRINT_EXPR:
|
|
|
1066 v = POP();
|
|
|
1067 fp = sysgetfile("stdout", stdout);
|
|
|
1068 /* Print value except if procedure result */
|
|
|
1069 if (v != None) {
|
|
|
1070 flushline();
|
|
|
1071 printobject(v, fp, 0);
|
|
|
1072 fprintf(fp, "\n");
|
|
|
1073 }
|
|
|
1074 DECREF(v);
|
|
|
1075 break;
|
|
|
1076
|
|
|
1077 case PRINT_ITEM:
|
|
|
1078 v = POP();
|
|
|
1079 fp = sysgetfile("stdout", stdout);
|
|
|
1080 if (needspace)
|
|
|
1081 fprintf(fp, " ");
|
|
|
1082 if (is_stringobject(v)) {
|
|
|
1083 char *s = getstringvalue(v);
|
|
|
1084 int len = getstringsize(v);
|
|
|
1085 fwrite(s, 1, len, fp);
|
|
|
1086 if (len > 0 && s[len-1] == '\n')
|
|
|
1087 needspace = 0;
|
|
|
1088 else
|
|
|
1089 needspace = 1;
|
|
|
1090 }
|
|
|
1091 else {
|
|
|
1092 printobject(v, fp, 0);
|
|
|
1093 needspace = 1;
|
|
|
1094 }
|
|
|
1095 DECREF(v);
|
|
|
1096 break;
|
|
|
1097
|
|
|
1098 case PRINT_NEWLINE:
|
|
|
1099 fp = sysgetfile("stdout", stdout);
|
|
|
1100 fprintf(fp, "\n");
|
|
|
1101 needspace = 0;
|
|
|
1102 break;
|
|
|
1103
|
|
|
1104 case BREAK_LOOP:
|
|
|
1105 raise_pseudo(ctx, BREAK_PSEUDO);
|
|
|
1106 break;
|
|
|
1107
|
|
|
1108 case RAISE_EXCEPTION:
|
|
|
1109 v = POP();
|
|
|
1110 w = POP();
|
|
|
1111 if (!is_stringobject(w)) {
|
|
|
1112 DECREF(v);
|
|
|
1113 DECREF(v);
|
|
|
1114 type_error(ctx, "exceptions must be strings");
|
|
|
1115 }
|
|
|
1116 else {
|
|
|
1117 raise_exception(ctx, w, v);
|
|
|
1118 }
|
|
|
1119 break;
|
|
|
1120
|
|
|
1121 case RETURN_VALUE:
|
|
|
1122 v = POP();
|
|
|
1123 raise_pseudo(ctx, RETURN_PSEUDO);
|
|
|
1124 ctx->ctx_errval = v;
|
|
|
1125 break;
|
|
|
1126
|
|
|
1127 case REQUIRE_ARGS:
|
|
|
1128 if (EMPTY())
|
|
|
1129 type_error(ctx,
|
|
|
1130 "function expects argument(s)");
|
|
|
1131 break;
|
|
|
1132
|
|
|
1133 case REFUSE_ARGS:
|
|
|
1134 if (!EMPTY())
|
|
|
1135 type_error(ctx,
|
|
|
1136 "function expects no argument(s)");
|
|
|
1137 break;
|
|
|
1138
|
|
|
1139 case BUILD_FUNCTION:
|
|
|
1140 v = POP();
|
|
|
1141 x = checkerror(ctx, newfuncobject(v, ctx->ctx_globals));
|
|
|
1142 DECREF(v);
|
|
|
1143 PUSH(x);
|
|
|
1144 break;
|
|
|
1145
|
|
|
1146 case POP_BLOCK:
|
|
|
1147 (void) pop_block(f);
|
|
|
1148 break;
|
|
|
1149
|
|
|
1150 case END_FINALLY:
|
|
|
1151 v = POP();
|
|
|
1152 w = POP();
|
|
|
1153 if (is_intobject(v)) {
|
|
|
1154 raise_pseudo(ctx, (int)getintvalue(v));
|
|
|
1155 DECREF(v);
|
|
|
1156 if (w == None)
|
|
|
1157 DECREF(w);
|
|
|
1158 else
|
|
|
1159 ctx->ctx_errval = w;
|
|
|
1160 }
|
|
|
1161 else if (is_stringobject(v))
|
|
|
1162 raise_exception(ctx, v, w);
|
|
|
1163 else if (v == None) {
|
|
|
1164 DECREF(v);
|
|
|
1165 DECREF(w);
|
|
|
1166 }
|
|
|
1167 else {
|
|
|
1168 sys_error(ctx, "'finally' pops bad exception");
|
|
|
1169 }
|
|
|
1170 break;
|
|
|
1171
|
|
|
1172 case STORE_NAME:
|
|
|
1173 i = NEXTI();
|
|
|
1174 name = GETNAME(i);
|
|
|
1175 v = POP();
|
|
|
1176 if (dictinsert(ctx->ctx_locals, name, v) != 0)
|
|
|
1177 mem_error(ctx, "insert in symbol table");
|
|
|
1178 DECREF(v);
|
|
|
1179 break;
|
|
|
1180
|
|
|
1181 case DELETE_NAME:
|
|
|
1182 i = NEXTI();
|
|
|
1183 name = GETNAME(i);
|
|
|
1184 if (dictremove(ctx->ctx_locals, name) != 0)
|
|
|
1185 name_error(ctx, name);
|
|
|
1186 break;
|
|
|
1187
|
|
|
1188 case UNPACK_TUPLE:
|
|
|
1189 n = NEXTI();
|
|
|
1190 v = POP();
|
|
|
1191 if (!is_tupleobject(v)) {
|
|
|
1192 type_error(ctx, "unpack non-tuple");
|
|
|
1193 }
|
|
|
1194 else if (gettuplesize(v) != n) {
|
|
|
1195 error(ctx, "unpack tuple of wrong size");
|
|
|
1196 }
|
|
|
1197 else {
|
|
|
1198 for (i = n; --i >= 0; ) {
|
|
|
1199 w = gettupleitem(v, i);
|
|
|
1200 INCREF(w);
|
|
|
1201 PUSH(w);
|
|
|
1202 }
|
|
|
1203 }
|
|
|
1204 DECREF(v);
|
|
|
1205 break;
|
|
|
1206
|
|
|
1207 case UNPACK_LIST:
|
|
|
1208 n = NEXTI();
|
|
|
1209 v = POP();
|
|
|
1210 if (!is_listobject(v)) {
|
|
|
1211 type_error(ctx, "unpack non-list");
|
|
|
1212 }
|
|
|
1213 else if (getlistsize(v) != n) {
|
|
|
1214 error(ctx, "unpack tuple of wrong size");
|
|
|
1215 }
|
|
|
1216 else {
|
|
|
1217 for (i = n; --i >= 0; ) {
|
|
|
1218 w = getlistitem(v, i);
|
|
|
1219 INCREF(w);
|
|
|
1220 PUSH(w);
|
|
|
1221 }
|
|
|
1222 }
|
|
|
1223 DECREF(v);
|
|
|
1224 break;
|
|
|
1225
|
|
|
1226 case STORE_ATTR:
|
|
|
1227 i = NEXTI();
|
|
|
1228 name = GETNAME(i);
|
|
|
1229 v = POP();
|
|
|
1230 u = POP();
|
|
|
1231 /* v.name = u */
|
|
|
1232 if (v->ob_type->tp_setattr == NULL) {
|
|
|
1233 type_error(ctx, "object without writable attributes");
|
|
|
1234 }
|
|
|
1235 else {
|
|
|
1236 if ((*v->ob_type->tp_setattr)(v, name, u) != 0)
|
|
|
1237 puterrno(ctx);
|
|
|
1238 }
|
|
|
1239 DECREF(v);
|
|
|
1240 DECREF(u);
|
|
|
1241 break;
|
|
|
1242
|
|
|
1243 case DELETE_ATTR:
|
|
|
1244 i = NEXTI();
|
|
|
1245 name = GETNAME(i);
|
|
|
1246 v = POP();
|
|
|
1247 /* del v.name */
|
|
|
1248 if (v->ob_type->tp_setattr == NULL) {
|
|
|
1249 type_error(ctx,
|
|
|
1250 "object without writable attributes");
|
|
|
1251 }
|
|
|
1252 else {
|
|
|
1253 if ((*v->ob_type->tp_setattr)
|
|
|
1254 (v, name, (object *)NULL) != 0)
|
|
|
1255 puterrno(ctx);
|
|
|
1256 }
|
|
|
1257 DECREF(v);
|
|
|
1258 break;
|
|
|
1259
|
|
|
1260 case LOAD_CONST:
|
|
|
1261 i = NEXTI();
|
|
|
1262 v = GETCONST(i);
|
|
|
1263 INCREF(v);
|
|
|
1264 PUSH(v);
|
|
|
1265 break;
|
|
|
1266
|
|
|
1267 case LOAD_NAME:
|
|
|
1268 i = NEXTI();
|
|
|
1269 name = GETNAME(i);
|
|
|
1270 v = dictlookup(ctx->ctx_locals, name);
|
|
|
1271 if (v == NULL) {
|
|
|
1272 v = dictlookup(ctx->ctx_globals, name);
|
|
|
1273 if (v == NULL)
|
|
|
1274 v = dictlookup(ctx->ctx_builtins, name);
|
|
|
1275 }
|
|
|
1276 if (v == NULL)
|
|
|
1277 name_error(ctx, name);
|
|
|
1278 /* XXX could optimize */
|
|
|
1279 else
|
|
|
1280 INCREF(v);
|
|
|
1281 PUSH(v);
|
|
|
1282 break;
|
|
|
1283
|
|
|
1284 case BUILD_TUPLE:
|
|
|
1285 n = NEXTI();
|
|
|
1286 v = checkerror(ctx, newtupleobject(n));
|
|
|
1287 if (v != NULL) {
|
|
|
1288 for (i = n; --i >= 0;) {
|
|
|
1289 w = POP();
|
|
|
1290 settupleitem(v, i, w);
|
|
|
1291 }
|
|
|
1292 }
|
|
|
1293 PUSH(v);
|
|
|
1294 break;
|
|
|
1295
|
|
|
1296 case BUILD_LIST:
|
|
|
1297 n = NEXTI();
|
|
|
1298 v = checkerror(ctx, newlistobject(n));
|
|
|
1299 if (v != NULL) {
|
|
|
1300 for (i = n; --i >= 0;) {
|
|
|
1301 w = POP();
|
|
|
1302 setlistitem(v, i, w);
|
|
|
1303 }
|
|
|
1304 }
|
|
|
1305 PUSH(v);
|
|
|
1306 break;
|
|
|
1307
|
|
|
1308 case BUILD_MAP:
|
|
|
1309 (void) NEXTI();
|
|
|
1310 v = checkerror(ctx, newdictobject());
|
|
|
1311 PUSH(v);
|
|
|
1312 break;
|
|
|
1313
|
|
|
1314 case LOAD_ATTR:
|
|
|
1315 i = NEXTI();
|
|
|
1316 name = GETNAME(i);
|
|
|
1317 v = POP();
|
|
|
1318 if (v->ob_type->tp_getattr == NULL) {
|
|
|
1319 type_error(ctx, "attribute-less object");
|
|
|
1320 u = NULL;
|
|
|
1321 }
|
|
|
1322 else {
|
|
|
1323 u = checkerror(ctx,
|
|
|
1324 (*v->ob_type->tp_getattr)(v, name));
|
|
|
1325 }
|
|
|
1326 DECREF(v);
|
|
|
1327 PUSH(u);
|
|
|
1328 break;
|
|
|
1329
|
|
|
1330 case COMPARE_OP:
|
|
|
1331 op = NEXTI();
|
|
|
1332 w = POP();
|
|
|
1333 v = POP();
|
|
|
1334 u = cmp_outcome(ctx, op, v, w);
|
|
|
1335 DECREF(v);
|
|
|
1336 DECREF(w);
|
|
|
1337 PUSH(u);
|
|
|
1338 break;
|
|
|
1339
|
|
|
1340 case IMPORT_NAME:
|
|
|
1341 i = NEXTI();
|
|
|
1342 name = GETNAME(i);
|
|
|
1343 u = import_module(ctx, name);
|
|
|
1344 if (u != NULL) {
|
|
|
1345 INCREF(u);
|
|
|
1346 PUSH(u);
|
|
|
1347 }
|
|
|
1348 break;
|
|
|
1349
|
|
|
1350 case IMPORT_FROM:
|
|
|
1351 i = NEXTI();
|
|
|
1352 name = GETNAME(i);
|
|
|
1353 v = TOP();
|
|
|
1354 w = getmoduledict(v);
|
|
|
1355 x = dictlookup(w, name);
|
|
|
1356 if (x == NULL)
|
|
|
1357 name_error(ctx, name);
|
|
|
1358 else if (dictinsert(ctx->ctx_locals, name, x) != 0)
|
|
|
1359 puterrno(ctx);
|
|
|
1360 break;
|
|
|
1361
|
|
|
1362 /* WARNING!
|
|
|
1363 Don't assign an expression containing NEXTI() directly
|
|
|
1364 to nexti. This expands to "nexti = ... + *nexti++"
|
|
|
1365 which has undefined evaluation order. On some machines
|
|
|
1366 (e.g., mips!) the nexti++ is done after the assignment
|
|
|
1367 to nexti. */
|
|
|
1368
|
|
|
1369 case JUMP_FORWARD:
|
|
|
1370 n = NEXTI();
|
|
|
1371 JUMPBY(n);
|
|
|
1372 break;
|
|
|
1373
|
|
|
1374 case JUMP_IF_FALSE:
|
|
|
1375 n = NEXTI();
|
|
|
1376 if (!testbool(ctx, TOP()))
|
|
|
1377 JUMPBY(n);
|
|
|
1378 break;
|
|
|
1379
|
|
|
1380 case JUMP_IF_TRUE:
|
|
|
1381 n = NEXTI();
|
|
|
1382 if (testbool(ctx, TOP()))
|
|
|
1383 JUMPBY(n);
|
|
|
1384 break;
|
|
|
1385
|
|
|
1386 case JUMP_ABSOLUTE:
|
|
|
1387 n = NEXTI();
|
|
|
1388 JUMPTO(n);
|
|
|
1389 /* XXX Should check for interrupts more often? */
|
|
|
1390 if (intrcheck())
|
|
|
1391 intr_error(ctx);
|
|
|
1392 break;
|
|
|
1393
|
|
|
1394 case FOR_LOOP:
|
|
|
1395 /* for v in s: ...
|
|
|
1396 On entry: stack contains s, i.
|
|
|
1397 On exit: stack contains s, i+1, s[i];
|
|
|
1398 but if loop exhausted:
|
|
|
1399 s, i are popped, and we jump n bytes */
|
|
|
1400 n = NEXTI();
|
|
|
1401 w = POP(); /* Loop index */
|
|
|
1402 v = POP(); /* Sequence object */
|
|
|
1403 x = loop_subscript(ctx, v, w);
|
|
|
1404 if (x != NULL) {
|
|
|
1405 PUSH(v);
|
|
|
1406 u = checkerror(ctx,
|
|
|
1407 newintobject(getintvalue(w)+1));
|
|
|
1408 PUSH(u);
|
|
|
1409 DECREF(w);
|
|
|
1410 PUSH(x);
|
|
|
1411 }
|
|
|
1412 else {
|
|
|
1413 DECREF(v);
|
|
|
1414 DECREF(w);
|
|
|
1415 JUMPBY(n);
|
|
|
1416 }
|
|
|
1417 break;
|
|
|
1418
|
|
|
1419 case SETUP_LOOP:
|
|
|
1420 n = NEXTI();
|
|
|
1421 setup_block(f, SETUP_LOOP, n);
|
|
|
1422 break;
|
|
|
1423
|
|
|
1424 case SETUP_EXCEPT:
|
|
|
1425 n = NEXTI();
|
|
|
1426 setup_block(f, SETUP_EXCEPT, n);
|
|
|
1427 break;
|
|
|
1428
|
|
|
1429 case SETUP_FINALLY:
|
|
|
1430 n = NEXTI();
|
|
|
1431 setup_block(f, SETUP_FINALLY, n);
|
|
|
1432 break;
|
|
|
1433
|
|
|
1434 default:
|
|
|
1435 printf("opcode %d\n", Prevbyte(f));
|
|
|
1436 sys_error(ctx, "eval_compiled: unknown opcode");
|
|
|
1437 break;
|
|
|
1438
|
|
|
1439 }
|
|
|
1440
|
|
|
1441 /* Unwind block stack if an exception occurred */
|
|
|
1442
|
|
|
1443 while (ctx->ctx_exception && f->f_iblock > 0) {
|
|
|
1444 block *b = pop_block(f);
|
|
|
1445 if (b->b_type == SETUP_LOOP &&
|
|
|
1446 ctx->ctx_exception == BREAK_PSEUDO) {
|
|
|
1447 clear_exception(ctx);
|
|
|
1448 JUMPTO(b->b_handler);
|
|
|
1449 break;
|
|
|
1450 }
|
|
|
1451 else if (b->b_type == SETUP_FINALLY ||
|
|
|
1452 b->b_type == SETUP_EXCEPT &&
|
|
|
1453 ctx->ctx_exception == CATCHABLE_EXCEPTION) {
|
|
|
1454 v = ctx->ctx_errval;
|
|
|
1455 if (v == NULL)
|
|
|
1456 v = None;
|
|
|
1457 INCREF(v);
|
|
|
1458 PUSH(v);
|
|
|
1459 v = ctx->ctx_error;
|
|
|
1460 if (v == NULL)
|
|
|
1461 v = newintobject(ctx->ctx_exception);
|
|
|
1462 else
|
|
|
1463 INCREF(v);
|
|
|
1464 PUSH(v);
|
|
|
1465 clear_exception(ctx);
|
|
|
1466 JUMPTO(b->b_handler);
|
|
|
1467 break;
|
|
|
1468 }
|
|
|
1469 }
|
|
|
1470 }
|
|
|
1471
|
|
|
1472 if (ctx->ctx_exception) {
|
|
|
1473 while (!EMPTY()) {
|
|
|
1474 v = POP();
|
|
|
1475 XDECREF(v);
|
|
|
1476 }
|
|
|
1477 v = NULL;
|
|
|
1478 if (ctx->ctx_exception == RETURN_PSEUDO) {
|
|
|
1479 if (needvalue) {
|
|
|
1480 v = ctx->ctx_errval;
|
|
|
1481 INCREF(v);
|
|
|
1482 clear_exception(ctx);
|
|
|
1483 }
|
|
|
1484 else {
|
|
|
1485 /* XXX Can detect this statically! */
|
|
|
1486 type_error(ctx, "unexpected return statement");
|
|
|
1487 }
|
|
|
1488 }
|
|
|
1489 }
|
|
|
1490 else {
|
|
|
1491 if (needvalue)
|
|
|
1492 v = POP();
|
|
|
1493 else
|
|
|
1494 v = NULL;
|
|
|
1495 if (!EMPTY()) {
|
|
|
1496 sys_error(ctx, "stack not cleaned up");
|
|
|
1497 XDECREF(v);
|
|
|
1498 while (!EMPTY()) {
|
|
|
1499 v = POP();
|
|
|
1500 XDECREF(v);
|
|
|
1501 }
|
|
|
1502 v = NULL;
|
|
|
1503 }
|
|
|
1504 }
|
|
|
1505
|
|
|
1506 #undef EMPTY
|
|
|
1507 #undef FULL
|
|
|
1508 #undef GETCONST
|
|
|
1509 #undef GETNAME
|
|
|
1510 #undef JUMPTO
|
|
|
1511 #undef JUMPBY
|
|
|
1512
|
|
|
1513 #undef NEXTOP
|
|
|
1514 #undef NEXTI
|
|
|
1515 #undef POP
|
|
|
1516 #undef TOP
|
|
|
1517 #undef PUSH
|
|
|
1518
|
|
|
1519 DECREF(f);
|
|
|
1520 return v;
|
|
|
1521
|
|
|
1522 }
|
|
|
1523
|
|
|
1524 /* Provisional interface until everything is compilable */
|
|
|
1525
|
|
|
1526 #include "node.h"
|
|
|
1527
|
|
|
1528 static object *
|
|
|
1529 eval_or_exec(ctx, n, arg, needvalue)
|
|
|
1530 context *ctx;
|
|
|
1531 node *n;
|
|
|
1532 object *arg;
|
|
|
1533 int needvalue;
|
|
|
1534 {
|
|
|
1535 object *v;
|
|
|
1536 codeobject *co = compile(n);
|
|
|
1537 if (co == NULL) {
|
|
|
1538 puterrno(ctx);
|
|
|
1539 return NULL;
|
|
|
1540 }
|
|
|
1541 v = eval_compiled(ctx, co, arg, needvalue);
|
|
|
1542 DECREF(co);
|
|
|
1543 return v;
|
|
|
1544 }
|
|
|
1545
|
|
|
1546 object *
|
|
|
1547 eval_node(ctx, n)
|
|
|
1548 context *ctx;
|
|
|
1549 node *n;
|
|
|
1550 {
|
|
|
1551 return eval_or_exec(ctx, n, (object *)NULL, 1/*needvalue*/);
|
|
|
1552 }
|
|
|
1553
|
|
|
1554 void
|
|
|
1555 exec_node(ctx, n)
|
|
|
1556 context *ctx;
|
|
|
1557 node *n;
|
|
|
1558 {
|
|
|
1559 (void) eval_or_exec(ctx, n, (object *)NULL, 0/*needvalue*/);
|
|
|
1560 }
|
