sqvm.cpp 50 KB

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