sqvm.cpp 55 KB

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