sqvm.cpp 58 KB

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