sqvm.cpp 53 KB

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