sqvm.cpp 50 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761
  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: mm = MT_ADD; 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. const SQInstruction &_i_ = *ci->_ip++;
  647. //dumpstack(_stackbase);
  648. //scprintf("\n[%d] %s %d %d %d %d\n",ci->_ip-ci->_iv->_vals,g_InstrDesc[_i_.op].name,arg0,arg1,arg2,arg3);
  649. switch(_i_.op)
  650. {
  651. case _OP_LINE: if (_debughook) CallDebugHook(_SC('l'),arg1); continue;
  652. case _OP_LOAD: TARGET = ci->_literals[arg1]; continue;
  653. case _OP_LOADINT:
  654. #ifndef _SQ64
  655. TARGET = (SQInteger)arg1; continue;
  656. #else
  657. TARGET = (SQInteger)((SQUnsignedInteger32)arg1); continue;
  658. #endif
  659. case _OP_LOADFLOAT: TARGET = *((SQFloat *)&arg1); continue;
  660. case _OP_DLOAD: TARGET = ci->_literals[arg1]; STK(arg2) = ci->_literals[arg3];continue;
  661. case _OP_TAILCALL:{
  662. SQObjectPtr &t = STK(arg1);
  663. if (type(t) == OT_CLOSURE
  664. && (!_closure(t)->_function->_bgenerator)){
  665. SQObjectPtr clo = t;
  666. if(_openouters) CloseOuters(&(_stack._vals[_stackbase]));
  667. for (SQInteger i = 0; i < arg3; i++) STK(i) = STK(arg2 + i);
  668. _GUARD(StartCall(_closure(clo), ci->_target, arg3, _stackbase, true));
  669. continue;
  670. }
  671. }
  672. case _OP_CALL: {
  673. SQObjectPtr clo = STK(arg1);
  674. switch (type(clo)) {
  675. case OT_CLOSURE:
  676. _GUARD(StartCall(_closure(clo), sarg0, arg3, _stackbase+arg2, false));
  677. _sharedstate->CallDelayedReleaseHooks(this);
  678. continue;
  679. case OT_NATIVECLOSURE: {
  680. bool suspend;
  681. _GUARD(CallNative(_nativeclosure(clo), arg3, _stackbase+arg2, clo,suspend));
  682. if(suspend){
  683. _suspended = SQTrue;
  684. _suspended_target = sarg0;
  685. _suspended_root = ci->_root;
  686. _suspended_traps = traps;
  687. outres = clo;
  688. return true;
  689. }
  690. if(sarg0 != -1) {
  691. STK(arg0) = clo;
  692. }
  693. }
  694. continue;
  695. case OT_CLASS:{
  696. SQObjectPtr inst;
  697. _GUARD(CreateClassInstance(_class(clo),inst,clo));
  698. if(sarg0 != -1) {
  699. STK(arg0) = inst;
  700. }
  701. SQInteger stkbase;
  702. switch(type(clo)) {
  703. case OT_CLOSURE:
  704. stkbase = _stackbase+arg2;
  705. _stack._vals[stkbase] = inst;
  706. _GUARD(StartCall(_closure(clo), -1, arg3, stkbase, false));
  707. break;
  708. case OT_NATIVECLOSURE:
  709. bool suspend;
  710. stkbase = _stackbase+arg2;
  711. _stack._vals[stkbase] = inst;
  712. _GUARD(CallNative(_nativeclosure(clo), arg3, stkbase, clo,suspend));
  713. break;
  714. default: break; //shutup GCC 4.x
  715. }
  716. }
  717. break;
  718. case OT_TABLE:
  719. case OT_USERDATA:
  720. case OT_INSTANCE:{
  721. SQObjectPtr closure;
  722. if(_delegable(clo)->_delegate && _delegable(clo)->GetMetaMethod(this,MT_CALL,closure)) {
  723. Push(clo);
  724. for (SQInteger i = 0; i < arg3; i++) Push(STK(arg2 + i));
  725. if(!CallMetaMethod(closure, MT_CALL, arg3+1, clo)) SQ_THROW();
  726. if(sarg0 != -1) {
  727. STK(arg0) = clo;
  728. }
  729. break;
  730. }
  731. //Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
  732. //SQ_THROW();
  733. }
  734. default:
  735. Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
  736. SQ_THROW();
  737. }
  738. }
  739. continue;
  740. case _OP_PREPCALL:
  741. case _OP_PREPCALLK: {
  742. SQObjectPtr &key = _i_.op == _OP_PREPCALLK?(ci->_literals)[arg1]:STK(arg1);
  743. SQObjectPtr &o = STK(arg2);
  744. if (!Get(o, key, temp_reg,false,arg2)) {
  745. SQ_THROW();
  746. }
  747. STK(arg3) = o;
  748. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  749. }
  750. continue;
  751. case _OP_GETK:
  752. #ifndef NO_EXCEPTION_KEY_NOT_FOUND
  753. if (!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) { SQ_THROW();}
  754. #else
  755. //DAD instead of throw an exception return null
  756. if(!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) temp_reg.Null();
  757. #endif
  758. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  759. continue;
  760. case _OP_MOVE: TARGET = STK(arg1); continue;
  761. case _OP_NEWSLOT:
  762. _GUARD(NewSlot(STK(arg1), STK(arg2), STK(arg3),false));
  763. if(arg0 != 0xFF) TARGET = STK(arg3);
  764. continue;
  765. case _OP_DELETE: _GUARD(DeleteSlot(STK(arg1), STK(arg2), TARGET)); continue;
  766. case _OP_SET:
  767. if (!Set(STK(arg1), STK(arg2), STK(arg3),arg1)) { SQ_THROW(); }
  768. if (arg0 != 0xFF) TARGET = STK(arg3);
  769. continue;
  770. case _OP_GET:
  771. if (!Get(STK(arg1), STK(arg2), temp_reg, false,arg1)) { SQ_THROW(); }
  772. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  773. continue;
  774. case _OP_EQ:{
  775. bool res;
  776. if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
  777. TARGET = res?true:false;
  778. }continue;
  779. case _OP_NE:{
  780. bool res;
  781. if(!IsEqual(STK(arg2),COND_LITERAL,res)) { SQ_THROW(); }
  782. TARGET = (!res)?true:false;
  783. } continue;
  784. case _OP_ADD: _ARITH_(+,TARGET,STK(arg2),STK(arg1)); continue;
  785. case _OP_SUB: _ARITH_(-,TARGET,STK(arg2),STK(arg1)); continue;
  786. case _OP_MUL: _ARITH_(*,TARGET,STK(arg2),STK(arg1)); continue;
  787. case _OP_DIV: _ARITH_NOZERO(/,TARGET,STK(arg2),STK(arg1),_SC("division by zero")); continue;
  788. case _OP_MOD: ARITH_OP('%',TARGET,STK(arg2),STK(arg1)); continue;
  789. case _OP_BITW: _GUARD(BW_OP( arg3,TARGET,STK(arg2),STK(arg1))); continue;
  790. case _OP_RETURN:
  791. if((ci)->_generator) {
  792. (ci)->_generator->Kill();
  793. }
  794. if(Return(arg0, arg1, temp_reg)){
  795. assert(traps==0);
  796. //outres = temp_reg;
  797. _Swap(outres,temp_reg);
  798. return true;
  799. }
  800. continue;
  801. case _OP_LOADNULLS:{ for(SQInt32 n=0; n < arg1; n++) STK(arg0+n).Null(); }continue;
  802. case _OP_LOADROOT: TARGET = _roottable; continue;
  803. case _OP_LOADBOOL: TARGET = arg1?true:false; continue;
  804. case _OP_DMOVE: STK(arg0) = STK(arg1); STK(arg2) = STK(arg3); continue;
  805. case _OP_JMP: ci->_ip += (sarg1); continue;
  806. //case _OP_JNZ: if(!IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
  807. case _OP_JCMP:
  808. _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg0),temp_reg));
  809. if(IsFalse(temp_reg)) ci->_ip+=(sarg1);
  810. continue;
  811. case _OP_JZ: if(IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
  812. case _OP_GETOUTER: {
  813. SQClosure *cur_cls = _closure(ci->_closure);
  814. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  815. TARGET = *(otr->_valptr);
  816. }
  817. continue;
  818. case _OP_SETOUTER: {
  819. SQClosure *cur_cls = _closure(ci->_closure);
  820. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  821. *(otr->_valptr) = STK(arg2);
  822. if(arg0 != 0xFF) {
  823. TARGET = STK(arg2);
  824. }
  825. }
  826. continue;
  827. case _OP_NEWOBJ:
  828. switch(arg3) {
  829. case NOT_TABLE: TARGET = SQTable::Create(_ss(this), arg1); continue;
  830. case NOT_ARRAY: TARGET = SQArray::Create(_ss(this), 0); _array(TARGET)->Reserve(arg1); continue;
  831. case NOT_CLASS: _GUARD(CLASS_OP(TARGET,arg1,arg2)); continue;
  832. default: assert(0); continue;
  833. }
  834. case _OP_APPENDARRAY:
  835. {
  836. SQObject val;
  837. val._unVal.raw = 0;
  838. switch(arg2) {
  839. case AAT_STACK:
  840. val = STK(arg1); break;
  841. case AAT_LITERAL:
  842. val = ci->_literals[arg1]; break;
  843. case AAT_INT:
  844. val._type = OT_INTEGER;
  845. #ifndef _SQ64
  846. val._unVal.nInteger = (SQInteger)arg1;
  847. #else
  848. val._unVal.nInteger = (SQInteger)((SQUnsignedInteger32)arg1);
  849. #endif
  850. break;
  851. case AAT_FLOAT:
  852. val._type = OT_FLOAT;
  853. val._unVal.fFloat = *((SQFloat *)&arg1);
  854. break;
  855. case AAT_BOOL:
  856. val._type = OT_BOOL;
  857. val._unVal.nInteger = arg1;
  858. break;
  859. default: assert(0); break;
  860. }
  861. _array(STK(arg0))->Append(val); continue;
  862. }
  863. case _OP_COMPARITH: {
  864. SQInteger selfidx = (((SQUnsignedInteger)arg1&0xFFFF0000)>>16);
  865. _GUARD(DerefInc(arg3, TARGET, STK(selfidx), STK(arg2), STK(arg1&0x0000FFFF), false, selfidx));
  866. }
  867. continue;
  868. case _OP_INC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, false, arg1));} continue;
  869. case _OP_INCL: {
  870. SQObjectPtr &a = STK(arg1);
  871. if(type(a) == OT_INTEGER) {
  872. a._unVal.nInteger = _integer(a) + sarg3;
  873. }
  874. else {
  875. SQObjectPtr o(sarg3); //_GUARD(LOCAL_INC('+',TARGET, STK(arg1), o));
  876. _ARITH_(+,a,a,o);
  877. }
  878. } continue;
  879. case _OP_PINC: {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, true, arg1));} continue;
  880. case _OP_PINCL: {
  881. SQObjectPtr &a = STK(arg1);
  882. if(type(a) == OT_INTEGER) {
  883. TARGET = a;
  884. a._unVal.nInteger = _integer(a) + sarg3;
  885. }
  886. else {
  887. SQObjectPtr o(sarg3); _GUARD(PLOCAL_INC('+',TARGET, STK(arg1), o));
  888. }
  889. } continue;
  890. case _OP_CMP: _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg1),TARGET)) continue;
  891. case _OP_EXISTS: TARGET = Get(STK(arg1), STK(arg2), temp_reg, true,DONT_FALL_BACK)?true:false;continue;
  892. case _OP_INSTANCEOF:
  893. if(type(STK(arg1)) != OT_CLASS)
  894. {Raise_Error(_SC("cannot apply instanceof between a %s and a %s"),GetTypeName(STK(arg1)),GetTypeName(STK(arg2))); SQ_THROW();}
  895. TARGET = (type(STK(arg2)) == OT_INSTANCE) ? (_instance(STK(arg2))->InstanceOf(_class(STK(arg1)))?true:false) : false;
  896. continue;
  897. case _OP_AND:
  898. if(IsFalse(STK(arg2))) {
  899. TARGET = STK(arg2);
  900. ci->_ip += (sarg1);
  901. }
  902. continue;
  903. case _OP_OR:
  904. if(!IsFalse(STK(arg2))) {
  905. TARGET = STK(arg2);
  906. ci->_ip += (sarg1);
  907. }
  908. continue;
  909. case _OP_NEG: _GUARD(NEG_OP(TARGET,STK(arg1))); continue;
  910. case _OP_NOT: TARGET = IsFalse(STK(arg1)); continue;
  911. case _OP_BWNOT:
  912. if(type(STK(arg1)) == OT_INTEGER) {
  913. SQInteger t = _integer(STK(arg1));
  914. TARGET = SQInteger(~t);
  915. continue;
  916. }
  917. Raise_Error(_SC("attempt to perform a bitwise op on a %s"), GetTypeName(STK(arg1)));
  918. SQ_THROW();
  919. case _OP_CLOSURE: {
  920. SQClosure *c = ci->_closure._unVal.pClosure;
  921. SQFunctionProto *fp = c->_function;
  922. if(!CLOSURE_OP(TARGET,fp->_functions[arg1]._unVal.pFunctionProto)) { SQ_THROW(); }
  923. continue;
  924. }
  925. case _OP_YIELD:{
  926. if(ci->_generator) {
  927. if(sarg1 != MAX_FUNC_STACKSIZE) temp_reg = STK(arg1);
  928. _GUARD(ci->_generator->Yield(this,arg2));
  929. traps -= ci->_etraps;
  930. if(sarg1 != MAX_FUNC_STACKSIZE) _Swap(STK(arg1),temp_reg);//STK(arg1) = temp_reg;
  931. }
  932. else { Raise_Error(_SC("trying to yield a '%s',only genenerator can be yielded"), GetTypeName(ci->_generator)); SQ_THROW();}
  933. if(Return(arg0, arg1, temp_reg)){
  934. assert(traps == 0);
  935. outres = temp_reg;
  936. return true;
  937. }
  938. }
  939. continue;
  940. case _OP_RESUME:
  941. if(type(STK(arg1)) != OT_GENERATOR){ Raise_Error(_SC("trying to resume a '%s',only genenerator can be resumed"), GetTypeName(STK(arg1))); SQ_THROW();}
  942. _GUARD(_generator(STK(arg1))->Resume(this, TARGET));
  943. traps += ci->_etraps;
  944. continue;
  945. case _OP_FOREACH:{ int tojump;
  946. _GUARD(FOREACH_OP(STK(arg0),STK(arg2),STK(arg2+1),STK(arg2+2),arg2,sarg1,tojump));
  947. ci->_ip += tojump; }
  948. continue;
  949. case _OP_POSTFOREACH:
  950. assert(type(STK(arg0)) == OT_GENERATOR);
  951. if(_generator(STK(arg0))->_state == SQGenerator::eDead)
  952. ci->_ip += (sarg1 - 1);
  953. continue;
  954. case _OP_CLONE: _GUARD(Clone(STK(arg1), TARGET)); continue;
  955. case _OP_TYPEOF: _GUARD(TypeOf(STK(arg1), TARGET)) continue;
  956. case _OP_PUSHTRAP:{
  957. SQInstruction *_iv = _closure(ci->_closure)->_function->_instructions;
  958. _etraps.push_back(SQExceptionTrap(_top,_stackbase, &_iv[(ci->_ip-_iv)+arg1], arg0)); traps++;
  959. ci->_etraps++;
  960. }
  961. continue;
  962. case _OP_POPTRAP: {
  963. for(SQInteger i = 0; i < arg0; i++) {
  964. _etraps.pop_back(); traps--;
  965. ci->_etraps--;
  966. }
  967. }
  968. continue;
  969. case _OP_THROW: Raise_Error(TARGET); SQ_THROW(); continue;
  970. case _OP_NEWSLOTA:
  971. _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));
  972. continue;
  973. case _OP_GETBASE:{
  974. SQClosure *clo = _closure(ci->_closure);
  975. if(clo->_base) {
  976. TARGET = clo->_base;
  977. }
  978. else {
  979. TARGET.Null();
  980. }
  981. continue;
  982. }
  983. case _OP_CLOSE:
  984. if(_openouters) CloseOuters(&(STK(arg1)));
  985. continue;
  986. }
  987. }
  988. }
  989. exception_trap:
  990. {
  991. SQObjectPtr currerror = _lasterror;
  992. // dumpstack(_stackbase);
  993. // SQInteger n = 0;
  994. SQInteger last_top = _top;
  995. if(_ss(this)->_notifyallexceptions || (!traps && raiseerror)) CallErrorHandler(currerror);
  996. while( ci ) {
  997. if(ci->_etraps > 0) {
  998. SQExceptionTrap &et = _etraps.top();
  999. ci->_ip = et._ip;
  1000. _top = et._stacksize;
  1001. _stackbase = et._stackbase;
  1002. _stack._vals[_stackbase + et._extarget] = currerror;
  1003. _etraps.pop_back(); traps--; ci->_etraps--;
  1004. while(last_top >= _top) _stack._vals[last_top--].Null();
  1005. goto exception_restore;
  1006. }
  1007. else if (_debughook) {
  1008. //notify debugger of a "return"
  1009. //even if it really an exception unwinding the stack
  1010. for(SQInteger i = 0; i < ci->_ncalls; i++) {
  1011. CallDebugHook(_SC('r'));
  1012. }
  1013. }
  1014. if(ci->_generator) ci->_generator->Kill();
  1015. bool mustbreak = ci && ci->_root;
  1016. LeaveFrame();
  1017. if(mustbreak) break;
  1018. }
  1019. _lasterror = currerror;
  1020. return false;
  1021. }
  1022. assert(0);
  1023. }
  1024. bool SQVM::CreateClassInstance(SQClass *theclass, SQObjectPtr &inst, SQObjectPtr &constructor)
  1025. {
  1026. inst = theclass->CreateInstance();
  1027. if(!theclass->GetConstructor(constructor)) {
  1028. constructor.Null();
  1029. }
  1030. return true;
  1031. }
  1032. void SQVM::CallErrorHandler(SQObjectPtr &error)
  1033. {
  1034. if(type(_errorhandler) != OT_NULL) {
  1035. SQObjectPtr out;
  1036. Push(_roottable); Push(error);
  1037. Call(_errorhandler, 2, _top-2, out,SQFalse);
  1038. Pop(2);
  1039. }
  1040. }
  1041. void SQVM::CallDebugHook(SQInteger type,SQInteger forcedline)
  1042. {
  1043. _debughook = false;
  1044. SQFunctionProto *func=_closure(ci->_closure)->_function;
  1045. if(_debughook_native) {
  1046. const SQChar *src = type(func->_sourcename) == OT_STRING?_stringval(func->_sourcename):NULL;
  1047. const SQChar *fname = type(func->_name) == OT_STRING?_stringval(func->_name):NULL;
  1048. SQInteger line = forcedline?forcedline:func->GetLine(ci->_ip);
  1049. _debughook_native(this,type,src,line,fname);
  1050. }
  1051. else {
  1052. SQObjectPtr temp_reg;
  1053. SQInteger nparams=5;
  1054. Push(_roottable); Push(type); Push(func->_sourcename); Push(forcedline?forcedline:func->GetLine(ci->_ip)); Push(func->_name);
  1055. Call(_debughook_closure,nparams,_top-nparams,temp_reg,SQFalse);
  1056. Pop(nparams);
  1057. }
  1058. _debughook = true;
  1059. }
  1060. bool SQVM::CallNative(SQNativeClosure *nclosure, SQInteger nargs, SQInteger newbase, SQObjectPtr &retval, bool &suspend)
  1061. {
  1062. SQInteger nparamscheck = nclosure->_nparamscheck;
  1063. SQInteger newtop = newbase + nargs + nclosure->_noutervalues;
  1064. if (_nnativecalls + 1 > MAX_NATIVE_CALLS) {
  1065. Raise_Error(_SC("Native stack overflow"));
  1066. return false;
  1067. }
  1068. if(nparamscheck && (((nparamscheck > 0) && (nparamscheck != nargs)) ||
  1069. ((nparamscheck < 0) && (nargs < (-nparamscheck)))))
  1070. {
  1071. Raise_Error(_SC("wrong number of parameters"));
  1072. return false;
  1073. }
  1074. SQInteger tcs;
  1075. SQIntVec &tc = nclosure->_typecheck;
  1076. if((tcs = tc.size())) {
  1077. for(SQInteger i = 0; i < nargs && i < tcs; i++) {
  1078. if((tc._vals[i] != -1) && !(type(_stack._vals[newbase+i]) & tc._vals[i])) {
  1079. Raise_ParamTypeError(i,tc._vals[i],type(_stack._vals[newbase+i]));
  1080. return false;
  1081. }
  1082. }
  1083. }
  1084. if(!EnterFrame(newbase, newtop, false)) return false;
  1085. ci->_closure = nclosure;
  1086. SQInteger outers = nclosure->_noutervalues;
  1087. for (SQInteger i = 0; i < outers; i++) {
  1088. _stack._vals[newbase+nargs+i] = nclosure->_outervalues[i];
  1089. }
  1090. if(nclosure->_env) {
  1091. _stack._vals[newbase] = nclosure->_env->_obj;
  1092. }
  1093. _nnativecalls++;
  1094. SQInteger ret = (nclosure->_function)(this);
  1095. _nnativecalls--;
  1096. suspend = false;
  1097. if (ret == SQ_SUSPEND_FLAG) {
  1098. suspend = true;
  1099. }
  1100. else if (ret < 0) {
  1101. LeaveFrame();
  1102. Raise_Error(_lasterror);
  1103. return false;
  1104. }
  1105. if(ret) {
  1106. retval = _stack._vals[_top-1];
  1107. }
  1108. else {
  1109. retval.Null();
  1110. }
  1111. //retval = ret ? _stack._vals[_top-1] : _null_;
  1112. LeaveFrame();
  1113. return true;
  1114. }
  1115. #define FALLBACK_OK 0
  1116. #define FALLBACK_NO_MATCH 1
  1117. #define FALLBACK_ERROR 2
  1118. bool SQVM::Get(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest,bool raw, SQInteger selfidx)
  1119. {
  1120. switch(type(self)){
  1121. case OT_TABLE:
  1122. if(_table(self)->Get(key,dest))return true;
  1123. break;
  1124. case OT_ARRAY:
  1125. if(sq_isnumeric(key)) { if(_array(self)->Get(tointeger(key),dest)) { return true; } Raise_IdxError(key); return false; }
  1126. break;
  1127. case OT_INSTANCE:
  1128. if(_instance(self)->Get(key,dest)) return true;
  1129. break;
  1130. case OT_CLASS:
  1131. if(_class(self)->Get(key,dest)) return true;
  1132. break;
  1133. case OT_STRING:
  1134. if(sq_isnumeric(key)){
  1135. SQInteger n = tointeger(key);
  1136. if(abs((int)n) < _string(self)->_len) {
  1137. if(n < 0) n = _string(self)->_len - n;
  1138. dest = SQInteger(_stringval(self)[n]);
  1139. return true;
  1140. }
  1141. Raise_IdxError(key);
  1142. return false;
  1143. }
  1144. break;
  1145. default:break; //shut up compiler
  1146. }
  1147. if(!raw) {
  1148. switch(FallBackGet(self,key,dest)) {
  1149. case FALLBACK_OK: return true; //okie
  1150. case FALLBACK_NO_MATCH: break; //keep falling back
  1151. case FALLBACK_ERROR: return false; // the metamethod failed
  1152. }
  1153. if(InvokeDefaultDelegate(self,key,dest)) {
  1154. return true;
  1155. }
  1156. }
  1157. //#ifdef ROOT_FALLBACK
  1158. if(selfidx == 0) {
  1159. if(_table(_roottable)->Get(key,dest)) return true;
  1160. }
  1161. //#endif
  1162. Raise_IdxError(key);
  1163. return false;
  1164. }
  1165. bool SQVM::InvokeDefaultDelegate(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1166. {
  1167. SQTable *ddel = NULL;
  1168. switch(type(self)) {
  1169. case OT_CLASS: ddel = _class_ddel; break;
  1170. case OT_TABLE: ddel = _table_ddel; break;
  1171. case OT_ARRAY: ddel = _array_ddel; break;
  1172. case OT_STRING: ddel = _string_ddel; break;
  1173. case OT_INSTANCE: ddel = _instance_ddel; break;
  1174. case OT_INTEGER:case OT_FLOAT:case OT_BOOL: ddel = _number_ddel; break;
  1175. case OT_GENERATOR: ddel = _generator_ddel; break;
  1176. case OT_CLOSURE: case OT_NATIVECLOSURE: ddel = _closure_ddel; break;
  1177. case OT_THREAD: ddel = _thread_ddel; break;
  1178. case OT_WEAKREF: ddel = _weakref_ddel; break;
  1179. default: return false;
  1180. }
  1181. return ddel->Get(key,dest);
  1182. }
  1183. SQInteger SQVM::FallBackGet(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1184. {
  1185. switch(type(self)){
  1186. case OT_TABLE:
  1187. case OT_USERDATA:
  1188. //delegation
  1189. if(_delegable(self)->_delegate) {
  1190. if(Get(SQObjectPtr(_delegable(self)->_delegate),key,dest,false,DONT_FALL_BACK)) return FALLBACK_OK;
  1191. }
  1192. else {
  1193. return FALLBACK_NO_MATCH;
  1194. }
  1195. //go through
  1196. case OT_INSTANCE: {
  1197. SQObjectPtr closure;
  1198. if(_delegable(self)->GetMetaMethod(this, MT_GET, closure)) {
  1199. Push(self);Push(key);
  1200. _nmetamethodscall++;
  1201. AutoDec ad(&_nmetamethodscall);
  1202. if(Call(closure, 2, _top - 2, dest, SQFalse)) {
  1203. Pop(2);
  1204. return FALLBACK_OK;
  1205. }
  1206. else {
  1207. Pop(2);
  1208. if(type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1209. return FALLBACK_ERROR;
  1210. }
  1211. }
  1212. }
  1213. }
  1214. break;
  1215. default: break;//shutup GCC 4.x
  1216. }
  1217. // no metamethod or no fallback type
  1218. return FALLBACK_NO_MATCH;
  1219. }
  1220. bool SQVM::Set(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,SQInteger selfidx)
  1221. {
  1222. switch(type(self)){
  1223. case OT_TABLE:
  1224. if(_table(self)->Set(key,val)) return true;
  1225. break;
  1226. case OT_INSTANCE:
  1227. if(_instance(self)->Set(key,val)) return true;
  1228. break;
  1229. case OT_ARRAY:
  1230. if(!sq_isnumeric(key)) { Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key)); return false; }
  1231. if(!_array(self)->Set(tointeger(key),val)) {
  1232. Raise_IdxError(key);
  1233. return false;
  1234. }
  1235. return true;
  1236. default:
  1237. Raise_Error(_SC("trying to set '%s'"),GetTypeName(self));
  1238. return false;
  1239. }
  1240. switch(FallBackSet(self,key,val)) {
  1241. case FALLBACK_OK: return true; //okie
  1242. case FALLBACK_NO_MATCH: break; //keep falling back
  1243. case FALLBACK_ERROR: return false; // the metamethod failed
  1244. }
  1245. if(selfidx == 0) {
  1246. if(_table(_roottable)->Set(key,val))
  1247. return true;
  1248. }
  1249. Raise_IdxError(key);
  1250. return false;
  1251. }
  1252. SQInteger SQVM::FallBackSet(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val)
  1253. {
  1254. switch(type(self)) {
  1255. case OT_TABLE:
  1256. if(_table(self)->_delegate) {
  1257. if(Set(_table(self)->_delegate,key,val,DONT_FALL_BACK)) return FALLBACK_OK;
  1258. }
  1259. //keps on going
  1260. case OT_INSTANCE:
  1261. case OT_USERDATA:{
  1262. SQObjectPtr closure;
  1263. SQObjectPtr t;
  1264. if(_delegable(self)->GetMetaMethod(this, MT_SET, closure)) {
  1265. Push(self);Push(key);Push(val);
  1266. _nmetamethodscall++;
  1267. AutoDec ad(&_nmetamethodscall);
  1268. if(Call(closure, 3, _top - 3, t, SQFalse)) {
  1269. Pop(3);
  1270. return FALLBACK_OK;
  1271. }
  1272. else {
  1273. if(type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1274. //error
  1275. Pop(3);
  1276. return FALLBACK_ERROR;
  1277. }
  1278. }
  1279. }
  1280. }
  1281. break;
  1282. default: break;//shutup GCC 4.x
  1283. }
  1284. // no metamethod or no fallback type
  1285. return FALLBACK_NO_MATCH;
  1286. }
  1287. bool SQVM::Clone(const SQObjectPtr &self,SQObjectPtr &target)
  1288. {
  1289. SQObjectPtr temp_reg;
  1290. SQObjectPtr newobj;
  1291. switch(type(self)){
  1292. case OT_TABLE:
  1293. newobj = _table(self)->Clone();
  1294. goto cloned_mt;
  1295. case OT_INSTANCE: {
  1296. newobj = _instance(self)->Clone(_ss(this));
  1297. cloned_mt:
  1298. SQObjectPtr closure;
  1299. if(_delegable(newobj)->_delegate && _delegable(newobj)->GetMetaMethod(this,MT_CLONED,closure)) {
  1300. Push(newobj);
  1301. Push(self);
  1302. if(!CallMetaMethod(closure,MT_CLONED,2,temp_reg))
  1303. return false;
  1304. }
  1305. }
  1306. target = newobj;
  1307. return true;
  1308. case OT_ARRAY:
  1309. target = _array(self)->Clone();
  1310. return true;
  1311. default:
  1312. Raise_Error(_SC("cloning a %s"), GetTypeName(self));
  1313. return false;
  1314. }
  1315. }
  1316. bool SQVM::NewSlotA(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,const SQObjectPtr &attrs,bool bstatic,bool raw)
  1317. {
  1318. if(type(self) != OT_CLASS) {
  1319. Raise_Error(_SC("object must be a class"));
  1320. return false;
  1321. }
  1322. SQClass *c = _class(self);
  1323. if(!raw) {
  1324. SQObjectPtr &mm = c->_metamethods[MT_NEWMEMBER];
  1325. if(type(mm) != OT_NULL ) {
  1326. Push(self); Push(key); Push(val);
  1327. Push(attrs);
  1328. Push(bstatic);
  1329. return CallMetaMethod(mm,MT_NEWMEMBER,5,temp_reg);
  1330. }
  1331. }
  1332. if(!NewSlot(self, key, val,bstatic))
  1333. return false;
  1334. if(type(attrs) != OT_NULL) {
  1335. c->SetAttributes(key,attrs);
  1336. }
  1337. return true;
  1338. }
  1339. bool SQVM::NewSlot(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,bool bstatic)
  1340. {
  1341. if(type(key) == OT_NULL) { Raise_Error(_SC("null cannot be used as index")); return false; }
  1342. switch(type(self)) {
  1343. case OT_TABLE: {
  1344. bool rawcall = true;
  1345. if(_table(self)->_delegate) {
  1346. SQObjectPtr res;
  1347. if(!_table(self)->Get(key,res)) {
  1348. SQObjectPtr closure;
  1349. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1350. Push(self);Push(key);Push(val);
  1351. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1352. return false;
  1353. }
  1354. rawcall = false;
  1355. }
  1356. else {
  1357. rawcall = true;
  1358. }
  1359. }
  1360. }
  1361. if(rawcall) _table(self)->NewSlot(key,val); //cannot fail
  1362. break;}
  1363. case OT_INSTANCE: {
  1364. SQObjectPtr res;
  1365. SQObjectPtr closure;
  1366. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1367. Push(self);Push(key);Push(val);
  1368. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1369. return false;
  1370. }
  1371. break;
  1372. }
  1373. Raise_Error(_SC("class instances do not support the new slot operator"));
  1374. return false;
  1375. break;}
  1376. case OT_CLASS:
  1377. if(!_class(self)->NewSlot(_ss(this),key,val,bstatic)) {
  1378. if(_class(self)->_locked) {
  1379. Raise_Error(_SC("trying to modify a class that has already been instantiated"));
  1380. return false;
  1381. }
  1382. else {
  1383. SQObjectPtr oval = PrintObjVal(key);
  1384. Raise_Error(_SC("the property '%s' already exists"),_stringval(oval));
  1385. return false;
  1386. }
  1387. }
  1388. break;
  1389. default:
  1390. Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key));
  1391. return false;
  1392. break;
  1393. }
  1394. return true;
  1395. }
  1396. bool SQVM::DeleteSlot(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &res)
  1397. {
  1398. switch(type(self)) {
  1399. case OT_TABLE:
  1400. case OT_INSTANCE:
  1401. case OT_USERDATA: {
  1402. SQObjectPtr t;
  1403. //bool handled = false;
  1404. SQObjectPtr closure;
  1405. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_DELSLOT,closure)) {
  1406. Push(self);Push(key);
  1407. return CallMetaMethod(closure,MT_DELSLOT,2,res);
  1408. }
  1409. else {
  1410. if(type(self) == OT_TABLE) {
  1411. if(_table(self)->Get(key,t)) {
  1412. _table(self)->Remove(key);
  1413. }
  1414. else {
  1415. Raise_IdxError((SQObject &)key);
  1416. return false;
  1417. }
  1418. }
  1419. else {
  1420. Raise_Error(_SC("cannot delete a slot from %s"),GetTypeName(self));
  1421. return false;
  1422. }
  1423. }
  1424. res = t;
  1425. }
  1426. break;
  1427. default:
  1428. Raise_Error(_SC("attempt to delete a slot from a %s"),GetTypeName(self));
  1429. return false;
  1430. }
  1431. return true;
  1432. }
  1433. bool SQVM::Call(SQObjectPtr &closure,SQInteger nparams,SQInteger stackbase,SQObjectPtr &outres,SQBool raiseerror)
  1434. {
  1435. #ifdef _DEBUG
  1436. SQInteger prevstackbase = _stackbase;
  1437. #endif
  1438. switch(type(closure)) {
  1439. case OT_CLOSURE:
  1440. return Execute(closure, nparams, stackbase, outres, raiseerror);
  1441. break;
  1442. case OT_NATIVECLOSURE:{
  1443. bool suspend;
  1444. return CallNative(_nativeclosure(closure), nparams, stackbase, outres,suspend);
  1445. }
  1446. break;
  1447. case OT_CLASS: {
  1448. SQObjectPtr constr;
  1449. SQObjectPtr temp;
  1450. CreateClassInstance(_class(closure),outres,constr);
  1451. if(type(constr) != OT_NULL) {
  1452. _stack[stackbase] = outres;
  1453. return Call(constr,nparams,stackbase,temp,raiseerror);
  1454. }
  1455. return true;
  1456. }
  1457. break;
  1458. default:
  1459. return false;
  1460. }
  1461. #ifdef _DEBUG
  1462. if(!_suspended) {
  1463. assert(_stackbase == prevstackbase);
  1464. }
  1465. #endif
  1466. return true;
  1467. }
  1468. bool SQVM::CallMetaMethod(SQObjectPtr &closure,SQMetaMethod mm,SQInteger nparams,SQObjectPtr &outres)
  1469. {
  1470. //SQObjectPtr closure;
  1471. _nmetamethodscall++;
  1472. if(Call(closure, nparams, _top - nparams, outres, SQFalse)) {
  1473. _nmetamethodscall--;
  1474. Pop(nparams);
  1475. return true;
  1476. }
  1477. _nmetamethodscall--;
  1478. //}
  1479. Pop(nparams);
  1480. return false;
  1481. }
  1482. void SQVM::FindOuter(SQObjectPtr &target, SQObjectPtr *stackindex)
  1483. {
  1484. SQOuter **pp = &_openouters;
  1485. SQOuter *p;
  1486. SQOuter *otr;
  1487. while ((p = *pp) != NULL && p->_valptr >= stackindex) {
  1488. if (p->_valptr == stackindex) {
  1489. target = SQObjectPtr(p);
  1490. return;
  1491. }
  1492. pp = &p->_next;
  1493. }
  1494. otr = SQOuter::Create(_ss(this), stackindex);
  1495. otr->_next = *pp;
  1496. otr->_idx = (stackindex - _stack._vals);
  1497. __ObjAddRef(otr);
  1498. *pp = otr;
  1499. target = SQObjectPtr(otr);
  1500. }
  1501. bool SQVM::EnterFrame(SQInteger newbase, SQInteger newtop, bool tailcall)
  1502. {
  1503. if( !tailcall ) {
  1504. if( _callsstacksize == _alloccallsstacksize ) {
  1505. GrowCallStack();
  1506. }
  1507. ci = &_callsstack[_callsstacksize++];
  1508. ci->_prevstkbase = (SQInt32)(newbase - _stackbase);
  1509. ci->_prevtop = (SQInt32)(_top - _stackbase);
  1510. ci->_etraps = 0;
  1511. ci->_ncalls = 1;
  1512. ci->_generator = NULL;
  1513. ci->_root = SQFalse;
  1514. }
  1515. else {
  1516. ci->_ncalls++;
  1517. }
  1518. _stackbase = newbase;
  1519. _top = newtop;
  1520. if(newtop + MIN_STACK_OVERHEAD > (SQInteger)_stack.size()) {
  1521. if(_nmetamethodscall) {
  1522. Raise_Error(_SC("stack overflow, cannot resize stack while in a metamethod"));
  1523. return false;
  1524. }
  1525. _stack.resize(_stack.size() + (MIN_STACK_OVERHEAD << 2));
  1526. RelocateOuters();
  1527. }
  1528. return true;
  1529. }
  1530. void SQVM::LeaveFrame() {
  1531. SQInteger last_top = _top;
  1532. SQInteger last_stackbase = _stackbase;
  1533. SQInteger css = --_callsstacksize;
  1534. /* First clean out the call stack frame */
  1535. ci->_closure.Null();
  1536. _stackbase -= ci->_prevstkbase;
  1537. _top = _stackbase + ci->_prevtop;
  1538. ci = (css) ? &_callsstack[css-1] : NULL;
  1539. if(_openouters) CloseOuters(&(_stack._vals[last_stackbase]));
  1540. while (last_top >= _top) {
  1541. _stack._vals[last_top--].Null();
  1542. }
  1543. }
  1544. void SQVM::RelocateOuters()
  1545. {
  1546. SQOuter *p = _openouters;
  1547. while (p) {
  1548. p->_valptr = _stack._vals + p->_idx;
  1549. p = p->_next;
  1550. }
  1551. }
  1552. void SQVM::CloseOuters(SQObjectPtr *stackindex) {
  1553. SQOuter *p;
  1554. while ((p = _openouters) != NULL && p->_valptr >= stackindex) {
  1555. p->_value = *(p->_valptr);
  1556. p->_valptr = &p->_value;
  1557. _openouters = p->_next;
  1558. __ObjRelease(p);
  1559. }
  1560. }
  1561. #define CALC_PSEUDO_INDEX(n) n = (n >= 0)?n + _stackbase - 1:_top + n
  1562. void SQVM::Remove(SQInteger n) {
  1563. CALC_PSEUDO_INDEX(n);
  1564. for(SQInteger i = n; i < _top; ++i){
  1565. _stack[i] = _stack[i+1];
  1566. }
  1567. _stack[_top].Null();
  1568. _top--;
  1569. }
  1570. void SQVM::Replace(SQInteger n) {
  1571. CALC_PSEUDO_INDEX(n);
  1572. _stack[n] = _stack[_top-1];
  1573. _stack[_top].Null();
  1574. _top--;
  1575. }
  1576. void SQVM::ReplaceAbs(SQInteger n) {
  1577. _stack[n] = _stack[_top-1];
  1578. _stack[_top].Null();
  1579. _top--;
  1580. }
  1581. void SQVM::Insert(SQInteger n) {
  1582. //Todo revise this to emit error message when used with pseudo-index
  1583. if(n < 0) return; //nothing to do with pseudo-index
  1584. n += _stackbase - 1;
  1585. SQObjectPtr &old_top = _stack[_top];
  1586. for(SQInteger i = _top; i > n; --i){
  1587. _stack[i] = _stack[i-1];
  1588. }
  1589. _stack[n] = old_top;
  1590. }
  1591. void SQVM::Pop() {
  1592. _stack[--_top].Null();
  1593. }
  1594. void SQVM::Pop(SQInteger n) {
  1595. for(SQInteger i = 0; i < n; i++){
  1596. _stack[--_top].Null();
  1597. }
  1598. }
  1599. void SQVM::PushNull() { _stack[_top++].Null(); }
  1600. void SQVM::Push(const SQObjectPtr &o) { _stack[_top++] = o; }
  1601. SQObjectPtr &SQVM::Top() { return _stack[_top-1]; }
  1602. SQObjectPtr &SQVM::PopGet() { return _stack[--_top]; }
  1603. SQObjectPtr &SQVM::GetUp(SQInteger n) { return _stack[_top+n]; }
  1604. SQObjectPtr &SQVM::GetAt(SQInteger n) { return _stack[n]; }
  1605. #ifdef _DEBUG_DUMP
  1606. void SQVM::dumpstack(SQInteger stackbase,bool dumpall)
  1607. {
  1608. SQInteger size=dumpall?_stack.size():_top;
  1609. SQInteger n=0;
  1610. scprintf(_SC("\n>>>>stack dump<<<<\n"));
  1611. CallInfo &ci=_callsstack[_callsstacksize-1];
  1612. scprintf(_SC("IP: %p\n"),ci._ip);
  1613. scprintf(_SC("prev stack base: %d\n"),ci._prevstkbase);
  1614. scprintf(_SC("prev top: %d\n"),ci._prevtop);
  1615. for(SQInteger i=0;i<size;i++){
  1616. SQObjectPtr &obj=_stack[i];
  1617. if(stackbase==i)scprintf(_SC(">"));else scprintf(_SC(" "));
  1618. scprintf(_SC("[%d]:"),n);
  1619. switch(type(obj)){
  1620. case OT_FLOAT: scprintf(_SC("FLOAT %.3f"),_float(obj));break;
  1621. case OT_INTEGER: scprintf(_SC("INTEGER %d"),_integer(obj));break;
  1622. case OT_BOOL: scprintf(_SC("BOOL %s"),_integer(obj)?"true":"false");break;
  1623. case OT_STRING: scprintf(_SC("STRING %s"),_stringval(obj));break;
  1624. case OT_NULL: scprintf(_SC("NULL")); break;
  1625. case OT_TABLE: scprintf(_SC("TABLE %p[%p]"),_table(obj),_table(obj)->_delegate);break;
  1626. case OT_ARRAY: scprintf(_SC("ARRAY %p"),_array(obj));break;
  1627. case OT_CLOSURE: scprintf(_SC("CLOSURE [%p]"),_closure(obj));break;
  1628. case OT_NATIVECLOSURE: scprintf(_SC("NATIVECLOSURE"));break;
  1629. case OT_USERDATA: scprintf(_SC("USERDATA %p[%p]"),_userdataval(obj),_userdata(obj)->_delegate);break;
  1630. case OT_GENERATOR: scprintf(_SC("GENERATOR %p"),_generator(obj));break;
  1631. case OT_THREAD: scprintf(_SC("THREAD [%p]"),_thread(obj));break;
  1632. case OT_USERPOINTER: scprintf(_SC("USERPOINTER %p"),_userpointer(obj));break;
  1633. case OT_CLASS: scprintf(_SC("CLASS %p"),_class(obj));break;
  1634. case OT_INSTANCE: scprintf(_SC("INSTANCE %p"),_instance(obj));break;
  1635. case OT_WEAKREF: scprintf(_SC("WEAKERF %p"),_weakref(obj));break;
  1636. default:
  1637. assert(0);
  1638. break;
  1639. };
  1640. scprintf(_SC("\n"));
  1641. ++n;
  1642. }
  1643. }
  1644. #endif