2 see copyright notice in squirrel.h
\r
4 #include "sqpcheader.h"
\r
7 #include "sqopcodes.h"
\r
8 #include "sqfuncproto.h"
\r
10 #include "sqclosure.h"
\r
11 #include "sqstring.h"
\r
12 #include "sqtable.h"
\r
13 #include "squserdata.h"
\r
14 #include "sqarray.h"
\r
15 #include "sqclass.h"
\r
17 #define TOP() (_stack._vals[_top-1])
\r
19 #define CLEARSTACK(_last_top) { if((_last_top) >= _top) ClearStack(_last_top); }
\r
20 void SQVM::ClearStack(SQInteger last_top)
\r
22 SQObjectType tOldType;
\r
23 SQObjectValue unOldVal;
\r
24 while (last_top >= _top) {
\r
25 SQObjectPtr &o = _stack._vals[last_top--];
\r
27 unOldVal = o._unVal;
\r
29 o._unVal.pUserPointer = NULL;
\r
30 __Release(tOldType,unOldVal);
\r
34 bool SQVM::BW_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
\r
37 SQInteger i1 = _integer(o1), i2 = _integer(o2);
\r
38 if((type(o1)==OT_INTEGER) && (type(o2)==OT_INTEGER))
\r
41 case BW_AND: res = i1 & i2; break;
\r
42 case BW_OR: res = i1 | i2; break;
\r
43 case BW_XOR: res = i1 ^ i2; break;
\r
44 case BW_SHIFTL: res = i1 << i2; break;
\r
45 case BW_SHIFTR: res = i1 >> i2; break;
\r
46 case BW_USHIFTR:res = (SQInteger)(*((SQUnsignedInteger*)&i1) >> i2); break;
\r
47 default: { Raise_Error(_SC("internal vm error bitwise op failed")); return false; }
\r
50 else { Raise_Error(_SC("bitwise op between '%s' and '%s'"),GetTypeName(o1),GetTypeName(o2)); return false;}
\r
55 bool SQVM::ARITH_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
\r
57 if(sq_isnumeric(o1) && sq_isnumeric(o2)) {
\r
58 if((type(o1)==OT_INTEGER) && (type(o2)==OT_INTEGER)) {
\r
59 SQInteger res, i1 = _integer(o1), i2 = _integer(o2);
\r
61 case '+': res = i1 + i2; break;
\r
62 case '-': res = i1 - i2; break;
\r
63 case '/': if(i2 == 0) { Raise_Error(_SC("division by zero")); return false; }
\r
66 case '*': res = i1 * i2; break;
\r
67 case '%': if(i2 == 0) { Raise_Error(_SC("modulo by zero")); return false; }
\r
70 default: res = 0xDEADBEEF;
\r
74 SQFloat res, f1 = tofloat(o1), f2 = tofloat(o2);
\r
76 case '+': res = f1 + f2; break;
\r
77 case '-': res = f1 - f2; break;
\r
78 case '/': res = f1 / f2; break;
\r
79 case '*': res = f1 * f2; break;
\r
80 case '%': res = SQFloat(fmod((double)f1,(double)f2)); break;
\r
81 default: res = 0x0f;
\r
86 if(op == '+' && (type(o1) == OT_STRING || type(o2) == OT_STRING)){
\r
87 if(!StringCat(o1, o2, trg)) return false;
\r
89 else if(!ArithMetaMethod(op,o1,o2,trg)) {
\r
90 Raise_Error(_SC("arith op %c on between '%s' and '%s'"),op,GetTypeName(o1),GetTypeName(o2)); return false;
\r
96 SQVM::SQVM(SQSharedState *ss)
\r
99 _suspended = SQFalse;
\r
100 _suspended_target=-1;
\r
101 _suspended_root = SQFalse;
\r
102 _suspended_traps=-1;
\r
105 _lasterror = _null_;
\r
106 _errorhandler = _null_;
\r
107 _debughook = _null_;
\r
109 INIT_CHAIN();ADD_TO_CHAIN(&_ss(this)->_gc_chain,this);
\r
112 void SQVM::Finalize()
\r
114 _roottable = _null_;
\r
115 _lasterror = _null_;
\r
116 _errorhandler = _null_;
\r
117 _debughook = _null_;
\r
119 _callstackdata.resize(0);
\r
120 SQInteger size=_stack.size();
\r
121 for(SQInteger i=0;i<size;i++)
\r
128 //sq_free(_callsstack,_alloccallsstacksize*sizeof(CallInfo));
\r
129 REMOVE_FROM_CHAIN(&_ss(this)->_gc_chain,this);
\r
132 bool SQVM::ArithMetaMethod(SQInteger op,const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &dest)
\r
136 case _SC('+'): mm=MT_ADD; break;
\r
137 case _SC('-'): mm=MT_SUB; break;
\r
138 case _SC('/'): mm=MT_DIV; break;
\r
139 case _SC('*'): mm=MT_MUL; break;
\r
140 case _SC('%'): mm=MT_MODULO; break;
\r
141 default: mm = MT_ADD; assert(0); break; //shutup compiler
\r
143 if(is_delegable(o1) && _delegable(o1)->_delegate) {
\r
145 return CallMetaMethod(_delegable(o1),mm,2,dest);
\r
150 bool SQVM::NEG_OP(SQObjectPtr &trg,const SQObjectPtr &o)
\r
155 trg = -_integer(o);
\r
163 if(_delegable(o)->_delegate) {
\r
165 if(CallMetaMethod(_delegable(o), MT_UNM, 1, temp_reg)) {
\r
170 default:break; //shutup compiler
\r
172 Raise_Error(_SC("attempt to negate a %s"), GetTypeName(o));
\r
176 #define _RET_SUCCEED(exp) { result = (exp); return true; }
\r
177 bool SQVM::ObjCmp(const SQObjectPtr &o1,const SQObjectPtr &o2,SQInteger &result)
\r
179 if(type(o1)==type(o2)){
\r
180 if(_rawval(o1)==_rawval(o2))_RET_SUCCEED(0);
\r
184 _RET_SUCCEED(scstrcmp(_stringval(o1),_stringval(o2)));
\r
186 _RET_SUCCEED(_integer(o1)-_integer(o2));
\r
188 _RET_SUCCEED((_float(o1)<_float(o2))?-1:1);
\r
192 if(_delegable(o1)->_delegate) {
\r
194 if(CallMetaMethod(_delegable(o1),MT_CMP,2,res)) break;
\r
196 //continues through (no break needed)
\r
198 _RET_SUCCEED( _userpointer(o1) < _userpointer(o2)?-1:1 );
\r
200 if(type(res)!=OT_INTEGER) { Raise_CompareError(o1,o2); return false; }
\r
201 _RET_SUCCEED(_integer(res));
\r
205 if(sq_isnumeric(o1) && sq_isnumeric(o2)){
\r
206 if((type(o1)==OT_INTEGER) && (type(o2)==OT_FLOAT)) {
\r
207 if( _integer(o1)==_float(o2) ) { _RET_SUCCEED(0); }
\r
208 else if( _integer(o1)<_float(o2) ) { _RET_SUCCEED(-1); }
\r
212 if( _float(o1)==_integer(o2) ) { _RET_SUCCEED(0); }
\r
213 else if( _float(o1)<_integer(o2) ) { _RET_SUCCEED(-1); }
\r
217 else if(type(o1)==OT_NULL) {_RET_SUCCEED(-1);}
\r
218 else if(type(o2)==OT_NULL) {_RET_SUCCEED(1);}
\r
219 else { Raise_CompareError(o1,o2); return false; }
\r
223 _RET_SUCCEED(0); //cannot happen
\r
226 bool SQVM::CMP_OP(CmpOP op, const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &res)
\r
229 if(ObjCmp(o1,o2,r)) {
\r
231 case CMP_G: res = (r > 0)?_true_:_false_; return true;
\r
232 case CMP_GE: res = (r >= 0)?_true_:_false_; return true;
\r
233 case CMP_L: res = (r < 0)?_true_:_false_; return true;
\r
234 case CMP_LE: res = (r <= 0)?_true_:_false_; return true;
\r
242 void SQVM::ToString(const SQObjectPtr &o,SQObjectPtr &res)
\r
249 scsprintf(_sp(rsl(NUMBER_MAX_CHAR+1)),_SC("%g"),_float(o));
\r
252 scsprintf(_sp(rsl(NUMBER_MAX_CHAR+1)),_SC("%d"),_integer(o));
\r
255 scsprintf(_sp(rsl(6)),_integer(o)?_SC("true"):_SC("false"));
\r
260 if(_delegable(o)->_delegate) {
\r
262 if(CallMetaMethod(_delegable(o),MT_TOSTRING,1,res)) {
\r
263 if(type(res) == OT_STRING)
\r
265 //else keeps going to the default
\r
269 scsprintf(_sp(rsl(sizeof(void*)+20)),_SC("(%s : 0x%p)"),GetTypeName(o),(void*)_rawval(o));
\r
271 res = SQString::Create(_ss(this),_spval);
\r
275 bool SQVM::StringCat(const SQObjectPtr &str,const SQObjectPtr &obj,SQObjectPtr &dest)
\r
280 SQInteger l = _string(a)->_len , ol = _string(b)->_len;
\r
281 SQChar *s = _sp(rsl(l + ol + 1));
\r
282 memcpy(s, _stringval(a), rsl(l));
\r
283 memcpy(s + l, _stringval(b), rsl(ol));
\r
284 dest = SQString::Create(_ss(this), _spval, l + ol);
\r
288 void SQVM::TypeOf(const SQObjectPtr &obj1,SQObjectPtr &dest)
\r
290 if(is_delegable(obj1) && _delegable(obj1)->_delegate) {
\r
292 if(CallMetaMethod(_delegable(obj1),MT_TYPEOF,1,dest))
\r
295 dest = SQString::Create(_ss(this),GetTypeName(obj1));
\r
298 bool SQVM::Init(SQVM *friendvm, SQInteger stacksize)
\r
300 _stack.resize(stacksize);
\r
301 _alloccallsstacksize = 4;
\r
302 _callstackdata.resize(_alloccallsstacksize);
\r
303 _callsstacksize = 0;
\r
304 _callsstack = &_callstackdata[0];
\r
308 _roottable = SQTable::Create(_ss(this), 0);
\r
310 _roottable = friendvm->_roottable;
\r
311 _errorhandler = friendvm->_errorhandler;
\r
312 _debughook = friendvm->_debughook;
\r
315 sq_base_register(this);
\r
319 extern SQInstructionDesc g_InstrDesc[];
\r
321 bool SQVM::StartCall(SQClosure *closure,SQInteger target,SQInteger args,SQInteger stackbase,bool tailcall)
\r
323 SQFunctionProto *func = _funcproto(closure->_function);
\r
325 const SQInteger paramssize = func->_nparameters;
\r
326 const SQInteger newtop = stackbase + func->_stacksize;
\r
327 SQInteger nargs = args;
\r
328 if (paramssize != nargs) {
\r
329 SQInteger ndef = func->_ndefaultparams;
\r
331 if(ndef && nargs < paramssize && (diff = paramssize - nargs) <= ndef) {
\r
332 for(SQInteger n = ndef - diff; n < ndef; n++) {
\r
333 _stack._vals[stackbase + (nargs++)] = closure->_defaultparams[n];
\r
336 else if(func->_varparams)
\r
338 if (nargs < paramssize) {
\r
339 Raise_Error(_SC("wrong number of parameters"));
\r
342 for(SQInteger n = 0; n < nargs - paramssize; n++) {
\r
343 _vargsstack.push_back(_stack._vals[stackbase+paramssize+n]);
\r
344 _stack._vals[stackbase+paramssize+n] = _null_;
\r
348 Raise_Error(_SC("wrong number of parameters"));
\r
353 if(type(closure->_env) == OT_WEAKREF) {
\r
354 _stack._vals[stackbase] = _weakref(closure->_env)->_obj;
\r
359 lc._generator = NULL;
\r
361 lc._prevstkbase = (SQInt32) ( stackbase - _stackbase );
\r
362 lc._target = (SQInt32) target;
\r
363 lc._prevtop = (SQInt32) (_top - _stackbase);
\r
365 lc._root = SQFalse;
\r
366 PUSH_CALLINFO(this, lc);
\r
371 ci->_vargs.size = (SQInt32)(nargs - paramssize);
\r
372 ci->_vargs.base = (SQInt32)(_vargsstack.size()-(ci->_vargs.size));
\r
373 ci->_closure = closure;
\r
374 ci->_literals = func->_literals;
\r
375 ci->_ip = func->_instructions;
\r
376 //grows the stack if needed
\r
377 if (((SQUnsignedInteger)newtop + (func->_stacksize<<1)) > _stack.size()) {
\r
378 _stack.resize(_stack.size() + (func->_stacksize<<1));
\r
382 _stackbase = stackbase;
\r
383 if (type(_debughook) != OT_NULL && _rawval(_debughook) != _rawval(ci->_closure))
\r
384 CallDebugHook(_SC('c'));
\r
388 bool SQVM::Return(SQInteger _arg0, SQInteger _arg1, SQObjectPtr &retval)
\r
390 if (type(_debughook) != OT_NULL && _rawval(_debughook) != _rawval(ci->_closure))
\r
391 for(SQInteger i=0;i<ci->_ncalls;i++)
\r
392 CallDebugHook(_SC('r'));
\r
394 SQBool broot = ci->_root;
\r
395 SQInteger last_top = _top;
\r
396 SQInteger target = ci->_target;
\r
397 SQInteger oldstackbase = _stackbase;
\r
398 _stackbase -= ci->_prevstkbase;
\r
399 _top = _stackbase + ci->_prevtop;
\r
400 if(ci->_vargs.size) PopVarArgs(ci->_vargs);
\r
401 POP_CALLINFO(this);
\r
403 if (_arg0 != MAX_FUNC_STACKSIZE) retval = _stack._vals[oldstackbase+_arg1];
\r
404 else retval = _null_;
\r
407 if(target != -1) { //-1 is when a class contructor ret value has to be ignored
\r
408 if (_arg0 != MAX_FUNC_STACKSIZE)
\r
409 STK(target) = _stack._vals[oldstackbase+_arg1];
\r
411 STK(target) = _null_;
\r
415 CLEARSTACK(last_top);
\r
416 assert(oldstackbase >= _stackbase);
\r
417 return broot?true:false;
\r
420 #define _RET_ON_FAIL(exp) { if(!exp) return false; }
\r
422 bool SQVM::LOCAL_INC(SQInteger op,SQObjectPtr &target, SQObjectPtr &a, SQObjectPtr &incr)
\r
424 _RET_ON_FAIL(ARITH_OP( op , target, a, incr));
\r
429 bool SQVM::PLOCAL_INC(SQInteger op,SQObjectPtr &target, SQObjectPtr &a, SQObjectPtr &incr)
\r
432 _RET_ON_FAIL(ARITH_OP( op , trg, a, incr));
\r
438 bool SQVM::DerefInc(SQInteger op,SQObjectPtr &target, SQObjectPtr &self, SQObjectPtr &key, SQObjectPtr &incr, bool postfix)
\r
440 SQObjectPtr tmp, tself = self, tkey = key;
\r
441 if (!Get(tself, tkey, tmp, false, true)) { Raise_IdxError(tkey); return false; }
\r
442 _RET_ON_FAIL(ARITH_OP( op , target, tmp, incr))
\r
443 Set(tself, tkey, target,true);
\r
444 if (postfix) target = tmp;
\r
448 #define arg0 (_i_._arg0)
\r
449 #define arg1 (_i_._arg1)
\r
450 #define sarg1 (*((SQInt32 *)&_i_._arg1))
\r
451 #define arg2 (_i_._arg2)
\r
452 #define arg3 (_i_._arg3)
\r
453 #define sarg3 ((SQInteger)*((signed char *)&_i_._arg3))
\r
455 SQRESULT SQVM::Suspend()
\r
458 return sq_throwerror(this, _SC("cannot suspend an already suspended vm"));
\r
459 if (_nnativecalls!=2)
\r
460 return sq_throwerror(this, _SC("cannot suspend through native calls/metamethods"));
\r
461 return SQ_SUSPEND_FLAG;
\r
464 void SQVM::PopVarArgs(VarArgs &vargs)
\r
466 for(SQInteger n = 0; n< vargs.size; n++)
\r
467 _vargsstack.pop_back();
\r
470 #define _FINISH(howmuchtojump) {jump = howmuchtojump; return true; }
\r
471 bool SQVM::FOREACH_OP(SQObjectPtr &o1,SQObjectPtr &o2,SQObjectPtr
\r
472 &o3,SQObjectPtr &o4,SQInteger arg_2,int exitpos,int &jump)
\r
477 if((nrefidx = _table(o1)->Next(false,o4, o2, o3)) == -1) _FINISH(exitpos);
\r
478 o4 = (SQInteger)nrefidx; _FINISH(1);
\r
480 if((nrefidx = _array(o1)->Next(o4, o2, o3)) == -1) _FINISH(exitpos);
\r
481 o4 = (SQInteger) nrefidx; _FINISH(1);
\r
483 if((nrefidx = _string(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
\r
484 o4 = (SQInteger)nrefidx; _FINISH(1);
\r
486 if((nrefidx = _class(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
\r
487 o4 = (SQInteger)nrefidx; _FINISH(1);
\r
490 if(_delegable(o1)->_delegate) {
\r
494 if(CallMetaMethod(_delegable(o1), MT_NEXTI, 2, itr)){
\r
496 if(type(itr) == OT_NULL) _FINISH(exitpos);
\r
497 if(!Get(o1, itr, o3, false,false)) {
\r
498 Raise_Error(_SC("_nexti returned an invalid idx"));
\r
503 Raise_Error(_SC("_nexti failed"));
\r
508 if(_generator(o1)->_state == SQGenerator::eDead) _FINISH(exitpos);
\r
509 if(_generator(o1)->_state == SQGenerator::eSuspended) {
\r
511 if(type(o4) == OT_INTEGER) {
\r
512 idx = _integer(o4) + 1;
\r
516 _generator(o1)->Resume(this, arg_2+1);
\r
520 Raise_Error(_SC("cannot iterate %s"), GetTypeName(o1));
\r
522 return false; //cannot be hit(just to avoid warnings)
\r
525 bool SQVM::DELEGATE_OP(SQObjectPtr &trg,SQObjectPtr &o1,SQObjectPtr &o2)
\r
527 if(type(o1) != OT_TABLE) { Raise_Error(_SC("delegating a '%s'"), GetTypeName(o1)); return false; }
\r
530 if(!_table(o1)->SetDelegate(_table(o2))){
\r
531 Raise_Error(_SC("delegate cycle detected"));
\r
536 _table(o1)->SetDelegate(NULL);
\r
539 Raise_Error(_SC("using '%s' as delegate"), GetTypeName(o2));
\r
546 #define COND_LITERAL (arg3!=0?ci->_literals[arg1]:STK(arg1))
\r
548 #define _GUARD(exp) { if(!exp) { Raise_Error(_lasterror); SQ_THROW();} }
\r
550 #define SQ_THROW() { goto exception_trap; }
\r
552 bool SQVM::CLOSURE_OP(SQObjectPtr &target, SQFunctionProto *func)
\r
555 SQClosure *closure = SQClosure::Create(_ss(this), func);
\r
556 if((nouters = func->_noutervalues)) {
\r
557 closure->_outervalues.reserve(nouters);
\r
558 for(SQInteger i = 0; i<nouters; i++) {
\r
559 SQOuterVar &v = func->_outervalues[i];
\r
562 closure->_outervalues.push_back(_null_);
\r
563 if(!Get(_stack._vals[_stackbase]/*STK(0)*/, v._src, closure->_outervalues.top(), false,true))
\r
564 {Raise_IdxError(v._src); return false; }
\r
567 closure->_outervalues.push_back(_stack._vals[_stackbase+_integer(v._src)]);
\r
570 closure->_outervalues.push_back(_closure(ci->_closure)->_outervalues[_integer(v._src)]);
\r
575 SQInteger ndefparams;
\r
576 if((ndefparams = func->_ndefaultparams)) {
\r
577 closure->_defaultparams.reserve(ndefparams);
\r
578 for(SQInteger i = 0; i < ndefparams; i++) {
\r
579 SQInteger spos = func->_defaultparams[i];
\r
580 closure->_defaultparams.push_back(_stack._vals[_stackbase + spos]);
\r
588 bool SQVM::GETVARGV_OP(SQObjectPtr &target,SQObjectPtr &index,CallInfo *ci)
\r
590 if(ci->_vargs.size == 0) {
\r
591 Raise_Error(_SC("the function doesn't have var args"));
\r
594 if(!sq_isnumeric(index)){
\r
595 Raise_Error(_SC("indexing 'vargv' with %s"),GetTypeName(index));
\r
598 SQInteger idx = tointeger(index);
\r
599 if(idx < 0 || idx >= ci->_vargs.size){ Raise_Error(_SC("vargv index out of range")); return false; }
\r
600 target = _vargsstack[ci->_vargs.base+idx];
\r
604 bool SQVM::CLASS_OP(SQObjectPtr &target,SQInteger baseclass,SQInteger attributes)
\r
606 SQClass *base = NULL;
\r
608 if(baseclass != -1) {
\r
609 if(type(_stack._vals[_stackbase+baseclass]) != OT_CLASS) { Raise_Error(_SC("trying to inherit from a %s"),GetTypeName(_stack._vals[_stackbase+baseclass])); return false; }
\r
610 base = _class(_stack._vals[_stackbase + baseclass]);
\r
612 if(attributes != MAX_FUNC_STACKSIZE) {
\r
613 attrs = _stack._vals[_stackbase+attributes];
\r
615 target = SQClass::Create(_ss(this),base);
\r
616 if(type(_class(target)->_metamethods[MT_INHERITED]) != OT_NULL) {
\r
619 Push(target); Push(attrs);
\r
620 Call(_class(target)->_metamethods[MT_INHERITED],nparams,_top - nparams, ret, false);
\r
623 _class(target)->_attributes = attrs;
\r
629 bool SQVM::IsEqual(SQObjectPtr &o1,SQObjectPtr &o2,bool &res)
\r
631 if(type(o1) == type(o2)) {
\r
632 res = ((_rawval(o1) == _rawval(o2)?true:false));
\r
635 if(sq_isnumeric(o1) && sq_isnumeric(o2)) {
\r
637 if(!ObjCmp(o1, o2,cmpres)) return false;
\r
638 res = (cmpres == 0);
\r
647 bool SQVM::IsFalse(SQObjectPtr &o)
\r
649 if((type(o) & SQOBJECT_CANBEFALSE) && ( (type(o) == OT_FLOAT) && (_float(o) == SQFloat(0.0)) )
\r
650 || (_integer(o) == 0) ) { //OT_NULL|OT_INTEGER|OT_BOOL
\r
656 bool SQVM::GETPARENT_OP(SQObjectPtr &o,SQObjectPtr &target)
\r
659 case OT_TABLE: target = _table(o)->_delegate?SQObjectPtr(_table(o)->_delegate):_null_;
\r
661 case OT_CLASS: target = _class(o)->_base?_class(o)->_base:_null_;
\r
664 Raise_Error(_SC("the %s type doesn't have a parent slot"), GetTypeName(o));
\r
670 bool SQVM::Execute(SQObjectPtr &closure, SQInteger target, SQInteger nargs, SQInteger stackbase,SQObjectPtr &outres, SQBool raiseerror,ExecutionType et)
\r
672 if ((_nnativecalls + 1) > MAX_NATIVE_CALLS) { Raise_Error(_SC("Native stack overflow")); return false; }
\r
674 AutoDec ad(&_nnativecalls);
\r
675 SQInteger traps = 0;
\r
676 //temp_reg vars for OP_CALL
\r
677 SQInteger ct_target;
\r
678 SQInteger ct_stackbase;
\r
683 SQInteger last_top = _top;
\r
684 temp_reg = closure;
\r
685 if(!StartCall(_closure(temp_reg), _top - nargs, nargs, stackbase, false)) {
\r
686 //call the handler if there are no calls in the stack, if not relies on the previous node
\r
687 if(ci == NULL) CallErrorHandler(_lasterror);
\r
690 if (_funcproto(_closure(temp_reg)->_function)->_bgenerator) {
\r
691 SQFunctionProto *f = _funcproto(_closure(temp_reg)->_function);
\r
692 SQGenerator *gen = SQGenerator::Create(_ss(this), _closure(temp_reg));
\r
693 _GUARD(gen->Yield(this));
\r
694 Return(1, ci->_target, temp_reg);
\r
696 CLEARSTACK(last_top);
\r
699 ci->_root = SQTrue;
\r
702 case ET_RESUME_GENERATOR: _generator(closure)->Resume(this, target); ci->_root = SQTrue; traps += ci->_etraps; break;
\r
704 case ET_RESUME_THROW_VM:
\r
705 traps = _suspended_traps;
\r
706 ci->_root = _suspended_root;
\r
707 ci->_vargs = _suspend_varargs;
\r
708 _suspended = SQFalse;
\r
709 if(et == ET_RESUME_THROW_VM) { SQ_THROW(); }
\r
718 const SQInstruction &_i_ = *ci->_ip++;
\r
719 //dumpstack(_stackbase);
\r
720 //scprintf("\n[%d] %s %d %d %d %d\n",ci->_ip-ci->_iv->_vals,g_InstrDesc[_i_.op].name,arg0,arg1,arg2,arg3);
\r
724 if(type(_debughook) != OT_NULL && _rawval(_debughook) != _rawval(ci->_closure))
\r
725 CallDebugHook(_SC('l'),arg1);
\r
727 case _OP_LOAD: TARGET = ci->_literals[arg1]; continue;
\r
728 case _OP_LOADINT: TARGET = (SQInteger)arg1; continue;
\r
729 case _OP_LOADFLOAT: TARGET = *((SQFloat *)&arg1); continue;
\r
730 case _OP_DLOAD: TARGET = ci->_literals[arg1]; STK(arg2) = ci->_literals[arg3];continue;
\r
732 temp_reg = STK(arg1);
\r
733 if (type(temp_reg) == OT_CLOSURE && !_funcproto(_closure(temp_reg)->_function)->_bgenerator){
\r
734 ct_tailcall = true;
\r
735 if(ci->_vargs.size) PopVarArgs(ci->_vargs);
\r
736 for (SQInteger i = 0; i < arg3; i++) STK(i) = STK(arg2 + i);
\r
737 ct_target = ci->_target;
\r
738 ct_stackbase = _stackbase;
\r
742 ct_tailcall = false;
\r
744 temp_reg = STK(arg1);
\r
745 ct_stackbase = _stackbase+arg2;
\r
748 SQObjectPtr clo = temp_reg;
\r
749 SQInteger last_top = _top;
\r
750 switch (type(clo)) {
\r
752 _GUARD(StartCall(_closure(clo), ct_target, arg3, ct_stackbase, ct_tailcall));
\r
753 if (_funcproto(_closure(clo)->_function)->_bgenerator) {
\r
754 SQGenerator *gen = SQGenerator::Create(_ss(this), _closure(clo));
\r
755 _GUARD(gen->Yield(this));
\r
756 Return(1, ct_target, clo);
\r
757 STK(ct_target) = gen;
\r
758 CLEARSTACK(last_top);
\r
763 case OT_NATIVECLOSURE: {
\r
765 _GUARD(CallNative(_nativeclosure(clo), arg3, ct_stackbase, clo,suspend));
\r
767 _suspended = SQTrue;
\r
768 _suspended_target = ct_target;
\r
769 _suspended_root = ci->_root;
\r
770 _suspended_traps = traps;
\r
771 _suspend_varargs = ci->_vargs;
\r
775 if(ct_target != -1) { //skip return value for constructors
\r
776 STK(ct_target) = clo;
\r
782 _GUARD(CreateClassInstance(_class(clo),inst,temp_reg));
\r
783 STK(ct_target) = inst;
\r
784 ct_target = -1; //fakes return value target so that is not overwritten by the constructor
\r
785 if(type(temp_reg) != OT_NULL) {
\r
786 _stack._vals[ct_stackbase] = inst;
\r
787 goto common_call; //hard core spaghetti code(reissues the OP_CALL to invoke the constructor)
\r
796 for (SQInteger i = 0; i < arg3; i++) Push(STK(arg2 + i));
\r
797 if (_delegable(clo) && CallMetaMethod(_delegable(clo), MT_CALL, arg3+1, clo)){
\r
798 STK(ct_target) = clo;
\r
801 Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
\r
805 Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
\r
811 case _OP_PREPCALLK:
\r
813 SQObjectPtr &key = _i_.op == _OP_PREPCALLK?(ci->_literals)[arg1]:STK(arg1);
\r
814 SQObjectPtr &o = STK(arg2);
\r
815 if (!Get(o, key, temp_reg,false,true)) {
\r
816 if(type(o) == OT_CLASS) { //hack?
\r
817 if(_class_ddel->Get(key,temp_reg)) {
\r
823 { Raise_IdxError(key); SQ_THROW();}
\r
826 STK(arg3) = type(o) == OT_CLASS?STK(0):o;
\r
831 if (!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,true)) { Raise_IdxError(ci->_literals[arg1]); SQ_THROW();}
\r
834 case _OP_MOVE: TARGET = STK(arg1); continue;
\r
836 _GUARD(NewSlot(STK(arg1), STK(arg2), STK(arg3),false));
\r
837 if(arg0 != arg3) TARGET = STK(arg3);
\r
839 case _OP_DELETE: _GUARD(DeleteSlot(STK(arg1), STK(arg2), TARGET)); continue;
\r
841 if (!Set(STK(arg1), STK(arg2), STK(arg3),true)) { Raise_IdxError(STK(arg2)); SQ_THROW(); }
\r
842 if (arg0 != arg3) TARGET = STK(arg3);
\r
845 if (!Get(STK(arg1), STK(arg2), temp_reg, false,true)) { Raise_IdxError(STK(arg2)); SQ_THROW(); }
\r
850 if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
\r
851 TARGET = res?_true_:_false_;
\r
855 if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
\r
856 TARGET = (!res)?_true_:_false_;
\r
858 case _OP_ARITH: _GUARD(ARITH_OP( arg3 , temp_reg, STK(arg2), STK(arg1))); TARGET = temp_reg; continue;
\r
859 case _OP_BITW: _GUARD(BW_OP( arg3,TARGET,STK(arg2),STK(arg1))); continue;
\r
861 if(ci->_generator) {
\r
862 ci->_generator->Kill();
\r
864 if(Return(arg0, arg1, temp_reg)){
\r
870 case _OP_LOADNULLS:{ for(SQInt32 n=0; n < arg1; n++) STK(arg0+n) = _null_; }continue;
\r
871 case _OP_LOADROOTTABLE: TARGET = _roottable; continue;
\r
872 case _OP_LOADBOOL: TARGET = arg1?_true_:_false_; continue;
\r
873 case _OP_DMOVE: STK(arg0) = STK(arg1); STK(arg2) = STK(arg3); continue;
\r
874 case _OP_JMP: ci->_ip += (sarg1); continue;
\r
875 case _OP_JNZ: if(!IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
\r
876 case _OP_JZ: if(IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
\r
877 case _OP_LOADFREEVAR: TARGET = _closure(ci->_closure)->_outervalues[arg1]; continue;
\r
878 case _OP_VARGC: TARGET = SQInteger(ci->_vargs.size); continue;
\r
879 case _OP_GETVARGV:
\r
880 if(!GETVARGV_OP(TARGET,STK(arg1),ci)) { SQ_THROW(); }
\r
882 case _OP_NEWTABLE: TARGET = SQTable::Create(_ss(this), arg1); continue;
\r
883 case _OP_NEWARRAY: TARGET = SQArray::Create(_ss(this), 0); _array(TARGET)->Reserve(arg1); continue;
\r
884 case _OP_APPENDARRAY: _array(STK(arg0))->Append(COND_LITERAL); continue;
\r
885 case _OP_GETPARENT: _GUARD(GETPARENT_OP(STK(arg1),TARGET)); continue;
\r
886 case _OP_COMPARITH: _GUARD(DerefInc(arg3, TARGET, STK((((SQUnsignedInteger)arg1&0xFFFF0000)>>16)), STK(arg2), STK(arg1&0x0000FFFF), false)); continue;
\r
887 case _OP_COMPARITHL: _GUARD(LOCAL_INC(arg3, TARGET, STK(arg1), STK(arg2))); continue;
\r
888 case _OP_INC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, false));} continue;
\r
889 case _OP_INCL: {SQObjectPtr o(sarg3); _GUARD(LOCAL_INC('+',TARGET, STK(arg1), o));} continue;
\r
890 case _OP_PINC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, true));} continue;
\r
891 case _OP_PINCL: {SQObjectPtr o(sarg3); _GUARD(PLOCAL_INC('+',TARGET, STK(arg1), o));} continue;
\r
892 case _OP_CMP: _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg1),TARGET)) continue;
\r
893 case _OP_EXISTS: TARGET = Get(STK(arg1), STK(arg2), temp_reg, true,false)?_true_:_false_;continue;
\r
894 case _OP_INSTANCEOF:
\r
895 if(type(STK(arg1)) != OT_CLASS || type(STK(arg2)) != OT_INSTANCE)
\r
896 {Raise_Error(_SC("cannot apply instanceof between a %s and a %s"),GetTypeName(STK(arg1)),GetTypeName(STK(arg2))); SQ_THROW();}
\r
897 TARGET = _instance(STK(arg2))->InstanceOf(_class(STK(arg1)))?_true_:_false_;
\r
900 if(IsFalse(STK(arg2))) {
\r
901 TARGET = STK(arg2);
\r
902 ci->_ip += (sarg1);
\r
906 if(!IsFalse(STK(arg2))) {
\r
907 TARGET = STK(arg2);
\r
908 ci->_ip += (sarg1);
\r
911 case _OP_NEG: _GUARD(NEG_OP(TARGET,STK(arg1))); continue;
\r
912 case _OP_NOT: TARGET = (IsFalse(STK(arg1))?_true_:_false_); continue;
\r
914 if(type(STK(arg1)) == OT_INTEGER) {
\r
915 SQInteger t = _integer(STK(arg1));
\r
916 TARGET = SQInteger(~t);
\r
919 Raise_Error(_SC("attempt to perform a bitwise op on a %s"), GetTypeName(STK(arg1)));
\r
921 case _OP_CLOSURE: {
\r
922 SQClosure *c = ci->_closure._unVal.pClosure;
\r
923 SQFunctionProto *fp = c->_function._unVal.pFunctionProto;
\r
924 if(!CLOSURE_OP(TARGET,fp->_functions[arg1]._unVal.pFunctionProto)) { SQ_THROW(); }
\r
928 if(ci->_generator) {
\r
929 if(sarg1 != MAX_FUNC_STACKSIZE) temp_reg = STK(arg1);
\r
930 _GUARD(ci->_generator->Yield(this));
\r
931 traps -= ci->_etraps;
\r
932 if(sarg1 != MAX_FUNC_STACKSIZE) STK(arg1) = temp_reg;
\r
934 else { Raise_Error(_SC("trying to yield a '%s',only genenerator can be yielded"), GetTypeName(ci->_generator)); SQ_THROW();}
\r
935 if(Return(arg0, arg1, temp_reg)){
\r
936 assert(traps == 0);
\r
944 if(type(STK(arg1)) != OT_GENERATOR){ Raise_Error(_SC("trying to resume a '%s',only genenerator can be resumed"), GetTypeName(STK(arg1))); SQ_THROW();}
\r
945 _GUARD(_generator(STK(arg1))->Resume(this, arg0));
\r
946 traps += ci->_etraps;
\r
948 case _OP_FOREACH:{ int tojump;
\r
949 _GUARD(FOREACH_OP(STK(arg0),STK(arg2),STK(arg2+1),STK(arg2+2),arg2,sarg1,tojump));
\r
950 ci->_ip += tojump; }
\r
952 case _OP_POSTFOREACH:
\r
953 assert(type(STK(arg0)) == OT_GENERATOR);
\r
954 if(_generator(STK(arg0))->_state == SQGenerator::eDead)
\r
955 ci->_ip += (sarg1 - 1);
\r
957 case _OP_DELEGATE: _GUARD(DELEGATE_OP(TARGET,STK(arg1),STK(arg2))); continue;
\r
959 if(!Clone(STK(arg1), TARGET))
\r
960 { Raise_Error(_SC("cloning a %s"), GetTypeName(STK(arg1))); SQ_THROW();}
\r
962 case _OP_TYPEOF: TypeOf(STK(arg1), TARGET); continue;
\r
963 case _OP_PUSHTRAP:{
\r
964 SQInstruction *_iv = _funcproto(_closure(ci->_closure)->_function)->_instructions;
\r
965 _etraps.push_back(SQExceptionTrap(_top,_stackbase, &_iv[(ci->_ip-_iv)+arg1], arg0)); traps++;
\r
969 case _OP_POPTRAP: {
\r
970 for(SQInteger i = 0; i < arg0; i++) {
\r
971 _etraps.pop_back(); traps--;
\r
976 case _OP_THROW: Raise_Error(TARGET); SQ_THROW(); continue;
\r
977 case _OP_CLASS: _GUARD(CLASS_OP(TARGET,arg1,arg2)); continue;
\r
979 bool bstatic = (arg0&NEW_SLOT_STATIC_FLAG)?true:false;
\r
980 if(type(STK(arg1)) == OT_CLASS) {
\r
981 if(type(_class(STK(arg1))->_metamethods[MT_NEWMEMBER]) != OT_NULL ) {
\r
982 Push(STK(arg1)); Push(STK(arg2)); Push(STK(arg3));
\r
983 Push((arg0&NEW_SLOT_ATTRIBUTES_FLAG) ? STK(arg2-1) : _null_);
\r
986 if(Call(_class(STK(arg1))->_metamethods[MT_NEWMEMBER], nparams, _top - nparams, temp_reg,SQFalse)) {
\r
992 _GUARD(NewSlot(STK(arg1), STK(arg2), STK(arg3),bstatic));
\r
993 if((arg0&NEW_SLOT_ATTRIBUTES_FLAG)) {
\r
994 _class(STK(arg1))->SetAttributes(STK(arg2),STK(arg2-1));
\r
1003 SQObjectPtr currerror = _lasterror;
\r
1004 // dumpstack(_stackbase);
\r
1006 SQInteger last_top = _top;
\r
1008 if(_ss(this)->_notifyallexceptions) CallErrorHandler(currerror);
\r
1012 if(ci->_etraps > 0) {
\r
1013 SQExceptionTrap &et = _etraps.top();
\r
1015 _top = et._stacksize;
\r
1016 _stackbase = et._stackbase;
\r
1017 _stack._vals[_stackbase+et._extarget] = currerror;
\r
1018 _etraps.pop_back(); traps--; ci->_etraps--;
\r
1019 CLEARSTACK(last_top);
\r
1020 goto exception_restore;
\r
1022 //if is a native closure
\r
1023 if(type(ci->_closure) != OT_CLOSURE && n)
\r
1025 if(ci->_generator) ci->_generator->Kill();
\r
1026 PopVarArgs(ci->_vargs);
\r
1027 POP_CALLINFO(this);
\r
1029 } while(_callsstacksize);
\r
1033 if(raiseerror && !_ss(this)->_notifyallexceptions)
\r
1034 CallErrorHandler(currerror);
\r
1036 //remove call stack until a C function is found or the cstack is empty
\r
1038 SQBool exitafterthisone = ci->_root;
\r
1039 if(ci->_generator) ci->_generator->Kill();
\r
1040 _stackbase -= ci->_prevstkbase;
\r
1041 _top = _stackbase + ci->_prevtop;
\r
1042 PopVarArgs(ci->_vargs);
\r
1043 POP_CALLINFO(this);
\r
1044 if( (ci && type(ci->_closure) != OT_CLOSURE) || exitafterthisone) break;
\r
1045 } while(_callsstacksize);
\r
1047 CLEARSTACK(last_top);
\r
1049 _lasterror = currerror;
\r
1055 bool SQVM::CreateClassInstance(SQClass *theclass, SQObjectPtr &inst, SQObjectPtr &constructor)
\r
1057 inst = theclass->CreateInstance();
\r
1058 if(!theclass->Get(_ss(this)->_constructoridx,constructor)) {
\r
1059 constructor = _null_;
\r
1064 void SQVM::CallErrorHandler(SQObjectPtr &error)
\r
1066 if(type(_errorhandler) != OT_NULL) {
\r
1068 Push(_roottable); Push(error);
\r
1069 Call(_errorhandler, 2, _top-2, out,SQFalse);
\r
1074 void SQVM::CallDebugHook(SQInteger type,SQInteger forcedline)
\r
1076 SQObjectPtr temp_reg;
\r
1077 SQInteger nparams=5;
\r
1078 SQFunctionProto *func=_funcproto(_closure(ci->_closure)->_function);
\r
1079 Push(_roottable); Push(type); Push(func->_sourcename); Push(forcedline?forcedline:func->GetLine(ci->_ip)); Push(func->_name);
\r
1080 Call(_debughook,nparams,_top-nparams,temp_reg,SQFalse);
\r
1084 bool SQVM::CallNative(SQNativeClosure *nclosure,SQInteger nargs,SQInteger stackbase,SQObjectPtr &retval,bool &suspend)
\r
1086 if (_nnativecalls + 1 > MAX_NATIVE_CALLS) { Raise_Error(_SC("Native stack overflow")); return false; }
\r
1087 SQInteger nparamscheck = nclosure->_nparamscheck;
\r
1088 if(((nparamscheck > 0) && (nparamscheck != nargs))
\r
1089 || ((nparamscheck < 0) && (nargs < (-nparamscheck)))) {
\r
1090 Raise_Error(_SC("wrong number of parameters"));
\r
1095 if((tcs = nclosure->_typecheck.size())) {
\r
1096 for(SQInteger i = 0; i < nargs && i < tcs; i++)
\r
1097 if((nclosure->_typecheck._vals[i] != -1) && !(type(_stack._vals[stackbase+i]) & nclosure->_typecheck[i])) {
\r
1098 Raise_ParamTypeError(i,nclosure->_typecheck._vals[i],type(_stack._vals[stackbase+i]));
\r
1103 if ((_top + MIN_STACK_OVERHEAD) > (SQInteger)_stack.size()) {
\r
1104 _stack.resize(_stack.size() + (MIN_STACK_OVERHEAD<<1));
\r
1106 SQInteger oldtop = _top;
\r
1107 SQInteger oldstackbase = _stackbase;
\r
1108 _top = stackbase + nargs;
\r
1110 lci._closure = nclosure;
\r
1111 lci._generator = NULL;
\r
1113 lci._prevstkbase = (SQInt32) (stackbase - _stackbase);
\r
1115 lci._prevtop = (SQInt32) (oldtop - oldstackbase);
\r
1116 PUSH_CALLINFO(this, lci);
\r
1117 _stackbase = stackbase;
\r
1118 //push free variables
\r
1119 SQInteger outers = nclosure->_outervalues.size();
\r
1120 for (SQInteger i = 0; i < outers; i++) {
\r
1121 Push(nclosure->_outervalues[i]);
\r
1124 if(type(nclosure->_env) == OT_WEAKREF) {
\r
1125 _stack[stackbase] = _weakref(nclosure->_env)->_obj;
\r
1129 SQInteger ret = (nclosure->_function)(this);
\r
1132 if( ret == SQ_SUSPEND_FLAG) suspend = true;
\r
1133 else if (ret < 0) {
\r
1134 _stackbase = oldstackbase;
\r
1136 POP_CALLINFO(this);
\r
1137 Raise_Error(_lasterror);
\r
1141 if (ret != 0){ retval = TOP(); TOP().Null(); }
\r
1142 else { retval = _null_; }
\r
1143 _stackbase = oldstackbase;
\r
1145 POP_CALLINFO(this);
\r
1149 bool SQVM::Get(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest,bool raw, bool fetchroot)
\r
1151 switch(type(self)){
\r
1153 if(_table(self)->Get(key,dest))return true;
\r
1156 if(sq_isnumeric(key)){
\r
1157 return _array(self)->Get(tointeger(key),dest);
\r
1161 if(_instance(self)->Get(key,dest)) return true;
\r
1163 default:break; //shut up compiler
\r
1165 if(FallBackGet(self,key,dest,raw)) return true;
\r
1168 if(_rawval(STK(0)) == _rawval(self) &&
\r
1169 type(STK(0)) == type(self)) {
\r
1170 return _table(_roottable)->Get(key,dest);
\r
1176 bool SQVM::FallBackGet(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest,bool raw)
\r
1178 switch(type(self)){
\r
1180 return _class(self)->Get(key,dest);
\r
1185 if(_delegable(self)->_delegate) {
\r
1186 if(Get(SQObjectPtr(_delegable(self)->_delegate),key,dest,raw,false))
\r
1188 if(raw)return false;
\r
1189 Push(self);Push(key);
\r
1190 if(CallMetaMethod(_delegable(self),MT_GET,2,dest))
\r
1193 if(type(self) == OT_TABLE) {
\r
1194 if(raw) return false;
\r
1195 return _table_ddel->Get(key,dest);
\r
1200 if(raw)return false;
\r
1201 return _array_ddel->Get(key,dest);
\r
1203 if(sq_isnumeric(key)){
\r
1204 SQInteger n=tointeger(key);
\r
1205 if(abs((int)n)<_string(self)->_len){
\r
1206 if(n<0)n=_string(self)->_len-n;
\r
1207 dest=SQInteger(_stringval(self)[n]);
\r
1213 if(raw)return false;
\r
1214 return _string_ddel->Get(key,dest);
\r
1218 if(raw)return false;
\r
1219 Push(self);Push(key);
\r
1220 if(!CallMetaMethod(_delegable(self),MT_GET,2,dest)) {
\r
1221 return _instance_ddel->Get(key,dest);
\r
1224 case OT_INTEGER:case OT_FLOAT:case OT_BOOL:
\r
1225 if(raw)return false;
\r
1226 return _number_ddel->Get(key,dest);
\r
1227 case OT_GENERATOR:
\r
1228 if(raw)return false;
\r
1229 return _generator_ddel->Get(key,dest);
\r
1230 case OT_CLOSURE: case OT_NATIVECLOSURE:
\r
1231 if(raw)return false;
\r
1232 return _closure_ddel->Get(key,dest);
\r
1234 if(raw)return false;
\r
1235 return _thread_ddel->Get(key,dest);
\r
1237 if(raw)return false;
\r
1238 return _weakref_ddel->Get(key,dest);
\r
1239 default:return false;
\r
1244 bool SQVM::Set(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,bool fetchroot)
\r
1246 switch(type(self)){
\r
1248 if(_table(self)->Set(key,val))
\r
1250 if(_table(self)->_delegate) {
\r
1251 if(Set(_table(self)->_delegate,key,val,false)) {
\r
1257 if(_delegable(self)->_delegate) {
\r
1259 Push(self);Push(key);Push(val);
\r
1260 if(CallMetaMethod(_delegable(self),MT_SET,3,t)) return true;
\r
1263 case OT_INSTANCE:{
\r
1264 if(_instance(self)->Set(key,val))
\r
1267 Push(self);Push(key);Push(val);
\r
1268 if(CallMetaMethod(_delegable(self),MT_SET,3,t)) return true;
\r
1272 if(!sq_isnumeric(key)) {Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key)); return false; }
\r
1273 return _array(self)->Set(tointeger(key),val);
\r
1275 Raise_Error(_SC("trying to set '%s'"),GetTypeName(self));
\r
1279 if(_rawval(STK(0)) == _rawval(self) &&
\r
1280 type(STK(0)) == type(self)) {
\r
1281 return _table(_roottable)->Set(key,val);
\r
1287 bool SQVM::Clone(const SQObjectPtr &self,SQObjectPtr &target)
\r
1289 SQObjectPtr temp_reg;
\r
1290 SQObjectPtr newobj;
\r
1291 switch(type(self)){
\r
1293 newobj = _table(self)->Clone();
\r
1296 newobj = _instance(self)->Clone(_ss(this));
\r
1298 if(_delegable(newobj)->_delegate){
\r
1301 CallMetaMethod(_delegable(newobj),MT_CLONED,2,temp_reg);
\r
1306 target = _array(self)->Clone();
\r
1308 default: return false;
\r
1312 bool SQVM::NewSlot(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,bool bstatic)
\r
1314 if(type(key) == OT_NULL) { Raise_Error(_SC("null cannot be used as index")); return false; }
\r
1315 switch(type(self)) {
\r
1317 bool rawcall = true;
\r
1318 if(_table(self)->_delegate) {
\r
1320 if(!_table(self)->Get(key,res)) {
\r
1321 Push(self);Push(key);Push(val);
\r
1322 rawcall = !CallMetaMethod(_table(self),MT_NEWSLOT,3,res);
\r
1325 if(rawcall) _table(self)->NewSlot(key,val); //cannot fail
\r
1328 case OT_INSTANCE: {
\r
1330 Push(self);Push(key);Push(val);
\r
1331 if(!CallMetaMethod(_instance(self),MT_NEWSLOT,3,res)) {
\r
1332 Raise_Error(_SC("class instances do not support the new slot operator"));
\r
1337 if(!_class(self)->NewSlot(_ss(this),key,val,bstatic)) {
\r
1338 if(_class(self)->_locked) {
\r
1339 Raise_Error(_SC("trying to modify a class that has already been instantiated"));
\r
1343 SQObjectPtr oval = PrintObjVal(key);
\r
1344 Raise_Error(_SC("the property '%s' already exists"),_stringval(oval));
\r
1350 Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key));
\r
1357 bool SQVM::DeleteSlot(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &res)
\r
1359 switch(type(self)) {
\r
1362 case OT_USERDATA: {
\r
1364 bool handled = false;
\r
1365 if(_delegable(self)->_delegate) {
\r
1366 Push(self);Push(key);
\r
1367 handled = CallMetaMethod(_delegable(self),MT_DELSLOT,2,t);
\r
1371 if(type(self) == OT_TABLE) {
\r
1372 if(_table(self)->Get(key,t)) {
\r
1373 _table(self)->Remove(key);
\r
1376 Raise_IdxError((SQObject &)key);
\r
1381 Raise_Error(_SC("cannot delete a slot from %s"),GetTypeName(self));
\r
1389 Raise_Error(_SC("attempt to delete a slot from a %s"),GetTypeName(self));
\r
1395 bool SQVM::Call(SQObjectPtr &closure,SQInteger nparams,SQInteger stackbase,SQObjectPtr &outres,SQBool raiseerror)
\r
1398 SQInteger prevstackbase = _stackbase;
\r
1400 switch(type(closure)) {
\r
1402 return Execute(closure, _top - nparams, nparams, stackbase,outres,raiseerror);
\r
1404 case OT_NATIVECLOSURE:{
\r
1406 return CallNative(_nativeclosure(closure), nparams, stackbase, outres,suspend);
\r
1411 SQObjectPtr constr;
\r
1413 CreateClassInstance(_class(closure),outres,constr);
\r
1414 if(type(constr) != OT_NULL) {
\r
1415 _stack[stackbase] = outres;
\r
1416 return Call(constr,nparams,stackbase,temp,raiseerror);
\r
1426 assert(_stackbase == prevstackbase);
\r
1432 bool SQVM::CallMetaMethod(SQDelegable *del,SQMetaMethod mm,SQInteger nparams,SQObjectPtr &outres)
\r
1434 SQObjectPtr closure;
\r
1435 if(del->GetMetaMethod(this, mm, closure)) {
\r
1436 if(Call(closure, nparams, _top - nparams, outres, SQFalse)) {
\r
1445 void SQVM::Remove(SQInteger n) {
\r
1446 n = (n >= 0)?n + _stackbase - 1:_top + n;
\r
1447 for(SQInteger i = n; i < _top; i++){
\r
1448 _stack[i] = _stack[i+1];
\r
1450 _stack[_top] = _null_;
\r
1454 void SQVM::Pop() {
\r
1455 _stack[--_top] = _null_;
\r
1458 void SQVM::Pop(SQInteger n) {
\r
1459 for(SQInteger i = 0; i < n; i++){
\r
1460 _stack[--_top] = _null_;
\r
1464 void SQVM::Push(const SQObjectPtr &o) { _stack[_top++] = o; }
\r
1465 SQObjectPtr &SQVM::Top() { return _stack[_top-1]; }
\r
1466 SQObjectPtr &SQVM::PopGet() { return _stack[--_top]; }
\r
1467 SQObjectPtr &SQVM::GetUp(SQInteger n) { return _stack[_top+n]; }
\r
1468 SQObjectPtr &SQVM::GetAt(SQInteger n) { return _stack[n]; }
\r
1470 #ifdef _DEBUG_DUMP
\r
1471 void SQVM::dumpstack(SQInteger stackbase,bool dumpall)
\r
1473 SQInteger size=dumpall?_stack.size():_top;
\r
1475 scprintf(_SC("\n>>>>stack dump<<<<\n"));
\r
1476 CallInfo &ci=_callsstack[_callsstacksize-1];
\r
1477 scprintf(_SC("IP: %p\n"),ci._ip);
\r
1478 scprintf(_SC("prev stack base: %d\n"),ci._prevstkbase);
\r
1479 scprintf(_SC("prev top: %d\n"),ci._prevtop);
\r
1480 for(SQInteger i=0;i<size;i++){
\r
1481 SQObjectPtr &obj=_stack[i];
\r
1482 if(stackbase==i)scprintf(_SC(">"));else scprintf(_SC(" "));
\r
1483 scprintf(_SC("[%d]:"),n);
\r
1484 switch(type(obj)){
\r
1485 case OT_FLOAT: scprintf(_SC("FLOAT %.3f"),_float(obj));break;
\r
1486 case OT_INTEGER: scprintf(_SC("INTEGER %d"),_integer(obj));break;
\r
1487 case OT_BOOL: scprintf(_SC("BOOL %s"),_integer(obj)?"true":"false");break;
\r
1488 case OT_STRING: scprintf(_SC("STRING %s"),_stringval(obj));break;
\r
1489 case OT_NULL: scprintf(_SC("NULL")); break;
\r
1490 case OT_TABLE: scprintf(_SC("TABLE %p[%p]"),_table(obj),_table(obj)->_delegate);break;
\r
1491 case OT_ARRAY: scprintf(_SC("ARRAY %p"),_array(obj));break;
\r
1492 case OT_CLOSURE: scprintf(_SC("CLOSURE [%p]"),_closure(obj));break;
\r
1493 case OT_NATIVECLOSURE: scprintf(_SC("NATIVECLOSURE"));break;
\r
1494 case OT_USERDATA: scprintf(_SC("USERDATA %p[%p]"),_userdataval(obj),_userdata(obj)->_delegate);break;
\r
1495 case OT_GENERATOR: scprintf(_SC("GENERATOR %p"),_generator(obj));break;
\r
1496 case OT_THREAD: scprintf(_SC("THREAD [%p]"),_thread(obj));break;
\r
1497 case OT_USERPOINTER: scprintf(_SC("USERPOINTER %p"),_userpointer(obj));break;
\r
1498 case OT_CLASS: scprintf(_SC("CLASS %p"),_class(obj));break;
\r
1499 case OT_INSTANCE: scprintf(_SC("INSTANCE %p"),_instance(obj));break;
\r
1500 case OT_WEAKREF: scprintf(_SC("WEAKERF %p"),_weakref(obj));break;
\r
1505 scprintf(_SC("\n"));
\r