Staging
v0.5.0
v0.5.0
https://github.com/python/cpython
Tip revision: d39f5f64538edd6c690fe635926063fb7cac853b authored by cvs2svn on 10 April 1995, 12:32:31 UTC
This commit was manufactured by cvs2svn to create tag 'release12'.
This commit was manufactured by cvs2svn to create tag 'release12'.
Tip revision: d39f5f6
ceval.c
/***********************************************************
Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam,
The Netherlands.
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the names of Stichting Mathematisch
Centrum or CWI not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior permission.
STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
******************************************************************/
/* Execute compiled code */
#include "allobjects.h"
#include "import.h"
#include "sysmodule.h"
#include "bltinmodule.h"
#include "compile.h"
#include "frameobject.h"
#include "eval.h"
#include "ceval.h"
#include "opcode.h"
#include "traceback.h"
#include "graminit.h"
#include "pythonrun.h"
#include <ctype.h>
extern int suppress_print; /* Declared in pythonrun.c, set in pythonmain.c */
/* Turn this on if your compiler chokes on the big switch: */
/* #define CASE_TOO_BIG 1 */
/* Turn this on if you want to debug the interpreter: */
/* (This can be on even if NDEBUG is defined) */
/* #define DEBUG 1 */
#if defined(DEBUG) || !defined(NDEBUG)
/* For debugging the interpreter: */
#define LLTRACE 1 /* Low-level trace feature */
#define CHECKEXC 1 /* Double-check exception checking */
#endif
/* Forward declarations */
#ifdef LLTRACE
static int prtrace PROTO((object *, char *));
#endif
static void call_exc_trace PROTO((object **, object**, frameobject *));
static int call_trace
PROTO((object **, object **, frameobject *, char *, object *));
static object *add PROTO((object *, object *));
static object *sub PROTO((object *, object *));
static object *mul PROTO((object *, object *));
static object *divide PROTO((object *, object *));
static object *mod PROTO((object *, object *));
static object *neg PROTO((object *));
static object *pos PROTO((object *));
static object *not PROTO((object *));
static object *invert PROTO((object *));
static object *lshift PROTO((object *, object *));
static object *rshift PROTO((object *, object *));
static object *and PROTO((object *, object *));
static object *xor PROTO((object *, object *));
static object *or PROTO((object *, object *));
static object *call_builtin PROTO((object *, object *));
static object *call_function PROTO((object *, object *));
static object *apply_subscript PROTO((object *, object *));
static object *loop_subscript PROTO((object *, object *));
static int slice_index PROTO((object *, int, int *));
static object *apply_slice PROTO((object *, object *, object *));
static int assign_subscript PROTO((object *, object *, object *));
static int assign_slice PROTO((object *, object *, object *, object *));
static int cmp_exception PROTO((object *, object *));
static int cmp_member PROTO((object *, object *));
static object *cmp_outcome PROTO((int, object *, object *));
static int import_from PROTO((object *, object *, object *));
static object *build_class PROTO((object *, object *, object *));
static int access_statement PROTO((object *, object *, frameobject *));
static int exec_statement PROTO((object *, object *, object *));
static object *find_from_args PROTO((frameobject *, int));
/* Pointer to current frame, used to link new frames to */
static frameobject *current_frame;
#ifdef WITH_THREAD
#include <errno.h>
#include "thread.h"
static type_lock interpreter_lock = 0;
static long main_thread = 0;
void
init_save_thread()
{
if (interpreter_lock)
return;
interpreter_lock = allocate_lock();
acquire_lock(interpreter_lock, 1);
main_thread = get_thread_ident();
}
#endif
/* Functions save_thread and restore_thread are always defined so
dynamically loaded modules needn't be compiled separately for use
with and without threads: */
object *
save_thread()
{
#ifdef WITH_THREAD
if (interpreter_lock) {
object *res;
res = (object *)current_frame;
current_frame = NULL;
release_lock(interpreter_lock);
return res;
}
#endif
return NULL;
}
void
restore_thread(x)
object *x;
{
#ifdef WITH_THREAD
if (interpreter_lock) {
int err;
err = errno;
acquire_lock(interpreter_lock, 1);
errno = err;
current_frame = (frameobject *)x;
}
#endif
}
/* Mechanism whereby asynchronously executing callbacks (e.g. UNIX
signal handlers or Mac I/O completion routines) can schedule calls
to a function to be called synchronously.
The synchronous function is called with one void* argument.
It should return 0 for success or -1 for failure -- failure should
be accompanied by an exception.
If registry succeeds, the registry function returns 0; if it fails
(e.g. due to too many pending calls) it returns -1 (without setting
an exception condition).
Note that because registry may occur from within signal handlers,
or other asynchronous events, calling malloc() is unsafe!
#ifdef WITH_THREAD
Any thread can schedule pending calls, but only the main thread
will execute them.
#endif
XXX WARNING! ASYNCHRONOUSLY EXECUTING CODE!
There are two possible race conditions:
(1) nested asynchronous registry calls;
(2) registry calls made while pending calls are being processed.
While (1) is very unlikely, (2) is a real possibility.
The current code is safe against (2), but not against (1).
The safety against (2) is derived from the fact that only one
thread (the main thread) ever takes things out of the queue.
*/
#define NPENDINGCALLS 32
static struct {
int (*func) PROTO((ANY *));
ANY *arg;
} pendingcalls[NPENDINGCALLS];
static volatile int pendingfirst = 0;
static volatile int pendinglast = 0;
int
Py_AddPendingCall(func, arg)
int (*func) PROTO((ANY *));
ANY *arg;
{
static int busy = 0;
int i, j;
/* XXX Begin critical section */
/* XXX If you want this to be safe against nested
XXX asynchronous calls, you'll have to work harder! */
if (busy)
return -1;
busy = 1;
i = pendinglast;
j = (i + 1) % NPENDINGCALLS;
if (j == pendingfirst)
return -1; /* Queue full */
pendingcalls[i].func = func;
pendingcalls[i].arg = arg;
pendinglast = j;
busy = 0;
/* XXX End critical section */
return 0;
}
int
Py_MakePendingCalls()
{
static int busy = 0;
#ifdef WITH_THREAD
if (get_thread_ident() != main_thread)
return 0;
#endif
if (busy)
return 0;
busy = 1;
for (;;) {
int i;
int (*func) PROTO((ANY *));
ANY *arg;
i = pendingfirst;
if (i == pendinglast)
break; /* Queue empty */
func = pendingcalls[i].func;
arg = pendingcalls[i].arg;
pendingfirst = (i + 1) % NPENDINGCALLS;
if (func(arg) < 0) {
busy = 0;
return -1;
}
}
busy = 0;
return 0;
}
/* Status code for main loop (reason for stack unwind) */
enum why_code {
WHY_NOT, /* No error */
WHY_EXCEPTION, /* Exception occurred */
WHY_RERAISE, /* Exception re-raised by 'finally' */
WHY_RETURN, /* 'return' statement */
WHY_BREAK /* 'break' statement */
};
/* Interpreter main loop */
object *
eval_code(co, globals, locals, owner, arg)
codeobject *co;
object *globals;
object *locals;
object *owner;
object *arg;
{
register unsigned char *next_instr;
register int opcode; /* Current opcode */
register int oparg; /* Current opcode argument, if any */
register object **stack_pointer;
register enum why_code why; /* Reason for block stack unwind */
register int err; /* Error status -- nonzero if error */
register object *x; /* Result object -- NULL if error */
register object *v; /* Temporary objects popped off stack */
register object *w;
register object *u;
register object *t;
register frameobject *f; /* Current frame */
register listobject *fastlocals = NULL;
object *retval; /* Return value iff why == WHY_RETURN */
int needmerge = 0; /* Set if need to merge locals back at end */
int defmode = 0; /* Default access mode for new variables */
#ifdef LLTRACE
int lltrace;
#endif
#if defined( DEBUG ) || defined( LLTRACE )
/* Make it easier to find out where we are with dbx */
char *filename = getstringvalue(co->co_filename);
#endif
/* Code access macros */
#define GETCONST(i) Getconst(f, i)
#define GETNAME(i) Getname(f, i)
#define GETNAMEV(i) Getnamev(f, i)
#define FIRST_INSTR() (GETUSTRINGVALUE(f->f_code->co_code))
#define INSTR_OFFSET() (next_instr - FIRST_INSTR())
#define NEXTOP() (*next_instr++)
#define NEXTARG() (next_instr += 2, (next_instr[-1]<<8) + next_instr[-2])
#define JUMPTO(x) (next_instr = FIRST_INSTR() + (x))
#define JUMPBY(x) (next_instr += (x))
/* Stack manipulation macros */
#define STACK_LEVEL() (stack_pointer - f->f_valuestack)
#define EMPTY() (STACK_LEVEL() == 0)
#define TOP() (stack_pointer[-1])
#define BASIC_PUSH(v) (*stack_pointer++ = (v))
#define BASIC_POP() (*--stack_pointer)
#define CHECK_STACK(n) (STACK_LEVEL() + (n) < f->f_nvalues || \
(stack_pointer = extend_stack(f, STACK_LEVEL(), n)))
#ifdef LLTRACE
#define PUSH(v) (BASIC_PUSH(v), lltrace && prtrace(TOP(), "push"))
#define POP() (lltrace && prtrace(TOP(), "pop"), BASIC_POP())
#else
#define PUSH(v) BASIC_PUSH(v)
#define POP() BASIC_POP()
#endif
if (globals == NULL || locals == NULL) {
err_setstr(SystemError, "eval_code: NULL globals or locals");
return NULL;
}
#ifdef LLTRACE
lltrace = dictlookup(globals, "__lltrace__") != NULL;
#endif
f = newframeobject(
current_frame, /*back*/
co, /*code*/
globals, /*globals*/
locals, /*locals*/
owner, /*owner*/
50, /*nvalues*/
20); /*nblocks*/
if (f == NULL)
return NULL;
current_frame = f;
if (sys_trace != NULL) {
/* sys_trace, if defined, is a function that will
be called on *every* entry to a code block.
Its return value, if not None, is a function that
will be called at the start of each executed line
of code. (Actually, the function must return
itself in order to continue tracing.)
The trace functions are called with three arguments:
a pointer to the current frame, a string indicating
why the function is called, and an argument which
depends on the situation. The global trace function
(sys.trace) is also called whenever an exception
is detected. */
if (call_trace(&sys_trace, &f->f_trace, f, "call", arg)) {
/* Trace function raised an error */
current_frame = f->f_back;
DECREF(f);
return NULL;
}
}
if (sys_profile != NULL) {
/* Similar for sys_profile, except it needn't return
itself and isn't called for "line" events */
if (call_trace(&sys_profile, (object**)0, f, "call", arg)) {
current_frame = f->f_back;
DECREF(f);
return NULL;
}
}
next_instr = GETUSTRINGVALUE(f->f_code->co_code);
stack_pointer = f->f_valuestack;
if (arg != NULL) {
INCREF(arg);
PUSH(arg);
}
why = WHY_NOT;
err = 0;
x = None; /* Not a reference, just anything non-NULL */
for (;;) {
static int ticker;
/* Do periodic things.
Doing this every time through the loop would add
too much overhead (a function call per instruction).
So we do it only every Nth instruction. */
if (pendingfirst != pendinglast) {
if (Py_MakePendingCalls() < 0) {
why = WHY_EXCEPTION;
goto on_error;
}
}
if (--ticker < 0) {
ticker = sys_checkinterval;
if (sigcheck()) {
why = WHY_EXCEPTION;
goto on_error;
}
#ifdef WITH_THREAD
if (interpreter_lock) {
/* Give another thread a chance */
current_frame = NULL;
release_lock(interpreter_lock);
/* Other threads may run now */
acquire_lock(interpreter_lock, 1);
current_frame = f;
}
#endif
}
/* Extract opcode and argument */
#ifdef DEBUG
f->f_lasti = INSTR_OFFSET();
#endif
opcode = NEXTOP();
if (HAS_ARG(opcode))
oparg = NEXTARG();
#ifdef LLTRACE
/* Instruction tracing */
if (lltrace) {
if (HAS_ARG(opcode)) {
printf("%d: %d, %d\n",
(int) (INSTR_OFFSET() - 3),
opcode, oparg);
}
else {
printf("%d: %d\n",
(int) (INSTR_OFFSET() - 1), opcode);
}
}
#endif
if (!CHECK_STACK(3)) {
x = NULL;
break;
}
/* Main switch on opcode */
switch (opcode) {
/* BEWARE!
It is essential that any operation that fails sets either
x to NULL, err to nonzero, or why to anything but WHY_NOT,
and that no operation that succeeds does this! */
/* case STOP_CODE: this is an error! */
case POP_TOP:
v = POP();
DECREF(v);
break;
case ROT_TWO:
v = POP();
w = POP();
PUSH(v);
PUSH(w);
break;
case ROT_THREE:
v = POP();
w = POP();
x = POP();
PUSH(v);
PUSH(x);
PUSH(w);
break;
case DUP_TOP:
v = TOP();
INCREF(v);
PUSH(v);
break;
case UNARY_POSITIVE:
v = POP();
x = pos(v);
DECREF(v);
PUSH(x);
break;
case UNARY_NEGATIVE:
v = POP();
x = neg(v);
DECREF(v);
PUSH(x);
break;
case UNARY_NOT:
v = POP();
x = not(v);
DECREF(v);
PUSH(x);
break;
case UNARY_CONVERT:
v = POP();
x = reprobject(v);
DECREF(v);
PUSH(x);
break;
case UNARY_CALL:
v = POP();
f->f_lasti = INSTR_OFFSET() - 1; /* For tracing */
x = call_object(v, (object *)NULL);
DECREF(v);
PUSH(x);
break;
case UNARY_INVERT:
v = POP();
x = invert(v);
DECREF(v);
PUSH(x);
break;
case BINARY_MULTIPLY:
w = POP();
v = POP();
x = mul(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_DIVIDE:
w = POP();
v = POP();
x = divide(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_MODULO:
w = POP();
v = POP();
x = mod(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_ADD:
w = POP();
v = POP();
x = add(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_SUBTRACT:
w = POP();
v = POP();
x = sub(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_SUBSCR:
w = POP();
v = POP();
x = apply_subscript(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_CALL:
w = POP();
v = POP();
f->f_lasti = INSTR_OFFSET() - 1; /* For tracing */
x = call_object(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_LSHIFT:
w = POP();
v = POP();
x = lshift(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_RSHIFT:
w = POP();
v = POP();
x = rshift(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_AND:
w = POP();
v = POP();
x = and(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_XOR:
w = POP();
v = POP();
x = xor(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case BINARY_OR:
w = POP();
v = POP();
x = or(v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case SLICE+0:
case SLICE+1:
case SLICE+2:
case SLICE+3:
if ((opcode-SLICE) & 2)
w = POP();
else
w = NULL;
if ((opcode-SLICE) & 1)
v = POP();
else
v = NULL;
u = POP();
x = apply_slice(u, v, w);
DECREF(u);
XDECREF(v);
XDECREF(w);
PUSH(x);
break;
case STORE_SLICE+0:
case STORE_SLICE+1:
case STORE_SLICE+2:
case STORE_SLICE+3:
if ((opcode-STORE_SLICE) & 2)
w = POP();
else
w = NULL;
if ((opcode-STORE_SLICE) & 1)
v = POP();
else
v = NULL;
u = POP();
t = POP();
err = assign_slice(u, v, w, t); /* u[v:w] = t */
DECREF(t);
DECREF(u);
XDECREF(v);
XDECREF(w);
break;
case DELETE_SLICE+0:
case DELETE_SLICE+1:
case DELETE_SLICE+2:
case DELETE_SLICE+3:
if ((opcode-DELETE_SLICE) & 2)
w = POP();
else
w = NULL;
if ((opcode-DELETE_SLICE) & 1)
v = POP();
else
v = NULL;
u = POP();
err = assign_slice(u, v, w, (object *)NULL);
/* del u[v:w] */
DECREF(u);
XDECREF(v);
XDECREF(w);
break;
case STORE_SUBSCR:
w = POP();
v = POP();
u = POP();
/* v[w] = u */
err = assign_subscript(v, w, u);
DECREF(u);
DECREF(v);
DECREF(w);
break;
case DELETE_SUBSCR:
w = POP();
v = POP();
/* del v[w] */
err = assign_subscript(v, w, (object *)NULL);
DECREF(v);
DECREF(w);
break;
case PRINT_EXPR:
v = POP();
/* Print value except if procedure result */
/* Before printing, also assign to '_' */
if (v != None &&
(err = dictinsert(f->f_builtins, "_", v)) == 0 &&
!suppress_print) {
flushline();
x = sysget("stdout");
err = writeobject(v, x, 0);
softspace(x, 1);
flushline();
}
DECREF(v);
break;
case PRINT_ITEM:
v = POP();
w = sysget("stdout");
if (softspace(w, 1))
writestring(" ", w);
err = writeobject(v, w, PRINT_RAW);
if (err == 0 && is_stringobject(v)) {
/* XXX move into writeobject() ? */
char *s = getstringvalue(v);
int len = getstringsize(v);
if (len > 0 &&
isspace(Py_CHARMASK(s[len-1])) &&
s[len-1] != ' ')
softspace(w, 0);
}
DECREF(v);
break;
case PRINT_NEWLINE:
x = sysget("stdout");
if (x == NULL)
err_setstr(RuntimeError, "lost sys.stdout");
else {
writestring("\n", x);
softspace(x, 0);
}
break;
case BREAK_LOOP:
why = WHY_BREAK;
break;
case RAISE_EXCEPTION:
v = POP();
w = POP();
/* A tuple is equivalent to its first element here */
while (is_tupleobject(w) && gettuplesize(w) > 0) {
u = w;
w = GETTUPLEITEM(u, 0);
INCREF(w);
DECREF(u);
}
if (is_stringobject(w)) {
err_setval(w, v);
} else if (is_classobject(w)) {
if (!is_instanceobject(v)
|| !issubclass((object*)((instanceobject*)v)->in_class,
w))
err_setstr(TypeError,
"a class exception must have a value that is an instance of the class");
else
err_setval(w,v);
} else if (is_instanceobject(w)) {
if (v != None)
err_setstr(TypeError,
"an instance exception may not have a separate value");
else {
DECREF(v);
v = w;
w = (object*) ((instanceobject*)w)->in_class;
INCREF(w);
err_setval(w, v);
}
} else
err_setstr(TypeError,
"exceptions must be strings, classes, or instances");
DECREF(v);
DECREF(w);
why = WHY_EXCEPTION;
break;
case LOAD_LOCALS:
v = f->f_locals;
INCREF(v);
PUSH(v);
break;
case RETURN_VALUE:
retval = POP();
why = WHY_RETURN;
break;
case LOAD_GLOBALS:
v = f->f_locals;
INCREF(v);
PUSH(v);
break;
case EXEC_STMT:
w = POP();
v = POP();
u = POP();
err = exec_statement(u, v, w);
DECREF(u);
DECREF(v);
DECREF(w);
break;
case BUILD_FUNCTION:
v = POP();
x = newfuncobject(v, f->f_globals);
DECREF(v);
PUSH(x);
break;
case SET_FUNC_ARGS:
v = POP(); /* The function */
w = POP(); /* The argument list */
err = setfuncargstuff(v, oparg, w);
PUSH(v);
DECREF(w);
break;
case POP_BLOCK:
{
block *b = pop_block(f);
while (STACK_LEVEL() > b->b_level) {
v = POP();
DECREF(v);
}
}
break;
case END_FINALLY:
v = POP();
if (is_intobject(v)) {
why = (enum why_code) getintvalue(v);
if (why == WHY_RETURN)
retval = POP();
}
else if (is_stringobject(v) || is_classobject(v)) {
w = POP();
err_setval(v, w);
DECREF(w);
w = POP();
tb_store(w);
DECREF(w);
why = WHY_RERAISE;
}
else if (v != None) {
err_setstr(SystemError,
"'finally' pops bad exception");
why = WHY_EXCEPTION;
}
DECREF(v);
break;
case BUILD_CLASS:
u = POP();
v = POP();
w = POP();
x = build_class(u, v, w);
PUSH(x);
DECREF(u);
DECREF(v);
DECREF(w);
break;
case STORE_NAME:
w = GETNAMEV(oparg);
v = POP();
u = dict2lookup(f->f_locals, w);
if (u == NULL) {
if (defmode != 0) {
if (v != None)
u = (object *)v->ob_type;
else
u = NULL;
x = newaccessobject(v, f->f_locals,
(typeobject *)u,
defmode);
DECREF(v);
if (x == NULL)
break;
v = x;
}
}
else if (is_accessobject(u)) {
err = setaccessvalue(u, f->f_locals, v);
DECREF(v);
break;
}
err = dict2insert(f->f_locals, w, v);
DECREF(v);
break;
case DELETE_NAME:
w = GETNAMEV(oparg);
u = dict2lookup(f->f_locals, w);
if (u != NULL && is_accessobject(u)) {
err = setaccessvalue(u, f->f_locals,
(object *)NULL);
break;
}
if ((err = dict2remove(f->f_locals, w)) != 0)
err_setval(NameError, w);
break;
#ifdef CASE_TOO_BIG
default: switch (opcode) {
#endif
case UNPACK_VARARG:
if (EMPTY()) {
err_setstr(TypeError,
"no argument list");
why = WHY_EXCEPTION;
break;
}
v = POP();
if (!is_tupleobject(v)) {
err_setstr(TypeError,
"bad argument list");
why = WHY_EXCEPTION;
}
else if (gettuplesize(v) < oparg) {
err_setstr(TypeError,
"not enough arguments");
why = WHY_EXCEPTION;
}
else if (oparg == 0) {
PUSH(v);
break;
}
else {
x = gettupleslice(v, oparg, gettuplesize(v));
if (x != NULL) {
PUSH(x);
if (!CHECK_STACK(oparg)) {
x = NULL;
break;
}
for (; --oparg >= 0; ) {
w = GETTUPLEITEM(v, oparg);
INCREF(w);
PUSH(w);
}
}
}
DECREF(v);
break;
case UNPACK_ARG:
{
int n;
if (EMPTY()) {
err_setstr(TypeError,
"no argument list");
why = WHY_EXCEPTION;
break;
}
v = POP();
if (!is_tupleobject(v)) {
err_setstr(TypeError,
"bad argument list");
why = WHY_EXCEPTION;
break;
}
n = gettuplesize(v);
if (n != oparg) {
err_setstr(TypeError,
"arg count mismatch");
why = WHY_EXCEPTION;
DECREF(v);
break;
}
PUSH(v);
}
/* Fall through */
case UNPACK_TUPLE:
v = POP();
if (!is_tupleobject(v)) {
err_setstr(TypeError, "unpack non-tuple");
why = WHY_EXCEPTION;
}
else if (gettuplesize(v) != oparg) {
err_setstr(ValueError,
"unpack tuple of wrong size");
why = WHY_EXCEPTION;
}
else {
if (!CHECK_STACK(oparg)) {
x = NULL;
break;
}
for (; --oparg >= 0; ) {
w = GETTUPLEITEM(v, oparg);
INCREF(w);
PUSH(w);
}
}
DECREF(v);
break;
case UNPACK_LIST:
v = POP();
if (!is_listobject(v)) {
err_setstr(TypeError, "unpack non-list");
why = WHY_EXCEPTION;
}
else if (getlistsize(v) != oparg) {
err_setstr(ValueError,
"unpack list of wrong size");
why = WHY_EXCEPTION;
}
else {
if (!CHECK_STACK(oparg)) {
x = NULL;
break;
}
for (; --oparg >= 0; ) {
w = getlistitem(v, oparg);
INCREF(w);
PUSH(w);
}
}
DECREF(v);
break;
case STORE_ATTR:
w = GETNAMEV(oparg);
v = POP();
u = POP();
err = setattro(v, w, u); /* v.w = u */
DECREF(v);
DECREF(u);
break;
case DELETE_ATTR:
w = GETNAMEV(oparg);
v = POP();
err = setattro(v, w, (object *)NULL); /* del v.w */
DECREF(v);
break;
case STORE_GLOBAL:
w = GETNAMEV(oparg);
v = POP();
u = dict2lookup(f->f_locals, w);
if (u != NULL && is_accessobject(u)) {
err = setaccessvalue(u, f->f_globals, v);
DECREF(v);
break;
}
err = dict2insert(f->f_globals, w, v);
DECREF(v);
break;
case DELETE_GLOBAL:
w = GETNAMEV(oparg);
u = dict2lookup(f->f_locals, w);
if (u != NULL && is_accessobject(u)) {
err = setaccessvalue(u, f->f_globals,
(object *)NULL);
break;
}
if ((err = dict2remove(f->f_globals, w)) != 0)
err_setval(NameError, w);
break;
case LOAD_CONST:
x = GETCONST(oparg);
INCREF(x);
PUSH(x);
break;
case LOAD_NAME:
w = GETNAMEV(oparg);
x = dict2lookup(f->f_locals, w);
if (x == NULL) {
err_clear();
x = dict2lookup(f->f_globals, w);
if (x == NULL) {
err_clear();
x = dict2lookup(f->f_builtins, w);
if (x == NULL) {
err_setval(NameError, w);
break;
}
}
}
if (is_accessobject(x)) {
x = getaccessvalue(x, f->f_globals /* XXX */);
if (x == NULL)
break;
}
else
INCREF(x);
PUSH(x);
break;
case LOAD_GLOBAL:
w = GETNAMEV(oparg);
x = dict2lookup(f->f_globals, w);
if (x == NULL) {
err_clear();
x = dict2lookup(f->f_builtins, w);
if (x == NULL) {
err_setval(NameError, w);
break;
}
}
if (is_accessobject(x)) {
x = getaccessvalue(x, f->f_globals);
if (x == NULL)
break;
}
else
INCREF(x);
PUSH(x);
break;
case LOAD_LOCAL:
w = GETNAMEV(oparg);
x = dict2lookup(f->f_locals, w);
if (x == NULL) {
err_setval(NameError, w);
break;
}
if (is_accessobject(x)) {
x = getaccessvalue(x, f->f_locals);
if (x == NULL)
break;
}
else
INCREF(x);
PUSH(x);
break;
case RESERVE_FAST:
x = GETCONST(oparg);
if (x == None)
break;
if (x == NULL || !is_tupleobject(x)) {
err_setstr(SystemError, "bad RESERVE_FAST");
x = NULL;
break;
}
XDECREF(f->f_fastlocals);
XDECREF(f->f_localmap);
INCREF(x);
f->f_localmap = x;
f->f_fastlocals = x = newlistobject(gettuplesize(x));
fastlocals = (listobject *) x;
break;
case LOAD_FAST:
x = GETLISTITEM(fastlocals, oparg);
if (x == NULL) {
err_setval(NameError,
gettupleitem(f->f_localmap, oparg));
break;
}
if (is_accessobject(x)) {
x = getaccessvalue(x, f->f_locals);
if (x == NULL)
break;
}
else
INCREF(x);
PUSH(x);
break;
case STORE_FAST:
v = POP();
w = GETLISTITEM(fastlocals, oparg);
if (w != NULL && is_accessobject(w)) {
err = setaccessvalue(w, f->f_locals, v);
DECREF(v);
break;
}
GETLISTITEM(fastlocals, oparg) = v;
XDECREF(w);
break;
case DELETE_FAST:
x = GETLISTITEM(fastlocals, oparg);
if (x == NULL) {
err_setval(NameError,
gettupleitem(f->f_localmap, oparg));
break;
}
if (x != NULL && is_accessobject(x)) {
err = setaccessvalue(x, f->f_locals,
(object *)NULL);
break;
}
GETLISTITEM(fastlocals, oparg) = NULL;
DECREF(x);
break;
case BUILD_TUPLE:
x = newtupleobject(oparg);
if (x != NULL) {
for (; --oparg >= 0;) {
w = POP();
SETTUPLEITEM(x, oparg, w);
}
PUSH(x);
}
break;
case BUILD_LIST:
x = newlistobject(oparg);
if (x != NULL) {
for (; --oparg >= 0;) {
w = POP();
err = setlistitem(x, oparg, w);
if (err != 0)
break;
}
PUSH(x);
}
break;
case BUILD_MAP:
x = newdictobject();
PUSH(x);
break;
case LOAD_ATTR:
w = GETNAMEV(oparg);
v = POP();
x = getattro(v, w);
DECREF(v);
PUSH(x);
break;
case COMPARE_OP:
w = POP();
v = POP();
x = cmp_outcome(oparg, v, w);
DECREF(v);
DECREF(w);
PUSH(x);
break;
case IMPORT_NAME:
w = GETNAMEV(oparg);
x = dictlookup(f->f_builtins, "__import__");
if (x == NULL) {
err_setstr(ImportError,
"__import__ not found");
break;
}
if (is_methodobject(x)) {
u = None;
INCREF(u);
}
else {
u = find_from_args(f, INSTR_OFFSET());
if (u == NULL) {
x = u;
break;
}
}
w = mkvalue("(OOOO)", w, f->f_globals, f->f_locals, u);
DECREF(u);
if (w == NULL) {
x = NULL;
break;
}
x = call_object(x, w);
DECREF(w);
if (x)
PUSH(x);
break;
case IMPORT_FROM:
w = GETNAMEV(oparg);
v = TOP();
fast_2_locals(f);
err = import_from(f->f_locals, v, w);
locals_2_fast(f, 0);
break;
case ACCESS_MODE:
v = POP();
w = GETNAMEV(oparg);
if (getstringvalue(w)[0] == '*')
defmode = getintvalue(v);
else
err = access_statement(w, v, f);
DECREF(v);
break;
case JUMP_FORWARD:
JUMPBY(oparg);
break;
case JUMP_IF_FALSE:
err = testbool(TOP());
if (err > 0)
err = 0;
else if (err == 0)
JUMPBY(oparg);
break;
case JUMP_IF_TRUE:
err = testbool(TOP());
if (err > 0) {
err = 0;
JUMPBY(oparg);
}
break;
case JUMP_ABSOLUTE:
JUMPTO(oparg);
break;
case FOR_LOOP:
/* for v in s: ...
On entry: stack contains s, i.
On exit: stack contains s, i+1, s[i];
but if loop exhausted:
s, i are popped, and we jump */
w = POP(); /* Loop index */
v = POP(); /* Sequence object */
u = loop_subscript(v, w);
if (u != NULL) {
PUSH(v);
x = newintobject(getintvalue(w)+1);
PUSH(x);
DECREF(w);
PUSH(u);
}
else {
DECREF(v);
DECREF(w);
/* A NULL can mean "s exhausted"
but also an error: */
if (err_occurred())
why = WHY_EXCEPTION;
else
JUMPBY(oparg);
}
break;
case SETUP_LOOP:
case SETUP_EXCEPT:
case SETUP_FINALLY:
setup_block(f, opcode, INSTR_OFFSET() + oparg,
STACK_LEVEL());
break;
case SET_LINENO:
#ifdef LLTRACE
if (lltrace)
printf("--- %s:%d \n", filename, oparg);
#endif
f->f_lineno = oparg;
if (f->f_trace != NULL) {
/* Trace each line of code reached */
f->f_lasti = INSTR_OFFSET();
err = call_trace(&f->f_trace, &f->f_trace,
f, "line", None);
}
break;
default:
fprintf(stderr,
"XXX lineno: %d, opcode: %d\n",
f->f_lineno, opcode);
err_setstr(SystemError, "eval_code: unknown opcode");
why = WHY_EXCEPTION;
break;
#ifdef CASE_TOO_BIG
}
#endif
} /* switch */
on_error:
/* Quickly continue if no error occurred */
if (why == WHY_NOT) {
if (err == 0 && x != NULL)
continue; /* Normal, fast path */
why = WHY_EXCEPTION;
x = None;
err = 0;
}
#ifdef CHECKEXC
/* Double-check exception status */
if (why == WHY_EXCEPTION || why == WHY_RERAISE) {
if (!err_occurred()) {
fprintf(stderr, "XXX ghost error\n");
err_setstr(SystemError, "ghost error");
why = WHY_EXCEPTION;
}
}
else {
if (err_occurred())
fatal("XXX undetected error");
}
#endif
/* Log traceback info if this is a real exception */
if (why == WHY_EXCEPTION) {
f->f_lasti = INSTR_OFFSET() - 1;
if (HAS_ARG(opcode))
f->f_lasti -= 2;
tb_here(f);
if (f->f_trace)
call_exc_trace(&f->f_trace, &f->f_trace, f);
if (sys_profile)
call_exc_trace(&sys_profile, (object**)0, f);
}
/* For the rest, treat WHY_RERAISE as WHY_EXCEPTION */
if (why == WHY_RERAISE)
why = WHY_EXCEPTION;
/* Unwind stacks if a (pseudo) exception occurred */
while (why != WHY_NOT && f->f_iblock > 0) {
block *b = pop_block(f);
while (STACK_LEVEL() > b->b_level) {
v = POP();
XDECREF(v);
}
if (b->b_type == SETUP_LOOP && why == WHY_BREAK) {
why = WHY_NOT;
JUMPTO(b->b_handler);
break;
}
if (b->b_type == SETUP_FINALLY ||
b->b_type == SETUP_EXCEPT &&
why == WHY_EXCEPTION) {
if (why == WHY_EXCEPTION) {
object *exc, *val, *tb;
err_fetch(&exc, &val, &tb);
if (val == NULL) {
val = None;
INCREF(val);
}
/* Make the raw exception data
available to the handler,
so a program can emulate the
Python main loop. Don't do
this for 'finally'. */
if (b->b_type == SETUP_EXCEPT) {
sysset("exc_traceback", tb);
sysset("exc_value", val);
sysset("exc_type", exc);
}
PUSH(tb);
PUSH(val);
PUSH(exc);
}
else {
if (why == WHY_RETURN)
PUSH(retval);
v = newintobject((long)why);
PUSH(v);
}
why = WHY_NOT;
JUMPTO(b->b_handler);
break;
}
} /* unwind stack */
/* End the loop if we still have an error (or return) */
if (why != WHY_NOT)
break;
} /* main loop */
/* Pop remaining stack entries */
while (!EMPTY()) {
v = POP();
XDECREF(v);
}
if (why != WHY_RETURN)
retval = NULL;
if (f->f_trace) {
if (why == WHY_RETURN) {
if (call_trace(&f->f_trace, &f->f_trace, f,
"return", retval)) {
XDECREF(retval);
retval = NULL;
why = WHY_EXCEPTION;
}
}
}
if (sys_profile && why == WHY_RETURN) {
if (call_trace(&sys_profile, (object**)0,
f, "return", retval)) {
XDECREF(retval);
retval = NULL;
why = WHY_EXCEPTION;
}
}
/* Restore previous frame and release the current one */
current_frame = f->f_back;
DECREF(f);
if (needmerge)
locals_2_fast(current_frame, 1);
return retval;
}
#ifdef LLTRACE
static int
prtrace(v, str)
object *v;
char *str;
{
printf("%s ", str);
if (printobject(v, stdout, 0) != 0)
err_clear(); /* Don't know what else to do */
printf("\n");
}
#endif
static void
call_exc_trace(p_trace, p_newtrace, f)
object **p_trace, **p_newtrace;
frameobject *f;
{
object *type, *value, *traceback, *arg;
int err;
err_fetch(&type, &value, &traceback);
if (value == NULL) {
value = None;
INCREF(value);
}
arg = mkvalue("(OOO)", type, value, traceback);
if (arg == NULL) {
err_restore(type, value, traceback);
return;
}
err = call_trace(p_trace, p_newtrace, f, "exception", arg);
DECREF(arg);
if (err == 0)
err_restore(type, value, traceback);
else {
XDECREF(type);
XDECREF(value);
XDECREF(traceback);
}
}
static int
call_trace(p_trace, p_newtrace, f, msg, arg)
object **p_trace; /* in/out; may not be NULL;
may not point to NULL variable initially */
object **p_newtrace; /* in/out; may be NULL;
may point to NULL variable;
may be same variable as p_newtrace */
frameobject *f;
char *msg;
object *arg;
{
object *arglist, *what;
object *res = NULL;
static int tracing = 0;
if (tracing) {
/* Don't do recursive traces */
if (p_newtrace) {
XDECREF(*p_newtrace);
*p_newtrace = NULL;
}
return 0;
}
arglist = newtupleobject(3);
if (arglist == NULL)
goto cleanup;
what = newstringobject(msg);
if (what == NULL)
goto cleanup;
INCREF(f);
SETTUPLEITEM(arglist, 0, (object *)f);
SETTUPLEITEM(arglist, 1, what);
if (arg == NULL)
arg = None;
INCREF(arg);
SETTUPLEITEM(arglist, 2, arg);
tracing++;
fast_2_locals(f);
res = call_object(*p_trace, arglist); /* May clear *p_trace! */
locals_2_fast(f, 1);
tracing--;
cleanup:
XDECREF(arglist);
if (res == NULL) {
/* The trace proc raised an exception */
tb_here(f);
XDECREF(*p_trace);
*p_trace = NULL;
if (p_newtrace) {
XDECREF(*p_newtrace);
*p_newtrace = NULL;
}
return -1;
}
else {
if (p_newtrace) {
XDECREF(*p_newtrace);
if (res == None)
*p_newtrace = NULL;
else {
INCREF(res);
*p_newtrace = res;
}
}
DECREF(res);
return 0;
}
}
object *
getbuiltins()
{
if (current_frame == NULL)
return getbuiltinmod();
else
return current_frame->f_builtins;
}
object *
getlocals()
{
if (current_frame == NULL)
return NULL;
fast_2_locals(current_frame);
return current_frame->f_locals;
}
object *
getglobals()
{
if (current_frame == NULL)
return NULL;
else
return current_frame->f_globals;
}
object *
getowner()
{
if (current_frame == NULL)
return NULL;
else
return current_frame->f_owner;
}
object *
getframe()
{
return (object *)current_frame;
}
int
getrestricted()
{
return current_frame == NULL ? 0 : current_frame->f_restricted;
}
void
flushline()
{
object *f = sysget("stdout");
if (softspace(f, 0))
writestring("\n", f);
}
#define BINOP(opname, ropname, thisfunc) \
if (!is_instanceobject(v) && !is_instanceobject(w)) \
; \
else \
return instancebinop(v, w, opname, ropname, thisfunc)
static object *
or(v, w)
object *v, *w;
{
BINOP("__or__", "__ror__", or);
if (v->ob_type->tp_as_number != NULL) {
object *x;
object * (*f) FPROTO((object *, object *));
if (coerce(&v, &w) != 0)
return NULL;
if ((f = v->ob_type->tp_as_number->nb_or) != NULL)
x = (*f)(v, w);
DECREF(v);
DECREF(w);
if (f != NULL)
return x;
}
err_setstr(TypeError, "bad operand type(s) for |");
return NULL;
}
static object *
xor(v, w)
object *v, *w;
{
BINOP("__xor__", "__rxor__", xor);
if (v->ob_type->tp_as_number != NULL) {
object *x;
object * (*f) FPROTO((object *, object *));
if (coerce(&v, &w) != 0)
return NULL;
if ((f = v->ob_type->tp_as_number->nb_xor) != NULL)
x = (*f)(v, w);
DECREF(v);
DECREF(w);
if (f != NULL)
return x;
}
err_setstr(TypeError, "bad operand type(s) for ^");
return NULL;
}
static object *
and(v, w)
object *v, *w;
{
BINOP("__and__", "__rand__", and);
if (v->ob_type->tp_as_number != NULL) {
object *x;
object * (*f) FPROTO((object *, object *));
if (coerce(&v, &w) != 0)
return NULL;
if ((f = v->ob_type->tp_as_number->nb_and) != NULL)
x = (*f)(v, w);
DECREF(v);
DECREF(w);
if (f != NULL)
return x;
}
err_setstr(TypeError, "bad operand type(s) for &");
return NULL;
}
static object *
lshift(v, w)
object *v, *w;
{
BINOP("__lshift__", "__rlshift__", lshift);
if (v->ob_type->tp_as_number != NULL) {
object *x;
object * (*f) FPROTO((object *, object *));
if (coerce(&v, &w) != 0)
return NULL;
if ((f = v->ob_type->tp_as_number->nb_lshift) != NULL)
x = (*f)(v, w);
DECREF(v);
DECREF(w);
if (f != NULL)
return x;
}
err_setstr(TypeError, "bad operand type(s) for <<");
return NULL;
}
static object *
rshift(v, w)
object *v, *w;
{
BINOP("__rshift__", "__rrshift__", rshift);
if (v->ob_type->tp_as_number != NULL) {
object *x;
object * (*f) FPROTO((object *, object *));
if (coerce(&v, &w) != 0)
return NULL;
if ((f = v->ob_type->tp_as_number->nb_rshift) != NULL)
x = (*f)(v, w);
DECREF(v);
DECREF(w);
if (f != NULL)
return x;
}
err_setstr(TypeError, "bad operand type(s) for >>");
return NULL;
}
static object *
add(v, w)
object *v, *w;
{
BINOP("__add__", "__radd__", add);
if (v->ob_type->tp_as_sequence != NULL)
return (*v->ob_type->tp_as_sequence->sq_concat)(v, w);
else if (v->ob_type->tp_as_number != NULL) {
object *x;
if (coerce(&v, &w) != 0)
return NULL;
x = (*v->ob_type->tp_as_number->nb_add)(v, w);
DECREF(v);
DECREF(w);
return x;
}
err_setstr(TypeError, "bad operand type(s) for +");
return NULL;
}
static object *
sub(v, w)
object *v, *w;
{
BINOP("__sub__", "__rsub__", sub);
if (v->ob_type->tp_as_number != NULL) {
object *x;
if (coerce(&v, &w) != 0)
return NULL;
x = (*v->ob_type->tp_as_number->nb_subtract)(v, w);
DECREF(v);
DECREF(w);
return x;
}
err_setstr(TypeError, "bad operand type(s) for -");
return NULL;
}
static object *
mul(v, w)
object *v, *w;
{
typeobject *tp;
tp = v->ob_type;
BINOP("__mul__", "__rmul__", mul);
if (tp->tp_as_number != NULL &&
w->ob_type->tp_as_sequence != NULL &&
!is_instanceobject(v)) {
/* number*sequence -- swap v and w */
object *tmp = v;
v = w;
w = tmp;
tp = v->ob_type;
}
if (tp->tp_as_number != NULL) {
object *x;
if (is_instanceobject(v)) {
/* Instances of user-defined classes get their
other argument uncoerced, so they may
implement sequence*number as well as
number*number. */
INCREF(v);
INCREF(w);
}
else if (coerce(&v, &w) != 0)
return NULL;
x = (*v->ob_type->tp_as_number->nb_multiply)(v, w);
DECREF(v);
DECREF(w);
return x;
}
if (tp->tp_as_sequence != NULL) {
if (!is_intobject(w)) {
err_setstr(TypeError,
"can't multiply sequence with non-int");
return NULL;
}
return (*tp->tp_as_sequence->sq_repeat)
(v, (int)getintvalue(w));
}
err_setstr(TypeError, "bad operand type(s) for *");
return NULL;
}
static object *
divide(v, w)
object *v, *w;
{
BINOP("__div__", "__rdiv__", divide);
if (v->ob_type->tp_as_number != NULL) {
object *x;
if (coerce(&v, &w) != 0)
return NULL;
x = (*v->ob_type->tp_as_number->nb_divide)(v, w);
DECREF(v);
DECREF(w);
return x;
}
err_setstr(TypeError, "bad operand type(s) for /");
return NULL;
}
static object *
mod(v, w)
object *v, *w;
{
if (is_stringobject(v)) {
return formatstring(v, w);
}
BINOP("__mod__", "__rmod__", mod);
if (v->ob_type->tp_as_number != NULL) {
object *x;
if (coerce(&v, &w) != 0)
return NULL;
x = (*v->ob_type->tp_as_number->nb_remainder)(v, w);
DECREF(v);
DECREF(w);
return x;
}
err_setstr(TypeError, "bad operand type(s) for %");
return NULL;
}
static object *
neg(v)
object *v;
{
if (v->ob_type->tp_as_number != NULL)
return (*v->ob_type->tp_as_number->nb_negative)(v);
err_setstr(TypeError, "bad operand type(s) for unary -");
return NULL;
}
static object *
pos(v)
object *v;
{
if (v->ob_type->tp_as_number != NULL)
return (*v->ob_type->tp_as_number->nb_positive)(v);
err_setstr(TypeError, "bad operand type(s) for unary +");
return NULL;
}
static object *
invert(v)
object *v;
{
object * (*f) FPROTO((object *));
if (v->ob_type->tp_as_number != NULL &&
(f = v->ob_type->tp_as_number->nb_invert) != NULL)
return (*f)(v);
err_setstr(TypeError, "bad operand type(s) for unary ~");
return NULL;
}
static object *
not(v)
object *v;
{
int outcome = testbool(v);
object *w;
if (outcome < 0)
return NULL;
if (outcome == 0)
w = True;
else
w = False;
INCREF(w);
return w;
}
/* External interface to call any callable object. The arg may be NULL. */
object *
call_object(func, arg)
object *func;
object *arg;
{
binaryfunc call;
object *result;
if (call = func->ob_type->tp_call)
result = (*call)(func, arg);
else if (is_instancemethodobject(func) || is_funcobject(func))
result = call_function(func, arg);
else
result = call_builtin(func, arg);
if (result == NULL && !err_occurred())
fatal("null result without error in call_object");
return result;
}
static object *
call_builtin(func, arg)
object *func;
object *arg;
{
if (is_methodobject(func)) {
method meth = getmethod(func);
object *self = getself(func);
if (!getvarargs(func) && arg != NULL && is_tupleobject(arg)) {
int size = gettuplesize(arg);
if (size == 1)
arg = GETTUPLEITEM(arg, 0);
else if (size == 0)
arg = NULL;
}
return (*meth)(self, arg);
}
if (is_classobject(func)) {
return newinstanceobject(func, arg);
}
if (is_instanceobject(func)) {
object *res, *call = getattr(func,"__call__");
if (call == NULL) {
err_clear();
err_setstr(AttributeError, "no __call__ method defined");
return NULL;
}
res = call_object(call, arg);
DECREF(call);
return res;
}
err_setstr(TypeError, "call of non-function");
return NULL;
}
static object *
call_function(func, arg)
object *func;
object *arg;
{
object *newarg = NULL;
object *newlocals, *newglobals;
object *class = NULL;
object *co, *v;
object *argdefs;
int argcount;
if (is_instancemethodobject(func)) {
object *self = instancemethodgetself(func);
class = instancemethodgetclass(func);
func = instancemethodgetfunc(func);
if (self == NULL) {
/* Unbound methods must be called with an instance of
the class (or a derived class) as first argument */
if (arg != NULL && is_tupleobject(arg) &&
gettuplesize(arg) >= 1) {
self = GETTUPLEITEM(arg, 0);
if (self != NULL &&
is_instanceobject(self) &&
issubclass((object *)
(((instanceobject *)self)->in_class),
class))
/* self = self */ ;
else
self = NULL;
}
if (self == NULL) {
err_setstr(TypeError,
"unbound method must be called with class instance argument");
return NULL;
}
}
else {
if (arg == NULL)
argcount = 0;
else if (is_tupleobject(arg))
argcount = gettuplesize(arg);
else
argcount = 1;
newarg = newtupleobject(argcount + 1);
if (newarg == NULL)
return NULL;
INCREF(self);
SETTUPLEITEM(newarg, 0, self);
if (arg != NULL && !is_tupleobject(arg)) {
INCREF(arg);
SETTUPLEITEM(newarg, 1, arg);
}
else {
int i;
object *v;
for (i = 0; i < argcount; i++) {
v = GETTUPLEITEM(arg, i);
XINCREF(v);
SETTUPLEITEM(newarg, i+1, v);
}
}
arg = newarg;
}
}
else {
if (!is_funcobject(func)) {
err_setstr(TypeError, "call of non-function");
return NULL;
}
}
argdefs = getfuncargstuff(func, &argcount);
if (argdefs != NULL && arg != NULL && is_tupleobject(arg)) {
int actualcount, j;
/* Process default arguments */
if (argcount & 0x4000)
argcount ^= 0x4000;
actualcount = gettuplesize(arg);
j = gettuplesize(argdefs) - (argcount - actualcount);
if (actualcount < argcount && j >= 0) {
int i;
object *v;
if (newarg == NULL)
INCREF(arg);
newarg = newtupleobject(argcount);
if (newarg == NULL) {
DECREF(arg);
return NULL;
}
for (i = 0; i < actualcount; i++) {
v = GETTUPLEITEM(arg, i);
XINCREF(v);
SETTUPLEITEM(newarg, i, v);
}
for (; i < argcount; i++, j++) {
v = GETTUPLEITEM(argdefs, j);
XINCREF(v);
SETTUPLEITEM(newarg, i, v);
}
DECREF(arg);
arg = newarg;
}
}
co = getfunccode(func);
if (co == NULL) {
XDECREF(newarg);
return NULL;
}
if (!is_codeobject(co))
fatal("XXX Bad code");
newlocals = newdictobject();
if (newlocals == NULL) {
XDECREF(newarg);
return NULL;
}
newglobals = getfuncglobals(func);
INCREF(newglobals);
v = eval_code((codeobject *)co, newglobals, newlocals, class, arg);
DECREF(newlocals);
DECREF(newglobals);
XDECREF(newarg);
return v;
}
static object *
apply_subscript(v, w)
object *v, *w;
{
typeobject *tp = v->ob_type;
if (tp->tp_as_sequence == NULL && tp->tp_as_mapping == NULL) {
err_setstr(TypeError, "unsubscriptable object");
return NULL;
}
if (tp->tp_as_mapping != NULL) {
return (*tp->tp_as_mapping->mp_subscript)(v, w);
}
else {
int i;
if (!is_intobject(w)) {
err_setstr(TypeError, "sequence subscript not int");
return NULL;
}
i = getintvalue(w);
if (i < 0) {
int len = (*tp->tp_as_sequence->sq_length)(v);
if (len < 0)
return NULL;
i += len;
}
return (*tp->tp_as_sequence->sq_item)(v, i);
}
}
static object *
loop_subscript(v, w)
object *v, *w;
{
sequence_methods *sq = v->ob_type->tp_as_sequence;
int i;
if (sq == NULL) {
err_setstr(TypeError, "loop over non-sequence");
return NULL;
}
i = getintvalue(w);
v = (*sq->sq_item)(v, i);
if (v)
return v;
if (err_occurred() == IndexError)
err_clear();
return NULL;
}
static int
slice_index(v, isize, pi)
object *v;
int isize;
int *pi;
{
if (v != NULL) {
if (!is_intobject(v)) {
err_setstr(TypeError, "slice index must be int");
return -1;
}
*pi = getintvalue(v);
if (*pi < 0)
*pi += isize;
}
return 0;
}
static object *
apply_slice(u, v, w) /* return u[v:w] */
object *u, *v, *w;
{
typeobject *tp = u->ob_type;
int ilow, ihigh, isize;
if (tp->tp_as_sequence == NULL) {
err_setstr(TypeError, "only sequences can be sliced");
return NULL;
}
ilow = 0;
isize = ihigh = (*tp->tp_as_sequence->sq_length)(u);
if (isize < 0)
return NULL;
if (slice_index(v, isize, &ilow) != 0)
return NULL;
if (slice_index(w, isize, &ihigh) != 0)
return NULL;
return (*tp->tp_as_sequence->sq_slice)(u, ilow, ihigh);
}
static int
assign_subscript(w, key, v) /* w[key] = v */
object *w;
object *key;
object *v;
{
typeobject *tp = w->ob_type;
sequence_methods *sq;
mapping_methods *mp;
int (*func1)();
int (*func2)();
if ((mp = tp->tp_as_mapping) != NULL &&
(func1 = mp->mp_ass_subscript) != NULL) {
return (*func1)(w, key, v);
}
else if ((sq = tp->tp_as_sequence) != NULL &&
(func2 = sq->sq_ass_item) != NULL) {
if (!is_intobject(key)) {
err_setstr(TypeError,
"sequence subscript must be integer (assign or del)");
return -1;
}
else {
int i = getintvalue(key);
if (i < 0) {
int len = (*sq->sq_length)(w);
if (len < 0)
return -1;
i += len;
}
return (*func2)(w, i, v);
}
}
else {
err_setstr(TypeError,
"can't assign to this subscripted object");
return -1;
}
}
static int
assign_slice(u, v, w, x) /* u[v:w] = x */
object *u, *v, *w, *x;
{
sequence_methods *sq = u->ob_type->tp_as_sequence;
int ilow, ihigh, isize;
if (sq == NULL) {
err_setstr(TypeError, "assign to slice of non-sequence");
return -1;
}
if (sq == NULL || sq->sq_ass_slice == NULL) {
err_setstr(TypeError, "unassignable slice");
return -1;
}
ilow = 0;
isize = ihigh = (*sq->sq_length)(u);
if (isize < 0)
return -1;
if (slice_index(v, isize, &ilow) != 0)
return -1;
if (slice_index(w, isize, &ihigh) != 0)
return -1;
return (*sq->sq_ass_slice)(u, ilow, ihigh, x);
}
static int
cmp_exception(err, v)
object *err, *v;
{
if (is_tupleobject(v)) {
int i, n;
n = gettuplesize(v);
for (i = 0; i < n; i++) {
/* Test recursively */
if (cmp_exception(err, GETTUPLEITEM(v, i)))
return 1;
}
return 0;
}
if (is_classobject(v) && is_classobject(err))
return issubclass(err, v);
return err == v;
}
static int
cmp_member(v, w)
object *v, *w;
{
int i, cmp;
object *x;
sequence_methods *sq;
/* Special case for char in string */
if (is_stringobject(w)) {
register char *s, *end;
register char c;
if (!is_stringobject(v) || getstringsize(v) != 1) {
err_setstr(TypeError,
"string member test needs char left operand");
return -1;
}
c = getstringvalue(v)[0];
s = getstringvalue(w);
end = s + getstringsize(w);
while (s < end) {
if (c == *s++)
return 1;
}
return 0;
}
sq = w->ob_type->tp_as_sequence;
if (sq == NULL) {
err_setstr(TypeError,
"'in' or 'not in' needs sequence right argument");
return -1;
}
for (i = 0; ; i++) {
x = (*sq->sq_item)(w, i);
if (x == NULL) {
if (err_occurred() == IndexError) {
err_clear();
break;
}
return -1;
}
cmp = cmpobject(v, x);
XDECREF(x);
if (cmp == 0)
return 1;
}
return 0;
}
static object *
cmp_outcome(op, v, w)
int op;
register object *v;
register object *w;
{
register int cmp;
register int res = 0;
switch (op) {
case IS:
case IS_NOT:
res = (v == w);
if (op == (int) IS_NOT)
res = !res;
break;
case IN:
case NOT_IN:
res = cmp_member(v, w);
if (res < 0)
return NULL;
if (op == (int) NOT_IN)
res = !res;
break;
case EXC_MATCH:
res = cmp_exception(v, w);
break;
default:
cmp = cmpobject(v, w);
switch (op) {
case LT: res = cmp < 0; break;
case LE: res = cmp <= 0; break;
case EQ: res = cmp == 0; break;
case NE: res = cmp != 0; break;
case GT: res = cmp > 0; break;
case GE: res = cmp >= 0; break;
/* XXX no default? (res is initialized to 0 though) */
}
}
v = res ? True : False;
INCREF(v);
return v;
}
static int
import_from(locals, v, name)
object *locals;
object *v;
object *name;
{
object *w, *x;
if (!is_moduleobject(v)) {
err_setstr(TypeError, "import-from requires module object");
return -1;
}
w = getmoduledict(v);
if (getstringvalue(name)[0] == '*') {
int pos, err;
object *name, *value;
pos = 0;
while (mappinggetnext(w, &pos, &name, &value)) {
if (!is_stringobject(name) ||
getstringvalue(name)[0] == '_')
continue;
if (is_accessobject(value)) {
value = getaccessvalue(value, (object *)NULL);
if (value == NULL) {
err_clear();
continue;
}
}
else
INCREF(value);
err = dict2insert(locals, name, value);
DECREF(value);
if (err != 0)
return -1;
}
return 0;
}
else {
x = dict2lookup(w, name);
if (x == NULL) {
char buf[250];
sprintf(buf, "cannot import name %.230s",
getstringvalue(name));
err_setstr(ImportError, buf);
return -1;
}
else
return dict2insert(locals, name, x);
}
}
static object *
build_class(methods, bases, name)
object *methods; /* dictionary */
object *bases; /* tuple containing classes */
object *name; /* string */
{
int i;
if (!is_tupleobject(bases)) {
err_setstr(SystemError, "build_class with non-tuple bases");
return NULL;
}
if (gettuplesize(bases) > 0) {
object *base;
base = GETTUPLEITEM(bases, 0);
/* Call the base's *type*, if it is callable.
This code is a hook for Donald Beaudry's type extensions.
In unexended Python it will never be triggered since its
types are not callable. */
if (base->ob_type->ob_type->tp_call) {
object *args;
object *class;
args = mkvalue("(OOO)", name, bases, methods);
class = call_object((object *)base->ob_type, args);
DECREF(args);
return class;
}
}
if (!is_dictobject(methods)) {
err_setstr(SystemError, "build_class with non-dictionary");
return NULL;
}
if (!is_stringobject(name)) {
err_setstr(SystemError, "build_class witn non-string name");
return NULL;
}
for (i = gettuplesize(bases); --i >= 0; ) {
object *base = GETTUPLEITEM(bases, i);
if (!is_classobject(base)) {
err_setstr(TypeError,
"base is not a class object");
return NULL;
}
}
return newclassobject(bases, methods, name);
}
static int
access_statement(name, vmode, f)
object *name;
object *vmode;
frameobject *f;
{
int mode = getintvalue(vmode);
object *value, *ac;
typeobject *type;
int fastind, ret;
fastind = -1;
if (f->f_localmap == NULL)
value = dict2lookup(f->f_locals, name);
else {
object *map = f->f_localmap;
value = NULL;
for (fastind = gettuplesize(map); --fastind >= 0; ) {
object *fname = GETTUPLEITEM(map, fastind);
if (cmpobject(name, fname) == 0) {
value = getlistitem(f->f_fastlocals, fastind);
break;
}
}
}
if (value && is_accessobject(value)) {
err_setstr(AccessError, "can't override access");
return -1;
}
err_clear();
if (value != NULL && value != None)
type = value->ob_type;
else
type = NULL;
ac = newaccessobject(value, f->f_locals, type, mode);
if (ac == NULL)
return -1;
if (fastind >= 0)
ret = setlistitem(f->f_fastlocals, fastind, ac);
else {
ret = dict2insert(f->f_locals, name, ac);
DECREF(ac);
}
return ret;
}
static int
exec_statement(prog, globals, locals)
object *prog;
object *globals;
object *locals;
{
char *s;
int n;
object *v;
if (is_tupleobject(prog) && globals == None && locals == None &&
((n = gettuplesize(prog)) == 2 || n == 3)) {
/* Backward compatibility hack */
globals = gettupleitem(prog, 1);
if (n == 3)
locals = gettupleitem(prog, 2);
prog = gettupleitem(prog, 0);
}
if (globals == None) {
globals = getglobals();
if (locals == None)
locals = getlocals();
}
else if (locals == None)
locals = globals;
if (!is_stringobject(prog) &&
!is_codeobject(prog) &&
!is_fileobject(prog)) {
err_setstr(TypeError,
"exec 1st arg must be string, code or file object");
return -1;
}
if (!is_dictobject(globals) || !is_dictobject(locals)) {
err_setstr(TypeError,
"exec 2nd/3rd args must be dict or None");
return -1;
}
if (dictlookup(globals, "__builtins__") == NULL)
dictinsert(globals, "__builtins__", current_frame->f_builtins);
if (is_codeobject(prog)) {
if (eval_code((codeobject *) prog, globals, locals,
(object *)NULL, (object *)NULL) == NULL)
return -1;
return 0;
}
if (is_fileobject(prog)) {
FILE *fp = getfilefile(prog);
char *name = getstringvalue(getfilename(prog));
if (run_file(fp, name, file_input, globals, locals) == NULL)
return -1;
return 0;
}
s = getstringvalue(prog);
if (strlen(s) != getstringsize(prog)) {
err_setstr(ValueError, "embedded '\\0' in exec string");
return -1;
}
if ((v = run_string(s, file_input, globals, locals)) == NULL)
return -1;
DECREF(v);
return 0;
}
/* Hack for Ken Manheimer */
static object *
find_from_args(f, nexti)
frameobject *f;
int nexti;
{
int opcode;
int oparg;
object *list, *name;
unsigned char *next_instr;
next_instr = GETUSTRINGVALUE(f->f_code->co_code) + nexti;
opcode = (*next_instr++);
if (opcode != IMPORT_FROM) {
INCREF(None);
return None;
}
list = newlistobject(0);
if (list == NULL)
return NULL;
do {
oparg = (next_instr += 2, (next_instr[-1]<<8) + next_instr[-2]);
name = Getnamev(f, oparg);
if (addlistitem(list, name) < 0) {
DECREF(list);
break;
}
opcode = (*next_instr++);
} while (opcode == IMPORT_FROM);
return list;
}
