sqvm.cpp 59 KB

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