sqvm.cpp 50 KB

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