sqvm.cpp 49 KB

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