sqvm.cpp 56 KB

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