2
0

sqvm.cpp 50 KB

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