sqvm.cpp 50 KB

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