sqvm.cpp 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759
  1. /*
  2. see copyright notice in squirrel.h
  3. */
  4. #include "sqpcheader.h"
  5. #include <math.h>
  6. #include <stdlib.h>
  7. #include "sqopcodes.h"
  8. #include "sqvm.h"
  9. #include "sqfuncproto.h"
  10. #include "sqclosure.h"
  11. #include "sqstring.h"
  12. #include "sqtable.h"
  13. #include "squserdata.h"
  14. #include "sqarray.h"
  15. #include "sqclass.h"
  16. #define TOP() (_stack._vals[_top-1])
  17. bool SQVM::BW_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
  18. {
  19. SQInteger res;
  20. if((type(o1)|type(o2)) == OT_INTEGER)
  21. {
  22. SQInteger i1 = _integer(o1), i2 = _integer(o2);
  23. switch(op) {
  24. case BW_AND: res = i1 & i2; break;
  25. case BW_OR: res = i1 | i2; break;
  26. case BW_XOR: res = i1 ^ i2; break;
  27. case BW_SHIFTL: res = i1 << i2; break;
  28. case BW_SHIFTR: res = i1 >> i2; break;
  29. case BW_USHIFTR:res = (SQInteger)(*((SQUnsignedInteger*)&i1) >> i2); break;
  30. default: { Raise_Error(_SC("internal vm error bitwise op failed")); return false; }
  31. }
  32. }
  33. else { Raise_Error(_SC("bitwise op between '%s' and '%s'"),GetTypeName(o1),GetTypeName(o2)); return false;}
  34. trg = res;
  35. return true;
  36. }
  37. #define _ARITH_(op,trg,o1,o2) \
  38. { \
  39. SQInteger tmask = type(o1)|type(o2); \
  40. switch(tmask) { \
  41. case OT_INTEGER: trg = _integer(o1) op _integer(o2);break; \
  42. case (OT_FLOAT|OT_INTEGER): \
  43. case (OT_FLOAT): trg = tofloat(o1) op tofloat(o2); break;\
  44. default: _GUARD(ARITH_OP((#op)[0],trg,o1,o2)); break;\
  45. } \
  46. }
  47. #define _ARITH_NOZERO(op,trg,o1,o2,err) \
  48. { \
  49. SQInteger tmask = type(o1)|type(o2); \
  50. switch(tmask) { \
  51. case OT_INTEGER: { SQInteger i2 = _integer(o2); if(i2 == 0) { Raise_Error(err); SQ_THROW(); } trg = _integer(o1) op i2; } break;\
  52. case (OT_FLOAT|OT_INTEGER): \
  53. case (OT_FLOAT): trg = tofloat(o1) op tofloat(o2); break;\
  54. default: _GUARD(ARITH_OP((#op)[0],trg,o1,o2)); break;\
  55. } \
  56. }
  57. bool SQVM::ARITH_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
  58. {
  59. SQInteger tmask = type(o1)|type(o2);
  60. switch(tmask) {
  61. case OT_INTEGER:{
  62. SQInteger res, i1 = _integer(o1), i2 = _integer(o2);
  63. switch(op) {
  64. case '+': res = i1 + i2; break;
  65. case '-': res = i1 - i2; break;
  66. case '/': if(i2 == 0) { Raise_Error(_SC("division by zero")); return false; }
  67. res = i1 / i2;
  68. break;
  69. case '*': res = i1 * i2; break;
  70. case '%': if(i2 == 0) { Raise_Error(_SC("modulo by zero")); return false; }
  71. res = i1 % i2;
  72. break;
  73. default: res = 0xDEADBEEF;
  74. }
  75. trg = res; }
  76. break;
  77. case (OT_FLOAT|OT_INTEGER):
  78. case (OT_FLOAT):{
  79. SQFloat res, f1 = tofloat(o1), f2 = tofloat(o2);
  80. switch(op) {
  81. case '+': res = f1 + f2; break;
  82. case '-': res = f1 - f2; break;
  83. case '/': res = f1 / f2; break;
  84. case '*': res = f1 * f2; break;
  85. case '%': res = SQFloat(fmod((double)f1,(double)f2)); break;
  86. default: res = 0x0f;
  87. }
  88. trg = res; }
  89. break;
  90. default:
  91. if(op == '+' && (tmask & _RT_STRING)){
  92. if(!StringCat(o1, o2, trg)) return false;
  93. }
  94. else if(!ArithMetaMethod(op,o1,o2,trg)) {
  95. return false;
  96. }
  97. }
  98. return true;
  99. }
  100. SQVM::SQVM(SQSharedState *ss)
  101. {
  102. _sharedstate=ss;
  103. _suspended = SQFalse;
  104. _suspended_target = -1;
  105. _suspended_root = SQFalse;
  106. _suspended_traps = -1;
  107. _foreignptr = NULL;
  108. _nnativecalls = 0;
  109. _nmetamethodscall = 0;
  110. _lasterror.Null();
  111. _errorhandler.Null();
  112. _debughook = false;
  113. _debughook_native = NULL;
  114. _debughook_closure.Null();
  115. _openouters = NULL;
  116. ci = NULL;
  117. INIT_CHAIN();ADD_TO_CHAIN(&_ss(this)->_gc_chain,this);
  118. }
  119. void SQVM::Finalize()
  120. {
  121. if(_openouters) CloseOuters(&_stack._vals[0]);
  122. _roottable.Null();
  123. _lasterror.Null();
  124. _errorhandler.Null();
  125. _debughook = false;
  126. _debughook_native = NULL;
  127. _debughook_closure.Null();
  128. temp_reg.Null();
  129. _callstackdata.resize(0);
  130. SQInteger size=_stack.size();
  131. for(SQInteger i=0;i<size;i++)
  132. _stack[i].Null();
  133. }
  134. SQVM::~SQVM()
  135. {
  136. Finalize();
  137. REMOVE_FROM_CHAIN(&_ss(this)->_gc_chain,this);
  138. }
  139. bool SQVM::ArithMetaMethod(SQInteger op,const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &dest)
  140. {
  141. SQMetaMethod mm;
  142. switch(op){
  143. case _SC('+'): mm=MT_ADD; break;
  144. case _SC('-'): mm=MT_SUB; break;
  145. case _SC('/'): mm=MT_DIV; break;
  146. case _SC('*'): mm=MT_MUL; break;
  147. case _SC('%'): mm=MT_MODULO; break;
  148. default: mm = MT_ADD; assert(0); break; //shutup compiler
  149. }
  150. if(is_delegable(o1) && _delegable(o1)->_delegate) {
  151. SQObjectPtr closure;
  152. if(_delegable(o1)->GetMetaMethod(this, mm, closure)) {
  153. Push(o1);Push(o2);
  154. return CallMetaMethod(closure,mm,2,dest);
  155. }
  156. }
  157. Raise_Error(_SC("arith op %c on between '%s' and '%s'"),op,GetTypeName(o1),GetTypeName(o2));
  158. return false;
  159. }
  160. bool SQVM::NEG_OP(SQObjectPtr &trg,const SQObjectPtr &o)
  161. {
  162. switch(type(o)) {
  163. case OT_INTEGER:
  164. trg = -_integer(o);
  165. return true;
  166. case OT_FLOAT:
  167. trg = -_float(o);
  168. return true;
  169. case OT_TABLE:
  170. case OT_USERDATA:
  171. case OT_INSTANCE:
  172. if(_delegable(o)->_delegate) {
  173. SQObjectPtr closure;
  174. if(_delegable(o)->GetMetaMethod(this, MT_UNM, closure)) {
  175. Push(o);
  176. if(!CallMetaMethod(closure, MT_UNM, 1, temp_reg)) return false;
  177. _Swap(trg,temp_reg);
  178. return true;
  179. }
  180. }
  181. default:break; //shutup compiler
  182. }
  183. Raise_Error(_SC("attempt to negate a %s"), GetTypeName(o));
  184. return false;
  185. }
  186. #define _RET_SUCCEED(exp) { result = (exp); return true; }
  187. bool SQVM::ObjCmp(const SQObjectPtr &o1,const SQObjectPtr &o2,SQInteger &result)
  188. {
  189. SQObjectType t1 = type(o1), t2 = type(o2);
  190. if(t1 == t2) {
  191. if(_rawval(o1) == _rawval(o2))_RET_SUCCEED(0);
  192. SQObjectPtr res;
  193. switch(t1){
  194. case OT_STRING:
  195. _RET_SUCCEED(scstrcmp(_stringval(o1),_stringval(o2)));
  196. case OT_INTEGER:
  197. _RET_SUCCEED((_integer(o1)<_integer(o2))?-1:1);
  198. case OT_FLOAT:
  199. _RET_SUCCEED((_float(o1)<_float(o2))?-1:1);
  200. case OT_TABLE:
  201. case OT_USERDATA:
  202. case OT_INSTANCE:
  203. if(_delegable(o1)->_delegate) {
  204. SQObjectPtr closure;
  205. if(_delegable(o1)->GetMetaMethod(this, MT_CMP, closure)) {
  206. Push(o1);Push(o2);
  207. if(CallMetaMethod(closure,MT_CMP,2,res)) {
  208. if(type(res) != OT_INTEGER) {
  209. Raise_Error(_SC("_cmp must return an integer"));
  210. return false;
  211. }
  212. _RET_SUCCEED(_integer(res))
  213. }
  214. return false;
  215. }
  216. }
  217. //continues through (no break needed)
  218. default:
  219. _RET_SUCCEED( _userpointer(o1) < _userpointer(o2)?-1:1 );
  220. }
  221. assert(0);
  222. //if(type(res)!=OT_INTEGER) { Raise_CompareError(o1,o2); return false; }
  223. // _RET_SUCCEED(_integer(res));
  224. }
  225. else{
  226. if(sq_isnumeric(o1) && sq_isnumeric(o2)){
  227. if((t1==OT_INTEGER) && (t2==OT_FLOAT)) {
  228. if( _integer(o1)==_float(o2) ) { _RET_SUCCEED(0); }
  229. else if( _integer(o1)<_float(o2) ) { _RET_SUCCEED(-1); }
  230. _RET_SUCCEED(1);
  231. }
  232. else{
  233. if( _float(o1)==_integer(o2) ) { _RET_SUCCEED(0); }
  234. else if( _float(o1)<_integer(o2) ) { _RET_SUCCEED(-1); }
  235. _RET_SUCCEED(1);
  236. }
  237. }
  238. else if(t1==OT_NULL) {_RET_SUCCEED(-1);}
  239. else if(t2==OT_NULL) {_RET_SUCCEED(1);}
  240. else { Raise_CompareError(o1,o2); return false; }
  241. }
  242. assert(0);
  243. _RET_SUCCEED(0); //cannot happen
  244. }
  245. bool SQVM::CMP_OP(CmpOP op, const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &res)
  246. {
  247. SQInteger r;
  248. if(ObjCmp(o1,o2,r)) {
  249. switch(op) {
  250. case CMP_G: res = (r > 0); return true;
  251. case CMP_GE: res = (r >= 0); return true;
  252. case CMP_L: res = (r < 0); return true;
  253. case CMP_LE: res = (r <= 0); return true;
  254. case CMP_3W: res = r; return true;
  255. }
  256. assert(0);
  257. }
  258. return false;
  259. }
  260. bool SQVM::ToString(const SQObjectPtr &o,SQObjectPtr &res)
  261. {
  262. switch(type(o)) {
  263. case OT_STRING:
  264. res = o;
  265. return true;
  266. case OT_FLOAT:
  267. scsprintf(_sp(rsl(NUMBER_MAX_CHAR+1)),_SC("%g"),_float(o));
  268. break;
  269. case OT_INTEGER:
  270. scsprintf(_sp(rsl(NUMBER_MAX_CHAR+1)),_PRINT_INT_FMT,_integer(o));
  271. break;
  272. case OT_BOOL:
  273. scsprintf(_sp(rsl(6)),_integer(o)?_SC("true"):_SC("false"));
  274. break;
  275. case OT_TABLE:
  276. case OT_USERDATA:
  277. case OT_INSTANCE:
  278. if(_delegable(o)->_delegate) {
  279. SQObjectPtr closure;
  280. if(_delegable(o)->GetMetaMethod(this, MT_TOSTRING, closure)) {
  281. Push(o);
  282. if(CallMetaMethod(closure,MT_TOSTRING,1,res)) {;
  283. if(type(res) == OT_STRING)
  284. return true;
  285. }
  286. else {
  287. return false;
  288. }
  289. }
  290. }
  291. default:
  292. scsprintf(_sp(rsl(sizeof(void*)+20)),_SC("(%s : 0x%p)"),GetTypeName(o),(void*)_rawval(o));
  293. }
  294. res = SQString::Create(_ss(this),_spval);
  295. return true;
  296. }
  297. bool SQVM::StringCat(const SQObjectPtr &str,const SQObjectPtr &obj,SQObjectPtr &dest)
  298. {
  299. SQObjectPtr a, b;
  300. if(!ToString(str, a)) return false;
  301. if(!ToString(obj, b)) return false;
  302. SQInteger l = _string(a)->_len , ol = _string(b)->_len;
  303. SQChar *s = _sp(rsl(l + ol + 1));
  304. memcpy(s, _stringval(a), rsl(l));
  305. memcpy(s + l, _stringval(b), rsl(ol));
  306. dest = SQString::Create(_ss(this), _spval, l + ol);
  307. return true;
  308. }
  309. bool SQVM::TypeOf(const SQObjectPtr &obj1,SQObjectPtr &dest)
  310. {
  311. if(is_delegable(obj1) && _delegable(obj1)->_delegate) {
  312. SQObjectPtr closure;
  313. if(_delegable(obj1)->GetMetaMethod(this, MT_TYPEOF, closure)) {
  314. Push(obj1);
  315. return CallMetaMethod(closure,MT_TYPEOF,1,dest);
  316. }
  317. }
  318. dest = SQString::Create(_ss(this),GetTypeName(obj1));
  319. return true;
  320. }
  321. bool SQVM::Init(SQVM *friendvm, SQInteger stacksize)
  322. {
  323. _stack.resize(stacksize);
  324. _alloccallsstacksize = 4;
  325. _callstackdata.resize(_alloccallsstacksize);
  326. _callsstacksize = 0;
  327. _callsstack = &_callstackdata[0];
  328. _stackbase = 0;
  329. _top = 0;
  330. if(!friendvm)
  331. _roottable = SQTable::Create(_ss(this), 0);
  332. else {
  333. _roottable = friendvm->_roottable;
  334. _errorhandler = friendvm->_errorhandler;
  335. _debughook = friendvm->_debughook;
  336. _debughook_native = friendvm->_debughook_native;
  337. _debughook_closure = friendvm->_debughook_closure;
  338. }
  339. sq_base_register(this);
  340. return true;
  341. }
  342. bool SQVM::StartCall(SQClosure *closure,SQInteger target,SQInteger args,SQInteger stackbase,bool tailcall)
  343. {
  344. SQFunctionProto *func = closure->_function;
  345. SQInteger paramssize = func->_nparameters;
  346. const SQInteger newtop = stackbase + func->_stacksize;
  347. SQInteger nargs = args;
  348. if(func->_varparams)
  349. {
  350. paramssize--;
  351. if (nargs < paramssize) {
  352. Raise_Error(_SC("wrong number of parameters"));
  353. return false;
  354. }
  355. //dumpstack(stackbase);
  356. SQInteger nvargs = nargs - paramssize;
  357. SQArray *arr = SQArray::Create(_ss(this),nvargs);
  358. SQInteger pbase = stackbase+paramssize;
  359. for(SQInteger n = 0; n < nvargs; n++) {
  360. arr->_values[n] = _stack._vals[pbase];
  361. _stack._vals[pbase].Null();
  362. pbase++;
  363. }
  364. _stack._vals[stackbase+paramssize] = arr;
  365. //dumpstack(stackbase);
  366. }
  367. else if (paramssize != nargs) {
  368. SQInteger ndef = func->_ndefaultparams;
  369. SQInteger diff;
  370. if(ndef && nargs < paramssize && (diff = paramssize - nargs) <= ndef) {
  371. for(SQInteger n = ndef - diff; n < ndef; n++) {
  372. _stack._vals[stackbase + (nargs++)] = closure->_defaultparams[n];
  373. }
  374. }
  375. else {
  376. Raise_Error(_SC("wrong number of parameters"));
  377. return false;
  378. }
  379. }
  380. if(closure->_env) {
  381. _stack._vals[stackbase] = closure->_env->_obj;
  382. }
  383. if(!EnterFrame(stackbase, newtop, tailcall)) return false;
  384. ci->_closure = closure;
  385. ci->_literals = func->_literals;
  386. ci->_ip = func->_instructions;
  387. ci->_target = (SQInt32)target;
  388. if (_debughook) {
  389. CallDebugHook(_SC('c'));
  390. }
  391. if (closure->_function->_bgenerator) {
  392. SQFunctionProto *f = closure->_function;
  393. SQGenerator *gen = SQGenerator::Create(_ss(this), closure);
  394. if(!gen->Yield(this,f->_stacksize))
  395. return false;
  396. SQObjectPtr temp;
  397. Return(1, target, temp);
  398. STK(target) = gen;
  399. }
  400. return true;
  401. }
  402. bool SQVM::Return(SQInteger _arg0, SQInteger _arg1, SQObjectPtr &retval)
  403. {
  404. SQBool _isroot = ci->_root;
  405. SQInteger callerbase = _stackbase - ci->_prevstkbase;
  406. if (_debughook) {
  407. for(SQInteger i=0; i<ci->_ncalls; i++) {
  408. CallDebugHook(_SC('r'));
  409. }
  410. }
  411. SQObjectPtr *dest;
  412. if (_isroot) {
  413. dest = &(retval);
  414. } else if (ci->_target == -1) {
  415. dest = NULL;
  416. } else {
  417. dest = &_stack._vals[callerbase + ci->_target];
  418. }
  419. if (dest) {
  420. if(_arg0 != 0xFF) {
  421. *dest = _stack._vals[_stackbase+_arg1];
  422. }
  423. else {
  424. dest->Null();
  425. }
  426. //*dest = (_arg0 != 0xFF) ? _stack._vals[_stackbase+_arg1] : _null_;
  427. }
  428. LeaveFrame();
  429. return _isroot ? true : false;
  430. }
  431. #define _RET_ON_FAIL(exp) { if(!exp) return false; }
  432. bool SQVM::PLOCAL_INC(SQInteger op,SQObjectPtr &target, SQObjectPtr &a, SQObjectPtr &incr)
  433. {
  434. SQObjectPtr trg;
  435. _RET_ON_FAIL(ARITH_OP( op , trg, a, incr));
  436. target = a;
  437. a = trg;
  438. return true;
  439. }
  440. bool SQVM::DerefInc(SQInteger op,SQObjectPtr &target, SQObjectPtr &self, SQObjectPtr &key, SQObjectPtr &incr, bool postfix,SQInteger selfidx)
  441. {
  442. SQObjectPtr tmp, tself = self, tkey = key;
  443. if (!Get(tself, tkey, tmp, false, selfidx)) { return false; }
  444. _RET_ON_FAIL(ARITH_OP( op , target, tmp, incr))
  445. if (!Set(tself, tkey, target,selfidx)) { return false; }
  446. if (postfix) target = tmp;
  447. return true;
  448. }
  449. #define arg0 (_i_._arg0)
  450. #define sarg0 ((SQInteger)*((signed char *)&_i_._arg0))
  451. #define arg1 (_i_._arg1)
  452. #define sarg1 (*((SQInt32 *)&_i_._arg1))
  453. #define arg2 (_i_._arg2)
  454. #define arg3 (_i_._arg3)
  455. #define sarg3 ((SQInteger)*((signed char *)&_i_._arg3))
  456. SQRESULT SQVM::Suspend()
  457. {
  458. if (_suspended)
  459. return sq_throwerror(this, _SC("cannot suspend an already suspended vm"));
  460. if (_nnativecalls!=2)
  461. return sq_throwerror(this, _SC("cannot suspend through native calls/metamethods"));
  462. return SQ_SUSPEND_FLAG;
  463. }
  464. #define _FINISH(howmuchtojump) {jump = howmuchtojump; return true; }
  465. bool SQVM::FOREACH_OP(SQObjectPtr &o1,SQObjectPtr &o2,SQObjectPtr
  466. &o3,SQObjectPtr &o4,SQInteger arg_2,int exitpos,int &jump)
  467. {
  468. SQInteger nrefidx;
  469. switch(type(o1)) {
  470. case OT_TABLE:
  471. if((nrefidx = _table(o1)->Next(false,o4, o2, o3)) == -1) _FINISH(exitpos);
  472. o4 = (SQInteger)nrefidx; _FINISH(1);
  473. case OT_ARRAY:
  474. if((nrefidx = _array(o1)->Next(o4, o2, o3)) == -1) _FINISH(exitpos);
  475. o4 = (SQInteger) nrefidx; _FINISH(1);
  476. case OT_STRING:
  477. if((nrefidx = _string(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
  478. o4 = (SQInteger)nrefidx; _FINISH(1);
  479. case OT_CLASS:
  480. if((nrefidx = _class(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
  481. o4 = (SQInteger)nrefidx; _FINISH(1);
  482. case OT_USERDATA:
  483. case OT_INSTANCE:
  484. if(_delegable(o1)->_delegate) {
  485. SQObjectPtr itr;
  486. SQObjectPtr closure;
  487. if(_delegable(o1)->GetMetaMethod(this, MT_NEXTI, closure)) {
  488. Push(o1);
  489. Push(o4);
  490. if(CallMetaMethod(closure, MT_NEXTI, 2, itr)) {
  491. o4 = o2 = itr;
  492. if(type(itr) == OT_NULL) _FINISH(exitpos);
  493. if(!Get(o1, itr, o3, false, DONT_FALL_BACK)) {
  494. Raise_Error(_SC("_nexti returned an invalid idx")); // cloud be changed
  495. return false;
  496. }
  497. _FINISH(1);
  498. }
  499. else {
  500. return false;
  501. }
  502. }
  503. Raise_Error(_SC("_nexti failed"));
  504. return false;
  505. }
  506. break;
  507. case OT_GENERATOR:
  508. switch(_generator(o1)->_state){
  509. case SQGenerator::eDead: _FINISH(exitpos);
  510. break;
  511. case SQGenerator::eSuspended:{
  512. SQInteger idx = 0;
  513. if(type(o4) == OT_INTEGER) {
  514. idx = _integer(o4) + 1;
  515. }
  516. o2 = idx;
  517. o4 = idx;
  518. _generator(o1)->Resume(this, o3);
  519. _FINISH(0);
  520. }
  521. break;
  522. }
  523. default:
  524. Raise_Error(_SC("cannot iterate %s"), GetTypeName(o1));
  525. }
  526. return false; //cannot be hit(just to avoid warnings)
  527. }
  528. #define COND_LITERAL (arg3!=0?ci->_literals[arg1]:STK(arg1))
  529. #define SQ_THROW() { goto exception_trap; }
  530. #define _GUARD(exp) { if(!exp) { SQ_THROW();} }
  531. bool SQVM::CLOSURE_OP(SQObjectPtr &target, SQFunctionProto *func)
  532. {
  533. SQInteger nouters;
  534. SQClosure *closure = SQClosure::Create(_ss(this), func);
  535. if((nouters = func->_noutervalues)) {
  536. for(SQInteger i = 0; i<nouters; i++) {
  537. SQOuterVar &v = func->_outervalues[i];
  538. switch(v._type){
  539. case otLOCAL:
  540. FindOuter(closure->_outervalues[i], &STK(_integer(v._src)));
  541. break;
  542. case otOUTER:
  543. closure->_outervalues[i] = _closure(ci->_closure)->_outervalues[_integer(v._src)];
  544. break;
  545. }
  546. }
  547. }
  548. SQInteger ndefparams;
  549. if((ndefparams = func->_ndefaultparams)) {
  550. for(SQInteger i = 0; i < ndefparams; i++) {
  551. SQInteger spos = func->_defaultparams[i];
  552. closure->_defaultparams[i] = _stack._vals[_stackbase + spos];
  553. }
  554. }
  555. target = closure;
  556. return true;
  557. }
  558. bool SQVM::CLASS_OP(SQObjectPtr &target,SQInteger baseclass,SQInteger attributes)
  559. {
  560. SQClass *base = NULL;
  561. SQObjectPtr attrs;
  562. if(baseclass != -1) {
  563. if(type(_stack._vals[_stackbase+baseclass]) != OT_CLASS) { Raise_Error(_SC("trying to inherit from a %s"),GetTypeName(_stack._vals[_stackbase+baseclass])); return false; }
  564. base = _class(_stack._vals[_stackbase + baseclass]);
  565. }
  566. if(attributes != MAX_FUNC_STACKSIZE) {
  567. attrs = _stack._vals[_stackbase+attributes];
  568. }
  569. target = SQClass::Create(_ss(this),base);
  570. if(type(_class(target)->_metamethods[MT_INHERITED]) != OT_NULL) {
  571. int nparams = 2;
  572. SQObjectPtr ret;
  573. Push(target); Push(attrs);
  574. Call(_class(target)->_metamethods[MT_INHERITED],nparams,_top - nparams, ret, false);
  575. Pop(nparams);
  576. }
  577. _class(target)->_attributes = attrs;
  578. return true;
  579. }
  580. bool SQVM::IsEqual(const SQObjectPtr &o1,const SQObjectPtr &o2,bool &res)
  581. {
  582. if(type(o1) == type(o2)) {
  583. res = (_rawval(o1) == _rawval(o2));
  584. }
  585. else {
  586. if(sq_isnumeric(o1) && sq_isnumeric(o2)) {
  587. res = (tofloat(o1) == tofloat(o2));
  588. }
  589. else {
  590. res = false;
  591. }
  592. }
  593. return true;
  594. }
  595. bool SQVM::IsFalse(SQObjectPtr &o)
  596. {
  597. if(((type(o) & SQOBJECT_CANBEFALSE)
  598. && ( ((type(o) == OT_FLOAT) && (_float(o) == SQFloat(0.0))) ))
  599. #if !defined(SQUSEDOUBLE) || (defined(SQUSEDOUBLE) && defined(_SQ64))
  600. || (_integer(o) == 0) ) //OT_NULL|OT_INTEGER|OT_BOOL
  601. #else
  602. || (((type(o) != OT_FLOAT) && (_integer(o) == 0))) ) //OT_NULL|OT_INTEGER|OT_BOOL
  603. #endif
  604. {
  605. return true;
  606. }
  607. return false;
  608. }
  609. bool SQVM::Execute(SQObjectPtr &closure, SQInteger nargs, SQInteger stackbase,SQObjectPtr &outres, SQBool raiseerror,ExecutionType et)
  610. {
  611. if ((_nnativecalls + 1) > MAX_NATIVE_CALLS) { Raise_Error(_SC("Native stack overflow")); return false; }
  612. _nnativecalls++;
  613. AutoDec ad(&_nnativecalls);
  614. SQInteger traps = 0;
  615. CallInfo *prevci = ci;
  616. switch(et) {
  617. case ET_CALL: {
  618. temp_reg = closure;
  619. if(!StartCall(_closure(temp_reg), _top - nargs, nargs, stackbase, false)) {
  620. //call the handler if there are no calls in the stack, if not relies on the previous node
  621. if(ci == NULL) CallErrorHandler(_lasterror);
  622. return false;
  623. }
  624. if(ci == prevci) {
  625. outres = STK(_top-nargs);
  626. return true;
  627. }
  628. ci->_root = SQTrue;
  629. }
  630. break;
  631. case ET_RESUME_GENERATOR: _generator(closure)->Resume(this, outres); ci->_root = SQTrue; traps += ci->_etraps; break;
  632. case ET_RESUME_VM:
  633. case ET_RESUME_THROW_VM:
  634. traps = _suspended_traps;
  635. ci->_root = _suspended_root;
  636. _suspended = SQFalse;
  637. if(et == ET_RESUME_THROW_VM) { SQ_THROW(); }
  638. break;
  639. }
  640. exception_restore:
  641. //
  642. {
  643. for(;;)
  644. {
  645. const SQInstruction &_i_ = *ci->_ip++;
  646. //dumpstack(_stackbase);
  647. //scprintf("\n[%d] %s %d %d %d %d\n",ci->_ip-ci->_iv->_vals,g_InstrDesc[_i_.op].name,arg0,arg1,arg2,arg3);
  648. switch(_i_.op)
  649. {
  650. case _OP_LINE: if (_debughook) CallDebugHook(_SC('l'),arg1); continue;
  651. case _OP_LOAD: TARGET = ci->_literals[arg1]; continue;
  652. case _OP_LOADINT:
  653. #ifndef _SQ64
  654. TARGET = (SQInteger)arg1; continue;
  655. #else
  656. TARGET = (SQInteger)((SQUnsignedInteger32)arg1); continue;
  657. #endif
  658. case _OP_LOADFLOAT: TARGET = *((SQFloat *)&arg1); continue;
  659. case _OP_DLOAD: TARGET = ci->_literals[arg1]; STK(arg2) = ci->_literals[arg3];continue;
  660. case _OP_TAILCALL:{
  661. SQObjectPtr &t = STK(arg1);
  662. if (type(t) == OT_CLOSURE
  663. && (!_closure(t)->_function->_bgenerator)){
  664. SQObjectPtr clo = t;
  665. if(_openouters) CloseOuters(&(_stack._vals[_stackbase]));
  666. for (SQInteger i = 0; i < arg3; i++) STK(i) = STK(arg2 + i);
  667. _GUARD(StartCall(_closure(clo), ci->_target, arg3, _stackbase, true));
  668. continue;
  669. }
  670. }
  671. case _OP_CALL: {
  672. SQObjectPtr clo = STK(arg1);
  673. switch (type(clo)) {
  674. case OT_CLOSURE:
  675. _GUARD(StartCall(_closure(clo), sarg0, arg3, _stackbase+arg2, false));
  676. continue;
  677. case OT_NATIVECLOSURE: {
  678. bool suspend;
  679. _GUARD(CallNative(_nativeclosure(clo), arg3, _stackbase+arg2, clo,suspend));
  680. if(suspend){
  681. _suspended = SQTrue;
  682. _suspended_target = sarg0;
  683. _suspended_root = ci->_root;
  684. _suspended_traps = traps;
  685. outres = clo;
  686. return true;
  687. }
  688. if(sarg0 != -1) {
  689. STK(arg0) = clo;
  690. }
  691. }
  692. continue;
  693. case OT_CLASS:{
  694. SQObjectPtr inst;
  695. _GUARD(CreateClassInstance(_class(clo),inst,clo));
  696. if(sarg0 != -1) {
  697. STK(arg0) = inst;
  698. }
  699. SQInteger stkbase;
  700. switch(type(clo)) {
  701. case OT_CLOSURE:
  702. stkbase = _stackbase+arg2;
  703. _stack._vals[stkbase] = inst;
  704. _GUARD(StartCall(_closure(clo), -1, arg3, stkbase, false));
  705. break;
  706. case OT_NATIVECLOSURE:
  707. bool suspend;
  708. stkbase = _stackbase+arg2;
  709. _stack._vals[stkbase] = inst;
  710. _GUARD(CallNative(_nativeclosure(clo), arg3, stkbase, clo,suspend));
  711. break;
  712. default: break; //shutup GCC 4.x
  713. }
  714. }
  715. break;
  716. case OT_TABLE:
  717. case OT_USERDATA:
  718. case OT_INSTANCE:{
  719. SQObjectPtr closure;
  720. if(_delegable(clo)->_delegate && _delegable(clo)->GetMetaMethod(this,MT_CALL,closure)) {
  721. Push(clo);
  722. for (SQInteger i = 0; i < arg3; i++) Push(STK(arg2 + i));
  723. if(!CallMetaMethod(closure, MT_CALL, arg3+1, clo)) SQ_THROW();
  724. if(sarg0 != -1) {
  725. STK(arg0) = clo;
  726. }
  727. break;
  728. }
  729. //Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
  730. //SQ_THROW();
  731. }
  732. default:
  733. Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
  734. SQ_THROW();
  735. }
  736. }
  737. continue;
  738. case _OP_PREPCALL:
  739. case _OP_PREPCALLK: {
  740. SQObjectPtr &key = _i_.op == _OP_PREPCALLK?(ci->_literals)[arg1]:STK(arg1);
  741. SQObjectPtr &o = STK(arg2);
  742. if (!Get(o, key, temp_reg,false,arg2)) {
  743. SQ_THROW();
  744. }
  745. STK(arg3) = o;
  746. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  747. }
  748. continue;
  749. case _OP_GETK:
  750. #ifndef NO_EXCEPTION_KEY_NOT_FOUND
  751. if (!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) { SQ_THROW();}
  752. #else
  753. //DAD instead of throw an exception return null
  754. if(!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) temp_reg.Null();
  755. #endif
  756. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  757. continue;
  758. case _OP_MOVE: TARGET = STK(arg1); continue;
  759. case _OP_NEWSLOT:
  760. _GUARD(NewSlot(STK(arg1), STK(arg2), STK(arg3),false));
  761. if(arg0 != 0xFF) TARGET = STK(arg3);
  762. continue;
  763. case _OP_DELETE: _GUARD(DeleteSlot(STK(arg1), STK(arg2), TARGET)); continue;
  764. case _OP_SET:
  765. if (!Set(STK(arg1), STK(arg2), STK(arg3),arg1)) { SQ_THROW(); }
  766. if (arg0 != 0xFF) TARGET = STK(arg3);
  767. continue;
  768. case _OP_GET:
  769. if (!Get(STK(arg1), STK(arg2), temp_reg, false,arg1)) { SQ_THROW(); }
  770. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  771. continue;
  772. case _OP_EQ:{
  773. bool res;
  774. if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
  775. TARGET = res?true:false;
  776. }continue;
  777. case _OP_NE:{
  778. bool res;
  779. if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
  780. TARGET = (!res)?true:false;
  781. } continue;
  782. case _OP_ADD: _ARITH_(+,TARGET,STK(arg2),STK(arg1)); continue;
  783. case _OP_SUB: _ARITH_(-,TARGET,STK(arg2),STK(arg1)); continue;
  784. case _OP_MUL: _ARITH_(*,TARGET,STK(arg2),STK(arg1)); continue;
  785. case _OP_DIV: _ARITH_NOZERO(/,TARGET,STK(arg2),STK(arg1),_SC("division by zero")); continue;
  786. case _OP_MOD: ARITH_OP('%',TARGET,STK(arg2),STK(arg1)); continue;
  787. case _OP_BITW: _GUARD(BW_OP( arg3,TARGET,STK(arg2),STK(arg1))); continue;
  788. case _OP_RETURN:
  789. if((ci)->_generator) {
  790. (ci)->_generator->Kill();
  791. }
  792. if(Return(arg0, arg1, temp_reg)){
  793. assert(traps==0);
  794. //outres = temp_reg;
  795. _Swap(outres,temp_reg);
  796. return true;
  797. }
  798. continue;
  799. case _OP_LOADNULLS:{ for(SQInt32 n=0; n < arg1; n++) STK(arg0+n).Null(); }continue;
  800. case _OP_LOADROOT: TARGET = _roottable; continue;
  801. case _OP_LOADBOOL: TARGET = arg1?true:false; continue;
  802. case _OP_DMOVE: STK(arg0) = STK(arg1); STK(arg2) = STK(arg3); continue;
  803. case _OP_JMP: ci->_ip += (sarg1); continue;
  804. //case _OP_JNZ: if(!IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
  805. case _OP_JCMP:
  806. _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg0),temp_reg));
  807. if(IsFalse(temp_reg)) ci->_ip+=(sarg1);
  808. continue;
  809. case _OP_JZ: if(IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
  810. case _OP_GETOUTER: {
  811. SQClosure *cur_cls = _closure(ci->_closure);
  812. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  813. TARGET = *(otr->_valptr);
  814. }
  815. continue;
  816. case _OP_SETOUTER: {
  817. SQClosure *cur_cls = _closure(ci->_closure);
  818. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  819. *(otr->_valptr) = STK(arg2);
  820. if(arg0 != 0xFF) {
  821. TARGET = STK(arg2);
  822. }
  823. }
  824. continue;
  825. case _OP_NEWOBJ:
  826. switch(arg3) {
  827. case NOT_TABLE: TARGET = SQTable::Create(_ss(this), arg1); continue;
  828. case NOT_ARRAY: TARGET = SQArray::Create(_ss(this), 0); _array(TARGET)->Reserve(arg1); continue;
  829. case NOT_CLASS: _GUARD(CLASS_OP(TARGET,arg1,arg2)); continue;
  830. default: assert(0); continue;
  831. }
  832. case _OP_APPENDARRAY:
  833. {
  834. SQObject val;
  835. val._unVal.raw = 0;
  836. switch(arg2) {
  837. case AAT_STACK:
  838. val = STK(arg1); break;
  839. case AAT_LITERAL:
  840. val = ci->_literals[arg1]; break;
  841. case AAT_INT:
  842. val._type = OT_INTEGER;
  843. #ifndef _SQ64
  844. val._unVal.nInteger = (SQInteger)arg1;
  845. #else
  846. val._unVal.nInteger = (SQInteger)((SQUnsignedInteger32)arg1);
  847. #endif
  848. break;
  849. case AAT_FLOAT:
  850. val._type = OT_FLOAT;
  851. val._unVal.fFloat = *((SQFloat *)&arg1);
  852. break;
  853. case AAT_BOOL:
  854. val._type = OT_BOOL;
  855. val._unVal.nInteger = arg1;
  856. break;
  857. default: assert(0); break;
  858. }
  859. _array(STK(arg0))->Append(val); continue;
  860. }
  861. case _OP_COMPARITH: {
  862. SQInteger selfidx = (((SQUnsignedInteger)arg1&0xFFFF0000)>>16);
  863. _GUARD(DerefInc(arg3, TARGET, STK(selfidx), STK(arg2), STK(arg1&0x0000FFFF), false, selfidx));
  864. }
  865. continue;
  866. case _OP_INC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, false, arg1));} continue;
  867. case _OP_INCL: {
  868. SQObjectPtr &a = STK(arg1);
  869. if(type(a) == OT_INTEGER) {
  870. a._unVal.nInteger = _integer(a) + sarg3;
  871. }
  872. else {
  873. SQObjectPtr o(sarg3); //_GUARD(LOCAL_INC('+',TARGET, STK(arg1), o));
  874. _ARITH_(+,a,a,o);
  875. }
  876. } continue;
  877. case _OP_PINC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, true, arg1));} continue;
  878. case _OP_PINCL: {
  879. SQObjectPtr &a = STK(arg1);
  880. if(type(a) == OT_INTEGER) {
  881. TARGET = a;
  882. a._unVal.nInteger = _integer(a) + sarg3;
  883. }
  884. else {
  885. SQObjectPtr o(sarg3); _GUARD(PLOCAL_INC('+',TARGET, STK(arg1), o));
  886. }
  887. } continue;
  888. case _OP_CMP: _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg1),TARGET)) continue;
  889. case _OP_EXISTS: TARGET = Get(STK(arg1), STK(arg2), temp_reg, true,DONT_FALL_BACK)?true:false;continue;
  890. case _OP_INSTANCEOF:
  891. if(type(STK(arg1)) != OT_CLASS)
  892. {Raise_Error(_SC("cannot apply instanceof between a %s and a %s"),GetTypeName(STK(arg1)),GetTypeName(STK(arg2))); SQ_THROW();}
  893. TARGET = (type(STK(arg2)) == OT_INSTANCE) ? (_instance(STK(arg2))->InstanceOf(_class(STK(arg1)))?true:false) : false;
  894. continue;
  895. case _OP_AND:
  896. if(IsFalse(STK(arg2))) {
  897. TARGET = STK(arg2);
  898. ci->_ip += (sarg1);
  899. }
  900. continue;
  901. case _OP_OR:
  902. if(!IsFalse(STK(arg2))) {
  903. TARGET = STK(arg2);
  904. ci->_ip += (sarg1);
  905. }
  906. continue;
  907. case _OP_NEG: _GUARD(NEG_OP(TARGET,STK(arg1))); continue;
  908. case _OP_NOT: TARGET = IsFalse(STK(arg1)); continue;
  909. case _OP_BWNOT:
  910. if(type(STK(arg1)) == OT_INTEGER) {
  911. SQInteger t = _integer(STK(arg1));
  912. TARGET = SQInteger(~t);
  913. continue;
  914. }
  915. Raise_Error(_SC("attempt to perform a bitwise op on a %s"), GetTypeName(STK(arg1)));
  916. SQ_THROW();
  917. case _OP_CLOSURE: {
  918. SQClosure *c = ci->_closure._unVal.pClosure;
  919. SQFunctionProto *fp = c->_function;
  920. if(!CLOSURE_OP(TARGET,fp->_functions[arg1]._unVal.pFunctionProto)) { SQ_THROW(); }
  921. continue;
  922. }
  923. case _OP_YIELD:{
  924. if(ci->_generator) {
  925. if(sarg1 != MAX_FUNC_STACKSIZE) temp_reg = STK(arg1);
  926. _GUARD(ci->_generator->Yield(this,arg2));
  927. traps -= ci->_etraps;
  928. if(sarg1 != MAX_FUNC_STACKSIZE) _Swap(STK(arg1),temp_reg);//STK(arg1) = temp_reg;
  929. }
  930. else { Raise_Error(_SC("trying to yield a '%s',only genenerator can be yielded"), GetTypeName(ci->_generator)); SQ_THROW();}
  931. if(Return(arg0, arg1, temp_reg)){
  932. assert(traps == 0);
  933. outres = temp_reg;
  934. return true;
  935. }
  936. }
  937. continue;
  938. case _OP_RESUME:
  939. if(type(STK(arg1)) != OT_GENERATOR){ Raise_Error(_SC("trying to resume a '%s',only genenerator can be resumed"), GetTypeName(STK(arg1))); SQ_THROW();}
  940. _GUARD(_generator(STK(arg1))->Resume(this, TARGET));
  941. traps += ci->_etraps;
  942. continue;
  943. case _OP_FOREACH:{ int tojump;
  944. _GUARD(FOREACH_OP(STK(arg0),STK(arg2),STK(arg2+1),STK(arg2+2),arg2,sarg1,tojump));
  945. ci->_ip += tojump; }
  946. continue;
  947. case _OP_POSTFOREACH:
  948. assert(type(STK(arg0)) == OT_GENERATOR);
  949. if(_generator(STK(arg0))->_state == SQGenerator::eDead)
  950. ci->_ip += (sarg1 - 1);
  951. continue;
  952. case _OP_CLONE: _GUARD(Clone(STK(arg1), TARGET)); continue;
  953. case _OP_TYPEOF: _GUARD(TypeOf(STK(arg1), TARGET)) continue;
  954. case _OP_PUSHTRAP:{
  955. SQInstruction *_iv = _closure(ci->_closure)->_function->_instructions;
  956. _etraps.push_back(SQExceptionTrap(_top,_stackbase, &_iv[(ci->_ip-_iv)+arg1], arg0)); traps++;
  957. ci->_etraps++;
  958. }
  959. continue;
  960. case _OP_POPTRAP: {
  961. for(SQInteger i = 0; i < arg0; i++) {
  962. _etraps.pop_back(); traps--;
  963. ci->_etraps--;
  964. }
  965. }
  966. continue;
  967. case _OP_THROW: Raise_Error(TARGET); SQ_THROW(); continue;
  968. case _OP_NEWSLOTA:
  969. _GUARD(NewSlotA(STK(arg1),STK(arg2),STK(arg3),(arg0&NEW_SLOT_ATTRIBUTES_FLAG) ? STK(arg2-1) : SQObjectPtr(),(arg0&NEW_SLOT_STATIC_FLAG)?true:false,false));
  970. continue;
  971. case _OP_GETBASE:{
  972. SQClosure *clo = _closure(ci->_closure);
  973. if(clo->_base) {
  974. TARGET = clo->_base;
  975. }
  976. else {
  977. TARGET.Null();
  978. }
  979. continue;
  980. }
  981. case _OP_CLOSE:
  982. if(_openouters) CloseOuters(&(STK(arg1)));
  983. continue;
  984. }
  985. }
  986. }
  987. exception_trap:
  988. {
  989. SQObjectPtr currerror = _lasterror;
  990. // dumpstack(_stackbase);
  991. // SQInteger n = 0;
  992. SQInteger last_top = _top;
  993. if(_ss(this)->_notifyallexceptions || (!traps && raiseerror)) CallErrorHandler(currerror);
  994. while( ci ) {
  995. if(ci->_etraps > 0) {
  996. SQExceptionTrap &et = _etraps.top();
  997. ci->_ip = et._ip;
  998. _top = et._stacksize;
  999. _stackbase = et._stackbase;
  1000. _stack._vals[_stackbase + et._extarget] = currerror;
  1001. _etraps.pop_back(); traps--; ci->_etraps--;
  1002. while(last_top >= _top) _stack._vals[last_top--].Null();
  1003. goto exception_restore;
  1004. }
  1005. else if (_debughook) {
  1006. //notify debugger of a "return"
  1007. //even if it really an exception unwinding the stack
  1008. for(SQInteger i = 0; i < ci->_ncalls; i++) {
  1009. CallDebugHook(_SC('r'));
  1010. }
  1011. }
  1012. if(ci->_generator) ci->_generator->Kill();
  1013. bool mustbreak = ci && ci->_root;
  1014. LeaveFrame();
  1015. if(mustbreak) break;
  1016. }
  1017. _lasterror = currerror;
  1018. return false;
  1019. }
  1020. assert(0);
  1021. }
  1022. bool SQVM::CreateClassInstance(SQClass *theclass, SQObjectPtr &inst, SQObjectPtr &constructor)
  1023. {
  1024. inst = theclass->CreateInstance();
  1025. if(!theclass->GetConstructor(constructor)) {
  1026. constructor.Null();
  1027. }
  1028. return true;
  1029. }
  1030. void SQVM::CallErrorHandler(SQObjectPtr &error)
  1031. {
  1032. if(type(_errorhandler) != OT_NULL) {
  1033. SQObjectPtr out;
  1034. Push(_roottable); Push(error);
  1035. Call(_errorhandler, 2, _top-2, out,SQFalse);
  1036. Pop(2);
  1037. }
  1038. }
  1039. void SQVM::CallDebugHook(SQInteger type,SQInteger forcedline)
  1040. {
  1041. _debughook = false;
  1042. SQFunctionProto *func=_closure(ci->_closure)->_function;
  1043. if(_debughook_native) {
  1044. const SQChar *src = type(func->_sourcename) == OT_STRING?_stringval(func->_sourcename):NULL;
  1045. const SQChar *fname = type(func->_name) == OT_STRING?_stringval(func->_name):NULL;
  1046. SQInteger line = forcedline?forcedline:func->GetLine(ci->_ip);
  1047. _debughook_native(this,type,src,line,fname);
  1048. }
  1049. else {
  1050. SQObjectPtr temp_reg;
  1051. SQInteger nparams=5;
  1052. Push(_roottable); Push(type); Push(func->_sourcename); Push(forcedline?forcedline:func->GetLine(ci->_ip)); Push(func->_name);
  1053. Call(_debughook_closure,nparams,_top-nparams,temp_reg,SQFalse);
  1054. Pop(nparams);
  1055. }
  1056. _debughook = true;
  1057. }
  1058. bool SQVM::CallNative(SQNativeClosure *nclosure, SQInteger nargs, SQInteger newbase, SQObjectPtr &retval, bool &suspend)
  1059. {
  1060. SQInteger nparamscheck = nclosure->_nparamscheck;
  1061. SQInteger newtop = newbase + nargs + nclosure->_noutervalues;
  1062. if (_nnativecalls + 1 > MAX_NATIVE_CALLS) {
  1063. Raise_Error(_SC("Native stack overflow"));
  1064. return false;
  1065. }
  1066. if(nparamscheck && (((nparamscheck > 0) && (nparamscheck != nargs)) ||
  1067. ((nparamscheck < 0) && (nargs < (-nparamscheck)))))
  1068. {
  1069. Raise_Error(_SC("wrong number of parameters"));
  1070. return false;
  1071. }
  1072. SQInteger tcs;
  1073. SQIntVec &tc = nclosure->_typecheck;
  1074. if((tcs = tc.size())) {
  1075. for(SQInteger i = 0; i < nargs && i < tcs; i++) {
  1076. if((tc._vals[i] != -1) && !(type(_stack._vals[newbase+i]) & tc._vals[i])) {
  1077. Raise_ParamTypeError(i,tc._vals[i],type(_stack._vals[newbase+i]));
  1078. return false;
  1079. }
  1080. }
  1081. }
  1082. if(!EnterFrame(newbase, newtop, false)) return false;
  1083. ci->_closure = nclosure;
  1084. SQInteger outers = nclosure->_noutervalues;
  1085. for (SQInteger i = 0; i < outers; i++) {
  1086. _stack._vals[newbase+nargs+i] = nclosure->_outervalues[i];
  1087. }
  1088. if(nclosure->_env) {
  1089. _stack._vals[newbase] = nclosure->_env->_obj;
  1090. }
  1091. _nnativecalls++;
  1092. SQInteger ret = (nclosure->_function)(this);
  1093. _nnativecalls--;
  1094. suspend = false;
  1095. if (ret == SQ_SUSPEND_FLAG) {
  1096. suspend = true;
  1097. }
  1098. else if (ret < 0) {
  1099. LeaveFrame();
  1100. Raise_Error(_lasterror);
  1101. return false;
  1102. }
  1103. if(ret) {
  1104. retval = _stack._vals[_top-1];
  1105. }
  1106. else {
  1107. retval.Null();
  1108. }
  1109. //retval = ret ? _stack._vals[_top-1] : _null_;
  1110. LeaveFrame();
  1111. return true;
  1112. }
  1113. #define FALLBACK_OK 0
  1114. #define FALLBACK_NO_MATCH 1
  1115. #define FALLBACK_ERROR 2
  1116. bool SQVM::Get(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest,bool raw, SQInteger selfidx)
  1117. {
  1118. switch(type(self)){
  1119. case OT_TABLE:
  1120. if(_table(self)->Get(key,dest))return true;
  1121. break;
  1122. case OT_ARRAY:
  1123. if(sq_isnumeric(key)) { if(_array(self)->Get(tointeger(key),dest)) { return true; } Raise_IdxError(key); return false; }
  1124. break;
  1125. case OT_INSTANCE:
  1126. if(_instance(self)->Get(key,dest)) return true;
  1127. break;
  1128. case OT_CLASS:
  1129. if(_class(self)->Get(key,dest)) return true;
  1130. break;
  1131. case OT_STRING:
  1132. if(sq_isnumeric(key)){
  1133. SQInteger n = tointeger(key);
  1134. if(abs((int)n) < _string(self)->_len) {
  1135. if(n < 0) n = _string(self)->_len - n;
  1136. dest = SQInteger(_stringval(self)[n]);
  1137. return true;
  1138. }
  1139. Raise_IdxError(key);
  1140. return false;
  1141. }
  1142. break;
  1143. default:break; //shut up compiler
  1144. }
  1145. if(!raw) {
  1146. switch(FallBackGet(self,key,dest)) {
  1147. case FALLBACK_OK: return true; //okie
  1148. case FALLBACK_NO_MATCH: break; //keep falling back
  1149. case FALLBACK_ERROR: return false; // the metamethod failed
  1150. }
  1151. if(InvokeDefaultDelegate(self,key,dest)) {
  1152. return true;
  1153. }
  1154. }
  1155. //#ifdef ROOT_FALLBACK
  1156. if(selfidx == 0) {
  1157. if(_table(_roottable)->Get(key,dest)) return true;
  1158. }
  1159. //#endif
  1160. Raise_IdxError(key);
  1161. return false;
  1162. }
  1163. bool SQVM::InvokeDefaultDelegate(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1164. {
  1165. SQTable *ddel = NULL;
  1166. switch(type(self)) {
  1167. case OT_CLASS: ddel = _class_ddel; break;
  1168. case OT_TABLE: ddel = _table_ddel; break;
  1169. case OT_ARRAY: ddel = _array_ddel; break;
  1170. case OT_STRING: ddel = _string_ddel; break;
  1171. case OT_INSTANCE: ddel = _instance_ddel; break;
  1172. case OT_INTEGER:case OT_FLOAT:case OT_BOOL: ddel = _number_ddel; break;
  1173. case OT_GENERATOR: ddel = _generator_ddel; break;
  1174. case OT_CLOSURE: case OT_NATIVECLOSURE: ddel = _closure_ddel; break;
  1175. case OT_THREAD: ddel = _thread_ddel; break;
  1176. case OT_WEAKREF: ddel = _weakref_ddel; break;
  1177. default: return false;
  1178. }
  1179. return ddel->Get(key,dest);
  1180. }
  1181. SQInteger SQVM::FallBackGet(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1182. {
  1183. switch(type(self)){
  1184. case OT_TABLE:
  1185. case OT_USERDATA:
  1186. //delegation
  1187. if(_delegable(self)->_delegate) {
  1188. if(Get(SQObjectPtr(_delegable(self)->_delegate),key,dest,false,DONT_FALL_BACK)) return FALLBACK_OK;
  1189. }
  1190. else {
  1191. return FALLBACK_NO_MATCH;
  1192. }
  1193. //go through
  1194. case OT_INSTANCE: {
  1195. SQObjectPtr closure;
  1196. if(_delegable(self)->GetMetaMethod(this, MT_GET, closure)) {
  1197. Push(self);Push(key);
  1198. _nmetamethodscall++;
  1199. AutoDec ad(&_nmetamethodscall);
  1200. if(Call(closure, 2, _top - 2, dest, SQFalse)) {
  1201. Pop(2);
  1202. return FALLBACK_OK;
  1203. }
  1204. else {
  1205. Pop(2);
  1206. if(type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1207. return FALLBACK_ERROR;
  1208. }
  1209. }
  1210. }
  1211. }
  1212. break;
  1213. default: break;//shutup GCC 4.x
  1214. }
  1215. // no metamethod or no fallback type
  1216. return FALLBACK_NO_MATCH;
  1217. }
  1218. bool SQVM::Set(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,SQInteger selfidx)
  1219. {
  1220. switch(type(self)){
  1221. case OT_TABLE:
  1222. if(_table(self)->Set(key,val)) return true;
  1223. break;
  1224. case OT_INSTANCE:
  1225. if(_instance(self)->Set(key,val)) return true;
  1226. break;
  1227. case OT_ARRAY:
  1228. if(!sq_isnumeric(key)) { Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key)); return false; }
  1229. if(!_array(self)->Set(tointeger(key),val)) {
  1230. Raise_IdxError(key);
  1231. return false;
  1232. }
  1233. return true;
  1234. default:
  1235. Raise_Error(_SC("trying to set '%s'"),GetTypeName(self));
  1236. return false;
  1237. }
  1238. switch(FallBackSet(self,key,val)) {
  1239. case FALLBACK_OK: return true; //okie
  1240. case FALLBACK_NO_MATCH: break; //keep falling back
  1241. case FALLBACK_ERROR: return false; // the metamethod failed
  1242. }
  1243. if(selfidx == 0) {
  1244. if(_table(_roottable)->Set(key,val))
  1245. return true;
  1246. }
  1247. Raise_IdxError(key);
  1248. return false;
  1249. }
  1250. SQInteger SQVM::FallBackSet(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val)
  1251. {
  1252. switch(type(self)) {
  1253. case OT_TABLE:
  1254. if(_table(self)->_delegate) {
  1255. if(Set(_table(self)->_delegate,key,val,DONT_FALL_BACK)) return FALLBACK_OK;
  1256. }
  1257. //keps on going
  1258. case OT_INSTANCE:
  1259. case OT_USERDATA:{
  1260. SQObjectPtr closure;
  1261. SQObjectPtr t;
  1262. if(_delegable(self)->GetMetaMethod(this, MT_SET, closure)) {
  1263. Push(self);Push(key);Push(val);
  1264. _nmetamethodscall++;
  1265. AutoDec ad(&_nmetamethodscall);
  1266. if(Call(closure, 3, _top - 3, t, SQFalse)) {
  1267. Pop(3);
  1268. return FALLBACK_OK;
  1269. }
  1270. else {
  1271. if(type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1272. //error
  1273. Pop(3);
  1274. return FALLBACK_ERROR;
  1275. }
  1276. }
  1277. }
  1278. }
  1279. break;
  1280. default: break;//shutup GCC 4.x
  1281. }
  1282. // no metamethod or no fallback type
  1283. return FALLBACK_NO_MATCH;
  1284. }
  1285. bool SQVM::Clone(const SQObjectPtr &self,SQObjectPtr &target)
  1286. {
  1287. SQObjectPtr temp_reg;
  1288. SQObjectPtr newobj;
  1289. switch(type(self)){
  1290. case OT_TABLE:
  1291. newobj = _table(self)->Clone();
  1292. goto cloned_mt;
  1293. case OT_INSTANCE: {
  1294. newobj = _instance(self)->Clone(_ss(this));
  1295. cloned_mt:
  1296. SQObjectPtr closure;
  1297. if(_delegable(newobj)->_delegate && _delegable(newobj)->GetMetaMethod(this,MT_CLONED,closure)) {
  1298. Push(newobj);
  1299. Push(self);
  1300. if(!CallMetaMethod(closure,MT_CLONED,2,temp_reg))
  1301. return false;
  1302. }
  1303. }
  1304. target = newobj;
  1305. return true;
  1306. case OT_ARRAY:
  1307. target = _array(self)->Clone();
  1308. return true;
  1309. default:
  1310. Raise_Error(_SC("cloning a %s"), GetTypeName(self));
  1311. return false;
  1312. }
  1313. }
  1314. bool SQVM::NewSlotA(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,const SQObjectPtr &attrs,bool bstatic,bool raw)
  1315. {
  1316. if(type(self) != OT_CLASS) {
  1317. Raise_Error(_SC("object must be a class"));
  1318. return false;
  1319. }
  1320. SQClass *c = _class(self);
  1321. if(!raw) {
  1322. SQObjectPtr &mm = c->_metamethods[MT_NEWMEMBER];
  1323. if(type(mm) != OT_NULL ) {
  1324. Push(self); Push(key); Push(val);
  1325. Push(attrs);
  1326. Push(bstatic);
  1327. return CallMetaMethod(mm,MT_NEWMEMBER,5,temp_reg);
  1328. }
  1329. }
  1330. if(!NewSlot(self, key, val,bstatic))
  1331. return false;
  1332. if(type(attrs) != OT_NULL) {
  1333. c->SetAttributes(key,attrs);
  1334. }
  1335. return true;
  1336. }
  1337. bool SQVM::NewSlot(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,bool bstatic)
  1338. {
  1339. if(type(key) == OT_NULL) { Raise_Error(_SC("null cannot be used as index")); return false; }
  1340. switch(type(self)) {
  1341. case OT_TABLE: {
  1342. bool rawcall = true;
  1343. if(_table(self)->_delegate) {
  1344. SQObjectPtr res;
  1345. if(!_table(self)->Get(key,res)) {
  1346. SQObjectPtr closure;
  1347. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1348. Push(self);Push(key);Push(val);
  1349. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1350. return false;
  1351. }
  1352. rawcall = false;
  1353. }
  1354. else {
  1355. rawcall = true;
  1356. }
  1357. }
  1358. }
  1359. if(rawcall) _table(self)->NewSlot(key,val); //cannot fail
  1360. break;}
  1361. case OT_INSTANCE: {
  1362. SQObjectPtr res;
  1363. SQObjectPtr closure;
  1364. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1365. Push(self);Push(key);Push(val);
  1366. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1367. return false;
  1368. }
  1369. break;
  1370. }
  1371. Raise_Error(_SC("class instances do not support the new slot operator"));
  1372. return false;
  1373. break;}
  1374. case OT_CLASS:
  1375. if(!_class(self)->NewSlot(_ss(this),key,val,bstatic)) {
  1376. if(_class(self)->_locked) {
  1377. Raise_Error(_SC("trying to modify a class that has already been instantiated"));
  1378. return false;
  1379. }
  1380. else {
  1381. SQObjectPtr oval = PrintObjVal(key);
  1382. Raise_Error(_SC("the property '%s' already exists"),_stringval(oval));
  1383. return false;
  1384. }
  1385. }
  1386. break;
  1387. default:
  1388. Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key));
  1389. return false;
  1390. break;
  1391. }
  1392. return true;
  1393. }
  1394. bool SQVM::DeleteSlot(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &res)
  1395. {
  1396. switch(type(self)) {
  1397. case OT_TABLE:
  1398. case OT_INSTANCE:
  1399. case OT_USERDATA: {
  1400. SQObjectPtr t;
  1401. //bool handled = false;
  1402. SQObjectPtr closure;
  1403. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_DELSLOT,closure)) {
  1404. Push(self);Push(key);
  1405. return CallMetaMethod(closure,MT_DELSLOT,2,res);
  1406. }
  1407. else {
  1408. if(type(self) == OT_TABLE) {
  1409. if(_table(self)->Get(key,t)) {
  1410. _table(self)->Remove(key);
  1411. }
  1412. else {
  1413. Raise_IdxError((SQObject &)key);
  1414. return false;
  1415. }
  1416. }
  1417. else {
  1418. Raise_Error(_SC("cannot delete a slot from %s"),GetTypeName(self));
  1419. return false;
  1420. }
  1421. }
  1422. res = t;
  1423. }
  1424. break;
  1425. default:
  1426. Raise_Error(_SC("attempt to delete a slot from a %s"),GetTypeName(self));
  1427. return false;
  1428. }
  1429. return true;
  1430. }
  1431. bool SQVM::Call(SQObjectPtr &closure,SQInteger nparams,SQInteger stackbase,SQObjectPtr &outres,SQBool raiseerror)
  1432. {
  1433. #ifdef _DEBUG
  1434. SQInteger prevstackbase = _stackbase;
  1435. #endif
  1436. switch(type(closure)) {
  1437. case OT_CLOSURE:
  1438. return Execute(closure, nparams, stackbase, outres, raiseerror);
  1439. break;
  1440. case OT_NATIVECLOSURE:{
  1441. bool suspend;
  1442. return CallNative(_nativeclosure(closure), nparams, stackbase, outres,suspend);
  1443. }
  1444. break;
  1445. case OT_CLASS: {
  1446. SQObjectPtr constr;
  1447. SQObjectPtr temp;
  1448. CreateClassInstance(_class(closure),outres,constr);
  1449. if(type(constr) != OT_NULL) {
  1450. _stack[stackbase] = outres;
  1451. return Call(constr,nparams,stackbase,temp,raiseerror);
  1452. }
  1453. return true;
  1454. }
  1455. break;
  1456. default:
  1457. return false;
  1458. }
  1459. #ifdef _DEBUG
  1460. if(!_suspended) {
  1461. assert(_stackbase == prevstackbase);
  1462. }
  1463. #endif
  1464. return true;
  1465. }
  1466. bool SQVM::CallMetaMethod(SQObjectPtr &closure,SQMetaMethod mm,SQInteger nparams,SQObjectPtr &outres)
  1467. {
  1468. //SQObjectPtr closure;
  1469. _nmetamethodscall++;
  1470. if(Call(closure, nparams, _top - nparams, outres, SQFalse)) {
  1471. _nmetamethodscall--;
  1472. Pop(nparams);
  1473. return true;
  1474. }
  1475. _nmetamethodscall--;
  1476. //}
  1477. Pop(nparams);
  1478. return false;
  1479. }
  1480. void SQVM::FindOuter(SQObjectPtr &target, SQObjectPtr *stackindex)
  1481. {
  1482. SQOuter **pp = &_openouters;
  1483. SQOuter *p;
  1484. SQOuter *otr;
  1485. while ((p = *pp) != NULL && p->_valptr >= stackindex) {
  1486. if (p->_valptr == stackindex) {
  1487. target = SQObjectPtr(p);
  1488. return;
  1489. }
  1490. pp = &p->_next;
  1491. }
  1492. otr = SQOuter::Create(_ss(this), stackindex);
  1493. otr->_next = *pp;
  1494. otr->_idx = (stackindex - _stack._vals);
  1495. __ObjAddRef(otr);
  1496. *pp = otr;
  1497. target = SQObjectPtr(otr);
  1498. }
  1499. bool SQVM::EnterFrame(SQInteger newbase, SQInteger newtop, bool tailcall)
  1500. {
  1501. if( !tailcall ) {
  1502. if( _callsstacksize == _alloccallsstacksize ) {
  1503. GrowCallStack();
  1504. }
  1505. ci = &_callsstack[_callsstacksize++];
  1506. ci->_prevstkbase = (SQInt32)(newbase - _stackbase);
  1507. ci->_prevtop = (SQInt32)(_top - _stackbase);
  1508. ci->_etraps = 0;
  1509. ci->_ncalls = 1;
  1510. ci->_generator = NULL;
  1511. ci->_root = SQFalse;
  1512. }
  1513. else {
  1514. ci->_ncalls++;
  1515. }
  1516. _stackbase = newbase;
  1517. _top = newtop;
  1518. if(newtop + MIN_STACK_OVERHEAD > (SQInteger)_stack.size()) {
  1519. if(_nmetamethodscall) {
  1520. Raise_Error(_SC("stack overflow, cannot resize stack while in a metamethod"));
  1521. return false;
  1522. }
  1523. _stack.resize(_stack.size() + (MIN_STACK_OVERHEAD << 2));
  1524. RelocateOuters();
  1525. }
  1526. return true;
  1527. }
  1528. void SQVM::LeaveFrame() {
  1529. SQInteger last_top = _top;
  1530. SQInteger last_stackbase = _stackbase;
  1531. SQInteger css = --_callsstacksize;
  1532. /* First clean out the call stack frame */
  1533. ci->_closure.Null();
  1534. _stackbase -= ci->_prevstkbase;
  1535. _top = _stackbase + ci->_prevtop;
  1536. ci = (css) ? &_callsstack[css-1] : NULL;
  1537. if(_openouters) CloseOuters(&(_stack._vals[last_stackbase]));
  1538. while (last_top >= _top) {
  1539. _stack._vals[last_top--].Null();
  1540. }
  1541. }
  1542. void SQVM::RelocateOuters()
  1543. {
  1544. SQOuter *p = _openouters;
  1545. while (p) {
  1546. p->_valptr = _stack._vals + p->_idx;
  1547. p = p->_next;
  1548. }
  1549. }
  1550. void SQVM::CloseOuters(SQObjectPtr *stackindex) {
  1551. SQOuter *p;
  1552. while ((p = _openouters) != NULL && p->_valptr >= stackindex) {
  1553. p->_value = *(p->_valptr);
  1554. p->_valptr = &p->_value;
  1555. _openouters = p->_next;
  1556. __ObjRelease(p);
  1557. }
  1558. }
  1559. #define CALC_PSEUDO_INDEX(n) n = (n >= 0)?n + _stackbase - 1:_top + n
  1560. void SQVM::Remove(SQInteger n) {
  1561. CALC_PSEUDO_INDEX(n);
  1562. for(SQInteger i = n; i < _top; ++i){
  1563. _stack[i] = _stack[i+1];
  1564. }
  1565. _stack[_top].Null();
  1566. _top--;
  1567. }
  1568. void SQVM::Replace(SQInteger n) {
  1569. CALC_PSEUDO_INDEX(n);
  1570. _stack[n] = _stack[_top-1];
  1571. _stack[_top].Null();
  1572. _top--;
  1573. }
  1574. void SQVM::ReplaceAbs(SQInteger n) {
  1575. _stack[n] = _stack[_top-1];
  1576. _stack[_top].Null();
  1577. _top--;
  1578. }
  1579. void SQVM::Insert(SQInteger n) {
  1580. //Todo revise this to emit error message when used with pseudo-index
  1581. if(n < 0) return; //nothing to do with pseudo-index
  1582. n += _stackbase - 1;
  1583. SQObjectPtr &old_top = _stack[_top];
  1584. for(SQInteger i = _top; i > n; --i){
  1585. _stack[i] = _stack[i-1];
  1586. }
  1587. _stack[n] = old_top;
  1588. }
  1589. void SQVM::Pop() {
  1590. _stack[--_top].Null();
  1591. }
  1592. void SQVM::Pop(SQInteger n) {
  1593. for(SQInteger i = 0; i < n; i++){
  1594. _stack[--_top].Null();
  1595. }
  1596. }
  1597. void SQVM::PushNull() { _stack[_top++].Null(); }
  1598. void SQVM::Push(const SQObjectPtr &o) { _stack[_top++] = o; }
  1599. SQObjectPtr &SQVM::Top() { return _stack[_top-1]; }
  1600. SQObjectPtr &SQVM::PopGet() { return _stack[--_top]; }
  1601. SQObjectPtr &SQVM::GetUp(SQInteger n) { return _stack[_top+n]; }
  1602. SQObjectPtr &SQVM::GetAt(SQInteger n) { return _stack[n]; }
  1603. #ifdef _DEBUG_DUMP
  1604. void SQVM::dumpstack(SQInteger stackbase,bool dumpall)
  1605. {
  1606. SQInteger size=dumpall?_stack.size():_top;
  1607. SQInteger n=0;
  1608. scprintf(_SC("\n>>>>stack dump<<<<\n"));
  1609. CallInfo &ci=_callsstack[_callsstacksize-1];
  1610. scprintf(_SC("IP: %p\n"),ci._ip);
  1611. scprintf(_SC("prev stack base: %d\n"),ci._prevstkbase);
  1612. scprintf(_SC("prev top: %d\n"),ci._prevtop);
  1613. for(SQInteger i=0;i<size;i++){
  1614. SQObjectPtr &obj=_stack[i];
  1615. if(stackbase==i)scprintf(_SC(">"));else scprintf(_SC(" "));
  1616. scprintf(_SC("[%d]:"),n);
  1617. switch(type(obj)){
  1618. case OT_FLOAT: scprintf(_SC("FLOAT %.3f"),_float(obj));break;
  1619. case OT_INTEGER: scprintf(_SC("INTEGER %d"),_integer(obj));break;
  1620. case OT_BOOL: scprintf(_SC("BOOL %s"),_integer(obj)?"true":"false");break;
  1621. case OT_STRING: scprintf(_SC("STRING %s"),_stringval(obj));break;
  1622. case OT_NULL: scprintf(_SC("NULL")); break;
  1623. case OT_TABLE: scprintf(_SC("TABLE %p[%p]"),_table(obj),_table(obj)->_delegate);break;
  1624. case OT_ARRAY: scprintf(_SC("ARRAY %p"),_array(obj));break;
  1625. case OT_CLOSURE: scprintf(_SC("CLOSURE [%p]"),_closure(obj));break;
  1626. case OT_NATIVECLOSURE: scprintf(_SC("NATIVECLOSURE"));break;
  1627. case OT_USERDATA: scprintf(_SC("USERDATA %p[%p]"),_userdataval(obj),_userdata(obj)->_delegate);break;
  1628. case OT_GENERATOR: scprintf(_SC("GENERATOR %p"),_generator(obj));break;
  1629. case OT_THREAD: scprintf(_SC("THREAD [%p]"),_thread(obj));break;
  1630. case OT_USERPOINTER: scprintf(_SC("USERPOINTER %p"),_userpointer(obj));break;
  1631. case OT_CLASS: scprintf(_SC("CLASS %p"),_class(obj));break;
  1632. case OT_INSTANCE: scprintf(_SC("INSTANCE %p"),_instance(obj));break;
  1633. case OT_WEAKREF: scprintf(_SC("WEAKERF %p"),_weakref(obj));break;
  1634. default:
  1635. assert(0);
  1636. break;
  1637. };
  1638. scprintf(_SC("\n"));
  1639. ++n;
  1640. }
  1641. }
  1642. #endif